# adityakumarprasad33-cpu/ds-cap2012ca3 architecture

> Architecture diagram of the GitHub repository adityakumarprasad33-cpu/ds-cap2012ca3, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-11-19). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/adityakumarprasad33-cpu/ds-cap2012ca3
- Repository: https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3

## Overview

This repository is a collection of independent C++ LeetCode solution snippets, not a single application pipeline. A caller supplies each problem’s input to its corresponding solution and receives a result; the snippets do not call one another. The map groups solutions by broad data-structure and algorithm domain. The README is empty, and the excerpts show solution implementations rather than caller wiring, so invocation edges are dashed and unverified.

Main entry points: [`Easy/01_LC001_TwoSum_Easy.cpp`](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/01_LC001_TwoSum_Easy.cpp) (Two Sum), [`Easy/02_LC066_PlusOne_Easy.cpp`](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/02_LC066_PlusOne_Easy.cpp) (Plus One), [`Easy/03_LC283_MoveZeroes_Easy.cpp`](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/03_LC283_MoveZeroes_Easy.cpp) (Move Zeroes), [`Easy/04_LC121_BestTimeToBuySellStock_Easy.cpp`](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/04_LC121_BestTimeToBuySellStock_Easy.cpp) (Stock Profit)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array Algorithms"]
  node_two_sum["Two Sum"]
  node_plus_one["Plus One"]
  node_move_zeroes["Move Zeroes"]
  node_stock_profit["Stock Profit"]
end

subgraph group_lists["Linked Lists"]
  node_add_numbers["Add Two Numbers"]
  node_rotate_list["Rotate List"]
  node_deduplicate_list["Remove List Duplicates"]
  node_merge_lists["Merge K Lists"]
  node_reverse_groups["Reverse K Groups"]
  node_reverse_list["Reverse List"]
  node_list_cycle["Detect List Cycle"]
  node_middle_list["Find List Middle"]
end

subgraph group_stacks["Stacks and Queues"]
  node_valid_parentheses["Valid Parentheses"]
  node_stack_queues["Stack Using Queues"]
  node_circular_queue["Circular Queue"]
  node_asteroid_collision["Asteroid Collision"]
end

node_caller(("Problem Caller"))

node_caller -.->|"invokes"| node_two_sum
node_caller -.->|"invokes"| node_plus_one
node_caller -.->|"invokes"| node_move_zeroes
node_caller -.->|"invokes"| node_stock_profit
node_caller -.->|"invokes"| node_add_numbers
node_caller -.->|"invokes"| node_rotate_list
node_caller -.->|"invokes"| node_deduplicate_list
node_caller -.->|"invokes"| node_merge_lists
node_caller -.->|"invokes"| node_reverse_groups
node_caller -.->|"invokes"| node_reverse_list
node_caller -.->|"invokes"| node_list_cycle
node_caller -.->|"invokes"| node_middle_list
node_caller -.->|"invokes"| node_valid_parentheses
node_caller -.->|"invokes"| node_stack_queues
node_caller -.->|"invokes"| node_circular_queue
node_caller -.->|"invokes"| node_asteroid_collision

