# mithranmurugavel/leetcode architecture

> Architecture diagram of the GitHub repository mithranmurugavel/leetcode, 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/mithranmurugavel/leetcode
- Repository: https://github.com/mithranmurugavel/leetcode

## Overview

This repository is a collection of independent LeetCode problem solutions, not a single application or shared processing pipeline. A user supplies each problem’s inputs to its solution and receives that solution’s result. The graph groups representative solutions by problem domain; the files shown implement their own algorithms, with no shared runtime or cross-solution calls evidenced. The README and file tree establish the collection’s purpose, but do not document a common execution platform, so invocation links are dashed and unverified.

Main entry points: [`0001-two-sum/0001-two-sum.java`](https://github.com/mithranmurugavel/leetcode/blob/main/0001-two-sum/0001-two-sum.java) (Two Sum), [`0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java`](https://github.com/mithranmurugavel/leetcode/blob/main/0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java) (Median arrays), [`0015-3sum/0015-3sum.java`](https://github.com/mithranmurugavel/leetcode/blob/main/0015-3sum/0015-3sum.java) (3Sum), [`0074-search-a-2d-matrix/0074-search-a-2d-matrix.java`](https://github.com/mithranmurugavel/leetcode/blob/main/0074-search-a-2d-matrix/0074-search-a-2d-matrix.java) (Matrix search)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array algorithms"]
  node_two_sum["Two Sum<br/>[0001-two-sum.java]"]
  node_median_arrays["Median arrays"]
  node_three_sum["3Sum<br/>[0015-3sum.java]"]
  node_matrix_search["Matrix search"]
  node_rain_water["Trapping rainwater"]
end

subgraph group_strings["String algorithms"]
  node_substring["Longest substring"]
  node_roman["Roman conversion"]
  node_parentheses["Parentheses generation"]
end

subgraph group_trees["Tree algorithms"]
  node_tree_walk["Inorder traversal"]
  node_bst_insert["BST insertion"]
end

subgraph group_dynamic["Dynamic programming"]
  node_sudoku["Sudoku solver"]
  node_house_robber["House robber"]
end

subgraph group_structures["Data structures"]
  node_cache["LRU cache"]
  node_range_sum["Range sum"]
end

node_user(("Problem solver"))

node_user -.->|"submits input"| node_two_sum
node_user -.->|"submits input"| node_median_arrays
node_user -.->|"submits input"| node_three_sum
node_user -.->|"submits input"| node_matrix_search
node_user -.->|"submits input"| node_rain_water
node_user -.->|"submits input"| node_substring
node_user -.->|"submits input"| node_roman
node_user -.->|"submits input"| node_parentheses
node_user -.->|"submits input"| node_tree_walk
node_user -.->|"submits input"| node_bst_insert
node_user -.->|"submits input"| node_sudoku
node_user -.->|"submits input"| node_house_robber
node_user -.->|"submits input"| node_cache
node_user -.->|"submits input"| node_range_sum

click node_two_sum "https://github.com/mithranmurugavel/leetcode/blob/main/0001-two-sum/0001-two-sum.java"
click node_median_arrays "https://github.com/mithranmurugavel/leetcode/blob/main/0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java"
click node_three_sum "https://github.com/mithranmurugavel/leetcode/blob/main/0015-3sum/0015-3sum.java"
click node_matrix_search "https://github.com/mithranmurugavel/leetcode/blob/main/0074-search-a-2d-matrix/0074-search-a-2d-matrix.java"
click node_rain_water "https://github.com/mithranmurugavel/leetcode/blob/main/0042-trapping-rain-water/0042-trapping-rain-water.java"
click node_substring "https://github.com/mithranmurugavel/leetcode/blob/main/0003-longest-substring-without-repeating-characters/0003-longest-substring-without-repeating-characters.java"
click node_roman "https://github.com/mithranmurugavel/leetcode/blob/main/0012-integer-to-roman/0012-integer-to-roman.java"
click node_parentheses "https://github.com/mithranmurugavel/leetcode/blob/main/0022-generate-parentheses/0022-generate-parentheses.java"
click node_tree_walk "https://github.com/mithranmurugavel/leetcode/blob/main/0094-binary-tree-inorder-traversal/0094-binary-tree-inorder-traversal.java"
click node_bst_insert "https://github.com/mithranmurugavel/leetcode/blob/main/0784-insert-into-a-binary-search-tree/0784-insert-into-a-binary-search-tree.java"
click node_sudoku "https://github.com/mithranmurugavel/leetcode/blob/main/0037-sudoku-solver/0037-sudoku-solver.java"
click node_house_robber "https://github.com/mithranmurugavel/leetcode/blob/main/0198-house-robber/0198-house-robber.java"
click node_cache "https://github.com/mithranmurugavel/leetcode/blob/main/0146-lru-cache/0146-lru-cache.java"
click node_range_sum "https://github.com/mithranmurugavel/leetcode/blob/main/0303-range-sum-query-immutable/0303-range-sum-query-immutable.java"

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_median_arrays,node_three_sum,node_matrix_search,node_rain_water toneBlue
class node_substring,node_roman,node_parentheses toneAmber
class node_tree_walk,node_bst_insert toneMint
class node_sudoku,node_house_robber toneRose
class node_cache,node_range_sum,node_user toneIndigo
```

## Components

### Array algorithms

- [Two Sum](https://github.com/mithranmurugavel/leetcode/blob/main/0001-two-sum/0001-two-sum.java): `0001-two-sum/0001-two-sum.java`
- [Median arrays](https://github.com/mithranmurugavel/leetcode/blob/main/0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java): `0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java`
- [3Sum](https://github.com/mithranmurugavel/leetcode/blob/main/0015-3sum/0015-3sum.java): `0015-3sum/0015-3sum.java`
- [Matrix search](https://github.com/mithranmurugavel/leetcode/blob/main/0074-search-a-2d-matrix/0074-search-a-2d-matrix.java): `0074-search-a-2d-matrix/0074-search-a-2d-matrix.java`
- [Trapping rainwater](https://github.com/mithranmurugavel/leetcode/blob/main/0042-trapping-rain-water/0042-trapping-rain-water.java): `0042-trapping-rain-water/0042-trapping-rain-water.java`

### String algorithms

- [Longest substring](https://github.com/mithranmurugavel/leetcode/blob/main/0003-longest-substring-without-repeating-characters/0003-longest-substring-without-repeating-characters.java): `0003-longest-substring-without-repeating-characters/0003-longest-substring-without-repeating-characters.java`
- [Roman conversion](https://github.com/mithranmurugavel/leetcode/blob/main/0012-integer-to-roman/0012-integer-to-roman.java): `0012-integer-to-roman/0012-integer-to-roman.java`
- [Parentheses generation](https://github.com/mithranmurugavel/leetcode/blob/main/0022-generate-parentheses/0022-generate-parentheses.java): `0022-generate-parentheses/0022-generate-parentheses.java`

### Tree algorithms

- [Inorder traversal](https://github.com/mithranmurugavel/leetcode/blob/main/0094-binary-tree-inorder-traversal/0094-binary-tree-inorder-traversal.java): `0094-binary-tree-inorder-traversal/0094-binary-tree-inorder-traversal.java`
- [BST insertion](https://github.com/mithranmurugavel/leetcode/blob/main/0784-insert-into-a-binary-search-tree/0784-insert-into-a-binary-search-tree.java): `0784-insert-into-a-binary-search-tree/0784-insert-into-a-binary-search-tree.java`

### Dynamic programming

- [Sudoku solver](https://github.com/mithranmurugavel/leetcode/blob/main/0037-sudoku-solver/0037-sudoku-solver.java): `0037-sudoku-solver/0037-sudoku-solver.java`
- [House robber](https://github.com/mithranmurugavel/leetcode/blob/main/0198-house-robber/0198-house-robber.java): `0198-house-robber/0198-house-robber.java`

### Data structures

- [LRU cache](https://github.com/mithranmurugavel/leetcode/blob/main/0146-lru-cache/0146-lru-cache.java): `0146-lru-cache/0146-lru-cache.java`
- [Range sum](https://github.com/mithranmurugavel/leetcode/blob/main/0303-range-sum-query-immutable/0303-range-sum-query-immutable.java): `0303-range-sum-query-immutable/0303-range-sum-query-immutable.java`

### Other components

- **Problem solver**

## Connections

- Problem solver → Two Sum: submits input
- Problem solver → Median arrays: submits input
- Problem solver → 3Sum: submits input
- Problem solver → Matrix search: submits input
- Problem solver → Trapping rainwater: submits input
- Problem solver → Longest substring: submits input
- Problem solver → Roman conversion: submits input
- Problem solver → Parentheses generation: submits input
- Problem solver → Inorder traversal: submits input
- Problem solver → BST insertion: submits input
- Problem solver → Sudoku solver: submits input
- Problem solver → House robber: submits input
- Problem solver → LRU cache: submits input
- Problem solver → Range sum: submits input
