Skip to content

0ne0rZer0/DSAPrep

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
.vscode
.vscode
 
 
Algorithms and Data Structures
Algorithms and Data Structures
 
 
Dynamic Programming
Dynamic Programming
 
 
Elements of programming/Greedy Algorithms
Elements of programming/Greedy Algorithms
 
 
FB Hackerup
FB Hackerup
 
 
Kickstart
Kickstart
 
 
Leetcode pdfs
Leetcode pdfs
 
 
01.TwoSum.cpp
01.TwoSum.cpp
 
 
02.MajorityElement.cpp
02.MajorityElement.cpp
 
 
03.kadanesalgo.cpp
03.kadanesalgo.cpp
 
 
04.findTheMissingNumber.cpp
04.findTheMissingNumber.cpp
 
 
05.searchInRotatedSorted.cpp
05.searchInRotatedSorted.cpp
 
 
06.mergeTwoArrays.cpp
06.mergeTwoArrays.cpp
 
 
07.medianOfTwoArrays.cpp
07.medianOfTwoArrays.cpp
 
 
08.rotationOfArrayLeft.cpp
08.rotationOfArrayLeft.cpp
 
 
09.maximumSumWithoutTwoAdjacent.cpp
09.maximumSumWithoutTwoAdjacent.cpp
 
 
10.leadersInArray.cpp
10.leadersInArray.cpp
 
 
10.sortFrequency.cpp
10.sortFrequency.cpp
 
 
11.mergeSortInversion.cpp
11.mergeSortInversion.cpp
 
 
12.unionIntersection.cpp
12.unionIntersection.cpp
 
 
13.productArrayExceptSelf.cpp
13.productArrayExceptSelf.cpp
 
 
14.twoDuplicates.cpp
14.twoDuplicates.cpp
 
 
15.dutchFlag.cpp
15.dutchFlag.cpp
 
 
16.partlySorted.cpp
16.partlySorted.cpp
 
 
17.equillibriumIndex.cpp
17.equillibriumIndex.cpp
 
 
18.cycleSort.cpp
18.cycleSort.cpp
 
 
19.nextGreaterElement.cpp
19.nextGreaterElement.cpp
 
 
20.consecutiveCheck.cpp
20.consecutiveCheck.cpp
 
 
21.findTheMissing(redo).cpp
21.findTheMissing(redo).cpp
 
 
22.countOccurrence.cpp
22.countOccurrence.cpp
 
 
23.maximumDIfference.cpp
23.maximumDIfference.cpp
 
 
24.maximumOfAllSubarrays.cpp
24.maximumOfAllSubarrays.cpp
 
 
25.minimumDistanceBetweenTwoNumbers.cpp
25.minimumDistanceBetweenTwoNumbers.cpp
 
 
26.findTheMIssingAndRepeating.cpp
26.findTheMIssingAndRepeating.cpp
 
 
27.medianOfRunningStream.cpp
27.medianOfRunningStream.cpp
 
 
28.fixedPointArray.cpp
28.fixedPointArray.cpp
 
 
29.maximumBiotonicLength.cpp
29.maximumBiotonicLength.cpp
 
 
30.maximumInBiotonicArray.cpp
30.maximumInBiotonicArray.cpp
 
 
31.jumpGame.cpp
31.jumpGame.cpp
 
 
32.subarrayEqualToSum.cpp
32.subarrayEqualToSum.cpp
 
 
33.maximumSumIncreasingSubsequence.cpp
33.maximumSumIncreasingSubsequence.cpp
 
 
34.longestIncreasingSubsequence.cpp
34.longestIncreasingSubsequence.cpp
 
 
35.threeSum.cpp
35.threeSum.cpp
 
 
36.twoOddOccurrence.cpp
36.twoOddOccurrence.cpp
 
 
37.celebrity.cpp
37.celebrity.cpp
 
 
38.sortedSubsequenceOfSize3.cpp
38.sortedSubsequenceOfSize3.cpp
 
 
Amazon LeetCode.xlsx
Amazon LeetCode.xlsx
 
 
Ds.pdf
Ds.pdf
 
 
Elements_of_Programming_Interviews__The_Insiders_Guide_-_PDF_Room.pdf
Elements_of_Programming_Interviews__The_Insiders_Guide_-_PDF_Room.pdf
 
 
FINAL450.xlsx
FINAL450.xlsx
 
 
README.md
README.md
 
 
a.exe
a.exe
 
 
aggressiveCows.cpp
aggressiveCows.cpp
 
 
algorithm.pdf
algorithm.pdf
 
 
equalZeroOne.cpp
equalZeroOne.cpp
 
 
floorAndCeiling.cpp
floorAndCeiling.cpp
 
 
input.txt
input.txt
 
 
output.txt
output.txt
 
 
sample.cpp
sample.cpp
 
 
subArraySum.cpp
subArraySum.cpp
 
 
template.cpp
template.cpp
 
 

Repository files navigation

DSAPrep

My path to make my DSA as strong as I can for FAANG.

About

Just me solving DSA questions

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages