Coding Interview – TildAlice

Binary Search Variants: 6 LeetCode Problems Benchmarked

2026년 07월 19일

Three binary search patterns tested on 6 LeetCode problems. Same O(log n), wildly different bug counts. Here's which one survives interview pressure.

2026년 06월 02일

Master HashMap techniques to solve frequency counting, two-sum, anagram grouping, and subarray sum problems faster than array-based approaches

2026년 06월 01일

Fix 5 critical off-by-one bugs in binary search that cause infinite loops and wrong results. Learn boundary checks that actually work.

2026년 05월 31일

Compare deque vs list for BFS performance and discover why the wrong choice causes 6x slowdowns at scale. Benchmark data reveals the winner.

2026년 05월 29일

Quick Sort pivot strategies benchmarked: first vs random vs median-of-three. Which wins for speed? Real test results reveal the surprising truth.

2026년 05월 22일

At 1000 elements, Python's sorted() beats hand-written quicksort by 47x. Real benchmark data for interview-size arrays with the numbers behind why.

2026년 05월 05일

Kadane's algorithm is O(N), but 40% fail it. The bug? Initializing to 0 breaks all-negative arrays. Here's the fix with edge case walkthrough.

2026년 04월 30일

DFS performance comparison: adjacency list beats matrix by 47% in interview problems. See which graph representation wins and why it matters.