# nakulbajaj101/practice-data-structures-and-algorithms architecture

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

- Interactive diagram: https://gitdiagram.com/nakulbajaj101/practice-data-structures-and-algorithms
- Repository: https://github.com/nakulbajaj101/practice-data-structures-and-algorithms

## Overview

##### Project type and purpose
- This is an educational “practice” repository of data-structures and algorithm implementations.
- It contains parallel implementations in two languages: JavaScript and Python.
- There are no external services, deployment scripts or runtime components—it’s purely code samples.

##### File structure
- Top-level files and folders correspond to major topics:
- Arrays (arraySection, arrayStructure, repeatedArray)
- Linked lists (linkedLists, doubly_linked_lists)
- Stacks and queues (stacks, queues, stackWithQueue)
- Hash tables (hashTables)
- Trees (binary_search_trees)
- Graphs (graphs)
- Recursion (folder containing factorial, fibonacci, reversal)
- Sorting (folder containing bubble, insertion, merge, quick, selection)
- Each topic has two implementations: .js files and .py files.
- No controllers, no services—just modules.

##### README for additional insights
- Confirms the repo is a playground for coding and practice.
- No architectural hints beyond topic grouping.

## Diagram (Mermaid)

```mermaid
flowchart TD
  subgraph "JavaScript" 
    direction TB
    subgraph "Data Structures"
      ARR_JS["Arrays"]:::ds
      LL_JS["LinkedLists"]:::ds
      STK_JS["Stacks"]:::ds
      QUE_JS["Queues"]:::ds
      SWQ_JS["StackWithQueue"]:::ds
      HT_JS["HashTables"]:::ds
      RA_JS["RepeatedArray"]:::ds
      GC_JS["GoodCodeExamples"]:::ds
    end
    subgraph "Recursion"
      RF_JS["Factorial"]:::rec
      RFI_JS["Fibonacci"]:::rec
      RR_JS["Reversal"]:::rec
    end
    subgraph "Sorting"
      BS_JS["BubbleSort"]:::sort
      IS_JS["InsertionSort"]:::sort
      MS_JS["MergeSort"]:::sort
      QS_JS["QuickSort"]:::sort
      SS_JS["SelectionSort"]:::sort
    end
  end

  subgraph "Python"
    direction TB
    subgraph "Data Structures"
      ARR_PY["Arrays"]:::ds
      LL_PY["LinkedLists"]:::ds
      DLL_PY["DoublyLinkedLists"]:::ds
      STK_PY["Stacks"]:::ds
      QUE_PY["Queues"]:::ds
      SWQ_PY["StackWithQueue"]:::ds
      HT_PY["HashTables"]:::ds
      BST_PY["BinarySearchTrees"]:::ds
      GPH_PY["Graphs"]:::ds
      RA_PY["RepeatedArray"]:::ds
      GC_PY["GoodCodeExamples"]:::ds
    end
    subgraph "Recursion"
      RF_PY["Factorial"]:::rec
      RFI_PY["Fibonacci"]:::rec
      RR_PY["Reversal"]:::rec
    end
    subgraph "Sorting"
      BS_PY["BubbleSort"]:::sort
      IS_PY["InsertionSort"]:::sort
      MS_PY["MergeSort"]:::sort
      QS_PY["QuickSort"]:::sort
      SS_PY["SelectionSort"]:::sort
    end
  end

  %% Parallel implementation links
  ARR_JS <--> ARR_PY
  LL_JS <--> LL_PY
  STK_JS <--> STK_PY
  QUE_JS <--> QUE_PY
  SWQ_JS <--> SWQ_PY
  HT_JS <--> HT_PY
  RA_JS <--> RA_PY
  GC_JS <--> GC_PY

  RF_JS <--> RF_PY
  RFI_JS <--> RFI_PY
  RR_JS <--> RR_PY

  BS_JS <--> BS_PY
  IS_JS <--> IS_PY
  MS_JS <--> MS_PY
  QS_JS <--> QS_PY
  SS_JS <--> SS_PY

  %% Click events
  click ARR_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/arraySection.js"
  click LL_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/linkedLists.js"
  click STK_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/stacks.js"
  click QUE_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/queue.js"
  click SWQ_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/stackWithQueue.js"
  click HT_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/hashTables.js"
  click RA_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/repeatedArray.js"
  click GC_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/good_code.js"
  click RF_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/recursion/recursionFactorial.js"
  click RFI_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/recursion/recursionFibonnaci.js"
  click RR_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/recursion/recursionReversal.js"
  click BS_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/bubbleSort.js"
  click IS_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/insertSort.js"
  click MS_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/mergeSort.js"
  click QS_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/quickSort.js"
  click SS_JS "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/selectionSort.js"

  click ARR_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/array_section.py"
  click LL_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/linked_lists.py"
  click DLL_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/doubly_linked_lists.py"
  click STK_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/stacks.py"
  click QUE_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/queues.py"
  click SWQ_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/stack_with_queue.py"
  click HT_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/hash_tables.py"
  click BST_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/binary_search_trees.py"
  click GPH_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/graphs.py"
  click RA_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/repeated_array.py"
  click GC_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/good_code.py"
  click RF_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/recursion/recursion_factorial.py"
  click RFI_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/recursion/recursion_fibonnaci.py"
  click RR_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/recursion/recursion_reversal.py"
  click BS_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/bubble_sort.py"
  click IS_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/insert_sort.py"
  click MS_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/merge_sort.py"
  click QS_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/quick_sort.py"
  click SS_PY "https://github.com/nakulbajaj101/practice-data-structures-and-algorithms/blob/main/sorting/selection_sort.py"

  %% Styles
  classDef ds fill:#FFD700,stroke:#333,stroke-width:1px
  classDef rec fill:#ADFF2F,stroke:#333,stroke-width:1px
  classDef sort fill:#87CEFA,stroke:#333,stroke-width:1px
```
