# 160 Days Of Problem Solving

## ![Star GIF](https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3) GfG 160 - 160 Days of Problem Solving ![Star GIF](https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3)

> *A journey through 160 days of learning and mastering problem-solving with GeeksforGeeks! From arrays to sorting, this roadmap has it all. Let's dive in!*

## 🚀 **Arrays Mastery**

Unleash the power of arrays with these fundamental to advanced problems.\
✨ **Days Covered:** **1 to 13**

| 🗓️ **Day** | 🚀 **Problem**                                         | 🌟 **Level** | 📂 **Solution**                                                                                                                                                    |
| ----------- | ------------------------------------------------------ | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| Day 1       | **Second Largest**                                     | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-1-second-largest)                                  |
| Day 2       | **Move All Zeroes to End**                             | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-2-move-all-zeroes-to-end)                          |
| Day 3       | **Reverse an Array**                                   | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-3-reverse-an-array)                                |
| Day 4       | **Rotate Array**                                       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-4-rotate-array)                                    |
| Day 5       | **Next Permutation**                                   | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-5-next-permutation)                                |
| Day 6       | **Majority Element II**                                | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-6-majority-element-ii)                             |
| Day 7       | **Stock Buy and Sell – Multiple Transactions Allowed** | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-7-stock-buy-and-sell-multiple-transaction-allowed) |
| Day 8       | **Stock Buy and Sell – Max One Transaction Allowed**   | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-8-stock-buy-and-sell-max-one-transaction-allowed)  |
| Day 9       | **Minimize the Heights II**                            | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-9-minimize-the-heights-ii)                         |
| Day 10      | **Kadane's Algorithm**                                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-10-kadanes-algorithm)                              |
| Day 11      | **Maximum Product Subarray**                           | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-11-maximum-product-subarray)                       |
| Day 12      | **Max Circular Subarray Sum**                          | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-12-max-circular-subarray-sum)                      |
| Day 13      | **Smallest Positive Missing Number**                   | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/day-13-smallest-positive-missing-number)               |

### 🔖 **Bonus Problems**

| 🎁 **Bonus No.** | 🧩 **Problem**                                      | 🚀 **Level** | 🔗 **Solution**                                                                                                                                                                |
| ---------------- | --------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| *1*              | **Split Array in Three Equal Sum Subarrays**        | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/1.-split-array-in-three-equal-sum-subarrays)        |
| *2*              | **Repetitive Addition of Digits**                   | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/2.-repetitive-addition-of-digits)                   |
| *3*              | **Maximize Number of 1's**                          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-arrays/bonus-problems/3.-maximize-number-of-1s)                           |
| *4*              | **Last Moment Before All Ants Fall Out of a Plank** | 🟡 Medium    | [Solved Check It Now!](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) |

#### 📌 **Additional Challenges (From my side)** :

| 🧩 **Problem**                                   | 🚀 **Level** | 🔗 **Problem Link**                                                                                |
| ------------------------------------------------ | ------------ | -------------------------------------------------------------------------------------------------- |
| **Segregate Even and Odd Numbers**               | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/segregate-even-and-odd-numbers4629/1)           |
| **Frequencies of Limited Range Array Elements**  | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/frequency-of-array-elements-1587115620/1)       |
| **Koko Eating Bananas**                          | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/koko-eating-bananas/1)                          |
| **Median of 2 Sorted Arrays of Different Sizes** | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/median-of-2-sorted-arrays-of-different-sizes/1) |

## 💡 **Strings Expertise**

Master the art of string manipulation with these intriguing challenges.\
✨ **Days Covered:** **14 to 20**

| 🗓️ **Day** | 💡 **Problem**                      | 🌟 **Level** | 📂 **Solution**                                                                                                                                     |
| ----------- | ----------------------------------- | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 14      | **Implement Atoi**                  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-1-implement-atoi)                  |
| Day 15      | **Add Binary Strings**              | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-2-add-binary-strings)              |
| Day 16      | **Anagram**                         | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-3-anagram)                         |
| Day 17      | **Non-Repeating Character**         | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-4-non-repeating-character)         |
| Day 18      | **Search Pattern (KMP Algorithm)**  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-5-search-pattern-kmp-algorithm)    |
| Day 19      | **Min Chars to Add for Palindrome** | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-6-min-chars-to-add-for-palindrome) |
| Day 20      | **Strings Rotations of Each Other** | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/day-7-strings-rotations-of-each-other) |

### 🔖 **Bonus Problems**

| 🎁 **Bonus No.** | 🧩 **Problem**                       | 🚀 **Level** | 🔗 **Solution**                                                                                                                                                  |
| ---------------- | ------------------------------------ | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| *NUM 1*          | **Fizz Buzz**                        | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/1.-fizz-buzz)                        |
| *NUM 2*          | **CamelCase Pattern Matching**       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/2.-camelcase-pattern-matching)       |
| *NUM 3*          | **Palindrome Sentence**              | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/3.-palindrome-sentence)              |
| *NUM 4*          | **Minimum Repeat to Make Substring** | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/4.-minimum-repeat-to-make-substring) |
| *NUM 5*          | **Longest Prefix Suffix**            | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/5.-longest-prefix-suffix)            |
| *NUM 6*          | **Integer to Words**                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-strings/bonus-problems/6.-integer-to-words)                 |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                   | 🚀 **Level** | 🔗 **Problem Link**                                                                                |
| ------------------------------------------------ | ------------ | -------------------------------------------------------------------------------------------------- |
| **Longest Substring Containing '1'**             | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/longest-substring-containing-1/1)               |
| **Run Length Encoding**                          | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/run-length-encoding/1)                          |
| **Reverse Each Word in a Given String**          | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/reverse-each-word-in-a-given-string1001/1)      |
| **Longest Palindromic Substring in Linear Time** | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/longest-palindromic-substring-in-linear-time/1) |

## 🔥 **Sorting Challenges**

Polish your sorting skills with these curated problems.\
✨ **Days Covered:** **21 to 27**

| 🗓️ **Day** | 🔥 **Problem**                | 🌟 **Level** | 📂 **Solution**                                                                                                                               |
| ----------- | ----------------------------- | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 21      | **Sort 0s, 1s, and 2s**       | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-1-sort-0s-1s-and-2s)         |
| Day 22      | **Find H-Index**              | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-2-find-h-index)              |
| Day 23      | **Count Inversions**          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-3-count-inversions)          |
| Day 24      | **Overlapping Intervals**     | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-4-overlapping-intervals)     |
| Day 25      | **Insert Interval**           | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-5-insert-interval)           |
| Day 26      | **Non-overlapping Intervals** | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-6-non-overlapping-intervals) |
| Day 27      | **Merge Without Extra Space** | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/day-7-merge-without-extra-space) |

### 🔖 **Bonus Problems**

| 🎁 **Bonus No.** | 🧩 **Problem**                 | 🚀 **Level** | 🔗 **Solution**                                                                                                                                            |
| ---------------- | ------------------------------ | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------- |
| *1*              | **Minimum sum**                | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/1.-minimum-sum)                |
| *2*              | **Meeting Rooms**              | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/2.-meeting-rooms)              |
| *3*              | **Form the Largest Number**    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/3.-form-the-largest-number)    |
| *4*              | **Make array elements unique** | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-sorting/bonus-problems/4.-make-array-elements-unique) |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                  | 🚀 **Level** | 🔗 **Problem Link**                                                                                                        |
| --------------------------------------------------------------- | ------------ | -------------------------------------------------------------------------------------------------------------------------- |
| **Minimum Difference Pair**                                     | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/minimum-difference-pair5444/1)                                          |
| **Intersection of Two Linked Lists**                            | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/intersection-of-two-linked-list/1)                                      |
| **Largest Divisible Subset**                                    | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/largest-divisible-subset--170643/1)                                     |
| **Smallest Positive Integer that Cannot Be Represented as Sum** | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/smallest-positive-integer-that-can-not-be-represented-as-sum--141631/1) |

## 🔍 **Searching Proficiency**

Master the art of searching techniques with these essential problems.\
✨ **Days Covered:** **28 to 35**

| 🗓️ **Day** | 🔍 **Problem**                                    | 🌟 **Level** | 📂 **Solution**                                                                                                                                                     |
| ----------- | ------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 28      | **Number of Occurrence**                          | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-1-number-of-occurrence)                          |
| Day 29      | **Sorted and Rotated Minimum**                    | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-2-sorted-and-rotated-minimum)                    |
| Day 30      | **Search in Rotated Sorted Array**                | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-3-search-in-rotated-sorted-array)                |
| Day 31      | **Peak element**                                  | 🟤 Basic     | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-4-peak-element)                                  |
| Day 32      | **K-th element of two Arrays**                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-5-k-th-element-of-two-arrays)                    |
| Day 33      | **Aggressive Cows**                               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-6-aggressive-cows)                               |
| Day 34      | **Allocate Minimum Pages**                        | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-7-allocate-minimum-pages)                        |
| Day 35      | **Kth Missing Positive Number in a Sorted Array** | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/day-8-kth-missing-positive-number-in-a-sorted-array) |

### 🔖 **Bonus Problems**

