GitHub - Priyanshu-Ganatra/Leetcode-Codestudio-And-DSA-problems: This repo is completely dedicated to the DSA problems I've solved on platforms like Leetcode, CodeStudio, GFG & more. I'll also be adding problems' codes from other platforms and my practice files. P.S. I'm following along Supreme 2.0 DSA Course while solving these problems.

Name		Name	Last commit message	Last commit date
.vscode		.vscode
Binary Search Trees		Binary Search Trees
Binary trees		Binary trees
Graphs		Graphs
Greedy		Greedy
Heaps		Heaps
LinkedList		LinkedList
Queue		Queue
Recursion practice		Recursion practice
Stack		Stack
Tries		Tries
BinaryToDecimal.cpp		BinaryToDecimal.cpp
BitManipulation.cpp		BitManipulation.cpp
CS_10_Print1ToNUsingRecursion.cpp		CS_10_Print1ToNUsingRecursion.cpp
CS_11_PrintNTo1UsingRecursion.cpp		CS_11_PrintNTo1UsingRecursion.cpp
CS_12_CheckPalindromeUsingRecursion.cpp		CS_12_CheckPalindromeUsingRecursion.cpp
CS_13_FibonacciSeriesUptoNUsingRecursion.cpp		CS_13_FibonacciSeriesUptoNUsingRecursion.cpp
CS_14_CountFrequencyInARange.cpp		CS_14_CountFrequencyInARange.cpp
CS_15_CountHighestAndLowestFrequency.cpp		CS_15_CountHighestAndLowestFrequency.cpp
CS_16_RecursiveInsertionSort.cpp		CS_16_RecursiveInsertionSort.cpp
CS_17_RecursiveMergeSort.cpp		CS_17_RecursiveMergeSort.cpp
CS_18_RecursiveQuickSort.cpp		CS_18_RecursiveQuickSort.cpp
CS_19_FindSecondLargestAndSecondSmallest.cpp		CS_19_FindSecondLargestAndSecondSmallest.cpp
CS_1_FindUniqueElementInArray.cpp		CS_1_FindUniqueElementInArray.cpp
CS_20_RemoveDuplicatesFromSortedArray.cpp		CS_20_RemoveDuplicatesFromSortedArray.cpp
CS_21_LeftRotateArrayByKPlaces.cpp		CS_21_LeftRotateArrayByKPlaces.cpp
CS_22_MoveZeroesToEnd.cpp		CS_22_MoveZeroesToEnd.cpp
CS_23_UnionOfSortedArrays.cpp		CS_23_UnionOfSortedArrays.cpp
CS_24_FindMissingNumberInArray.cpp		CS_24_FindMissingNumberInArray.cpp
CS_25_FindTheSingleElement.cpp		CS_25_FindTheSingleElement.cpp
CS_26_LongestSubarrayWithSumKOnlyPositives.cpp		CS_26_LongestSubarrayWithSumKOnlyPositives.cpp
CS_27_LongestSubarrayWithSumKPositives&Negatives.cpp		CS_27_LongestSubarrayWithSumKPositives&Negatives.cpp
CS_28_CountAllSubarraysWithSumK.cpp		CS_28_CountAllSubarraysWithSumK.cpp
CS_29_CommonElementsIn3SortedArrays.cpp		CS_29_CommonElementsIn3SortedArrays.cpp
CS_2_FindDuplicateElem.cpp		CS_2_FindDuplicateElem.cpp
CS_30_SumOfTwoArrays.cpp		CS_30_SumOfTwoArrays.cpp
CS_31_FactorialOfALargeNumber.cpp		CS_31_FactorialOfALargeNumber.cpp
CS_32_RedundantParentheses.cpp		CS_32_RedundantParentheses.cpp
CS_33_NextSmallerElement.cpp		CS_33_NextSmallerElement.cpp
CS_34_ReverseFirstK_elements.cpp		CS_34_ReverseFirstK_elements.cpp
CS_35_InterleaveTheFirstHalfOfTheQueueWithTheSecondHalf.cpp		CS_35_InterleaveTheFirstHalfOfTheQueueWithTheSecondHalf.cpp
CS_36_FirstNegativeInAWindowOfSizeK.cpp		CS_36_FirstNegativeInAWindowOfSizeK.cpp
CS_37_FirstNonRepeatingCharInAStream.cpp		CS_37_FirstNonRepeatingCharInAStream.cpp
CS_38_SumOfMinAndMaxElementsOfWindowOfSizeK.cpp		CS_38_SumOfMinAndMaxElementsOfWindowOfSizeK.cpp
CS_39_NstacksInAnArray.cpp		CS_39_NstacksInAnArray.cpp
CS_3_ArrayIntersection.cpp		CS_3_ArrayIntersection.cpp
CS_40_NQueuesInAnArray.cpp		CS_40_NQueuesInAnArray.cpp
CS_41_PrintLeftViewOfBT.cpp		CS_41_PrintLeftViewOfBT.cpp
CS_42_TopViewOfBT.cpp		CS_42_TopViewOfBT.cpp
CS_43_BottomViewOfBT.cpp		CS_43_BottomViewOfBT.cpp
CS_44_BoundaryOrderTraversal.cpp		CS_44_BoundaryOrderTraversal.cpp
CS_45_DiagonalTraversalOfBT.cpp		CS_45_DiagonalTraversalOfBT.cpp
CS_46_ConvertABinaryTreeToItsSumTree.cpp		CS_46_ConvertABinaryTreeToItsSumTree.cpp
CS_47_TimeToBurnTree.cpp		CS_47_TimeToBurnTree.cpp
CS_48_MinimumElementInBST.cpp		CS_48_MinimumElementInBST.cpp
CS_49_01KnapsackProblem.cpp		CS_49_01KnapsackProblem.cpp
CS_4_PairSum.cpp		CS_4_PairSum.cpp
CS_50_BST_ToSsortedDLL.cpp		CS_50_BST_ToSsortedDLL.cpp
CS_51_FlattenBSTToASortedList.cpp		CS_51_FlattenBSTToASortedList.cpp
CS_52_MergeKSortedArrays.cpp		CS_52_MergeKSortedArrays.cpp
CS_53_SubsequencesOfAString.cpp		CS_53_SubsequencesOfAString.cpp
CS_54_Sort01.cpp		CS_54_Sort01.cpp
CS_55_PrintLikeAWave.cpp		CS_55_PrintLikeAWave.cpp
CS_56_ImplementUpperBound.cpp		CS_56_ImplementUpperBound.cpp
CS_57_CeilAndFloor.cpp		CS_57_CeilAndFloor.cpp
CS_5_TripletSum.cpp		CS_5_TripletSum.cpp
CS_6_Sort012.cpp		CS_6_Sort012.cpp
CS_7_PrintAllDivisors.cpp		CS_7_PrintAllDivisors.cpp
CS_8_CheckPrime.cpp		CS_8_CheckPrime.cpp
CS_9_GCD.cpp		CS_9_GCD.cpp
CharArrayPointers.cpp		CharArrayPointers.cpp
DanglingPointer.cpp		DanglingPointer.cpp
DecimalToBinary.cpp		DecimalToBinary.cpp
DivideUsingBSWithPrecision.cpp		DivideUsingBSWithPrecision.cpp
DynamicMemoryAllocation.cpp		DynamicMemoryAllocation.cpp
EKO SPOJ.cpp		EKO SPOJ.cpp
ExponentialSearch.cpp		ExponentialSearch.cpp
FactorialOfALargeNumber.cpp		FactorialOfALargeNumber.cpp
FindEvenNumbersInAnArrayUsingRecursion.cpp		FindEvenNumbersInAnArrayUsingRecursion.cpp
GFG_AddTwoNumbersRepresentedByTwoArrays.cpp		GFG_AddTwoNumbersRepresentedByTwoArrays.cpp
GFG_AgressiveCows.cpp		GFG_AgressiveCows.cpp
GFG_BookAllocationProblem.cpp		GFG_BookAllocationProblem.cpp
GFG_BubbleSort.cpp		GFG_BubbleSort.cpp
GFG_FirstRepeatingElement.cpp		GFG_FirstRepeatingElement.cpp
GFG_InsertionSort.cpp		GFG_InsertionSort.cpp
GFG_PaintersPartitionProblem.cpp		GFG_PaintersPartitionProblem.cpp
GFG_Segregate0sAnd1s.cpp		GFG_Segregate0sAnd1s.cpp
GFG_SelectionSort.cpp		GFG_SelectionSort.cpp
LC_100_CheckWordIsValidAfterSubstitutions.cpp		LC_100_CheckWordIsValidAfterSubstitutions.cpp
LC_101_GasStation.cpp		LC_101_GasStation.cpp
LC_102_SlidingWindowMaximum.cpp		LC_102_SlidingWindowMaximum.cpp
LC_103_DesignCircularQueue.cpp		LC_103_DesignCircularQueue.cpp
LC_104_DesignCircularDeque.cpp		LC_104_DesignCircularDeque.cpp
LC_105_ImplementQueueUsingStacks.cpp		LC_105_ImplementQueueUsingStacks.cpp
LC_106_ImplementStackUsingQueue.cpp		LC_106_ImplementStackUsingQueue.cpp
LC_107_SwappingNodesInALinkedList.cpp		LC_107_SwappingNodesInALinkedList.cpp
LC_108_LevelOrderTraversal.cpp		LC_108_LevelOrderTraversal.cpp
LC_109_MaximalDepthOfBinaryTree.cpp		LC_109_MaximalDepthOfBinaryTree.cpp
LC_10_SearchInRotatedSortedArray.cpp		LC_10_SearchInRotatedSortedArray.cpp
LC_110_DiameterOfABinaryTree.cpp		LC_110_DiameterOfABinaryTree.cpp

About

This repo is completely dedicated to the DSA problems I've solved on platforms like Leetcode, CodeStudio, GFG & more. I'll also be adding problems' codes from other platforms and my practice files. P.S. I'm following along Supreme 2.0 DSA Course while solving these problems.

dsa dsa-algorithm dsa-cpp dsa-learning-series dsa-practice dsa-questions dsalgo-questions interview-practice interview-preparation interview-questions problem-solving problems

Activity

29 stars

1 watching

17 forks

Report repository