# sangilimurugan492/dsa-learning architecture

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

- Interactive diagram: https://gitdiagram.com/sangilimurugan492/dsa-learning
- Repository: https://github.com/sangilimurugan492/dsa-learning

## Overview

This repository is a collection of standalone Kotlin algorithm exercises, not a single application: a user selects and invokes an individual solution to get a computed result or modified data structure. Its capabilities span array/hash and traversal problems, two-pointer and sliding-window techniques, greedy and simulation problems, and linked-list structures and transformations. There is no shared runtime orchestrator or documented end-to-end workflow. Nodes group related exercises by their exact source directory; the available excerpts support only a few implementation-level links, so unverified connections are omitted.

Main entry points: [`linked_list`](https://github.com/sangilimurugan492/dsa-learning/tree/main/linked_list) (List operations), [`linked_list/ListNode.kt`](https://github.com/sangilimurugan492/dsa-learning/blob/main/linked_list/ListNode.kt) (Singly list node), [`linked_list/Node.kt`](https://github.com/sangilimurugan492/dsa-learning/blob/main/linked_list/Node.kt) (Simple list node), [`double_linked_list/LeastRecentlyUsedLRU.kt`](https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/LeastRecentlyUsedLRU.kt) (LRU cache)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_arrays["Array algorithms"]
  node_hashing["Array hashing"]
  node_traversals["Array traversal"]
end

subgraph group_window["Window techniques"]
  node_two_pointer["Two pointers"]
  node_sliding["Sliding window"]
end

subgraph group_lists["Linked structures"]
  node_list_ops["List operations"]
  node_list_node["Singly list node<br/>[ListNode.kt]"]
  node_node["Simple list node<br/>[Node.kt]"]
  node_lru["LRU cache"]
  node_lfu["LFU cache"]
  node_flatten["Multilevel flattening"]
end

subgraph group_misc["Greedy and simulation"]
  node_greedy["Greedy problems"]
  node_phone["Phone combinations"]
  node_simulation["Simulation problems"]
end

node_user(("Algorithm user"))

node_list_ops -->|"uses nodes"| node_list_node
node_lru -.->|"imports node"| node_node
node_lfu -->|"imports node"| node_node
node_flatten -.->|"imports node type"| node_traversals
node_list_ops -->|"transforms lists"| node_list_node

click node_hashing "https://github.com/sangilimurugan492/dsa-learning/tree/main/array_hashing_technique"
click node_traversals "https://github.com/sangilimurugan492/dsa-learning/tree/main/array_traversals"
click node_two_pointer "https://github.com/sangilimurugan492/dsa-learning/tree/main/two_pointer_technique"
click node_sliding "https://github.com/sangilimurugan492/dsa-learning/tree/main/sliding_window_technique"
click node_list_ops "https://github.com/sangilimurugan492/dsa-learning/tree/main/linked_list"
click node_list_node "https://github.com/sangilimurugan492/dsa-learning/blob/main/linked_list/ListNode.kt"
click node_node "https://github.com/sangilimurugan492/dsa-learning/blob/main/linked_list/Node.kt"
click node_lru "https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/LeastRecentlyUsedLRU.kt"
click node_lfu "https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/LeastFrequentlyUsedLFU.kt"
click node_flatten "https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/FlatternDoubleLLMultiLevel.kt"
click node_greedy "https://github.com/sangilimurugan492/dsa-learning/tree/main/GreedyAlgorithm"
click node_phone "https://github.com/sangilimurugan492/dsa-learning/blob/main/LetterAndCombinationPhoneNumber.kt"
click node_simulation "https://github.com/sangilimurugan492/dsa-learning/tree/main/simulation"

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_hashing,node_traversals,node_user toneBlue
class node_two_pointer,node_sliding toneAmber
class node_list_ops,node_list_node,node_node,node_lru,node_lfu,node_flatten toneMint
class node_greedy,node_phone,node_simulation toneRose
```

## Components

### Array algorithms

- [Array hashing](https://github.com/sangilimurugan492/dsa-learning/tree/main/array_hashing_technique): `array_hashing_technique`
- [Array traversal](https://github.com/sangilimurugan492/dsa-learning/tree/main/array_traversals): `array_traversals`

### Window techniques

- [Two pointers](https://github.com/sangilimurugan492/dsa-learning/tree/main/two_pointer_technique): `two_pointer_technique`
- [Sliding window](https://github.com/sangilimurugan492/dsa-learning/tree/main/sliding_window_technique): `sliding_window_technique`

### Linked structures

- [List operations](https://github.com/sangilimurugan492/dsa-learning/tree/main/linked_list): `linked_list`
- [Singly list node](https://github.com/sangilimurugan492/dsa-learning/blob/main/linked_list/ListNode.kt): `linked_list/ListNode.kt`
- [Simple list node](https://github.com/sangilimurugan492/dsa-learning/blob/main/linked_list/Node.kt): `linked_list/Node.kt`
- [LRU cache](https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/LeastRecentlyUsedLRU.kt): `double_linked_list/LeastRecentlyUsedLRU.kt`
- [LFU cache](https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/LeastFrequentlyUsedLFU.kt): `double_linked_list/LeastFrequentlyUsedLFU.kt`
- [Multilevel flattening](https://github.com/sangilimurugan492/dsa-learning/blob/main/double_linked_list/FlatternDoubleLLMultiLevel.kt): `double_linked_list/FlatternDoubleLLMultiLevel.kt`

### Greedy and simulation

- [Greedy problems](https://github.com/sangilimurugan492/dsa-learning/tree/main/GreedyAlgorithm): `GreedyAlgorithm`
- [Phone combinations](https://github.com/sangilimurugan492/dsa-learning/blob/main/LetterAndCombinationPhoneNumber.kt): `LetterAndCombinationPhoneNumber.kt`
- [Simulation problems](https://github.com/sangilimurugan492/dsa-learning/tree/main/simulation): `simulation`

### Other components

- **Algorithm user**

## Connections

- List operations → Singly list node: uses nodes (evidence: `linked_list/MyLinkedList.kt`)
- LRU cache → Simple list node: imports node (evidence: `double_linked_list/LeastRecentlyUsedLRU.kt`)
- LFU cache → Simple list node: imports node (evidence: `double_linked_list/LeastFrequentlyUsedLFU.kt`)
- Multilevel flattening → Array traversal: imports node type (evidence: `double_linked_list/FlatternDoubleLLMultiLevel.kt`)
- List operations → Singly list node: transforms lists (evidence: `linked_list/PatiotionList.kt`)
