Skip to content

Latest commit

History

304 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

#TitleQuestionSolutionDifficulty
01Two SumLeetCode 1JavaEasy
02Valid ParenthesesLeetCode 20Easy
03Merge Two Sorted ListsLeetCode 21JavaEasy
04Maximum SubarrayLeetCode 53JavaEasy
05Climbing StairsLeetCode 70Easy
06Symmetric TreeLeetCode 101JavaEasy
07Maximum Depth of Binary TreeLeetCode 104JavaEasy
08Best Time to Buy and Sell StockLeetCode 121Easy
09Single NumberLeetCode 136JavaEasy
10Linked List CycleLeetCode 141JavaEasy
11Min StackLeetCode 155JavaEasy
12Intersection of Two Linked ListsLeetCode 160Easy
13Majority ElementLeetCode 169JavaEasy
14House RobberLeetCode 198Easy
15Reverse Linked ListLeetCode 206JavaEasy
16Invert Binary TreeLeetCode 226JavaEasy
17Palindrome Linked ListLeetCode 234JavaEasy
18Move ZeroesLeetCode 283JavaEasy
19Path Sum IIILeetCode 437JavaEasy
20Find All Numbers Disappeared in an ArrayLeetCode 448JavaEasy
21Convert BST to Greater TreeLeetCode 538JavaEasy
22Diameter of Binary TreeLeetCode 543JavaEasy
23Shortest Unsorted Continuous SubarrayLeetCode 581Easy
24Merge Two Binary TreesLeetCode 617JavaEasy
25Jewels and StonesLeetCode 771JavaEasy

01. Sliding Window

#TitleQuestionSolutionDifficulty
Average of all subarrays of size KJavaEasy
01Maximum Sum Subarray of Size KJavaEasy
02Smallest Subarray with a given sumLeetCode 209JavaMedium
03Longest Substring with K Distinct CharactersJavaMedium
04Fruits into BasketsJavaMedium
05No-repeat SubstringHard
06Longest Substring with Same Letters after ReplacementHard
07Longest Subarray with Ones after ReplacementHard

02. Two Pointers

#TitleQuestionSolutionDifficulty
01Pair with Target SumJavaEasy
02Remove DuplicatesLeetCode 26JavaEasy
Remove ElementLeetCode 27JavaEasy
03Squaring a Sorted ArrayLeetCode 977JavaEasy
04Triplet Sum to ZeroLeetCode 15JavaMedium
05Triplet Sum Close to TargetLeetCode 16JavaMedium
06Triplets with Smaller SumMedium
07Subarrays with Product Less than a TargetMedium
08Dutch National Flag ProblemMedium
09Quadruple Sum to TargetMedium
10Comparing Strings containing BackspacesMedium
11Minimum Window SortMedium
12Maximum Trapping WaterMedium

03. Fast & Slow pointers

#TitleQuestionSolutionDifficulty
01LinkedList CycleLeetCode 141JavaEasy
LinkedList Cycle LengthGeeksforGeeksJavaEasy
02Start of LinkedList CycleLeetCode 142JavaMedium
03Happy NumberLeetCode 202JavaEasy
04Middle of the LinkedListLeetCode 876JavaEasy
05Palindrome LinkedListLeetCode 234JavaMedium
06Rearrange a LinkedListMedium
07Cycle in a Circular ArrayHard

04. Merge Intervals

#TitleQuestionSolutionDifficulty
01Merge IntervalsLeetCode 56JavaMedium
02Insert IntervalsLeetCode 57JavaHard
03Intervals IntersectionMedium
04Conflicting AppointmentsMedium

05. Cyclic Sort

#TitleQuestionSolutionDifficulty
01Cyclic SortJavaEasy
02Find the Missing NumberLeetCode 268JavaEasy
03Find all Missing NumbersJavaEasy
04Find the Duplicate NumberLeetCode 287JavaMedium
05Find all Duplicate NumbersJavaEasy
06Find the Corrupt PairEasy
07Find the Smallest Missing Positive NumberMedium
08Find the First K Missing Positive NumbersHard

