{"id":21284255,"url":"https://github.com/hunterdii/geeksforgeeks-potd","last_synced_at":"2025-04-07T06:12:31.049Z","repository":{"id":226733989,"uuid":"769514979","full_name":"Hunterdii/GeeksforGeeks-POTD","owner":"Hunterdii","description":"Welcome to the vibrant world of GeeksforGeeks Daily Problem of the Day solutions! Dive into a treasure trove of daily challenges meticulously crafted to sharpen your problem-solving skills. With diverse topics, detailed explanations, and a supportive community, this repository is your gateway to mastering algorithms, data structures, and more.","archived":false,"fork":false,"pushed_at":"2024-10-29T08:47:39.000Z","size":1948,"stargazers_count":67,"open_issues_count":0,"forks_count":17,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-10-29T09:51:15.951Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","competitive-programming","cpp","daily-coding-problem","dailyprogrammer","dsa","gfg-contest","gfg-cpp","gfg-java","gfg-potd","gfg-python","gfg-questions","gfg-solutions","good-first-issue","potd-solution","problem-of-the-day-solutions","solutions"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"wtfpl","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Hunterdii.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":".github/FUNDING.yml","license":"LICENSE.txt","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":"SECURITY.md","support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null},"funding":{"github":"Hunterdii","patreon":null,"open_collective":null,"ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"lfx_crowdfunding":null,"polar":null,"buy_me_a_coffee":"het81857","thanks_dev":"gh/hunterdii","custom":null}},"created_at":"2024-03-09T09:48:49.000Z","updated_at":"2024-10-29T08:47:43.000Z","dependencies_parsed_at":"2024-03-14T12:40:16.435Z","dependency_job_id":"d4c75ac8-1589-49b5-a34c-e0b6b05544d5","html_url":"https://github.com/Hunterdii/GeeksforGeeks-POTD","commit_stats":null,"previous_names":["hunterdii/geeksforgeeks-potd"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hunterdii%2FGeeksforGeeks-POTD","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hunterdii%2FGeeksforGeeks-POTD/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hunterdii%2FGeeksforGeeks-POTD/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Hunterdii%2FGeeksforGeeks-POTD/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Hunterdii","download_url":"https://codeload.github.com/Hunterdii/GeeksforGeeks-POTD/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247601449,"owners_count":20964864,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","algorithms-and-data-structures","competitive-programming","cpp","daily-coding-problem","dailyprogrammer","dsa","gfg-contest","gfg-cpp","gfg-java","gfg-potd","gfg-python","gfg-questions","gfg-solutions","good-first-issue","potd-solution","problem-of-the-day-solutions","solutions"],"created_at":"2024-11-21T11:15:12.936Z","updated_at":"2025-04-07T06:12:31.038Z","avatar_url":"https://github.com/Hunterdii.png","language":"Java","readme":"\u003ch1\u003e \u003cimg src=\"https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3\" style=\"width:40px; color: #FFD700\" alt=\"Star GIF\"\u003e GeeksforGeeks Problem of the Day Solutions 2024 \u003cimg src=\"https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3\" style=\"width:40px; color: #FFD700\" alt=\"Star GIF\"\u003e\u003c/h1\u003e\n\n\n\u003cdiv align=\"center\"\u003e\n \n## [๐Ÿ“… **April 2025 Problem of the Day Solutions** ๐Ÿ“…](April%202025%20GFG%20SOLUTION)\n\n## ๐Ÿš€ My Open-Source Projects \n\n\u003ctable align=\"center\"\u003e\n \u003ctr\u003e\n \u003ctd align=\"center\"\u003e\n \u003ca href=\"https://github.com/Hunterdii/Smart-AI-Resume-Analyzer\"\u003e\n \u003cimg src=\"https://img.shields.io/badge/Smart%20AI%20Resume%20Analyzer-Enhance%20Your%20Job%20Search-007acc?style=for-the-badge\u0026logo=python\u0026logoColor=white\" /\u003e\n \u003c/a\u003e\n \u003c/td\u003e\n \u003ctd align=\"center\"\u003e\n \u003ca href=\"https://github.com/Hunterdii/Awesome-Java\"\u003e\n \u003cimg src=\"https://img.shields.io/badge/Awesome%20Java-Master%20Java%20Concepts-007396?style=for-the-badge\u0026logo=java\u0026logoColor=white\" /\u003e\n \u003c/a\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n \u003ctr\u003e\n \u003ctd align=\"center\"\u003e\n \u003ca href=\"https://github.com/Hunterdii/tryhackme-free-rooms\"\u003e\n \u003cimg src=\"https://img.shields.io/badge/TryHackMe%20Free%20Rooms-Boost%20Your%20Hacking%20Skills-990000?style=for-the-badge\u0026logo=hackthebox\u0026logoColor=white\" /\u003e\n \u003c/a\u003e\n \u003c/td\u003e\n \u003ctd align=\"center\"\u003e\n \u003ca href=\"https://github.com/Hunterdii/30-Days-Of-Rust\"\u003e\n \u003cimg src=\"https://img.shields.io/badge/Support%20Rust%20Learning-Contribute%20to%20Rust-7a0c2f?style=for-the-badge\u0026logo=rust\u0026logoColor=white\" /\u003e\n \u003c/a\u003e\n \u003c/td\u003e\n \u003c/tr\u003e\n\u003c/table\u003e\n\n\n| **Date** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:---------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| 01 Apr | DFS of Graph ๐ŸŒ๐Ÿ”๐ŸŒฒ | | [Solution](/April%202025%20GFG%20SOLUTION/01(Apr)%20DFS%20of%20Graph.md#code-c) | [Solution](/April%202025%20GFG%20SOLUTION/01(Apr)%20DFS%20of%20Graph.md#code-java) | [Solution](/April%202025%20GFG%20SOLUTION/01(Apr)%20DFS%20of%20Graph.md#code-python) |\n| 02 Apr | BFS of graph ๐ŸŒ๐Ÿšถโ€โ™‚๏ธ๐ŸŒฒ | | [Solution](/April%202025%20GFG%20SOLUTION/02(Apr)%20BFS%20of%20graph.md#code-c) | [Solution](/April%202025%20GFG%20SOLUTION/02(Apr)%20BFS%20of%20graph.md#code-java) | [Solution](/April%202025%20GFG%20SOLUTION/02(Apr)%20BFS%20of%20graph.md#code-python) |\n| 03 Apr | Rotten Oranges ๐ŸŠ๐Ÿฆ โณ | | [Solution](/April%202025%20GFG%20SOLUTION/03(Apr)%20Rotten%20Oranges.md#code-c) | [Solution](/April%202025%20GFG%20SOLUTION/03(Apr)%20Rotten%20Oranges.md#code-java) | [Solution](/April%202025%20GFG%20SOLUTION/03(Apr)%20Rotten%20Oranges.md#code-python) |\n| 04 Apr | Undirected Graph Cycle โ™ป๏ธ๐Ÿ”๐Ÿ’  | | [Solution](/April%202025%20GFG%20SOLUTION/04(Apr)%20Undirected%20Graph%20Cycle.md#code-c) | [Solution](/April%202025%20GFG%20SOLUTION/04(Apr)%20Undirected%20Graph%20Cycle.md#code-java) | [Solution](/April%202025%20GFG%20SOLUTION/04(Apr)%20Undirected%20Graph%20Cycle.md#code-python) |\n| 05 Apr | Find the number of islands ๐Ÿ๏ธ๐Ÿงญโ›ต | | [Solution](/April%202025%20GFG%20SOLUTION/05(Apr)%20Find%20the%20number%20of%20islands.md#code-c) | [Solution](/April%202025%20GFG%20SOLUTION/05(Apr)%20Find%20the%20number%20of%20islands.md#code-java) | [Solution](/April%202025%20GFG%20SOLUTION/05(Apr)%20Find%20the%20number%20of%20islands.md#code-python) |\n| 06 Apr | Topological sort ๐Ÿ“ฆ๐Ÿ•ธ๏ธ๐Ÿ›ฃ๏ธ | | [Solution](/April%202025%20GFG%20SOLUTION/06(Apr)%20Topological%20sort.md#code-c) | [Solution](/April%202025%20GFG%20SOLUTION/06(Apr)%20Topological%20sort.md#code-java) | [Solution](/April%202025%20GFG%20SOLUTION/06(Apr)%20Topological%20sort.md#code-python) |\n\n\n## **[๐ŸŒ GFG 160 Days of Problem Solving (Graph) ๐ŸŒ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph))** \n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | DFS of Graph ๐ŸŒ๐Ÿ”๐ŸŒฒ\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%201%20-%20DFS%20of%20Graph.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%201%20-%20DFS%20of%20Graph.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%201%20-%20DFS%20of%20Graph.md#code-python) |\n| **Day 2** | BFS of graph ๐ŸŒ๐Ÿšถโ€โ™‚๏ธ๐ŸŒฒ\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%202%20-%20BFS%20of%20graph.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%202%20-%20BFS%20of%20graph.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%202%20-%20BFS%20of%20graph.md#code-python) |\n| **Day 3** | Rotten Oranges ๐ŸŠ๐Ÿฆ โณ\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%203%20-%20Rotten%20Oranges.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%203%20-%20Rotten%20Oranges.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%203%20-%20Rotten%20Oranges.md#code-python) |\n| **Day 4** | Undirected Graph Cycle โ™ป๏ธ๐Ÿ”๐Ÿ’ \t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%204%20-%20Undirected%20Graph%20Cycle.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%204%20-%20Undirected%20Graph%20Cycle.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%204%20-%20Undirected%20Graph%20Cycle.md#code-python) |\n| **Day 5** | Find the number of islands ๐Ÿ๏ธ๐Ÿงญโ›ต\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%205%20-%20Find%20the%20number%20of%20islands.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%205%20-%20Find%20the%20number%20of%20islands.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%205%20-%20Find%20the%20number%20of%20islands.md#code-python) |\n| **Day 6** | Topological sort ๐Ÿ“ฆ๐Ÿ•ธ๏ธ๐Ÿ›ฃ๏ธ\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%206%20-%20Topological%20sort.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%206%20-%20Topological%20sort.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Graph)/Day%206%20-%20Topological%20sort.md#code-python) |\n\n---\n\n## ๐Ÿ“‚ Solved Questions and Bonus Problems\n\n\u003cdiv align=\"left\"\u003e\n\u003cdetails\u003e\n\u003csummary\u003e \u003ch2\u003e\u003cb\u003eโœจ Previously Solved Questions \u003c/b\u003e\u003c/h2\u003e (Click to expand)\u003c/summary\u003e\n\n\u003cdiv align=\"center\"\u003e\n\n\n## **[๐Ÿ”ข GFG 160 Days of Problem Solving (Arrays 1โ€“13) ๐Ÿ”ข](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays))** \n\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Second Largest ๐Ÿ”ฅ๐Ÿฅˆ๐Ÿ“ˆ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%201%20-%20Second%20Largest.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%201%20-%20Second%20Largest.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%201%20-%20Second%20Largest.md#code-python) |\n| **Day 2** | Move All Zeroes to End ๐Ÿ”ฅโžก๏ธโšก | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%202%20-%20Move%20All%20Zeroes%20to%20End.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%202%20-%20Move%20All%20Zeroes%20to%20End.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%202%20-%20Move%20All%20Zeroes%20to%20End.md#code-python) |\n| **Day 3** | Reverse an Array ๐ŸŒ€๐Ÿ”๐Ÿ’ป | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%203%20-%20Reverse%20an%20Array.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%203%20-%20Reverse%20an%20Array.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%203%20-%20Reverse%20an%20Array.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%203%20-%20Reverse%20an%20Array.md#code-python) |\n| **Day 4** | Rotate Array ๐Ÿ”„๐Ÿ“š๐Ÿง‘โ€๐Ÿ’ป | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%204%20-%20Rotate%20Array.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%204%20-%20Rotate%20Array.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%204%20-%20Rotate%20Array.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%204%20-%20Rotate%20Array.md#code-python) |\n| **Day 5** | Next Permutation ๐Ÿ”ขโžก๏ธ๐Ÿ”€ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%205%20-%20Next%20Permutation.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%205%20-%20Next%20Permutation.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%205%20-%20Next%20Permutation.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%205%20-%20Next%20Permutation.md#code-python) |\n| **Day 6** | Majority Element II ๐Ÿ—ณ๏ธ๐Ÿ“Šโœ… | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%206%20-%20Majority%20Element%20II.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%206%20-%20Majority%20Element%20II.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%206%20-%20Majority%20Element%20II.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%206%20-%20Majority%20Element%20II.md#code-python) |\n| **Day 7** | Stock Buy and Sell โ€“ Multiple Transaction Allowed ๐Ÿ’น๐Ÿ’ผ๐Ÿ’ธ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%207%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Multiple%20Transaction%20Allowed.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%207%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Multiple%20Transaction%20Allowed.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%207%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Multiple%20Transaction%20Allowed.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%207%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Multiple%20Transaction%20Allowed.md#code-python) |\n| **Day 8** | Stock Buy and Sell โ€“ Max one Transaction Allowed ๐Ÿ“ˆ๐Ÿ’ฐ๐Ÿ›’ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%208%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Max%20one%20Transaction%20Allowed.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%208%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Max%20one%20Transaction%20Allowed.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%208%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Max%20one%20Transaction%20Allowed.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%208%20-%20Stock%20Buy%20and%20Sell%20%E2%80%93%20Max%20one%20Transaction%20Allowed.md#code-python) |\n| **Day 9** | Minimize the Heights I ๐Ÿ“‰๐Ÿฐ๐Ÿ”ง | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%209%20-%20Minimize%20the%20Heights%20II.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%209%20-%20Minimize%20the%20Heights%20II.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%209%20-%20Minimize%20the%20Heights%20II.md#code-python) |\n| **Day 10** | Kadane's Algorithm ๐Ÿ’ก๐Ÿ“Š๐Ÿ”ข | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2010%20-%20Kadane's%20Algorithm.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2010%20-%20Kadane's%20Algorithm.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2010%20-%20Kadane's%20Algorithm.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2010%20-%20Kadane's%20Algorithm.md#code-python) |\n| **Day 11** | Maximum Product Subarray ๐Ÿ”ขโž—๐ŸŽฏ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2011%20-%20Maximum%20Product%20Subarray.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2011%20-%20Maximum%20Product%20Subarray.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2011%20-%20Maximum%20Product%20Subarray.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2011%20-%20Maximum%20Product%20Subarray.md#code-python) |\n| **Day 12** | Max Circular Subarray Sum ๐Ÿ”„๐ŸŽฏ๐ŸŒ€ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2012%20-%20Max%20Circular%20Subarray%20Sum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2012%20-%20Max%20Circular%20Subarray%20Sum.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2012%20-%20Max%20Circular%20Subarray%20Sum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2012%20-%20Max%20Circular%20Subarray%20Sum.md#code-python) |\n| **Day 13** | Smallest Positive Missing Number ๐Ÿ”ขโ“๐Ÿ” | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2013%20-%20Smallest%20Positive%20Missing%20Number.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2013%20-%20Smallest%20Positive%20Missing%20Number.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2013%20-%20Smallest%20Positive%20Missing%20Number.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/Day%2013%20-%20Smallest%20Positive%20Missing%20Number.md#code-python) |\n\n\n## **[๐Ÿ”  GFG 160 Days of Problem Solving (Strings) ๐Ÿ” ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Implement Atoi โš™๏ธ๐Ÿ”‘๐Ÿง‘โ€๐Ÿ”ฌ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%201%20-%20Implement%20Atoi.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%201%20-%20Implement%20Atoi.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%201%20-%20Implement%20Atoi.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%201%20-%20Implement%20Atoi.md#code-python) |\n| **Day 2** | Add Binary Strings ๐Ÿ”ขโž•๐Ÿ’ป | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%202%20-%20Add%20Binary%20Strings.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%202%20-%20Add%20Binary%20Strings.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%202%20-%20Add%20Binary%20Strings.md#code-python) |\n| **Day 3** | Anagram ๐Ÿ” ๐Ÿ’ก๐Ÿค” | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%203%20-%20Anagram.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%203%20-%20Anagram.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%203%20-%20Anagram.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%203%20-%20Anagram.md#code-python) |\n| **Day 4** | Non-Repeating Character๐Ÿ”ข๐Ÿ“๐Ÿ’ญ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%204%20-%20Non%20Repeating%20Character.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%204%20-%20Non%20Repeating%20Character.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%204%20-%20Non%20Repeating%20Character.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%204%20-%20Non%20Repeating%20Character.md#code-python) |\n| **Day 5** | Search Pattern (KMP Algorithm) ๐Ÿ“š๐Ÿ”๐Ÿง  | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%205%20-%20Search%20Pattern%20(KMP-Algorithm).md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%205%20-%20Search%20Pattern%20(KMP-Algorithm).md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%205%20-%20Search%20Pattern%20(KMP-Algorithm).md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%205%20-%20Search%20Pattern%20(KMP-Algorithm).md#code-python) |\n| **Day 6** | Min Chars to Add for Palindrome โœ‚๏ธ๐Ÿ’ฌ๐Ÿ”  | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%206%20-%20Min%20Chars%20to%20Add%20for%20Palindrome.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%206%20-%20Min%20Chars%20to%20Add%20for%20Palindrome.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%206%20-%20Min%20Chars%20to%20Add%20for%20Palindrome.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%206%20-%20Min%20Chars%20to%20Add%20for%20Palindrome.md#code-python) |\n| **Day 7** | Strings Rotations of Each Other ๐Ÿ”„๐Ÿ” ๐ŸŒ€ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%207%20-%20Strings%20Rotations%20of%20Each%20Other.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%207%20-%20Strings%20Rotations%20of%20Each%20Other.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%207%20-%20Strings%20Rotations%20of%20Each%20Other.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/Day%207%20-%20Strings%20Rotations%20of%20Each%20Other.md#code-python) |\n\n\n## **[๐Ÿ”€ GFG 160 Days of Problem Solving (Sorting) ๐Ÿ”€](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Sort 0s, 1s, and 2s ๐Ÿšฆ๐Ÿ”ข๐ŸŽจ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%201%20-%20Sort%200s%2C%201s%20and%202s.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%201%20-%20Sort%200s%2C%201s%20and%202s.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%201%20-%20Sort%200s%2C%201s%20and%202s.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%201%20-%20Sort%200s%2C%201s%20and%202s.md#code-python) |\n| **Day 2** | Find H-Index ๐Ÿ“š๐Ÿ“Š๐Ÿ” | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%202%20-%20Find%20H-Index.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%202%20-%20Find%20H-Index.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%202%20-%20Find%20H-Index.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%202%20-%20Find%20H-Index.md#code-python) |\n| **Day 3** | Count Inversions ๐Ÿ”„๐Ÿ“Š๐Ÿ”ข | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%203%20-%20Count%20Inversions.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%203%20-%20Count%20Inversions.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%203%20-%20Count%20Inversions.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%203%20-%20Count%20Inversions.md#code-python) |\n| **Day 4** | Overlapping Intervals ๐Ÿ“…โฐ๐Ÿ” | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%204%20-%20Overlapping%20Intervals.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%204%20-%20Overlapping%20Intervals.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%204%20-%20Overlapping%20Intervals.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%204%20-%20Overlapping%20Intervals.md#code-python) |\n| **Day 5** | Insert Interval ๐Ÿ“๐Ÿ”ฒโณ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%205%20-%20Insert%20Interval.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%205%20-%20Insert%20Interval.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%205%20-%20Insert%20Interval.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%205%20-%20Insert%20Interval.md#code-python) |\n| **Day 6** | Non-overlapping Intervalsโœ‚๏ธ๐Ÿ”—โœ… | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%206%20-%20Non-overlapping%20Intervals.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%206%20-%20Non-overlapping%20Intervals.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%206%20-%20Non-overlapping%20Intervals.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%206%20-%20Non-overlapping%20Intervals.md#code-python) |\n| **Day 7** | Merge Without Extra Space ๐Ÿ“‚๐Ÿšซ๐Ÿ“ฆ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%207%20-%20Merge%20Without%20Extra%20Space.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%207%20-%20Merge%20Without%20Extra%20Space.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%207%20-%20Merge%20Without%20Extra%20Space.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/Day%207%20-%20Merge%20Without%20Extra%20Space.md#code-python) |\n\n## **[๐Ÿ‘€ GFG 160 Days of Problem Solving (Searching) ๐Ÿ‘€](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Number of occurrence ๐Ÿงฎ๐Ÿ“‚๐Ÿ“ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%201%20-%20Number%20of%20occurrence.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%201%20-%20Number%20of%20occurrence.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%201%20-%20Number%20of%20occurrence.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%201%20-%20Number%20of%20occurrence.md#code-python) |\n| **Day 2** | Sorted and Rotated Minimum ๐Ÿ”ข๐Ÿ”„๐ŸŒ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%202%20-%20Sorted%20and%20Rotated%20Minimum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%202%20-%20Sorted%20and%20Rotated%20Minimum.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%202%20-%20Sorted%20and%20Rotated%20Minimum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%202%20-%20Sorted%20and%20Rotated%20Minimum.md#code-python) |\n| **Day 3** | Search in Rotated Sorted Array ๐Ÿ”๐Ÿ“๐Ÿ”‘ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%203%20-%20Search%20in%20Rotated%20Sorted%20Array.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%203%20-%20Search%20in%20Rotated%20Sorted%20Array.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%203%20-%20Search%20in%20Rotated%20Sorted%20Array.md#code-python) | \n| **Day 4** | Peak element ๐ŸŒ„๐Ÿ”โ›ฐ๏ธ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%204%20-%20Peak%20element.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%204%20-%20Peak%20element.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%204%20-%20Peak%20element.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%204%20-%20Peak%20element.md#code-python) | \n| **Day 5** | K-th element of two Arrays ๐Ÿ”ข๐Ÿ”๐ŸŽฏ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%205%20-%20K-th%20element%20of%20two%20Arrays.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%205%20-%20K-th%20element%20of%20two%20Arrays.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%205%20-%20K-th%20element%20of%20two%20Arrays.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%205%20-%20K-th%20element%20of%20two%20Arrays.md#code-python) |\n| **Day 6** | Aggressive Cows ๐Ÿ„๐Ÿšœ๐Ÿฎ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%206%20-%20Aggressive%20Cows.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%206%20-%20Aggressive%20Cows.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%206%20-%20Aggressive%20Cows.md#code-python) | \n| **Day 7** | Allocate Minimum Pages ๐Ÿ“š๐Ÿ“–๐Ÿ“ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%207%20-%20Allocate%20Minimum%20Pages.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%207%20-%20Allocate%20Minimum%20Pages.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%207%20-%20Allocate%20Minimum%20Pages.md#code-python) | \n| **Day 8** | Kth Missing Positive Number in a Sorted Array ๐Ÿ”ขโžก๏ธโ“ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%208%20-%20Kth%20Missing%20Positive%20Number%20in%20a%20Sorted%20Array.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%208%20-%20Kth%20Missing%20Positive%20Number%20in%20a%20Sorted%20Array.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%208%20-%20Kth%20Missing%20Positive%20Number%20in%20a%20Sorted%20Array.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/Day%208%20-%20Kth%20Missing%20Positive%20Number%20in%20a%20Sorted%20Array.md#code-python) |\n\n## **[๐Ÿ“ GFG 160 Days of Problem Solving (Matrix) ๐Ÿ“](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Spirally traversing a matrix ๐ŸŒ€๐Ÿ”ข๐Ÿ”„ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%201%20-%20Spirally%20traversing%20a%20matrix.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%201%20-%20Spirally%20traversing%20a%20matrix.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%201%20-%20Spirally%20traversing%20a%20matrix.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%201%20-%20Spirally%20traversing%20a%20matrix.md#code-python) |\n| **Day 2** | Rotate by 90 degree ๐Ÿ“โ†ฉ๏ธ๐Ÿ›๏ธ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%202%20-%20Rotate%20by%2090%20degree.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%202%20-%20Rotate%20by%2090%20degree.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%202%20-%20Rotate%20by%2090%20degree.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%202%20-%20Rotate%20by%2090%20degree.md#code-python) |\n| **Day 3** | Search in a Row-Column sorted matrix ๐Ÿ”๐Ÿ”ข๐Ÿ“‰ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%203%20-%20Search%20in%20a%20Row-Column%20sorted%20matrix.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%203%20-%20Search%20in%20a%20Row-Column%20sorted%20matrix.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%203%20-%20Search%20in%20a%20Row-Column%20sorted%20matrix.md#code-python) |\n| **Day 4** | Search in a row-wise sorted matrix ๐Ÿ“‹๐Ÿ”โœ… | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%204%20-%20Search%20in%20a%20row-wise%20sorted%20matrix.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%204%20-%20Search%20in%20a%20row-wise%20sorted%20matrix.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%204%20-%20Search%20in%20a%20row-wise%20sorted%20matrix.md#code-python) |\n| **Day 5** | Search in a sorted Matrix ๐Ÿ”๐Ÿงฎ๐Ÿ“ˆ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%205%20-%20Search%20in%20a%20sorted%20Matrix.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%205%20-%20Search%20in%20a%20sorted%20Matrix.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%205%20-%20Search%20in%20a%20sorted%20Matrix.md#code-python) |\n| **Day 6** | Set Matrix Zeroes ๐ŸŸฆโฌœ๐Ÿ”ข | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%206%20-%20Set%20Matrix%20Zeroes.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%206%20-%20Set%20Matrix%20Zeroes.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Matrix)/Day%206%20-%20Set%20Matrix%20Zeroes.md#code-python) |\n\n## **[๐Ÿ”’ GFG 160 Days of Problem Solving (Hashing) ๐Ÿ”’](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Two Sum - Pair with Given Sum โž•๐Ÿ”ข๐Ÿงฉ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%201%20-%20Two%20Sum%20-%20Pair%20with%20Given%20Sum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%201%20-%20Two%20Sum%20-%20Pair%20with%20Given%20Sum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%201%20-%20Two%20Sum%20-%20Pair%20with%20Given%20Sum.md#code-python) |\n| **Day 2** | Count pairs with given sum ๐Ÿ”ข๐Ÿงฎ๐Ÿ› ๏ธ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%202%20-%20Count%20pairs%20with%20given%20sum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%202%20-%20Count%20pairs%20with%20given%20sum.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%202%20-%20Count%20pairs%20with%20given%20sum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%202%20-%20Count%20pairs%20with%20given%20sum.md#code-python) |\n| **Day 3** | Find All Triplets with Zero Sum ๐Ÿ”ข๐Ÿ”๐ŸŽฏ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%203%20-%20Find%20All%20Triplets%20with%20Zero%20Sum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%203%20-%20Find%20All%20Triplets%20with%20Zero%20Sum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%203%20-%20Find%20All%20Triplets%20with%20Zero%20Sum.md#code-python) |\n| **Day 4** | Intersection of Two arrays with Duplicate Elements ๐Ÿ”„๐Ÿ“ค๐Ÿ“‘ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%204%20-%20Intersection%20of%20Two%20arrays%20with%20Duplicate%20Elements.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%204%20-%20Intersection%20of%20Two%20arrays%20with%20Duplicate%20Elements.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%204%20-%20Intersection%20of%20Two%20arrays%20with%20Duplicate%20Elements.md#code-python) |\n| **Day 5** | Union of Arrays with Duplicates ๐Ÿ“š๐Ÿ“ฆ๐Ÿ“‘ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%205%20-%20Union%20of%20Arrays%20with%20Duplicates.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%205%20-%20Union%20of%20Arrays%20with%20Duplicates.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%205%20-%20Union%20of%20Arrays%20with%20Duplicates.md#code-python) |\n| **Day 6** | Longest Consecutive Subsequence ๐Ÿƒโ€โ™‚โณ๐ŸŽฏ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%206%20-%20Longest%20Consecutive%20Subsequence.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%206%20-%20Longest%20Consecutive%20Subsequence.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%206%20-%20Longest%20Consecutive%20Subsequence.md#code-python) |\n| **Day 7** | Print Anagrams Together ๐Ÿ”ก๐Ÿ‘ฅ๐Ÿค | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%207%20-%20Print%20Anagrams%20Together.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%207%20-%20Print%20Anagrams%20Together.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%207%20-%20Print%20Anagrams%20Together.md#code-python) |\n| **Day 8** | Subarrays with sum K ๐Ÿ”ขโž•๐ŸŽฏ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%208%20-%20Subarrays%20with%20sum%20K.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%208%20-%20Subarrays%20with%20sum%20K.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%208%20-%20Subarrays%20with%20sum%20K.md#code-python) |\n| **Day 9** | Count Subarrays with given XOR ๐Ÿ’ป๐Ÿ”ข๐Ÿงฎ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%209%20-%20Count%20Subarrays%20with%20given%20XOR.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%209%20-%20Count%20Subarrays%20with%20given%20XOR.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Hashing)/Day%209%20-%20Count%20Subarrays%20with%20given%20XOR.md#code-python) |\n\n\n## **[๐Ÿ‘ซ GFG 160 Days of Problem Solving (Two Pointer Technique) ๐Ÿ‘ซ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Count all triplets with given sum in sorted array ๐Ÿ”ข๐Ÿ”ฝ๐Ÿ”\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%201%20-%20Count%20all%20triplets%20with%20given%20sum%20in%20sorted%20array.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%201%20-%20Count%20all%20triplets%20with%20given%20sum%20in%20sorted%20array.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%201%20-%20Count%20all%20triplets%20with%20given%20sum%20in%20sorted%20array.md#code-python) |\n| **Day 2** | Count Pairs whose sum is less than target ๐Ÿ‘ซ๐Ÿ”ข๐Ÿ‘จโ€๐Ÿ’ป\t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%202%20-%20Count%20Pairs%20whose%20sum%20is%20less%20than%20target.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%202%20-%20Count%20Pairs%20whose%20sum%20is%20less%20than%20target.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%202%20-%20Count%20Pairs%20whose%20sum%20is%20less%20than%20target.md#code-python) |\n| **Day 3** | Sum Pair closest to target ๐ŸŽฏ๐Ÿ’ก๐Ÿ”ข\t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%203%20-%20Sum%20Pair%20closest%20to%20target.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%203%20-%20Sum%20Pair%20closest%20to%20target.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%203%20-%20Sum%20Pair%20closest%20to%20target.md#code-python) |\n| **Day 4** | Pair with given sum in a sorted array ๐Ÿ”ข๐Ÿงฎโœ…\t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%204%20-%20Pair%20with%20given%20sum%20in%20a%20sorted%20array.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%204%20-%20Pair%20with%20given%20sum%20in%20a%20sorted%20array.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%204%20-%20Pair%20with%20given%20sum%20in%20a%20sorted%20array.md#code-python) |\n| **Day 5** | Count the number of possible triangles ๐Ÿ“๐Ÿ“๐Ÿงฎ \t\t | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%205%20-%20Count%20the%20number%20of%20possible%20triangles.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%205%20-%20Count%20the%20number%20of%20possible%20triangles.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%205%20-%20Count%20the%20number%20of%20possible%20triangles.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%205%20-%20Count%20the%20number%20of%20possible%20triangles.md#code-python) | \n| **Day 6** | Indexes of Subarray Sum ๐Ÿ“Š๐Ÿ“๐Ÿ” \t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%206%20-%20Indexes%20of%20Subarray%20Sum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%206%20-%20Indexes%20of%20Subarray%20Sum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%206%20-%20Indexes%20of%20Subarray%20Sum.md#code-python) | \n| **Day 7** | Count distinct elements in every window ๐Ÿ”ข๐ŸŽฏ๐Ÿ“ˆ \t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%207%20-%20Count%20distinct%20elements%20in%20every%20window.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%207%20-%20Count%20distinct%20elements%20in%20every%20window.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%207%20-%20Count%20distinct%20elements%20in%20every%20window.md#code-python) | \n| **Day 8** | Longest substring with distinct characters ๐Ÿงต๐Ÿ”ค๐Ÿง  \t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%208%20-%20Longest%20substring%20with%20distinct%20characters.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%208%20-%20Longest%20substring%20with%20distinct%20characters.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%208%20-%20Longest%20substring%20with%20distinct%20characters.md#code-python) | \n| **Day 9** | Trapping Rain Water ๐ŸŒง๏ธ๐Ÿ’ง๐Ÿž๏ธ \t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%209%20-%20Trapping%20Rain%20Water.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%209%20-%20Trapping%20Rain%20Water.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%209%20-%20Trapping%20Rain%20Water.md#code-python) | \n| **Day 10** | Container With Most Water๐Ÿ“ฆ๐ŸŒŠ๐Ÿ“ \t\t | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%2010%20-%20Container%20With%20Most%20Water.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%2010%20-%20Container%20With%20Most%20Water.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Two%20Pointer%20Technique)/Day%2010%20-%20Container%20With%20Most%20Water.md#code-python) | \n\n## **[โž• GFG 160 Days of Problem Solving (Prefix Sum) โž•](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Equilibrium Point โš–๏ธ๐Ÿ”๐Ÿงฎ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%201%20-%20Equilibrium%20Point.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%201%20-%20Equilibrium%20Point.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%201%20-%20Equilibrium%20Point.md#code-python) |\n| **Day 2** | Longest Subarray with Sum K ๐ŸŒŸ๐Ÿ”๐Ÿ› ๏ธ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%202%20-%20Longest%20Subarray%20with%20Sum%20K.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%202%20-%20Longest%20Subarray%20with%20Sum%20K.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%202%20-%20Longest%20Subarray%20with%20Sum%20K.md#code-python) |\n| **Day 3** | Largest subarray of 0's and 1's ๐Ÿ”ขโž•๐Ÿ”ด | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%203%20-%20Largest%20subarray%20of%200's%20and%201's.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%203%20-%20Largest%20subarray%20of%200's%20and%201's.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%203%20-%20Largest%20subarray%20of%200's%20and%201's.md#code-python) |\n| **Day 4** | Product array puzzle๐Ÿงฉ๐Ÿ“ฆโœ– | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%204%20-%20Product%20array%20puzzle.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%204%20-%20Product%20array%20puzzle.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Prefix%20Sum)/Day%204%20-%20Product%20array%20puzzle.md#code-python) |\n\n## **[๐Ÿ”— GFG 160 Days of Problem Solving (Linked List) ๐Ÿ”—](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Reverse a linked list ๐Ÿ”„๐Ÿ”—โ†”๏ธ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%201%20-%20Reverse%20a%20linked%20list.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%201%20-%20Reverse%20a%20linked%20list.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%201%20-%20Reverse%20a%20linked%20list.md#code-python) |\n| **Day 2** | Rotate a Linked List ๐Ÿš€๐Ÿ”„๐Ÿ’ซ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%202%20-%20Rotate%20a%20Linked%20List.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%202%20-%20Rotate%20a%20Linked%20List.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%202%20-%20Rotate%20a%20Linked%20List.md#code-python) |\n| **Day 3** | Merge two sorted linked lists ๐Ÿ”—โž•๐Ÿ“š | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%203%20-%20Merge%20two%20sorted%20linked%20lists.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%203%20-%20Merge%20two%20sorted%20linked%20lists.md#code-c-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%203%20-%20Merge%20two%20sorted%20linked%20lists.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%203%20-%20Merge%20two%20sorted%20linked%20lists.md#code-python) |\n| **Day 4** | Linked List Group Reverse ๐Ÿ”—๐Ÿ”„๐ŸŒ€ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%204%20-%20Linked%20List%20Group%20Reverse.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%204%20-%20Linked%20List%20Group%20Reverse.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%204%20-%20Linked%20List%20Group%20Reverse.md#code-python) |\n| **Day 5** | Add Number Linked Lists โž•๐Ÿ”—๐Ÿš€ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%205%20-%20Add%20Number%20Linked%20Lists.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%205%20-%20Add%20Number%20Linked%20Lists.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%205%20-%20Add%20Number%20Linked%20Lists.md#code-python) |\n| **Day 6** | Clone List with Next and Random ๐Ÿ”—๐Ÿ“‹๐Ÿค” | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%206%20-%20Clone%20List%20with%20Next%20and%20Random.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%206%20-%20Clone%20List%20with%20Next%20and%20Random.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%206%20-%20Clone%20List%20with%20Next%20and%20Random.md#code-python) |\n| **Day 7** | Detect Loop in linked list ๐Ÿ”—๐Ÿ๐Ÿšฆ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%207%20-%20Detect%20Loop%20in%20linked%20list.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%207%20-%20Detect%20Loop%20in%20linked%20list.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%207%20-%20Detect%20Loop%20in%20linked%20list.md#code-python) |\n| **Day 8** | Find the first node of loop in linked list ๐Ÿ”—๐Ÿ”๐Ÿ›‘ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%208%20-%20Find%20the%20first%20node%20of%20loop%20in%20linked%20list.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%208%20-%20Find%20the%20first%20node%20of%20loop%20in%20linked%20list.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%208%20-%20Find%20the%20first%20node%20of%20loop%20in%20linked%20list.md#code-python) |\n| **Day 9** | Remove loop in Linked List ๐Ÿ”—๐Ÿšซ๐Ÿ“ƒ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%209%20-%20Remove%20loop%20in%20Linked%20List.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%209%20-%20Remove%20loop%20in%20Linked%20List.md#code-java-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%209%20-%20Remove%20loop%20in%20Linked%20List.md#code-python-1) |\n| **Day 10** | LRU Cache ๐Ÿ”—๐Ÿ“ค๐Ÿ’พ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%2010%20-%20LRU%20Cache.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%2010%20-%20LRU%20Cache.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Linked%20List)/Day%2010%20-%20LRU%20Cache.md#code-python) |\n\n## **[๐ŸŒ€ GFG 160 Days of Problem Solving (Recursion and Backtracking) ๐ŸŒ€](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Permutations of a String ๐Ÿ” ๐Ÿ”„๐Ÿงฉ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%201%20-%20Permutations%20of%20a%20String.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%201%20-%20Permutations%20of%20a%20String.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%201%20-%20Permutations%20of%20a%20String.md#code-python-1) |\n| **Day 2** | Implement Pow โšก๐Ÿ”ข๐Ÿš€ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%202%20-%20Implement%20Pow.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%202%20-%20Implement%20Pow.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%202%20-%20Implement%20Pow.md#code-python) |\n| **Day 3** | N-Queen Problem ๐Ÿ‘‘โ™Ÿ๏ธ๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%203%20-%20N-Queen%20Problem.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%203%20-%20N-Queen%20Problem.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%203%20-%20N-Queen%20Problem.md#code-python) |\n| **Day 4** | Solve the Sudoku ๐Ÿงฉ๐Ÿ“๐ŸŽฏ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%204%20-%20Solve%20the%20Sudoku.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%204%20-%20Solve%20the%20Sudoku.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%204%20-%20Solve%20the%20Sudoku.md#code-python) |\n| **Day 5** | Word Search๐Ÿ“–๐Ÿ” ๐Ÿ”Ž | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%205%20-%20Word%20Search.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%205%20-%20Word%20Search.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Recursion%20and%20Backtracking)/Day%205%20-%20Word%20Search.md#code-python) |\n\n\n## **[๐ŸŒด GFG 160 Days of Problem Solving (Tree) ๐ŸŒด](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree))**\n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Level order traversal ๐ŸŒณ๐Ÿ“ค๐Ÿ“ˆ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%201%20-%20Level%20order%20traversal.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%201%20-%20Level%20order%20traversal.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%201%20-%20Level%20order%20traversal.md#code-python) |\n| **Day 2** | Height of Binary Tree ๐ŸŒฒ๐Ÿ“๐Ÿชต | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%202%20-%20Height%20of%20Binary%20Tree.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%202%20-%20Height%20of%20Binary%20Tree.md#code-c-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%202%20-%20Height%20of%20Binary%20Tree.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%202%20-%20Height%20of%20Binary%20Tree.md#code-python) |\n| **Day 3** | Diameter of a Binary Tree ๐ŸŒณ๐Ÿ“๐Ÿ”„ | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%203%20-%20Diameter%20of%20a%20Binary%20Tree.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%203%20-%20Diameter%20of%20a%20Binary%20Tree.md#code-c-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%203%20-%20Diameter%20of%20a%20Binary%20Tree.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%203%20-%20Diameter%20of%20a%20Binary%20Tree.md#code-python) |\n| **Day 4** | Mirror Tree ๐ŸŒณ๐Ÿชž๐Ÿ“Œ | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%204%20-%20Mirror%20Tree.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%204%20-%20Mirror%20Tree.md#code-c-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%204%20-%20Mirror%20Tree.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%204%20-%20Mirror%20Tree.md#code-python) |\n| **Day 5** | Construct Tree from Inorder \u0026 Preorder ๐ŸŒณ๐Ÿ”€๐Ÿ“œ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%205%20-%20Construct%20Tree%20from%20Inorder%20%26%20Preorder.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%205%20-%20Construct%20Tree%20from%20Inorder%20%26%20Preorder.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%205%20-%20Construct%20Tree%20from%20Inorder%20%26%20Preorder.md#code-python) |\n| **Day 6** | Inorder Traversal ๐ŸŒณโžก๏ธ๐Ÿ“„ | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%206%20-%20Inorder%20Traversal.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%206%20-%20Inorder%20Traversal.md#code-c-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%206%20-%20Inorder%20Traversal.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%206%20-%20Inorder%20Traversal.md#code-python) |\n| **Day 7** | Tree Boundary Traversal ๐ŸŒณ๐Ÿ“๐ŸŒฟ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%207%20-%20Tree%20Boundary%20Traversal.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%207%20-%20Tree%20Boundary%20Traversal.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%207%20-%20Tree%20Boundary%20Traversal.md#code-python) |\n| **Day 8** | Maximum path sum from any node ๐ŸŒณ๐Ÿ›ค๏ธ๐Ÿ”ผ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%208%20-%20Maximum%20path%20sum%20from%20any%20node.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%208%20-%20Maximum%20path%20sum%20from%20any%20node.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%208%20-%20Maximum%20path%20sum%20from%20any%20node.md#code-python) |\n| **Day 9** | K Sum Paths ๐ŸŒณ๐Ÿ›ค๏ธ๐Ÿ” | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%209%20-%20K%20Sum%20Paths.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%209%20-%20K%20Sum%20Paths.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%209%20-%20K%20Sum%20Paths.md#code-python) |\n| **Day 10** | Check for BST ๐ŸŒณโœ…๐Ÿ” | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2010%20-%20Check%20for%20BST.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2010%20-%20Check%20for%20BST.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2010%20-%20Check%20for%20BST.md#code-python) |\n| **Day 11** | k-th Smallest in BST ๐ŸŒณ๐Ÿ”ข๐Ÿ—‚๏ธ | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2011%20-%20k-th%20Smallest%20in%20BST.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2011%20-%20k-th%20Smallest%20in%20BST.md#code-c-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2011%20-%20k-th%20Smallest%20in%20BST.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2011%20-%20k-th%20Smallest%20in%20BST.md#code-python) |\n| **Day 12** | Pair Sum in BST.md ๐ŸŒณโž•๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2012%20-%20Pair%20Sum%20in%20BST.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2012%20-%20Pair%20Sum%20in%20BST.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2012%20-%20Pair%20Sum%20in%20BST.md#code-python) |\n| **Day 13** | Fixing Two nodes of a BST ๐ŸŒณ๐Ÿ”„๐Ÿ› ๏ธ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2013%20-%20Fixing%20Two%20nodes%20of%20a%20BST.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2013%20-%20Fixing%20Two%20nodes%20of%20a%20BST.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2013%20-%20Fixing%20Two%20nodes%20of%20a%20BST.md#code-python) |\n| **Day 14** | Lowest Common Ancestor in a BST ๐ŸŒณ๐Ÿ”๐Ÿค | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2014%20-%20Lowest%20Common%20Ancestor%20in%20a%20BST.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2014%20-%20Lowest%20Common%20Ancestor%20in%20a%20BST.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2014%20-%20Lowest%20Common%20Ancestor%20in%20a%20BST.md#code-python) |\n| **Day 15** | Serialize and deserialize a binary tree ๐ŸŒฒ๐Ÿ“ค๐Ÿ’พ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2015%20-%20Serialize%20and%20deserialize%20a%20binary%20tree.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2015%20-%20Serialize%20and%20deserialize%20a%20binary%20tree.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Tree)/Day%2015%20-%20Serialize%20and%20deserialize%20a%20binary%20tree.md#code-python) |\n\n## **[๐Ÿ”บ GFG 160 Days of Problem Solving (Heap) ๐Ÿ”บ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap))** \n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | k largest elements ๐Ÿ”ข๐Ÿ“ˆ๐Ÿฅ‡ | | [Solution](Z#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%201%20-%20k%20largest%20elements.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%201%20-%20k%20largest%20elements.md#code-python) |\n| **Day 2** | K Closest Points to Origin ๐Ÿ“๐Ÿ—บ๏ธ๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%202%20-%20K%20Closest%20Points%20to%20Origin.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%202%20-%20K%20Closest%20Points%20to%20Origin.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%202%20-%20K%20Closest%20Points%20to%20Origin.md#code-python) |\n| **Day 3** | Merge K sorted linked lists ๐Ÿ”—๐Ÿ“„โžก๏ธ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%203%20-%20Merge%20K%20sorted%20linked%20lists.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%203%20-%20Merge%20K%20sorted%20linked%20lists.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%203%20-%20Merge%20K%20sorted%20linked%20lists.md#code-python) |\n| **Day 4** | Find median in a stream ๐Ÿ“Šโณ๐Ÿ“ˆ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%204%20-%20Find%20median%20in%20a%20stream.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%204%20-%20Find%20median%20in%20a%20stream.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Heap)/Day%204%20-%20Find%20median%20in%20a%20stream.md#code-python) |\n\n## **[๐Ÿ“š GFG 160 Days of Problem Solving (Stack) ๐Ÿ“š](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack))** \n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Parenthesis Checker ๐Ÿ—๏ธโœ…๐Ÿ—„๏ธ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%201%20-%20Parenthesis%20Checker.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%201%20-%20Parenthesis%20Checker.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%201%20-%20Parenthesis%20Checker.md#code-python) |\n| **Day 2** | Longest valid Parentheses ๐ŸŸฐโžก๏ธ๐ŸŽญ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%202%20-%20Longest%20valid%20Parentheses.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%202%20-%20Longest%20valid%20Parentheses.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%202%20-%20Longest%20valid%20Parentheses.md#code-python) |\n| **Day 3** | Next Greater Element โžก๏ธ๐Ÿ”๐Ÿ” | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%203%20-%20Next%20Greater%20Element.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%203%20-%20Next%20Greater%20Element.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%203%20-%20Next%20Greater%20Element.md#code-python) |\n| **Day 4** | Stock span problem ๐Ÿ’นโณ๐Ÿ“‹ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%204%20-%20Stock%20span%20problem.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%204%20-%20Stock%20span%20problem.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%204%20-%20Stock%20span%20problem.md#code-python) |\n| **Day 5** | Histogram Max Rectangular Area ๐Ÿ“ฆ๐Ÿ”ฒ๐Ÿ“ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%205%20-%20Histogram%20Max%20Rectangular%20Area.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%205%20-%20Histogram%20Max%20Rectangular%20Area.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%205%20-%20Histogram%20Max%20Rectangular%20Area.md#code-python) |\n| **Day 6** | Maximum of minimum for every window size ๐Ÿ“ˆ๐ŸชŸ๐Ÿ“‰ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%206%20-%20Maximum%20of%20minimum%20for%20every%20window%20size.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%206%20-%20Maximum%20of%20minimum%20for%20every%20window%20size.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%206%20-%20Maximum%20of%20minimum%20for%20every%20window%20size.md#code-python) |\n| **Day 7** | Get Min from Stack ๐Ÿ”๐Ÿ“ฆ๐Ÿ”ฝ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%207%20-%20Get%20Min%20from%20Stack.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%207%20-%20Get%20Min%20from%20Stack.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%207%20-%20Get%20Min%20from%20Stack.md#code-python) |\n| **Day 8** | Evaluation of Postfix Expression ๐Ÿ“ฅโœ–๏ธโž— | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%208%20-%20Evaluation%20of%20Postfix%20Expression.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%208%20-%20Evaluation%20of%20Postfix%20Expression.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%208%20-%20Evaluation%20of%20Postfix%20Expression.md#code-python) |\n| **Day 9** | Decode the string ๐Ÿ”๐Ÿ” ๐Ÿ”“ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%209%20-%20Decode%20the%20string.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%209%20-%20Decode%20the%20string.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Stack)/Day%209%20-%20Decode%20the%20string.md#code-python) |\n\n## **[๐Ÿ”™ GFG 160 Days of Problem Solving (Queue and Deque) ๐Ÿ”™](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque))** \n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | K Sized Subarray Maximum ๐Ÿ”ข๐ŸŸฉ๐Ÿ”„ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque)/Day%201%20-%20K%20Sized%20Subarray%20Maximum.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque)/Day%201%20-%20K%20Sized%20Subarray%20Maximum.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque)/Day%201%20-%20K%20Sized%20Subarray%20Maximum.md#code-python) |\n| **Day 2** | Longest Bounded-Difference Subarray ๐Ÿ“๐Ÿ”ข๐ŸŸฐ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque)/Day%202%20-%20Longest%20Bounded-Difference%20Subarray.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque)/Day%202%20-%20Longest%20Bounded-Difference%20Subarray.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Queue%20and%20Deque)/Day%202%20-%20Longest%20Bounded-Difference%20Subarray.md#code-python) |\n\n## **[๐Ÿงต GFG 160 Days of Problem Solving (Dynamic Programming) ๐Ÿงต](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming))** \n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Longest Increasing Subsequence ๐Ÿ”๐Ÿ“ˆ๐Ÿงฉ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%201%20-%20Longest%20Increasing%20Subsequence.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%201%20-%20Longest%20Increasing%20Subsequence.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%201%20-%20Longest%20Increasing%20Subsequence.md#code-python) |\n| **Day 2** | Longest String Chain ๐Ÿ”—โ›“๏ธ๐Ÿ”  | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%202%20-%20Longest%20String%20Chain.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%202%20-%20Longest%20String%20Chain.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%202%20-%20Longest%20String%20Chain.md#code-python) |\n| **Day 3** | Longest Common Subsequence ๐Ÿ“โœ‚๏ธ๐Ÿ“š | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%203%20-%20Longest%20Common%20Subsequence.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%203%20-%20Longest%20Common%20Subsequence.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%203%20-%20Longest%20Common%20Subsequence.md#code-python) |\n| **Day 4** | Longest Palindromic Subsequence ๐Ÿ”๐Ÿ’ซ๐Ÿ”ฌ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%204%20-%20Longest%20Palindromic%20Subsequence.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%204%20-%20Longest%20Palindromic%20Subsequence.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%204%20-%20Longest%20Palindromic%20Subsequence.md#code-python) |\n| **Day 5** | Longest Palindrome in a String ๐Ÿ” ๐Ÿ“๐Ÿ”„ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%205%20-%20Longest%20Palindrome%20in%20a%20String.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%205%20-%20Longest%20Palindrome%20in%20a%20String.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%205%20-%20Longest%20Palindrome%20in%20a%20String.md#code-python) |\n| **Day 6** | Palindrome SubStrings ๐Ÿ“œ๐Ÿ”„๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%206%20-%20Palindrome%20SubStrings.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%206%20-%20Palindrome%20SubStrings.md#code-java-1) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%206%20-%20Palindrome%20SubStrings.md#code-python-1) |\n| **Day 7** | Edit Distance โœ‚๏ธ๐Ÿงฎ๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%207%20-%20Edit%20Distance.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%207%20-%20Edit%20Distance.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%207%20-%20Edit%20Distance.md#code-python) |\n| **Day 8** | Ways to Reach the n'th Stair โžก๏ธ๐Ÿƒโ€โ™‚๏ธ๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%208%20-%20Ways%20to%20Reach%20the%20n'th%20Stair.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%208%20-%20Ways%20to%20Reach%20the%20n'th%20Stair.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%208%20-%20Ways%20to%20Reach%20the%20n'th%20Stair.md#code-python) |\n| **Day 9** | Min Cost Climbing Stairs ๐Ÿƒโ€โ™‚๏ธ๐Ÿ’ฐ๐Ÿ” | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%209%20-%20Min%20Cost%20Climbing%20Stairs.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%209%20-%20Min%20Cost%20Climbing%20Stairs.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%209%20-%20Min%20Cost%20Climbing%20Stairs.md#code-python) |\n| **Day 10** | 0 - 1 Knapsack Problem ๐ŸŽ’๐Ÿ’ฐ๐Ÿ”ข | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2010%20-%200%20-%201%20Knapsack%20Problem.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2010%20-%200%20-%201%20Knapsack%20Problem.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2010%20-%200%20-%201%20Knapsack%20Problem.md#code-python) |\n| **Day 11** | Coin Change (Count Ways) ๐Ÿช™๐Ÿ”ข๐Ÿ’ฐ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2011%20-%20Coin%20Change%20(Count%20Ways).md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2011%20-%20Coin%20Change%20(Count%20Ways).md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2011%20-%20Coin%20Change%20(Count%20Ways).md#code-python) |\n| **Day 12** | Coin Change (Minimum Coins) ๐Ÿช™๐Ÿ“‰๐Ÿ’ฐ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2012%20-%20Coin%20Change%20(Minimum%20Coins).md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2012%20-%20Coin%20Change%20(Minimum%20Coins).md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2012%20-%20Coin%20Change%20(Minimum%20Coins).md#code-python) |\n| **Day 13** | Minimum Jumps ๐Ÿƒโ€โ™‚๏ธ๐Ÿ’จโžก๏ธ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2013%20-%20Minimum%20Jumps.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2013%20-%20Minimum%20Jumps.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2013%20-%20Minimum%20Jumps.md#code-python) |\n| **Day 14** | Subset Sum Problem ๐ŸŽฏ๐Ÿ”ขโœ… | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2014%20-%20Subset%20Sum%20Problem.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2014%20-%20Subset%20Sum%20Problem.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2014%20-%20Subset%20Sum%20Problem.md#code-python) |\n| **Day 15** | Partition Equal Subset Sum โž—๐Ÿ”ขโŒ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2015%20-%20Partition%20Equal%20Subset%20Sum.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2015%20-%20Partition%20Equal%20Subset%20Sum.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2015%20-%20Partition%20Equal%20Subset%20Sum.md#code-python) |\n| **Day 16** | Stock Buy and Sell โ€“ Max K Transactions Allowed ๐Ÿ’ฐ๐Ÿ’ต๐Ÿ›’ | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2016%20-%20Stock%20Buy%20and%20Sell%20โ€“%20Max%20K%20Transactions%20Allowed.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2016%20-%20Stock%20Buy%20and%20Sell%20โ€“%20Max%20K%20Transactions%20Allowed.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2016%20-%20Stock%20Buy%20and%20Sell%20โ€“%20Max%20K%20Transactions%20Allowed.md#code-python) |\n| **Day 17** | Stock Buy and Sell โ€“ Max 2 Transactions Allowed ๐Ÿ’ฐ๐Ÿ’น๐Ÿ’ต | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2017%20-%20Stock%20Buy%20and%20Sell%20โ€“%20Max%202%20Transactions%20Allowed.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2017%20-%20Stock%20Buy%20and%20Sell%20โ€“%20Max%202%20Transactions%20Allowed.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2017%20-%20Stock%20Buy%20and%20Sell%20โ€“%20Max%202%20Transactions%20Allowed.md#code-python) |\n| **Day 18** | Stickler Thief ๐Ÿฆนโ€โ™‚๏ธ๐Ÿ ๐Ÿš”\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2018%20-%20Stickler%20Thief.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2018%20-%20Stickler%20Thief.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2018%20-%20Stickler%20Thief.md#code-python) |\n| **Day 19** | Stickler Thief II ๐Ÿฆนโ€โ™‚๏ธ๐Ÿ ๐Ÿ’ฐ\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2019%20-%20Stickler%20Thief%20II.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2019%20-%20Stickler%20Thief%20II.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2019%20-%20Stickler%20Thief%20II.md#code-python) |\n| **Day 20** | Total Decoding Messages ๐Ÿ”ขโžก๏ธ๐Ÿ”ก\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2020%20-%20Total%20Decoding%20Messages.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2020%20-%20Total%20Decoding%20Messages.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2020%20-%20Total%20Decoding%20Messages.md#code-python) |\n| **Day 21** | Matrix Chain Multiplication โž—๐Ÿ“ˆ๐Ÿ”ข\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2021%20-%20Matrix%20Chain%20Multiplication.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2021%20-%20Matrix%20Chain%20Multiplication.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2021%20-%20Matrix%20Chain%20Multiplication.md#code-python) |\n| **Day 22** | Boolean Parenthesization ๐Ÿงฎโœ…โŒ\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2022%20-%20Boolean%20Parenthesization.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2022%20-%20Boolean%20Parenthesization.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2022%20-%20Boolean%20Parenthesization.md#code-python) |\n| **Day 23** | Word Break ๐Ÿ“–โœ‚๏ธ๐Ÿš€\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2023%20-%20Word%20Break.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2023%20-%20Word%20Break.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Dynamic%20Programming)/Day%2023%20-%20Word%20Break.md#code-python) |\n\n## **[๐Ÿ’ต GFG 160 Days of Problem Solving (Greedy) ๐Ÿ’ต](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy))** \n\n| **Day** | **Problem Name** | **C** | **C++** | **Java** | **Python** |\n|:--------:|:-----------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| **Day 1** | Minimum Platforms ๐Ÿš‰๐Ÿš†โณ\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%201%20-%20Minimum%20Platforms.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%201%20-%20Minimum%20Platforms.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%201%20-%20Minimum%20Platforms.md#code-python) |\n| **Day 2** | Activity Selection ๐Ÿ“…โณ๐Ÿ†\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%202%20-%20Activity%20Selection.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%202%20-%20Activity%20Selection.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%202%20-%20Activity%20Selection.md#code-python) |\n| **Day 3** | Job Sequencing Problem ๐Ÿ“…๐Ÿ’ผ๐Ÿ’ฐ\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%203%20-%20Job%20Sequencing%20Problem.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%203%20-%20Job%20Sequencing%20Problem.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%203%20-%20Job%20Sequencing%20Problem.md#code-python) |\n| **Day 4** | Gas Station โ›ฝ๐Ÿš—๐Ÿ’จ\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%204%20-%20Gas%20Station.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%204%20-%20Gas%20Station.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%204%20-%20Gas%20Station.md#code-python) |\n| **Day 5** | Maximize partitions in a String ๐Ÿ” ๐Ÿงฉ๐Ÿ“\t\t\t | | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%205%20-%20Maximize%20partitions%20in%20a%20String.md#code-c) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%205%20-%20Maximize%20partitions%20in%20a%20String.md#code-java) | [Solution](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Greedy)/Day%205%20-%20Maximize%20partitions%20in%20a%20String.md#code-python) |\n\n\u003c/details\u003e\n\u003c/div\u003e\n\u003c/div\u003e\n\u003cdiv align=\"left\"\u003e\n\u003cdetails\u003e\n\u003csummary\u003e \u003ch3\u003e\u003cb\u003e๐ŸŽ Previously Solved Bonus Problem \u003c/b\u003e\u003c/h3\u003e (Click to expand)\u003c/summary\u003e\n\n\u003cdiv align=\"center\"\u003e\n\n\n## **[๐ŸŽ‰ Bonus Problems (Arrays)๐ŸŽ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/๐ŸŽ‰BONUS%20PROBLEMS%20๐ŸŽ)**\n\n| **Bonus Problem No.** | **Problem Name** | **C** ๐Ÿ–ฅ๏ธ | **C++** ๐Ÿš€ | **Java** โ˜• | **Python** ๐Ÿ |\n|:--------:|:---------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| _NUM 1_ | **Split Array in Three Equal Sum Subarrays** ๐Ÿ’ฅ๐Ÿ“Š๐Ÿ”ข | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Split%20array%20in%20three%20equal%20sum%20subarrays.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Split%20array%20in%20three%20equal%20sum%20subarrays.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Split%20array%20in%20three%20equal%20sum%20subarrays.md#code-python) |\n| _NUM 2_ | **Repetitive Addition of Digits** ๐Ÿ”ข๐Ÿ”„๐Ÿ’ฅ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Repetitive%20Addition%20Of%20Digits.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Repetitive%20Addition%20Of%20Digits.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Repetitive%20Addition%20Of%20Digits.md#code-python) |\n| _NUM 3_ | **Maximize Number of 1's** ๐Ÿ”ข๐Ÿ”ฅ๐Ÿ’ก | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Maximize%20Number%20of%201's.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Maximize%20Number%20of%201's.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Maximize%20Number%20of%201's.md#code-python) |\n| _NUM 4_ | **Last Moment Before All Ants Fall Out of a Plank** ๐Ÿœ๐ŸŒโณ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Arrays)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank.md#code-python) |\n\n## **[๐ŸŽ‰ Bonus Problems (Strings)๐ŸŽ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/๐ŸŽ‰BONUS%20PROBLEMS%20๐ŸŽ)**\n\n| **Bonus Problem No.** | **Problem Name** | **C** ๐Ÿ–ฅ๏ธ | **C++** ๐Ÿš€ | **Java** โ˜• | **Python** ๐Ÿ |\n|:--------:|:---------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| _NUM 1_ | **Fizz Buzz** ๐Ÿงฎ๐ŸŽ‰๐Ÿ”ข | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Fizz%20Buzz.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Fizz%20Buzz.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Fizz%20Buzz.md#code-python) |\n| _NUM 2_ | **CamelCase Pattern Matching** ๐Ÿซ๐Ÿ” ๐Ÿ’ป | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20CamelCase%20Pattern%20Matching.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20CamelCase%20Pattern%20Matching.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20CamelCase%20Pattern%20Matching.md#code-python) |\n| _NUM 3_ | **Palindrome Sentence** ๐Ÿ”„๐Ÿ—ฃ๏ธ๐Ÿ“œ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Palindrome%20Sentence.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Palindrome%20Sentence.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Palindrome%20Sentence.md#code-python) |\n| _NUM 4_ | **Minimum repeat to make substring** ๐Ÿ”๐Ÿ“๐Ÿ”ค | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Minimum%20repeat%20to%20make%20substring.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Minimum%20repeat%20to%20make%20substring.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Minimum%20repeat%20to%20make%20substring.md#code-python) |\n| _NUM 5_ | **Longest Prefix Suffix** ๐Ÿ”โœ‚๏ธ๐Ÿ”— | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/5.%20Longest%20Prefix%20Suffix.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/5.%20Longest%20Prefix%20Suffix.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/5.%20Longest%20Prefix%20Suffix.md#code-python) |\n| _NUM 6_ | **Integer to Words** 1๏ธโƒฃ๐Ÿ” ๐Ÿ“š | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/6.%20Integer%20to%20Words.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/6.%20Integer%20to%20Words.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Strings)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/6.%20Integer%20to%20Words.md#code-python) |\n\n## **[๐ŸŽ‰ Bonus Problems (Sorting)๐ŸŽ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/๐ŸŽ‰BONUS%20PROBLEMS%20๐ŸŽ)**\n\n| **Bonus Problem No.** | **Problem Name** | **C** ๐Ÿ–ฅ๏ธ | **C++** ๐Ÿš€ | **Java** โ˜• | **Python** ๐Ÿ |\n|:--------:|:---------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| _NUM 1_ | **Minimum sum** ๐Ÿ’กโž•๐Ÿ’ฐ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Minimum%20sum.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Minimum%20sum.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Minimum%20sum.md#code-python) |\n| _NUM 2_ | **Meeting Rooms** ๐Ÿ“…๐Ÿขโฐ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Meeting%20Rooms.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Meeting%20Rooms.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Meeting%20Rooms.md#code-python) |\n| _NUM 3_ | **Form the Largest Number** ๐Ÿ”ข๐ŸŽฏ๐Ÿ’ฏ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Form%20the%20Largest%20Number.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Form%20the%20Largest%20Number.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Form%20the%20Largest%20Number.md#code-python) |\n| _NUM 4_ | **Make array elements unique** ๐Ÿงฎ๐Ÿ”ข๐Ÿ”€ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Make%20array%20elements%20unique.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Make%20array%20elements%20unique.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Sorting)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Make%20array%20elements%20unique.md#code-python) |\n\n\n## **[๐ŸŽ‰ Bonus Problems (Searching)๐ŸŽ](/160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/๐ŸŽ‰BONUS%20PROBLEMS%20๐ŸŽ)**\n\n| **Bonus Problem No.** | **Problem Name** | **C** ๐Ÿ–ฅ๏ธ | **C++** ๐Ÿš€ | **Java** โ˜• | **Python** ๐Ÿ |\n|:--------:|:---------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|:---------------------------------------------------------------------------------------------------------------------------------:|:----------------------------------------------------------------------------------------------------------------------------------:|\n| _NUM 1_ | **Implement Lower Bound** ๐Ÿ“๐Ÿ”๐Ÿ“Š | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Implement%20Lower%20Bound.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Implement%20Lower%20Bound.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/1.%20Implement%20Lower%20Bound.md#code-python) |\n| _NUM 2_ | **Bitonic Point** โ›ฐ๏ธ๐Ÿ”€๐Ÿ“ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Bitonic%20Point.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Bitonic%20Point.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/2.%20Bitonic%20Point.md#code-python) |\n| _NUM 3_ | **Median of 2 Sorted Arrays of Different Sizes** ๐Ÿ“Š๐Ÿ”ขโš–๏ธ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Median%20of%202%20Sorted%20Arrays%20of%20Different%20Sizes.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Median%20of%202%20Sorted%20Arrays%20of%20Different%20Sizes.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/3.%20Median%20of%202%20Sorted%20Arrays%20of%20Different%20Sizes.md#code-python) |\n| _NUM 4_ | **Square Root** ๐Ÿ”ขโž—๐Ÿ”ฒ | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Square%20Root.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Square%20Root.md#code-c-1) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Square%20Root.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/4.%20Square%20Root.md#code-python) |\n| _NUM 5_ | **Koko Eating Bananas** ๐ŸŒ๐Ÿ’โณ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/5.%20Koko%20Eating%20Bananas.md#code-c) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/5.%20Koko%20Eating%20Bananas.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/5.%20Koko%20Eating%20Bananas.md#code-python) |\n| _NUM 6_ | **Minimum Days to Make M Bouquets** ๐ŸŒธโณ๐Ÿ’ | | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/6.%20Minimum%20days%20to%20make%20M%20bouquets.md#code-cpp) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/6.%20Minimum%20days%20to%20make%20M%20bouquets.md#code-java) | [Solution](./160%20Days%20Of%20Problem%20Solving/GFG%20-%20160%20(Searching)/%F0%9F%8E%89BONUS%20PROBLEMS%20%F0%9F%8E%81/6.%20Minimum%20days%20to%20make%20M%20bouquets.md#code-python) |\n\n\u003c/details\u003e\n\u003c/div\u003e\n\u003c/div\u003e\n\n\u003c/div\u003e\n\n---\n\n\u003cdiv align=\"center\"\u003e\n \u003ch3\u003e๐Ÿš€ Welcome to Our Coding Community! ๐Ÿš€\u003c/h3\u003e\n \u003cp\u003e๐ŸŒฑ Dive into GeeksforGeeks Problem of the Day Solutions and level up your coding skills!\u003c/p\u003e\n \u003cimg src=\"https://profile-counter.glitch.me/Hunterdii/count.svg\" alt=\"Visitor Count\" /\u003e\n\u003c/div\u003e\n\n\u003c!--Line--\u003e\n\u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\" style=\"text-decoration: none;\"\u003e\n\u003cimg src=\"https://i.imgur.com/dBaSKWF.gif\" height=\"70\" width=\"100%\"\u003e\n\u003c/a\u003e\n\n\u003cp align=\"center\"\u003e\n \u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\" style=\"text-decoration: none;\"\u003e\n \u003cimg src=\"https://socialify.git.ci/Hunterdii/GeeksforGeeks-POTD/image?description=1\u0026descriptionEditable=Get%20daily%20solutions%20for%20GeeksforGeeks%20Problem%20of%20the%20Day%202024%20and%20become%20a%20coding%20pro!\u0026font=Rokkitt\u0026owner=1\u0026pattern=Brick%20Wall\u0026theme=Dark\" alt=\"GeeksforGeeks POTD Banner\" width=\"850\"/\u003e\n\u003c/p\u003e\n\n\n\n\u003cdiv align=\"center\"\u003e\n \u003ch2\u003e๐Ÿ‘ฅ Join the Conversation\u003c/h2\u003e\n \u003cp\u003eIf you have any questions, insights, or solutions to share, don't miss out on our active \u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD/discussions\"\u003eDiscussion Hub\u003c/a\u003e! ๐ŸŒŸ Your participation is what makes this community great.\u003c/p\u003e\n \u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD/discussions/15\" style=\"text-decoration: none;\"\u003e\n \u003cimg src=\"https://img.shields.io/badge/Join%20Discussion%20Hub%20-%20Vote%20%26%20Suggest-blue?style=for-the-badge\u0026logo=github\u0026logoColor=white\" alt=\"Discussion Badge\"\u003e\n \u003c/a\u003e\n\u003c/div\u003e\n\n\n\n\n## **๐ŸŒŸ Smart AI Resume Analyzer - Final Year Project ๐ŸŒŸ**\n\nHello, GeeksforGeeks GitHub community! ๐Ÿš€\n\nThis 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. \n\nBut 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.\n\n๐Ÿ”ง **How can you contribute?**\n- โญ **Star the repository** to show your support.\n- ๐Ÿ“˜ **Contribute to the project** by adding new features(the functionality with your ideas) or fixing issues.\n- ๐ŸŒ **Spread the word** through social media and developer communities.\n- ๐Ÿ”— **Share feedback** to make the tool more effective for users!\n- ๐Ÿ› **Report bugs** or suggest improvements to better the project.\n\nTogether, letโ€™s create a seamless AI-powered solution for handling resumes. ๐Ÿš€\n\n_Support Smart AI Resume Analyzer \u0026 Shape the Future of Technology! ๐Ÿค–_\n\n\n\u003cdiv align=\"center\"\u003e\n \n[![Smart AI Resume Analyzer](https://img.shields.io/badge/Smart%20AI%20Resume%20Analyzer-Contribute%20Now-007bff?style=for-the-badge\u0026logo=python\u0026logoColor=white)](https://github.com/Hunterdii/Smart-AI-Resume-Analyzer)\n\n\u003c/div\u003e\n\n## **๐Ÿš€ Join the Rust Revolution! ๐Ÿš€** \n\n\n\nHello, GeeksforGeeks community! ๐ŸŒŸ\n\n\nLooking 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.\n\nBut 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.\n\n๐Ÿ”ง **What can you do to help?**\n- โญ **Star the repository** to show your interest.\n- ๐Ÿ“š **Contribute to the learning resources** or improve existing content.\n- ๐ŸŒ **Share the project** with fellow developers to expand the learning network.\n- ๐Ÿ”— **Spread the word** to get more developers involved!\n\nTogether, we can empower the next generation of developers and make **Rust** a language of choice for high-performance applications. ๐Ÿš€\n\n_Support Rust Learning \u0026 Contribute to the Future of Programming!_\n\n\n\u003cdiv align=\"center\"\u003e\n \n[![Rust Learning](https://img.shields.io/badge/Rust%20Learning%20Support-Empower%20Future%20Programmers-orange?style=for-the-badge\u0026logo=rust\u0026logoColor=white)](https://github.com/Hunterdii/30-Days-Of-Rust)\n\n\u003c/div\u003e\n\n\n## **๐Ÿ”ฅ Master Java with Awesome-Java! ๐Ÿ”ฅ**\n\nHey Developers! ๐Ÿš€ \n\nAre 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. \n\n### **Why should you explore this repo?** \nโœ… Well-structured Java concepts ๐Ÿ” \nโœ… Covers **Core Java, OOP, DSA, Java 8+, Concurrency, and more** ๐Ÿ—๏ธ \nโœ… Includes **real-world projects \u0026 solutions** ๐Ÿ’ป \nโœ… Beginner-friendly explanations ๐Ÿ“˜ \nโœ… Open-source contributions welcome! ๐ŸŒ \n\n๐Ÿ”ง **How can you contribute?** \n- โญ **Star the repository** to show your support! \n- ๐Ÿ› ๏ธ **Improve existing code** or add new concepts. \n- ๐Ÿ’ฌ **Suggest topics** that should be covered. \n- ๐Ÿค **Join discussions** and help others learn Java! \n\nLetโ€™s build an **Awesome Java** resource together! ๐Ÿš€ \n\n\u003cdiv align=\"center\"\u003e\n \n[![Awesome Java](https://img.shields.io/badge/Awesome%20Java-Contribute%20Now-007396?style=for-the-badge\u0026logo=java\u0026logoColor=white)](https://github.com/Hunterdii/Awesome-Java)\n\n\u003c/div\u003e\n\n\n\n## **๐Ÿ’€ TryHackMe Free Rooms - Learn Ethical Hacking! ๐Ÿ’€**\n\nCybersecurity enthusiasts, this oneโ€™s for you! ๐Ÿš€ \n\n**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**. \n\n### **Whatโ€™s inside?** \n๐Ÿ”น List of **completely free** hacking labs ๐Ÿ†“ \n๐Ÿ”น Topics covering **Web Exploitation, Networking, Forensics, Reverse Engineering, and more!** ๐Ÿ’ป \n๐Ÿ”น Beginner-friendly **guided walkthroughs** ๐Ÿ•ต๏ธโ€โ™‚๏ธ \n๐Ÿ”น Perfect for **CTF practice \u0026 OSCP prep** ๐ŸŽฏ \n๐Ÿ”น Community contributions encouraged! ๐Ÿค \n\n๐Ÿ”ง **How can you contribute?** \n- โญ **Star the repository** to support ethical hacking education! \n- ๐Ÿ“ข **Suggest or add new rooms** from TryHackMe. \n- ๐Ÿ“ **Write walkthroughs** for tricky challenges. \n- ๐Ÿ”— **Share this with fellow hackers** to grow the community! \n\nJoin now \u0026 start hacking! ๐Ÿš€ \n\n\u003cdiv align=\"center\"\u003e\n \n[![TryHackMe Free Rooms](https://img.shields.io/badge/TryHackMe%20Free%20Rooms-Contribute%20Now-990000?style=for-the-badge\u0026logo=hackthebox\u0026logoColor=white)](https://github.com/Hunterdii/tryhackme-free-rooms)\n\n\u003c/div\u003e\n\n\n\n\n## ๐Ÿ’ก **Why Follow This Repository?**\n\n- **๐Ÿ‹๏ธโ€โ™‚๏ธ Daily Practice:** Tackle a new problem every day and sharpen your problem-solving skills.\n- **๐Ÿง  Diverse Topics:** Master algorithms, data structures, dynamic programming, and more.\n- **๐Ÿค Community Collaboration:** Discuss and improve solutions together for mutual growth.\n- **๐Ÿ“ˆ Solution Explanations:** Each problem comes with clear, well-documented solutions to aid your learning.\n\n\n## ๐Ÿ” **How To Use This Repository**\n\n1. **๐Ÿ“‚ Navigate Effortlessly:** Problems are sorted by date for easy access.\n2. **๐Ÿ“ Study Explanations:** Grasp the core logic behind each solution.\n3. **๐ŸŽญ Experiment \u0026 Practice:** Modify solutions or try implementing them in other languages.\n4. **๐Ÿ’ฌ Engage \u0026 Collaborate:** Connect with the community to gain deeper insights.\n\n\n\n## ๐Ÿš€ **Languages Used**\n\n- [![C++](https://img.shields.io/badge/c++-%2300599C.svg?style=for-the-badge\u0026logo=c%2B%2B\u0026logoColor=white)](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3Acpp+path%3ANovember+2024+GFG+SOLUTION\u0026type=code)\n- [![Java](https://img.shields.io/badge/java-%23ED8B00.svg?style=for-the-badge\u0026logo=java\u0026logoColor=white)](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3AJava+path%3ANovember+2024+GFG+SOLUTION\u0026type=code)\n- [![Python](https://img.shields.io/badge/python-3670A0?style=for-the-badge\u0026logo=python\u0026logoColor=ffdd54)](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3APython+path%3ANovember+2024+GFG+SOLUTION\u0026type=code)\n- [![C](https://img.shields.io/badge/c-%2300599C.svg?style=for-the-badge\u0026logo=c\u0026logoColor=white)](https://github.com/search?q=repo%3AHunterdii%2FGeeksforGeeks-POTD++language%3Ac+path%3ANovember+2024+GFG+SOLUTION\u0026type=code)\n\n\n\n## ๐Ÿค **Contribution Guidelines**\n\nWe โค๏ธ contributions! Here's how you can contribute:\n\n1. **Fork** this repository.\n2. **Create** a new branch for your feature or bug fix.\n3. **Commit** your changes with a clear message.\n4. **Submit** a pull request and weโ€™ll review it together!\n\n\u003e **Note:** Follow our coding style and include meaningful comments.\n\n\u003ch2\u003e\n \u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\"\u003e\n \u003cimg src=\"https://github.com/user-attachments/assets/5b3cb883-6652-4525-a352-b4b9a3501e07\" width = 35px height = 35px\u003e\u003c/a\u003e \u003cb\u003e\u003c/b\u003e Your Star Counts! \u003c/b\u003e\u003c/h2\u003e\n\n\u003cdiv align=\"center\"\u003e\n \n ๐ŸŒŸ *If this repository helps you, don't forget to* **star it**! ๐ŸŒŸ\n\n [![Open in GitHub Codespaces](https://github.com/codespaces/badge.svg)](https://github.com/codespaces/new?hide_repo_select=true\u0026ref=main\u0026repo=769514979\u0026machine=basicLinux32gb\u0026location=?)\n\n [![Open in Codeanywhere](https://codeanywhere.com/img/open-in-codeanywhere-btn.svg)](https://app.codeanywhere.com/#https://github.com/Hunterdii/GeeksforGeeks-POTD)\n\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n \u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\"\u003e\n \u003cimg src=\"https://img.shields.io/github/stars/Hunterdii/GeeksforGeeks-POTD?style=for-the-badge\u0026color=brightgreen\" alt=\"GitHub Stars\"\u003e\n \u003c/a\u003e\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n \u003ca href=\"https://star-history.com/#Hunterdii/GeeksforGeeks-POTD\u0026Date\"\u003e\n \u003cpicture\u003e\n \u003csource media=\"(prefers-color-scheme: dark)\" srcset=\"https://api.star-history.com/svg?repos=Hunterdii/GeeksforGeeks-POTD\u0026type=Date\u0026theme=dark\" /\u003e\n \u003csource media=\"(prefers-color-scheme: light)\" srcset=\"https://api.star-history.com/svg?repos=Hunterdii/GeeksforGeeks-POTD\u0026type=Date\" /\u003e\n \u003cimg alt=\"Star History Chart\" src=\"https://api.star-history.com/svg?repos=Hunterdii/GeeksforGeeks-POTD\u0026type=Date\" /\u003e\n \u003c/picture\u003e\n \u003c/a\u003e\n\u003c/div\u003e\n\n\u003c!--Line--\u003e\n\u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\" style=\"text-decoration: none;\"\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/74038190/212284100-561aa473-3905-4a80-b561-0d28506553ee.gif\" width=\"1100\"\u003e\n\u003c/a\u003e\n\n\u003c!-- Added Team section --\u003e\n## ๐Ÿ‘ค Creator\n| ![Het Patel](https://avatars.githubusercontent.com/u/124852522?v=4\u0026s=80) |\n|:--:|\n| [**Het Patel**](https://github.com/sponsors/Hunterdii) \u003cbr\u003e \u003csub\u003eProject Maintainer\u003c/sub\u003e |\n| [![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) |\n\nFor any inquiries or feedback, please contact. Happy Contributingโค\n\n\u003c!--Line--\u003e\n\u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\" style=\"text-decoration: none;\"\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/74038190/212284100-561aa473-3905-4a80-b561-0d28506553ee.gif\" width=\"1100\"\u003e\n\u003c/a\u003e\n\n\n\u003cdiv\u003e\n \u003ch2 align = \"center\"\u003e\u003cimg src=\"https://github.com/user-attachments/assets/00314b63-96bb-4e9a-92f6-4ead67e0fb7d\" width=\"35\" height=\"35\"\u003eOur Contributors\u003c/h2\u003e\n \u003cdiv align = \"center\"\u003e\n \u003ch3\u003eThank you for contributing to our repository\u003c/h3\u003e\u003c/div\u003e\n\n ![Contributors](https://contrib.rocks/image?repo=Hunterdii/GeeksforGeeks-POTD\u0026columns=24\u0026max=480)\n\u003c/div\u003e\n\n\u003e Shaping solutions every dayโ€”thanks to everyone contributing to **GeeksforGeeks-POTD! ๐Ÿš€**\n\n\u003c!--Line--\u003e\n\u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\" style=\"text-decoration: none;\"\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/74038190/212284100-561aa473-3905-4a80-b561-0d28506553ee.gif\" width=\"1100\"\u003e\n\u003c/a\u003e\n\n\n\u003cdiv style=\"text-align: center; margin-bottom: 20px;\"\u003e\n\n\u003ch2\u003e\u003cimg src=\"https://github.com/user-attachments/assets/8dfb6d9b-fa76-4863-b555-e4877ee9c801\" width = 32px height = 30px\u003e\u003c/a\u003e Star Geographical Distribution \u003c/h2\u003e\n\n \u003c!-- ## ๐ŸŒ Star Geographical Distribution--\u003e\n \u003cp\u003eThis map shows the global distribution of stars for the repository. Click to explore more details.\u003c/p\u003e\n \u003ca href=\"https://next.ossinsight.io/widgets/official/analyze-repo-stars-map?repo_id=769514979\u0026activity=stars\" target=\"_blank\" style=\"display: block;\"\u003e\n \u003cpicture\u003e\n \u003csource media=\"(prefers-color-scheme: dark)\" srcset=\"https://next.ossinsight.io/widgets/official/analyze-repo-stars-map/thumbnail.png?repo_id=769514979\u0026activity=stars\u0026image_size=auto\u0026color_scheme=dark\" width=\"1100\" height=\"auto\"\u003e\n \u003cimg alt=\"Star Geographical Distribution of GeeksforGeeks-POTD\" src=\"https://next.ossinsight.io/widgets/official/analyze-repo-stars-map/thumbnail.png?repo_id=769514979\u0026activity=stars\u0026image_size=auto\u0026color_scheme=light\" width=\"1100\" height=\"auto\"\u003e\n \u003c/picture\u003e\n \u003c/a\u003e\n \n \u003cp\u003e\u003cimg src=\"https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3\" style=\"width:22px; color: #FFD700\" alt=\"Star GIF\"\u003e See the geographical spread of stars on the map above! \u003cimg src=\"https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3\" style=\"width:22px; color: #FFD700\" alt=\"Star GIF\"\u003e\u003c/p\u003e\n \n\u003c/div\u003e\n\n\n\u003ch2\u003e\n \u003ca href=\"https://github.com/Hunterdii/GeeksforGeeks-POTD\"\u003e\n \u003cimg src=\"https://github.com/user-attachments/assets/5b3cb883-6652-4525-a352-b4b9a3501e07\" width = 35px height = 35px\u003e\u003c/a\u003e Achievements \u0026 Highlights \u003c/h2\u003e\n\n- **๐ŸŒ Global Reach**: Engaging with coders worldwide, from beginners to experts.\n- **๐Ÿ”ฅ Trending Topics**: Problems that sharpen your data structures and algorithms skills.\n\n\u003ch1\u003e \u003cimg src=\"https://github.com/user-attachments/assets/35f6838c-52f5-4e48-8a98-c5203f8c57e3\" style=\"width:38px; color: #FFD700\" alt=\"Star GIF\"\u003e\nReady to Level Up Your Coding Skills? Give This Repo a Star! \u003c/h1\u003e\nYour support fuels the journey. A star not only motivates but keeps the commitment alive. Letโ€™s make coding collaborative and fun!\n\n\n\n**โœจ Happy Coding!**\n\n\n","funding_links":["https://github.com/sponsors/Hunterdii","https://buymeacoffee.com/het81857","https://thanks.dev/gh/hunterdii"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhunterdii%2Fgeeksforgeeks-potd","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhunterdii%2Fgeeksforgeeks-potd","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhunterdii%2Fgeeksforgeeks-potd/lists"}