# arunmanikandan-c/neetcode-submissions architecture

> Architecture diagram of the GitHub repository arunmanikandan-c/neetcode-submissions, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-09-28). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/arunmanikandan-c/neetcode-submissions
- Repository: https://github.com/arunmanikandan-c/neetcode-submissions

## Overview

This repository is a NeetCode GitHub Sync archive of independently submitted interview-problem solutions, not an application that runs them as a connected pipeline. A user selects a problem solution, supplies its inputs, and receives its computed result. The graph samples the major algorithm families represented in the tree; each solution is standalone. Source excerpts confirm the shown implementations, but not the wiring of the NeetCode platform or every unsampled submission.

Main entry points: [`Data Structures & Algorithms/search-2d-matrix/submission-0.py`](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/search-2d-matrix/submission-0.py) (Matrix search), [`Data Structures & Algorithms/three-integer-sum/submission-0.py`](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/three-integer-sum/submission-0.py) (Three-sum), [`Data Structures & Algorithms/find-target-in-rotated-sorted-array/submission-1.py`](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/find-target-in-rotated-sorted-array/submission-1.py) (Rotated search), [`Data Structures & Algorithms/median-of-two-sorted-arrays/submission-0.py`](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/median-of-two-sorted-arrays/submission-0.py) (Array median)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Arrays & Search"]
  node_array_search["Array & search solutions"]
  node_matrix_search["Matrix search<br/>[submission-0.py]"]
  node_three_sum["Three-sum<br/>[submission-0.py]"]
  node_rotated_search["Rotated search<br/>[submission-1.py]"]
  node_median_arrays["Array median<br/>[submission-0.py]"]
end

subgraph group_strings["String Problems"]
  node_string_solutions["String solutions"]
end

subgraph group_trees_graphs["Trees &amp; Graphs"]
  node_graph_clone["Graph cloning<br/>[submission-0.py]"]
  node_tree_balance["Tree balance<br/>[submission-0.py]"]
  node_island_area["Island area<br/>[submission-0.cpp]"]
end

subgraph group_structures_dp["Structures &amp; DP"]
  node_timemap["Time map<br/>[submission-2.py]"]
  node_hashmap["Hash map<br/>[submission-0.py]"]
  node_climbing_stairs["Climbing stairs<br/>[submission-2.py]"]
  node_combinations["Combination search<br/>[submission-0.py]"]
end

node_user(("Solution user"))
node_result(("Computed result"))

node_user -->|"supplies input"| node_matrix_search
node_matrix_search -->|"returns match"| node_result
node_user -->|"supplies input"| node_three_sum
node_three_sum -->|"returns triplets"| node_result
node_user -->|"supplies input"| node_rotated_search
node_rotated_search -->|"returns index"| node_result
node_user -->|"supplies input"| node_median_arrays
node_median_arrays -->|"returns median"| node_result
node_user -->|"supplies graph"| node_graph_clone
node_graph_clone -->|"returns clone"| node_result
node_user -->|"supplies tree"| node_tree_balance
node_tree_balance -->|"returns balance"| node_result
node_user -->|"supplies grid"| node_island_area
node_island_area -->|"returns area"| node_result
node_user -->|"calls methods"| node_timemap
node_timemap -->|"returns value"| node_result
node_user -->|"calls methods"| node_hashmap
node_hashmap -->|"returns value"| node_result
node_user -->|"supplies input"| node_climbing_stairs
node_climbing_stairs -->|"returns count"| node_result
node_user -->|"supplies input"| node_combinations
node_combinations -->|"returns combinations"| node_result

