{"id":20280148,"url":"https://github.com/anmol-baranwal/leetcode-gfg-ds-solutions","last_synced_at":"2025-07-06T15:38:01.269Z","repository":{"id":156616266,"uuid":"584689474","full_name":"Anmol-Baranwal/Leetcode-GFG-DS-Solutions","owner":"Anmol-Baranwal","description":"C++ Topic wise Leetcode \u0026 GFG solutions ✨ (easy access)","archived":false,"fork":false,"pushed_at":"2023-03-10T18:30:27.000Z","size":279,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-01T17:42:02.718Z","etag":null,"topics":["algorithms","cplusplus","cpp","data-structures","documented","dynamic-programming","easy-to-understand","geeksforgeeks","geeksforgeeks-cpp","geeksforgeeks-solutions","graphs","leetcode","leetcode-solutions","striver-sde-sheet"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Anmol-Baranwal.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-01-03T09:05:04.000Z","updated_at":"2024-05-15T06:38:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"cf2b9c57-de98-4455-a38a-2c0645dfc347","html_url":"https://github.com/Anmol-Baranwal/Leetcode-GFG-DS-Solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anmol-Baranwal%2FLeetcode-GFG-DS-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anmol-Baranwal%2FLeetcode-GFG-DS-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anmol-Baranwal%2FLeetcode-GFG-DS-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Anmol-Baranwal%2FLeetcode-GFG-DS-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Anmol-Baranwal","download_url":"https://codeload.github.com/Anmol-Baranwal/Leetcode-GFG-DS-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241773256,"owners_count":20018064,"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","cplusplus","cpp","data-structures","documented","dynamic-programming","easy-to-understand","geeksforgeeks","geeksforgeeks-cpp","geeksforgeeks-solutions","graphs","leetcode","leetcode-solutions","striver-sde-sheet"],"created_at":"2024-11-14T13:34:32.657Z","updated_at":"2025-03-04T02:42:20.999Z","avatar_url":"https://github.com/Anmol-Baranwal.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# \u003cimg src=\"https://user-images.githubusercontent.com/74038190/216122041-518ac897-8d92-4c6b-9b3f-ca01dcaf38ee.png\" alt=\"Fire\" width=\"40\" /\u003e My Leetcode \u0026 Geeksforgeeks Solutions \u003cimg src=\"https://user-images.githubusercontent.com/74038190/216122041-518ac897-8d92-4c6b-9b3f-ca01dcaf38ee.png\" alt=\"Fire\" width=\"40\" /\u003e\n\n\u003e ℹ️ All solutions are in C++ \u0026 are organized topic-wise.\n\u003cbr\u003e\n\u003cdiv align=\"left\"\u003e\n\u003ca href=\"https://leetcode.com/anmol4coder/\"\u003e\u003cimg src=\"https://img.shields.io/badge/-LeetCode-FFA116?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=black\"/\u003e\u003c/a\u003e  \u003ca href=\"https://github.com/Anmol-Baranwal\"\u003e\u003cimg src=\"https://img.shields.io/badge/GitHub-000000?style=for-the-badge\u0026logo=github\u0026logoColor=white\"/\u003e\u003c/a\u003e\n\u003ca href=\"https://auth.geeksforgeeks.org/user/anmolbaranwal119\"\u003e\u003cimg src=\"https://img.shields.io/badge/GeeksforGeeks-298D46?style=for-the-badge\u0026logo=geeksforgeeks\u0026logoColor=white\"/\u003e\u003c/a\u003e\n\u003c/div\u003e\n\u003cbr\u003e\u003cbr\u003e\n\n\n# [Menu](#menu)\n- [Welcome](#welcome)\n\n   - [Leetcode](#-leetcode-questions-)\n      - [Arrays](#arrays-)\n      - [Strings](#strings-)\n      - [Graph](#graph-)\n      - [Dynamic Programming](#dynamic-programming-)\n      \n   - [Geeksforgeeks](#-geeksforgeeks-questions-)\n      - [Graph](#graph--1)\n      - [Dynamic Programming](#dynamic-programming--1)\n      - [Strings](#strings--1)\n      \n- [Thanks for Visiting](#-thanks-for-visiting)\n\n\u003cbr\u003e\n\n---\n\n\u003c!--- ------------------------------------------------------------------------------------------------------------------------------------------------------ --\u003e\n\u003c!--- -- Leetcode List of Questions ------------------------------------------------------------------------------------------------------------------------ --\u003e\n\u003c!--- ------------------------------------------------------------------------------------------------------------------------------------------------------ --\u003e\n\n# \u003cimg src=\"https://user-images.githubusercontent.com/74038190/210561050-0231c15b-a40d-49e4-b83a-de7f17b1811d.svg\" width=\"30\"/\u003e Leetcode Questions \u003cimg src=\"https://user-images.githubusercontent.com/74038190/210561050-0231c15b-a40d-49e4-b83a-de7f17b1811d.svg\" width=\"30\"/\u003e\n\n\n## [Arrays](Arrays/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n \nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | Two Sum | Easy | [view](https://leetcode.com/problems/two-sum/) | [view](Arrays/Leetcode/1.%20Two%20Sum.cpp)\n2 | Pascal's Triangle | Easy | [view](https://leetcode.com/problems/pascals-triangle/) | [view](Arrays/Leetcode/118.%20Pascal's%20Triangle.cpp)\n3 | Pascal's Triangle II | Easy | [view](https://leetcode.com/problems/pascals-triangle-ii/) | [view](Arrays/Leetcode/119.%20Pascal's%20Triangle%20II.cpp)\n4 | Best Time to Buy and Sell Stock | Easy | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [view](Arrays/Leetcode/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.cpp)\n5 | Best Time to Buy and Sell Stock II | Medium | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [view](Arrays/Leetcode/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.cpp)\n6 | Longest Consecutive Sequence | Medium | [view](https://leetcode.com/problems/longest-consecutive-sequence/) | [view](Arrays/Leetcode/128.%20Longest%20Consecutive%20Sequence.cpp)\n7 | Majority Element | Easy | [view](https://leetcode.com/problems/majority-element/) | [view](Arrays/Leetcode/169.%20Majority%20Element.cpp)\n8 | Majority Element II | Medium | [view](https://leetcode.com/problems/majority-element-ii/) | [view](Arrays/Leetcode/229.%20Majority%20Element%20II.cpp)\n9 | Remove Element | Easy | [view](https://leetcode.com/problems/remove-element/) | [view](Arrays/Leetcode/27.%20Remove%20Element.cpp)\n10 | 4Sum | Medium | [view](https://leetcode.com/problems/4sum/) | [view](Arrays/Leetcode/18.%204Sum.cpp)\n11 | Maximum Ascending Subarray Sum | Medium | [view](https://leetcode.com/problems/maximum-subarray/) | [view](Arrays/Leetcode/1800.%20Maximum%20Ascending%20Subarray%20Sum.cpp)\n12 | Find the Duplicate Number | Medium | [view](https://leetcode.com/problems/find-the-duplicate-number/) | [view](Arrays/Leetcode/287.%20Find%20the%20Duplicate%20Number.cpp)\n13 | Next Permutation | Medium | [view](https://leetcode.com/problems/next-permutation/) | [view](Arrays/Leetcode/31.%20Next%20Permutation.cpp)\n14 | Search in Rotated Sorted Array | Medium | [view](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [view](Arrays/Leetcode/33.%20Search%20in%20Rotated%20Sorted%20Array.cpp)\n15 | Combination Sum | Medium | [view](https://leetcode.com/problems/combination-sum/) | [view](Arrays/Leetcode/39.%20Combination%20Sum.cpp)\n16 | Combination Sum II | Medium | [view](https://leetcode.com/problems/combination-sum-ii/) | [view](Arrays/Leetcode/40.%20Combination%20Sum%20II.cpp)\n17 | Permutations II | Medium | [view](https://leetcode.com/problems/permutations-ii/) | [view](Arrays/Leetcode/47.%20Permutations%20II.cpp)\n18 | Rotate Image | Medium | [view](https://leetcode.com/problems/rotate-image/) | [view](Arrays/Leetcode/48.%20Rotate%20Image.cpp)\n19 | Pow(x, n) | Medium | [view](https://leetcode.com/problems/powx-n/) | [view](Arrays/Leetcode/50.%20Pow(x%2C%20n).cpp)\n20 | Maximum Subarray | Medium | [view](https://leetcode.com/problems/maximum-subarray/) | [view](Arrays/Leetcode/53.%20Maximum%20Subarray.cpp)\n21 | Merge Intervals | Medium | [view](https://leetcode.com/problems/merge-intervals/) | [view](Arrays/Leetcode/56.%20Merge%20Intervals.cpp)\n22 | Set Mismatch | Easy | [view](https://leetcode.com/problems/set-mismatch/) | [view](Arrays/Leetcode/645.%20Set%20Mismatch.cpp)\n23 | Set Matrix Zeroes | Medium | [view](https://leetcode.com/problems/set-matrix-zeroes/) | [view](Arrays/Leetcode/73.%20Set%20Matrix%20Zeroes.cpp)\n24 | Palindrome Number | Easy | [view](https://leetcode.com/problems/palindrome-number/) | [view](Arrays/Leetcode/9.%20Palindrome%20Number.cpp)\n25 | Ugly Number | Easy | [view](https://leetcode.com/problems/ugly-number/) | [view](Arrays/Leetcode/263.%20Ugly%20Number.cpp)\n26 | Ugly Number II | Medium | [view](https://leetcode.com/problems/ugly-number-ii/) | [view](Arrays/Leetcode/264.%20Ugly%20Number%20II.cpp)\n27 | Maximum Length of Pair Chain | Medium | [view](https://leetcode.com/problems/maximum-length-of-pair-chain/) | [view](Arrays/Leetcode/646.%20Maximum%20Length%20of%20Pair%20Chain.cpp)\n28 | Happy Number | Easy | [view](https://leetcode.com/problems/happy-number/) | [view](202.%20Happy%20Number.cpp)\n\n\u003cbr\u003e\n\n## [Strings](Strings/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n\nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | Integer to Roman | Medium | [view](https://leetcode.com/problems/integer-to-roman/) | [view](Strings/Leetcode/12.%20Integer%20to%20Roman.cpp)\n2 | Roman to Integer | Easy | [view](https://leetcode.com/problems/roman-to-integer/) | [view](Strings/Leetcode/13.%20Roman%20to%20Integer.cpp)\n3 | Longest Common Subsequence | Medium | [view](https://leetcode.com/problems/longest-common-subsequence/) | [view](Strings/Leetcode/1143.%20Longest%20Common%20Subsequence.cpp)\n4 | Longest Palindromic Subsequence | Medium | [view](https://leetcode.com/problems/longest-palindromic-subsequence/) | [view](Strings/Leetcode/516.%20Longest%20Palindromic%20Subsequence.cpp)\n5 | Minimum Insertion Steps to Make a String Palindrome | Hard | [view](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | [view](Strings/Leetcode/1312.%20Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome.cpp)\n6 | Shortest Common Supersequence | Hard | [view](https://leetcode.com/problems/shortest-common-supersequence/) | [view](Strings/Leetcode/1092.%20Shortest%20Common%20Supersequence.cpp)\n7 | Delete Operation for Two Strings | Medium | [view](https://leetcode.com/problems/delete-operation-for-two-strings/) | [view](Strings/Leetcode/583.%20Delete%20Operation%20for%20Two%20Strings.cpp)\n8 | Edit Distance | Hard | [view](https://leetcode.com/problems/edit-distance/) | [view](Strings/Leetcode/72.%20Edit%20Distance.cpp)\n9 | Wildcard Matching | Hard | [view](https://leetcode.com/problems/wildcard-matching/) | [view](Strings/Leetcode/44.%20Wildcard%20Matching.cpp)\n23 | Distinct Subsequences | Hard | [view](https://leetcode.com/problems/distinct-subsequences/) | [view](Strings/Leetcode/115.%20Distinct%20Subsequences.cpp)\n\n\u003cbr\u003e\n\n## [Graph](Graph/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n\nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | Number of Enclaves | Medium | [view](https://leetcode.com/problems/number-of-enclaves/) | [view](Graph/Leetcode/1020.%20Number%20of%20Enclaves.cpp)\n2 | Critical Connections in a Network | Hard | [view](https://leetcode.com/problems/critical-connections-in-a-network/) | [view](Graph/Leetcode/1192.%20Critical%20Connections%20in%20a%20Network.cpp)\n3 | Word Ladder | Hard | [view](https://leetcode.com/problems/word-ladder/) | [view](Graph/Leetcode/127.%20Word%20Ladder.cpp)\n4 | Surrounded Regions DFS | Medium | [view](https://leetcode.com/problems/surrounded-regions/) | [view](Graph/Leetcode/130.%20Surrounded%20Regions%20DFS.cpp)\n5 | Number of Ways to Arrive at Destination | Medium | [view](https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/) | [view](Graph/Leetcode/1976.%20Number%20of%20Ways%20to%20Arrive%20at%20Destination.cpp)\n6 | Number of Islands BFS | Medium | [view](https://leetcode.com/problems/number-of-islands/) | [view](Graph/Leetcode/200.%20Number%20of%20Islands%20BFS.cpp)\n7 | Number of Islands DFS | Medium | [view](https://leetcode.com/problems/number-of-islands/) | [view](Graph/Leetcode/200.%20Number%20of%20Islands%20DFS.cpp)\n8 | Course Schedule | Medium | [view](https://leetcode.com/problems/course-schedule) | [view](Graph/Leetcode/207.%20Course%20Schedule.cpp)\n9 | Course Schedule II | Medium | [view](https://leetcode.com/problems/course-schedule-ii) | [view](Graph/Leetcode/210.%20Course%20Schedule%20II.cpp)\n10 | Island Perimeter | Easy | [view](https://leetcode.com/problems/island-perimeter/) | [view](Graph/Leetcode/463.%20Island%20Perimeter.cpp)\n11 | 01 Matrix | Medium | [view](https://leetcode.com/problems/01-matrix/) | [view](Graph/Leetcode/542.%2001%20Matrix.cpp)\n12 | Flood Fill | Easy | [view](https://leetcode.com/problems/flood-fill/) | [view](Graph/Leetcode/733.%20Flood%20Fill.cpp)\n13 | Is Graph Bipartite BFS | Medium | [view](https://leetcode.com/problems/is-graph-bipartite/) | [view](Graph/Leetcode/785.%20Is%20Graph%20Bipartite%20BFS.cpp)\n14 | Is Graph Bipartite DFS | Medium | [view](https://leetcode.com/problems/is-graph-bipartite) | [view](Graph/Leetcode/785.%20Is%20Graph%20Bipartite%20DFS.cpp)\n15 | Rotting Oranges | Medium | [view](https://leetcode.com/problems/rotting-oranges/) | [view](Graph/Leetcode/994.%20Rotting%20Oranges.cpp)\n16 | Cheapest Flights Within K Stops | Medium | [view](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [view](Graph/Leetcode/787.%20Cheapest%20Flights%20Within%20K%20Stops.cpp)\n17 | Network Delay Time using Bellman Ford | Medium | [view](https://leetcode.com/problems/network-delay-time/description/) | [view](Graph/Leetcode/743.%20Network%20Delay%20Time%20using%20Bellman%20Ford.cpp)\n18 | Network Delay Time using Dijkstra | Medium | [view](https://leetcode.com/problems/network-delay-time/description/) | [view](Graph/Leetcode/743.%20Network%20Delay%20Time%20using%20Dijkstra.cpp)\n19 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | [view](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/) | [view](Graph/Leetcode/1334.%20Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance.cpp)\n20 | Most Stones Removed with Same Row or Column | Medium | [view](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | [view](Graph/Leetcode/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column.cpp)\n21 | Path With Minimum Effort | Medium | [view](https://leetcode.com/problems/path-with-minimum-effort/) | [view](Graph/Leetcode/1631.%20Path%20With%20Minimum%20Effort.cpp)\n22 | Shortest Path in Binary Matrix | Medium | [view](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | [view](Graph/Leetcode/1091.%20Shortest%20Path%20in%20Binary%20Matrix.cpp)\n23 | Max Area of Island | Medium | [view](https://leetcode.com/problems/max-area-of-island/) | [view](Graph/Leetcode/695.%20Max%20Area%20of%20Island.cpp)\n\n\u003cbr\u003e\n\n## [Dynamic Programming](Dynamic%20Programming/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n\nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | Fibonacci Number | Easy | [view](https://leetcode.com/problems/fibonacci-number/) | [view](Dynamic%20Programming/Leetcode/509.%20Fibonacci%20Number.cpp)\n2 | N-th Tribonacci Number | Easy | [view](https://leetcode.com/problems/n-th-tribonacci-number/) | [view](Dynamic%20Programming/Leetcode/1137.%20N-th%20Tribonacci%20Number.cpp)\n3 | Climbing Stairs | Easy | [view](https://leetcode.com/problems/climbing-stairs/) | [view](Dynamic%20Programming/Leetcode/70.%20Climbing%20Stairs.cpp)\n4 | House Robber | Medium | [view](https://leetcode.com/problems/house-robber/) | [view](Dynamic%20Programming/Leetcode/198.%20House%20Robber.cpp)\n5 | House Robber II | Medium | [view](https://leetcode.com/problems/house-robber-ii/) | [view](Dynamic%20Programming/Leetcode/213.%20House%20Robber%20II.cpp)\n6 | Unique Paths | Medium | [view](https://leetcode.com/problems/unique-paths/) | [view](Dynamic%20Programming/Leetcode/62.%20Unique%20Paths.cpp)\n7 | Unique Paths II | Medium | [view](https://leetcode.com/problems/unique-paths-ii/) | [view](Dynamic%20Programming/Leetcode/63.%20Unique%20Paths%20II.cpp)\n8 | Minimum Path Sum | Medium | [view](https://leetcode.com/problems/minimum-path-sum/) | [view](Dynamic%20Programming/Leetcode/64.%20Minimum%20Path%20Sum.cpp)\n9 | Minimum Falling Path Sum | Medium | [view](https://leetcode.com/problems/minimum-falling-path-sum/) | [view](Dynamic%20Programming/Leetcode/931.%20Minimum%20Falling%20Path%20Sum.cpp)\n10 | Triangle | Medium | [view](https://leetcode.com/problems/triangle/) | [view](Dynamic%20Programming/Leetcode/120.%20Triangle.cpp)\n11 | Cherry Pickup II | Hard | [view](https://leetcode.com/problems/cherry-pickup-ii/) | [view](Dynamic%20Programming/Leetcode/1463.%20Cherry%20Pickup%20II.cpp)\n12 | Target Sum | Medium | [view](https://leetcode.com/problems/target-sum/) | [view](Dynamic%20Programming/Leetcode/494.%20Target%20Sum.cpp)\n13 | Partition Equal Subset Sum | Medium | [view](https://leetcode.com/problems/partition-equal-subset-sum/) | [view](Dynamic%20Programming/Leetcode/416.%20Partition%20Equal%20Subset%20Sum.cpp)\n14 | Coin Change | Medium | [view](https://leetcode.com/problems/coin-change/) | [view](Dynamic%20Programming/Leetcode/416.%20Partition%20Equal%20Subset%20Sum.cpp)\n15 | Coin Change II | Medium | [view](https://leetcode.com/problems/coin-change-ii/) | [view](Dynamic%20Programming/Leetcode/518.%20Coin%20Change%20II.cpp)\n16 | Longest Common Subsequence | Medium | [view](https://leetcode.com/problems/longest-common-subsequence/) | [view](Dynamic%20Programming/Leetcode/1143.%20Longest%20Common%20Subsequence.cpp)\n17 | Longest Palindromic Subsequence | Medium | [view](https://leetcode.com/problems/longest-palindromic-subsequence/) | [view](Dynamic%20Programming/Leetcode/516.%20Longest%20Palindromic%20Subsequence.cpp)\n18 | Minimum Insertion Steps to Make a String Palindrome | Hard | [view](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | [view](Dynamic%20Programming/Leetcode/1312.%20Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome.cpp)\n19 | Shortest Common Supersequence | Hard | [view](https://leetcode.com/problems/shortest-common-supersequence/) | [view](Dynamic%20Programming/Leetcode/1092.%20Shortest%20Common%20Supersequence.cpp)\n20 | Delete Operation for Two Strings | Medium | [view](https://leetcode.com/problems/delete-operation-for-two-strings/) | [view](Dynamic%20Programming/Leetcode/583.%20Delete%20Operation%20for%20Two%20Strings.cpp)\n21 | Edit Distance | Hard | [view](https://leetcode.com/problems/edit-distance/) | [view](Dynamic%20Programming/Leetcode/72.%20Edit%20Distance.cpp)\n22 | Wildcard Matching | Hard | [view](https://leetcode.com/problems/wildcard-matching/) | [view](Dynamic%20Programming/Leetcode/44.%20Wildcard%20Matching.cpp)\n23 | Distinct Subsequences | Hard | [view](https://leetcode.com/problems/distinct-subsequences/) | [view](Dynamic%20Programming/Leetcode/115.%20Distinct%20Subsequences.cpp)\n24 | Best Time to Buy and Sell Stock II | Medium | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [view](Dynamic%20Programming/Leetcode/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.cpp)\n25 | Best Time to Buy and Sell Stock III | Hard | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii) | [view](Dynamic%20Programming/Leetcode/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.cpp)\n26 | Best Time to Buy and Sell Stock IV | Hard | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | [view](Dynamic%20Programming/Leetcode/188.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV.cpp)\n27 | Best Time to Buy and Sell Stock with Cooldown | Medium | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [view](Dynamic%20Programming/Leetcode/309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown.cpp)\n28 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | [view](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [view](Dynamic%20Programming/Leetcode/714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee.cpp)\n29 | Longest Increasing Subsequence | Medium | [view](https://leetcode.com/problems/longest-increasing-subsequence/) | [view](Dynamic%20Programming/Leetcode/300.%20Longest%20Increasing%20Subsequence.cpp)\n30 | Longest String Chain | Medium | [view](https://leetcode.com/problems/longest-string-chain/) | [view](Dynamic%20Programming/Leetcode/1048.%20Longest%20String%20Chain.cpp)\n31 | Burst Balloons | Hard | [view](https://leetcode.com/problems/burst-balloons/) | [view](Dynamic%20Programming/Leetcode/312.%20Burst%20Balloons.cpp)\n31 | Min Cost Climbing Stairs | Easy | [view](https://leetcode.com/problems/min-cost-climbing-stairs/) | [view](Dynamic%20Programming/Leetcode/746.%20Min%20Cost%20Climbing%20Stairs.cpp)\n32 | Number of Longest Increasing Subsequence | Medium | [view](https://leetcode.com/problems/number-of-longest-increasing-subsequence/) | [view](Dynamic%20Programming/Leetcode/673.%20Number%20of%20Longest%20Increasing%20Subsequence.cpp)\n33 | Minimum Cost to Cut a Stick | Hard | [view](https://leetcode.com/problems/minimum-cost-to-cut-a-stick/) | [view](Dynamic%20Programming/Leetcode/1547.%20Minimum%20Cost%20to%20Cut%20a%20Stick.cpp)\n34 | Partition Array for Maximum Sum | Medium | [view](https://leetcode.com/problems/partition-array-for-maximum-sum/) | [view](Dynamic%20Programming/Leetcode/1043.%20Partition%20Array%20for%20Maximum%20Sum.cpp)\n35 | Largest Divisible Subset | Medium | [view](https://leetcode.com/problems/largest-divisible-subset/) | [view](Dynamic%20Programming/Leetcode/368.%20Largest%20Divisible%20Subset.cpp)\n36 | Palindrome Partitioning II | Hard | [view](https://leetcode.com/problems/palindrome-partitioning-ii/) | [view](Dynamic%20Programming/Leetcode/132.%20Palindrome%20Partitioning%20II.cpp)\n37 | Count Square Submatrices with All Ones | Medium | [view](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | [view](Dynamic%20Programming/Leetcode/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones.cpp)\n\n\u003cbr\u003e\n\n\u003c!--- ------------------------------------------------------------------------------------------------------------------------------------------------------ --\u003e\n\u003c!--- -- GFG List of Questions ----------------------------------------------------------------------------------------------------------------------------- --\u003e\n\u003c!--- ------------------------------------------------------------------------------------------------------------------------------------------------------ --\u003e\n\n# \u003cimg src=\"https://user-images.githubusercontent.com/74038190/210559465-d7849130-6d71-432f-97ee-e209c346e500.svg\" width=\"40\"/\u003e Geeksforgeeks Questions \u003cimg src=\"https://user-images.githubusercontent.com/74038190/210559465-d7849130-6d71-432f-97ee-e209c346e500.svg\" width=\"40\"/\u003e\n\n\n## [Graph](Graph/Geeksforgeeks) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n\nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | BFS of Graph | Easy | [view](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) | [view](Graph/Geeksforgeeks/BFS%20of%20Graph.cpp)\n2 | DFS of Graph | Easy | [view](https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1) | [view](Graph/Geeksforgeeks/DFS%20of%20Graph.cpp)\n3 | Print adjacency list | Easy | [view](https://practice.geeksforgeeks.org/problems/print-adjacency-list-1587115620/1) | [view](Graph/Geeksforgeeks/Print%20adjacency%20list.cpp)\n4 | Flood fill Algorithm | Medium | [view](https://practice.geeksforgeeks.org/problems/flood-fill-algorithm1856/1) | [view](Graph/Geeksforgeeks/Flood%20fill%20Algorithm.cpp)\n5 | Rotten Oranges | Medium | [view](https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1) | [view](Graph/Geeksforgeeks/Rotten%20Oranges.cpp)\n6 | Number of Distinct Islands | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-distinct-islands/1) | [view](Graph/Geeksforgeeks/Number%20of%20Distinct%20Islands.cpp)\n7 | Bipartite Graph | Medium | [view](https://practice.geeksforgeeks.org/problems/bipartite-graph/1) | [view](Graph/Geeksforgeeks/Bipartite%20Graph.cpp)\n8 | Detect cycle in a directed graph | Medium | [view](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1) | [view](Graph/Geeksforgeeks/Detect%20cycle%20in%20a%20directed%20graph.cpp)\n9 | Detect cycle in an undirected graph BFS | Medium | [view](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) | [view](Graph/Geeksforgeeks/Detect%20cycle%20in%20an%20undirected%20graph%20BFS.cpp)\n10 | Detect cycle in an undirected graph DFS | Medium | [view](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) | [view](Graph/Geeksforgeeks/Detect%20cycle%20in%20an%20undirected%20graph%20DFS.cpp)\n11 | Distance of nearest cell having 1 | Medium | [view](https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1-1587115620/1) | [view](Graph/Geeksforgeeks/Distance%20of%20nearest%20cell%20having%201.cpp)\n12 | Number of Enclaves | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-enclaves/1) | [view](Graph/Geeksforgeeks/Number%20Of%20Enclaves.cpp)\n13 | Number of Provinces | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-provinces/1) | [view](Graph/Geeksforgeeks/Number%20of%20Provinces.cpp)\n14 | Replace O's with X's | Medium | [view](https://practice.geeksforgeeks.org/problems/replace-os-with-xs0052/1) | [view](Graph/Geeksforgeeks/Replace%20O's%20with%20X's.cpp)\n15 | Word Ladder I | Hard | [view](https://practice.geeksforgeeks.org/problems/word-ladder/1) | [view](Graph/Geeksforgeeks/Word%20Ladder%20I.cpp)\n16 | Word Ladder II | Hard | [view](https://practice.geeksforgeeks.org/problems/word-ladder-ii/1) | [view](Graph/Geeksforgeeks/Word%20Ladder%20II.cpp)\n17 | Topological sort | Medium | [view](https://practice.geeksforgeeks.org/problems/topological-sort/1) | [view](Graph/Geeksforgeeks/Topological%20sort.cpp)\n18 | Eventual Safe States | Medium | [view](https://practice.geeksforgeeks.org/problems/eventual-safe-states/1) | [view](Graph/Geeksforgeeks/Eventual%20Safe%20States.cpp)\n19 | Course Schedule | Medium | [view](https://practice.geeksforgeeks.org/problems/course-schedule/1) | [view](Graph/Geeksforgeeks/Course%20Schedule.cpp)\n20 | Alien Dictionary | Hard | [view](https://practice.geeksforgeeks.org/problems/alien-dictionary/1) | [view](Graph/Geeksforgeeks/Alien%20Dictionary.cpp)\n21 | Shortest Distance in a Binary Maze | Medium | [view](https://practice.geeksforgeeks.org/problems/shortest-path-in-a-binary-maze-1655453161/1) | [view](Graph/Geeksforgeeks/Shortest%20Distance%20in%20a%20Binary%20Maze.cpp)\n22 | Path With Minimum Effort | Medium | [view](https://practice.geeksforgeeks.org/problems/path-with-minimum-effort/1) | [view](Graph/Geeksforgeeks/Path%20With%20Minimum%20Effort.cpp)\n23 | Number of Ways to Arrive at Destination | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-ways-to-arrive-at-destination/1) | [view](Graph/Geeksforgeeks/Number%20of%20Ways%20to%20Arrive%20at%20Destination.cpp)\n24 | Minimum Multiplications to reach End | Medium | [view](https://practice.geeksforgeeks.org/problems/minimum-multiplications-to-reach-end/1) | [view](Graph/Geeksforgeeks/Minimum%20Multiplications%20to%20reach%20End.cpp)\n25 | Implementing Dijkstra Algorithm using set | Medium | [view](https://practice.geeksforgeeks.org/problems/implementing-dijkstra-set-1-adjacency-matrix/1) | [view](Graph/Geeksforgeeks/Implementing%20Dijkstra%20Algorithm%20using%20set.cpp)\n26 | Implementing Dijkstra Algorithm using priority queue | Medium | [view](https://practice.geeksforgeeks.org/problems/implementing-dijkstra-set-1-adjacency-matrix/1) | [view](Graph/Geeksforgeeks/Implementing%20Dijkstra%20Algorithm%20using%20priority%20queue.cpp)\n27 | Cheapest Flights Within K Stops | Medium | [view](https://practice.geeksforgeeks.org/problems/cheapest-flights-within-k-stops/1) | [view](Graph/Geeksforgeeks/Cheapest%20Flights%20Within%20K%20Stops.cpp)\n28 | Floyd Warshall | Medium | [view](https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1) | [view](Graph/Geeksforgeeks/Floyd%20Warshall.cpp)\n29 | Minimum Spanning Tree using Prims Algorithm | Medium | [view](https://practice.geeksforgeeks.org/problems/minimum-spanning-tree/1) | [view](Graph/Geeksforgeeks/Minimum%20Spanning%20Tree.cpp)\n30 | Distance from the Source (Bellman-Ford Algorithm) | Medium | [view](https://practice.geeksforgeeks.org/problems/distance-from-the-source-bellman-ford-algorithm/1) | [view](Graph/Geeksforgeeks/Distance%20from%20the%20Source%20(Bellman-Ford%20Algorithm).cpp)\n31 | Find the number of islands using DFS | Medium | [view](https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1) | [view](Graph/Geeksforgeeks/Find%20the%20number%20of%20islands%20using%20DFS.cpp)\n32 | Alex Travelling using Bellman Ford | Medium | [view](https://practice.geeksforgeeks.org/problems/alex-travelling/1) | [view](Graph/Geeksforgeeks/Alex%20Travelling%20using%20Bellman%20Ford.cpp)\n33 | Alex Travelling using Dijkstra | Medium | [view](https://practice.geeksforgeeks.org/problems/alex-travelling/1) | [view](Graph/Geeksforgeeks/Alex%20Travelling%20using%20Dijkstra.cpp)\n34 | Disjoint set (Union-Find) | Easy | [view](https://practice.geeksforgeeks.org/problems/disjoint-set-union-find/1) | [view](Graph/Geeksforgeeks/Disjoint%20set%20(Union-Find).cpp)\n35 | Strongly Connected Components (Kosaraju's Algo) | Medium | [view](https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1) | [view](Graph/Geeksforgeeks/Strongly%20Connected%20Components%20(Kosaraju's%20Algo).cpp)\n36 | Connecting the graph | Medium | [view](https://practice.geeksforgeeks.org/problems/connecting-the-graph/1) | [view](Graph/Geeksforgeeks/Connecting%20the%20graph.cpp)\n37 | Number of Provinces using Disjoint Set | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-provinces/1) | [view](Graph/Geeksforgeeks/Number%20of%20Provinces%20using%20Disjoint%20Set.cpp)\n38 | Minimum Spanning Tree using Kruskal Algorithm | Medium | [view](https://practice.geeksforgeeks.org/problems/minimum-spanning-tree/1) | [view](Graph/Geeksforgeeks/Minimum%20Spanning%20Tree%20using%20Kruskal%20Algorithm.cpp)\n39 | City With the Smallest Number of Neighbors at a Threshold Distance | Medium | [view](https://practice.geeksforgeeks.org/problems/city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/0) | [view](Graph/Geeksforgeeks/City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance.cpp)\n\n\u003cbr\u003e\n\n## [Dynamic Programming](Dynamic%20Programming/Geeksforgeeks) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n\nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | Subset Sum Problem | Medium | [view](https://practice.geeksforgeeks.org/problems/subset-sum-problem-1611555638/1) | [view](Dynamic%20Programming/Geeksforgeeks/Subset%20Sum%20Problem.cpp)\n2 | Perfect Sum Problem | Medium | [view](https://practice.geeksforgeeks.org/problems/perfect-sum-problem5633/1) | [view](Dynamic%20Programming/Geeksforgeeks/Perfect%20Sum%20Problem.cpp)\n3 | 0 - 1 Knapsack Problem | Medium | [view](https://practice.geeksforgeeks.org/problems/0-1-knapsack-problem0945/1) | [view](Dynamic%20Programming/Geeksforgeeks/0%20-%201%20Knapsack%20Problem.cpp)\n4 | Knapsack with Duplicate Items | Easy | [view](https://practice.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1) | [view](Dynamic%20Programming/Geeksforgeeks/Knapsack%20with%20Duplicate%20Items.cpp)\n5 | Rod Cutting | Medium | [view](https://practice.geeksforgeeks.org/problems/rod-cutting0840/1) | [view](Dynamic%20Programming/Geeksforgeeks/Rod%20Cutting.cpp)\n6 | Longest Common Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Common%20Subsequence.cpp)\n7 | Longest Common Substring | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Common%20Substring.cpp)\n8 | Longest Palindromic Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-palindromic-subsequence-1612327878/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Palindromic%20Subsequence.cpp)\n9 | Shortest Common Supersequence | Medium | [view](https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1) | [view](Dynamic%20Programming/Geeksforgeeks/Shortest%20Common%20Supersequence.cpp)\n10 | Form a palindrome | Medium | [view](Dynamic%20Programming/Geeksforgeeks/https://practice.geeksforgeeks.org/problems/form-a-palindrome1455/1) | [view](Form%20a%20palindrome.cpp)\n11 | Minimum number of deletions and insertions | Easy | [view](https://practice.geeksforgeeks.org/problems/minimum-number-of-deletions-and-insertions0209/1) | [view](Dynamic%20Programming/Geeksforgeeks/Minimum%20number%20of%20deletions%20and%20insertions.cpp)\n12 | Edit Distance | Medium | [view](https://practice.geeksforgeeks.org/problems/edit-distance3702/1) | [view](Dynamic%20Programming/Geeksforgeeks/Edit%20Distance.cpp)\n13 | Wildcard Pattern Matching | Medium | [view](https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1) | [view](Dynamic%20Programming/Geeksforgeeks/Wildcard%20Pattern%20Matching.cpp)\n14 | Longest Bitonic subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-bitonic-subsequence0824/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Bitonic%20subsequence.cpp)\n15 | Burst Balloons | Hard | [view](https://practice.geeksforgeeks.org/problems/burst-balloons/1) | [view](Dynamic%20Programming/Geeksforgeeks/Burst%20Balloons.cpp)\n16 | Matrix Chain Multiplication | Hard | [view](https://practice.geeksforgeeks.org/problems/matrix-chain-multiplication0303/1) | [view](Dynamic%20Programming/Geeksforgeeks/Matrix%20Chain%20Multiplication.cpp)\n17 | Boolean Parenthesization | Hard | [view](https://practice.geeksforgeeks.org/problems/boolean-parenthesization5610/1) | [view](Dynamic%20Programming/Geeksforgeeks/Boolean%20Parenthesization.cpp)\n18 | Palindromic Partitioning | Hard | [view](https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1) | [view](Dynamic%20Programming/Geeksforgeeks/Palindromic%20Partitioning.cpp)\n19 | Partition Array for Maximum Sum | Medium | [view](https://practice.geeksforgeeks.org/problems/partition-array-for-maximum-sum/1) | [view](Dynamic%20Programming/Geeksforgeeks/Partition%20Array%20for%20Maximum%20Sum.cpp)\n\n\u003cbr\u003e\n\n## [Strings](Strings/Geeksforgeeks) [🔝](#-my-leetcode--geeksforgeeks-solutions-)\n\nSNo | Name | Difficulty | Question | Solution |\n----|:-----|------------|----------|----------|\n1 | Longest Common Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1) | [view](Strings/Geeksforgeeks/Longest%20Common%20Subsequence.cpp)\n2 | Longest Common Substring | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | [view](Strings/Geeksforgeeks/Longest%20Common%20Substring.cpp)\n3 | Longest Palindromic Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-palindromic-subsequence-1612327878/1) | [view](Strings/Geeksforgeeks/Longest%20Palindromic%20Subsequence.cpp)\n4 | Shortest Common Supersequence | Medium | [view](https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1) | [view](Strings/Geeksforgeeks/Shortest%20Common%20Supersequence.cpp)\n5 | Form a palindrome | Medium | [view](Strings/Geeksforgeeks/https://practice.geeksforgeeks.org/problems/form-a-palindrome1455/1) | [view](Form%20a%20palindrome.cpp)\n6 | Minimum number of deletions and insertions | Easy | [view](https://practice.geeksforgeeks.org/problems/minimum-number-of-deletions-and-insertions0209/1) | [view](Strings/Geeksforgeeks/Minimum%20number%20of%20deletions%20and%20insertions.cpp)\n7 | Edit Distance | Medium | [view](https://practice.geeksforgeeks.org/problems/edit-distance3702/1) | [view](Strings/Geeksforgeeks/Edit%20Distance.cpp)\n8 | Wildcard Pattern Matching | Medium | [view](https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1) | [view](Strings/Geeksforgeeks/Wildcard%20Pattern%20Matching.cpp)\n\n\u003cbr\u003e\n\n\u003c!--- ------------------------------------------------------------------------------------------------------------------------------------------------------ --\u003e\n\u003c!--- -- 💜 Thanks For Visiting --------------------------------------------------------------------------------------------------------------------------- --\u003e\n\u003c!--- ------------------------------------------------------------------------------------------------------------------------------------------------------ --\u003e\n\n## \u003cimg src=\"https://user-images.githubusercontent.com/74038190/216122041-518ac897-8d92-4c6b-9b3f-ca01dcaf38ee.png\" width=\"30\" /\u003e Thanks for Visiting\n\n### Please 🌟 this repository! It really helps others to find this!!  \u003cimg src=\"https://user-images.githubusercontent.com/74038190/216125640-2783ebd5-e63e-4ed1-b491-627a40b24850.png\" width=\"25\" /\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanmol-baranwal%2Fleetcode-gfg-ds-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanmol-baranwal%2Fleetcode-gfg-ds-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanmol-baranwal%2Fleetcode-gfg-ds-solutions/lists"}