Tag: algorithms
Concepts
- Adaptive Quadrature
- Amortized Analysis
- Arrays and Two Pointers
- B-Trees and LSM Trees
- Backtracking Search
- Balanced Search Trees
- Bellman-Ford and Negative Cycles
- Why the Naive Shuffle Is Biased
- Big-O Complexity
- Binary Search Patterns
- The Bisection Method
- Bit Manipulation Fundamentals
- Bitmask Dynamic Programming
- Bloom Filters
- The Comparison Lower Bound on Sorting
- Consistent Hashing
- Count-Min Sketch
- Counting Sort and Radix Sort
- Deques and Window Extrema
- Detecting Cycles in an Iterated Sequence
- Dijkstra's Shortest Paths
- Divide and Conquer and the Master Theorem
- Dynamic Programming Basics
- Edit Distance
- The Fast Fourier Transform Algorithm
- Fenwick Trees and Binary Indexed Trees
- Finding the Median With Few Comparisons
- Floyd-Warshall All-Pairs Shortest Paths
- Gaussian Elimination and Pivoting
- Graph Traversal, BFS and DFS
- Graph Representations
- Graph Theory Basics
- Greedy Algorithms and Exchange Arguments
- Halving the Search Space
- Hash Maps and Sets
- Heaps and Priority Queues
- Histogram-Based Split Finding
- Interval Scheduling and Merging
- Iterative Linear Solvers
- Knapsack Problems
- Linked Lists and Cycle Detection
- Longest Common Subsequence
- Longest Increasing Subsequence
- Matrix Exponentiation for Recurrences
- Max-Flow Min-Cut
- Memoization vs Tabulation
- Merge Sort and Counting Inversions
- Minimum Spanning Trees
- Monotonic Stack
- Numerical Stability and Error Analysis
- On-Policy vs Off-Policy Learning
- Generating Permutations and Subsets
- Polynomial Interpolation
- Power Iteration and Eigenvalue Algorithms
- Prefix Sums
- Quickselect and Top-K Selection
- Rabin-Karp and Rolling Hashes
- Recursion and the Call Stack
- Reservoir Sampling
- Searching a Unimodal Function
- The Secant and Brent Methods
- Finding the Second-Best Player in Fewest Matches
- The Sliding Window Technique
- Sorting Algorithms Compared
- Stable Matching and Gale-Shapley
- Stacks and Queues
- String Matching with KMP
- Topological Sorting
- The Trapezoid and Simpson Rules
- Tree Traversals
- Tries and Prefix Trees
Interview Questions
- Finding one honest agent among liars
- Find the duplicated number
- Find the missing number in one pass
- The heaviest and the runner-up among eight coins
- Both the lightest and the heaviest of ten coins
- Is there a loop in the chain?
- The median of five numbers in six comparisons
- Sort four items in five comparisons