# giaputc/data-structures-algorithms architecture

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

## Overview

This repository is a collection of standalone algorithm exercises, not an integrated application. The visible A* scripts build a graph and heuristics in-file, search for a route, and print the path and cost; the LeetCode scripts implement individual problems. There is no README or evidence of modules calling one another, so the graph shows independent exercises rather than an invented workflow. Several LeetCode files were not excerpted, so their specific behavior is not inferred.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_array["Array Exercises"]
  node_array14["Common Prefix<br/>[14.py]"]
  node_array15["Three Sum<br/>[15.py]"]
  node_array16["Closest Three Sum<br/>[16.py]"]
end

subgraph group_lc75["LeetCode 75"]
  node_p1004["Max Consecutive Ones<br/>[1004.py]"]
  node_p1071["String Divisor<br/>[1071.py]"]
  node_p11["Container Water<br/>[11.py]"]
  node_p1207["Unique Occurrences<br/>[1207.py]"]
  node_p1431["Kids Candies<br/>[1431.py]"]
  node_p1456["Vowel Window<br/>[1456.py]"]
  node_p1493["Longest Subarray<br/>[1493.py]"]
  node_p151["Reverse Words<br/>[151.py]"]
  node_p1679["K Sum Pairs<br/>[1679.py]"]
  node_p1732["Altitude Gain<br/>[1732.py]"]
  node_p1768["Merge Strings<br/>[1768.py]"]
  node_p2215["Set Differences<br/>[2215.py]"]
  node_p238["Array Products<br/>[238.py]"]
  node_p283["Move Zeroes<br/>[283.py]"]
  node_p334["Increasing Triplet<br/>[334.py]"]
  node_p345["Reverse Vowels<br/>[345.py]"]
  node_p392["Subsequence Check<br/>[392.py]"]
  node_p443["String Compression<br/>[443.py]"]
  node_p605["Place Flowers<br/>[605.py]"]
  node_p643["Average Window<br/>[643.py]"]
  node_p724["Pivot Index<br/>[724.py]"]
end

subgraph group_astar["A* Exercises"]
  node_astar1["A* Search Demo<br/>[main.py]"]
  node_astar2["A* Search Variant<br/>[main1.py]"]
end

click node_array14 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/array/14.py"
click node_array15 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/array/15.py"
click node_array16 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/array/16.py"
click node_p1004 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1004.py"
click node_p1071 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1071.py"
click node_p11 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/11.py"
click node_p1207 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1207.py"
click node_p1431 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1431.py"
click node_p1456 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1456.py"
click node_p1493 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1493.py"
click node_p151 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/151.py"
click node_p1679 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1679.py"
click node_p1732 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1732.py"
click node_p1768 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1768.py"
click node_p2215 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/2215.py"
click node_p238 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/238.py"
click node_p283 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/283.py"
click node_p334 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/334.py"
click node_p345 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/345.py"
click node_p392 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/392.py"
click node_p443 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/443.py"
click node_p605 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/605.py"
click node_p643 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/643.py"
click node_p724 "https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/724.py"
click node_astar1 "https://github.com/giaputc/data-structures-algorithms/blob/main/thuat_toan_AI/main.py"
click node_astar2 "https://github.com/giaputc/data-structures-algorithms/blob/main/thuat_toan_AI/main1.py"

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_array14,node_array15,node_array16 toneBlue
class node_p1004,node_p1071,node_p11,node_p1207,node_p1431,node_p1456,node_p1493,node_p151,node_p1679,node_p1732,node_p1768,node_p2215,node_p238,node_p283,node_p334,node_p345,node_p392,node_p443,node_p605,node_p643,node_p724 toneAmber
class node_astar1,node_astar2 toneMint
```

## Components

### Array Exercises

- [Common Prefix](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/array/14.py): `leetcode/array/14.py`
- [Three Sum](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/array/15.py): `leetcode/array/15.py`
- [Closest Three Sum](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/array/16.py): `leetcode/array/16.py`

### LeetCode 75

- [Max Consecutive Ones](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1004.py): `leetcode/leetcode75/1004.py`
- [String Divisor](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1071.py): `leetcode/leetcode75/1071.py`
- [Container Water](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/11.py): `leetcode/leetcode75/11.py`
- [Unique Occurrences](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1207.py): `leetcode/leetcode75/1207.py`
- [Kids Candies](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1431.py): `leetcode/leetcode75/1431.py`
- [Vowel Window](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1456.py): `leetcode/leetcode75/1456.py`
- [Longest Subarray](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1493.py): `leetcode/leetcode75/1493.py`
- [Reverse Words](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/151.py): `leetcode/leetcode75/151.py`
- [K Sum Pairs](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1679.py): `leetcode/leetcode75/1679.py`
- [Altitude Gain](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1732.py): `leetcode/leetcode75/1732.py`
- [Merge Strings](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/1768.py): `leetcode/leetcode75/1768.py`
- [Set Differences](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/2215.py): `leetcode/leetcode75/2215.py`
- [Array Products](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/238.py): `leetcode/leetcode75/238.py`
- [Move Zeroes](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/283.py): `leetcode/leetcode75/283.py`
- [Increasing Triplet](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/334.py): `leetcode/leetcode75/334.py`
- [Reverse Vowels](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/345.py): `leetcode/leetcode75/345.py`
- [Subsequence Check](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/392.py): `leetcode/leetcode75/392.py`
- [String Compression](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/443.py): `leetcode/leetcode75/443.py`
- [Place Flowers](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/605.py): `leetcode/leetcode75/605.py`
- [Average Window](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/643.py): `leetcode/leetcode75/643.py`
- [Pivot Index](https://github.com/giaputc/data-structures-algorithms/blob/main/leetcode/leetcode75/724.py): `leetcode/leetcode75/724.py`

### A* Exercises

- [A* Search Demo](https://github.com/giaputc/data-structures-algorithms/blob/main/thuat_toan_AI/main.py): `thuat_toan_AI/main.py`
- [A* Search Variant](https://github.com/giaputc/data-structures-algorithms/blob/main/thuat_toan_AI/main1.py): `thuat_toan_AI/main1.py`
