Grokking the
Coding Interview: Patterns for Coding Interview
One-stop portal for all your coding interview needs.
Coding Interview
Coding Patterns
Data Structures & Algorithms
Art of Recursion
Dynamic Programming
Trusted by developers working in top tech companies like
Preview our most popular courses



Fast and Slow Pointers
Detects cycles in linked lists using two pointers at different speeds.
Merge Intervals
Efficiently merges overlapping intervals or determines their intersection.
Tree Depth First Search
Explore trees by traversing each branch as far as possible before backtracking.
Island (Matrix Traversal)
Solves problems of identifying and counting islands in a matrix.
Two Heaps
Efficiently solves problems related to scheduling and data streams with heaps.
Modified Binary Search
Solves problems with variations on the classic binary search algorithm.
K-way Merge
Merges K sorted arrays or lists efficiently into one sorted array or list in linear time.
Greedy Algorithms
Uses a greedy approach to find locally optimal solution for a global optimum.
Backtracking
Depth-first technique to solve problems by exploring different possibilities.
Topological Sort (graph)
Orders directed graph vertices such that u precedes v for every edge (u, v).
Multi-threaded
Uses multiple threads for concurrent tasks, enhancing system performance.
Hear from Successful Tech Professionals










All Coding Courses











