All companiesLinkedin
27 Easy114 Medium35 Hard176 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 364 | Nested List Weight Sum II | Medium | |
| 716 | Max Stack | Hard | |
| 244 | Shortest Word Distance II | Medium | |
| 432 | All O`one Data Structure | Hard | |
| 1004 | Max Consecutive Ones III | Medium | |
| 17 | Letter Combinations of a Phone Number | Medium | |
| 20 | Valid Parentheses | Easy | |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | |
| 50 | Pow(x, n) | Medium | |
| 53 | Maximum Subarray | Medium | |
| 127 | Word Ladder | Hard | |
| 152 | Maximum Product Subarray | Medium | |
| 156 | Binary Tree Upside Down | Medium | |
| 200 | Number of Islands | Medium | |
| 277 | Find the Celebrity | Medium | |
| 339 | Nested List Weight Sum | Medium | |
| 366 | Find Leaves of Binary Tree | Medium | |
| 380 | Insert Delete GetRandom O(1) | Medium | |
| 605 | Can Place Flowers | Easy | |
| 698 | Partition to K Equal Sum Subsets | Medium | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 46 | Permutations | Medium | |
| 56 | Merge Intervals | Medium | |
| 65 | Valid Number | Hard | |
| 76 | Minimum Window Substring | Hard | |
| 101 | Symmetric Tree | Easy | |
| 104 | Maximum Depth of Binary Tree | Easy | |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | |
| 146 | LRU Cache | Medium | |
| 149 | Max Points on a Line | Hard | |
| 187 | Repeated DNA Sequences | Medium | |
| 205 | Isomorphic Strings | Easy | |
| 215 | Kth Largest Element in an Array | Medium | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | |
| 243 | Shortest Word Distance | Easy | |
| 254 | Factor Combinations | Medium | |
| 256 | Paint House | Medium | |
| 272 | Closest Binary Search Tree Value II | Hard | |
| 297 | Serialize and Deserialize Binary Tree | Hard | |
| 2276 | Count Integers in Intervals | Hard | |
| 360 | Sort Transformed Array | Medium | |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | |
| 636 | Exclusive Time of Functions | Medium | |
| 671 | Second Minimum Node In a Binary Tree | Easy | |
| 744 | Find Smallest Letter Greater Than Target | Easy | |
| 528 | Random Pick with Weight | Medium | |
| 1188 | Design Bounded Blocking Queue | Medium | |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | |
| 319 | Bulb Switcher | Medium | |
| 1 | Two Sum | Easy | |
| 21 | Merge Two Sorted Lists | Easy | |
| 23 | Merge k Sorted Lists | Hard | |
| 47 | Permutations II | Medium | |
| 57 | Insert Interval | Medium | |
| 61 | Rotate List | Medium | |
| 68 | Text Justification | Hard | |
| 72 | Edit Distance | Medium | |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | |
| 102 | Binary Tree Level Order Traversal | Medium | |
| 150 | Evaluate Reverse Polish Notation | Medium | |
| 170 | Two Sum III - Data structure design | Easy | |
| 173 | Binary Search Tree Iterator | Medium | |
| 198 | House Robber | Medium | |
| 238 | Product of Array Except Self | Medium | |
| 245 | Shortest Word Distance III | Medium | |
| 2196 | Create Binary Tree From Descriptions | Medium | |
| 261 | Graph Valid Tree | Medium | |
| 311 | Sparse Matrix Multiplication | Medium | |
| 341 | Flatten Nested List Iterator | Medium | |
| 367 | Valid Perfect Square | Easy | |
| 373 | Find K Pairs with Smallest Sums | Medium | |
| 2344 | Minimum Deletions to Make Array Divisible | Hard | |
| 464 | Can I Win | Medium | |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | |
| 515 | Find Largest Value in Each Tree Row | Medium | |
| 516 | Longest Palindromic Subsequence | Medium | |
| 2431 | Maximize Total Tastiness of Purchased Fruits | Medium | |
| 2532 | Time to Cross a Bridge | Hard | |
| 633 | Sum of Square Numbers | Medium | |
| 647 | Palindromic Substrings | Medium | |
| 658 | Find K Closest Elements | Medium | |
| 730 | Count Different Palindromic Subsequences | Hard | |
| 946 | Validate Stack Sequences | Medium | |
| 1117 | Building H2O | Medium | |
| 1107 | New Users Daily Count | Medium | |
| 1127 | User Purchase Platform | Hard | |
| 1148 | Article Views I | Easy | |
| 1149 | Article Views II | Medium | |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | |
| 1588 | Sum of All Odd Length Subarrays | Easy | |
| 1644 | Lowest Common Ancestor of a Binary Tree II | Medium | |
| 886 | Possible Bipartition | Medium | |
| 210 | Course Schedule II | Medium | |
| 489 | Robot Room Cleaner | Hard | |
| 721 | Accounts Merge | Medium | |
| 69 | Sqrt(x) | Easy | |
| 160 | Intersection of Two Linked Lists | Easy | |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard | |
| 617 | Merge Two Binary Trees | Easy | |
| 3850 | Count Sequences to K | Hard | |
| 3891 | Minimum Increase to Maximize Special Indices | Medium | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 100 | Same Tree | Easy | |
| 126 | Word Ladder II | Hard | |
| 155 | Min Stack | Medium | |
| 323 | Number of Connected Components in an Undirected Graph | Medium | |
| 384 | Shuffle an Array | Medium | |
| 611 | Valid Triangle Number | Medium | |
| 695 | Max Area of Island | Medium | |
| 706 | Design HashMap | Easy | |
| 40 | Combination Sum II | Medium | |
| 742 | Closest Leaf in a Binary Tree | Medium | |
| 470 | Implement Rand10() Using Rand7() | Medium | |
| 2964 | Number of Divisible Triplet Sums | Medium | |
| 678 | Valid Parenthesis String | Medium | |
| 785 | Is Graph Bipartite? | Medium | |
| 450 | Delete Node in a BST | Medium | |
| 265 | Paint House II | Hard | |
| 1386 | Cinema Seat Allocation | Medium | |
| 32 | Longest Valid Parentheses | Hard | |
| 1882 | Process Tasks Using Servers | Medium | |
| 632 | Smallest Range Covering Elements from K Lists | Hard | |
| 151 | Reverse Words in a String | Medium | |
| 460 | LFU Cache | Hard | |
| 5 | Longest Palindromic Substring | Medium | |
| 12 | Integer to Roman | Medium | |
| 39 | Combination Sum | Medium | |
| 88 | Merge Sorted Array | Easy | |
| 121 | Best Time to Buy and Sell Stock | Easy | |
| 143 | Reorder List | Medium | |
| 213 | House Robber II | Medium | |
| 763 | Partition Labels | Medium | |
| 973 | K Closest Points to Origin | Medium | |
| 1197 | Minimum Knight Moves | Medium | |
| 28 | Find the Index of the First Occurrence in a String | Easy | |
| 36 | Valid Sudoku | Medium | |
| 139 | Word Break | Medium | |
| 62 | Unique Paths | Medium | |
| 226 | Invert Binary Tree | Easy | |
| 1570 | Dot Product of Two Sparse Vectors | Medium | |
| 274 | H-Index | Medium | |
| 925 | Long Pressed Name | Easy | |
| 542 | 01 Matrix | Medium | |
| 875 | Koko Eating Bananas | Medium | |
| 282 | Expression Add Operators | Hard | |
| 230 | Kth Smallest Element in a BST | Medium | |
| 1944 | Number of Visible People in a Queue | Hard | |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | |
| 1857 | Largest Color Value in a Directed Graph | Hard | |
| 273 | Integer to English Words | Hard | |
| 621 | Task Scheduler | Medium | |
| 153 | Find Minimum in Rotated Sorted Array | Medium | |
| 7 | Reverse Integer | Medium | |
| 1473 | Paint House III | Hard | |
| 1048 | Longest String Chain | Medium | |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | |
| 560 | Subarray Sum Equals K | Medium | |
| 18 | 4Sum | Medium | |
| 827 | Making A Large Island | Hard | |
| 1041 | Robot Bounded In Circle | Medium | |
| 207 | Course Schedule | Medium | |
| 128 | Longest Consecutive Sequence | Medium | |
| 296 | Best Meeting Point | Hard | |
| 98 | Validate Binary Search Tree | Medium | |
| 490 | The Maze | Medium | |
| 84 | Largest Rectangle in Histogram | Hard | |
| 752 | Open the Lock | Medium | |
| 994 | Rotting Oranges | Medium | |
| 141 | Linked List Cycle | Easy | |
| 1017 | Convert to Base -2 | Medium | |
| 701 | Insert into a Binary Search Tree | Medium | |
| 81 | Search in Rotated Sorted Array II | Medium | |
| 387 | First Unique Character in a String | Easy | |
| 206 | Reverse Linked List | Easy | |
| 863 | All Nodes Distance K in Binary Tree | Medium |