Welcome to 160 Days of Problem Solving, where we conquer one challenging problem at a time! 🌟 This repository is a treasure trove of daily coding solutions for GFG problems, with multiple language support including C, C++, Java, and Python.
This repository is your companion for 160 days of consistent problem-solving, focusing on core data structures and algorithms. Each problem is thoughtfully solved and documented in four popular programming languages.
Whether you're a beginner or looking to sharpen your skills, these solutions will guide you through structured problem-solving.
Completed: 60/160 Problems 🎉
In Progress: 100 Problems ⏳
Target: Solve all 160 problems! 🏆
| Day | Problem Name | C | C++ | Java | Python |
|---|---|---|---|---|---|
| Day 1 | Count all triplets with given sum in sorted array 🔢🔽🔍 | Solution | Solution | Solution | |
| Day 2 | Count Pairs whose sum is less than target 👫🔢👨💻 | Solution | Solution | Solution | |
| Day 3 | Sum Pair closest to target 🎯💡🔢 | Solution | Solution | Solution | |
| Day 4 | Pair with given sum in a sorted array 🔢🧮✅ | Solution | Solution | Solution | |
| Day 5 | Count the number of possible triangles 📐📏🧮 | Solution | Solution | Solution | Solution |
| Day 6 | Indexes of Subarray Sum 📊📐🔍 | Solution | Solution | Solution | |
| Day 7 | Count distinct elements in every window 🔢🎯📈 | Solution | Solution | Solution | |
| Day 8 | Longest substring with distinct characters 🧵🔤🧠 | Solution | Solution | Solution | |
| Day 9 | Trapping Rain Water 🌧️💧🏞️ | Solution | Solution | Solution | |
| Day 10 | Container With Most Water📦🌊📐 | Solution | Solution | Solution |
Want to contribute? 🌟 Here's how:
- Fork the repository and create a pull request with a new solution.
- Solve a problem or improve existing code/documentation.
- Share this repo with others, and encourage them to star it for support!
- Discuss issues and share tips by opening an issue or using the Discussions tab.
This repository is maintained with 
by Hunterdii. Special thanks to all contributors and supporters for making this journey possible!
Special thanks to the GeeksforGeeks community for providing such an amazing set of problems to work on. Without their platform, this wouldn't have been possible. 🧑💻
Don't forget to star this repository to stay updated!
