B-Trees and B+ Trees: Database Index Structures
Understand B-trees and B+ trees for disk-based storage, database indexing, and efficient range queries with O(log n) operations.
Posts in technical
Bellman-Ford Algorithm: Shortest Paths with Negative Weights
Learn the Bellman-Ford algorithm for single-source shortest paths including negative edge weights and negative cycle detection.
Big O Notation: Analyzing Algorithm Complexity
Master asymptotic analysis, Big O/Theta/Omega notation, and how to analyze time and space complexity of algorithms systematically.
Binary Search Variants: Beyond Simple Lookup
Master variations of binary search including lower bound, upper bound, search in rotated array, and fractional searching for optimization problems.
Binary Trees and Binary Search Trees: Hierarchical Data
Master tree traversal (inorder, preorder, postorder), BST operations, and when trees outperform other data structures.
Bit Manipulation: Power of Bits
Master bitwise operations for flag handling, number tricks, bit counting, and interview problems involving O(1) space arithmetic.
Common Coding Interview Patterns
Master the essential patterns—sliding window, two pointers, fast-slow pointers—that solve 80% of linked list and array problems.
Counting Sort & Radix Sort: Linear-Time Sorting
Understand non-comparison sorting algorithms that achieve O(n+k) time complexity by exploiting known bounds on input values.
Depth-Limited & Bidirectional Search
Explore search algorithm variants: depth-limited search for bounded recursion, and bidirectional search for O(b^d/2) complexity improvement.
Depth-Limited Search: Bounded Depth-First Search
Learn depth-limited search (DLS) for handling infinite state spaces with a depth bound, and how it relates to iterative deepening.