How strangedip/prep works
This repository is a developer career-preparation book, not a single application: its intended workflow is to choose a level in the roadmap, follow its checklist, and consult focused learning resources. The supplied tree exposes a broad set of standalone DSA examples and one parking-lot design example, but omits many resources described in the README. The graph therefore emphasizes the visible runtime learning content and documents only navigation relationships stated in the README; the examples are independent rather than a connected execution pipeline.
Main entry points: ROADMAP.md Career roadmap · StudyGuide.md DSA study guide · 01_Arrays_Matrix Arrays and strings
Components 19
Learning guidance
- Career roadmap
ROADMAP.md - DSA study guide
02_DSA/StudyGuide.md
Core algorithms
- Arrays and strings
02_DSA/01_Arrays_Matrix - Search and sorting
02_DSA/03_Sorting_Searching - Windows and pointers
02_DSA/04_Sliding_Window_Two_Pointers - Recursion and divide
02_DSA/07_Recursion_Divide_Conquer
Data structures
- Linked lists
02_DSA/05_Linked_Lists - Stacks and queues
02_DSA/06_Stacks_Queues - Trees and BSTs
02_DSA/08_Trees_Binary_Trees - Heaps and priorities
02_DSA/10_Heaps_Priority_Queues
Advanced problem solving
- Graph algorithms
02_DSA/11_Graphs - Backtracking
02_DSA/12_Backtracking - Dynamic programming
02_DSA/13_Dynamic_Programming - Greedy algorithms
02_DSA/14_Greedy_Algorithms - Bits and math
02_DSA/15_Bit_Manipulation - Advanced structures
02_DSA/17_Advanced_Miscellaneous - Concurrency examples
02_DSA/18_Concurrency_Multithreading
System design
- Parking lot design
04_SystemDesign/01_LowLevelDesign/ParkingLot/ParkingLotSystem.java
Other components
- Developer
Connections 3
- Developer → Career roadmap: chooses level
README.md - Career roadmap → DSA study guide: points to DSA
README.md - DSA study guide → Arrays and strings: guides practice
README.md