- 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
- Algorithm II
- Binary Search I
- 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
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 |
0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers | 1059 | 55.28 |
0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers | 635 | 64.22 |
0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 561 | 54.68 |
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 |
0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking | 353 | 30.14 |
0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking | 317 | 86.85 |
0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking | 132 | 100.00 |
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 |
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 | 359 | 69.08 |
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 |
0035 | Search Insert Position | Easy | Top_100_Liked_Questions, Array, Binary_Search | 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 | 228 | 83.38 |
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 |
0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search | 262 | 60.96 |
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 |
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 |
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 |
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 |
0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics | 209 | 49.18 |
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 | 359 | 69.08 |
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 |
0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 516 | 79.07 |
0739 | Daily Temperatures | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack | 936 | 80.54 |
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 |
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 | 212 | 93.71 |
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 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 148 | 99.90 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 309 | 15.90 |
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 |
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 |
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 |
0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion | 268 | 23.13 |
0054 | Spiral Matrix | Medium | Top_Interview_Questions, Array, Matrix, Simulation | 224 | 62.50 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String | 269 | 48.51 |
0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List | 172 | 85.17 |
0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion | 809 | 20.12 |
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 | 275 | 13.68 |
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 |
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 |
0994 | Rotting Oranges | Medium | Array, Breadth_First_Search, Matrix | 308 | 57.93 |
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 | 212 | 91.24 |
0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers | 219 | 89.56 |
0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 346 | 85.20 |
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 |
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 |
0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting | 323 | 99.68 |
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 | 230 | 57.36 |
0009 | Palindrome Number | Easy | Math | 208 | 94.88 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String | 269 | 48.51 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 212 | 91.24 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack | 196 | 71.08 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 359 | 69.08 |
0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion | 268 | 23.13 |
0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting | 506 | 86.55 |
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 |
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 |
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 |
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 | 1059 | 55.28 |
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 |
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 | 305 | 26.30 |
0024 | Swap Nodes in Pairs | Medium | Linked_List, Recursion | 173 | 83.13 |
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 | 425 | 10.15 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 309 | 15.90 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 148 | 99.90 |
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 | 809 | 20.12 |
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 |
0094 | Largest Rectangle in Histogram | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack | 283 | 17.97 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 355 | 29.37 |
0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 307 | 43.93 |
0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 275 | 13.68 |
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 |
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 |
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 |
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 |
0010 | Regular Expression Matching | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion | 234 | 85.18 |
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 |
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 | 132 | 100.00 |
0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking | 186 | 100.00 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 331 | 84.88 |
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 |
0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 609 | 94.06 |
0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix | 290 | 40.17 |
0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List | 425 | 10.15 |
0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 148 | 99.90 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 309 | 15.90 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack | 196 | 71.08 |
0094 | Largest Rectangle in Histogram | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack | 283 | 17.97 |
0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 355 | 29.37 |
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 | 275 | 13.68 |
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 |
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 | 1059 | 55.28 |
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 |
0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix | 287 | 46.50 |
0240 | Search a 2D Matrix II | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer | 460 | 66.08 |
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 |
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 |
0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming | 359 | 69.08 |
0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion | 212 | 93.71 |
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 |
0024 | Swap Nodes in Pairs | Medium | Linked_List, Recursion | 173 | 83.13 |
0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion | 194 | 87.72 |
0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design | 331 | 84.88 |
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 |
0199 | Binary Tree Right Side View | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 |
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 |
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 |
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 |
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 |
0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List | 172 | 85.17 |
0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 212 | 91.24 |
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 | 148 | 99.90 |
0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 309 | 15.90 |
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 |
0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 344 | 83.63 |
# | 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 |
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 | 268 | 23.13 |
0378 | Kth Smallest Element in a Sorted Matrix | Medium | Top_Interview_Questions, Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue | 522 | 59.78 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 | 809 | 20.12 |
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 |
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 | 275 | 13.68 |
0221 | Maximal Square | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16 | 614 | 44.00 |
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 |
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 | 309 | 15.90 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 | 425 | 10.15 |
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 |
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 |
0131 | Palindrome Partitioning | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking | 820 | 87.27 |
0128 | Longest Consecutive Sequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find | 460 | 97.77 |
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 |
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 |
0114 | Flatten Binary Tree to Linked List | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List | 305 | 26.30 |
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 |
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 |
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 |
0094 | Largest Rectangle in Histogram | 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 | 283 | 17.97 |
0084 | Largest Rectangle in Histogram | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack | 525 | 100.00 |
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 |
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 |
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 |
0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming | 222 | 95.70 |
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 |
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 |
0051 | N-Queens | Hard | Top_100_Liked_Questions, Array, Backtracking | 243 | 95.10 |
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 |
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 |
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 |
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 |
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 | 184 | 86.08 |
0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, 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 | 194 | 87.72 |
0024 | Swap Nodes in Pairs | Medium | Linked_List, Recursion, Data_Structure_II_Day_12_Linked_List | 173 | 83.13 |
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 | 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 | 148 | 99.90 |
0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue | 196 | 71.08 |
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 | 172 | 85.17 |
0018 | 4Sum | Medium | Array, Sorting, Two_Pointers | 467 | 81.25 |
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 | 132 | 100.00 |
0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers | 219 | 89.56 |
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 | 1059 | 55.28 |
0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String | 269 | 48.51 |
0013 | Roman to Integer | Easy | Top_Interview_Questions, String, Hash_Table, Math | 293 | 78.06 |
0012 | Integer to Roman | Medium | String, Hash_Table, Math | 300 | 72.89 |
0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers | 635 | 64.22 |
0010 | Regular Expression Matching | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion | 234 | 85.18 |
0009 | Palindrome Number | Easy | Math | 208 | 94.88 |
0008 | String to Integer (atoi) | Medium | Top_Interview_Questions, String | 152 | 99.64 |
0007 | Reverse Integer | Medium | Top_Interview_Questions, Math | 230 | 57.36 |
0006 | Zigzag Conversion | Medium | String | 351 | 78.99 |
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 | 359 | 69.08 |
0004 | Median of Two Sorted Arrays | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer | 276 | 91.12 |
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 | 212 | 91.24 |
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 | 212 | 93.71 |
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.