| 🎁 **Bonus No.** | 🧩 **Problem**                                   | 🚀 **Level** | 🔗 **Solution**                                                                                                                                                                |
| ---------------- | ------------------------------------------------ | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| *NUM 1*          | **Implement Lower Bound**                        | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/1.-implement-lower-bound)                        |
| *NUM 2*          | **Bitonic Point**                                | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/2.-bitonic-point)                                |
| *NUM 3*          | **Median of 2 Sorted Arrays of Different Sizes** | 🔴 Hard      | [Solved Check It Now!](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) |
| *NUM 4*          | **Square Root**                                  | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/4.-square-root)                                  |
| *NUM 5*          | **Koko Eating Bananas**                          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/5.-koko-eating-bananas)                          |
| *NUM 6*          | **Minimum days to make M bouquets**              | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-searching/bonus-problems/6.-minimum-days-to-make-m-bouquets)              |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                                                                  | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                                                                                                     |
| --------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Value Equal to Index Value**                                                                                                                                  | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/value-equal-to-index-value1330/1)                                                                                                                                                                    |
| **Next Greater Number Set Digits**                                                                                                                              | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/next-greater-number-set-digits3503/1)                                                                                                                                                                |
| <p><strong>Largest Divisible Subset</strong><br><strong>OR</strong><br><strong>Minimum Times A Has to Be Repeated Such That B is a Substring of It</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/searching-an-element-in-a-sorted-array-ternary-search--141631/1) / [Solve Now](https://www.geeksforgeeks.org/problems/minimum-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it--170631/1) |
| **Median of 2 Sorted Arrays of Different Sizes**                                                                                                                | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/median-of-2-sorted-arrays-of-different-sizes/1)                                                                                                                                                      |

## 🧮 **Matrix Maneuvers**

Navigate through the realm of matrices with these essential problems.\
✨ **Days Covered:** **36 to 41**

| 🗓️ **Day** | 🧮 **Problem**                           | 🌟 **Level** | 📂 **Solution**                                                                                                                                         |
| ----------- | ---------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 36      | **Spirally traversing a matrix**         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-1-spirally-traversing-a-matrix)         |
| Day 37      | **Rotate by 90 degree**                  | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-2-rotate-by-90-degree)                  |
| Day 38      | **Search in a Row-Column sorted matrix** | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-3-search-in-a-row-column-sorted-matrix) |
| Day 39      | **Search in a row-wise sorted matrix**   | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-4-search-in-a-row-wise-sorted-matrix)   |
| Day 40      | **Search in a sorted Matrix**            | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-5-search-in-a-sorted-matrix)            |
| Day 41      | **Set Matrix Zeroes**                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-matrix/day-6-set-matrix-zeroes)                    |

**Note:**

> **I'm currently interning full-time, so I can only tackle bonus problems on the weekends. I apologize for the delayed uploads and sincerely appreciate your patience! I’ll continue to share daily problems in the limited time I have, and I’m committed to bringing you more exciting challenges soon! 🙏**

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                     | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                   |
| ------------------------------------------------------------------------------------------------------------------ | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Sum of elements in a matrix**                                                                                    | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/sum-of-elements-in-a-matrix2000/1)                                                                                 |
| **Search in a Row-Column sorted matrix**                                                                           | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/search-in-a-matrix17201720/1)                                                                                      |
| <p><strong>Search in a sorted Matrix</strong><br><strong>OR</strong><br><strong>Maximum sum Rectangle</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1) / [Solve Now](https://www.geeksforgeeks.org/problems/maximum-sum-rectangle2948/1) |
| **Shortest Path by Removing K walls**                                                                              | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/shortest-path-by-removing-k-walls/1)                                                                               |

## #️⃣ **Hash Hustle**

Master the art of hashing with these pivotal problems.\
✨ **Days Covered:** **42 to 50**

| 🗓️ **Day** | #️⃣ **Problem**                                        | 🌟 **Level** | 📂 **Solution**                                                                                                                                                        |
| ----------- | ------------------------------------------------------ | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 42      | **Two Sum - Pair with Given Sum**                      | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-1-two-sum-pair-with-given-sum)                        |
| Day 43      | **Count Pairs with Given Sum**                         | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-2-count-pairs-with-given-sum)                         |
| Day 44      | **Find All Triplets with Zero Sum**                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-3-find-all-triplets-with-zero-sum)                    |
| Day 45      | **Intersection of Two arrays with Duplicate Elements** | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-4-intersection-of-two-arrays-with-duplicate-elements) |
| Day 46      | **Union of Arrays with Duplicates**                    | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-5-union-of-arrays-with-duplicates)                    |
| Day 47      | **Longest Consecutive Subsequence**                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-6-longest-consecutive-subsequence)                    |
| Day 48      | **Print Anagrams Together**                            | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-7-print-anagrams-together)                            |
| Day 49      | **Subarrays with sum K**                               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-8-subarrays-with-sum-k)                               |
| Day 50      | **Count Subarrays with given XOR**                     | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-hashing/day-9-count-subarrays-with-given-xor)                     |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                         | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                             |
| ---------------------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Largest Element in Array**                                                                                           | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/largest-element-in-array4009/1)                                                                                              |
| **Kth from End of Linked List**                                                                                        | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1)                                                                                          |
| <p><strong>Detect Loop in linked list</strong><br><strong>OR</strong><br><strong>K Sized Subarray Maximum</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/detect-loop-in-linked-list/1) / [Solve Now](https://www.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1) |
| **Clone List with Next and Random**                                                                                    | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)                                                                          |

## 🔄 **Pointer Pursuit**

Optimize your journey with the elegance of two-pointer techniques.\
✨ **Days Covered:** **51 to 60**

