Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/anmol-baranwal/leetcode-gfg-ds-solutions

C++ Topic wise Leetcode & GFG solutions ✨ (easy access)
https://github.com/anmol-baranwal/leetcode-gfg-ds-solutions

algorithms cplusplus cpp data-structures documented dynamic-programming easy-to-understand geeksforgeeks geeksforgeeks-cpp geeksforgeeks-solutions graphs leetcode leetcode-solutions striver-sde-sheet

Last synced: 24 days ago
JSON representation

C++ Topic wise Leetcode & GFG solutions ✨ (easy access)

Awesome Lists containing this project

README 

        
# Fire My Leetcode & Geeksforgeeks Solutions Fire



> ℹ️ All solutions are in C++ & are organized topic-wise.






  










# [Menu](#menu)

- [Welcome](#welcome)



   - [Leetcode](#-leetcode-questions-)

      - [Arrays](#arrays-)

      - [Strings](#strings-)

      - [Graph](#graph-)

      - [Dynamic Programming](#dynamic-programming-)

      

   - [Geeksforgeeks](#-geeksforgeeks-questions-)

      - [Graph](#graph--1)

      - [Dynamic Programming](#dynamic-programming--1)

      - [Strings](#strings--1)

      

- [Thanks for Visiting](#-thanks-for-visiting)







---



#  Leetcode Questions 



## [Arrays](Arrays/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)

 

SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | Two Sum | Easy | [view](https://leetcode.com/problems/two-sum/) | [view](Arrays/Leetcode/1.%20Two%20Sum.cpp)

2 | Pascal's Triangle | Easy | [view](https://leetcode.com/problems/pascals-triangle/) | [view](Arrays/Leetcode/118.%20Pascal's%20Triangle.cpp)

3 | Pascal's Triangle II | Easy | [view](https://leetcode.com/problems/pascals-triangle-ii/) | [view](Arrays/Leetcode/119.%20Pascal's%20Triangle%20II.cpp)

4 | 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)

5 | 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)

6 | Longest Consecutive Sequence | Medium | [view](https://leetcode.com/problems/longest-consecutive-sequence/) | [view](Arrays/Leetcode/128.%20Longest%20Consecutive%20Sequence.cpp)

7 | Majority Element | Easy | [view](https://leetcode.com/problems/majority-element/) | [view](Arrays/Leetcode/169.%20Majority%20Element.cpp)

8 | Majority Element II | Medium | [view](https://leetcode.com/problems/majority-element-ii/) | [view](Arrays/Leetcode/229.%20Majority%20Element%20II.cpp)

9 | Remove Element | Easy | [view](https://leetcode.com/problems/remove-element/) | [view](Arrays/Leetcode/27.%20Remove%20Element.cpp)

10 | 4Sum | Medium | [view](https://leetcode.com/problems/4sum/) | [view](Arrays/Leetcode/18.%204Sum.cpp)

11 | Maximum Ascending Subarray Sum | Medium | [view](https://leetcode.com/problems/maximum-subarray/) | [view](Arrays/Leetcode/1800.%20Maximum%20Ascending%20Subarray%20Sum.cpp)

12 | Find the Duplicate Number | Medium | [view](https://leetcode.com/problems/find-the-duplicate-number/) | [view](Arrays/Leetcode/287.%20Find%20the%20Duplicate%20Number.cpp)

13 | Next Permutation | Medium | [view](https://leetcode.com/problems/next-permutation/) | [view](Arrays/Leetcode/31.%20Next%20Permutation.cpp)

14 | 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)

15 | Combination Sum | Medium | [view](https://leetcode.com/problems/combination-sum/) | [view](Arrays/Leetcode/39.%20Combination%20Sum.cpp)

16 | Combination Sum II | Medium | [view](https://leetcode.com/problems/combination-sum-ii/) | [view](Arrays/Leetcode/40.%20Combination%20Sum%20II.cpp)

17 | Permutations II | Medium | [view](https://leetcode.com/problems/permutations-ii/) | [view](Arrays/Leetcode/47.%20Permutations%20II.cpp)

18 | Rotate Image | Medium | [view](https://leetcode.com/problems/rotate-image/) | [view](Arrays/Leetcode/48.%20Rotate%20Image.cpp)

19 | Pow(x, n) | Medium | [view](https://leetcode.com/problems/powx-n/) | [view](Arrays/Leetcode/50.%20Pow(x%2C%20n).cpp)

20 | Maximum Subarray | Medium | [view](https://leetcode.com/problems/maximum-subarray/) | [view](Arrays/Leetcode/53.%20Maximum%20Subarray.cpp)

21 | Merge Intervals | Medium | [view](https://leetcode.com/problems/merge-intervals/) | [view](Arrays/Leetcode/56.%20Merge%20Intervals.cpp)

22 | Set Mismatch | Easy | [view](https://leetcode.com/problems/set-mismatch/) | [view](Arrays/Leetcode/645.%20Set%20Mismatch.cpp)

23 | Set Matrix Zeroes | Medium | [view](https://leetcode.com/problems/set-matrix-zeroes/) | [view](Arrays/Leetcode/73.%20Set%20Matrix%20Zeroes.cpp)

24 | Palindrome Number | Easy | [view](https://leetcode.com/problems/palindrome-number/) | [view](Arrays/Leetcode/9.%20Palindrome%20Number.cpp)

25 | Ugly Number | Easy | [view](https://leetcode.com/problems/ugly-number/) | [view](Arrays/Leetcode/263.%20Ugly%20Number.cpp)

26 | Ugly Number II | Medium | [view](https://leetcode.com/problems/ugly-number-ii/) | [view](Arrays/Leetcode/264.%20Ugly%20Number%20II.cpp)

27 | 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)

28 | Happy Number | Easy | [view](https://leetcode.com/problems/happy-number/) | [view](202.%20Happy%20Number.cpp)







## [Strings](Strings/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)



SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | Integer to Roman | Medium | [view](https://leetcode.com/problems/integer-to-roman/) | [view](Strings/Leetcode/12.%20Integer%20to%20Roman.cpp)

2 | Roman to Integer | Easy | [view](https://leetcode.com/problems/roman-to-integer/) | [view](Strings/Leetcode/13.%20Roman%20to%20Integer.cpp)

3 | Longest Common Subsequence | Medium | [view](https://leetcode.com/problems/longest-common-subsequence/) | [view](Strings/Leetcode/1143.%20Longest%20Common%20Subsequence.cpp)

4 | Longest Palindromic Subsequence | Medium | [view](https://leetcode.com/problems/longest-palindromic-subsequence/) | [view](Strings/Leetcode/516.%20Longest%20Palindromic%20Subsequence.cpp)

5 | 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)

6 | Shortest Common Supersequence | Hard | [view](https://leetcode.com/problems/shortest-common-supersequence/) | [view](Strings/Leetcode/1092.%20Shortest%20Common%20Supersequence.cpp)

7 | 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)

8 | Edit Distance | Hard | [view](https://leetcode.com/problems/edit-distance/) | [view](Strings/Leetcode/72.%20Edit%20Distance.cpp)

9 | Wildcard Matching | Hard | [view](https://leetcode.com/problems/wildcard-matching/) | [view](Strings/Leetcode/44.%20Wildcard%20Matching.cpp)

23 | Distinct Subsequences | Hard | [view](https://leetcode.com/problems/distinct-subsequences/) | [view](Strings/Leetcode/115.%20Distinct%20Subsequences.cpp)







## [Graph](Graph/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)



SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | Number of Enclaves | Medium | [view](https://leetcode.com/problems/number-of-enclaves/) | [view](Graph/Leetcode/1020.%20Number%20of%20Enclaves.cpp)

2 | 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)

3 | Word Ladder | Hard | [view](https://leetcode.com/problems/word-ladder/) | [view](Graph/Leetcode/127.%20Word%20Ladder.cpp)

4 | Surrounded Regions DFS | Medium | [view](https://leetcode.com/problems/surrounded-regions/) | [view](Graph/Leetcode/130.%20Surrounded%20Regions%20DFS.cpp)

5 | 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)

6 | Number of Islands BFS | Medium | [view](https://leetcode.com/problems/number-of-islands/) | [view](Graph/Leetcode/200.%20Number%20of%20Islands%20BFS.cpp)

7 | Number of Islands DFS | Medium | [view](https://leetcode.com/problems/number-of-islands/) | [view](Graph/Leetcode/200.%20Number%20of%20Islands%20DFS.cpp)

8 | Course Schedule | Medium | [view](https://leetcode.com/problems/course-schedule) | [view](Graph/Leetcode/207.%20Course%20Schedule.cpp)

9 | Course Schedule II | Medium | [view](https://leetcode.com/problems/course-schedule-ii) | [view](Graph/Leetcode/210.%20Course%20Schedule%20II.cpp)

10 | Island Perimeter | Easy | [view](https://leetcode.com/problems/island-perimeter/) | [view](Graph/Leetcode/463.%20Island%20Perimeter.cpp)

11 | 01 Matrix | Medium | [view](https://leetcode.com/problems/01-matrix/) | [view](Graph/Leetcode/542.%2001%20Matrix.cpp)

12 | Flood Fill | Easy | [view](https://leetcode.com/problems/flood-fill/) | [view](Graph/Leetcode/733.%20Flood%20Fill.cpp)

13 | Is Graph Bipartite BFS | Medium | [view](https://leetcode.com/problems/is-graph-bipartite/) | [view](Graph/Leetcode/785.%20Is%20Graph%20Bipartite%20BFS.cpp)

14 | Is Graph Bipartite DFS | Medium | [view](https://leetcode.com/problems/is-graph-bipartite) | [view](Graph/Leetcode/785.%20Is%20Graph%20Bipartite%20DFS.cpp)

15 | Rotting Oranges | Medium | [view](https://leetcode.com/problems/rotting-oranges/) | [view](Graph/Leetcode/994.%20Rotting%20Oranges.cpp)

16 | 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)

17 | 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)

18 | 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)

19 | 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)

20 | 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)

21 | Path With Minimum Effort | Medium | [view](https://leetcode.com/problems/path-with-minimum-effort/) | [view](Graph/Leetcode/1631.%20Path%20With%20Minimum%20Effort.cpp)

22 | 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)

23 | Max Area of Island | Medium | [view](https://leetcode.com/problems/max-area-of-island/) | [view](Graph/Leetcode/695.%20Max%20Area%20of%20Island.cpp)







## [Dynamic Programming](Dynamic%20Programming/Leetcode) [🔝](#-my-leetcode--geeksforgeeks-solutions-)



SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | Fibonacci Number | Easy | [view](https://leetcode.com/problems/fibonacci-number/) | [view](Dynamic%20Programming/Leetcode/509.%20Fibonacci%20Number.cpp)

2 | N-th Tribonacci Number | Easy | [view](https://leetcode.com/problems/n-th-tribonacci-number/) | [view](Dynamic%20Programming/Leetcode/1137.%20N-th%20Tribonacci%20Number.cpp)

3 | Climbing Stairs | Easy | [view](https://leetcode.com/problems/climbing-stairs/) | [view](Dynamic%20Programming/Leetcode/70.%20Climbing%20Stairs.cpp)

4 | House Robber | Medium | [view](https://leetcode.com/problems/house-robber/) | [view](Dynamic%20Programming/Leetcode/198.%20House%20Robber.cpp)

5 | House Robber II | Medium | [view](https://leetcode.com/problems/house-robber-ii/) | [view](Dynamic%20Programming/Leetcode/213.%20House%20Robber%20II.cpp)

6 | Unique Paths | Medium | [view](https://leetcode.com/problems/unique-paths/) | [view](Dynamic%20Programming/Leetcode/62.%20Unique%20Paths.cpp)

7 | Unique Paths II | Medium | [view](https://leetcode.com/problems/unique-paths-ii/) | [view](Dynamic%20Programming/Leetcode/63.%20Unique%20Paths%20II.cpp)

8 | Minimum Path Sum | Medium | [view](https://leetcode.com/problems/minimum-path-sum/) | [view](Dynamic%20Programming/Leetcode/64.%20Minimum%20Path%20Sum.cpp)

9 | Minimum Falling Path Sum | Medium | [view](https://leetcode.com/problems/minimum-falling-path-sum/) | [view](Dynamic%20Programming/Leetcode/931.%20Minimum%20Falling%20Path%20Sum.cpp)

10 | Triangle | Medium | [view](https://leetcode.com/problems/triangle/) | [view](Dynamic%20Programming/Leetcode/120.%20Triangle.cpp)

11 | Cherry Pickup II | Hard | [view](https://leetcode.com/problems/cherry-pickup-ii/) | [view](Dynamic%20Programming/Leetcode/1463.%20Cherry%20Pickup%20II.cpp)

12 | Target Sum | Medium | [view](https://leetcode.com/problems/target-sum/) | [view](Dynamic%20Programming/Leetcode/494.%20Target%20Sum.cpp)

13 | Partition Equal Subset Sum | Medium | [view](https://leetcode.com/problems/partition-equal-subset-sum/) | [view](Dynamic%20Programming/Leetcode/416.%20Partition%20Equal%20Subset%20Sum.cpp)

14 | Coin Change | Medium | [view](https://leetcode.com/problems/coin-change/) | [view](Dynamic%20Programming/Leetcode/416.%20Partition%20Equal%20Subset%20Sum.cpp)

15 | Coin Change II | Medium | [view](https://leetcode.com/problems/coin-change-ii/) | [view](Dynamic%20Programming/Leetcode/518.%20Coin%20Change%20II.cpp)

16 | Longest Common Subsequence | Medium | [view](https://leetcode.com/problems/longest-common-subsequence/) | [view](Dynamic%20Programming/Leetcode/1143.%20Longest%20Common%20Subsequence.cpp)

17 | Longest Palindromic Subsequence | Medium | [view](https://leetcode.com/problems/longest-palindromic-subsequence/) | [view](Dynamic%20Programming/Leetcode/516.%20Longest%20Palindromic%20Subsequence.cpp)

18 | 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)

19 | Shortest Common Supersequence | Hard | [view](https://leetcode.com/problems/shortest-common-supersequence/) | [view](Dynamic%20Programming/Leetcode/1092.%20Shortest%20Common%20Supersequence.cpp)

20 | 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)

21 | Edit Distance | Hard | [view](https://leetcode.com/problems/edit-distance/) | [view](Dynamic%20Programming/Leetcode/72.%20Edit%20Distance.cpp)

22 | Wildcard Matching | Hard | [view](https://leetcode.com/problems/wildcard-matching/) | [view](Dynamic%20Programming/Leetcode/44.%20Wildcard%20Matching.cpp)

23 | Distinct Subsequences | Hard | [view](https://leetcode.com/problems/distinct-subsequences/) | [view](Dynamic%20Programming/Leetcode/115.%20Distinct%20Subsequences.cpp)

24 | 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)

25 | 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)

26 | 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)

27 | 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)

28 | 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)

29 | Longest Increasing Subsequence | Medium | [view](https://leetcode.com/problems/longest-increasing-subsequence/) | [view](Dynamic%20Programming/Leetcode/300.%20Longest%20Increasing%20Subsequence.cpp)

30 | Longest String Chain | Medium | [view](https://leetcode.com/problems/longest-string-chain/) | [view](Dynamic%20Programming/Leetcode/1048.%20Longest%20String%20Chain.cpp)

31 | Burst Balloons | Hard | [view](https://leetcode.com/problems/burst-balloons/) | [view](Dynamic%20Programming/Leetcode/312.%20Burst%20Balloons.cpp)

31 | Min Cost Climbing Stairs | Easy | [view](https://leetcode.com/problems/min-cost-climbing-stairs/) | [view](Dynamic%20Programming/Leetcode/746.%20Min%20Cost%20Climbing%20Stairs.cpp)

32 | 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)

33 | 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)

34 | 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)

35 | Largest Divisible Subset | Medium | [view](https://leetcode.com/problems/largest-divisible-subset/) | [view](Dynamic%20Programming/Leetcode/368.%20Largest%20Divisible%20Subset.cpp)

36 | Palindrome Partitioning II | Hard | [view](https://leetcode.com/problems/palindrome-partitioning-ii/) | [view](Dynamic%20Programming/Leetcode/132.%20Palindrome%20Partitioning%20II.cpp)

37 | 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)







#  Geeksforgeeks Questions 



## [Graph](Graph/Geeksforgeeks) [🔝](#-my-leetcode--geeksforgeeks-solutions-)



SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | BFS of Graph | Easy | [view](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) | [view](Graph/Geeksforgeeks/BFS%20of%20Graph.cpp)

2 | DFS of Graph | Easy | [view](https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1) | [view](Graph/Geeksforgeeks/DFS%20of%20Graph.cpp)

3 | Print adjacency list | Easy | [view](https://practice.geeksforgeeks.org/problems/print-adjacency-list-1587115620/1) | [view](Graph/Geeksforgeeks/Print%20adjacency%20list.cpp)

4 | Flood fill Algorithm | Medium | [view](https://practice.geeksforgeeks.org/problems/flood-fill-algorithm1856/1) | [view](Graph/Geeksforgeeks/Flood%20fill%20Algorithm.cpp)

5 | Rotten Oranges | Medium | [view](https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1) | [view](Graph/Geeksforgeeks/Rotten%20Oranges.cpp)

6 | Number of Distinct Islands | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-distinct-islands/1) | [view](Graph/Geeksforgeeks/Number%20of%20Distinct%20Islands.cpp)

7 | Bipartite Graph | Medium | [view](https://practice.geeksforgeeks.org/problems/bipartite-graph/1) | [view](Graph/Geeksforgeeks/Bipartite%20Graph.cpp)

8 | 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)

9 | 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)

10 | 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)

11 | 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)

12 | Number of Enclaves | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-enclaves/1) | [view](Graph/Geeksforgeeks/Number%20Of%20Enclaves.cpp)

13 | Number of Provinces | Medium | [view](https://practice.geeksforgeeks.org/problems/number-of-provinces/1) | [view](Graph/Geeksforgeeks/Number%20of%20Provinces.cpp)

14 | 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)

15 | Word Ladder I | Hard | [view](https://practice.geeksforgeeks.org/problems/word-ladder/1) | [view](Graph/Geeksforgeeks/Word%20Ladder%20I.cpp)

16 | Word Ladder II | Hard | [view](https://practice.geeksforgeeks.org/problems/word-ladder-ii/1) | [view](Graph/Geeksforgeeks/Word%20Ladder%20II.cpp)

17 | Topological sort | Medium | [view](https://practice.geeksforgeeks.org/problems/topological-sort/1) | [view](Graph/Geeksforgeeks/Topological%20sort.cpp)

18 | Eventual Safe States | Medium | [view](https://practice.geeksforgeeks.org/problems/eventual-safe-states/1) | [view](Graph/Geeksforgeeks/Eventual%20Safe%20States.cpp)

19 | Course Schedule | Medium | [view](https://practice.geeksforgeeks.org/problems/course-schedule/1) | [view](Graph/Geeksforgeeks/Course%20Schedule.cpp)

20 | Alien Dictionary | Hard | [view](https://practice.geeksforgeeks.org/problems/alien-dictionary/1) | [view](Graph/Geeksforgeeks/Alien%20Dictionary.cpp)

21 | 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)

22 | Path With Minimum Effort | Medium | [view](https://practice.geeksforgeeks.org/problems/path-with-minimum-effort/1) | [view](Graph/Geeksforgeeks/Path%20With%20Minimum%20Effort.cpp)

23 | 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)

24 | 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)

25 | 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)

26 | 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)

27 | 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)

28 | Floyd Warshall | Medium | [view](https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1) | [view](Graph/Geeksforgeeks/Floyd%20Warshall.cpp)

29 | Minimum Spanning Tree using Prims Algorithm | Medium | [view](https://practice.geeksforgeeks.org/problems/minimum-spanning-tree/1) | [view](Graph/Geeksforgeeks/Minimum%20Spanning%20Tree.cpp)

30 | 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)

31 | 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)

32 | Alex Travelling using Bellman Ford | Medium | [view](https://practice.geeksforgeeks.org/problems/alex-travelling/1) | [view](Graph/Geeksforgeeks/Alex%20Travelling%20using%20Bellman%20Ford.cpp)

33 | Alex Travelling using Dijkstra | Medium | [view](https://practice.geeksforgeeks.org/problems/alex-travelling/1) | [view](Graph/Geeksforgeeks/Alex%20Travelling%20using%20Dijkstra.cpp)

34 | 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)

35 | 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)

36 | Connecting the graph | Medium | [view](https://practice.geeksforgeeks.org/problems/connecting-the-graph/1) | [view](Graph/Geeksforgeeks/Connecting%20the%20graph.cpp)

37 | 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)

38 | 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)

39 | 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)







## [Dynamic Programming](Dynamic%20Programming/Geeksforgeeks) [🔝](#-my-leetcode--geeksforgeeks-solutions-)



SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | Subset Sum Problem | Medium | [view](https://practice.geeksforgeeks.org/problems/subset-sum-problem-1611555638/1) | [view](Dynamic%20Programming/Geeksforgeeks/Subset%20Sum%20Problem.cpp)

2 | Perfect Sum Problem | Medium | [view](https://practice.geeksforgeeks.org/problems/perfect-sum-problem5633/1) | [view](Dynamic%20Programming/Geeksforgeeks/Perfect%20Sum%20Problem.cpp)

3 | 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)

4 | 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)

5 | Rod Cutting | Medium | [view](https://practice.geeksforgeeks.org/problems/rod-cutting0840/1) | [view](Dynamic%20Programming/Geeksforgeeks/Rod%20Cutting.cpp)

6 | Longest Common Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Common%20Subsequence.cpp)

7 | Longest Common Substring | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Common%20Substring.cpp)

8 | Longest Palindromic Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-palindromic-subsequence-1612327878/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Palindromic%20Subsequence.cpp)

9 | Shortest Common Supersequence | Medium | [view](https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1) | [view](Dynamic%20Programming/Geeksforgeeks/Shortest%20Common%20Supersequence.cpp)

10 | Form a palindrome | Medium | [view](Dynamic%20Programming/Geeksforgeeks/https://practice.geeksforgeeks.org/problems/form-a-palindrome1455/1) | [view](Form%20a%20palindrome.cpp)

11 | 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)

12 | Edit Distance | Medium | [view](https://practice.geeksforgeeks.org/problems/edit-distance3702/1) | [view](Dynamic%20Programming/Geeksforgeeks/Edit%20Distance.cpp)

13 | Wildcard Pattern Matching | Medium | [view](https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1) | [view](Dynamic%20Programming/Geeksforgeeks/Wildcard%20Pattern%20Matching.cpp)

14 | Longest Bitonic subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-bitonic-subsequence0824/1) | [view](Dynamic%20Programming/Geeksforgeeks/Longest%20Bitonic%20subsequence.cpp)

15 | Burst Balloons | Hard | [view](https://practice.geeksforgeeks.org/problems/burst-balloons/1) | [view](Dynamic%20Programming/Geeksforgeeks/Burst%20Balloons.cpp)

16 | Matrix Chain Multiplication | Hard | [view](https://practice.geeksforgeeks.org/problems/matrix-chain-multiplication0303/1) | [view](Dynamic%20Programming/Geeksforgeeks/Matrix%20Chain%20Multiplication.cpp)

17 | Boolean Parenthesization | Hard | [view](https://practice.geeksforgeeks.org/problems/boolean-parenthesization5610/1) | [view](Dynamic%20Programming/Geeksforgeeks/Boolean%20Parenthesization.cpp)

18 | Palindromic Partitioning | Hard | [view](https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1) | [view](Dynamic%20Programming/Geeksforgeeks/Palindromic%20Partitioning.cpp)

19 | 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)







## [Strings](Strings/Geeksforgeeks) [🔝](#-my-leetcode--geeksforgeeks-solutions-)



SNo | Name | Difficulty | Question | Solution |

----|:-----|------------|----------|----------|

1 | Longest Common Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-subsequence-1587115620/1) | [view](Strings/Geeksforgeeks/Longest%20Common%20Subsequence.cpp)

2 | Longest Common Substring | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | [view](Strings/Geeksforgeeks/Longest%20Common%20Substring.cpp)

3 | Longest Palindromic Subsequence | Medium | [view](https://practice.geeksforgeeks.org/problems/longest-palindromic-subsequence-1612327878/1) | [view](Strings/Geeksforgeeks/Longest%20Palindromic%20Subsequence.cpp)

4 | Shortest Common Supersequence | Medium | [view](https://practice.geeksforgeeks.org/problems/shortest-common-supersequence0322/1) | [view](Strings/Geeksforgeeks/Shortest%20Common%20Supersequence.cpp)

5 | Form a palindrome | Medium | [view](Strings/Geeksforgeeks/https://practice.geeksforgeeks.org/problems/form-a-palindrome1455/1) | [view](Form%20a%20palindrome.cpp)

6 | 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)

7 | Edit Distance | Medium | [view](https://practice.geeksforgeeks.org/problems/edit-distance3702/1) | [view](Strings/Geeksforgeeks/Edit%20Distance.cpp)

8 | Wildcard Pattern Matching | Medium | [view](https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1) | [view](Strings/Geeksforgeeks/Wildcard%20Pattern%20Matching.cpp)







##  Thanks for Visiting



### Please 🌟 this repository! It really helps others to find this!!