Algorithms

Master array data structure, common operations, and array-based algorithms for interviews.

Master searching algorithms: linear search, binary search, interpolation search, and their applications in coding interviews.

Master sorting algorithms: bubble sort, merge sort, quick sort, heap sort, and their time/space complexities for coding interviews.

Master hash functions, hash tables, collision resolution, and hashing algorithms for efficient data storage and retrieval.

Master string manipulation, common string algorithms, and pattern matching techniques for coding interviews.

Master recursion: base cases, recursive calls, memoization, and solving problems using recursive thinking.

Master backtracking: systematic exploration of solution space by trying partial solutions and undoing choices that don't lead to solutions.

Master tree traversal algorithms: preorder, inorder, postorder, and level-order traversal for binary trees and n-ary trees.

Master graph traversal algorithms: Depth-First Search (DFS) and Breadth-First Search (BFS) for exploring graphs and solving graph problems.

Master dynamic programming: memoization, tabulation, identifying DP problems, and solving optimization problems efficiently.

Master the sliding window technique: efficiently solve subarray/substring problems by maintaining a window that slides through the array.

Master prefix sum technique: precompute cumulative sums to answer range sum queries in O(1) time after O(n) preprocessing.

Master topological sorting: ordering vertices in a directed acyclic graph (DAG) such that for every edge (u,v), u comes before v.

Master Dijkstra's algorithm for finding shortest paths in weighted graphs with non-negative edge weights.

Master Bellman-Ford algorithm for finding shortest paths in graphs with negative edge weights and detecting negative cycles.