No. | Title | Tag | Solution | Difficulty | UnitTest | Post |
---|---|---|---|---|---|---|
0001 | Two Sum | Array, Dictionary | TwoSum | Easy | π‘ | π |
0002 | Add Two Numbers | Linked List, Recursion | AddTwoNumbers | Medium | π‘ | |
0003 | Longest Substring Without Repeating Characters | String | LengthOfLongestSubstring | Medium | π‘ | |
0004 | Array | Hard | ||||
0005 | Longest Palindromic Substring | String | LongestPalindrome | Medium | π‘ | |
0006 | ||||||
0007 | Reverse Integer | Array.Reverse, string.Contains, string.Replace | Reverse | Easy | π‘ | |
0008 | ||||||
0009 | Palindrome Number | %,/ | IsPalindrome | Easy | π‘ | π |
0010 | ||||||
0011 | Container With Most Water | Array, Two Pointers, Greedy | Medium | π‘ | ||
0012 | ||||||
0013 | Roman to Integer | Dictionary | RomanToInt | Easy | π‘ | π |
0014 | Longest Common Prefix | Array | LongestCommonPrefix | Easy | π‘ | π |
0015 | 3Sum | Array | ThreeSum | Medium | π‘ | |
0016 | 3Sum Closest | Array | ThreeSumClosest | Medium | π‘ | |
0017 | ||||||
0018 | 4Sum | Array, HashSet, Binary Search | FourSum | Medium | π‘ | |
0019 | Remove Nth Node From End of List | Linked List | RemoveNthFromEnd | Medium | π‘ | |
0020 | Valid Parentheses | Stack | IsValid | Easy | π‘ | π |
0021 | Merge Two Sorted Lists | Linked List | MergeTwoLists | Easy | π‘ | π |
0022 | ||||||
0023 | ||||||
0024 | Swap Nodes in Pairs | Linked List | SwapPairs | Medium | π‘ | |
0025 | Reverse Nodes in k-Group | Linked List | ReverseKGroup | Hard | π‘ | |
0026 | Remove Duplicates from Sorted Array | Array | RemoveDuplicates | Easy | π‘ | π |
0027 | Remove Element | Array | RemoveElement | Easy | π‘ | π |
0028 | Implement strStr() | string.Contains | StrStr | Easy | π‘ | |
0029 | ||||||
0030 | ||||||
0031 | Array | Medium | ||||
0032 | Longest Valid Parentheses | Stack | LongestValidParentheses | Hard | π‘ | |
0033 | Array | Medium | ||||
0034 | Array | Medium | ||||
0035 | Search Insert Position | Binary Search, Array | SearchInsert | Easy | π‘ | π |
0036 | Valid Sudoku | Hash Set, Array | ValidSudoku | Medium | π‘ | |
0037 | Sudoku Solver | Array, Backtracking | SolveSuduku | Hard | π‘ | |
0038 | ||||||
0039 | Array | Medium | ||||
0040 | Array, Backtracking | Medium | ||||
0041 | Array | Hard | ||||
0042 | Array | Hard | ||||
0043 | Multiply Strings | String | Multiply | Medium | π‘ | |
0044 | ||||||
0045 | Jump Game II | Array, DP, Greedy | Medium | π‘ | ||
0046 | Permutations | Array, Backtracking | Permute | Medium | π‘ | |
0047 | Array | Medium | ||||
0048 | Rotate Image | Array, Matrix | Rotate | Medium | ||
0049 | Group Anagrams | String | GroupAnagrams | Medium | π‘ | |
0050 | ||||||
0051 | Array | Hard | ||||
0052 | ||||||
0053 | Maximum Subarray | Array | MaxSubArray | Easy | π‘ | |
0054 | Array | Medium | ||||
0055 | Array | Medium | ||||
0056 | Merge Intervals | Array | Merge | Medium | π‘ | |
0057 | Array | Medium | ||||
0058 | Length of Last Word | String | LengthOfLastWord | Easy | π‘ | π |
0059 | Spiral Matrix II | Array, Matrix | GenerateMatrix | Medium | π‘ | |
0060 | ||||||
0061 | ||||||
0062 | ||||||
0063 | Array | Medium | ||||
0064 | Array | Medium | ||||
0065 | ||||||
0066 | Plus One | Array | PlusOne | Easy | π‘ | π |
0067 | Add Binary | Bit Manipulation | AddBinary | Easy | π‘ | π |
0068 | Array | Hard | ||||
0069 | Sqrt(x) | Enumeration | MySqrt | Easy | π‘ | |
0070 | Climbing Stairs | Fibonacci, DP | ClimbStairs | Easy | π‘ | |
0071 | ||||||
0072 | ||||||
0073 | Array | Medium | ||||
0074 | Search a 2D Matrix | Array | SearchMatrix | Medium | π‘ | |
0075 | Sort Colors | Array, Sorting | SortColors | Medium | ||
0076 | ||||||
0077 | Combinations | Backtracking | Combine | Medium | π‘ | |
0078 | Array | Medium | ||||
0079 | Array | Medium | ||||
0080 | Array | Medium | ||||
0081 | Array | Medium | ||||
0082 | Remove Duplicates from Sorted List II | Linked List | DeleteDuplicates | Medium | π‘ | |
0083 | Remove Duplicates from Sorted List | Linked List | DeleteDuplicates | Easy | π‘ | π |
0084 | Array | Hard | ||||
0085 | Array | Hard | ||||
0086 | ||||||
0087 | ||||||
0088 | Merge Sorted Array | Array | Merge | Easy | ||
0089 | ||||||
0090 | Array | Medium | ||||
0091 | ||||||
0092 | ||||||
0093 | ||||||
0094 | Binary Tree Inorder Traversal | Tree, DFS, Binary Tree | InorderTraversal | Easy | β | π |
0095 | ||||||
0096 | ||||||
0097 | ||||||
0098 | ||||||
0099 | ||||||
0100 | Same Tree | Tree, DFS, BFS, Binary Tree | IsSameTree | Easy | β | π |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0101 | Symmetric Tree | Tree, DFS, BFS, Binary Tree | IsSymmetric | Easy | β |
0102 | Binary Tree Level Order Traversal | Tree, BFS, Binary Tree | LevelOrder | Medium | |
0103 | |||||
0104 | Maximum Depth of Binary Tree | Tree, DFS, BFS, Binary Tree | MaxDepth | Easy | |
0105 | Construct Binary Tree from Preorder and Inorder Traversal | Array, Tree, Binary Tree | BuildTree | Medium | |
0106 | |||||
0107 | |||||
0108 | Convert Sorted Array to Binary Search Tree | Array, Tree | SortedArrayToBST | Easy | |
0109 | |||||
0110 | |||||
0111 | Minimum Depth of Binary Tree | Tree, DFS, BFS, Binary Tree | MinDepth | Easy | |
0112 | |||||
0113 | Path Sum II | Tree, DFS, Binary Tree | PathSum | Medium | |
0114 | Flatten Binary Tree to Linked List | Tree, DFS, Binary Tree | Flatten | Medium | |
0115 | |||||
0116 | Populating Next Right Pointers in Each Node | Linked List, Tree, DFS, BFS, Binary Tree | Connect | Medium | |
0117 | |||||
0118 | Pascal's Triangle | Array, DP | Generate | Easy | π‘ |
0119 | Pascal's Triangle II | Array, DP | GetRow | Easy | π‘ |
0120 | Triangle | Array, DP | MinimumTotal | Medium | π‘ |
0121 | Best Time to Buy and Sell Stock | DP | MaxProfit | Easy | π‘ |
0122 | |||||
0123 | |||||
0124 | |||||
0125 | Valid Palindrome | Binary Search | IsPalindrome | Easy | π‘ |
0126 | |||||
0127 | |||||
0128 | |||||
0129 | |||||
0130 | |||||
0131 | |||||
0132 | |||||
0133 | |||||
0134 | |||||
0135 | |||||
0136 | Single Number | Array, Bit Manipulation, XOR | SingleNumber | Easy | π‘ |
0137 | |||||
0138 | |||||
0139 | |||||
0140 | |||||
0141 | Linked List Cycle | Linked List, Two Pointers | HasCycle | Easy | β |
0142 | Linked List Cycle II | Linked List, HastSet | DetectCycle | Medium | |
0143 | Reorder List | Linked List | ReorderList | Medium | |
0144 | Binary Tree Preorder Traversal | Tree, DFS, Binary Tree | PreorderTraversal | Easy | |
0145 | Binary Tree Postorder Traversal | Tree, DFS, Binary Tree | PostorderTraversal | Easy | |
0146 | |||||
0147 | |||||
0148 | |||||
0149 | |||||
0150 | |||||
0151 | |||||
0152 | |||||
0153 | |||||
0154 | |||||
0155 | Min Stack | Stack | MinStack | Easy | |
0156 | |||||
0157 | |||||
0158 | |||||
0159 | |||||
0160 | Intersection of Two Linked Lists | Linked List, Two Pointers | GetIntersectionNode | Easy | |
0161 | |||||
0162 | Find Peak Element | Array | FindPeakElement | Medium | π‘ |
0163 | |||||
0164 | |||||
0165 | |||||
0166 | |||||
0167 | Two Sum II - Input array is sorted | Array, Binary Search | TwoSum | Medium | π‘ |
0168 | Excel Sheet Column Title | Array, char | ConvertToTitle | Easy | π‘ |
0169 | Majority Element | Array, Dictionary | MajorityElement | Easy | π‘ |
0170 | |||||
0171 | |||||
0172 | Factorial Trailing Zeroes | Enumeration | TrailingZeroes | Easy | π‘ |
0173 | Binary Search Tree Iterator | Stack, Tree | BSTIterator | Medium | |
0174 | |||||
0175 | |||||
0176 | |||||
0177 | |||||
0178 | |||||
0179 | |||||
0180 | |||||
0181 | |||||
0182 | |||||
0183 | |||||
0184 | |||||
0185 | |||||
0186 | |||||
0187 | Repeated DNA Sequences | String, Hash Table | FindRepeatedDnaSequences | Medium | π‘ |
0188 | |||||
0189 | Rotate Array | Array | Rotate | Medium | |
0190 | Reverse Bits | Bit Manipulation | reverseBits | Easy | |
0191 | Number of 1 Bits | Bit Manipulation | HammingWeight | Easy | |
0192 | |||||
0193 | |||||
0194 | |||||
0195 | |||||
0196 | |||||
0197 | |||||
0198 | House Robber | Array, DP | Rob | Medium | π‘ |
0199 | Binary Tree Right Side View | Tree, DFS, BFS, Binary Tree | RightSideView | Medium | |
0200 |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0326 | Power of Three | Remainder(%) Operator | IsPowerOfThree | Easy | π‘ |
0334 | Increasing Triplet Subsequence | Array | IncreasingTriplet | Medium | π‘ |
0338 | Bit Manipulation, DP | Easy | |||
0342 | Bit Manipulation, Recursion | Easy | |||
0344 | Reverse String | String | ReverseString | Easy | |
0347 | Top K Frequent Elements | Array | TopKFrequent | Medium | π‘ |
0350 | |||||
0378 | Kth Smallest Element in a Sorted Matrix | Binary Search, Matrix | KthSmallest | Medium | π‘ |
0383 | |||||
0387 | First Unique Character in a String | Dictionary | FirstUniqChar | Easy | π‘ |
0389 | Find the Difference | Bit Manipulation, XOR | FindTheDifference | Easy | π‘ |
0392 | Is Subsequence | Two Pointers, DP | IsSubsequence | Easy | π‘ |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0401 | Bit Manipulation | Easy | |||
0404 | Sum of Left Leaves | Tree, DFS, BFS, Binary Tree | SumOfLeftLeaves | Easy | |
0405 | Bit Manipulation | Easy | |||
0409 | Longest Palindrome | String, Stack, Dictionary | LongestPalindrome | Easy | π‘ |
0415 | Add Strings | AddStrings | Easy | π‘ | |
0450 | Delete Node in a BST | Tree, BST, Binary Tree | DeleteNode | Medium | |
0451 | Sort Characters By Frequency | String, Dictionary | FrequencySort | Medium | π‘ |
0461 | Bit Manipulation | Easy | |||
0476 | Number Complement | Bit Manipulation | FindComplement | Easy | π‘ |
0485 | Max Consecutive Ones | FindMaxConsecutiveOnes | Easy | π‘ | |
0500 |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0509 | Fibonacci Number | Fibonacci, Recursion, DP | Fib | Easy | π‘ |
0542 | 01 Matrix | Array, DP, BFS, Matrix | UpdateMatrix | Medium | π‘ |
0557 | Reverse Words in a String III | Array, String | ReverseWords | Easy | π‘ |
0560 | Subarray Sum Equals K | Array, Dictionary | SubarraySum | Medium | π‘ |
0566 | Reshape the Matrix | Array, Matrix | MatrixReshape | Medium | π‘ |
0567 | Permutation in String | String | CheckInclusion | Medium | π‘ |
0589 | N-ary Tree Preorder Traversal | Tree | Preorder | Easy |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0611 | Valid Triangle Number | Binary Search | TriangleNumber | Medium | π‘ |
0617 | Merge Two Binary Trees | Tree, DFS, BFS, Binary Tree | MergeTrees | Easy | |
0645 | Array, Bit Manipulation | Easy | |||
0653 | Two Sum IV - Input is a BST | Tree, DFS, BFS, Binary Tree | FindTarget | Easy | |
0682 | Baseball Game | Stack | CalPoints | Easy | π‘ |
0695 | Max Area of Island | Array, DFS, BFS, Matrix | MaxAreaOfIsland | Medium | π‘ |
0693 | Bit Manipulation | Easy | |||
0700 | Search in a Binary Search Tree | Tree, Binary Tree | SearchBST | Easy |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0701 | Insert into a Binary Search Tree | Tree, BST, Binary Tree | InsertIntoBST | Medium | |
0704 | Binary Search | Array, Binary Tree | Search | Easy | π‘ |
0705 | Array, Linked List | Easy | |||
0706 | Design HashMap | Array, Hash Table, Linked List | MyHashMap | Easy | |
0707 | Design Linked List | Linked List | MyLinkedList | Medium | |
0709 | To Lower Case | Char | ToLowerCase | Easy | π‘ |
0717 | 1-bit and 2-bit Characters | Array | IsOneBitCharacter | Easy | π‘ |
0718 | Maximum Length of Repeated Subarray | Array, Matrix | FindLength | Medium | π‘ |
0728 | Self Dividing Numbers | Remainder(%) operator | SelfDividingNumbers | Easy | π‘ |
0733 | Flood Fill | Array, DFS, BFS, Matrix | FloodFill | Easy | π‘ |
0746 | Array, DP | Easy | |||
0762 | Bit Manipulation | Easy | |||
0771 | Jewels and Stones | string.Contains | NumJewelsInStones | Easy | π‘ |
0784 | Letter Case Permutation | String, Backtracking, BitManipulation | LetterCasePermutation | Medium | π‘ |
0791 | Custom Sort String | Dictionary, Hash Table | β CustomSortString | Medium | π‘ |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0824 | Goat Latin | DP | ToGoatLatin | Easy | π‘ |
0841 | Keys and Rooms | DFS, BFS, Graph | CanVisitAllRooms | Medium | π‘ |
0852 | Peak Index in a Mountain Array | Array | PeakIndexInMountainArray | Easy | π‘ |
0868 | Bit Manipulation | Easy | |||
0876 | Middle of the Linked List | Linked List | MiddleNode | Easy | π‘ |
0897 | Increasing Order Search Tree | Tree, DFS, BFS, Binary Tree | IncreasingBST | Easy |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
0905 | Sort Array By Parity | Array | SortArrayByParity | Easy | π‘ |
0912 | Sort an Array | Quick Sort | SortArray | Medium | π‘ |
0917 | Reverse Only Letters | String | ReverseOnlyLetters | Easy | π‘ |
0938 | Range Sum of BST | Tree, DFS, BFS, Binary Tree | RangeSumBST | Easy | π‘ |
0961 | N-Repeated Element in Size 2N Array | Array | RepeatedNTimes | Easy | π‘ |
0977 | Squares of a Sorted Array | Quick Sort | SortedSquares | Easy | π‘ |
0994 | Rotting Oranges | Array, BFS, Matrix | OrangesRotting | Medium | π‘ |
0997 | Find the Town Judge | Array | FindJudge | Easy | π‘ |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
1022 | Sum of Root To Leaf Binary Numbers | Tree | SumRootToLeaf | Easy | |
1025 | DP | Easy | |||
1047 | Remove All Adjacent Duplicates In String | String | RemoveDuplicates | Easy | π‘ |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
1009 | Bit Manipulation | Easy | |||
1108 | Defanging an IP Address | String | DefangIPaddr | Easy | π‘ |
1137 | DP | Easy |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
1207 | Unique Number of Occurrences | Array | UniqueOccurrences | Easy | π‘ |
1220 | Count Vowels Permutation | DP | CountVowelPermutation | Hard | π‘ |
1221 | Split a String in Balanced Strings | String | BalancedStringSplit | Easy | π‘ |
1249 | Minimum Remove to Make Valid Parentheses | String | MinRemoveToMakeValid | Medium | π‘ |
1281 | Subtract the Product and Sum of Digits of an Integer | Enumeration, Remainder(%) operator | SubtractProductAndSum | Easy | π‘ |
1290 | Convert Binary Number in a Linked List to Integer | Linked List | GetDecimalValue | Easy | π‘ |
1295 | Find Numbers with Even Number of Digits | Array | FindNumbers | Easy | π‘ |
1299 | Replace Elements with Greatest Element on Right Side | Array | ReplaceElements | Easy | π‘ |
No. | Title | Tag | Solution | Difficulty | UnitTest |
---|---|---|---|---|---|
2001 | Array | Medium | |||
2006 | Count Number of Pairs With Absolute Difference K | Array | CountKDifference | Easy | π‘ |
2095 | Delete the Middle Node of a Linked List | Linked List | DeleteMiddle | Medium | π‘ |
2206 | Array, Bit Manipulation | Easy | |||
2220 | Bit Manipulation | Easy | |||
2239 | |||||
2248 |