click node_two_sum "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/01_LC001_TwoSum_Easy.cpp"
click node_plus_one "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/02_LC066_PlusOne_Easy.cpp"
click node_move_zeroes "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/03_LC283_MoveZeroes_Easy.cpp"
click node_stock_profit "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/04_LC121_BestTimeToBuySellStock_Easy.cpp"
click node_add_numbers "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/10_LC002_AddTwoNumbers_Medium.cpp"
click node_rotate_list "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/11_LC061_RotateList_Medium.cpp"
click node_deduplicate_list "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/12_LC082_RemoveDuplicatesSortedListII_Medium.cpp"
click node_merge_lists "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Hard/15_LC023_MergeKSortedLists_Hard.cpp"
click node_reverse_groups "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Hard/16_LC025_ReverseNodesInKGroup_Hard.cpp"
click node_reverse_list "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/06_LC206_ReverseLinkedList_Easy.cpp"
click node_list_cycle "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/07_LC141_LinkedListCycle_Easy.cpp"
click node_middle_list "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/08_LC876_MiddleOfLinkedList_Easy.cpp"
click node_valid_parentheses "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/05_LC020_ValidParentheses_Easy.cpp"
click node_stack_queues "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/09_LC225_ImplementStackUsingQueues_Easy.cpp"
click node_circular_queue "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/13_LC622_DesignCircularQueue_Medium.cpp"
click node_asteroid_collision "https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/14_LC735_AsteroidCollision_Medium.cpp"

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_two_sum,node_plus_one,node_move_zeroes,node_stock_profit toneBlue
class node_add_numbers,node_rotate_list,node_deduplicate_list,node_merge_lists,node_reverse_groups,node_reverse_list,node_list_cycle,node_middle_list toneAmber
class node_valid_parentheses,node_stack_queues,node_circular_queue,node_asteroid_collision toneMint
class node_caller toneIndigo
```

## Components

### Array Algorithms

- [Two Sum](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/01_LC001_TwoSum_Easy.cpp): `Easy/01_LC001_TwoSum_Easy.cpp`
- [Plus One](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/02_LC066_PlusOne_Easy.cpp): `Easy/02_LC066_PlusOne_Easy.cpp`
- [Move Zeroes](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/03_LC283_MoveZeroes_Easy.cpp): `Easy/03_LC283_MoveZeroes_Easy.cpp`
- [Stock Profit](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/04_LC121_BestTimeToBuySellStock_Easy.cpp): `Easy/04_LC121_BestTimeToBuySellStock_Easy.cpp`

### Linked Lists

- [Add Two Numbers](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/10_LC002_AddTwoNumbers_Medium.cpp): `Medium/10_LC002_AddTwoNumbers_Medium.cpp`
- [Rotate List](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/11_LC061_RotateList_Medium.cpp): `Medium/11_LC061_RotateList_Medium.cpp`
- [Remove List Duplicates](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/12_LC082_RemoveDuplicatesSortedListII_Medium.cpp): `Medium/12_LC082_RemoveDuplicatesSortedListII_Medium.cpp`
- [Merge K Lists](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Hard/15_LC023_MergeKSortedLists_Hard.cpp): `Hard/15_LC023_MergeKSortedLists_Hard.cpp`
- [Reverse K Groups](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Hard/16_LC025_ReverseNodesInKGroup_Hard.cpp): `Hard/16_LC025_ReverseNodesInKGroup_Hard.cpp`
- [Reverse List](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/06_LC206_ReverseLinkedList_Easy.cpp): `Easy/06_LC206_ReverseLinkedList_Easy.cpp`
- [Detect List Cycle](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/07_LC141_LinkedListCycle_Easy.cpp): `Easy/07_LC141_LinkedListCycle_Easy.cpp`
- [Find List Middle](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/08_LC876_MiddleOfLinkedList_Easy.cpp): `Easy/08_LC876_MiddleOfLinkedList_Easy.cpp`

### Stacks and Queues

- [Valid Parentheses](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/05_LC020_ValidParentheses_Easy.cpp): `Easy/05_LC020_ValidParentheses_Easy.cpp`
- [Stack Using Queues](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Easy/09_LC225_ImplementStackUsingQueues_Easy.cpp): `Easy/09_LC225_ImplementStackUsingQueues_Easy.cpp`
- [Circular Queue](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/13_LC622_DesignCircularQueue_Medium.cpp): `Medium/13_LC622_DesignCircularQueue_Medium.cpp`
- [Asteroid Collision](https://github.com/adityakumarprasad33-cpu/ds-cap2012ca3/blob/main/Medium/14_LC735_AsteroidCollision_Medium.cpp): `Medium/14_LC735_AsteroidCollision_Medium.cpp`

### Other components

- **Problem Caller**

## Connections

- Problem Caller → Two Sum: invokes
- Problem Caller → Plus One: invokes
- Problem Caller → Move Zeroes: invokes
- Problem Caller → Stock Profit: invokes
- Problem Caller → Add Two Numbers: invokes
- Problem Caller → Rotate List: invokes
- Problem Caller → Remove List Duplicates: invokes
- Problem Caller → Merge K Lists: invokes
- Problem Caller → Reverse K Groups: invokes
- Problem Caller → Reverse List: invokes
- Problem Caller → Detect List Cycle: invokes
- Problem Caller → Find List Middle: invokes
- Problem Caller → Valid Parentheses: invokes
- Problem Caller → Stack Using Queues: invokes
- Problem Caller → Circular Queue: invokes
- Problem Caller → Asteroid Collision: invokes
