# muhil-amuthan/leetcode-dsa-java architecture

> Architecture diagram of the GitHub repository muhil-amuthan/leetcode-dsa-java, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-02). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/muhil-amuthan/leetcode-dsa-java
- Repository: https://github.com/muhil-amuthan/leetcode-dsa-java

## Overview

This repository is a collection of independent Java solutions to LeetCode problems, organized by topic. The user-to-result workflow is to select a problem’s solution, provide its input to the expected method, and receive that method’s result. The README documents topic coverage, while the sampled implementations show standalone algorithms rather than a shared runtime, storage layer, or application pipeline. Topic nodes below represent the solutions in each exact directory; no inter-solution calls are evidenced.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array Solutions"]
  node_array["Array algorithms"]
end

subgraph group_hash["Hash Solutions"]
  node_hashmaps["Hash-table algorithms"]
end

subgraph group_linked["Linked Lists"]
  node_linkedlists["Linked-list algorithms"]
end

subgraph group_math["Math Solutions"]
  node_mathops["Math algorithms"]
end

subgraph group_strings["String Solutions"]
  node_stringops["String algorithms"]
end

subgraph group_pointers["Two Pointers"]
  node_two_pointers["Two-pointer algorithms"]
end

click node_array "https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Arrays"
click node_hashmaps "https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/HashMap"
click node_linkedlists "https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/LinkedList"
click node_mathops "https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Math"
click node_stringops "https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Strings"
click node_two_pointers "https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Two-Pointers"

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 toneBlue
class node_hashmaps toneAmber
class node_linkedlists toneMint
class node_mathops toneRose
class node_stringops toneIndigo
class node_two_pointers toneTeal
```

## Components

### Array Solutions

- [Array algorithms](https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Arrays): `Arrays`

### Hash Solutions

- [Hash-table algorithms](https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/HashMap): `HashMap`

### Linked Lists

- [Linked-list algorithms](https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/LinkedList): `LinkedList`

### Math Solutions

- [Math algorithms](https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Math): `Math`

### String Solutions

- [String algorithms](https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Strings): `Strings`

### Two Pointers

- [Two-pointer algorithms](https://github.com/muhil-amuthan/leetcode-dsa-java/tree/main/Two-Pointers): `Two-Pointers`
