# fardinkazi/dsa-practice architecture

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

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

## Overview

##### Project type and purpose
- This is a C++ “Data Structures & Algorithms Practice” repository. It’s not a service or product, but rather a collection of standalone algorithm implementations organized by topic (Arrays, Numbers, Sorting, Strings, Searching). The goal is to track and optimize your problem-solving work.

##### File structure
- Top-level directories:
- Arrays  – solutions to array problems
- Nums    – number-theory and numeric problems
- Sorting – sorting algorithm implementations
- Str     – string manipulation and analysis
- searching – search algorithm implementations
- Each directory contains one .cpp source per problem; no shared libraries, no build scripts, no external dependencies.

##### README for additional insights
- Confirms that this is a personal practice repo, pulling problems from sites like GfG and LeetCode.
- No run-time architecture or deployment steps—just source files.

##### Detail without overcomplication
- Five topic modules as separate components.
- That there are zero direct inter-module calls.

## Diagram (Mermaid)

```mermaid
flowchart TB
    %% Runner component
    Runner["Compiler/Runner"]:::runner

    %% Modules with representative files
    subgraph "Arrays Module"
        ArraysModule["Arrays Module\n2 .cpp files"]:::module
        TwoSum["TwoSum.cpp"]:::file
        MaxSubarray["MaxSubarray.cpp"]:::file
        ArraysModule --> TwoSum
        ArraysModule --> MaxSubarray
    end

    subgraph "Numbers Module"
        NumsModule["Nums Module\n2 .cpp files"]:::module
        PrimeCheck["PrimeCheck.cpp"]:::file
        Factorial["Factorial.cpp"]:::file
        NumsModule --> PrimeCheck
        NumsModule --> Factorial
    end

    subgraph "Sorting Module"
        SortingModule["Sorting Module\n2 .cpp files"]:::module
        BubbleSort["BubbleSort.cpp"]:::file
        MergeSort["MergeSort.cpp"]:::file
        SortingModule --> BubbleSort
        SortingModule --> MergeSort
    end

    subgraph "Strings Module"
        StringsModule["Strings Module\n2 .cpp files"]:::module
        ReverseString["ReverseString.cpp"]:::file
        Anagram["Anagram.cpp"]:::file
        StringsModule --> ReverseString
        StringsModule --> Anagram
    end

    subgraph "Searching Module"
        SearchingModule["Searching Module\n2 .cpp files"]:::module
        BinarySearch["BinarySearch.cpp"]:::file
        DFS["DFS.cpp"]:::file
        SearchingModule --> BinarySearch
        SearchingModule --> DFS
    end

    %% Dependencies
    Runner -->|"compiles/executessolutions"| ArraysModule
    Runner -->|"compiles/executessolutions"| NumsModule
    Runner -->|"compiles/executessolutions"| SortingModule
    Runner -->|"compiles/executessolutions"| StringsModule
    Runner -->|"compiles/executessolutions"| SearchingModule

    %% Click events for modules
    click ArraysModule "https://github.com/fardinkazi/dsa-practice/tree/main/Arrays/"
    click NumsModule "https://github.com/fardinkazi/dsa-practice/tree/main/Nums/"
    click SortingModule "https://github.com/fardinkazi/dsa-practice/tree/main/Sorting/"
    click StringsModule "https://github.com/fardinkazi/dsa-practice/tree/main/Str/"
    click SearchingModule "https://github.com/fardinkazi/dsa-practice/tree/main/searching/"

    %% Styling
    classDef module fill:#AED6F1,stroke:#2E86C1,color:#1B4F72;
    classDef runner fill:#A3E4D7,stroke:#239B56,color:#145A32;
    classDef file fill:#F9E79F,stroke:#B7950B,color:#7D6608;
```
