Synced automatically from NeetCode.io · Repository:
neetcode150-submissions
Progress by pattern.
Progress: 2 / 150
| Pattern | Done |
|---|---|
| Arrays & Hashing | 2 / 9 |
| Two Pointers | 0 / 5 |
| Sliding Window | 0 / 6 |
| Stack | 0 / 6 |
| Binary Search | 0 / 7 |
| Linked List | 0 / 11 |
| Trees | 0 / 15 |
| Heap / Priority Queue | 0 / 7 |
| Backtracking | 0 / 10 |
| Tries | 0 / 3 |
| Graphs | 0 / 13 |
| Advanced Graphs | 0 / 6 |
| 1-D Dynamic Programming | 0 / 12 |
| 2-D Dynamic Programming | 0 / 11 |
| Greedy | 0 / 8 |
| Intervals | 0 / 6 |
| Math & Geometry | 0 / 8 |
| Bit Manipulation | 0 / 7 |
Solutions are organized by topic folder, then problem ID. Each submission is stored as a separate file:
<topic-folder>/
<problem-id>/
submission-0.<ext> ← first submission
submission-1.<ext> ← second submission
...
Example:
Data Structures & Algorithms/two-integer-sum/submission-0.py
Data Structures & Algorithms/binary-search/submission-0.py
Python For Beginners/python-hello-world/submission-0.py