# itz-arun-001/leetcode_solutions architecture

> Architecture diagram of the GitHub repository itz-arun-001/leetcode_solutions, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-01). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/itz-arun-001/leetcode_solutions
- Repository: https://github.com/itz-arun-001/leetcode_solutions

## Overview

This repository is a personal LeetCode solution collection, not a single application: users navigate by topic or pattern, select a problem, and use its working code to solve it. The README also describes write-ups and test cases, but the supplied tree and excerpts mainly show standalone C++ and Java solutions. The graph groups representative problem solutions by topic family; edges show documented navigation, not calls between solutions. Individual submission and judging behavior is not shown in the excerpts.

Main entry points: [`Design/859-design-circular-deque/2026-06-18 19.30.00 - Accepted - runtime 5ms - memory 21.2MB.cpp`](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Design/859-design-circular-deque/2026-06-18%2019.30.00%20-%20Accepted%20-%20runtime%205ms%20-%20memory%2021.2MB.cpp) (Circular deque), [`Monotonic Stack/84-largest-rectangle-in-histogram/2026-06-22 18.43.40 - Accepted - runtime 12ms - memory 81.3MB.cpp`](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Monotonic%20Stack/84-largest-rectangle-in-histogram/2026-06-22%2018.43.40%20-%20Accepted%20-%20runtime%2012ms%20-%20memory%2081.3MB.cpp) (Histogram area), [`Array/150-evaluate-reverse-polish-notation/2026-06-19 18.37.41 - Accepted - runtime 0ms - memory 16MB.cpp`](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Array/150-evaluate-reverse-polish-notation/2026-06-19%2018.37.41%20-%20Accepted%20-%20runtime%200ms%20-%20memory%2016MB.cpp) (RPN evaluation), [`Array/212-word-search-ii/solution.cpp`](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Array/212-word-search-ii/solution.cpp) (Word Search II)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Arrays and search"]
  node_array_solutions["Array solutions"]
  node_binary_search["Binary search"]
  node_greedy["Greedy solutions"]
end

subgraph group_algorithms["Algorithm patterns"]
  node_dp["Dynamic programming"]
  node_backtracking["Backtracking"]
  node_matrix["Matrix search"]
end

subgraph group_structures["Data structures"]
  node_stack["Stack solutions"]
  node_queue["Queue solutions"]
  node_linked_list["Linked lists"]
  node_deque_solution["Circular deque"]
  node_histogram_solution["Histogram area"]
  node_rpn_solution["RPN evaluation"]
end

subgraph group_trees_strings["Trees and strings"]
  node_tree_solutions["Tree solutions"]
  node_trie["Trie search"]
  node_string_solutions["String solutions"]
  node_word_search["Word Search II<br/>[solution.cpp]"]
  node_backspace_solution["Backspace compare"]
end

node_user(("Learner"))
node_judge(("LeetCode judge"))

node_user -->|"browses topics"| node_array_solutions
node_user -->|"browses topics"| node_binary_search
node_user -->|"browses topics"| node_greedy
node_user -->|"browses topics"| node_dp
node_user -->|"browses topics"| node_backtracking
node_user -->|"browses topics"| node_matrix
node_user -->|"browses topics"| node_stack
node_user -->|"browses topics"| node_queue
node_user -->|"browses topics"| node_linked_list
node_user -->|"browses topics"| node_tree_solutions
node_user -->|"browses topics"| node_trie
node_user -->|"browses topics"| node_string_solutions
node_user -->|"selects solution"| node_word_search
node_user -->|"selects solution"| node_deque_solution
node_user -->|"selects solution"| node_histogram_solution
node_user -->|"selects solution"| node_rpn_solution
node_user -->|"selects solution"| node_backspace_solution
node_word_search -.->|"submit code"| node_judge
node_deque_solution -.->|"submit code"| node_judge
node_histogram_solution -.->|"submit code"| node_judge
node_rpn_solution -.->|"submit code"| node_judge
node_backspace_solution -.->|"submit code"| node_judge

