Welcome to my repository for the #GeekStreak60 challenge! This is a 60-day sprint of solving the GeeksforGeeks Problem of the Day (POTD), maintained daily to build a rock-solid foundation in Data Structures and Algorithms.
To maintain a 60-day streak of solving complex DSA problems, focusing on optimized approaches, clean code, and time/space complexity analysis.
- Language: C++
- Topics Covered: Arrays, Strings, Trees, Graphs, Dynamic Programming, and more.
| Day | Date | Problem Name | Difficulty | Solution | Time Complexity |
|---|---|---|---|---|---|
| 01 | Feb 16 | Meeting Rooms | Easy | C++ | O(N log N) |
| 02 | Feb 17 | Maximum number of overlapping Intervals | Hard | C++ | |
| 03 | Feb 18 | Count Inversions | Medium | C++ |