# README
##  GeeksforGeeks Problem of the Day Solutions 2025 
### [๐
**March 2025 Problem of the Day Solutions** ๐
](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/March%202026%20GFG%20SOLUTION/README.md)
### ๐ My Open-Source Projects
| [](https://github.com/Hunterdii/Smart-AI-Resume-Analyzer) | [](https://github.com/Hunterdii/Awesome-Java) |
| :--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| [](https://github.com/Hunterdii/tryhackme-free-rooms) | [](https://github.com/Hunterdii/30-Days-Of-Rust) |
### ๐ My GfG Connect Posting Challenge
| [](https://www.geeksforgeeks.org/connect/post/95063/why-i-chose-m-sc-data-science-over-a-generic-sde-path/) | [](https://www.geeksforgeeks.org/connect/post/99833/lt-h2-id-the-ml-project-that-made-data-science-real-for-me-style-text-align-left-class-editor/) |
| :---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Date** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :------: | :--------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------: |
| 01 March | Move All Zeroes to End 0๏ธโฃโก๏ธ๐ฆ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/01-mar-move-all-zeroes-to-end#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/01-mar-move-all-zeroes-to-end#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/01-mar-move-all-zeroes-to-end#-code-python) |
| 02 March | Trapping Rain Water ๐ง๏ธ๐ง๐๏ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/02-mar-trapping-rain-water#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/02-mar-trapping-rain-water#โ-code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/02-mar-trapping-rain-water#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/02-mar-trapping-rain-water#-code-python) |
| 03 March | Longest subarray with Atmost two distinct integers ๐งฉ2๏ธโฃโ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/03-mar-longest-subarray-with-atmost-two-distinct-integers#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/03-mar-longest-subarray-with-atmost-two-distinct-integers#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/03-mar-longest-subarray-with-atmost-two-distinct-integers#-code-python) |
| 04 March | Max Xor Subarray of size K ๐ข๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/04-mar-max-xor-subarray-of-size-k#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/04-mar-max-xor-subarray-of-size-k#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/04-mar-max-xor-subarray-of-size-k#-code-python) |
| 05 March | Longest Substring with K Uniques ๐ค๐๐งฉ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/05-mar-longest-substring-with-k-uniques#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/05-mar-longest-substring-with-k-uniques#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/05-mar-longest-substring-with-k-uniques#-code-python) |
| 06 March | Smallest window containing all characters ๐ค๐ช๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/06-mar-smallest-window-containing-all-characters#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/06-mar-smallest-window-containing-all-characters#โ-code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/06-mar-smallest-window-containing-all-characters#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/06-mar-smallest-window-containing-all-characters#-code-python) |
| 07 March | Dice throw ๐ฒ๐ข๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/07-mar-dice-throw#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/07-mar-dice-throw#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/07-mar-dice-throw#-code-python) |
| 08 March | Pythagorean Triplet ๐ฆ๐๐บ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/08-mar-pythagorean-triplet#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/08-mar-pythagorean-triplet#โ-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/08-mar-pythagorean-triplet#-code-python) |
| 09 March | Largest number in one swap ๐ข๐โฌ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/09-mar-largest-number-in-one-swap#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/09-mar-largest-number-in-one-swap#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/09-mar-largest-number-in-one-swap#-code-python) |
| 10 March | Subarrays with First Element Minimum 1๏ธโฃ๐๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/10-mar-subarrays-with-first-element-minimum#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/10-mar-subarrays-with-first-element-minimum#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/10-mar-subarrays-with-first-element-minimum#-code-python) |
| 11 March | Sum of subarray minimums ๐ข๐โฌ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/11-mar-sum-of-subarray-minimums#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/11-mar-sum-of-subarray-minimums#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/11-mar-sum-of-subarray-minimums#-code-python) |
| 22 March | Rotten Oranges ๐๐๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/22-mar-rotten-oranges#๏ธ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/22-mar-rotten-oranges#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/22-mar-rotten-oranges#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/22-mar-rotten-oranges#-code-python) |
| 23 March | Length of Longest Cycle in a Graph ๐งญ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/23-mar-length-of-longest-cycle-in-a-graph#โ-code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/23-mar-length-of-longest-cycle-in-a-graph#-code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/march-2026-gfg-solution/23-mar-length-of-longest-cycle-in-a-graph#-code-python) |
***
### ๐ Solved Questions and Bonus Problems
โจ Previously Solved Questions(Click to expand)
### [**๐ข GFG 160 Days of Problem Solving (Arrays 1โ13) ๐ข**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Arrays\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :--------: | :------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Second Largest ๐ฅ๐ฅ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-1-second-largest#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-1-second-largest#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-1-second-largest#code-python) |
| **Day 2** | Move All Zeroes to End ๐ฅโก๏ธโก | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-2-move-all-zeroes-to-end#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-2-move-all-zeroes-to-end#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-2-move-all-zeroes-to-end#code-python) |
| **Day 3** | Reverse an Array ๐๐๐ป | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-3-reverse-an-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-3-reverse-an-array#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-3-reverse-an-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-3-reverse-an-array#code-python) |
| **Day 4** | Rotate Array ๐๐๐งโ๐ป | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-4-rotate-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-4-rotate-array#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-4-rotate-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-4-rotate-array#code-python) |
| **Day 5** | Next Permutation ๐ขโก๏ธ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-5-next-permutation#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-5-next-permutation#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-5-next-permutation#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-5-next-permutation#code-python) |
| **Day 6** | Majority Element II ๐ณ๏ธ๐โ
| [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-6-majority-element-ii#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-6-majority-element-ii#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-6-majority-element-ii#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-6-majority-element-ii#code-python) |
| **Day 7** | Stock Buy and Sell โ Multiple Transaction Allowed ๐น๐ผ๐ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-7-stock-buy-and-sell-multiple-transaction-allowed#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-7-stock-buy-and-sell-multiple-transaction-allowed#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-7-stock-buy-and-sell-multiple-transaction-allowed#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-7-stock-buy-and-sell-multiple-transaction-allowed#code-python) |
| **Day 8** | Stock Buy and Sell โ Max one Transaction Allowed ๐๐ฐ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-8-stock-buy-and-sell-max-one-transaction-allowed#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-8-stock-buy-and-sell-max-one-transaction-allowed#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-8-stock-buy-and-sell-max-one-transaction-allowed#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-8-stock-buy-and-sell-max-one-transaction-allowed#code-python) |
| **Day 9** | Minimize the Heights I ๐๐ฐ๐ง | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-9-minimize-the-heights-ii#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-9-minimize-the-heights-ii#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-9-minimize-the-heights-ii#code-python) |
| **Day 10** | Kadane's Algorithm ๐ก๐๐ข | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-10-kadanes-algorithm#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-10-kadanes-algorithm#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-10-kadanes-algorithm#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-10-kadanes-algorithm#code-python) |
| **Day 11** | Maximum Product Subarray ๐ขโ๐ฏ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-11-maximum-product-subarray#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-11-maximum-product-subarray#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-11-maximum-product-subarray#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-11-maximum-product-subarray#code-python) |
| **Day 12** | Max Circular Subarray Sum ๐๐ฏ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-12-max-circular-subarray-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-12-max-circular-subarray-sum#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-12-max-circular-subarray-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-12-max-circular-subarray-sum#code-python) |
| **Day 13** | Smallest Positive Missing Number ๐ขโ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-13-smallest-positive-missing-number#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-13-smallest-positive-missing-number#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-13-smallest-positive-missing-number#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-13-smallest-positive-missing-number#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Strings) ๐ **](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Strings\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Implement Atoi โ๏ธ๐๐งโ๐ฌ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-1-implement-atoi#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-1-implement-atoi#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-1-implement-atoi#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-1-implement-atoi#code-python) |
| **Day 2** | Add Binary Strings ๐ขโ๐ป | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-2-add-binary-strings#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-2-add-binary-strings#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-2-add-binary-strings#code-python) |
| **Day 3** | Anagram ๐ ๐ก๐ค | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-3-anagram#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-3-anagram#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-3-anagram#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-3-anagram#code-python) |
| **Day 4** | Non-Repeating Character๐ข๐๐ญ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-4-non-repeating-character#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-4-non-repeating-character#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-4-non-repeating-character#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-4-non-repeating-character#code-python) |
| **Day 5** | Search Pattern (KMP Algorithm) ๐๐๐ง | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-5-search-pattern-kmp-algorithm#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-5-search-pattern-kmp-algorithm#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-5-search-pattern-kmp-algorithm#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-5-search-pattern-kmp-algorithm#code-python) |
| **Day 6** | Min Chars to Add for Palindrome โ๏ธ๐ฌ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-6-min-chars-to-add-for-palindrome#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-6-min-chars-to-add-for-palindrome#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-6-min-chars-to-add-for-palindrome#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-6-min-chars-to-add-for-palindrome#code-python) |
| **Day 7** | Strings Rotations of Each Other ๐๐ ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-7-strings-rotations-of-each-other#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-7-strings-rotations-of-each-other#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-7-strings-rotations-of-each-other#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-7-strings-rotations-of-each-other#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Sorting) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Sorting\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Sort 0s, 1s, and 2s ๐ฆ๐ข๐จ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-1-sort-0s-1s-and-2s#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-1-sort-0s-1s-and-2s#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-1-sort-0s-1s-and-2s#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-1-sort-0s-1s-and-2s#code-python) |
| **Day 2** | Find H-Index ๐๐๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-2-find-h-index#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-2-find-h-index#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-2-find-h-index#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-2-find-h-index#code-python) |
| **Day 3** | Count Inversions ๐๐๐ข | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-3-count-inversions#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-3-count-inversions#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-3-count-inversions#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-3-count-inversions#code-python) |
| **Day 4** | Overlapping Intervals ๐
โฐ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-4-overlapping-intervals#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-4-overlapping-intervals#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-4-overlapping-intervals#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-4-overlapping-intervals#code-python) |
| **Day 5** | Insert Interval ๐๐ฒโณ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-5-insert-interval#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-5-insert-interval#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-5-insert-interval#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-5-insert-interval#code-python) |
| **Day 6** | Non-overlapping Intervalsโ๏ธ๐โ
| [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-6-non-overlapping-intervals#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-6-non-overlapping-intervals#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-6-non-overlapping-intervals#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-6-non-overlapping-intervals#code-python) |
| **Day 7** | Merge Without Extra Space ๐๐ซ๐ฆ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-7-merge-without-extra-space#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-7-merge-without-extra-space#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-7-merge-without-extra-space#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-7-merge-without-extra-space#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Searching) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Searching\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :-------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Number of occurrence ๐งฎ๐๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-1-number-of-occurrence#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-1-number-of-occurrence#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-1-number-of-occurrence#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-1-number-of-occurrence#code-python) |
| **Day 2** | Sorted and Rotated Minimum ๐ข๐๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-2-sorted-and-rotated-minimum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-2-sorted-and-rotated-minimum#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-2-sorted-and-rotated-minimum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-2-sorted-and-rotated-minimum#code-python) |
| **Day 3** | Search in Rotated Sorted Array ๐๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-3-search-in-rotated-sorted-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-3-search-in-rotated-sorted-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-3-search-in-rotated-sorted-array#code-python) |
| **Day 4** | Peak element ๐๐โฐ๏ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-4-peak-element#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-4-peak-element#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-4-peak-element#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-4-peak-element#code-python) |
| **Day 5** | K-th element of two Arrays ๐ข๐๐ฏ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-5-k-th-element-of-two-arrays#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-5-k-th-element-of-two-arrays#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-5-k-th-element-of-two-arrays#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-5-k-th-element-of-two-arrays#code-python) |
| **Day 6** | Aggressive Cows ๐๐๐ฎ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-6-aggressive-cows#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-6-aggressive-cows#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-6-aggressive-cows#code-python) |
| **Day 7** | Allocate Minimum Pages ๐๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-7-allocate-minimum-pages#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-7-allocate-minimum-pages#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-7-allocate-minimum-pages#code-python) |
| **Day 8** | Kth Missing Positive Number in a Sorted Array ๐ขโก๏ธโ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-8-kth-missing-positive-number-in-a-sorted-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-8-kth-missing-positive-number-in-a-sorted-array#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-8-kth-missing-positive-number-in-a-sorted-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-8-kth-missing-positive-number-in-a-sorted-array#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Matrix) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Matrix\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :-----------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Spirally traversing a matrix ๐๐ข๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-1-spirally-traversing-a-matrix#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-1-spirally-traversing-a-matrix#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-1-spirally-traversing-a-matrix#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-1-spirally-traversing-a-matrix#code-python) |
| **Day 2** | Rotate by 90 degree ๐โฉ๏ธ๐๏ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-2-rotate-by-90-degree#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-2-rotate-by-90-degree#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-2-rotate-by-90-degree#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-2-rotate-by-90-degree#code-python) |
| **Day 3** | Search in a Row-Column sorted matrix ๐๐ข๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-3-search-in-a-row-column-sorted-matrix#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-3-search-in-a-row-column-sorted-matrix#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-3-search-in-a-row-column-sorted-matrix#code-python) |
| **Day 4** | Search in a row-wise sorted matrix ๐๐โ
| | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-4-search-in-a-row-wise-sorted-matrix#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-4-search-in-a-row-wise-sorted-matrix#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-4-search-in-a-row-wise-sorted-matrix#code-python) |
| **Day 5** | Search in a sorted Matrix ๐๐งฎ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-5-search-in-a-sorted-matrix#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-5-search-in-a-sorted-matrix#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-5-search-in-a-sorted-matrix#code-python) |
| **Day 6** | Set Matrix Zeroes ๐ฆโฌ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-6-set-matrix-zeroes#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-6-set-matrix-zeroes#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-6-set-matrix-zeroes#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Hashing) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Hashing\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :-------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Two Sum - Pair with Given Sum โ๐ข๐งฉ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-1-two-sum-pair-with-given-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-1-two-sum-pair-with-given-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-1-two-sum-pair-with-given-sum#code-python) |
| **Day 2** | Count pairs with given sum ๐ข๐งฎ๐ ๏ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-2-count-pairs-with-given-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-2-count-pairs-with-given-sum#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-2-count-pairs-with-given-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-2-count-pairs-with-given-sum#code-python) |
| **Day 3** | Find All Triplets with Zero Sum ๐ข๐๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-3-find-all-triplets-with-zero-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-3-find-all-triplets-with-zero-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-3-find-all-triplets-with-zero-sum#code-python) |
| **Day 4** | Intersection of Two arrays with Duplicate Elements ๐๐ค๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-4-intersection-of-two-arrays-with-duplicate-elements#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-4-intersection-of-two-arrays-with-duplicate-elements#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-4-intersection-of-two-arrays-with-duplicate-elements#code-python) |
| **Day 5** | Union of Arrays with Duplicates ๐๐ฆ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-5-union-of-arrays-with-duplicates#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-5-union-of-arrays-with-duplicates#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-5-union-of-arrays-with-duplicates#code-python) |
| **Day 6** | Longest Consecutive Subsequence ๐โโโณ๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-6-longest-consecutive-subsequence#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-6-longest-consecutive-subsequence#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-6-longest-consecutive-subsequence#code-python) |
| **Day 7** | Print Anagrams Together ๐ก๐ฅ๐ค | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-7-print-anagrams-together#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-7-print-anagrams-together#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-7-print-anagrams-together#code-python) |
| **Day 8** | Subarrays with sum K ๐ขโ๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-8-subarrays-with-sum-k#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-8-subarrays-with-sum-k#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-8-subarrays-with-sum-k#code-python) |
| **Day 9** | Count Subarrays with given XOR ๐ป๐ข๐งฎ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-9-count-subarrays-with-given-xor#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-9-count-subarrays-with-given-xor#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-9-count-subarrays-with-given-xor#code-python) |
### [**๐ซ GFG 160 Days of Problem Solving (Two Pointer Technique) ๐ซ**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Two%20Pointer%20Technique\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :--------: | :------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Count all triplets with given sum in sorted array ๐ข๐ฝ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-1-count-all-triplets-with-given-sum-in-sorted-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-1-count-all-triplets-with-given-sum-in-sorted-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-1-count-all-triplets-with-given-sum-in-sorted-array#code-python) |
| **Day 2** | Count Pairs whose sum is less than target ๐ซ๐ข๐จโ๐ป | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-2-count-pairs-whose-sum-is-less-than-target#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-2-count-pairs-whose-sum-is-less-than-target#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-2-count-pairs-whose-sum-is-less-than-target#code-python) |
| **Day 3** | Sum Pair closest to target ๐ฏ๐ก๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-3-sum-pair-closest-to-target#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-3-sum-pair-closest-to-target#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-3-sum-pair-closest-to-target#code-python) |
| **Day 4** | Pair with given sum in a sorted array ๐ข๐งฎโ
| | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-4-pair-with-given-sum-in-a-sorted-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-4-pair-with-given-sum-in-a-sorted-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-4-pair-with-given-sum-in-a-sorted-array#code-python) |
| **Day 5** | Count the number of possible triangles ๐๐๐งฎ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-5-count-the-number-of-possible-triangles#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-5-count-the-number-of-possible-triangles#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-5-count-the-number-of-possible-triangles#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-5-count-the-number-of-possible-triangles#code-python) |
| **Day 6** | Indexes of Subarray Sum ๐๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-6-indexes-of-subarray-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-6-indexes-of-subarray-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-6-indexes-of-subarray-sum#code-python) |
| **Day 7** | Count distinct elements in every window ๐ข๐ฏ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-7-count-distinct-elements-in-every-window#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-7-count-distinct-elements-in-every-window#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-7-count-distinct-elements-in-every-window#code-python) |
| **Day 8** | Longest substring with distinct characters ๐งต๐ค๐ง | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-8-longest-substring-with-distinct-characters#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-8-longest-substring-with-distinct-characters#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-8-longest-substring-with-distinct-characters#code-python) |
| **Day 9** | Trapping Rain Water ๐ง๏ธ๐ง๐๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-9-trapping-rain-water#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-9-trapping-rain-water#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-9-trapping-rain-water#code-python) |
| **Day 10** | Container With Most Water๐ฆ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-10-container-with-most-water#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-10-container-with-most-water#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-10-container-with-most-water#code-python) |
### [**โ GFG 160 Days of Problem Solving (Prefix Sum) โ**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Prefix%20Sum\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :-----------------------------------: | :---: | :---------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Equilibrium Point โ๏ธ๐๐งฎ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-1-equilibrium-point#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-1-equilibrium-point#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-1-equilibrium-point#code-python) |
| **Day 2** | Longest Subarray with Sum K ๐๐๐ ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-2-longest-subarray-with-sum-k#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-2-longest-subarray-with-sum-k#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-2-longest-subarray-with-sum-k#code-python) |
| **Day 3** | Largest subarray of 0's and 1's ๐ขโ๐ด | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-3-largest-subarray-of-0s-and-1s#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-3-largest-subarray-of-0s-and-1s#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-3-largest-subarray-of-0s-and-1s#code-python) |
| **Day 4** | Product array puzzle๐งฉ๐ฆโ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-4-product-array-puzzle#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-4-product-array-puzzle#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-4-product-array-puzzle#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Linked List) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Linked%20List\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :--------: | :-----------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Reverse a linked list ๐๐โ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-1-reverse-a-linked-list#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-1-reverse-a-linked-list#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-1-reverse-a-linked-list#code-python) |
| **Day 2** | Rotate a Linked List ๐๐๐ซ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-2-rotate-a-linked-list#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-2-rotate-a-linked-list#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-2-rotate-a-linked-list#code-python) |
| **Day 3** | Merge two sorted linked lists ๐โ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-3-merge-two-sorted-linked-lists#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-3-merge-two-sorted-linked-lists#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-3-merge-two-sorted-linked-lists#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-3-merge-two-sorted-linked-lists#code-python) |
| **Day 4** | Linked List Group Reverse ๐๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-4-linked-list-group-reverse#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-4-linked-list-group-reverse#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-4-linked-list-group-reverse#code-python) |
| **Day 5** | Add Number Linked Lists โ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-5-add-number-linked-lists#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-5-add-number-linked-lists#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-5-add-number-linked-lists#code-python) |
| **Day 6** | Clone List with Next and Random ๐๐๐ค | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-6-clone-list-with-next-and-random#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-6-clone-list-with-next-and-random#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-6-clone-list-with-next-and-random#code-python) |
| **Day 7** | Detect Loop in linked list ๐๐๐ฆ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-7-detect-loop-in-linked-list#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-7-detect-loop-in-linked-list#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-7-detect-loop-in-linked-list#code-python) |
| **Day 8** | Find the first node of loop in linked list ๐๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-8-find-the-first-node-of-loop-in-linked-list#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-8-find-the-first-node-of-loop-in-linked-list#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-8-find-the-first-node-of-loop-in-linked-list#code-python) |
| **Day 9** | Remove loop in Linked List ๐๐ซ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-9-remove-loop-in-linked-list#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-9-remove-loop-in-linked-list#code-java-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-9-remove-loop-in-linked-list#code-python-1) |
| **Day 10** | LRU Cache ๐๐ค๐พ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-10-lru-cache#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-10-lru-cache#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-10-lru-cache#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Recursion and Backtracking) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Recursion%20and%20Backtracking\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :-----------------------------: | :---: | :--------------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Permutations of a String ๐ ๐๐งฉ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-1-permutations-of-a-string#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-1-permutations-of-a-string#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-1-permutations-of-a-string#code-python-1) |
| **Day 2** | Implement Pow โก๐ข๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-2-implement-pow#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-2-implement-pow#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-2-implement-pow#code-python) |
| **Day 3** | N-Queen Problem ๐โ๏ธ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-3-n-queen-problem#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-3-n-queen-problem#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-3-n-queen-problem#code-python) |
| **Day 4** | Solve the Sudoku ๐งฉ๐๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-4-solve-the-sudoku#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-4-solve-the-sudoku#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-4-solve-the-sudoku#code-python) |
| **Day 5** | Word Search๐๐ ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-5-word-search#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-5-word-search#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-5-word-search#code-python) |
### [**๐ด GFG 160 Days of Problem Solving (Tree) ๐ด**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Tree\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :--------: | :--------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Level order traversal ๐ณ๐ค๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-1-level-order-traversal#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-1-level-order-traversal#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-1-level-order-traversal#code-python) |
| **Day 2** | Height of Binary Tree ๐ฒ๐๐ชต | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-2-height-of-binary-tree#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-2-height-of-binary-tree#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-2-height-of-binary-tree#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-2-height-of-binary-tree#code-python) |
| **Day 3** | Diameter of a Binary Tree ๐ณ๐๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-3-diameter-of-a-binary-tree#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-3-diameter-of-a-binary-tree#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-3-diameter-of-a-binary-tree#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-3-diameter-of-a-binary-tree#code-python) |
| **Day 4** | Mirror Tree ๐ณ๐ช๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-4-mirror-tree#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-4-mirror-tree#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-4-mirror-tree#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-4-mirror-tree#code-python) |
| **Day 5** | Construct Tree from Inorder & Preorder ๐ณ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-5-construct-tree-from-inorder-and-preorder#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-5-construct-tree-from-inorder-and-preorder#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-5-construct-tree-from-inorder-and-preorder#code-python) |
| **Day 6** | Inorder Traversal ๐ณโก๏ธ๐ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-6-inorder-traversal#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-6-inorder-traversal#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-6-inorder-traversal#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-6-inorder-traversal#code-python) |
| **Day 7** | Tree Boundary Traversal ๐ณ๐๐ฟ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-7-tree-boundary-traversal#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-7-tree-boundary-traversal#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-7-tree-boundary-traversal#code-python) |
| **Day 8** | Maximum path sum from any node ๐ณ๐ค๏ธ๐ผ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-8-maximum-path-sum-from-any-node#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-8-maximum-path-sum-from-any-node#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-8-maximum-path-sum-from-any-node#code-python) |
| **Day 9** | K Sum Paths ๐ณ๐ค๏ธ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-9-k-sum-paths#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-9-k-sum-paths#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-9-k-sum-paths#code-python) |
| **Day 10** | Check for BST ๐ณโ
๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-10-check-for-bst#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-10-check-for-bst#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-10-check-for-bst#code-python) |
| **Day 11** | k-th Smallest in BST ๐ณ๐ข๐๏ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-11-k-th-smallest-in-bst#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-11-k-th-smallest-in-bst#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-11-k-th-smallest-in-bst#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-11-k-th-smallest-in-bst#code-python) |
| **Day 12** | Pair Sum in BST.md ๐ณโ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-12-pair-sum-in-bst#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-12-pair-sum-in-bst#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-12-pair-sum-in-bst#code-python) |
| **Day 13** | Fixing Two nodes of a BST ๐ณ๐๐ ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-13-fixing-two-nodes-of-a-bst#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-13-fixing-two-nodes-of-a-bst#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-13-fixing-two-nodes-of-a-bst#code-python) |
| **Day 14** | Lowest Common Ancestor in a BST ๐ณ๐๐ค | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-14-lowest-common-ancestor-in-a-bst#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-14-lowest-common-ancestor-in-a-bst#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-14-lowest-common-ancestor-in-a-bst#code-python) |
| **Day 15** | Serialize and deserialize a binary tree ๐ฒ๐ค๐พ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-15-serialize-and-deserialize-a-binary-tree#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-15-serialize-and-deserialize-a-binary-tree#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-15-serialize-and-deserialize-a-binary-tree#code-python) |
### [**๐บ GFG 160 Days of Problem Solving (Heap) ๐บ**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Heap\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :--------------------------------: | :---: | :-------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | k largest elements ๐ข๐๐ฅ | | [Solution](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/Z/README.md#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-1-k-largest-elements#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-1-k-largest-elements#code-python) |
| **Day 2** | K Closest Points to Origin ๐๐บ๏ธ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-2-k-closest-points-to-origin#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-2-k-closest-points-to-origin#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-2-k-closest-points-to-origin#code-python) |
| **Day 3** | Merge K sorted linked lists ๐๐โก๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-3-merge-k-sorted-linked-lists#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-3-merge-k-sorted-linked-lists#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-3-merge-k-sorted-linked-lists#code-python) |
| **Day 4** | Find median in a stream ๐โณ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-4-find-median-in-a-stream#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-4-find-median-in-a-stream#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-4-find-median-in-a-stream#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Stack) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Stack\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :---------------------------------------------: | :---: | :---------------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Parenthesis Checker ๐๏ธโ
๐๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-1-parenthesis-checker#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-1-parenthesis-checker#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-1-parenthesis-checker#code-python) |
| **Day 2** | Longest valid Parentheses ๐ฐโก๏ธ๐ญ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-2-longest-valid-parentheses#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-2-longest-valid-parentheses#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-2-longest-valid-parentheses#code-python) |
| **Day 3** | Next Greater Element โก๏ธ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-3-next-greater-element#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-3-next-greater-element#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-3-next-greater-element#code-python) |
| **Day 4** | Stock span problem ๐นโณ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-4-stock-span-problem#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-4-stock-span-problem#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-4-stock-span-problem#code-python) |
| **Day 5** | Histogram Max Rectangular Area ๐ฆ๐ฒ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-5-histogram-max-rectangular-area#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-5-histogram-max-rectangular-area#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-5-histogram-max-rectangular-area#code-python) |
| **Day 6** | Maximum of minimum for every window size ๐๐ช๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-6-maximum-of-minimum-for-every-window-size#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-6-maximum-of-minimum-for-every-window-size#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-6-maximum-of-minimum-for-every-window-size#code-python) |
| **Day 7** | Get Min from Stack ๐๐ฆ๐ฝ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-7-get-min-from-stack#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-7-get-min-from-stack#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-7-get-min-from-stack#code-python) |
| **Day 8** | Evaluation of Postfix Expression ๐ฅโ๏ธโ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-8-evaluation-of-postfix-expression#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-8-evaluation-of-postfix-expression#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-8-evaluation-of-postfix-expression#code-python) |
| **Day 9** | Decode the string ๐๐ ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-9-decode-the-string#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-9-decode-the-string#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-9-decode-the-string#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Queue and Deque) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Queue%20and%20Deque\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :----------------------------------------: | :---: | :--------------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | K Sized Subarray Maximum ๐ข๐ฉ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-1-k-sized-subarray-maximum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-1-k-sized-subarray-maximum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-1-k-sized-subarray-maximum#code-python) |
| **Day 2** | Longest Bounded-Difference Subarray ๐๐ข๐ฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-2-longest-bounded-difference-subarray#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-2-longest-bounded-difference-subarray#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-2-longest-bounded-difference-subarray#code-python) |
### [**๐งต GFG 160 Days of Problem Solving (Dynamic Programming) ๐งต**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Dynamic%20Programming\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :--------: | :----------------------------------------------------: | :---: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Longest Increasing Subsequence ๐๐๐งฉ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-1-longest-increasing-subsequence#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-1-longest-increasing-subsequence#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-1-longest-increasing-subsequence#code-python) |
| **Day 2** | Longest String Chain ๐โ๏ธ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-2-longest-string-chain#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-2-longest-string-chain#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-2-longest-string-chain#code-python) |
| **Day 3** | Longest Common Subsequence ๐โ๏ธ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-3-longest-common-subsequence#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-3-longest-common-subsequence#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-3-longest-common-subsequence#code-python) |
| **Day 4** | Longest Palindromic Subsequence ๐๐ซ๐ฌ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-4-longest-palindromic-subsequence#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-4-longest-palindromic-subsequence#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-4-longest-palindromic-subsequence#code-python) |
| **Day 5** | Longest Palindrome in a String ๐ ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-5-longest-palindrome-in-a-string#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-5-longest-palindrome-in-a-string#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-5-longest-palindrome-in-a-string#code-python) |
| **Day 6** | Palindrome SubStrings ๐๐๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-6-palindrome-substrings#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-6-palindrome-substrings#code-java-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-6-palindrome-substrings#code-python-1) |
| **Day 7** | Edit Distance โ๏ธ๐งฎ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-7-edit-distance#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-7-edit-distance#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-7-edit-distance#code-python) |
| **Day 8** | Ways to Reach the n'th Stair โก๏ธ๐โโ๏ธ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-8-ways-to-reach-the-nth-stair#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-8-ways-to-reach-the-nth-stair#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-8-ways-to-reach-the-nth-stair#code-python) |
| **Day 9** | Min Cost Climbing Stairs ๐โโ๏ธ๐ฐ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-9-min-cost-climbing-stairs#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-9-min-cost-climbing-stairs#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-9-min-cost-climbing-stairs#code-python) |
| **Day 10** | 0 - 1 Knapsack Problem ๐๐ฐ๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-10-0-1-knapsack-problem#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-10-0-1-knapsack-problem#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-10-0-1-knapsack-problem#code-python) |
| **Day 11** | Coin Change (Count Ways) ๐ช๐ข๐ฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-11-coin-change-count-ways#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-11-coin-change-count-ways#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-11-coin-change-count-ways#code-python) |
| **Day 12** | Coin Change (Minimum Coins) ๐ช๐๐ฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-12-coin-change-minimum-coins#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-12-coin-change-minimum-coins#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-12-coin-change-minimum-coins#code-python) |
| **Day 13** | Minimum Jumps ๐โโ๏ธ๐จโก๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-13-minimum-jumps#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-13-minimum-jumps#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-13-minimum-jumps#code-python) |
| **Day 14** | Subset Sum Problem ๐ฏ๐ขโ
| | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-14-subset-sum-problem#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-14-subset-sum-problem#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-14-subset-sum-problem#code-python) |
| **Day 15** | Partition Equal Subset Sum โ๐ขโ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-15-partition-equal-subset-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-15-partition-equal-subset-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-15-partition-equal-subset-sum#code-python) |
| **Day 16** | Stock Buy and Sell โ Max K Transactions Allowed ๐ฐ๐ต๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-16-stock-buy-and-sell-max-k-transactions-allowed#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-16-stock-buy-and-sell-max-k-transactions-allowed#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-16-stock-buy-and-sell-max-k-transactions-allowed#code-python) |
| **Day 17** | Stock Buy and Sell โ Max 2 Transactions Allowed ๐ฐ๐น๐ต | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-17-stock-buy-and-sell-max-2-transactions-allowed#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-17-stock-buy-and-sell-max-2-transactions-allowed#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-17-stock-buy-and-sell-max-2-transactions-allowed#code-python) |
| **Day 18** | Stickler Thief ๐ฆนโโ๏ธ๐ ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-18-stickler-thief#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-18-stickler-thief#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-18-stickler-thief#code-python) |
| **Day 19** | Stickler Thief II ๐ฆนโโ๏ธ๐ ๐ฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-19-stickler-thief-ii#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-19-stickler-thief-ii#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-19-stickler-thief-ii#code-python) |
| **Day 20** | Total Decoding Messages ๐ขโก๏ธ๐ก | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-20-total-decoding-messages#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-20-total-decoding-messages#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-20-total-decoding-messages#code-python) |
| **Day 21** | Matrix Chain Multiplication โ๐๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-21-matrix-chain-multiplication#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-21-matrix-chain-multiplication#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-21-matrix-chain-multiplication#code-python) |
| **Day 22** | Boolean Parenthesization ๐งฎโ
โ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-22-boolean-parenthesization#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-22-boolean-parenthesization#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-22-boolean-parenthesization#code-python) |
| **Day 23** | Word Break ๐โ๏ธ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-23-word-break#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-23-word-break#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-23-word-break#code-python) |
### [**๐ต GFG 160 Days of Problem Solving (Greedy) ๐ต**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Greedy\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :------------------------------------: | :---: | :-------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Minimum Platforms ๐๐โณ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-1-minimum-platforms#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-1-minimum-platforms#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-1-minimum-platforms#code-python) |
| **Day 2** | Activity Selection ๐
โณ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-2-activity-selection#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-2-activity-selection#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-2-activity-selection#code-python) |
| **Day 3** | Job Sequencing Problem ๐
๐ผ๐ฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-3-job-sequencing-problem#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-3-job-sequencing-problem#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-3-job-sequencing-problem#code-python) |
| **Day 4** | Gas Station โฝ๐๐จ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-4-gas-station#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-4-gas-station#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-4-gas-station#code-python) |
| **Day 5** | Maximize partitions in a String ๐ ๐งฉ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-5-maximize-partitions-in-a-string#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-5-maximize-partitions-in-a-string#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-5-maximize-partitions-in-a-string#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Graph) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Graph\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :--------: | :--------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | DFS of Graph ๐๐๐ฒ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-1-dfs-of-graph#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-1-dfs-of-graph#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-1-dfs-of-graph#code-python) |
| **Day 2** | BFS of graph ๐๐ถโโ๏ธ๐ฒ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-2-bfs-of-graph#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-2-bfs-of-graph#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-2-bfs-of-graph#code-python) |
| **Day 3** | Rotten Oranges ๐๐ฆ โณ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-3-rotten-oranges#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-3-rotten-oranges#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-3-rotten-oranges#code-python) |
| **Day 4** | Undirected Graph Cycle โป๏ธ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-4-undirected-graph-cycle#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-4-undirected-graph-cycle#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-4-undirected-graph-cycle#code-python) |
| **Day 5** | Find the number of islands ๐๏ธ๐งญโต | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-5-find-the-number-of-islands#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-5-find-the-number-of-islands#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-5-find-the-number-of-islands#code-python) |
| **Day 6** | Topological sort ๐ฆ๐ธ๏ธ๐ฃ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-6-topological-sort#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-6-topological-sort#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-6-topological-sort#code-python) |
| **Day 7** | Directed Graph Cycle ๐๐๐ฆ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-7-directed-graph-cycle#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-7-directed-graph-cycle#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-7-directed-graph-cycle#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-7-directed-graph-cycle#code-python) |
| **Day 8** | Bridge edge in a graph ๐๐ธ๏ธ๐งญ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-8-bridge-edge-in-a-graph#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-8-bridge-edge-in-a-graph#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-8-bridge-edge-in-a-graph#code-python) |
| **Day 9** | Articulation Point - II ๐ธ๏ธโ๏ธ๐บ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-9-articulation-point-ii#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-9-articulation-point-ii#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-9-articulation-point-ii#code-python) |
| **Day 10** | Minimum cost to connect all houses in a city ๐๏ธ๐ฐ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-10-minimum-cost-to-connect-all-houses-in-a-city#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-10-minimum-cost-to-connect-all-houses-in-a-city#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-10-minimum-cost-to-connect-all-houses-in-a-city#code-python) |
| **Day 11** | Dijkstra Algorithm ๐ฆ๐ก๐บ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-11-dijkstra-algorithm#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-11-dijkstra-algorithm#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-11-dijkstra-algorithm#code-python) |
| **Day 12** | Flood fill Algorithm ๐๐๏ธ๐ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-12-flood-fill-algorithm#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-12-flood-fill-algorithm#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-12-flood-fill-algorithm#code-python) |
| **Day 13** | Account Merge ๐ฅ๐ผ๐งพ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-13-account-merge#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-13-account-merge#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-13-account-merge#code-python) |
| **Day 14** | Clone an Undirected Graph ๐๐ฅ๐งฌ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-14-clone-an-undirected-graph#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-14-clone-an-undirected-graph#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-14-clone-an-undirected-graph#code-python) |
| **Day 15** | Alien Dictionary ๐ช๐๐ฆพ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-15-alien-dictionary#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-15-alien-dictionary#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-15-alien-dictionary#code-python) |
| **Day 16** | Bellman-Ford ๐๐ฃ๏ธ๐ฆ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-16-bellman-ford#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-16-bellman-ford#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-16-bellman-ford#code-python) |
| **Day 17** | Floyd Warshall ๐๐๐ฅ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-17-floyd-warshall#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-17-floyd-warshall#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-17-floyd-warshall#code-python) |
| **Day 18** | Minimum Weight Cycle ๐งฎ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-18-minimum-weight-cycle#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-18-minimum-weight-cycle#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-18-minimum-weight-cycle#code-python) |
### [**๐ GFG 160 Days of Problem Solving (Tries) ๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Tries\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :----------------------------------------: | :---: | :-------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Implement Trie ๐ ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-1-implement-trie#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-1-implement-trie#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-1-implement-trie#code-python) |
| **Day 2** | Maximum XOR of two numbers in an array โโโ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-2-maximum-xor-of-two-numbers-in-an-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-2-maximum-xor-of-two-numbers-in-an-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-2-maximum-xor-of-two-numbers-in-an-array#code-python) |
### [**๐ชข GFG 160 Days of Problem Solving (Bit Manipulation) ๐ชข**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Bit%20Manipulation\)/README.md)
| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |
| :-------: | :----------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| **Day 1** | Find Only Repetitive Element from 1 to n-1 โฟ๐ข๐งท | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-1-find-only-repetitive-element-from-1-to-n-1#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-1-find-only-repetitive-element-from-1-to-n-1#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-1-find-only-repetitive-element-from-1-to-n-1#code-python) |
| **Day 2** | Missing in Array ๐ข๐งฉ๐ต๏ธโโ๏ธ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-2-missing-in-array#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-2-missing-in-array#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-2-missing-in-array#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-2-missing-in-array#code-python) |
| **Day 3** | Unique Number I ๐ข๐ง ๐ต๏ธโโ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-3-unique-number-i#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-3-unique-number-i#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-3-unique-number-i#code-python) |
| **Day 4** | Unique Number II ๐ข๐ต๏ธโโ๏ธ๐งพ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-4-unique-number-ii#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-4-unique-number-ii#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-4-unique-number-ii#code-python) |
๐ Previously Solved Bonus Problem(Click to expand)
### [**๐ Bonus Problems (Arrays)๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Arrays\)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/README.md)
| **Bonus Problem No.** | **Problem Name** | **C** ๐ฅ๏ธ | **C++** ๐ | **Java** โ | **Python** ๐ |
| :-------------------: | :-------------------------------------------------------: | :-------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| *NUM 1* | **Split Array in Three Equal Sum Subarrays** ๐ฅ๐๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/1.-split-array-in-three-equal-sum-subarrays#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/1.-split-array-in-three-equal-sum-subarrays#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/1.-split-array-in-three-equal-sum-subarrays#code-python) |
| *NUM 2* | **Repetitive Addition of Digits** ๐ข๐๐ฅ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/2.-repetitive-addition-of-digits#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/2.-repetitive-addition-of-digits#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/2.-repetitive-addition-of-digits#code-python) |
| *NUM 3* | **Maximize Number of 1's** ๐ข๐ฅ๐ก | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/3.-maximize-number-of-1s#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/3.-maximize-number-of-1s#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/3.-maximize-number-of-1s#code-python) |
| *NUM 4* | **Last Moment Before All Ants Fall Out of a Plank** ๐๐โณ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/4.-last-moment-before-all-ants-fall-out-of-a-plank#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/4.-last-moment-before-all-ants-fall-out-of-a-plank#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/4.-last-moment-before-all-ants-fall-out-of-a-plank#code-python) |
### [**๐ Bonus Problems (Strings)๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Strings\)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/README.md)
| **Bonus Problem No.** | **Problem Name** | **C** ๐ฅ๏ธ | **C++** ๐ | **Java** โ | **Python** ๐ |
| :-------------------: | :-----------------------------------------: | :-------: | :---------------------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| *NUM 1* | **Fizz Buzz** ๐งฎ๐๐ข | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/1.-fizz-buzz#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/1.-fizz-buzz#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/1.-fizz-buzz#code-python) |
| *NUM 2* | **CamelCase Pattern Matching** ๐ซ๐ ๐ป | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/2.-camelcase-pattern-matching#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/2.-camelcase-pattern-matching#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/2.-camelcase-pattern-matching#code-python) |
| *NUM 3* | **Palindrome Sentence** ๐๐ฃ๏ธ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/3.-palindrome-sentence#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/3.-palindrome-sentence#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/3.-palindrome-sentence#code-python) |
| *NUM 4* | **Minimum repeat to make substring** ๐๐๐ค | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/4.-minimum-repeat-to-make-substring#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/4.-minimum-repeat-to-make-substring#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/4.-minimum-repeat-to-make-substring#code-python) |
| *NUM 5* | **Longest Prefix Suffix** ๐โ๏ธ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/5.-longest-prefix-suffix#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/5.-longest-prefix-suffix#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/5.-longest-prefix-suffix#code-python) |
| *NUM 6* | **Integer to Words** 1๏ธโฃ๐ ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/6.-integer-to-words#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/6.-integer-to-words#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/6.-integer-to-words#code-python) |
### [**๐ Bonus Problems (Sorting)๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Sorting\)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/README.md)
| **Bonus Problem No.** | **Problem Name** | **C** ๐ฅ๏ธ | **C++** ๐ | **Java** โ | **Python** ๐ |
| :-------------------: | :-----------------------------------: | :-------: | :-----------------------------------------------------------------------------------------------------------------------------------------------------: | :------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------: |
| *NUM 1* | **Minimum sum** ๐กโ๐ฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/1.-minimum-sum#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/1.-minimum-sum#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/1.-minimum-sum#code-python) |
| *NUM 2* | **Meeting Rooms** ๐
๐ขโฐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/2.-meeting-rooms#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/2.-meeting-rooms#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/2.-meeting-rooms#code-python) |
| *NUM 3* | **Form the Largest Number** ๐ข๐ฏ๐ฏ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/3.-form-the-largest-number#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/3.-form-the-largest-number#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/3.-form-the-largest-number#code-python) |
| *NUM 4* | **Make array elements unique** ๐งฎ๐ข๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/4.-make-array-elements-unique#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/4.-make-array-elements-unique#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/4.-make-array-elements-unique#code-python) |
### [**๐ Bonus Problems (Searching)๐**](https://github.com/Hunterdii/GeeksforGeeks-POTD/blob/main/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20\(Searching\)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/README.md)
| **Bonus Problem No.** | **Problem Name** | **C** ๐ฅ๏ธ | **C++** ๐ | **Java** โ | **Python** ๐ |
| :-------------------: | :-----------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
| *NUM 1* | **Implement Lower Bound** ๐๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/1.-implement-lower-bound#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/1.-implement-lower-bound#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/1.-implement-lower-bound#code-python) |
| *NUM 2* | **Bitonic Point** โฐ๏ธ๐๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/2.-bitonic-point#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/2.-bitonic-point#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/2.-bitonic-point#code-python) |
| *NUM 3* | **Median of 2 Sorted Arrays of Different Sizes** ๐๐ขโ๏ธ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/3.-median-of-2-sorted-arrays-of-different-sizes#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/3.-median-of-2-sorted-arrays-of-different-sizes#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/3.-median-of-2-sorted-arrays-of-different-sizes#code-python) |
| *NUM 4* | **Square Root** ๐ขโ๐ฒ | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/4.-square-root#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/4.-square-root#code-c-1) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/4.-square-root#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/4.-square-root#code-python) |
| *NUM 5* | **Koko Eating Bananas** ๐๐โณ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/5.-koko-eating-bananas#code-c) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/5.-koko-eating-bananas#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/5.-koko-eating-bananas#code-python) |
| *NUM 6* | **Minimum Days to Make M Bouquets** ๐ธโณ๐ | | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/6.-minimum-days-to-make-m-bouquets#code-cpp) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/6.-minimum-days-to-make-m-bouquets#code-java) | [Solution](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/6.-minimum-days-to-make-m-bouquets#code-python) |
***
#### ๐ Welcome to Our Coding Community! ๐
๐ฑ Dive into GeeksforGeeks Problem of the Day Solutions and level up your coding skills!
[](https://github.com/Hunterdii/GeeksforGeeks-POTD)
[๐ฅ Join the Conversation](https://github.com/Hunterdii/GeeksforGeeks-POTD)
[If you have any questions, insights, or solutions to share, don't miss out on our active ](https://github.com/Hunterdii/GeeksforGeeks-POTD)[Discussion Hub](https://github.com/Hunterdii/GeeksforGeeks-POTD/discussions)! ๐ Your participation is what makes this community great.
[](https://github.com/Hunterdii/GeeksforGeeks-POTD/discussions/15)
### **๐ Smart AI Resume Analyzer - Final Year Project ๐**
Hello, GeeksforGeeks GitHub community! ๐
This project is my final year endeavor where I have implemented a basic AI-powered resume analyzer using Streamlit. It's not perfect, but it's a step towards creating a smarter way to evaluate resumes in real-time.
But here's the best part โ **we need your support** to make this tool even smarter and more efficient! ๐ช Whether you're contributing new features, fixing bugs, or improving the user experience, your involvement can significantly shape the future of resume analysis.
๐ง **How can you contribute?**
* โญ **Star the repository** to show your support.
* ๐ **Contribute to the project** by adding new features(the functionality with your ideas) or fixing issues.
* ๐ **Spread the word** through social media and developer communities.
* ๐ **Share feedback** to make the tool more effective for users!
* ๐ **Report bugs** or suggest improvements to better the project.
Together, letโs create a seamless AI-powered solution for handling resumes. ๐
*Support Smart AI Resume Analyzer & Shape the Future of Technology! ๐ค*
[](https://github.com/Hunterdii/Smart-AI-Resume-Analyzer)
### **๐ Join the Rust Revolution! ๐**
Hello, GeeksforGeeks community! ๐
Looking to dive into **Rust**, one of the fastest-growing languages for **systems programming**? **30 Days of Rust** is your perfect starting point! From **basics to advanced concepts**, this repository is designed to provide you with practical, hands-on learning.
But here's the best part โ **we need your support** to make this resource even bigger and better! ๐ช Whether you are a beginner or an experienced developer, your contributions can help grow this community.
๐ง **What can you do to help?**
* โญ **Star the repository** to show your interest.
* ๐ **Contribute to the learning resources** or improve existing content.
* ๐ **Share the project** with fellow developers to expand the learning network.
* ๐ **Spread the word** to get more developers involved!
Together, we can empower the next generation of developers and make **Rust** a language of choice for high-performance applications. ๐
*Support Rust Learning & Contribute to the Future of Programming!*
[](https://github.com/Hunterdii/30-Days-Of-Rust)
### **๐ฅ Master Java with Awesome-Java! ๐ฅ**
Hey Developers! ๐
Are you looking to **level up your Java skills**? Whether youโre a beginner or an experienced developer, **Awesome-Java** is packed with useful Java resources, best practices, and hands-on coding exercises.
#### **Why should you explore this repo?**
โ
Well-structured Java concepts ๐\
โ
Covers **Core Java, OOP, DSA, Java 8+, Concurrency, and more** ๐๏ธ\
โ
Includes **real-world projects & solutions** ๐ป\
โ
Beginner-friendly explanations ๐\
โ
Open-source contributions welcome! ๐
๐ง **How can you contribute?**
* โญ **Star the repository** to show your support!
* ๐ ๏ธ **Improve existing code** or add new concepts.
* ๐ฌ **Suggest topics** that should be covered.
* ๐ค **Join discussions** and help others learn Java!
Letโs build an **Awesome Java** resource together! ๐
[](https://github.com/Hunterdii/Awesome-Java)
### **๐ TryHackMe Free Rooms - Learn Ethical Hacking! ๐**
Cybersecurity enthusiasts, this oneโs for you! ๐
**TryHackMe Free Rooms** is a curated list of **free hacking labs** from TryHackMe that help you build hands-on **pentesting, red teaming, and cybersecurity skills**.
#### **Whatโs inside?**
๐น List of **completely free** hacking labs ๐\
๐น Topics covering **Web Exploitation, Networking, Forensics, Reverse Engineering, and more!** ๐ป\
๐น Beginner-friendly **guided walkthroughs** ๐ต๏ธโโ๏ธ\
๐น Perfect for **CTF practice & OSCP prep** ๐ฏ\
๐น Community contributions encouraged! ๐ค
๐ง **How can you contribute?**
* โญ **Star the repository** to support ethical hacking education!
* ๐ข **Suggest or add new rooms** from TryHackMe.
* ๐ **Write walkthroughs** for tricky challenges.
* ๐ **Share this with fellow hackers** to grow the community!
Join now & start hacking! ๐
[](https://github.com/Hunterdii/tryhackme-free-rooms)
### ๐ก **Why Follow This Repository?**
* **๐๏ธโโ๏ธ 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.
### ๐ **How To Use This Repository**
1. **๐ Navigate Effortlessly:** Problems are sorted by date for easy access.
2. **๐ Study Explanations:** Grasp the core logic behind each solution.
3. **๐ญ Experiment & Practice:** Modify solutions or try implementing them in other languages.
4. **๐ฌ Engage & Collaborate:** Connect with the community to gain deeper insights.
### ๐ **Languages Used**
* [](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3Acpp+path%3ADecember+2024+GFG+SOLUTION\&type=code)
* [](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3AJava+path%3ADecember+2024+GFG+SOLUTION\&type=code)
* [](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3APython+path%3ADecember+2024+GFG+SOLUTION\&type=code)
* [](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3Ac+path%3ADecember+2024+GFG+SOLUTION\&type=code)
### ๐ค **Contribution Guidelines**
We โค๏ธ contributions! Here's how you can contribute:
1. **Fork** this repository.
2. **Create** a new branch for your feature or bug fix.
3. **Commit** your changes with a clear message.
4. **Submit** a pull request and weโll review it together!
> **Note:** Follow our coding style and include meaningful comments.
### [](https://github.com/Hunterdii/GeeksforGeeks-POTD) Your Star Counts!
๐ *If this repository helps you, don't forget to* **star it**! ๐
[](https://github.com/codespaces/new?hide_repo_select=true\&ref=main\&repo=769514979\&machine=basicLinux32gb\&location=?)
[](https://app.codeanywhere.com/#https://github.com/Hunterdii/GeeksforGeeks-POTD)
[](https://github.com/Hunterdii/GeeksforGeeks-POTD)[Het Patel Project Maintainer
|
| [](https://www.linkedin.com/in/patel-hetkumar-sandipbhai-8b110525a/) [](mailto:hunterdii9879@gmail.com) |
For any inquiries or feedback, please contact. Happy Contributingโค
[](https://github.com/Hunterdii/GeeksforGeeks-POTD)
