Coding Interview – Page 5

Union-Find Basics to Kruskal’s MST Implementation

2026년 01월 31일

Union-Find from scratch: path compression, union by rank, and implementing Kruskal's MST. The O(α(N)) trick and mistakes I made along the way.

2026년 01월 17일

Master 10 interview algorithms fast: BFS, DFS, DP, binary search. Python templates, complexity cheat sheet, and the 3 patterns that solve 80%.

2026년 01월 17일

Stop memorizing LeetCode solutions. Master 7 interview patterns that solve 80% of algorithm questions — with O(n) complexity breakdowns.

2026년 01월 12일

Build a trie in Python that beats naive search by 40x on prefix queries. Covers autocomplete, Word Search II, and deletion edge cases.

2026년 01월 09일

Dijkstra breaks on negative edges. Bellman-Ford runs O(VE). Pick wrong and debug for hours—here's the 30-second decision tree.

2025년 12월 30일

Solve Two Sum in O(n) with hash maps instead of O(n²) brute force. Compare 3 approaches with time complexity proof and LeetCode patterns.

2025년 12월 27일

Solve N-Queen, permutations, and Sudoku with backtracking. Python implementations with pruning strategies that actually speed things up.

2025년 12월 25일

Master DP patterns that solve 80% of coding interviews: Knapsack, LIS, LCS, and bitmask DP with Python code and O(n) optimizations.