🧠 DSA Practice in JavaScript

This repository is my personal collection of Data Structures and Algorithms (DSA) problems solved using JavaScript. It helps me revisit and revise problems anytime with structured and readable solutions.

📌 About

This repo includes solutions from:

• LeetCode
• GeeksforGeeks

Each file contains a clean implementation of the problem with meaningful variable names and logic, and comments where needed.

🗂️ Folder Structure

.
├── Arrays/
│   └── 2DArrays/
├── Bitwise/
├── Greedy/
├── LC-Daily/
├── LeetCode/
│   └── Contest_161/
├── LinkedList/
├── Map/
├── Math_Problems/
├── Others/
├── Recursion/
├── SearchingAndSorting/
├── Set/
├── SlidingWindow/
├── Strings/
└── README.md

Each folder groups problems based on the DSA topic. Files are named after the problem or concept being solved.

🧑‍💻 How to Run

1. Clone the repository

   git clone https://github.com/your-username/DSA-JavaScript.git
   cd DSA-JavaScript

2. Installing promptSync(only for terminal input)

   npm i prompt-sync

3. Run a specific problem

   node BitManipulation/singleNumber.js

📚 Why This Repo?

• To improve and track my DSA skills in JavaScript.
• To maintain a consistent practice habit.
• To quickly revisit old problems when needed.
• To keep everything organized by topic.

✅ Topics Covered

• Arrays
• Strings
• Linked Lists
• Stacks & Queues
• Trees & Graphs
• Recursion
• Dynamic Programming
• Backtracking
• Searching & Sorting
• Bit Manipulation
• Basic Math Problems

---

🧘‍♂️ “Practice makes progress.”
This repo is my space to stay consistent and grow as a developer.