How ftnimran/leetcode-daily-challenges works
This repository is a catalog of standalone JavaScript LeetCode solutions, organized by difficulty and algorithm topic. The principal workflow is a user supplying a problem’s input to its solution function and receiving that problem’s computed answer; there is no shared application runtime or common execution pipeline. The directories below represent major solution families and documented topics, not calls between solutions. Source sampling confirms examples of segment-tree, grid-search, dynamic-programming, and other algorithmic approaches, but not every listed solution’s implementation.
Main entry points: easy Easy solutions · medium Medium solutions · array Array algorithms · prefix-sum Prefix sums
Components 15
Core algorithms
- Easy solutions
easy - Medium solutions
medium - Array algorithms
easy/array - Prefix sums
easy/prefix-sum
Advanced algorithms
- Dynamic programming
hard/dp - Backtracking
hard/backtracking - Greedy methods
medium/greedy
Data structures
- Segment trees
hard/segment-tree - Hashing
medium/hashing
Strings and combinatorics
- String algorithms
medium/string - Two pointers
medium/two-pointer
Graphs and grids
- Graph problems
medium/general - Grid problems
medium/binary-search
Other components
- Problem user
- Computed answer
Connections 26
- Problem user → Easy solutions: provides input
- Problem user → Medium solutions: provides input
- Problem user → Array algorithms: provides input
- Problem user → Prefix sums: provides input
- Problem user → Dynamic programming: provides input
- Problem user → Backtracking: provides input
- Problem user → Greedy methods: provides input
- Problem user → Segment trees: provides input
- Problem user → Hashing: provides input
- Problem user → String algorithms: provides input
- Problem user → Two pointers: provides input
- Problem user → Graph problems: provides input
- Problem user → Grid problems: provides input
- Easy solutions → Computed answer: returns answer
- Medium solutions → Computed answer: returns answer
- Array algorithms → Computed answer: returns answer
- Prefix sums → Computed answer: returns answer
- Dynamic programming → Computed answer: returns answer
- Backtracking → Computed answer: returns answer
- Greedy methods → Computed answer: returns answer
- Segment trees → Computed answer: returns answer
- Hashing → Computed answer: returns answer
- String algorithms → Computed answer: returns answer
- Two pointers → Computed answer: returns answer
- Graph problems → Computed answer: returns answer
- Grid problems → Computed answer: returns answer