DSA Practices

Welcome to my Data Structures and Algorithms (DSA) practice repository, this repository is my personal space to practice problem-solving, enhance my understanding of data structures and algorithms, and store solutions to related problem

The solutions are organized into topic-based folders, with subfolders for difficulty levels.

.
├── arrays
│   ├── easy
│   ├── medium
│   └── hard
├── stack
│   ├── easy
│   ├── medium
│   │   ├── min-stack.js
│   │   ├── reverse-polish-notation.js
│   │   ├── simplify-path.js
│   └── hard
├── linked-lists
│   ├── easy
│   ├── medium
│   └── hard
├── trees
│   ├── easy
│   └── medium
└── graphs
    ├── medium
    └── hard

Example:

• arrays/easy/two-sum.js: Solution for the "Two Sum" problem.
• graphs/hard/shortest-path-in-weighted-graph.js: Solution for finding the shortest path in a weighted graph.

How to Use

1. Clone the Repository:

   git clone https://github.com/GiangThanhDat/dsa-practices.git

2. Navigate to the desired folder:

   cd dsa-practices/arrays/easy

3. Run the solution:

   node solution.js     # For JavaScript

Purpose

This repository serves as:

1. A practice platform to improve problem-solving skills.
2. Deepen my understanding of data structures and algorithms.
3. A collection of reference solutions categorized by topic and difficulty.
4. A resource for anyone preparing for coding interviews.
5. Keep an organized record of solutions for future reference and growth.

Contributions

Feel free to open issues or submit pull requests if you have suggestions or want to contribute to this repository.