# aryan-iitmandi/dsa-practice architecture

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

- Interactive diagram: https://gitdiagram.com/aryan-iitmandi/dsa-practice
- Repository: https://github.com/aryan-iitmandi/dsa-practice

## Overview

DSA Practice is a collection of independent C++17 learning examples, not a single application: users choose a topic and run its standalone program with input to see a result. Its coverage ranges from C++ fundamentals and STL through algorithmic problem families, data structures, and interview-style questions. The README documents the input-to-output usage; sampled programs confirm console input and output. The examples are largely self-contained, so the graph does not imply calls or a shared runtime pipeline between them.

Main entry points: [`Array/Medium`](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Medium) (Array problems), [`Array/Hard`](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Hard) (Advanced arrays), [`Binary Search/In 1D Array`](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%201D%20Array) (1D binary search), [`Binary Search/In 2D Array`](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%202D%20Array) (2D binary search)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_fundamentals["C++ fundamentals"]
  node_basics_cpp["C++ basics"]
  node_math["Math basics"]
  node_recursion["Recursion"]
  node_patterns["Pattern printing"]
  node_hashing_basics["Hashing basics"]
  node_stl_containers["STL containers"]
  node_stl_algorithms["STL algorithms<br/>[algorithms.cpp]"]
end

subgraph group_algorithms["Algorithm practice"]
  node_arrays_easy["Array fundamentals"]
  node_arrays_medium["Array problems"]
  node_arrays_hard["Advanced arrays"]
  node_binary_search_1d["1D binary search"]
  node_binary_search_2d["2D binary search"]
  node_binary_search_answers["Answer search"]
  node_sorting["Sorting algorithms"]
  node_strings["String problems"]
  node_bit_manipulation["Bit manipulation"]
end

subgraph group_structures["Data structures"]
  node_singly_list["Singly linked lists"]
  node_doubly_list["Doubly linked lists"]
end

subgraph group_interview["Interview problems"]
  node_amazon_questions["Amazon OA questions"]
end

node_learner(("Learner"))
node_console_result["Console result"]

node_learner -->|"chooses topic"| node_arrays_easy
node_learner -->|"chooses topic"| node_arrays_medium
node_learner -->|"chooses topic"| node_arrays_hard
node_learner -->|"chooses topic"| node_basics_cpp
node_learner -->|"chooses topic"| node_math
node_learner -->|"chooses topic"| node_recursion
node_learner -->|"chooses topic"| node_patterns
node_learner -->|"chooses topic"| node_hashing_basics
node_learner -->|"chooses topic"| node_stl_containers
node_learner -->|"chooses topic"| node_stl_algorithms
node_learner -->|"chooses topic"| node_binary_search_1d
node_learner -->|"chooses topic"| node_binary_search_2d
node_learner -->|"chooses topic"| node_binary_search_answers
node_learner -->|"chooses topic"| node_sorting
node_learner -->|"chooses topic"| node_strings
node_learner -->|"chooses topic"| node_bit_manipulation
node_learner -->|"chooses topic"| node_singly_list
node_learner -->|"chooses topic"| node_doubly_list
node_learner -->|"chooses topic"| node_amazon_questions
node_arrays_hard -->|"prints result"| node_console_result
node_arrays_medium -->|"prints result"| node_console_result
node_binary_search_1d -->|"prints result"| node_console_result
node_binary_search_2d -->|"prints result"| node_console_result
node_sorting -->|"prints result"| node_console_result
node_singly_list -->|"prints result"| node_console_result
node_doubly_list -->|"prints result"| node_console_result
node_amazon_questions -->|"prints result"| node_console_result

