Anmol-Baranwal/Leetcode-GFG-DS-Solutions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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






SNoNameDifficultyQuestionSolution
1Two SumEasyviewview
2Pascal's TriangleEasyviewview
3Pascal's Triangle IIEasyviewview
4Best Time to Buy and Sell StockEasyviewview
5Best Time to Buy and Sell Stock IIMediumviewview
6Longest Consecutive SequenceMediumviewview
7Majority ElementEasyviewview
8Majority Element IIMediumviewview
9Remove ElementEasyviewview
104SumMediumviewview
11Maximum Ascending Subarray SumMediumviewview
12Find the Duplicate NumberMediumviewview
13Next PermutationMediumviewview
14Search in Rotated Sorted ArrayMediumviewview
15Combination SumMediumviewview
16Combination Sum IIMediumviewview
17Permutations IIMediumviewview
18Rotate ImageMediumviewview
19Pow(x, n)Mediumviewview
20Maximum SubarrayMediumviewview
21Merge IntervalsMediumviewview
22Set MismatchEasyviewview
23Set Matrix ZeroesMediumviewview
24Palindrome NumberEasyviewview
25Ugly NumberEasyviewview
26Ugly Number IIMediumviewview
27Maximum Length of Pair ChainMediumviewview
28Happy NumberEasyviewview

SNoNameDifficultyQuestionSolution
1Integer to RomanMediumviewview
2Roman to IntegerEasyviewview
3Longest Common SubsequenceMediumviewview
4Longest Palindromic SubsequenceMediumviewview
5Minimum Insertion Steps to Make a String PalindromeHardviewview
6Shortest Common SupersequenceHardviewview
7Delete Operation for Two StringsMediumviewview
8Edit DistanceHardviewview
9Wildcard MatchingHardviewview
23Distinct SubsequencesHardviewview

SNoNameDifficultyQuestionSolution
1Number of EnclavesMediumviewview
2Critical Connections in a NetworkHardviewview
3Word LadderHardviewview
4Surrounded Regions DFSMediumviewview
5Number of Ways to Arrive at DestinationMediumviewview
6Number of Islands BFSMediumviewview
7Number of Islands DFSMediumviewview
8Course ScheduleMediumviewview
9Course Schedule IIMediumviewview
10Island PerimeterEasyviewview
1101 MatrixMediumviewview
12Flood FillEasyviewview
13Is Graph Bipartite BFSMediumviewview
14Is Graph Bipartite DFSMediumviewview
15Rotting OrangesMediumviewview
16Cheapest Flights Within K StopsMediumviewview
17Network Delay Time using Bellman FordMediumviewview
18Network Delay Time using DijkstraMediumviewview
19Find the City With the Smallest Number of Neigrs at a Threshold DistanceMediumviewview
20Most Stones Removed with Same Row or ColumnMediumviewview
21Path With Minimum EffortMediumviewview
22Shortest Path in Binary MatrixMediumviewview
23Max Area of IslandMediumviewview

SNoNameDifficultyQuestionSolution
1Fibonacci NumberEasyviewview
2N-th Tribonacci NumberEasyviewview
3Climbing StairsEasyviewview
4House RobberMediumviewview
5House Robber IIMediumviewview
6Unique PathsMediumviewview
7Unique Paths IIMediumviewview
8Minimum Path SumMediumviewview
9Minimum Falling Path SumMediumviewview
10TriangleMediumviewview
11Cherry Pickup IIHardviewview
12Target SumMediumviewview
13Partition Equal Subset SumMediumviewview
14Coin ChangeMediumviewview
15Coin Change IIMediumviewview
16Longest Common SubsequenceMediumviewview
17Longest Palindromic SubsequenceMediumviewview
18Minimum Insertion Steps to Make a String PalindromeHardviewview
19Shortest Common SupersequenceHardviewview
20Delete Operation for Two StringsMediumviewview
21Edit DistanceHardviewview
22Wildcard MatchingHardviewview
23Distinct SubsequencesHardviewview
24Best Time to Buy and Sell Stock IIMediumviewview
25Best Time to Buy and Sell Stock IIIHardviewview
26Best Time to Buy and Sell Stock IVHardviewview
27Best Time to Buy and Sell Stock with CooldownMediumviewview
28Best Time to Buy and Sell Stock with Transaction FeeMediumviewview
29Longest Increasing SubsequenceMediumviewview
30Longest String ChainMediumviewview
31Burst BalloonsHardviewview
31Min Cost Climbing StairsEasyviewview
32Number of Longest Increasing SubsequenceMediumviewview
33Minimum Cost to Cut a StickHardviewview
34Partition Array for Maximum SumMediumviewview
35Largest Divisible SubsetMediumviewview
36Palindrome Partitioning IIHardviewview
37Count Square Submatrices with All OnesMediumviewview

