# strangedip/prep architecture

> Architecture diagram of the GitHub repository strangedip/prep, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-08). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/strangedip/prep
- Repository: https://github.com/strangedip/prep

## Overview

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`](https://github.com/strangedip/prep/blob/main/ROADMAP.md) (Career roadmap), [`02_DSA/StudyGuide.md`](https://github.com/strangedip/prep/blob/main/02_DSA/StudyGuide.md) (DSA study guide), [`02_DSA/01_Arrays_Matrix`](https://github.com/strangedip/prep/tree/main/02_DSA/01_Arrays_Matrix) (Arrays and strings)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_guidance["Learning guidance"]
  node_roadmap["Career roadmap<br/>[ROADMAP.md]"]
  node_studyguide["DSA study guide<br/>[StudyGuide.md]"]
end

subgraph group_linear["Core algorithms"]
  node_arrays["Arrays and strings"]
  node_searchsort["Search and sorting"]
  node_windows["Windows and pointers"]
  node_recursion["Recursion and divide"]
end

subgraph group_structures["Data structures"]
  node_lists["Linked lists"]
  node_stacks["Stacks and queues"]
  node_trees["Trees and BSTs"]
  node_heaps["Heaps and priorities"]
end

subgraph group_advanced["Advanced problem solving"]
  node_graphs["Graph algorithms"]
  node_backtracking["Backtracking"]
  node_dp["Dynamic programming"]
  node_greedy["Greedy algorithms"]
  node_bitmath["Bits and math"]
  node_misc["Advanced structures"]
  node_concurrency["Concurrency examples"]
end

subgraph group_design["System design"]
  node_parking["Parking lot design"]
end

node_learner(("Developer"))

node_learner -->|"chooses level"| node_roadmap
node_roadmap -->|"points to DSA"| node_studyguide
node_studyguide -->|"guides practice"| node_arrays

click node_roadmap "https://github.com/strangedip/prep/blob/main/ROADMAP.md"
click node_studyguide "https://github.com/strangedip/prep/blob/main/02_DSA/StudyGuide.md"
click node_arrays "https://github.com/strangedip/prep/tree/main/02_DSA/01_Arrays_Matrix"
click node_searchsort "https://github.com/strangedip/prep/tree/main/02_DSA/03_Sorting_Searching"
click node_windows "https://github.com/strangedip/prep/tree/main/02_DSA/04_Sliding_Window_Two_Pointers"
click node_recursion "https://github.com/strangedip/prep/tree/main/02_DSA/07_Recursion_Divide_Conquer"
click node_lists "https://github.com/strangedip/prep/tree/main/02_DSA/05_Linked_Lists"
click node_stacks "https://github.com/strangedip/prep/tree/main/02_DSA/06_Stacks_Queues"
click node_trees "https://github.com/strangedip/prep/tree/main/02_DSA/08_Trees_Binary_Trees"
click node_heaps "https://github.com/strangedip/prep/tree/main/02_DSA/10_Heaps_Priority_Queues"
click node_graphs "https://github.com/strangedip/prep/tree/main/02_DSA/11_Graphs"
click node_backtracking "https://github.com/strangedip/prep/tree/main/02_DSA/12_Backtracking"
click node_dp "https://github.com/strangedip/prep/tree/main/02_DSA/13_Dynamic_Programming"
click node_greedy "https://github.com/strangedip/prep/tree/main/02_DSA/14_Greedy_Algorithms"
click node_bitmath "https://github.com/strangedip/prep/tree/main/02_DSA/15_Bit_Manipulation"
click node_misc "https://github.com/strangedip/prep/tree/main/02_DSA/17_Advanced_Miscellaneous"
click node_concurrency "https://github.com/strangedip/prep/tree/main/02_DSA/18_Concurrency_Multithreading"
click node_parking "https://github.com/strangedip/prep/blob/main/04_SystemDesign/01_LowLevelDesign/ParkingLot/ParkingLotSystem.java"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_roadmap,node_studyguide toneBlue
class node_arrays,node_searchsort,node_windows,node_recursion toneAmber
class node_lists,node_stacks,node_trees,node_heaps toneMint
class node_graphs,node_backtracking,node_dp,node_greedy,node_bitmath,node_misc,node_concurrency toneRose
class node_parking,node_learner toneIndigo
```

