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: 35/160 Problems 🎉
In Progress: 125 Problems ⏳
Target: Solve all 160 problems! 🏆
| Day | Problem Name | C | C++ | Java | Python |
|---|---|---|---|---|---|
| Day 1 | Number of occurrence 🧮📂📍 | Solution | Solution | Solution | Solution |
| Day 2 | Sorted and Rotated Minimum 🔢🔄🌐 | Solution | Solution | Solution | Solution |
| Day 3 | Search in Rotated Sorted Array 🔍📐🔑 | Solution | Solution | Solution | |
| Day 4 | Peak element 🌄🔝⛰️ | Solution | Solution | Solution | Solution |
| Day 5 | K-th element of two Arrays 🔢🔍🎯 | Solution | Solution | Solution | Solution |
| Day 6 | Aggressive Cows 🐄🚜🐮 | Solution | Solution | Solution | |
| Day 7 | Allocate Minimum Pages 📚📖📏 | Solution | Solution | Solution | |
| Day 8 | Kth Missing Positive Number in a Sorted Array 🔢➡️❓ | Solution | Solution | Solution | Solution |
| Bonus Problem No. | Problem Name | C 🖥️ | C++ 🚀 | Java ☕ | Python 🐍 |
|---|---|---|---|---|---|
| NUM 1 | Implement Lower Bound 📏🔍📊 | Solution | Solution | Solution | |
| NUM 2 | Bitonic Point ⛰️🔀📍 | Solution | Solution | Solution | |
| NUM 3 | Median of 2 Sorted Arrays of Different Sizes 📊🔢⚖️ | Solution | Solution | Solution | |
| NUM 4 | Square Root 🔢➗🔲 | Solution | Solution | Solution | Solution |
| NUM 5 | Koko Eating Bananas 🍌🐒⏳ | Solution | Solution | Solution | |
| NUM 6 | Minimum Days to Make M Bouquets 🌸⏳💐 | 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. 🧑💻