click node_array_search "https://github.com/arunmanikandan-c/neetcode-submissions/tree/main/Data%20Structures%20%26%20Algorithms"
click node_matrix_search "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/search-2d-matrix/submission-0.py"
click node_three_sum "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/three-integer-sum/submission-0.py"
click node_rotated_search "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/find-target-in-rotated-sorted-array/submission-1.py"
click node_median_arrays "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/median-of-two-sorted-arrays/submission-0.py"
click node_string_solutions "https://github.com/arunmanikandan-c/neetcode-submissions/tree/main/Data%20Structures%20%26%20Algorithms"
click node_graph_clone "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/clone-graph/submission-0.py"
click node_tree_balance "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/balanced-binary-tree/submission-0.py"
click node_island_area "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/max-area-of-island/submission-0.cpp"
click node_timemap "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/time-based-key-value-store/submission-2.py"
click node_hashmap "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/design-hashmap/submission-0.py"
click node_climbing_stairs "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/climbing-stairs/submission-2.py"
click node_combinations "https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/combination-target-sum-ii/submission-0.py"

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_array_search,node_matrix_search,node_three_sum,node_rotated_search,node_median_arrays,node_user toneBlue
class node_string_solutions toneAmber
class node_graph_clone,node_tree_balance,node_island_area toneMint
class node_timemap,node_hashmap,node_climbing_stairs,node_combinations toneRose
class node_result toneIndigo
```

## Components

### Arrays & Search

- [Array & search solutions](https://github.com/arunmanikandan-c/neetcode-submissions/tree/main/Data%20Structures%20%26%20Algorithms): `Data Structures & Algorithms`
- [Matrix search](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/search-2d-matrix/submission-0.py): `Data Structures & Algorithms/search-2d-matrix/submission-0.py`
- [Three-sum](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/three-integer-sum/submission-0.py): `Data Structures & Algorithms/three-integer-sum/submission-0.py`
- [Rotated search](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/find-target-in-rotated-sorted-array/submission-1.py): `Data Structures & Algorithms/find-target-in-rotated-sorted-array/submission-1.py`
- [Array median](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/median-of-two-sorted-arrays/submission-0.py): `Data Structures & Algorithms/median-of-two-sorted-arrays/submission-0.py`

### String Problems

- [String solutions](https://github.com/arunmanikandan-c/neetcode-submissions/tree/main/Data%20Structures%20%26%20Algorithms): `Data Structures & Algorithms`

### Trees & Graphs

- [Graph cloning](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/clone-graph/submission-0.py): `Data Structures & Algorithms/clone-graph/submission-0.py`
- [Tree balance](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/balanced-binary-tree/submission-0.py): `Data Structures & Algorithms/balanced-binary-tree/submission-0.py`
- [Island area](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/max-area-of-island/submission-0.cpp): `Data Structures & Algorithms/max-area-of-island/submission-0.cpp`

### Structures & DP

- [Time map](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/time-based-key-value-store/submission-2.py): `Data Structures & Algorithms/time-based-key-value-store/submission-2.py`
- [Hash map](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/design-hashmap/submission-0.py): `Data Structures & Algorithms/design-hashmap/submission-0.py`
- [Climbing stairs](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/climbing-stairs/submission-2.py): `Data Structures & Algorithms/climbing-stairs/submission-2.py`
- [Combination search](https://github.com/arunmanikandan-c/neetcode-submissions/blob/main/Data%20Structures%20%26%20Algorithms/combination-target-sum-ii/submission-0.py): `Data Structures & Algorithms/combination-target-sum-ii/submission-0.py`

### Other components

- **Solution user**
- **Computed result**

## Connections

- Solution user → Matrix search: supplies input
- Matrix search → Computed result: returns match
- Solution user → Three-sum: supplies input
- Three-sum → Computed result: returns triplets
- Solution user → Rotated search: supplies input
- Rotated search → Computed result: returns index
- Solution user → Array median: supplies input
- Array median → Computed result: returns median
- Solution user → Graph cloning: supplies graph
- Graph cloning → Computed result: returns clone
- Solution user → Tree balance: supplies tree
- Tree balance → Computed result: returns balance
- Solution user → Island area: supplies grid
- Island area → Computed result: returns area
- Solution user → Time map: calls methods
- Time map → Computed result: returns value
- Solution user → Hash map: calls methods
- Hash map → Computed result: returns value
- Solution user → Climbing stairs: supplies input
- Climbing stairs → Computed result: returns count
- Solution user → Combination search: supplies input
- Combination search → Computed result: returns combinations