06. In-place Reversal of a LinkedList

#TitleQuestionSolutionDifficulty
01Reverse a LinkedListLeetCode 206JavaEasy
02Reverse a Sub-listLeetCode 92JavaMedium
03Reverse every K-element Sub-listJavaMedium
04Reverse alternating K-element Sub-listMedium
05Rotate a LinkedListMedium

07. Tree BFS

#TitleQuestionSolutionDifficulty
01Binary Tree Level Order TraversalLeetCode 102JavaMedium
02Reverse Level Order TraversalLeetCode 107JavaEasy
03Zigzag TraversalLeetCode 103JavaMedium
04Level Averages in a Binary TreeLeetCode 637JavaEasy
05Minimum Depth of a Binary TreeLeetCode 111JavaEasy
06Level Order SuccessorJavaEasy
07Connect Level Order SiblingsLeetCode 116JavaMedium
08Connect All Level Order SiblingsJavaMedium
09Right View of a Binary TreeLeetCode 199JavaMedium
10Tree BoundaryHard

08. Tree DFS

#TitleQuestionSolutionDifficulty
01Binary Tree Path SumLeetCode 112JavaEasy
02All Paths for a SumLeetCode 113JavaMedium
03Sum of Path NumbersJavaMedium
04Path With Given SequenceJavaMedium
05Count Paths for a SumLeetCode 437JavaEasy
06Tree DiameterLeetCode 543JavaEasy
07Path with Maximum SumLeetCode 124JavaHard

09. Two Heaps

#TitleQuestionSolutionDifficulty
01Find the Median of a Number StreamLeetCode 295JavaHard
02Sliding Window MedianLeetCode 480JavaHard
03Maximize CapitalHard
04Next IntervalHard

10. Subsets

#TitleQuestionSolutionDifficulty
01SubsetsLeetCode 78JavaMedium
02Subsets With DuplicatesLeetCode 90JavaMedium
03PermutationsMedium
04String Permutations by changing caseMedium
05Balanced ParenthesesHard
06Unique Generalized AbbreviationsHard

11. Modified Binary Search

#TitleQuestionSolutionDifficulty
01Order-agnostic Binary SearchLeetCode 704JavaEasy
02Ceiling of a NumberGeeksforGeeksJavaMedium
Floor of a NumberGeeksforGeeksJavaMedium
03Next LetterJavaMedium
04Number RangeMedium
05Search in a Sorted Infinite ArrayMedium
06Minimum Difference ElementMedium
07Bitonic Array MaximumJavaEasy
08Search Bitonic ArrayJavaMedium
09Search in Rotated ArrayMedium
10Rotation CountMedium

12. Top 'K' Elements

#TitleQuestionSolutionDifficulty
01Top 'K' NumbersGeeksforGeeksJavaEasy
02Kth Smallest NumberGeeksforGeeksJavaEasy
03'K' Closest Points to the OriginLeetCode 973JavaMedium
04Connect RopesJavaEasy
05Top 'K' Frequent NumbersLeetCode 347JavaMedium
06Frequency SortLeetCode 451JavaMedium
07Kth Largest Number in a StreamMedium
08'K' Closest NumbersMedium
09Maximum Distinct ElementsMedium
10Sum of ElementsMedium
11Rearrange StringMedium

13. K-way Merge

#TitleQuestionSolutionDifficulty
01Merge K Sorted ListsLeetCode 23JavaHard
02Kth Smallest Number in M Sorted ListsJavaMedium
03Kth Smallest Number in a Sorted MatrixLeetCode 378JavaHard
04Smallest Number RangeHard
05K Pairs with Largest SumsJavaHard

14. 0/1 Knapsack (Dynamic Programming)

#TitleQuestionSolutionDifficulty
010/1 Knapsack RecursiveJavaMedium
0/1 Knapsack Top-DownJavaMedium
02Equal Subset Sum PartitionMedium
03Subset SumMedium
04Minimum Subset Sum DifferenceHard

About

original repo (713junc/coding-interview)

Resources

Stars

4 stars

Watchers

0 watching

Forks

Contributors

Languages