This repository contains solutions to daily Data Structures and Algorithms (DSA) problems from LeetCode and GeeksforGeeks (GFG). Each day, a new problem is solved and added to the repository with detailed explanations.
The repository is organized into two main directories:
├── LeetCode │ ├── Problem1.md │ ├── Problem2.md │ └── ... ├── GFG │ ├── Problem1.md │ ├── Problem2.md │ └── ...
Each problem is solved and documented in its respective folder (LeetCode or GFG) along with:
- Problem Statement: A description of the problem.
- Solution: Explanation of the approach and logic used to solve the problem.
- Code: The solution in Python (or other language if applicable).
- Complexity: Time and space complexity analysis.
Here is my LeetCode Profile: https://leetcode.com/u/ShashiSDixit20/
Welcome to my LeetCode profile! I'm a passionate problem solver with a keen interest in algorithms and data structures. My journey on LeetCode has helped me strengthen my understanding of:
*Core DSA Concepts: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs, Dynamic Programming, etc. *Algorithmic Techniques: Sorting, Searching, Greedy Algorithms, Divide and Conquer, Backtracking, and more.
Here is my GFG Profile: https://www.geeksforgeeks.org/user/shashisdixit80/
Welcome to my GeeksforGeeks profile! I’m deeply passionate about Data Structures and Algorithms (DSA) and use this platform to strengthen my foundational knowledge while solving a variety of coding challenges.
Achievements: Solved over X problems across multiple topics including Arrays, Linked Lists, Trees, Graphs, Dynamic Programming, and more. Actively participated in GFG practice series to continuously improve problem-solving techniques. Earned X badges in topics like Algorithms, DSA, and System Design for consistent performance. Completed various GFG Courses to deepen my understanding of key programming concepts. Areas of Expertise: Data Structures: Mastery over arrays, stacks, queues, linked lists, and binary trees. Algorithmic Problem Solving: Strong knowledge in sorting, searching, dynamic programming, and greedy algorithms. Coding Efficiency: Focused on writing optimized code with better time and space complexities. Learning Goals: Master Advanced Topics: Delving deeper into Graph Theory, Segment Trees, and Dynamic Programming. Competitive Coding: Aiming to improve my skills and rankings in GFG Competitions and Coding Challenges. System Design: Exploring the intricacies of system architecture to build scalable and efficient solutions. I believe GFG is a great platform for both learning and sharing knowledge. Let’s connect and grow together as we take on new challenges in the world of algorithms and development!
- Daily Practice: New questions are added daily with solutions. You can follow along to practice consistently.
- Refer to Solutions: Each solution comes with an explanation and the code to help you understand different approaches to solving problems.
- Improve Problem-Solving Skills: The repository covers problems of varying difficulty levels, enhancing problem-solving and algorithmic thinking.
Contributions are welcome! Here's how you can contribute:
- Fork the repository.
- Create a new branch for your changes.
- Add your solution or improvement in the appropriate folder (LeetCode/GFG).
- Submit a pull request.
- Provide a clear explanation of your solution in the
Problem.mdfile. - Follow the existing structure for adding problems.
- Ensure that the code is clean and well-commented.
Each problem solution file follows this structure:
# Problem Name
## Problem Statement
- Link to the problem: [LeetCode/GFG Link](#)
- Problem description and constraints.
## Approach
- A brief explanation of the approach used to solve the problem.
## Code (C++)
```C++
Class solution(){
# Your code goes here
}
## Daily Problem Tracker
| Date | LeetCode Problem | GFG Problem |
|------------|---------------------------|---------------------------|
| YYYY-MM-DD | [Problem Name](link) | [Problem Name](link) |
| YYYY-MM-DD | [Problem Name](link) | [Problem Name](link) |
| ... | ... | ... |
## License
This repository is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.
---
**Happy Coding!** 🎉