## Components

### Learning guidance

- [Career roadmap](https://github.com/strangedip/prep/blob/main/ROADMAP.md): `ROADMAP.md`
- [DSA study guide](https://github.com/strangedip/prep/blob/main/02_DSA/StudyGuide.md): `02_DSA/StudyGuide.md`

### Core algorithms

- [Arrays and strings](https://github.com/strangedip/prep/tree/main/02_DSA/01_Arrays_Matrix): `02_DSA/01_Arrays_Matrix`
- [Search and sorting](https://github.com/strangedip/prep/tree/main/02_DSA/03_Sorting_Searching): `02_DSA/03_Sorting_Searching`
- [Windows and pointers](https://github.com/strangedip/prep/tree/main/02_DSA/04_Sliding_Window_Two_Pointers): `02_DSA/04_Sliding_Window_Two_Pointers`
- [Recursion and divide](https://github.com/strangedip/prep/tree/main/02_DSA/07_Recursion_Divide_Conquer): `02_DSA/07_Recursion_Divide_Conquer`

### Data structures

- [Linked lists](https://github.com/strangedip/prep/tree/main/02_DSA/05_Linked_Lists): `02_DSA/05_Linked_Lists`
- [Stacks and queues](https://github.com/strangedip/prep/tree/main/02_DSA/06_Stacks_Queues): `02_DSA/06_Stacks_Queues`
- [Trees and BSTs](https://github.com/strangedip/prep/tree/main/02_DSA/08_Trees_Binary_Trees): `02_DSA/08_Trees_Binary_Trees`
- [Heaps and priorities](https://github.com/strangedip/prep/tree/main/02_DSA/10_Heaps_Priority_Queues): `02_DSA/10_Heaps_Priority_Queues`

### Advanced problem solving

- [Graph algorithms](https://github.com/strangedip/prep/tree/main/02_DSA/11_Graphs): `02_DSA/11_Graphs`
- [Backtracking](https://github.com/strangedip/prep/tree/main/02_DSA/12_Backtracking): `02_DSA/12_Backtracking`
- [Dynamic programming](https://github.com/strangedip/prep/tree/main/02_DSA/13_Dynamic_Programming): `02_DSA/13_Dynamic_Programming`
- [Greedy algorithms](https://github.com/strangedip/prep/tree/main/02_DSA/14_Greedy_Algorithms): `02_DSA/14_Greedy_Algorithms`
- [Bits and math](https://github.com/strangedip/prep/tree/main/02_DSA/15_Bit_Manipulation): `02_DSA/15_Bit_Manipulation`
- [Advanced structures](https://github.com/strangedip/prep/tree/main/02_DSA/17_Advanced_Miscellaneous): `02_DSA/17_Advanced_Miscellaneous`
- [Concurrency examples](https://github.com/strangedip/prep/tree/main/02_DSA/18_Concurrency_Multithreading): `02_DSA/18_Concurrency_Multithreading`

### System design

- [Parking lot design](https://github.com/strangedip/prep/blob/main/04_SystemDesign/01_LowLevelDesign/ParkingLot/ParkingLotSystem.java): `04_SystemDesign/01_LowLevelDesign/ParkingLot/ParkingLotSystem.java`

### Other components

- **Developer**

## Connections

- Developer → Career roadmap: chooses level (evidence: `README.md`)
- Career roadmap → DSA study guide: points to DSA (evidence: `README.md`)
- DSA study guide → Arrays and strings: guides practice (evidence: `README.md`)