click node_basics_cpp "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Basics%20of%20C%2B%2B"
click node_math "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Basic%20of%20Math"
click node_recursion "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Recursion"
click node_patterns "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Patterns"
click node_hashing_basics "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Hashing"
click node_stl_containers "https://github.com/aryan-iitmandi/dsa-practice/blob/main/Basics/STL%20in%20C%2B%2B/containersAndIterators.cpp"
click node_stl_algorithms "https://github.com/aryan-iitmandi/dsa-practice/blob/main/Basics/STL%20in%20C%2B%2B/algorithms.cpp"
click node_arrays_easy "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Easy"
click node_arrays_medium "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Medium"
click node_arrays_hard "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Hard"
click node_binary_search_1d "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%201D%20Array"
click node_binary_search_2d "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%202D%20Array"
click node_binary_search_answers "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%20Answers"
click node_sorting "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Sorting"
click node_strings "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Strings/Easy"
click node_bit_manipulation "https://github.com/aryan-iitmandi/dsa-practice/tree/main/Bits%20Manipulation"
click node_singly_list "https://github.com/aryan-iitmandi/dsa-practice/tree/main/LinkedList/1D%20LinkedList"
click node_doubly_list "https://github.com/aryan-iitmandi/dsa-practice/tree/main/LinkedList/Doubly%20LinkedList"
click node_amazon_questions "https://github.com/aryan-iitmandi/dsa-practice/tree/main/amazonOA"

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_basics_cpp,node_math,node_recursion,node_patterns,node_hashing_basics,node_stl_containers,node_stl_algorithms toneBlue
class node_arrays_easy,node_arrays_medium,node_arrays_hard,node_binary_search_1d,node_binary_search_2d,node_binary_search_answers,node_sorting,node_strings,node_bit_manipulation toneAmber
class node_singly_list,node_doubly_list toneMint
class node_amazon_questions toneRose
class node_learner,node_console_result toneIndigo
```

## Components

### C++ fundamentals

- [C++ basics](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Basics%20of%20C%2B%2B): `Basics/Basics of C++`
- [Math basics](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Basic%20of%20Math): `Basics/Basic of Math`
- [Recursion](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Recursion): `Basics/Recursion`
- [Pattern printing](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Patterns): `Basics/Patterns`
- [Hashing basics](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Basics/Hashing): `Basics/Hashing`
- [STL containers](https://github.com/aryan-iitmandi/dsa-practice/blob/main/Basics/STL%20in%20C%2B%2B/containersAndIterators.cpp): `Basics/STL in C++/containersAndIterators.cpp`
- [STL algorithms](https://github.com/aryan-iitmandi/dsa-practice/blob/main/Basics/STL%20in%20C%2B%2B/algorithms.cpp): `Basics/STL in C++/algorithms.cpp`

### Algorithm practice

- [Array fundamentals](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Easy): `Array/Easy`
- [Array problems](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Medium): `Array/Medium`
- [Advanced arrays](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Array/Hard): `Array/Hard`
- [1D binary search](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%201D%20Array): `Binary Search/In 1D Array`
- [2D binary search](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%202D%20Array): `Binary Search/In 2D Array`
- [Answer search](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Binary%20Search/In%20Answers): `Binary Search/In Answers`
- [Sorting algorithms](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Sorting): `Sorting`
- [String problems](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Strings/Easy): `Strings/Easy`
- [Bit manipulation](https://github.com/aryan-iitmandi/dsa-practice/tree/main/Bits%20Manipulation): `Bits Manipulation`

### Data structures

- [Singly linked lists](https://github.com/aryan-iitmandi/dsa-practice/tree/main/LinkedList/1D%20LinkedList): `LinkedList/1D LinkedList`
- [Doubly linked lists](https://github.com/aryan-iitmandi/dsa-practice/tree/main/LinkedList/Doubly%20LinkedList): `LinkedList/Doubly LinkedList`

### Interview problems

- [Amazon OA questions](https://github.com/aryan-iitmandi/dsa-practice/tree/main/amazonOA): `amazonOA`

### Other components

- **Learner**
- **Console result**

## Connections

- Learner → Array fundamentals: chooses topic (evidence: `README.md`)
- Learner → Array problems: chooses topic (evidence: `README.md`)
- Learner → Advanced arrays: chooses topic (evidence: `README.md`)
- Learner → C++ basics: chooses topic (evidence: `README.md`)
- Learner → Math basics: chooses topic (evidence: `README.md`)
- Learner → Recursion: chooses topic (evidence: `README.md`)
- Learner → Pattern printing: chooses topic (evidence: `README.md`)
- Learner → Hashing basics: chooses topic (evidence: `README.md`)
- Learner → STL containers: chooses topic (evidence: `README.md`)
- Learner → STL algorithms: chooses topic (evidence: `README.md`)
- Learner → 1D binary search: chooses topic (evidence: `README.md`)
- Learner → 2D binary search: chooses topic (evidence: `README.md`)
- Learner → Answer search: chooses topic (evidence: `README.md`)
- Learner → Sorting algorithms: chooses topic (evidence: `README.md`)
- Learner → String problems: chooses topic (evidence: `README.md`)
- Learner → Bit manipulation: chooses topic (evidence: `README.md`)
- Learner → Singly linked lists: chooses topic (evidence: `README.md`)
- Learner → Doubly linked lists: chooses topic (evidence: `README.md`)
- Learner → Amazon OA questions: chooses topic (evidence: `README.md`)
- Advanced arrays → Console result: prints result (evidence: `Array/Hard/3sum.cpp`)
- Array problems → Console result: prints result (evidence: `Array/Medium/setMatrixZero.cpp`)
- 1D binary search → Console result: prints result (evidence: `Binary Search/In 1D Array/searchElement.cpp`)
- 2D binary search → Console result: prints result (evidence: `Binary Search/In 2D Array/searchIn2D.cpp`)
- Sorting algorithms → Console result: prints result (evidence: `Sorting/mergeSort.cpp`)
- Singly linked lists → Console result: prints result (evidence: `LinkedList/1D LinkedList/operationsOnLL.cpp`)
- Doubly linked lists → Console result: prints result (evidence: `LinkedList/Doubly LinkedList/operationsOnDoublyLL.cpp`)
- Amazon OA questions → Console result: prints result (evidence: `amazonOA/Q1.cpp`)
