Binary Search & Search on Answer
From 'guess the number' to allocating resources under constraints ā plus the binary-search-on-answer paradigm.
From 'guess the number' to allocating resources under constraints ā plus the binary-search-on-answer paradigm.
Prefix-sum hashing and complement hashing ā two of the highest-leverage patterns in algorithmic problem solving.
Binary heaps from first principles to production ā top-K, streaming medians, and scheduler design.
Fixed and variable-size windows for subarray/substring problems, explained at conceptual and implementation levels.
LIFO/FIFO structures plus the monotonic stack/queue pattern for interview and production use.
Basic trees and BSTs from first-principles intuition to expert AI/ML/LLM connections.
From converging pointers to Floyd's cycle detection ā turning O(n²) scans into O(n) passes.