Category: Coding Interview
-
Merge Sort vs Quick Sort: Cache & Pivot Benchmark Results
Compare merge sort vs quick sort performance with real benchmark data. Cache efficiency and pivot strategies reveal surprising winners.
-
Prefix Tree vs Hash Map: 47% Slower Insert Reality
Prefix Tree insert operations benchmark 47% slower than Hash Map despite O(m) complexity. Deep dive into memory layout and cache behavior reveals why.
-
Adjacency List vs Matrix: 47% Faster DFS in Interview Code
DFS performance comparison: adjacency list beats matrix by 47% in interview problems. See which graph representation wins and why it matters.
-
Linear vs Binary Search: 1M Element Speed Test Results
Compare linear vs binary search performance with 1M elements - discover which algorithm wins and when to use each method in Python
-
Greedy vs DP: When Sorting Fails the Interview
Learn when greedy algorithms fail and dynamic programming saves the day through a classic interval scheduling problem that trips up interviews
-
Bubble Sort to Timsort: Why Python Ditched O(n²)
Python's sorted() uses Timsort, not the bubble sort from textbooks. Here's the 85x speed gap, stability trade-offs, and when O(n²) beats O(n log n).
-
Hardware Wallet Architecture: BIP32/39/44 Chain Explained
How hardware wallets derive infinite keys from 12 words: BIP32/39/44 math explained with Python, plus the path collision edge case interviewers ask.