This repository contains my Python solutions to the NeetCode / Blind 75 coding interview problems.
🔗 Official list: https://neetcode.io/practice/practice/blind75
The solutions are written with a strong emphasis on debug-friendly execution.s.
Problems are organized according to the official NeetCode / Blind 75 roadmap, grouped by fundamental patterns.
- Array basics
- Prefix sums
- Kadane’s Algorithm
- In-place modifications
- Opposite direction pointers
- Fast & slow pointers
- Sorted array techniques
- Fixed-size window
- Variable-size window
- Frequency-based windows
- Monotonic stack
- Parentheses validation
- Stack simulation problems
- Classic binary search
- Search on answer
- Rotated arrays
- Fast & slow pointer technique
- Reversal patterns
- Merge & cycle detection
- DFS (preorder, inorder, postorder)
- BFS (level-order traversal)
- Binary Search Trees
- Recursive tree patterns
- Top-K elements
- Min-heap vs Max-heap
- Streaming data problems
- Subsets & permutations
- Combination problems
- Constraint-based search
- Prefix search
- Word dictionary
- String construction problems
- BFS & DFS
- Connected components
- Matrix-based graph traversal
- Topological sort
- Union Find
- Shortest path algorithms
- Fibonacci-style DP
- House Robber pattern
- Prefix decision DP
- Grid DP
- String DP
- Subsequence problems
- Local optimal → global optimal reasoning
- Jump game patterns
- Scheduling logic
- Merge intervals
- Non-overlapping intervals
- Sweep-line intuition
- Coordinate-based problems
- Area and slope logic
- Simulation using math
- XOR tricks
- Bit masking
- Binary representation logic
- Python 3
- Jupyter Notebooks (debug & explanation oriented)
- Clean Python functions (easy to convert to
.py)