Welcome to the 30 Days of DSA Challenge! This repository is a part of our commitment to consistently practice and master Data Structures and Algorithms (DSA). Every day, we solve DSA problems and upload our solutions here, organized week by week.
The repository is divided into folders based on weeks. Here's the structure:
📁 Week1/
├── 📁 Day1/
│ ├── file1
│ └── file2
├── 📁 Day2/
│ ├── file1
│ └── file2
└── 📁 Day3/
├── file1
└── file2
|
|
.
.
Each folder contains solutions to the problems tackled on that specific day.
- Understand the Problem: Carefully read and analyze the problem statement.
- Plan the Solution: Think of the most efficient algorithm.
- Code the Solution: Implement the algorithm in your preferred programming language.
- Optimize and Review: Ensure the solution is optimal and meets all edge cases.
- Upload to Repository: Push the code to this repo.
- Consistency: Solve at least one DSA problem every day for 30 days.
- Improvement: Strengthen problem-solving skills.
- Learning: Explore foundational data structures and algorithms.
- Sharing: Maintain a record of our journey and help others learn.
Here are the core topics we’re focusing on during this challenge:
- Arrays
- Strings
- Linked Lists
- Stacks and Queues
- Sorting and Searching
- Hashing
- and more
Clone the repository:
git clone https://github.com/your-username/30-days-dsa-challenge.git
Navigate to the relevant folder and explore the solutions. Try the problems yourself and compare your approach!
Week | status |
---|---|
Week 1 | ✅ completed |
Week 2 | ✅ completed |
Week 3 | ✅ completed |
Week 4 | 🚧 In Progress |
Found a better solution or have suggestions? Feel free to open a Pull Request or Issue. Let’s learn and grow together!