Date | Problem Name | C | C++ | Java | Python |
---|---|---|---|---|---|
01 Nov | Swap and Maximize πβ¬οΈπ | Solution | Solution | Solution | |
02 Nov | Kth Distance ππ€οΈπ§ | Solution | Solution | Solution | |
03 Nov | Is Linked List Length Even? ππ’β | Solution | Solution | Solution | |
04 Nov | Find All Triplets with Zero Sum πβπ₯ | Solution | Solution | Solution | |
05 Nov | Rotate by 90 Degree πππ | Solution | Solution | Solution | Solution |
06 Nov | Root to Leaf Paths Sum π³ππ° | Solution | Solution | Solution | |
07 Nov | Split Array in Three Equal Sum Subarrays π‘ππ― | Solution | Solution | Solution | |
08 Nov | Minimum repeat to make substring πβ¨π | Solution | Solution | Solution | |
09 Nov | Minimum sum π‘βπ° | Solution | Solution | Solution | |
10 Nov | Union of Two Sorted Arrays with Distinct Elements ππ€π | Solution | Solution | Solution | |
11 Nov | Make array elements unique π’β¨π | Solution | Solution | Solution | |
12 Nov | Meeting Rooms π π’β° | Solution | Solution | Solution | |
13 Nov | Intersection Point in Y Shaped Linked Lists πβ‘οΈπ‘ | Solution | Solution | Solution | |
14 Nov | Nearly sorted πβ‘οΈβοΈ | Solution | Solution | Solution | |
15 Nov | Second Largest π₯π₯π | Solution | Solution | Solution | |
16 Nov | Move All Zeroes to End π₯β‘οΈβ‘ | Solution | Solution | Solution | |
17 Nov | Reverse an Array πππ» | Solution | Solution | Solution | Solution |
18 Nov | Rotate Array πππ§βπ» | Solution | Solution | Solution | Solution |
19 Nov | Next Permutation π’β‘οΈπ | Solution | Solution | Solution | Solution |
20 Nov | Majority Element II π³οΈπβ | Solution | Solution | Solution | Solution |
21 Nov | Stock Buy and Sell β Multiple Transaction Allowed πΉπΌπΈ | Solution | Solution | Solution | Solution |
22 Nov | Stock Buy and Sell β Max one Transaction Allowed ππ°π | Solution | Solution | Solution | Solution |
23 Nov | Minimize the Heights I ππ°π§ | Solution | Solution | Solution | |
24 Nov | Kadane's Algorithm π‘ππ’ | Solution | Solution | Solution | Solution |
25 Nov | Maximum Product Subarray π’βπ― | Solution | Solution | Solution | Solution |
26 Nov | Max Circular Subarray Sum ππ―π | Solution | Solution | Solution | Solution |
27 Nov | Smallest Positive Missing Number π’βπ | Solution | Solution | Solution | Solution |
28 Nov | Implement Atoi βοΈππ§βπ¬ | Solution | Solution | Solution | Solution |
29 Nov | Add Binary Strings π’βπ» | Solution | Solution | Solution | |
30 Nov | Anagram π π‘π€ | Solution | Solution | Solution | Solution |
Day | Problem Name | C | C++ | Java | Python |
---|---|---|---|---|---|
Day 1 | Implement Atoi βοΈππ§βπ¬ | Solution | Solution | Solution | Solution |
Day 2 | Add Binary Strings π’βπ» | Solution | Solution | Solution | |
Day 3 | Anagram π π‘π€ | Solution | Solution | Solution | Solution |
Day | Problem Name | C | C++ | Java | Python |
---|---|---|---|---|---|
Day 1 | Second Largest π₯π₯π | Solution | Solution | Solution | |
Day 2 | Move All Zeroes to End π₯β‘οΈβ‘ | Solution | Solution | Solution | |
Day 3 | Reverse an Array πππ» | Solution | Solution | Solution | Solution |
Day 4 | Rotate Array πππ§βπ» | Solution | Solution | Solution | Solution |
Day 5 | Next Permutation π’β‘οΈπ | Solution | Solution | Solution | Solution |
Day 6 | Majority Element II π³οΈπβ | Solution | Solution | Solution | Solution |
Day 7 | Stock Buy and Sell β Multiple Transaction Allowed πΉπΌπΈ | Solution | Solution | Solution | Solution |
Day 8 | Stock Buy and Sell β Max one Transaction Allowed ππ°π | Solution | Solution | Solution | Solution |
Day 9 | Minimize the Heights I ππ°π§ | Solution | Solution | Solution | |
Day 10 | Kadane's Algorithm π‘ππ’ | Solution | Solution | Solution | Solution |
Day 11 | Maximum Product Subarray π’βπ― | Solution | Solution | Solution | Solution |
Day 12 | Max Circular Subarray Sum ππ―π | Solution | Solution | Solution | Solution |
Day 13 | Smallest Positive Missing Number π’βπ | Solution | Solution | Solution | Solution |
Bonus Problem No. | Problem Name | C π₯οΈ | C++ π | Java β | Python π |
---|---|---|---|---|---|
NUM 1 | Split Array in Three Equal Sum Subarrays π₯ππ’ | Solution | Solution | Solution | |
NUM 2 | Repetitive Addition of Digits π’ππ₯ | Solution | Solution | Solution | |
NUM 3 | Maximize Number of 1's π’π₯π‘ | Solution | Solution | Solution | |
NUM 4 | Last Moment Before All Ants Fall Out of a Plank ππβ³ | Solution | Solution | Solution |
If you have any questions, insights, or solutions to share, don't miss out on our active Discussion Hub! π Your participation is what makes this community great.
- ποΈββοΈ Daily Practice: Tackle a new problem every day and sharpen your problem-solving skills.
- π§ Diverse Topics: Master algorithms, data structures, dynamic programming, and more.
- π€ Community Collaboration: Discuss and improve solutions together for mutual growth.
- π Solution Explanations: Each problem comes with clear, well-documented solutions to aid your learning.
- π Navigate Effortlessly: Problems are sorted by date for easy access.
- π Study Explanations: Grasp the core logic behind each solution.
- π Experiment & Practice: Modify solutions or try implementing them in other languages.
- π¬ Engage & Collaborate: Connect with the community to gain deeper insights.
/
βββ November 2024 GFG SOLUTION/
β βββ 01(Nov) Swap and Maximize.md
β βββ November-01.cpp
β βββ November-01.java
β βββ November-01.py
β βββ ...
βββ README.md
We β€οΈ contributions! Here's how you can contribute:
- Fork this repository.
- Create a new branch for your feature or bug fix.
- Commit your changes with a clear message.
- Submit a pull request and weβll review it together!
Note: Follow our coding style and include meaningful comments.
Het Patel Project Maintainer |
For any inquiries or feedback, please contact. Happy Contributingβ€
Shaping solutions every dayβthanks to everyone contributing to GeeksforGeeks-POTD! π
- π Global Reach: Engaging with coders worldwide, from beginners to experts.
- π₯ Trending Topics: Problems that sharpen your data structures and algorithms skills.
β¨ Happy Coding!