// the find
vinta/fuck-coding-interviews
How on earth can I ever think of a solution like that in an interview?!
A Python study repo where one developer worked through LeetCode and HackerRank problems while also implementing common data structures from scratch. It's for people who want to see clean, tested Python implementations of algorithms and data structures alongside the interview problems that use them — not just raw problem solutions.
Every implementation ships with a test suite using pytest, so you can actually run the code and verify it works rather than just reading it. The data structure implementations go deeper than most study repos — B-trees, B+ trees, Treap, Union-Find with both quick-find and weighted quick-union are all there, not just the usual linked list and stack. Problems are categorized by the underlying data structure or technique, which makes it useful for targeted practice rather than random grinding. The README is honest about the author's frustration with interviews, which sets expectations correctly.
Dead since March 2023 — no Hard graph problems beyond BFS/Dijkstra, no DP beyond the basics, no sliding window, no two-heap patterns. Coverage is thin on common interview patterns like backtracking beyond three problems and there's nothing on bit manipulation beyond power-of-two. The problems section also has a few files in the directory (array_intersection, array_sum, etc.) that don't appear in the README, suggesting incomplete docs. At 745 stars it's a personal study repo that got discovered, not a maintained reference — if you're preparing for interviews in 2025 you'll quickly outgrow what's here.