| 🗓️ **Day** | 🔄 **Problem**                                        | 🌟 **Level** | 📂 **Solution**                                                                                                                                                                     |
| ----------- | ----------------------------------------------------- | ------------ | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 51      | **Count all triplets with given sum in sorted array** | 🟡 Medium    | [Solved Check It Now!](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) |
| Day 52      | **Count Pairs whose sum is less than target**         | 🟡 Medium    | [Solved Check It Now!](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)         |
| Day 53      | **Sum Pair closest to target**                        | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-3-sum-pair-closest-to-target)                        |
| Day 54      | **Pair with given sum in a sorted array**             | 🟢 Easy      | [Solved Check It Now!](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)             |
| Day 55      | **Count the number of possible triangles**            | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-5-count-the-number-of-possible-triangles)            |
| Day 56      | **Indexes of Subarray Sum**                           | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-6-indexes-of-subarray-sum)                           |
| Day 57      | **Count distinct elements in every window**           | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-7-count-distinct-elements-in-every-window)           |
| Day 58      | **Longest substring with distinct characters**        | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-8-longest-substring-with-distinct-characters)        |
| Day 59      | **Trapping Rain Water**                               | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-9-trapping-rain-water)                               |
| Day 60      | **Container With Most Water**                         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-two-pointer-technique/day-10-container-with-most-water)                        |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                              | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                    |
| ----------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------ |
| **Reverse a string with spaces intact**                                                                     | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/reverse-a-string-with-spaces-intact5213/1)                                                          |
| **Two sum -Pairs with 0 Sum**                                                                               | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/count-pairs-with-given-sum5022/1)                                                                   |
| <p><strong>Remove loop in Linked List</strong><br><strong>OR</strong><br><strong>3 Sum Closest</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/remove-loop-in-linked-list/1) / [Solve Now](https://www.geeksforgeeks.org/problems/3-sum-closest/1) |
| **Shortest Range In BST**                                                                                   | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/shortest-range-in-bst--141631/1)                                                                    |

## 🗺️ **Prefix Precision**

Master the art of prefix sum with these essential problems.\
✨ **Days Covered:** **61 to 64**

| 🗓️ **Day** | 🗺️ **Problem**                     | 🌟 **Level** | 📂 **Solution**                                                                                                                                      |
| ----------- | ----------------------------------- | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 61      | **Equilibrium Point**               | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-1-equilibrium-point)             |
| Day 62      | **Longest Subarray with Sum K**     | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-2-longest-subarray-with-sum-k)   |
| Day 63      | **Largest subarray of 0's and 1's** | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-3-largest-subarray-of-0s-and-1s) |
| Day 64      | **Product array puzzle**            | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-prefix-sum/day-4-product-array-puzzle)          |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                                          | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                                         |
| --------------------------------------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Farthest Index**                                                                                                                      | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/longest-equal-prefix3139/1)                                                                                                              |
| **Max Sum Subarray of size K**                                                                                                          | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/max-sum-subarray-of-size-k5313/1)                                                                                                        |
| <p><strong>Longest subarray with sum divisible by K</strong><br><strong>OR</strong><br><strong>Subarray Sum Divisible By K</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/longest-subarray-with-sum-divisible-by-k1259/1) / [Solve Now](https://www.geeksforgeeks.org/problems/sub-array-sum-divisible-by-k2617/1) |
| **Largest rectangular sub-matrix whose sum is 0**                                                                                       | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/largest-rectangular-sub-matrix-whose-sum-is-0/1)                                                                                         |

## 🔗 **Linked List Chronicles**

Master the art of linked lists with smart manipulation and efficient designs.\
✨ **Days Covered:** **65 to 74**

| 🗓️ **Day** | 🔗 **Problem**                             | 🌟 **Level** | 📂 **Solution**                                                                                                                                                    |
| ----------- | ------------------------------------------ | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| Day 65      | Reverse a Linked List                      | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-1-reverse-a-linked-list)                      |
| Day 66      | Rotate a Linked List                       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-2-rotate-a-linked-list)                       |
| Day 67      | Merge two sorted linked lists              | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-3-merge-two-sorted-linked-lists)              |
| Day 68      | Linked List Group Reverse                  | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-4-linked-list-group-reverse)                  |
| Day 69      | Add Number Linked Lists                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-5-add-number-linked-lists)                    |
| Day 70      | Clone List with Next and Random            | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-6-clone-list-with-next-and-random)            |
| Day 71      | Detect Loop in linked list                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-7-detect-loop-in-linked-list)                 |
| Day 72      | Find the first node of loop in linked list | 🟢 Easy      | [Solved Check It Now!](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) |
| Day 73      | Remove loop in Linked List                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-9-remove-loop-in-linked-list)                 |
| Day 74      | LRU Cache                                  | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-linked-list/day-10-lru-cache)                                 |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                                          | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                                                |
| --------------------------------------------------------------------------------------------------------------------------------------- | ------------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Linked List Insertion At End**                                                                                                        | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/linked-list-insertion-1587115620/1)                                                                                                             |
| **Kth from End of Linked List**                                                                                                         | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1)                                                                                                             |
| <p><strong>Intersection Point in Y Shaped Linked Lists</strong><br><strong>OR</strong><br><strong>Flattening a Linked List</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/intersection-point-in-y-shaped-linked-lists--170645/1) / [Solve Now](https://www.geeksforgeeks.org/problems/flattening-a-linked-list--170645/1) |
| **Reverse a sublist of a linked list**                                                                                                  | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/reverse-a-sublist-of-a-linked-list/1)                                                                                                           |

