How sachuverma/datastructures-algorithms works
This repository is a curated interview-preparation resource collection, not an executable application. Its user workflow is to follow the README’s preparation guidance, choose a practice collection, and study or solve an individual problem; the solution files are standalone examples rather than a connected runtime pipeline. The graph emphasizes the collections and algorithm domains visible in the tree. The README describes additional roadmap and theory resources, but their implementation paths are not present in the supplied tree.
Main entry points: DSA Crack Sheet/solutions DSA Crack Sheet · Leetcode Daily Challenge Leetcode Daily · Striver Sheet Striver Sheet · Leetcode Top Interview Questions/solutions Top Interview Questions
Components 12
Practice collections
- DSA Crack Sheet
DSA Crack Sheet/solutions - Leetcode Daily
Leetcode Daily Challenge - Striver Sheet
Striver Sheet - Top Interview Questions
Leetcode Top Interview Questions/solutions
Algorithm domains
- Array problems
DSA Crack Sheet/solutions - Linked lists
DSA Crack Sheet/solutions - Trees and BSTs
DSA Crack Sheet/solutions - String problems
DSA Crack Sheet/solutions - Graphs and grids
DSA Crack Sheet/solutions - Stacks and queues
DSA Crack Sheet/solutions - Dynamic programming
DSA Crack Sheet/solutions
Other components
- Learner
Connections 4
- Learner → DSA Crack Sheet: browses
README.md - Learner → Leetcode Daily: practices with
README.md - Learner → Striver Sheet: practices with
README.md - Learner → Top Interview Questions: reviews
README.md