# aayush2761/leetcode_prob architecture

> Architecture diagram of the GitHub repository aayush2761/leetcode_prob, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2025-03-31). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/aayush2761/leetcode_prob
- Repository: https://github.com/aayush2761/leetcode_prob

## Overview

##### High-level “Repository” component
- That this component is the container for all problem solution folders.

##### “separation of concerns”
- That each problem folder is self-contained with its own solution and auxiliary documentation. This design follows a simple pattern where every problem is isolated, allowing independent review and testing.

- At the top level, you have the “Leetcode Prob Repository.”
- Branching out are many “Problem Folder” nodes.
- Within each folder, you see the solution files and accompanying documentation.

## Diagram (Mermaid)

```mermaid
flowchart TD
    %% Global Nodes
    README_Global["README.md (Global)"]:::globalDoc
    Repository["Leetcode Prob Repository"]:::repository

    %% Problem Folders
    Folder_0001["0001-two-sum"]:::folder
    Folder_0002["0002-add-two-numbers"]:::folder
    Folder_0003["0003-longest-substring-without-repeating-characters"]:::folder

    %% Files for 0001-two-sum
    Sol_0001["0001-two-sum.cpp"]:::source
    Readme_0001["README.md"]:::doc

    %% Files for 0002-add-two-numbers
    Sol_0002["0002-add-two-numbers.cpp"]:::source
    Readme_0002["README.md"]:::doc

    %% Files for 0003-longest-substring-without-repeating-characters
    Sol_0003["0003-longest-substring-without-repeating-characters.cpp"]:::source
    Readme_0003["README.md"]:::doc
    Notes_0003["NOTES.md"]:::doc

    %% Relationships
    README_Global -->|"provides_context"| Repository
    Repository -->|"contains"| Folder_0001
    Repository -->|"contains"| Folder_0002
    Repository -->|"contains"| Folder_0003

    Folder_0001 -->|"contains"| Sol_0001
    Folder_0001 -->|"contains"| Readme_0001

    Folder_0002 -->|"contains"| Sol_0002
    Folder_0002 -->|"contains"| Readme_0002

    Folder_0003 -->|"contains"| Sol_0003
    Folder_0003 -->|"contains"| Readme_0003
    Folder_0003 -->|"contains"| Notes_0003

    %% Click Events
    click Repository "https://github.com/aayush2761/leetcode_prob/tree/main/Root directory"
    click Folder_0001 "https://github.com/aayush2761/leetcode_prob/tree/main/0001-two-sum"
    click Folder_0002 "https://github.com/aayush2761/leetcode_prob/tree/main/0002-add-two-numbers"
    click Folder_0003 "https://github.com/aayush2761/leetcode_prob/tree/main/0003-longest-substring-without-repeating-characters"
    click Sol_0001 "https://github.com/aayush2761/leetcode_prob/blob/main/0001-two-sum/0001-two-sum.cpp"
    click Readme_0001 "https://github.com/aayush2761/leetcode_prob/blob/main/0001-two-sum/README.md"
    click Sol_0002 "https://github.com/aayush2761/leetcode_prob/blob/main/0002-add-two-numbers/0002-add-two-numbers.cpp"
    click Readme_0002 "https://github.com/aayush2761/leetcode_prob/blob/main/0002-add-two-numbers/README.md"
    click Sol_0003 "https://github.com/aayush2761/leetcode_prob/blob/main/0003-longest-substring-without-repeating-characters/0003-longest-substring-without-repeating-characters.cpp"
    click Readme_0003 "https://github.com/aayush2761/leetcode_prob/blob/main/0003-longest-substring-without-repeating-characters/README.md"
    click Notes_0003 "https://github.com/aayush2761/leetcode_prob/blob/main/0003-longest-substring-without-repeating-characters/NOTES.md"
    click README_Global "https://github.com/aayush2761/leetcode_prob/blob/main/README.md"

    %% Styles
    classDef repository fill:#AED6F1,stroke:#2471A3,stroke-width:2px;
    classDef folder fill:#D6EAF8,stroke:#1F618D,stroke-width:2px;
    classDef source fill:#A9DFBF,stroke:#27AE60,stroke-width:2px;
    classDef doc fill:#F9E79F,stroke:#B7950B,stroke-width:2px;
    classDef globalDoc fill:#FAD7A0,stroke:#E67E22,stroke-width:2px;
```