## 🌀 **Recursion and Backtracking Adventure**

Dive into the magical world of recursion and backtracking to crack even the trickiest problems!

✨ **Days Covered:** **75 to 79**

| 🗓️ **Day** | 🌀 **Problem**                 | 🌟 **Level** | 📂 **Solution**                                                                                                                                                 |
| ----------- | ------------------------------ | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 75      | Permutations of a Given String | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-1-permutations-of-a-string) |
| Day 76      | Implement Pow                  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-2-implement-pow)            |
| Day 77      | N-Queen Problem                | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-3-n-queen-problem)          |
| Day 78      | Solve the Sudoku               | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-4-solve-the-sudoku)         |
| Day 79      | Word Search                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-recursion-and-backtracking/day-5-word-search)              |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                              | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                       |
| ----------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Print 1 To N Without Loop**                                                                               | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/print-1-to-n-without-using-loops-1587115620/1)                                                                         |
| **Josephus problem**                                                                                        | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/josephus-problem/1)                                                                                                    |
| <p><strong>Open the gates</strong><br><strong>OR</strong><br><strong>Largest number in K swaps</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/word-boggle-ii--141631/1) / [Solve Now](https://www.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1) |
| **String Permutations**                                                                                     | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/permutations-of-a-given-string-1587115620/1)                                                                           |

## 🌳 **Tree Traversals and Techniques**

Explore the depths of tree data structures with powerful traversal techniques!

✨ **Days Covered:** **80 to 94**

| 🗓️ **Day** | 🌲 **Problem**                          | 🌟 **Level** | 📂 **Solution**                                                                                                                                           |
| ----------- | --------------------------------------- | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 80      | Level Order Traversal                   | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-1-level-order-traversal)                    |
| Day 81      | Height of Binary Tree                   | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-2-height-of-binary-tree)                    |
| Day 82      | Diameter of a Binary Tree               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-3-diameter-of-a-binary-tree)                |
| Day 83      | Mirror Tree                             | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-4-mirror-tree)                              |
| Day 84      | Construct Tree from Inorder & Preorder  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-5-construct-tree-from-inorder-and-preorder) |
| Day 85      | Inorder Traversal                       | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-6-inorder-traversal)                        |
| Day 86      | Tree Boundary Traversal                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-7-tree-boundary-traversal)                  |
| Day 87      | Maximum path sum from any node          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-8-maximum-path-sum-from-any-node)           |
| Day 88      | K Sum Paths                             | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-9-k-sum-paths)                              |
| Day 89      | Check for BST                           | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-10-check-for-bst)                           |
| Day 90      | k-th Smallest in BST                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-11-k-th-smallest-in-bst)                    |
| Day 91      | Pair Sum in BST                         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-12-pair-sum-in-bst)                         |
| Day 92      | Fixing Two nodes of a BST               | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-13-fixing-two-nodes-of-a-bst)               |
| Day 93      | Lowest Common Ancestor in a BST         | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-14-lowest-common-ancestor-in-a-bst)         |
| Day 94      | Serialize and deserialize a binary tree | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tree/day-15-serialize-and-deserialize-a-binary-tree) |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                         | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                                 |
| ---------------------------------------------------------------------------------------------------------------------- | ------------ | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Count Leaves in Binary Tree**                                                                                        | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/count-leaves-in-binary-tree/1)                                                                                                   |
| **Mirror Tree**                                                                                                        | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/mirror-tree/1)                                                                                                                   |
| <p><strong>Tree Boundary Traversal</strong><br><strong>OR</strong><br><strong>Connect Nodes at Same Level</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1) / [Solve Now](https://www.geeksforgeeks.org/problems/connect-nodes-at-same-level--170647/1) |
| **Sorted Linked List to BST**                                                                                          | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/sorted-list-to-bst/1)                                                                                                            |

## 🔺 **Heap Havoc**

Master the art of heaps with priority queues, min-heaps, and max-heaps!

✨ **Days Covered:** **95 to 98**

| 🗓️ **Day** | 🔗 **Problem**              | 🌟 **Level** | 📂 **Solution**                                                                                                                              |
| ----------- | --------------------------- | ------------ | -------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 95      | k largest elements          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-1-k-largest-elements)          |
| Day 96      | K Closest Points to Origin  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-2-k-closest-points-to-origin)  |
| Day 97      | Merge K sorted linked lists | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-3-merge-k-sorted-linked-lists) |
| Day 98      | Find median in a stream     | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-heap/day-4-find-median-in-a-stream)     |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                   | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                             |
| ---------------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Height of Heap**                                                                                               | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/height-of-heap5025/1)                                                                                                        |
| **Minimum Cost of ropes**                                                                                        | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1)                                                                                          |
| <p><strong>Kth Largest in a Stream</strong><br><strong>OR</strong><br><strong>Merge k Sorted Arrays</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/kth-largest-element-in-a-stream2220/1) / [Solve Now](https://www.geeksforgeeks.org/problems/merge-k-sorted-arrays--151335/1) |
| **Find median in a stream**                                                                                      | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/find-median-in-a-stream-1587115620/1)                                                                                        |

