How muhil-amuthan/leetcode-dsa-java works
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.
Components 6
Array Solutions
- Array algorithms
Arrays
Hash Solutions
- Hash-table algorithms
HashMap
Linked Lists
- Linked-list algorithms
LinkedList
Math Solutions
- Math algorithms
Math
String Solutions
- String algorithms
Strings
Two Pointers
- Two-pointer algorithms
Two-Pointers