Educative: AI-Powered Interactive Courses for Developers

Back To Module Home

0% completed

Algorithmic Paradigms

Brute Force Greedy Algorithms Divide and Conquer Dynamic Programming

Searching and Sorting

Selection Sort, Bubble Sort, and Insertion Sort Merge Sort Quicksort Time Complexities of Sorting Algorithms (Overview)Searching Algorithms Challenge: Find Two Numbers that Add up to "n"Solution: Find Two Numbers that Add up to "n"Challenge: Search in a Rotated Array Solution: Search in a Rotated Array Challenge: Find the Median of Two Sorted Arrays Solution: Find the Median of Two Sorted Arrays Challenge: Find Duplicates in Array Solution: Find Duplicates in Array Challenge: Search in Sorted Matrix Solution: Search in Sorted Matrix Challenge: Count Element Occurrence Solution: Count Element Occurrence Challenge: Search Insert Position Solution: Search Insert Position Challenge: Sparse Search Solution: Sparse Search Challenge: Dutch National Flag Problem Solution: Dutch National Flag Problem Quiz on Sorting & Searching

Graph Algorithms

Introduction to Graph Algorithms and Implementation Challenge 1: Implement Breadth First Search Solution Review: Implement Breadth First Search Challenge 2: Implement Depth-First Search Solution Review: Implement Depth-First Search Challenge 3: Calculate the Number of Nodes in a Given Graph Level Solution: Number of Nodes in a Given Graph Level Challenge 4: Print the Transpose of a Graph Solution Review: Print the Transpose of a Graph Challenge 5: Count the Paths Between Two Nodes Solution Review: Count the Paths Between Two Nodes Challenge 6: Check if a Graph is Strongly Connected Solution Review: Check if a Graph is Strongly Connected Challenge 7: Print all the Connected Components in a Graph Solution Review: Print all the Connected Components of a Graph Challenge 8: Removing a Given Edge Solution Review: Removing an Edge Challenge 9: Check If Given Graph is Bipartite Solution Review: Check if a Given Graph is Bipartite Quiz on Graph Algorithms

Greedy Algorithms

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 Cost Solution 2: Connecting 'n' Pipes with Minimum Cost Problem 3: Find the Egyptian Fraction Solution 3: Find the Egyptian Fraction Problem 4: Minimum Number of Platforms Required for Train Station Solution 4: Minimum Number of Platforms Required for TrainStation Problem 7: Find the Largest Number Solution 7: Find the Largest Number Quick Quiz!

Dynamic Programming

Fibonacci Series Using Recursion

Introducing Dynamic Programming With Fibonacci Numbers

Memoizing Fibonacci Numbers

Tabulating Fibonacci Numbers

Challenge: The 0/1 Knapsack Problem

Solution: The 0/1 Knapsack Problem

Challenge 4: Longest Common Substring

Solution Review: Longest Common Substring

Challenge: Shortest Common Supersequence

Solution Review: Shortest Common Supersequence

Challenge 6: Longest Palindromic Subsequence

Solution Review: Longest Palindromic Subsequence

Challenge 7: The Coin Change Problem

Solution Review: Coin Change Problem

Challenge 8: Egg Dropping Problem

Solution Review: Egg Dropping Problem

Challenge 9: Strings Interleaving

Solution Review: Strings Interleaving

Challenge: Edit Distance Problem

Solution Review: The Edit Distance Problem

Quiz on Dynamic Programming

Divide and Conquer

Introduction to Divide and Conquer with Binary Search Pascal's Triangle Challenge 1: Euclidean Algorithm Solution Review 1: Euclidean Algorithm Challenge 2: Peak Element Solution Review 2: Peak Element Challenge 4: Missing Number in Sorted Array Solution Review 4: Missing Number in Sorted Array Challenge 5: Find the Closest Number Solution Review 5: Find the Closest Number Challenge 6: Shuffle Integers Solution Review 6: Shuffle Integers Challenge 7: Collect Coins in Minimum Steps Solution Review 7: Collect Coins in Minimum Steps Challenge 8: Merge a Number of Sorted Arrays Solution Review 8: Merge a Number of Sorted Arrays Challenge 9: Find the Floor and Ceiling of a Number Solution Review 9: Find the Floor and Ceil of a Number Challenge 10: Inversion Count in an Array Solution Review 10: Inversion Count in an Array Quiz on Divide and Conquer

Conclusion

...

/

Untitled Masterpiece

Let's solve the famous egg dropping problem!

Problem statement

Given a tall skyscraper and a few eggs, write a function to figure out how many tries it would take to figure out which floor of the skyscraper the eggs can be dropped from ...