## 🏗️ **Stack Struggle**

Master the art of **stacks** with next greater elements, valid parentheses, and more!

✨ **Days Covered:** **99 to 107**

| 🗓️ **Day** | 🔗 **Problem**                           | 🌟 **Level** | 📂 **Solution**                                                                                                                                            |
| ----------- | ---------------------------------------- | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 99      | Parenthesis Checker                      | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-1-parenthesis-checker)                      |
| Day 100     | Longest valid Parentheses                | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-2-longest-valid-parentheses)                |
| Day 101     | Next Greater Element                     | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-3-next-greater-element)                     |
| Day 102     | Stock span problem                       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-4-stock-span-problem)                       |
| Day 103     | Histogram Max Rectangular Area           | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-5-histogram-max-rectangular-area)           |
| Day 104     | Maximum of minimum for every window size | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-6-maximum-of-minimum-for-every-window-size) |
| Day 105     | Get Min from Stack                       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-7-get-min-from-stack)                       |
| Day 106     | Evaluation of Postfix Expression         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-8-evaluation-of-postfix-expression)         |
| Day 107     | Decode the string                        | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-stack/day-9-decode-the-string)                        |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                              | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                |
| ----------------------------------------------------------------------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| **Preorder Traversal**                                                                                      | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/preorder-traversal/1)                                                                                           |
| **Level Order in spiral form**                                                                              | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/level-order-traversal-in-spiral-form/1)                                                                         |
| <p><strong>Get Min from Stack</strong><br><strong>OR</strong><br><strong>The Celebrity Problem</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/get-minimum-element-from-stack/1) / [Solve Now](https://www.geeksforgeeks.org/problems/the-celebrity-problem/1) |
| **Max rectangle**                                                                                           | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/max-rectangle/1)                                                                                                |

## 🔃 **Queue Quest & Deque Duel**

Conquer **queues & deques** with problems on **first non-repeating characters, sliding windows, and more!**

✨ **Days Covered:** **108 to 109**

