A comprehensive, open-access study guide designed to master Data Structures and Algorithms.
This platform serves as a complete breakdown of 175 essential algorithmic problems spanning 35 core topics (Arrays, Graphs, Dynamic Programming, Trees, and more). It is built not just as a repository of code, but as an interactive study tool.
Every problem includes a detailed written explanation of the logic, followed by highly optimized code implementations in Python and Java.
- Track Your Progress: The site features a built-in progress bar. As you attempt the problems, mark them as "Done". Your progress is automatically saved locally in your browser so you can pick up exactly where you left off.
- Toggleable Solutions: Try the problem yourself first using the direct LeetCode/LintCode links. If you get stuck, click the problem title to reveal the hidden explanation and code.
- Curated Curriculum: Grouped logically by pattern, starting from basic Arrays & Hashing and scaling all the way up to Segment Trees and String Matching.
This project is built for speed and accessibility. It runs entirely on the client side, meaning zero load times and no backend database required.
- HTML5 / CSS3 for a clean, modern, and responsive user interface.
- Vanilla JavaScript to handle the accordion dropdowns and Local Storage progress saving.
- Clone this repository:
git clone [https://github.com/devesh-tiw/Code-Conquer.git](https://github.com/devesh-tiw/Code-Conquer.git)