# arjunchakri/arjunchakri-submissions architecture

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

- Interactive diagram: https://gitdiagram.com/arjunchakri/arjunchakri-submissions
- Repository: https://github.com/arjunchakri/arjunchakri-submissions

## Overview

This repository is a collection of independent Java LeetCode submissions, not a single application. The principal workflow is to choose a problem, provide its expected input to that problem’s solution method, and receive the computed answer. The README organizes submissions by topics including arrays, hash tables, and stacks; the tree also includes string and tree problems. Nodes group related standalone solutions for readability; they do not imply shared runtime calls. Only selected source files were sampled, so the graph shows the collection’s broad capabilities rather than uninspected implementation details.

Main entry points: [`0001-two-sum/0001-two-sum.java`](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0001-two-sum/0001-two-sum.java) (Array Solutions), [`1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.java`](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.java) (Array Variants), [`0373-find-k-pairs-with-smallest-sums/0373-find-k-pairs-with-smallest-sums.java`](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0373-find-k-pairs-with-smallest-sums/0373-find-k-pairs-with-smallest-sums.java) (Heap And Ranking), [`0290-word-pattern/0290-word-pattern.java`](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0290-word-pattern/0290-word-pattern.java) (String Solutions)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array Algorithms"]
  node_array["Array Solutions<br/>[0001-two-sum.java]"]
  node_array_misc["Array Variants"]
  node_array_heap["Heap And Ranking"]
end

subgraph group_strings["String Algorithms"]
  node_string["String Solutions"]
  node_string_match["Pattern Matching"]
end

subgraph group_structures["Stacks And Queues"]
  node_stack["Stack Solutions"]
  node_queue["Queue Solutions"]
end

subgraph group_trees["Trees And Lists"]
  node_tree["Tree Solutions"]
  node_tree_metrics["Tree Metrics"]
  node_list["Linked List Math"]
end

node_coder(("Problem Solver"))
node_answer["Computed Result"]

node_coder -->|"invokes selected"| node_array
node_coder -->|"invokes selected"| node_array_misc
node_coder -->|"invokes selected"| node_array_heap
node_coder -->|"invokes selected"| node_string
node_coder -->|"invokes selected"| node_string_match
node_coder -->|"invokes selected"| node_stack
node_coder -->|"invokes selected"| node_queue
node_coder -->|"invokes selected"| node_tree
node_coder -->|"invokes selected"| node_tree_metrics
node_coder -->|"invokes selected"| node_list
node_array -->|"returns result"| node_answer
node_array_misc -->|"returns result"| node_answer
node_array_heap -->|"returns result"| node_answer
node_string -->|"returns result"| node_answer
node_string_match -->|"returns result"| node_answer
node_stack -->|"returns result"| node_answer
node_queue -->|"returns result"| node_answer
node_tree -->|"returns result"| node_answer
node_tree_metrics -->|"returns result"| node_answer
node_list -->|"returns result"| node_answer

click node_array "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0001-two-sum/0001-two-sum.java"
click node_array_misc "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.java"
click node_array_heap "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0373-find-k-pairs-with-smallest-sums/0373-find-k-pairs-with-smallest-sums.java"
click node_string "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0290-word-pattern/0290-word-pattern.java"
click node_string_match "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0459-repeated-substring-pattern/0459-repeated-substring-pattern.java"
click node_stack "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0150-evaluate-reverse-polish-notation/0150-evaluate-reverse-polish-notation.java"
click node_queue "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0232-implement-queue-using-stacks/0232-implement-queue-using-stacks.java"
click node_tree "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0101-symmetric-tree/0101-symmetric-tree.java"
click node_tree_metrics "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0543-diameter-of-binary-tree/0543-diameter-of-binary-tree.java"
click node_list "https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0002-add-two-numbers/0002-add-two-numbers.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_array,node_array_misc,node_array_heap toneBlue
class node_string,node_string_match toneAmber
class node_stack,node_queue toneMint
class node_tree,node_tree_metrics,node_list toneRose
class node_coder,node_answer toneIndigo
```

## Components

### Array Algorithms

- [Array Solutions](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0001-two-sum/0001-two-sum.java): `0001-two-sum/0001-two-sum.java`
- [Array Variants](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.java): `1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.java`
- [Heap And Ranking](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0373-find-k-pairs-with-smallest-sums/0373-find-k-pairs-with-smallest-sums.java): `0373-find-k-pairs-with-smallest-sums/0373-find-k-pairs-with-smallest-sums.java`

### String Algorithms

- [String Solutions](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0290-word-pattern/0290-word-pattern.java): `0290-word-pattern/0290-word-pattern.java`
- [Pattern Matching](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0459-repeated-substring-pattern/0459-repeated-substring-pattern.java): `0459-repeated-substring-pattern/0459-repeated-substring-pattern.java`

### Stacks And Queues

- [Stack Solutions](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0150-evaluate-reverse-polish-notation/0150-evaluate-reverse-polish-notation.java): `0150-evaluate-reverse-polish-notation/0150-evaluate-reverse-polish-notation.java`
- [Queue Solutions](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0232-implement-queue-using-stacks/0232-implement-queue-using-stacks.java): `0232-implement-queue-using-stacks/0232-implement-queue-using-stacks.java`

### Trees And Lists

- [Tree Solutions](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0101-symmetric-tree/0101-symmetric-tree.java): `0101-symmetric-tree/0101-symmetric-tree.java`
- [Tree Metrics](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0543-diameter-of-binary-tree/0543-diameter-of-binary-tree.java): `0543-diameter-of-binary-tree/0543-diameter-of-binary-tree.java`
- [Linked List Math](https://github.com/arjunchakri/arjunchakri-submissions/blob/main/0002-add-two-numbers/0002-add-two-numbers.java): `0002-add-two-numbers/0002-add-two-numbers.java`

### Other components

- **Problem Solver**
- **Computed Result**

## Connections

- Problem Solver → Array Solutions: invokes selected
- Problem Solver → Array Variants: invokes selected
- Problem Solver → Heap And Ranking: invokes selected
- Problem Solver → String Solutions: invokes selected
- Problem Solver → Pattern Matching: invokes selected
- Problem Solver → Stack Solutions: invokes selected
- Problem Solver → Queue Solutions: invokes selected
- Problem Solver → Tree Solutions: invokes selected
- Problem Solver → Tree Metrics: invokes selected
- Problem Solver → Linked List Math: invokes selected
- Array Solutions → Computed Result: returns result
- Array Variants → Computed Result: returns result
- Heap And Ranking → Computed Result: returns result
- String Solutions → Computed Result: returns result
- Pattern Matching → Computed Result: returns result
- Stack Solutions → Computed Result: returns result
- Queue Solutions → Computed Result: returns result
- Tree Solutions → Computed Result: returns result
- Tree Metrics → Computed Result: returns result
- Linked List Math → Computed Result: returns result