# hemnath-kandasamyk/data-structures-and-algorithms architecture

> Architecture diagram of the GitHub repository hemnath-kandasamyk/data-structures-and-algorithms, 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/hemnath-kandasamyk/data-structures-and-algorithms
- Repository: https://github.com/hemnath-kandasamyk/data-structures-and-algorithms

## Overview

This repository is a topic-organized collection of independent data-structure and algorithm solutions for interview and competitive-programming practice, not a single running application. The principal workflow is for a learner to choose a topic, inspect a problem’s solution, and apply the approach to practice. The graph groups representative solutions by problem-solving domain; individual solutions do not form a demonstrated execution pipeline. README claims guide topic coverage, while the sampled source confirms selected implementations. No shared runner or judge integration is shown.

Main entry points: [`Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java`](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java) (Topic Collection), [`Strings/RomanToInteger/Solution.java`](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Strings/RomanToInteger/Solution.java) (String Solutions), [`Bit Manipulation/Maximum XOR of Two Numbers in an Array/BinaryTrie_Solution.java`](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Bit%20Manipulation/Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/BinaryTrie_Solution.java) (Bitwise Solutions), [`Math/Count Primes.java`](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Math/Count%20Primes.java) (Math Solutions)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_foundations["Core Techniques"]
  node_arrays["Array Solutions"]
  node_strings["String Solutions<br/>[Solution.java]"]
  node_bitwise["Bitwise Solutions"]
  node_math["Math Solutions<br/>[Count Primes.java]"]
  node_enumeration["Enumeration Solutions<br/>[Solution.java]"]
end

subgraph group_traversal["Search And Traversal"]
  node_bfs["BFS Solutions<br/>[542_01_Matrix.java]"]
  node_graph["Graph Solutions"]
  node_trees["Tree Solutions"]
end

subgraph group_combinatorial["Combinatorial Search"]
  node_backtracking["Backtracking Solutions"]
  node_wordsearch["Word Search<br/>[Solution.java]"]
end

subgraph group_optimization["Optimization"]
  node_dynamic["Dynamic Programming<br/>[Solution.java]"]
  node_greedy["Greedy Solutions"]
  node_window["Sliding Window"]
  node_binarysearch["Binary Search<br/>[Solution.java]"]
end

subgraph group_structures["Data Structures"]
  node_hashmap["Hash Map Solutions<br/>[Solution.java]"]
  node_linkedlist["Linked List Solutions"]
  node_stack["Stack Solutions<br/>[Solution.java]"]
  node_trie["Trie Solutions<br/>[Code.java]"]
end

node_learner(("Learner"))
node_collection["Topic Collection"]

node_learner -->|"chooses topic"| node_collection
node_collection -->|"browses"| node_arrays
node_collection -->|"browses"| node_strings
node_collection -->|"browses"| node_bitwise
node_collection -->|"browses"| node_math
node_collection -->|"browses"| node_enumeration
node_collection -->|"browses"| node_bfs
node_collection -->|"browses"| node_graph
node_collection -->|"browses"| node_trees
node_collection -->|"browses"| node_backtracking
node_collection -->|"browses"| node_wordsearch
node_collection -->|"browses"| node_dynamic
node_collection -->|"browses"| node_greedy
node_collection -->|"browses"| node_window
node_collection -->|"browses"| node_binarysearch
node_collection -->|"browses"| node_hashmap
node_collection -->|"browses"| node_linkedlist
node_collection -->|"browses"| node_stack
node_collection -->|"browses"| node_trie

