How giaputc/data-structures-algorithms works
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.
Components 26
Array Exercises
- Common Prefix
leetcode/array/14.py - Three Sum
leetcode/array/15.py - Closest Three Sum
leetcode/array/16.py
LeetCode 75
- Max Consecutive Ones
leetcode/leetcode75/1004.py - String Divisor
leetcode/leetcode75/1071.py - Container Water
leetcode/leetcode75/11.py - Unique Occurrences
leetcode/leetcode75/1207.py - Kids Candies
leetcode/leetcode75/1431.py - Vowel Window
leetcode/leetcode75/1456.py - Longest Subarray
leetcode/leetcode75/1493.py - Reverse Words
leetcode/leetcode75/151.py - K Sum Pairs
leetcode/leetcode75/1679.py - Altitude Gain
leetcode/leetcode75/1732.py - Merge Strings
leetcode/leetcode75/1768.py - Set Differences
leetcode/leetcode75/2215.py - Array Products
leetcode/leetcode75/238.py - Move Zeroes
leetcode/leetcode75/283.py - Increasing Triplet
leetcode/leetcode75/334.py - Reverse Vowels
leetcode/leetcode75/345.py - Subsequence Check
leetcode/leetcode75/392.py - String Compression
leetcode/leetcode75/443.py - Place Flowers
leetcode/leetcode75/605.py - Average Window
leetcode/leetcode75/643.py - Pivot Index
leetcode/leetcode75/724.py
A* Exercises
- A* Search Demo
thuat_toan_AI/main.py - A* Search Variant
thuat_toan_AI/main1.py