- Notifications
You must be signed in to change notification settings - Fork4
Kotlin-based LeetCode algorithm problem solutions, regularly updated.
License
NotificationsYou must be signed in to change notification settings
LeetCode-in-Kotlin/LeetCode-in-Kotlin.github.io
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
- Binary Search II
- Dynamic Programming I
- Programming Skills I
- Programming Skills II
- Graph Theory I
- SQL I
- Level 1
- Level 2
- Udemy
- Data Structure I
- Data Structure II
- Algorithm I
- Algorithm II
- Binary Search I
0209 | Minimum Size Subarray Sum | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 315 | 96.73 |
0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search | 318 | 82.28 |
0287 | Find the Duplicate Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation | 656 | 66.21 |
0240 | Search a 2D Matrix II | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer | 460 | 66.08 |
0275 | H-Index II | Medium | Array, Binary_Search | 398 | 81.82 |
0222 | Count Complete Tree Nodes |
0081 | Search in Rotated Sorted Array II | Medium | Array, Binary_Search | 352 | 42.31 |
0162 | Find Peak Element | Medium | Top_Interview_Questions, Array, Binary_Search | 297 | 53.85 |
0154 | Find Minimum in Rotated Sorted Array II | Hard | Array, Binary_Search | 275 | 84.00 |
0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 127 | 97.06 |
0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 156 | 92.24 |
0213 | House Robber II | Medium | Array, Dynamic_Programming | 257 | 59.62 |
0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 670 | 66.67 |
0045 | Jump Game II | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy | 227 | 98.14 |
0053 | Maximum Subarray | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer | 662 | 82.48 |
0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 253 | 88.42 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 609 | 94.06 |
0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 370 | 16.98 |
0309 | Best Time to Buy and Sell Stock with Cooldown | Medium | Array, Dynamic_Programming | 272 | 73.33 |
0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 197 | 87.17 |
0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack | 196 | 100.00 |
0091 | Decode Ways | Medium | Top_Interview_Questions, String, Dynamic_Programming | 237 | 76.88 |
0264 | Ugly Number II | Medium | Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue | 182 | 95.45 |
0096 | Unique Binary Search Trees | Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree | 147 | 88.52 |
0118 | Pascal's Triangle | Easy | Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22 |
0119 | Pascal's Triangle II | Easy | Array, Dynamic_Programming | 296 | 19.15 |
0120 | Triangle | Medium | Array, Dynamic_Programming | 194 | 97.87 |
0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum | 1373 | 85.71 |
0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics | 209 | 49.18 |
0063 | Unique Paths II | Medium | Array, Dynamic_Programming, Matrix | 187 | 84.62 |
0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix | 222 | 95.70 |
0221 | Maximal Square | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix | 614 | 44.00 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 323 | 75.48 |
0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search | 318 | 82.28 |
1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 307 | 38.36 |
0072 | Edit Distance | Hard | Top_100_Liked_Questions, String, Dynamic_Programming | 320 | 63.53 |
0322 | Coin Change | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search | 332 | 50.68 |
0343 | Integer Break | Medium | Dynamic_Programming, Math | 218 | 63.89 |
0279 | Perfect Squares | Medium | Top_Interview_Questions, Dynamic_Programming, Math, Breadth_First_Search | 176 | 98.80 |
0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation | 237 | 68.44 |
0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08 |
0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 516 | 79.07 |
0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 236 | 83.39 |
0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue | 258 | 70.86 |
0242 | Valid Anagram | Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65 |
0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49 |
0303 | Range Sum Query - Immutable | Easy | Array, Design, Prefix_Sum | 472 | 63.64 |
0028 | Find the Index of the First Occurrence in a String | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 257 | 32.35 |
0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 310 | 63.63 |
0150 | Evaluate Reverse Polish Notation | Medium | Top_Interview_Questions, Array, Math, Stack | 233 | 88.82 |
0066 | Plus One | Easy | Top_Interview_Questions, Array, Math | 303 | 35.18 |
0043 | Multiply Strings | Medium | String, Math, Simulation | 390 | 56.25 |
0067 | Add Binary | Easy | String, Math, Bit_Manipulation, Simulation | 327 | 32.67 |
0739 | Daily Temperatures | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack | 936 | 80.54 |
0058 | Length of Last Word | Easy | String | 243 | 63.33 |
0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix | 287 | 46.50 |
0054 | Spiral Matrix | Medium | Top_Interview_Questions, Array, Matrix, Simulation | 224 | 62.50 |
0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting | 506 | 86.55 |
0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 561 | 54.68 |
0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum | 1373 | 85.71 |
0143 | Reorder List | Medium | Two_Pointers, Stack, Linked_List, Recursion | 395 | 82.26 |
0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List | 274 | 80.58 |
0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion | 417 | 50.44 |
0061 | Rotate List | Medium | Two_Pointers, Linked_List | 193 | 92.16 |
0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 331 | 84.88 |
0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 252 | 95.41 |
0365 | Water and Jug Problem | Medium | Math, Depth_First_Search, Breadth_First_Search | 130 | 100.00 |
0127 | Word Ladder | Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 396 | 98.68 |
0183 | Customers Who Never Order | Easy | Database | 712 | 33.67 |
0196 | Delete Duplicate Emails | Easy | Database | 593 | 94.17 |
0176 | Second Highest Salary | Medium | Database | 219 | 92.54 |
0175 | Combine Two Tables | Easy | Database | 473 | 54.97 |
0197 | Rising Temperature | Easy | Database | 394 | 94.15 |
0182 | Duplicate Emails | Easy | Database | 396 | 68.40 |
0205 | Isomorphic Strings | Easy | String, Hash_Table | 278 | 79.96 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 176 | 96.25 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 279 | 45.78 |
0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List | 192 | 63.39 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 609 | 94.06 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 355 | 29.37 |
0278 | First Bad Version | Easy | Binary_Search, Interactive | 349 | 76.86 |
0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 330 | 41.38 |
0235 | Lowest Common Ancestor of a Binary Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 404 | 75.59 |
0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 252 | 95.41 |
0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 127 | 97.06 |
0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics | 209 | 49.18 |
0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 561 | 54.68 |
0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 234 | 92.75 |
0299 | Bulls and Cows | Medium | String, Hash_Table, Counting | 254 | 84.82 |
0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion | 224 | 64.86 |
0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08 |
0054 | Spiral Matrix | Medium | Top_Interview_Questions, Array, Matrix, Simulation | 224 | 62.50 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String | 209 | 88.86 |
0043 | Multiply Strings | Medium | String, Math, Simulation | 390 | 56.25 |
0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List | 180 | 91.58 |
0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion | 641 | 79.53 |
0328 | Odd Even Linked List | Medium | Top_Interview_Questions, Linked_List | 216 | 86.96 |
0148 | Sort List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort | 820 | 61.70 |
0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 233 | 54.90 |
0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 310 | 63.63 |
0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 307 | 43.93 |
0437 | Path Sum III | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 403 | 54.12 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix | 290 | 40.17 |
0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search | 184 | 86.08 |
0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 334 | 35.39 |
0230 | Kth Smallest Element in a BST | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 393 | 33.33 |
0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 |
0994 | Rotting Oranges | Medium | Array, Breadth_First_Search, Matrix | 308 | 57.93 |
0210 | Course Schedule II | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 266 | 96.32 |
0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 156 | 92.24 |
0322 | Coin Change | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search | 332 | 50.68 |
0416 | Partition Equal Subset Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming | 509 | 57.56 |
0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 253 | 88.42 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 258 | 91.09 |
0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers | 413 | 95.05 |
0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 346 | 85.20 |
0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 208 | 72.24 |
0101 | Symmetric Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 290 | 26.98 |
0199 | Binary Tree Right Side View | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 |
0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue | 258 | 70.86 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 331 | 84.88 |
0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie | 689 | 61.00 |
0057 | Insert Interval | Medium | Array | 257 | 99.52 |
0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting | 323 | 99.68 |
0227 | Basic Calculator II | Medium | Top_Interview_Questions, String, Math, Stack | 383 | 62.50 |
0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking | 317 | 86.85 |
0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking | 186 | 100.00 |
0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 344 | 83.63 |
0007 | Reverse Integer | Medium | Top_Interview_Questions, Math | 245 | 60.32 |
0009 | Palindrome Number | Easy | Math | 238 | 96.24 |
0172 | Factorial Trailing Zeroes | Medium | Top_Interview_Questions, Math | 220 | 67.65 |
0050 | Pow(x, n) | Medium | Top_Interview_Questions, Math, Recursion | 264 | 52.98 |
0344 | Reverse String | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 445 | 69.75 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String | 209 | 88.86 |
0187 | Repeated DNA Sequences | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 319 | 79.03 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 258 | 91.09 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack | 226 | 72.53 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 323 | 75.48 |
0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion | 224 | 64.86 |
0242 | Valid Anagram | Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65 |
0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting | 506 | 86.55 |
0151 | Reverse Words in a String | Medium | String, Two_Pointers | 206 | 98.90 |
0273 | Integer to English Words | Hard | String, Math, Recursion | 273 | 82.93 |
0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search | 184 | 86.08 |
0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search | 262 | 60.96 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 609 | 94.06 |
0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 516 | 79.07 |
0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 234 | 92.75 |
0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49 |
0058 | Length of Last Word | Easy | String | 243 | 63.33 |
0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 370 | 16.98 |
0080 | Remove Duplicates from Sorted Array II | Medium | Array, Two_Pointers | 357 | 44.78 |
0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers | 483 | 86.95 |
0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 670 | 66.67 |
0075 | Sort Colors | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 198 | 85.66 |
0066 | Plus One | Easy | Top_Interview_Questions, Array, Math | 303 | 35.18 |
0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum | 669 | 48.96 |
0041 | First Missing Positive | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 345 | 100.00 |
0239 | Sliding Window Maximum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 1059 | 86.14 |
0125 | Valid Palindrome | Easy | Top_Interview_Questions, String, Two_Pointers | 353 | 52.06 |
0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, Two_Pointers | 361 | 77.19 |
0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack | 196 | 100.00 |
0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 761 | 90.55 |
0053 | Maximum Subarray | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer | 662 | 82.48 |
0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer | 460 | 51.25 |
0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum | 1373 | 85.71 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix | 290 | 40.17 |
0054 | Spiral Matrix | Medium | Top_Interview_Questions, Array, Matrix, Simulation | 224 | 62.50 |
0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix | 287 | 46.50 |
0073 | Set Matrix Zeroes | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix | 255 | 100.00 |
0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting | 323 | 99.68 |
0114 | Flatten Binary Tree to Linked List | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List | 191 | 93.10 |
0328 | Odd Even Linked List | Medium | Top_Interview_Questions, Linked_List | 216 | 86.96 |
0061 | Rotate List | Medium | Two_Pointers, Linked_List | 193 | 92.16 |
0024 | Swap Nodes in Pairs | Medium | Top_100_Liked_Questions, Linked_List, Recursion | 149 | 99.39 |
0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List | 192 | 63.39 |
0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 223 | 91.85 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 279 | 45.78 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 176 | 96.25 |
0160 | Intersection of Two Linked Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 262 | 83.50 |
0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion | 641 | 79.53 |
0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List | 274 | 80.58 |
0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion | 194 | 87.72 |
0146 | LRU Cache | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List | 1116 | 97.93 |
0144 | Binary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 277 | 37.90 |
0094 | Binary Tree Inorder Traversal | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack | 269 | 38.80 |
0145 | Binary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 211 | 80.00 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 355 | 29.37 |
0103 | Binary Tree Zigzag Level Order Traversal | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 316 | 34.25 |
0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 334 | 35.39 |
0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 307 | 43.93 |
0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 208 | 72.24 |
0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 233 | 54.90 |
0111 | Minimum Depth of Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 525 | 90.51 |
0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 236 | 83.39 |
0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 310 | 63.63 |
0297 | Serialize and Deserialize Binary Tree | Hard | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85 |
0124 | Binary Tree Maximum Path Sum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 331 | 74.42 |
0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 330 | 41.38 |
0337 | House Robber III | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 282 | 84.62 |
0236 | Lowest Common Ancestor of a Binary Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree | 386 | 45.21 |
0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie | 689 | 61.00 |
0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 252 | 95.41 |
0133 | Clone Graph | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 351 | 60.91 |
0120 | Triangle | Medium | Array, Dynamic_Programming | 194 | 97.87 |
0118 | Pascal's Triangle | Easy | Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22 |
0119 | Pascal's Triangle II | Easy | Array, Dynamic_Programming | 296 | 19.15 |
0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 197 | 87.17 |
0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 253 | 88.42 |
0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 156 | 92.24 |
0213 | House Robber II | Medium | Array, Dynamic_Programming | 257 | 59.62 |
0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 127 | 97.06 |
0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix | 222 | 95.70 |
0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search | 318 | 82.28 |
1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 307 | 38.36 |
0072 | Edit Distance | Hard | Top_100_Liked_Questions, String, Dynamic_Programming | 320 | 63.53 |
0044 | Wildcard Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 401 | 86.11 |
0010 | Regular Expression Matching | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion | 292 | 58.58 |
0022 | Generate Parentheses | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking | 210 | 78.51 |
0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking | 317 | 86.85 |
0216 | Combination Sum III | Medium | Array, Backtracking | 175 | 90.91 |
0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking | 353 | 30.14 |
0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking | 262 | 73.59 |
0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking | 186 | 100.00 |
0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation | 237 | 68.44 |
0190 | Reverse Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82 |
0338 | Counting Bits | Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation | 186 | 99.26 |
0029 | Divide Two Integers | Medium | Top_Interview_Questions, Math, Bit_Manipulation | 281 | 31.67 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 331 | 84.88 |
0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49 |
0053 | Maximum Subarray | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer | 662 | 82.48 |
0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 234 | 92.75 |
0088 | Merge Sorted Array | Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 311 | 33.40 |
0350 | Intersection of Two Arrays II | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 321 | 73.37 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 609 | 94.06 |
0118 | Pascal's Triangle | Easy | Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22 |
0036 | Valid Sudoku | Medium | Top_Interview_Questions, Array, Hash_Table, Matrix | 346 | 65.03 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix | 290 | 40.17 |
0242 | Valid Anagram | Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65 |
0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 223 | 91.85 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 176 | 96.25 |
0203 | Remove Linked List Elements | Easy | Linked_List, Recursion | 233 | 91.22 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 279 | 45.78 |
0083 | Remove Duplicates from Sorted List | Easy | Linked_List | 274 | 77.82 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack | 226 | 72.53 |
0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue | 258 | 70.86 |
0144 | Binary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 277 | 37.90 |
0094 | Binary Tree Inorder Traversal | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack | 269 | 38.80 |
0145 | Binary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 211 | 80.00 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 355 | 29.37 |
0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 236 | 83.39 |
0101 | Symmetric Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 290 | 26.98 |
0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 233 | 54.90 |
0112 | Path Sum | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 322 | 36.41 |
0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 330 | 41.38 |
0235 | Lowest Common Ancestor of a Binary Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 404 | 75.59 |
0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 344 | 83.63 |
0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer | 460 | 51.25 |
0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 761 | 90.55 |
0075 | Sort Colors | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 198 | 85.66 |
0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting | 323 | 99.68 |
0119 | Pascal's Triangle II | Easy | Array, Dynamic_Programming | 296 | 19.15 |
0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix | 287 | 46.50 |
0059 | Spiral Matrix II | Medium | Array, Matrix, Simulation | 153 | 100.00 |
0240 | Search a 2D Matrix II | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer | 460 | 66.08 |
0334 | Increasing Triplet Subsequence | Medium | Top_Interview_Questions, Array, Greedy | 672 | 60.61 |
0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum | 669 | 48.96 |
0560 | Subarray Sum Equals K | Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum | 692 | 53.27 |
0290 | Word Pattern | Easy | String, Hash_Table | 177 | 89.55 |
0763 | Partition Labels | Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers | 235 | 84.75 |
0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting | 506 | 86.55 |
0043 | Multiply Strings | Medium | String, Math, Simulation | 390 | 56.25 |
0187 | Repeated DNA Sequences | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 319 | 79.03 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 323 | 75.48 |
0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion | 417 | 50.44 |
0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List | 192 | 63.39 |
0160 | Intersection of Two Linked Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 262 | 83.50 |
0082 | Remove Duplicates from Sorted List II | Medium | Two_Pointers, Linked_List | 241 | 91.04 |
0024 | Swap Nodes in Pairs | Medium | Top_100_Liked_Questions, Linked_List, Recursion | 149 | 99.39 |
0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion | 194 | 87.72 |
0143 | Reorder List | Medium | Two_Pointers, Stack, Linked_List, Recursion | 395 | 82.26 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 331 | 84.88 |
0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 334 | 35.39 |
0105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 370 | 58.31 |
0103 | Binary Tree Zigzag Level Order Traversal | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 316 | 34.25 |
0199 | Binary Tree Right Side View | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 |
0113 | Path Sum II | Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 364 | 78.67 |
0230 | Kth Smallest Element in a BST | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 393 | 33.33 |
0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 |
0236 | Lowest Common Ancestor of a Binary Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree | 386 | 45.21 |
0297 | Serialize and Deserialize Binary Tree | Hard | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85 |
0215 | Kth Largest Element in an Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect | 839 | 34.43 |
0347 | Top K Frequent Elements | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort | 268 | 99.74 |
0278 | First Bad Version | Easy | Binary_Search, Interactive | 349 | 76.86 |
0035 | Search Insert Position | Easy | Top_100_Liked_Questions, Array, Binary_Search | 267 | 50.32 |
0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers | 483 | 86.95 |
0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 516 | 79.07 |
0167 | Two Sum II - Input Array Is Sorted | Medium | Array, Binary_Search, Two_Pointers | 403 | 68.74 |
0344 | Reverse String | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 445 | 69.75 |
0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List | 180 | 91.58 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 258 | 91.09 |
0116 | Populating Next Right Pointers in Each Node | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 355 | 69.02 |
0994 | Rotting Oranges | Medium | Array, Breadth_First_Search, Matrix | 308 | 57.93 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 176 | 96.25 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 279 | 45.78 |
0077 | Combinations | Medium | Backtracking | 244 | 100.00 |
0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking | 186 | 100.00 |
0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 127 | 97.06 |
0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 156 | 92.24 |
0120 | Triangle | Medium | Array, Dynamic_Programming | 194 | 97.87 |
0231 | Power of Two | Easy | Math, Bit_Manipulation, Recursion | 161 | 86.81 |
0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation | 237 | 68.44 |
0190 | Reverse Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82 |
0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 344 | 83.63 |
0034 | Find First and Last Position of Element in Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search | 228 | 83.38 |
0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search | 184 | 86.08 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix | 290 | 40.17 |
0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search | 262 | 60.96 |
0162 | Find Peak Element | Medium | Top_Interview_Questions, Array, Binary_Search | 297 | 53.85 |
0082 | Remove Duplicates from Sorted List II | Medium | Two_Pointers, Linked_List | 241 | 91.04 |
0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 761 | 90.55 |
0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers | 474 | 89.18 |
0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 561 | 54.68 |
0209 | Minimum Size Subarray Sum | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 315 | 96.73 |
0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 252 | 95.41 |
0117 | Populating Next Right Pointers in Each Node II | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 199 | 94.67 |
0130 | Surrounded Regions | Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 355 | 84.42 |
0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking | 353 | 30.14 |
0090 | Subsets II | Medium | Array, Bit_Manipulation, Backtracking | 366 | 58.09 |
0047 | Permutations II | Medium | Array, Backtracking | 406 | 76.36 |
0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking | 317 | 86.85 |
0040 | Combination Sum II | Medium | Array, Backtracking | 348 | 80.92 |
0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking | 262 | 73.59 |
0022 | Generate Parentheses | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking | 210 | 78.51 |
0079 | Word Search | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking | 463 | 68.49 |
0213 | House Robber II | Medium | Array, Dynamic_Programming | 257 | 59.62 |
0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 670 | 66.67 |
0045 | Jump Game II | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy | 227 | 98.14 |
0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics | 209 | 49.18 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 323 | 75.48 |
0091 | Decode Ways | Medium | Top_Interview_Questions, String, Dynamic_Programming | 237 | 76.88 |
0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization | 197 | 87.17 |
0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search | 318 | 82.28 |
1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 307 | 38.36 |
0072 | Edit Distance | Hard | Top_100_Liked_Questions, String, Dynamic_Programming | 320 | 63.53 |
0322 | Coin Change | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search | 332 | 50.68 |
0343 | Integer Break | Medium | Dynamic_Programming, Math | 218 | 63.89 |
0201 | Bitwise AND of Numbers Range | Medium | Bit_Manipulation | 368 | 80.00 |
0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08 |
0149 | Max Points on a Line | Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry | 307 | 83.33 |
0035 | Search Insert Position | Easy | Top_100_Liked_Questions, Array, Binary_Search | 267 | 50.32 |
0367 | Valid Perfect Square | Easy | Math, Binary_Search | 137 | 94.55 |
0069 | Sqrt(x) | Easy | Top_Interview_Questions, Math, Binary_Search | 153 | 95.75 |
0278 | First Bad Version | Easy | Binary_Search, Interactive | 349 | 76.86 |
0034 | Find First and Last Position of Element in Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search | 228 | 83.38 |
0167 | Two Sum II - Input Array Is Sorted | Medium | Array, Binary_Search, Two_Pointers | 403 | 68.74 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix | 290 | 40.17 |
0350 | Intersection of Two Arrays II | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 321 | 73.37 |
0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search | 184 | 86.08 |
0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search | 262 | 60.96 |
# | Title | Difficulty | Tag | Time, ms | Time, % |
---|---|---|---|---|---|
1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming | 307 | 38.36 |
0994 | Rotting Oranges | Medium | Array, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Level_2_Day_10_Graph/BFS/DFS | 308 | 57.93 |
0864 | Shortest Path to Get All Keys | Hard | Breadth_First_Search, Bit_Manipulation | 176 | 100.00 |
0763 | Partition Labels | Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String | 235 | 84.75 |
0739 | Daily Temperatures | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_6 | 936 | 80.54 |
0647 | Palindromic Substrings | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 266 | 67.83 |
0560 | Subarray Sum Equals K | Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array | 692 | 53.27 |
0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue | 307 | 43.93 |
0494 | Target Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Backtracking | 308 | 89.61 |
0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer | 561 | 54.68 |
0437 | Path Sum III | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree | 403 | 54.12 |
0416 | Partition Equal Subset Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming | 509 | 57.56 |
0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings | 224 | 64.86 |
0378 | Kth Smallest Element in a Sorted Matrix | Medium | Top_Interview_Questions, Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue | 522 | 59.78 |
0368 | Largest Divisible Subset | Medium | Array, Dynamic_Programming, Math, Sorting | 412 | 73.33 |
0367 | Valid Perfect Square | Easy | Math, Binary_Search, Binary_Search_I_Day_3 | 137 | 94.55 |
0365 | Water and Jug Problem | Medium | Math, Depth_First_Search, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search | 130 | 100.00 |
0363 | Max Sum of Rectangle No Larger Than K | Hard | Array, Dynamic_Programming, Binary_Search, Matrix, Ordered_Set | 243 | 100.00 |
0357 | Count Numbers with Unique Digits | Medium | Dynamic_Programming, Math, Backtracking | 104 | 100.00 |
0355 | Design Twitter | Medium | Hash_Table, Design, Heap_Priority_Queue, Linked_List | 288 | 68.75 |
0354 | Russian Doll Envelopes | Hard | Array, Dynamic_Programming, Sorting, Binary_Search | 788 | 100.00 |
0352 | Data Stream as Disjoint Intervals | Hard | Binary_Search, Design, Ordered_Set | 905 | 75.00 |
0350 | Intersection of Two Arrays II | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Data_Structure_I_Day_3_Array, Binary_Search_I_Day_10 | 321 | 73.37 |
0349 | Intersection of Two Arrays | Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 346 | 66.99 |
0347 | Top K Frequent Elements | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue | 268 | 99.74 |
0345 | Reverse Vowels of a String | Easy | String, Two_Pointers | 349 | 80.63 |
0344 | Reverse String | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion, Algorithm_I_Day_4_Two_Pointers, Udemy_Strings | 445 | 69.75 |
0343 | Integer Break | Medium | Dynamic_Programming, Math, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_21 | 218 | 63.89 |
0342 | Power of Four | Easy | Math, Bit_Manipulation, Recursion | 150 | 92.11 |
0338 | Counting Bits | Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Udemy_Bit_Manipulation | 186 | 99.26 |
0337 | House Robber III | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue | 282 | 84.62 |
0336 | Palindrome Pairs | Hard | Array, String, Hash_Table, Trie | 2451 | 67.33 |
0335 | Self Crossing | Hard | Array, Math, Geometry | 477 | 100.00 |
0334 | Increasing Triplet Subsequence | Medium | Top_Interview_Questions, Array, Greedy, Data_Structure_II_Day_5_Array | 672 | 60.61 |
0332 | Reconstruct Itinerary | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 240 | 93.88 |
0331 | Verify Preorder Serialization of a Binary Tree | Medium | String, Tree, Binary_Tree, Stack | 335 | 70.00 |
0330 | Patching Array | Hard | Array, Greedy | 201 | 100.00 |
0329 | Longest Increasing Path in a Matrix | Hard | Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Graph, Memoization, Topological_Sort | 322 | 92.65 |
0328 | Odd Even Linked List | Medium | Top_Interview_Questions, Linked_List, Level_2_Day_4_Linked_List, Udemy_Linked_List | 216 | 86.96 |
0327 | Count of Range Sum | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 638 | 100.00 |
0326 | Power of Three | Easy | Top_Interview_Questions, Math, Recursion | 413 | 76.12 |
0324 | Wiggle Sort II | Medium | Top_Interview_Questions, Array, Sorting, Divide_and_Conquer, Quickselect | 545 | 57.14 |
0322 | Coin Change | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20, Level_2_Day_12_Dynamic_Programming | 332 | 50.68 |
0321 | Create Maximum Number | Hard | Greedy, Stack, Monotonic_Stack | 209 | 100.00 |
0319 | Bulb Switcher | Medium | Math, Brainteaser | 214 | 77.78 |
0318 | Maximum Product of Word Lengths | Medium | Array, String, Bit_Manipulation | 477 | 100.00 |
0316 | Remove Duplicate Letters | Medium | String, Greedy, Stack, Monotonic_Stack | 291 | 81.82 |
0315 | Count of Smaller Numbers After Self | Hard | Top_Interview_Questions, Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 1282 | 88.46 |
0313 | Super Ugly Number | Medium | Array, Dynamic_Programming, Math | 330 | 100.00 |
0312 | Burst Balloons | Hard | Array, Dynamic_Programming | 210 | 100.00 |
0310 | Minimum Height Trees | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 521 | 97.56 |
0309 | Best Time to Buy and Sell Stock with Cooldown | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_8 | 272 | 73.33 |
0307 | Range Sum Query - Mutable | Medium | Array, Design, Segment_Tree, Binary_Indexed_Tree | 1729 | 78.79 |
0306 | Additive Number | Medium | String, Backtracking | 289 | 22.22 |
0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum, Dynamic_Programming_I_Day_14, Programming_Skills_II_Day_13, Udemy_2D_Arrays/Matrix | 1373 | 85.71 |
0303 | Range Sum Query - Immutable | Easy | Array, Design, Prefix_Sum, Programming_Skills_I_Day_12_Class_and_Object | 472 | 63.64 |
0301 | Remove Invalid Parentheses | Hard | String, Breadth_First_Search, Backtracking | 312 | 100.00 |
0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18, Udemy_Dynamic_Programming | 318 | 82.28 |
0299 | Bulls and Cows | Medium | String, Hash_Table, Counting, Level_1_Day_13_Hashmap | 254 | 84.82 |
0297 | Serialize and Deserialize Binary Tree | Hard | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue | 475 | 78.85 |
0295 | Find Median from Data Stream | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream | 2289 | 33.60 |
0292 | Nim Game | Easy | Math, Game_Theory, Brainteaser | 129 | 94.29 |
0290 | Word Pattern | Easy | String, Hash_Table, Data_Structure_II_Day_7_String | 177 | 89.55 |
0289 | Game of Life | Medium | Top_Interview_Questions, Array, Matrix, Simulation | 174 | 96.97 |
0287 | Find the Duplicate Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5 | 656 | 66.21 |
0284 | Peeking Iterator | Medium | Array, Design, Iterator | 286 | 62.50 |
0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays | 516 | 79.07 |
0282 | Expression Add Operators | Hard | String, Math, Backtracking | 367 | 85.71 |
0279 | Perfect Squares | Medium | Top_Interview_Questions, Dynamic_Programming, Math, Breadth_First_Search, Dynamic_Programming_I_Day_21 | 176 | 98.80 |
0278 | First Bad Version | Easy | Binary_Search, Interactive, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_5, Level_1_Day_7_Binary_Search | 349 | 76.86 |
0275 | H-Index II | Medium | Array, Binary_Search, Binary_Search_II_Day_8 | 398 | 81.82 |
0274 | H-Index | Medium | Array, Sorting, Counting_Sort | 291 | 45.45 |
0273 | Integer to English Words | Hard | String, Math, Recursion, Udemy_Strings | 273 | 82.93 |
0268 | Missing Number | Easy | Top_Interview_Questions, Array, Hash_Table, Math, Sorting, Binary_Search, Bit_Manipulation | 380 | 83.49 |
0264 | Ugly Number II | Medium | Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue, Dynamic_Programming_I_Day_11 | 182 | 95.45 |
0263 | Ugly Number | Easy | Math | 243 | 64.10 |
0262 | Trips and Users | Hard | Database | 577 | 63.97 |
0260 | Single Number III | Medium | Array, Bit_Manipulation | 222 | 100.00 |
0258 | Add Digits | Easy | Math, Simulation, Number_Theory | 234 | 71.64 |
0257 | Binary Tree Paths | Easy | String, Depth_First_Search, Tree, Binary_Tree, Backtracking | 320 | 72.84 |
0242 | Valid Anagram | Easy | Top_Interview_Questions, String, Hash_Table, Sorting, Data_Structure_I_Day_6_String, Programming_Skills_I_Day_11_Containers_and_Libraries, Udemy_Strings | 251 | 87.65 |
0241 | Different Ways to Add Parentheses | Medium | String, Dynamic_Programming, Math, Recursion, Memoization | 294 | 73.47 |
0240 | Search a 2D Matrix II | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8 | 460 | 66.08 |
0239 | Sliding Window Maximum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays | 1059 | 86.14 |
0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Data_Structure_II_Day_5_Array, Udemy_Arrays | 669 | 48.96 |
0237 | Delete Node in a Linked List | Easy | Top_Interview_Questions, Linked_List | 183 | 93.00 |
0236 | Lowest Common Ancestor of a Binary Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue | 386 | 45.21 |
0235 | Lowest Common Ancestor of a Binary Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree | 404 | 75.59 |
0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List | 641 | 79.53 |
0233 | Number of Digit One | Hard | Dynamic_Programming, Math, Recursion | 129 | 100.00 |
0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue, Data_Structure_I_Day_9_Stack_Queue, Programming_Skills_I_Day_11_Containers_and_Libraries, Level_2_Day_16_Design | 258 | 70.86 |
0231 | Power of Two | Easy | Math, Bit_Manipulation, Recursion, Algorithm_I_Day_13_Bit_Manipulation | 161 | 86.81 |
0230 | Kth Smallest Element in a BST | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree | 393 | 33.33 |
0229 | Majority Element II | Medium | Array, Hash_Table, Sorting, Counting | 408 | 71.21 |
0228 | Summary Ranges | Easy | Array | 169 | 91.89 |
0227 | Basic Calculator II | Medium | Top_Interview_Questions, String, Math, Stack, Level_2_Day_18_Stack | 383 | 62.50 |
0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue | 233 | 54.90 |
0225 | Implement Stack using Queues | Easy | Stack, Design, Queue | 248 | 73.44 |
0224 | Basic Calculator | Hard | String, Math, Stack, Recursion | 294 | 93.33 |
0223 | Rectangle Area | Medium | Math, Geometry | 291 | 66.67 |
0222 | Count Complete Tree Nodes | ||||
0221 | Maximal Square | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16 | 614 | 44.00 |
0220 | Contains Duplicate III | Medium | Array, Sorting, Sliding_Window, Ordered_Set, Bucket_Sort | 921 | 72.22 |
0219 | Contains Duplicate II | Easy | Array, Hash_Table, Sliding_Window | 813 | 80.46 |
0218 | The Skyline Problem | Hard | Top_Interview_Questions, Array, Heap_Priority_Queue, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Line_Sweep | 365 | 93.14 |
0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Data_Structure_I_Day_1_Array, Programming_Skills_I_Day_11_Containers_and_Libraries, Udemy_Arrays | 719 | 73.49 |
0216 | Combination Sum III | Medium | Array, Backtracking, Udemy_Backtracking/Recursion | 175 | 90.91 |
0215 | Kth Largest Element in an Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue | 839 | 34.43 |
0214 | Shortest Palindrome | Hard | String, Hash_Function, String_Matching, Rolling_Hash | 278 | 100.00 |
0213 | House Robber II | Medium | Array, Dynamic_Programming, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Udemy_Dynamic_Programming | 257 | 59.62 |
0212 | Word Search II | Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 268 | 100.00 |
0211 | Design Add and Search Words Data Structure | Medium | String, Depth_First_Search, Design, Trie | 2256 | 87.04 |
0210 | Course Schedule II | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Level_2_Day_11_Graph/BFS/DFS | 266 | 96.32 |
0209 | Minimum Size Subarray Sum | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Binary_Search_II_Day_1 | 315 | 96.73 |
0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap | 689 | 61.00 |
0207 | Course Schedule | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 416 | 40.10 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List | 279 | 45.78 |
0205 | Isomorphic Strings | Easy | String, Hash_Table, Level_1_Day_2_String | 278 | 79.96 |
0204 | Count Primes | Medium | Top_Interview_Questions, Array, Math, Enumeration, Number_Theory | 360 | 96.61 |
0203 | Remove Linked List Elements | Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 233 | 91.22 |
0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop, Level_2_Day_1_Implementation/Simulation | 261 | 45.08 |
0201 | Bitwise AND of Numbers Range | Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 368 | 80.00 |
0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph | 252 | 95.41 |
0199 | Binary Tree Right Side View | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree, Level_2_Day_15_Tree | 194 | 92.89 |
0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming | 156 | 92.24 |
0197 | Rising Temperature | Easy | Database, SQL_I_Day_6_Union | 394 | 94.15 |
0196 | Delete Duplicate Emails | Easy | Database, SQL_I_Day_2_Select_and_Order | 593 | 94.17 |
0195 | Tenth Line | Easy | Shell | 36 | 87.50 |
0194 | Transpose File | Medium | Shell | 477 | 28.60 |
0193 | Valid Phone Numbers | Easy | Shell | 98 | 88.64 |
0192 | Word Frequency | Medium | Shell | 114 | 73.60 |
0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator, Udemy_Bit_Manipulation | 237 | 68.44 |
0190 | Reverse Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Bit_Manipulation | 198 | 81.82 |
0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays | 483 | 86.95 |
0188 | Best Time to Buy and Sell Stock IV | Hard | Array, Dynamic_Programming | 293 | 68.31 |
0187 | Repeated DNA Sequences | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash, Data_Structure_II_Day_9_String, Udemy_Strings | 319 | 79.03 |
0185 | Department Top Three Salaries | Hard | Database | 757 | 87.06 |
0184 | Department Highest Salary | Medium | Database | 637 | 76.01 |
0183 | Customers Who Never Order | Easy | Database, SQL_I_Day_1_Select | 712 | 33.67 |
0182 | Duplicate Emails | Easy | Database, SQL_I_Day_10_Where | 396 | 68.40 |
0181 | Employees Earning More Than Their Managers | Easy | Database | 351 | 94.75 |
0180 | Consecutive Numbers | Medium | Database | 695 | 38.05 |
0179 | Largest Number | Medium | Top_Interview_Questions, String, Sorting, Greedy | 380 | 43.40 |
0178 | Rank Scores | Medium | Database | 292 | 85.14 |
0177 | Nth Highest Salary | Medium | Database | 338 | 86.68 |
0176 | Second Highest Salary | Medium | Database, SQL_I_Day_4_Union_and_Select | 219 | 92.54 |
0175 | Combine Two Tables | Easy | Database, SQL_I_Day_5_Union | 473 | 54.97 |
0174 | Dungeon Game | Hard | Array, Dynamic_Programming, Matrix | 300 | 66.67 |
0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator, Data_Structure_II_Day_17_Tree, Programming_Skills_II_Day_16, Level_2_Day_9_Binary_Search_Tree | 563 | 46.91 |
0172 | Factorial Trailing Zeroes | Medium | Top_Interview_Questions, Math, Udemy_Integers | 220 | 67.65 |
0171 | Excel Sheet Column Number | Easy | Top_Interview_Questions, String, Math | 310 | 30.68 |
0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm | 460 | 51.25 |
0168 | Excel Sheet Column Title | Easy | String, Math | 246 | 30.12 |
0167 | Two Sum II - Input Array Is Sorted | Medium | Array, Binary_Search, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Binary_Search_I_Day_7 | 403 | 68.74 |
0166 | Fraction to Recurring Decimal | Medium | Top_Interview_Questions, String, Hash_Table, Math | 147 | 90.91 |
0165 | Compare Version Numbers | Medium | String, Two_Pointers | 144 | 100.00 |
0164 | Maximum Gap | Hard | Array, Sorting, Bucket_Sort, Radix_Sort | 991 | 68.00 |
0162 | Find Peak Element | Medium | Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_II_Day_12 | 297 | 53.85 |
0160 | Intersection of Two Linked Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Udemy_Linked_List | 262 | 83.50 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18, Level_2_Day_16_Design, Udemy_Design | 331 | 84.88 |
0154 | Find Minimum in Rotated Sorted Array II | Hard | Array, Binary_Search, Binary_Search_II_Day_13 | 275 | 84.00 |
0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search | 262 | 60.96 |
0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming | 253 | 88.42 |
0151 | Reverse Words in a String | Medium | String, Two_Pointers, Udemy_Strings | 206 | 98.90 |
0150 | Evaluate Reverse Polish Notation | Medium | Top_Interview_Questions, Array, Math, Stack, Programming_Skills_II_Day_3 | 233 | 88.82 |
0149 | Max Points on a Line | Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry, Algorithm_II_Day_21_Others | 307 | 83.33 |
0148 | Sort List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List | 820 | 61.70 |
0147 | Insertion Sort List | Medium | Sorting, Linked_List | 385 | 52.00 |
0146 | LRU Cache | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List | 1116 | 97.93 |
0145 | Binary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue | 211 | 80.00 |
0144 | Binary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue | 277 | 37.90 |
0143 | Reorder List | Medium | Two_Pointers, Stack, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Programming_Skills_II_Day_14 | 395 | 82.26 |
0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_Linked_List | 192 | 63.39 |
0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List | 223 | 91.85 |
0140 | Word Break II | Hard | Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Backtracking, Trie, Memoization | 287 | 44.19 |
0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming | 197 | 87.17 |
0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List | 274 | 80.58 |
0137 | Single Number II | Medium | Array, Bit_Manipulation | 344 | 64.29 |
0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers | 344 | 83.63 |
0135 | Candy | Hard | Array, Greedy | 466 | 58.33 |
0134 | Gas Station | Medium | Top_Interview_Questions, Array, Greedy | 545 | 70.18 |
0133 | Clone Graph | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph, Udemy_Graph | 351 | 60.91 |
0132 | Palindrome Partitioning II | Hard | String, Dynamic_Programming | 290 | 100.00 |
0131 | Palindrome Partitioning | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking | 820 | 87.27 |
0130 | Surrounded Regions | Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search | 355 | 84.42 |
0129 | Sum Root to Leaf Numbers | Medium | Depth_First_Search, Tree, Binary_Tree | 269 | 29.63 |
0128 | Longest Consecutive Sequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find | 460 | 97.77 |
0127 | Word Ladder | Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 396 | 98.68 |
0126 | Word Ladder II | Hard | String, Hash_Table, Breadth_First_Search, Backtracking | 418 | 51.45 |
0125 | Valid Palindrome | Easy | Top_Interview_Questions, String, Two_Pointers, Udemy_Two_Pointers | 353 | 52.06 |
0124 | Binary Tree Maximum Path Sum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue | 331 | 74.42 |
0123 | Best Time to Buy and Sell Stock III | Hard | Array, Dynamic_Programming | 585 | 95.24 |
0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7, Udemy_Arrays | 370 | 16.98 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays | 609 | 94.06 |
0120 | Triangle | Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13, Udemy_Dynamic_Programming | 194 | 97.87 |
0119 | Pascal's Triangle II | Easy | Array, Dynamic_Programming, Data_Structure_II_Day_3_Array, Dynamic_Programming_I_Day_12, Udemy_Dynamic_Programming | 296 | 19.15 |
0118 | Pascal's Triangle | Easy | Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_4_Array, Dynamic_Programming_I_Day_12, Udemy_Dynamic_Programming | 277 | 33.22 |
0117 | Populating Next Right Pointers in Each Node II | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 199 | 94.67 |
0116 | Populating Next Right Pointers in Each Node | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search | 355 | 69.02 |
0115 | Distinct Subsequences | Hard | String, Dynamic_Programming | 285 | 88.89 |
0114 | Flatten Binary Tree to Linked List | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List | 191 | 93.10 |
0113 | Path Sum II | Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking, Data_Structure_II_Day_16_Tree | 364 | 78.67 |
0112 | Path Sum | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree | 322 | 36.41 |
0111 | Minimum Depth of Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue | 525 | 90.51 |
0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Programming_Skills_II_Day_2, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue | 310 | 63.63 |
0109 | Convert Sorted List to Binary Search Tree | Medium | Tree, Binary_Tree, Linked_List, Binary_Search_Tree, Divide_and_Conquer | 376 | 59.26 |
0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Level_2_Day_9_Binary_Search_Tree, Udemy_Tree_Stack_Queue | 334 | 35.39 |
0107 | Binary Tree Level Order Traversal II | Medium | Breadth_First_Search, Tree, Binary_Tree | 204 | 98.04 |
0106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 358 | 61.29 |
0105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree | 370 | 58.31 |
0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue | 236 | 83.39 |
0103 | Binary Tree Zigzag Level Order Traversal | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_15_Tree, Udemy_Tree_Stack_Queue | 316 | 34.25 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue | 355 | 29.37 |
0101 | Symmetric Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree | 290 | 26.98 |
0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Level_2_Day_15_Tree, Udemy_Tree_Stack_Queue | 208 | 72.24 |
0099 | Recover Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 492 | 39.39 |
0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue | 330 | 41.38 |
0097 | Interleaving String | Medium | String, Dynamic_Programming | 240 | 57.50 |
0096 | Unique Binary Search Trees | Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11 | 147 | 88.52 |
0095 | Unique Binary Search Trees II | Medium | Dynamic_Programming, Tree, Binary_Tree, Backtracking, Binary_Search_Tree | 360 | 41.38 |
0094 | Binary Tree Inorder Traversal | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue | 269 | 38.80 |
0093 | Restore IP Addresses | Medium | String, Backtracking | 304 | 73.33 |
0092 | Reverse Linked List II | Medium | Linked_List | 191 | 82.35 |
0091 | Decode Ways | Medium | Top_Interview_Questions, String, Dynamic_Programming, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_10 | 237 | 76.88 |
0090 | Subsets II | Medium | Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking | 366 | 58.09 |
0089 | Gray Code | Medium | Math, Bit_Manipulation, Backtracking | 273 | 100.00 |
0088 | Merge Sorted Array | Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_I_Day_2_Array | 311 | 33.40 |
0087 | Scramble String | Hard | String, Dynamic_Programming | 366 | 85.00 |
0086 | Partition List | Medium | Two_Pointers, Linked_List | 172 | 94.00 |
0085 | Maximal Rectangle | Hard | Array, Dynamic_Programming, Matrix, Stack, Monotonic_Stack | 463 | 55.17 |
0084 | Largest Rectangle in Histogram | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack | 525 | 100.00 |
0083 | Remove Duplicates from Sorted List | Easy | Linked_List, Data_Structure_I_Day_8_Linked_List | 274 | 77.82 |
0082 | Remove Duplicates from Sorted List II | Medium | Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Algorithm_II_Day_3_Two_Pointers | 241 | 91.04 |
0081 | Search in Rotated Sorted Array II | Medium | Array, Binary_Search, Binary_Search_II_Day_12 | 352 | 42.31 |
0080 | Remove Duplicates from Sorted Array II | Medium | Array, Two_Pointers, Udemy_Arrays | 357 | 44.78 |
0079 | Word Search | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking | 463 | 68.49 |
0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking, Udemy_Backtracking/Recursion | 353 | 30.14 |
0077 | Combinations | Medium | Backtracking, Algorithm_I_Day_11_Recursion_Backtracking | 244 | 100.00 |
0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer | 346 | 85.20 |
0075 | Sort Colors | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_2_Array, Udemy_Arrays | 198 | 85.66 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix | 290 | 40.17 |
0073 | Set Matrix Zeroes | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Udemy_2D_Arrays/Matrix | 255 | 100.00 |
0072 | Edit Distance | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming | 320 | 63.53 |
0071 | Simplify Path | Medium | String, Stack | 318 | 64.44 |
0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming | 127 | 97.06 |
0069 | Sqrt(x) | Easy | Top_Interview_Questions, Math, Binary_Search, Binary_Search_I_Day_4 | 153 | 95.75 |
0068 | Text Justification | Hard | Array, String, Simulation | 269 | 50.00 |
0067 | Add Binary | Easy | String, Math, Bit_Manipulation, Simulation, Programming_Skills_II_Day_5 | 327 | 32.67 |
0066 | Plus One | Easy | Top_Interview_Questions, Array, Math, Programming_Skills_II_Day_3, Udemy_Arrays | 303 | 35.18 |
0065 | Valid Number | Hard | String | 310 | 81.82 |
0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming | 222 | 95.70 |
0063 | Unique Paths II | Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_15 | 187 | 84.62 |
0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming | 209 | 49.18 |
0061 | Rotate List | Medium | Two_Pointers, Linked_List, Programming_Skills_II_Day_16, Udemy_Linked_List | 193 | 92.16 |
0060 | Permutation Sequence | Hard | Math, Recursion | 293 | 27.78 |
0059 | Spiral Matrix II | Medium | Array, Matrix, Simulation, Data_Structure_II_Day_3_Array | 153 | 100.00 |
0058 | Length of Last Word | Easy | String, Programming_Skills_II_Day_6, Udemy_Arrays | 243 | 63.33 |
0057 | Insert Interval | Medium | Array, Level_2_Day_17_Interval | 257 | 99.52 |
0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array, Level_2_Day_17_Interval, Udemy_2D_Arrays/Matrix | 323 | 99.68 |
0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4, Udemy_Arrays | 670 | 66.67 |
0054 | Spiral Matrix | Medium | Top_Interview_Questions, Array, Matrix, Simulation, Programming_Skills_II_Day_8, Level_2_Day_1_Implementation/Simulation, Udemy_2D_Arrays/Matrix | 224 | 62.50 |
0053 | Maximum Subarray | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Data_Structure_I_Day_1_Array, Dynamic_Programming_I_Day_5, Udemy_Famous_Algorithm | 662 | 82.48 |
0052 | N-Queens II | Hard | Backtracking | 231 | 80.00 |
0051 | N-Queens | Hard | Top_100_Liked_Questions, Array, Backtracking | 243 | 95.10 |
0050 | Pow(x, n) | Medium | Top_Interview_Questions, Math, Recursion, Udemy_Integers | 264 | 52.98 |
0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings | 506 | 86.55 |
0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7, Udemy_2D_Arrays/Matrix | 287 | 46.50 |
0047 | Permutations II | Medium | Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 406 | 76.36 |
0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion | 186 | 100.00 |
0045 | Jump Game II | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4 | 227 | 98.14 |
0044 | Wildcard Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion, Udemy_Dynamic_Programming | 401 | 86.11 |
0043 | Multiply Strings | Medium | String, Math, Simulation, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_4, Level_2_Day_2_String | 390 | 56.25 |
0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers | 196 | 100.00 |
0041 | First Missing Positive | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Udemy_Arrays | 345 | 100.00 |
0040 | Combination Sum II | Medium | Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 348 | 80.92 |
0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion | 317 | 86.85 |
0038 | Count and Say | Medium | Top_Interview_Questions, String | 317 | 41.11 |
0037 | Sudoku Solver | Hard | Array, Matrix, Backtracking | 294 | 79.69 |
0036 | Valid Sudoku | Medium | Top_Interview_Questions, Array, Hash_Table, Matrix, Data_Structure_I_Day_5_Array | 346 | 65.03 |
0035 | Search Insert Position | Easy | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2 | 267 | 50.32 |
0034 | Find First and Last Position of Element in Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_5 | 228 | 83.38 |
0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_11, Level_2_Day_8_Binary_Search, Udemy_Binary_Search | 184 | 86.08 |
0032 | Longest Valid Parentheses | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Stack | 215 | 95.71 |
0031 | Next Permutation | Medium | Top_100_Liked_Questions, Array, Two_Pointers | 211 | 94.23 |
0030 | Substring with Concatenation of All Words | Hard | String, Hash_Table, Sliding_Window | 441 | 85.84 |
0029 | Divide Two Integers | Medium | Top_Interview_Questions, Math, Bit_Manipulation, Udemy_Bit_Manipulation | 281 | 31.67 |
0028 | Find the Index of the First Occurrence in a String | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching, Programming_Skills_II_Day_1 | 257 | 32.35 |
0027 | Remove Element | Easy | Array, Two_Pointers | 293 | 32.19 |
0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, Two_Pointers, Udemy_Two_Pointers | 361 | 77.19 |
0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Udemy_Linked_List | 194 | 87.72 |
0024 | Swap Nodes in Pairs | Medium | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_12_Linked_List, Udemy_Linked_List | 149 | 99.39 |
0023 | Merge k Sorted Lists | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort | 323 | 75.14 |
0022 | Generate Parentheses | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion | 210 | 78.51 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List | 176 | 96.25 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings | 226 | 72.53 |
0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List | 180 | 91.58 |
0018 | 4Sum | Medium | Array, Sorting, Two_Pointers | 244 | 100.00 |
0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion | 262 | 73.59 |
0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers, Level_2_Day_14_Sliding_Window/Two_Pointer | 413 | 95.05 |
0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers | 761 | 90.55 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String, Level_2_Day_2_String, Udemy_Strings | 209 | 88.86 |
0013 | Roman to Integer | Easy | Top_Interview_Questions, String, Hash_Table, Math | 358 | 75.16 |
0012 | Integer to Roman | Medium | String, Hash_Table, Math | 223 | 93.87 |
0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers | 474 | 89.18 |
0010 | Regular Expression Matching | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming | 292 | 58.58 |
0009 | Palindrome Number | Easy | Math, Udemy_Integers | 238 | 96.24 |
0008 | String to Integer (atoi) | Medium | Top_Interview_Questions, String | 196 | 96.46 |
0007 | Reverse Integer | Medium | Top_Interview_Questions, Math, Udemy_Integers | 245 | 60.32 |
0006 | Zigzag Conversion | Medium | String | 366 | 80.62 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings | 323 | 75.48 |
0004 | Median of Two Sorted Arrays | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer | 355 | 83.48 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings | 258 | 91.09 |
0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15 | 417 | 50.44 |
0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap, Udemy_Arrays | 234 | 92.75 |
About
Kotlin-based LeetCode algorithm problem solutions, regularly updated.
Topics
Resources
License
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Releases
No releases published
Uh oh!
There was an error while loading.Please reload this page.
Contributors2
Uh oh!
There was an error while loading.Please reload this page.