151 Lessons

17 Quizzes

50 Challenges

142 Playgrounds

458 Illustrations

Algorithms are one of the most common themes in coding interviews, so having a firm grip on them can be the difference between being hired or not. After this comprehensive course in Java, one of the most popular coding languages, you'll have an in-depth understanding of different algor...

Hands-on coding environments

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

Built in assessments let you test your skills. Completion certificates let you show them off.

Hands-on coding environments

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

Built in assessments let you test your skills. Completion certificates let you show them off.

Comparing AlgorithmsExample 1: Measuring Time Complexity of a Single Loop AlgorithmExample 2: Time Complexity of an Algorithm With Nested LoopsIntroduction to Asymptotic Analysis and Big OOther Common Asymptotic Notations and Why Big O Trumps ThemUseful FormulaeCommon Complexity ScenariosChallenge 1: Big (O) of Nested Loop with AdditionSolution Review: Big O of a Nested Loop with AdditionChallenge 2: Big (O) of Nested Loop with SubtractionSolution Review: Big O of a Nested Loop with SubtractionChallenge 3: Big O of Nested Loop with MultiplicationSolution Review: Big O of Nested Loop with MultiplicationChallenge 4: Nested Loop with Multiplication (Basic)Solution Review: Nested Loop with Multiplication (Basic)Challenge 5: Nested Loop with Multiplication (Intermediate)Solution Review: Nested Loop with Multiplication (Intermediate)Challenge 6: Nested Loop with Multiplication (Advanced)Solution Review: Nested Loop with Multiplication (Advanced)Challenge 7: Nested Loop with Multiplication (Pro)Solution Review: Nested Loop with Multiplication (Pro)Complexity Interview Questions

Selection Sort, Bubble Sort, and Insertion SortMerge SortQuicksortTime Complexities of Sorting Algorithms (Overview)Searching AlgorithmsChallenge 1: Find Two Numbers that Add up to "n"Solution Review: Find Two Numbers that Add up to "n"Challenge 2: Search in a Rotated ArraySolution Review: Search in a Rotated ArrayChallenge 3: Group AnagramsSolution Review: Group AnagramsChallenge 4: Find the Median of Two Sorted ArraysSolution Review: Find the Median of Two Sorted ArraysChallenge 5: Find Duplicates in ArraySolution Review: Find Duplicates in ArrayChallenge 6: Search in Sorted MatrixSolution Review: Search in Sorted MatrixChallenge 7: Count Element OccurrenceSolution Review: Count Element OccurrenceChallenge 8: Search Insert PositionSolution Review: Search Insert PositionChallenge 9: Sparse SearchSolution Review: Sparse SearchChallenge 10: Dutch National Flag ProblemSolution Review: Dutch National Flag ProblemQuiz on Sorting & Searching

Fibonacci Series Using RecursionIntroducing Dynamic Programming With Fibonacci NumbersMemoizing Fibonacci NumbersTabulating Fibonacci NumbersChallenge 1: The 0/1 Knapsack ProblemSolution Review: The 0/1 Knapsack ProblemChallenge 2: Staircase ProblemSolution Review: Staircase ProblemChallenge 3: The Partition ProblemSolution Review: The Partition ProblemChallenge 4: Longest Common SubstringSolution Review: Longest Common SubstringChallenge 5: Shortest Common SupersequenceSolution Review: Shortest Common SupersequenceChallenge 6: Longest Palindromic SubsequenceSolution Review: Longest Palindromic SubsequenceChallenge 7: The Coin Change ProblemSolution Review: Coin Change ProblemChallenge 8: Egg Dropping ProblemSolution Review: Egg Dropping ProblemChallenge 9: Strings InterleavingSolution Review: Strings InterleavingChallenge 10: Edit Distance ProblemSolution Review: The Edit Distance ProblemQuiz on Dynamic Programming

What is a Greedy Approach?Problem 1: Make a Change Machine!Solution 1: Make Your own Change Machine!Problem 2: Connecting 'n' Pipes with Minimum CostSolution 2: Connecting 'n' Pipes with Minimum CostProblem 3: Find the Egyptian FractionSolution 3: Find the Egyptian FractionProblem 4: Minimum Number of Platforms Required for Train StationSolution 4: Minimum Number of Platforms Required for TrainStationProblem 5: Help the Police Officers Catch the Thieves!Solution 5: Help the Police Officers Catch the Thieves!Problem 6: Fractional KnapsackSolution 6: Fractional Knapsack ProblemProblem 7: Find the Largest NumberSolution 7: Find the Largest NumberProblem 8: Color the Graph!Solution 8: Color the Graph!Problem 9: Find the Minimum Spanning TreeSolution 9: Kruskal’s Minimum Spanning TreeQuick Quiz!

Introduction to Divide and Conquer with Binary SearchPascal's TriangleChallenge 1: Euclidean AlgorithmSolution Review 1: Euclidean AlgorithmChallenge 2: Peak ElementSolution Review 2: Peak ElementChallenge 3: Maximum Subarray SumSolution Review 3: Maximum Subarray SumChallenge 4: Missing Number in Sorted ArraySolution Review 4: Missing Number in Sorted ArrayChallenge 5: Find the Closest NumberSolution Review 5: Find the Closest NumberChallenge 6: Shuffle IntegersSolution Review 6: Shuffle IntegersChallenge 7: Collect Coins in Minimum StepsSolution Review 7: Collect Coins in Minimum StepsChallenge 8: Merge a Number of Sorted ArraysSolution Review 8: Merge a Number of Sorted ArraysChallenge 9: Find the Floor and Ceiling of a NumberSolution Review 9: Find the Floor and Ceil of a NumberChallenge 10: Inversion Count in an ArraySolution Review 10: Inversion Count in an ArrayQuiz on Divide and Conquer

Introduction to Graph Algorithms and ImplementationChallenge 1: Implement Breadth First SearchSolution Review: Implement Breadth First SearchChallenge 2: Implement Depth-First SearchSolution Review: Implement Depth-First SearchChallenge 3: Calculate the Number of Nodes in a Given Graph LevelSolution Review: Number of Nodes in a Given Graph LevelChallenge 4: Print the Transpose of a GraphSolution Review: Print the Transpose of a GraphChallenge 5: Count the Paths Between Two NodesSolution Review: Count the Paths Between Two NodesChallenge 6: Check if a Graph is Strongly ConnectedSolution Review: Check if a Graph is Strongly ConnectedChallenge 7: Print all the Connected Components in a GraphSolution Review: Print all the Connected Components of a GraphChallenge 8: Removing a Given EdgeSolution Review: Removing an EdgeChallenge 9: Check If Given Graph is BipartiteSolution Review: Check if a Given Graph is BipartiteChallenge 10: Topological Sorting of a GraphSolution Review: Topological Sorting of a GraphQuiz on Graph Algorithms

Recommended before you start this course

Recommended before you start this course

Recommended before you start this course

Recommended after you finish this course

Recommended after you finish this course

Recommended after you finish this course

COURSE BY:

Coderust

Teams of every size choose

Educative for Business

to train, upskill & onboard their developers