| 🗓️ **Day** | 🔗 **Problem**                      | 🌟 **Level** | 📂 **Solution**                                                                                                                                                 |
| ----------- | ----------------------------------- | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 108     | K Sized Subarray Maximum            | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-1-k-sized-subarray-maximum)            |
| Day 109     | Longest Bounded-Difference Subarray | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-queue-and-deque/day-2-longest-bounded-difference-subarray) |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                                                                                        | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                                                                                                                                       |
| ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------ | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Queue Using Array**                                                                                                                                                                 | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/implement-queue-using-array/1)                                                                                                                                                                                                         |
| <p><strong>Level Order in spiral form</strong><br><strong>OR</strong><br><strong>Stack using two queues</strong></p>                                                                  | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/queue-using-two-stacks/1) / [Solve Now](https://www.geeksforgeeks.org/problems/stack-using-two-queues/1)                                                                                                                               |
| <p><strong>Subarrays Product Less than K</strong><br><strong>OR</strong><br><strong>Stream First Non-repeating</strong><br><strong>OR</strong><br><strong>Rotten Oranges</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/1) / [Solve Now](https://www.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1) / [Solve Now](https://www.geeksforgeeks.org/problems/rotten-oranges2536/1) |

## 🧵 **Dynamic Programming Dojo**

Master the art of **optimal subproblems, overlapping solutions & memoized magic!** 🧠💻

✨ **Days Covered:** **110 to 132**

| 🗓️ **Day** | 🔗 **Problem**                                  | 🌟 **Level** | 📂 **Solution**                                                                                                                                                                |
| ----------- | ----------------------------------------------- | ------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| Day 110     | Longest Increasing Subsequence                  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-1-longest-increasing-subsequence)                 |
| Day 111     | Longest String Chain                            | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-2-longest-string-chain)                           |
| Day 112     | Longest Common Subsequence                      | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-3-longest-common-subsequence)                     |
| Day 113     | Longest Palindromic Subsequence                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-4-longest-palindromic-subsequence)                |
| Day 114     | Longest Palindrome in a String                  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-5-longest-palindrome-in-a-string)                 |
| Day 115     | Palindrome SubStrings                           | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-6-palindrome-substrings)                          |
| Day 116     | Edit Distance                                   | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-7-edit-distance)                                  |
| Day 117     | Ways to Reach the n'th Stair                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-8-ways-to-reach-the-nth-stair)                    |
| Day 118     | Min Cost Climbing Stairs                        | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-9-min-cost-climbing-stairs)                       |
| Day 119     | 0 - 1 Knapsack Problem                          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-10-0-1-knapsack-problem)                          |
| Day 120     | Coin Change (Count Ways)                        | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-11-coin-change-count-ways)                        |
| Day 121     | Coin Change (Minimum Coins)                     | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-12-coin-change-minimum-coins)                     |
| Day 122     | Minimum Jumps                                   | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-13-minimum-jumps)                                 |
| Day 123     | Subset Sum Problem                              | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-14-subset-sum-problem)                            |
| Day 124     | Partition Equal Subset Sum                      | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-15-partition-equal-subset-sum)                    |
| Day 125     | Stock Buy and Sell – Max K Transactions Allowed | 🔴 Hard      | [Solved Check It Now!](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) |
| Day 126     | Stock Buy and Sell – Max 2 Transactions Allowed | 🔴 Hard      | [Solved Check It Now!](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) |
| Day 127     | Stickler Thief                                  | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-18-stickler-thief)                                |
| Day 128     | Stickler Thief II                               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-19-stickler-thief-ii)                             |
| Day 129     | Total Decoding Messages                         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-20-total-decoding-messages)                       |
| Day 130     | Matrix Chain Multiplication                     | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-21-matrix-chain-multiplication)                   |
| Day 131     | Boolean Parenthesization                        | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-22-boolean-parenthesization)                      |
| Day 132     | Word Break                                      | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-dynamic-programming/day-23-word-break)                                    |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                            | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                        |
| --------------------------------------------------------------------------------------------------------- | ------------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Sum Except First and Last**                                                                             | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/max-length-chain/1)                                                                                                     |
| **Count all possible paths from top left to bottom right**                                                | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/count-all-possible-paths-from-top-left-to-bottom-right3011/1)                                                           |
| <p><strong>Egg Dropping Puzzle</strong><br><strong>OR</strong><br><strong>Stock buy and sell</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/egg-dropping-puzzle-1587115620/1) / [Solve Now](https://www.geeksforgeeks.org/problems/stock-buy-and-sell-1587115621/1) |
| **The Painter's Partition Problem-II**                                                                    | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/the-painters-partition-problem1535/1)                                                                                   |

## 💵 **Greedy Algorithm Arena**

Master the art of **locally optimal choices leading to globally optimal solutions!** ⚡📈

✨ **Days Covered:** **133 to 137**

| 🗓️ **Day** | 🔗 **Problem**                  | 🌟 **Level** | 📂 **Solution**                                                                                                                                    |
| ----------- | ------------------------------- | ------------ | -------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 133     | Minimum Platforms               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-1-minimum-platforms)               |
| Day 134     | Activity Selection              | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-2-activity-selection)              |
| Day 135     | Job Sequencing Problem          | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-3-job-sequencing-problem)          |
| Day 136     | Gas Station                     | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-4-gas-station)                     |
| Day 137     | Maximize partitions in a String | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-greedy/day-5-maximize-partitions-in-a-string) |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                           | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                              |
| ------------------------------------------------------------------------------------------------------------------------ | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Maximum product of two numbers**                                                                                       | 🟤 Basic     | [Solve Now](https://www.geeksforgeeks.org/problems/maximum-product-of-two-numbers2730/1)                                                                         |
| **Largest number with given sum**                                                                                        | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/largest-number-with-given-sum-1587115620/1)                                                                   |
| <p><strong>Jump Game</strong><br><strong>OR</strong><br><strong>Minimum Spanning Tree - Kruskal's Algorithm</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/jump-game/1) / [Solve Now](https://www.geeksforgeeks.org/problems/minimum-spanning-tree-kruskals-algorithm/1) |
| **Water Connection Problem**                                                                                             | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/water-connection-problem5822/1)                                                                               |

## 🌐 **Graph Mastery Zone**

**Unlock the secrets of graph traversal, optimization, and pathfinding!** ⚡🌍

✨ **Days Covered:** **138 to 154**

