Searching• 8 min read
Binary Search: The Art of Halving
Learn how to find an element in a sorted array in O(log N) time by repeatedly dividing the search interval in half.
Read GuideFREE RESOURCES
The Knowledge Library
Crack the code without the headache. Explore our interactive guides to algorithms, complexity, and the secret life of data.
Start With The Calculator, Then Learn The Pattern
If you want the answer quickly, try the time complexity calculator. If you want to understand why the answer is O(log N), O(N), or O(N²), these tutorials are the next step.
Sorting• 12 min read
Merge Sort: Divide and Conquer
A highly efficient, stable sorting algorithm that uses the divide and conquer paradigm to sort arrays in O(N log N) time.
Read GuideGraphs• 15 min read
Dijkstra's Shortest Path
Find the shortest paths between nodes in a graph. Essential for routing, navigation, and network analysis.
Read GuideAdvanced• 20 min read
0/1 Knapsack (Dynamic Programming)
Master Dynamic Programming by solving the classic 0/1 Knapsack problem. Learn to build the DP table.
Read GuideSorting• 10 min read
Quick Sort: The Pivot Master
An efficient, in-place sorting algorithm that partitions an array around a pivot element.
Read GuideGraphs• 10 min read
Breadth-First Search (BFS)
Explore a graph level by level. Perfect for finding the shortest path in unweighted graphs.
Read GuideGraphs• 10 min read
Depth-First Search (DFS)
Dive deep into a graph before backtracking. Useful for topological sorting and finding connected components.
Read GuideArrays• 8 min read
Two Pointers Technique
Optimize array and string problems by using two references to iterate from different ends or at different speeds.
Read GuideArrays• 12 min read
Sliding Window
Efficiently solve problems involving contiguous subarrays or substrings by maintaining a moving window of elements.
Read GuideSorting• 7 min read
Bubble Sort: The Simple Sorter
The simplest sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if needed.
Read GuideSorting• 8 min read
Insertion Sort: Building a Sorted Array
Build a sorted array one element at a time by inserting each element into its correct position in the sorted portion.
Read GuideSearching• 6 min read
Linear Search: Sequential Scanning
Find an element in an unsorted list by checking each element sequentially until the target is found.
Read GuideData Structures• 14 min read
Hash Tables: O(1) Lookup Magic
Master the art of constant-time lookups using hash tables. Understand collisions, load factors, and practical implementations.
Read GuideData Structures• 12 min read
Linked Lists: Dynamic Data Storage
Learn how linked lists provide dynamic memory allocation and efficient insertion/deletion compared to arrays.
Read GuideData Structures• 11 min read
Stacks & Queues: LIFO and FIFO
Understand the fundamental abstract data types: stacks (Last-In-First-Out) and queues (First-In-First-Out).
Read GuideTrees• 13 min read
Tree Traversal: In, Pre, Post Order
Master inorder, preorder, and postorder tree traversals. Learn when to use each approach for different problems.
Read GuideTrees• 14 min read
Binary Search Tree: Ordered Excellence
Explore balanced and unbalanced binary search trees for efficient searching, insertion, and deletion operations.
Read Guide