click node_collection "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java"
click node_arrays "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java"
click node_strings "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Strings/RomanToInteger/Solution.java"
click node_bitwise "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Bit%20Manipulation/Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/BinaryTrie_Solution.java"
click node_math "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Math/Count%20Primes.java"
click node_enumeration "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Enumeration/Sequential%20Digits/Solution.java"
click node_bfs "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/BFS/542_01_Matrix.java"
click node_graph "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Graph/Detect%20Cycles%20in%202D%20Grid.java"
click node_trees "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Trees/Convert%20BST%20to%20Greater%20Tree.java"
click node_backtracking "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Backtracking/Letter%20Combinations%20of%20a%20Phone%20Number.java"
click node_wordsearch "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Backtracking/Word-Search-II/Solution.java"
click node_dynamic "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Dynamic%20Programming/Subset%20Sum%20Problem/Solution.java"
click node_greedy "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Greedy/Partition%20Labels.java"
click node_window "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Sliding%20Window/Minimum%20Window%20Substring/FreqArray_Solution2.java"
click node_binarysearch "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Binary%20Search/Search%20Insert%20Position/Solution.java"
click node_hashmap "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/HashMap/Insert%20Delete%20GetRandom%20O(1)/Solution.java"
click node_linkedlist "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/LinkedList/Reverse%20Nodes%20in%20k-Group/Two_Pointer%20Solution.java"
click node_stack "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Stack/Daily%20Temperatures/Solution.java"
click node_trie "https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Trie/Implement%20Trie%20(Prefix%20Tree)/Code.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_arrays,node_strings,node_bitwise,node_math,node_enumeration toneBlue
class node_bfs,node_graph,node_trees toneAmber
class node_backtracking,node_wordsearch toneMint
class node_dynamic,node_greedy,node_window,node_binarysearch toneRose
class node_hashmap,node_linkedlist,node_stack,node_trie,node_learner toneIndigo
class node_collection toneTeal
```

## Components

### Core Techniques

- [Array Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java): `Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java`
- [String Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Strings/RomanToInteger/Solution.java): `Strings/RomanToInteger/Solution.java`
- [Bitwise Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Bit%20Manipulation/Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/BinaryTrie_Solution.java): `Bit Manipulation/Maximum XOR of Two Numbers in an Array/BinaryTrie_Solution.java`
- [Math Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Math/Count%20Primes.java): `Math/Count Primes.java`
- [Enumeration Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Enumeration/Sequential%20Digits/Solution.java): `Enumeration/Sequential Digits/Solution.java`

### Search And Traversal

- [BFS Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/BFS/542_01_Matrix.java): `BFS/542_01_Matrix.java`
- [Graph Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Graph/Detect%20Cycles%20in%202D%20Grid.java): `Graph/Detect Cycles in 2D Grid.java`
- [Tree Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Trees/Convert%20BST%20to%20Greater%20Tree.java): `Trees/Convert BST to Greater Tree.java`

### Combinatorial Search

- [Backtracking Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Backtracking/Letter%20Combinations%20of%20a%20Phone%20Number.java): `Backtracking/Letter Combinations of a Phone Number.java`
- [Word Search](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Backtracking/Word-Search-II/Solution.java): `Backtracking/Word-Search-II/Solution.java`

### Optimization

- [Dynamic Programming](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Dynamic%20Programming/Subset%20Sum%20Problem/Solution.java): `Dynamic Programming/Subset Sum Problem/Solution.java`
- [Greedy Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Greedy/Partition%20Labels.java): `Greedy/Partition Labels.java`
- [Sliding Window](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Sliding%20Window/Minimum%20Window%20Substring/FreqArray_Solution2.java): `Sliding Window/Minimum Window Substring/FreqArray_Solution2.java`
- [Binary Search](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Binary%20Search/Search%20Insert%20Position/Solution.java): `Binary Search/Search Insert Position/Solution.java`

### Data Structures

- [Hash Map Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/HashMap/Insert%20Delete%20GetRandom%20O(1)/Solution.java): `HashMap/Insert Delete GetRandom O(1)/Solution.java`
- [Linked List Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/LinkedList/Reverse%20Nodes%20in%20k-Group/Two_Pointer%20Solution.java): `LinkedList/Reverse Nodes in k-Group/Two_Pointer Solution.java`
- [Stack Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Stack/Daily%20Temperatures/Solution.java): `Stack/Daily Temperatures/Solution.java`
- [Trie Solutions](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Trie/Implement%20Trie%20(Prefix%20Tree)/Code.java): `Trie/Implement Trie (Prefix Tree)/Code.java`

### Other components

- **Learner**
- [Topic Collection](https://github.com/hemnath-kandasamyk/data-structures-and-algorithms/blob/main/Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java): `Arrays/Find-Minimum-Common-Value/BinarySearchSolution.java`

## Connections

- Learner → Topic Collection: chooses topic (evidence: `README.md`)
- Topic Collection → Array Solutions: browses (evidence: `README.md`)
- Topic Collection → String Solutions: browses (evidence: `README.md`)
- Topic Collection → Bitwise Solutions: browses (evidence: `README.md`)
- Topic Collection → Math Solutions: browses (evidence: `README.md`)
- Topic Collection → Enumeration Solutions: browses (evidence: `README.md`)
- Topic Collection → BFS Solutions: browses (evidence: `README.md`)
- Topic Collection → Graph Solutions: browses (evidence: `README.md`)
- Topic Collection → Tree Solutions: browses (evidence: `README.md`)
- Topic Collection → Backtracking Solutions: browses (evidence: `README.md`)
- Topic Collection → Word Search: browses (evidence: `README.md`)
- Topic Collection → Dynamic Programming: browses (evidence: `README.md`)
- Topic Collection → Greedy Solutions: browses (evidence: `README.md`)
- Topic Collection → Sliding Window: browses (evidence: `README.md`)
- Topic Collection → Binary Search: browses (evidence: `README.md`)
- Topic Collection → Hash Map Solutions: browses (evidence: `README.md`)
- Topic Collection → Linked List Solutions: browses (evidence: `README.md`)
- Topic Collection → Stack Solutions: browses (evidence: `README.md`)
- Topic Collection → Trie Solutions: browses (evidence: `README.md`)