click node_array_solutions "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Array"
click node_binary_search "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Binary%20Search"
click node_greedy "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Greedy"
click node_dp "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Dynamic%20Programming"
click node_backtracking "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Backtracking"
click node_matrix "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Matrix"
click node_stack "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Stack"
click node_queue "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Queue"
click node_linked_list "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Linked%20List"
click node_tree_solutions "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Tree"
click node_trie "https://github.com/itz-arun-001/leetcode_solutions/tree/main/Trie"
click node_string_solutions "https://github.com/itz-arun-001/leetcode_solutions/tree/main/String"
click node_word_search "https://github.com/itz-arun-001/leetcode_solutions/blob/main/Array/212-word-search-ii/solution.cpp"
click node_deque_solution "https://github.com/itz-arun-001/leetcode_solutions/blob/main/Design/859-design-circular-deque/2026-06-18%2019.30.00%20-%20Accepted%20-%20runtime%205ms%20-%20memory%2021.2MB.cpp"
click node_histogram_solution "https://github.com/itz-arun-001/leetcode_solutions/blob/main/Monotonic%20Stack/84-largest-rectangle-in-histogram/2026-06-22%2018.43.40%20-%20Accepted%20-%20runtime%2012ms%20-%20memory%2081.3MB.cpp"
click node_rpn_solution "https://github.com/itz-arun-001/leetcode_solutions/blob/main/Array/150-evaluate-reverse-polish-notation/2026-06-19%2018.37.41%20-%20Accepted%20-%20runtime%200ms%20-%20memory%2016MB.cpp"
click node_backspace_solution "https://github.com/itz-arun-001/leetcode_solutions/blob/main/String/874-backspace-string-compare/2026-06-20%2016.44.23%20-%20Accepted%20-%20runtime%200ms%20-%20memory%207.7MB.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_array_solutions,node_binary_search,node_greedy toneBlue
class node_dp,node_backtracking,node_matrix toneAmber
class node_stack,node_queue,node_linked_list,node_deque_solution,node_histogram_solution,node_rpn_solution toneMint
class node_tree_solutions,node_trie,node_string_solutions,node_word_search,node_backspace_solution toneRose
class node_user,node_judge toneIndigo
```

## Components

### Arrays and search

- [Array solutions](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Array): `Array`
- [Binary search](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Binary%20Search): `Binary Search`
- [Greedy solutions](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Greedy): `Greedy`

### Algorithm patterns

- [Dynamic programming](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Dynamic%20Programming): `Dynamic Programming`
- [Backtracking](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Backtracking): `Backtracking`
- [Matrix search](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Matrix): `Matrix`

### Data structures

- [Stack solutions](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Stack): `Stack`
- [Queue solutions](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Queue): `Queue`
- [Linked lists](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Linked%20List): `Linked List`
- [Circular deque](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Design/859-design-circular-deque/2026-06-18%2019.30.00%20-%20Accepted%20-%20runtime%205ms%20-%20memory%2021.2MB.cpp): `Design/859-design-circular-deque/2026-06-18 19.30.00 - Accepted - runtime 5ms - memory 21.2MB.cpp`
- [Histogram area](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Monotonic%20Stack/84-largest-rectangle-in-histogram/2026-06-22%2018.43.40%20-%20Accepted%20-%20runtime%2012ms%20-%20memory%2081.3MB.cpp): `Monotonic Stack/84-largest-rectangle-in-histogram/2026-06-22 18.43.40 - Accepted - runtime 12ms - memory 81.3MB.cpp`
- [RPN evaluation](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Array/150-evaluate-reverse-polish-notation/2026-06-19%2018.37.41%20-%20Accepted%20-%20runtime%200ms%20-%20memory%2016MB.cpp): `Array/150-evaluate-reverse-polish-notation/2026-06-19 18.37.41 - Accepted - runtime 0ms - memory 16MB.cpp`

### Trees and strings

- [Tree solutions](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Tree): `Tree`
- [Trie search](https://github.com/itz-arun-001/leetcode_solutions/tree/main/Trie): `Trie`
- [String solutions](https://github.com/itz-arun-001/leetcode_solutions/tree/main/String): `String`
- [Word Search II](https://github.com/itz-arun-001/leetcode_solutions/blob/main/Array/212-word-search-ii/solution.cpp): `Array/212-word-search-ii/solution.cpp`
- [Backspace compare](https://github.com/itz-arun-001/leetcode_solutions/blob/main/String/874-backspace-string-compare/2026-06-20%2016.44.23%20-%20Accepted%20-%20runtime%200ms%20-%20memory%207.7MB.cpp): `String/874-backspace-string-compare/2026-06-20 16.44.23 - Accepted - runtime 0ms - memory 7.7MB.cpp`

### Other components

- **Learner**
- **LeetCode judge**

## Connections

- Learner → Array solutions: browses topics (evidence: `README.md`)
- Learner → Binary search: browses topics (evidence: `README.md`)
- Learner → Greedy solutions: browses topics (evidence: `README.md`)
- Learner → Dynamic programming: browses topics (evidence: `README.md`)
- Learner → Backtracking: browses topics (evidence: `README.md`)
- Learner → Matrix search: browses topics (evidence: `README.md`)
- Learner → Stack solutions: browses topics (evidence: `README.md`)
- Learner → Queue solutions: browses topics (evidence: `README.md`)
- Learner → Linked lists: browses topics (evidence: `README.md`)
- Learner → Tree solutions: browses topics (evidence: `README.md`)
- Learner → Trie search: browses topics (evidence: `README.md`)
- Learner → String solutions: browses topics (evidence: `README.md`)
- Learner → Word Search II: selects solution (evidence: `README.md`)
- Learner → Circular deque: selects solution (evidence: `README.md`)
- Learner → Histogram area: selects solution (evidence: `README.md`)
- Learner → RPN evaluation: selects solution (evidence: `README.md`)
- Learner → Backspace compare: selects solution (evidence: `README.md`)
- Word Search II → LeetCode judge: submit code
- Circular deque → LeetCode judge: submit code
- Histogram area → LeetCode judge: submit code
- RPN evaluation → LeetCode judge: submit code
- Backspace compare → LeetCode judge: submit code
