This repository serves as a personal collection of Data Structures and Algorithms (DSA) practice problems. The solutions are primarily implemented in Python and JavaScript, with problems often sourced from the renowned "Cracking the Coding Interview" (CTCI) book.
The codes are organized by DSA topics.
.
├── CTCI_arrays/
│ ├── IsUnique.py/
├── CTCI_linkedlists/
│ ├── Removedups.py/
└── README.md
This directory contains DSA solutions written in Python. Each problem is typically placed within a folder corresponding to the CTCI chapter or a general DSA topic .
To run a Python solution:
Navigate to the specific file in your terminal:
cd python/chapter_01_arrays_strings/
Execute the script:
python is_unique.py
📜 JavaScript Solutions This directory holds DSA solutions implemented in JavaScript. Similar to Python, files are organized by CTCI chapter or DSA category (e.g., chapter_02_linked_lists, trees_graphs).
To run a JavaScript solution (requires Node.js installed):
Navigate to the specific file in your terminal:
cd javascript/chapter_02_linked_lists/
Execute the script using Node.js:
node remove_dups.js
"Cracking the Coding Interview" by Gayle Laakmann McDowell: The primary source for many of the problems solved here.
This is a personal practice repository. While direct contributions aren't expected, feel free to explore the solutions and learn from them! If you find any issues or have suggestions, you're welcome to open an issue.
Happy coding!