Algorithms

Algorithms

Learning Path — 18 articles

1 Data Structures: Arrays, Linked Lists, Stacks, Queues & Trees Guide Master essential data structures including arrays, linked lists, stacks, queues, hash tables, trees, and heaps with time … 8 min Start Here 2 Sorting Algorithms: QuickSort, MergeSort, HeapSort & Timsort Guide Learn comparison-based sorting algorithms — bubble sort, selection sort, insertion sort, merge sort, quicksort, heap … 7 min Start Here 3 Searching Algorithms: Linear, Binary, Interpolation & Exponential... Learn searching algorithms — linear search, binary search, interpolation search, exponential search, and practical … 7 min Start Here 4 Recursion: Complete Guide with Divide and Conquer & Backtracking Master recursion — recursive functions, call stack mechanics, divide and conquer, backtracking, tail recursion … 8 min 5 Big O Notation: Complete Guide to Algorithm Complexity Analysis Learn Big O notation and algorithm complexity analysis — time and space complexity, common growth rates, recurrence … 8 min 6 Hash Tables: Dictionary and Set Implementation with Hash Functions Master hash tables — hash functions, collision resolution strategies, load factors, resizing, and implementing … 7 min 7 Tree Data Structures: Binary Trees, BSTs, Heaps & Balanced Trees Guide Master tree data structures — binary trees, BSTs, tree traversals, heaps, priority queues, AVL, red-black trees, and … 7 min 8 Greedy Algorithms: When Local Optimality Solves Global Problems Learn greedy algorithms including activity selection, Huffman coding, fractional knapsack, Dijkstra, MST, and when … 7 min 9 String Algorithms: KMP, Rabin-Karp, Manacher & Trie Pattern Matching Learn string algorithms for pattern matching — KMP, Rabin-Karp, Boyer-Moore, string hashing, palindrome algorithms, and … 8 min 10 Algorithm Design Patterns: Divide, Conquer, Sliding Window & More Master algorithm design patterns including divide and conquer, sliding window, two pointers, backtracking, DP, and … 8 min 11 Two Pointers and Sliding Window: Coding Interview Problem Patterns Master two pointers and sliding window techniques for coding interviews — opposite direction, fast and slow, fixed and … 8 min 12 Bit Manipulation: Algorithms and Tricks Bitwise operations and their applications — common bit manipulation tricks, masks, algorithmic patterns, and interview … 8 min 13 Backtracking: Solving Constraint Problems N-Queens, sudoku, permutations — solving constraint satisfaction problems with backtracking algorithms, pruning … 8 min 14 Trie Data Structure: Prefix Trees and Auto-Complete Tries, autocomplete, spell-check, prefix matching — the trie data structure, its applications, memory optimization, and … 8 min 15 Graph Algorithms Guide: Traversals, Shortest Paths, and More A comprehensive guide to graph algorithms — BFS, DFS, Dijkstra, Bellman-Ford, topological sort, MSTs, advanced … 9 min 16 Dynamic Programming Guide: From Memoization to Tabulation Master dynamic programming — memoization, tabulation, classic DP problems, state definition, optimization techniques, … 8 min Advanced 17 Parallel Algorithms: Concurrency and Scalability Explore parallel algorithms, concurrency models, data parallelism, task parallelism, synchronization techniques, and … 8 min Advanced 18 Randomized Algorithms: Probability and Performance Learn how randomized algorithms use probability to solve problems efficiently, covering Monte Carlo methods, Las Vegas … 8 min Advanced