SNoNameDifficultyQuestionSolution
1BFS of GraphEasyviewview
2DFS of GraphEasyviewview
3Print adjacency listEasyviewview
4Flood fill AlgorithmMediumviewview
5Rotten OrangesMediumviewview
6Number of Distinct IslandsMediumviewview
7Bipartite GraphMediumviewview
8Detect cycle in a directed graphMediumviewview
9Detect cycle in an undirected graph BFSMediumviewview
10Detect cycle in an undirected graph DFSMediumviewview
11Distance of nearest cell having 1Mediumviewview
12Number of EnclavesMediumviewview
13Number of ProvincesMediumviewview
14Replace O's with X'sMediumviewview
15Word Ladder IHardviewview
16Word Ladder IIHardviewview
17Topological sortMediumviewview
18Eventual Safe StatesMediumviewview
19Course ScheduleMediumviewview
20Alien DictionaryHardviewview
21Shortest Distance in a Binary MazeMediumviewview
22Path With Minimum EffortMediumviewview
23Number of Ways to Arrive at DestinationMediumviewview
24Minimum Multiplications to reach EndMediumviewview
25Implementing Dijkstra Algorithm using setMediumviewview
26Implementing Dijkstra Algorithm using priority queueMediumviewview
27Cheapest Flights Within K StopsMediumviewview
28Floyd WarshallMediumviewview
29Minimum Spanning Tree using Prims AlgorithmMediumviewview
30Distance from the Source (Bellman-Ford Algorithm)Mediumviewview
31Find the number of islands using DFSMediumviewview
32Alex Travelling using Bellman FordMediumviewview
33Alex Travelling using DijkstraMediumviewview
34Disjoint set (Union-Find)Easyviewview
35Strongly Connected Components (Kosaraju's Algo)Mediumviewview
36Connecting the graphMediumviewview
37Number of Provinces using Disjoint SetMediumviewview
38Minimum Spanning Tree using Kruskal AlgorithmMediumviewview
39City With the Smallest Number of Neigrs at a Threshold DistanceMediumviewview

SNoNameDifficultyQuestionSolution
1Subset Sum ProblemMediumviewview
2Perfect Sum ProblemMediumviewview
30 - 1 Knapsack ProblemMediumviewview
4Knapsack with Duplicate ItemsEasyviewview
5Rod CuttingMediumviewview
6Longest Common SubsequenceMediumviewview
7Longest Common SubstringMediumviewview
8Longest Palindromic SubsequenceMediumviewview
9Shortest Common SupersequenceMediumviewview
10Form a palindromeMediumviewview
11Minimum number of deletions and insertionsEasyviewview
12Edit DistanceMediumviewview
13Wildcard Pattern MatchingMediumviewview
14Longest Bitonic subsequenceMediumviewview
15Burst BalloonsHardviewview
16Matrix Chain MultiplicationHardviewview
17Boolean ParenthesizationHardviewview
18Palindromic PartitioningHardviewview
19Partition Array for Maximum SumMediumviewview

SNoNameDifficultyQuestionSolution
1Longest Common SubsequenceMediumviewview
2Longest Common SubstringMediumviewview
3Longest Palindromic SubsequenceMediumviewview
4Shortest Common SupersequenceMediumviewview
5Form a palindromeMediumviewview
6Minimum number of deletions and insertionsEasyviewview
7Edit DistanceMediumviewview
8Wildcard Pattern MatchingMediumviewview