| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Hand-built implementations of the core data structures every interview assumes you can build from scratch. These are the foundations the pattern problems in ../DSA_ProblemSolving_patterns/ rely on.
Gold-standard reference: Heap/Max_binary_heap.js is the template all files aspire to — full header, array↔tree visual, insert/ extract with bubble-up/sink-down, iterative AND recursive variants, and an interview checklist. Use it as the model when reworking any file here.
| Structure | Folder | Key operations / notes |
|---|---|---|
| Array | Arrays/, 2DArray/ | basics; searchInMatrix (staircase search) |
| Hash Table | HashTable/ | set/get with collision handling |
| Stack | Stack/ | LIFO; powers Valid Parentheses, monotonic-stack problems |
| Queue | Queue/ | FIFO; queueFromStack (two-stack queue) |
| Linked List | LinkedList/ | traversal, rotate, swap-alternate; pairs with Fast & Slow Pointers |
| Binary Heap | Heap/ | ★ Max & Min heaps, priority queue — see the gold standard above |
| Tree / BST | Tree/, Exercise/ | insert/search, BFS/DFS traversals, level order, left view, kth-max via reverse in-order |
| Trie | Trie/ | prefix tree — autocomplete / word-dictionary problems |
| LRU Cache | LRUCache/ | O(1) get/put — hash map + doubly linked list (see its README) |
| Puzzles | puzzles/ | applied: findTheMinDaysToShip |
These implementations are correct and well-commented but predate the repo-wide TypeScript + test rework done in DSA_ProblemSolving_patterns/. A future pass could port them to .ts with vitest coverage, using Max_binary_heap.js as the structural model. Not yet done — flagged honestly rather than claimed complete.
| Back | FazBrowse Home | New Git URL |