| 🗓️ **Day** | 🔗 **Problem**                               | 🌟 **Level** | 📂 **Solution**                                                                                                                                                 |
| ----------- | -------------------------------------------- | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 138     | DFS of Graph                                 | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-1-dfs-of-graph)                                  |
| Day 139     | BFS of Graph                                 | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-2-bfs-of-graph)                                  |
| Day 140     | Rotten Oranges                               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-3-rotten-oranges)                                |
| Day 141     | Undirected Graph Cycle                       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-4-undirected-graph-cycle)                        |
| Day 142     | Find the number of islands                   | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-5-find-the-number-of-islands)                    |
| Day 143     | Topological sort                             | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-6-topological-sort)                              |
| Day 144     | Directed Graph Cycle                         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-7-directed-graph-cycle)                          |
| Day 145     | Bridge edge in a graph                       | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-8-bridge-edge-in-a-graph)                        |
| Day 146     | Articulation Point - II                      | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-9-articulation-point-ii)                         |
| Day 147     | Minimum cost to connect all houses in a city | 🟡 Medium    | [Solved Check It Now!](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) |
| Day 148     | Dijkstra Algorithm                           | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-11-dijkstra-algorithm)                           |
| Day 149     | Flood fill Algorithm                         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-12-flood-fill-algorithm)                         |
| Day 150 \*  | Account Merge                                | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-13-account-merge)                                |
| Day 150     | Clone an Undirected Graph                    | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-14-clone-an-undirected-graph)                    |
| Day 151     | Alien Dictionary                             | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-15-alien-dictionary)                             |
| Day 152     | Bellman-Ford                                 | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-16-bellman-ford)                                 |
| Day 153     | Floyd Warshall                               | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-17-floyd-warshall)                               |
| Day 154     | Minimum Weight Cycle                         | 🔴 Hard      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-graph/day-18-minimum-weight-cycle)                         |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                         | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                   |
| ---------------------------------------------------------------------------------------------------------------------- | ------------ | --------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Shortest path from 1 to n**                                                                                          | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/shortest-path-from-1-to-n0156/1)                                                                                   |
| <p><strong>Find the number of islands</strong><br><strong>OR</strong><br><strong>Snake and Ladder Problem</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/find-the-number-of-islands/1) / [Solve Now](https://www.geeksforgeeks.org/problems/snake-and-ladder-problem4816/1) |
| <p><strong>Word Ladder I</strong><br><strong>OR</strong><br><strong>Assignment Problem</strong></p>                    | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/word-ladder/1) / [Solve Now](https://www.geeksforgeeks.org/problems/assignment-problem3016/1)                      |

## 🏁 **Trie Mastery Zone**

**Power up your prefix operations and fast string lookups!** 🔠📝

✨ **Days Covered:** **155 to 156**

| 🗓️ **Day** | 🔗 **Problem**                         | 🌟 **Level** | 📂 **Solution**                                                                                                                                          |
| ----------- | -------------------------------------- | ------------ | -------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 155     | Implement Trie                         | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-1-implement-trie)                         |
| Day 156     | Maximum XOR of two numbers in an array | 🟡 Medium    | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-tries/day-2-maximum-xor-of-two-numbers-in-an-array) |

#### 📌 **Additional Challenges (From my side):**

| 🧩 **Problem**                                                                                                              | 🚀 **Level** | 🔗 **Problem Link**                                                                                                                                                                |
| --------------------------------------------------------------------------------------------------------------------------- | ------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| **Unique rows in boolean matrix**                                                                                           | 🟢 Easy      | [Solve Now](https://www.geeksforgeeks.org/problems/unique-rows-in-boolean-matrix/1)                                                                                                |
| <p><strong>Open the gates</strong><br><strong>OR</strong><br><strong>Most frequent word in an array of strings</strong></p> | 🟡 Medium    | [Solve Now](https://www.geeksforgeeks.org/problems/word-boggle-ii--141631/1) / [Solve Now](https://www.geeksforgeeks.org/problems/most-frequent-word-in-an-array-of-strings3528/1) |
| **Word Break (Trie)**                                                                                                       | 🔴 Hard      | [Solve Now](https://www.geeksforgeeks.org/problems/word-break-trie--141631/1)                                                                                                      |

## 🪢 **Bit Manipulation Mastery Zone**

**Master the art of bits — from tricks to optimization, and efficient number operations!** 💡🧠

✨ **Days Covered:** **157 to 160**

| 🗓️ **Day** | 🔗 **Problem**                             | 🌟 **Level** | 📂 **Solution**                                                                                                                                                         |
| ----------- | ------------------------------------------ | ------------ | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| Day 157     | Find Only Repetitive Element from 1 to n-1 | 🟢 Easy      | [Solved Check It Now!](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) |
| Day 158     | Missing in Array                           | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-2-missing-in-array)                           |
| Day 159     | Unique Number I                            | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-3-unique-number-i)                            |
| Day 160     | Unique Number II                           | 🟢 Easy      | [Solved Check It Now!](https://hunterdii.gitbook.io/gfg-solution/160-days-of-problem-solving/gfg-160-bit-manipulation/day-4-unique-number-ii)                           |

### 👤 Creator

|                                                                               ![Het Patel](https://avatars.githubusercontent.com/u/124852522?v=4\&s=80)                                                                               |
| :-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
|                                                         <p><a href="https://github.com/sponsors/Hunterdii"><strong>Het Patel</strong></a><br><sub>Project Maintainer</sub></p>                                                        |
| [![LinkedIn](https://img.icons8.com/fluency/32/000000/linkedin.png)](https://www.linkedin.com/in/patel-hetkumar-sandipbhai-8b110525a/) [![Gmail](https://img.icons8.com/fluency/32/000000/gmail.png)](mailto:hunterdii9879@gmail.com) |

For any inquiries or feedback, please contact. Happy Contributing ![](https://github.com/user-attachments/assets/00314b63-96bb-4e9a-92f6-4ead67e0fb7d)

### 🎯 **Why Join This Journey?**

* 🏆 **Daily structured practice** for 160 days.
* 🔍 Covers **foundational concepts** and **advanced problem-solving techniques**.
* 🚀 Become a **coding ninja** ready for any technical interview!

🌟 Ready to level up? Let’s code and conquer!\
Feel free to fork, clone, and add your progress.
