Algorithms

Master fundamental and advanced algorithms essential for technical interviews at top companies. This category covers sorting algorithms, search algorithms, graph algorithms, and optimization techniques that form the foundation of computer science problem-solving.

What You’ll Learn:

Sorting algorithms: Quick sort, merge sort, heap sort
Search techniques: Binary search and variations
Graph algorithms: DFS, BFS, Dijkstra’s, topological sort
Optimization: Dynamic programming, greedy algorithms
Time and space complexity analysis

Difficulty Progression: Start with basic sorting and searching, then progress to graph algorithms and dynamic programming.

Interview Frequency: Extremely high – algorithms appear in 80%+ of technical interviews at Google, Amazon, Facebook, Microsoft, and Apple.

Algorithms

Shapes

Part I: draw a square. divide it into four identical squares. remove the bottom left hand square. now divide the

Algorithms

Surgeons

A one armed surgeon with a hand wound needs to operate on three patients. the surgeon only has two gloves.

Scroll to Top