All companies
Salesforce
25 Easy114 Medium52 Hard191 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | |
| 443 | String Compression | Medium | |
| 460 | LFU Cache | Hard | |
| 2957 | Remove Adjacent Almost-Equal Characters | Medium | |
| 3398 | Smallest Substring With Identical Characters I | Hard | |
| 3399 | Smallest Substring With Identical Characters II | Hard | |
| 3488 | Closest Equal Element Queries | Medium | |
| 2380 | Time Needed to Rearrange a Binary String | Medium | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 49 | Group Anagrams | Medium | |
| 56 | Merge Intervals | Medium | |
| 115 | Distinct Subsequences | Hard | |
| 2068 | Check Whether Two Strings are Almost Equivalent | Easy | |
| 146 | LRU Cache | Medium | |
| 200 | Number of Islands | Medium | |
| 210 | Course Schedule II | Medium | |
| 628 | Maximum Product of Three Numbers | Easy | |
| 647 | Palindromic Substrings | Medium | |
| 2563 | Count the Number of Fair Pairs | Medium | |
| 713 | Subarray Product Less Than K | Medium | |
| 895 | Maximum Frequency Stack | Hard | |
| 2866 | Beautiful Towers II | Medium | |
| 2865 | Beautiful Towers I | Medium | |
| 1150 | Check If a Number Is Majority Element in a Sorted Array | Easy | |
| 1051 | Height Checker | Easy | |
| 2946 | Matrix Similarity After Cyclic Shifts | Easy | |
| 2992 | Number of Self-Divisible Permutations | Medium | |
| 3125 | Maximum Number That Makes Result of Bitwise AND Zero | Medium | |
| 3171 | Find Subarray With Bitwise OR Closest to K | Hard | |
| 3135 | Equalize Strings by Adding or Removing Characters at Ends | Medium | |
| 3193 | Count the Number of Inversions | Hard | |
| 3197 | Find the Minimum Area to Cover All Ones II | Hard | |
| 3195 | Find the Minimum Area to Cover All Ones I | Medium | |
| 3200 | Maximum Height of a Triangle | Easy | |
| 1659 | Maximize Grid Happiness | Hard | |
| 1701 | Average Waiting Time | Medium | |
| 924 | Minimize Malware Spread | Hard | |
| 1297 | Maximum Number of Occurrences of a Substring | Medium | |
| 1221 | Split a String in Balanced Strings | Easy | |
| 3540 | Minimum Time to Visit All Houses | Medium | |
| 3607 | Power Grid Maintenance | Medium | |
| 3613 | Minimize Maximum Component Cost | Medium | |
| 740 | Delete and Earn | Medium | |
| 3035 | Maximum Palindromes After Operations | Medium | |
| 5 | Longest Palindromic Substring | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 76 | Minimum Window Substring | Hard | |
| 124 | Binary Tree Maximum Path Sum | Hard | |
| 121 | Best Time to Buy and Sell Stock | Easy | |
| 155 | Min Stack | Medium | |
| 215 | Kth Largest Element in an Array | Medium | |
| 347 | Top K Frequent Elements | Medium | |
| 735 | Asteroid Collision | Medium | |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | |
| 233 | Number of Digit One | Hard | |
| 1 | Two Sum | Easy | |
| 1710 | Maximum Units on a Truck | Easy | |
| 3313 | Find the Last Marked Nodes in Tree | Hard | |
| 2964 | Number of Divisible Triplet Sums | Medium | |
| 79 | Word Search | Medium | |
| 532 | K-diff Pairs in an Array | Medium | |
| 25 | Reverse Nodes in k-Group | Hard | |
| 1200 | Minimum Absolute Difference | Easy | |
| 6 | Zigzag Conversion | Medium | |
| 863 | All Nodes Distance K in Binary Tree | Medium | |
| 875 | Koko Eating Bananas | Medium | |
| 1143 | Longest Common Subsequence | Medium | |
| 2488 | Count Subarrays With Median K | Hard | |
| 3295 | Report Spam Message | Medium | |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | |
| 3634 | Minimum Removals to Balance Array | Medium | |
| 11 | Container With Most Water | Medium | |
| 15 | 3Sum | Medium | |
| 20 | Valid Parentheses | Easy | |
| 23 | Merge k Sorted Lists | Hard | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 39 | Combination Sum | Medium | |
| 41 | First Missing Positive | Hard | |
| 75 | Sort Colors | Medium | |
| 98 | Validate Binary Search Tree | Medium | |
| 139 | Word Break | Medium | |
| 221 | Maximal Square | Medium | |
| 253 | Meeting Rooms II | Medium | |
| 295 | Find Median from Data Stream | Hard | |
| 322 | Coin Change | Medium | |
| 394 | Decode String | Medium | |
| 994 | Rotting Oranges | Medium | |
| 1268 | Search Suggestions System | Medium | |
| 127 | Word Ladder | Hard | |
| 1315 | Sum of Nodes with Even-Valued Grandparent | Medium | |
| 1552 | Magnetic Force Between Two Balls | Medium | |
| 2231 | Largest Number After Digit Swaps by Parity | Easy | |
| 53 | Maximum Subarray | Medium | |
| 692 | Top K Frequent Words | Medium | |
| 255 | Verify Preorder Sequence in Binary Search Tree | Medium | |
| 329 | Longest Increasing Path in a Matrix | Hard | |
| 366 | Find Leaves of Binary Tree | Medium | |
| 134 | Gas Station | Medium | |
| 300 | Longest Increasing Subsequence | Medium | |
| 239 | Sliding Window Maximum | Hard | |
| 767 | Reorganize String | Medium | |
| 1944 | Number of Visible People in a Queue | Hard | |
| 1004 | Max Consecutive Ones III | Medium | |
| 4 | Median of Two Sorted Arrays | Hard | |
| 1335 | Minimum Difficulty of a Job Schedule | Hard | |
| 465 | Optimal Account Balancing | Hard | |
| 21 | Merge Two Sorted Lists | Easy | |
| 894 | All Possible Full Binary Trees | Medium | |
| 85 | Maximal Rectangle | Hard | |
| 545 | Boundary of Binary Tree | Medium | |
| 2451 | Odd String Difference | Easy | |
| 337 | House Robber III | Medium | |
| 992 | Subarrays with K Different Integers | Hard | |
| 743 | Network Delay Time | Medium | |
| 332 | Reconstruct Itinerary | Hard | |
| 268 | Missing Number | Easy | |
| 1219 | Path with Maximum Gold | Medium | |
| 355 | Design Twitter | Medium | |
| 1522 | Diameter of N-Ary Tree | Medium | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | |
| 678 | Valid Parenthesis String | Medium | |
| 207 | Course Schedule | Medium | |
| 2603 | Collect Coins in a Tree | Hard | |
| 22 | Generate Parentheses | Medium | |
| 664 | Strange Printer | Hard | |
| 2366 | Minimum Replacements to Sort the Array | Hard | |
| 3893 | Maximum Team Size with Overlapping Intervals | Medium | |
| 12 | Integer to Roman | Medium | |
| 13 | Roman to Integer | Easy | |
| 238 | Product of Array Except Self | Medium | |
| 696 | Count Binary Substrings | Easy | |
| 831 | Masking Personal Information | Medium | |
| 152 | Maximum Product Subarray | Medium | |
| 2025 | Maximum Number of Ways to Partition an Array | Hard | |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | |
| 224 | Basic Calculator | Hard | |
| 973 | K Closest Points to Origin | Medium | |
| 636 | Exclusive Time of Functions | Medium | |
| 2515 | Shortest Distance to Target String in a Circular Array | Easy | |
| 289 | Game of Life | Medium | |
| 1046 | Last Stone Weight | Easy | |
| 437 | Path Sum III | Medium | |
| 135 | Candy | Hard | |
| 2008 | Maximum Earnings From Taxi | Medium | |
| 1481 | Least Number of Unique Integers after K Removals | Medium | |
| 844 | Backspace String Compare | Easy | |
| 353 | Design Snake Game | Medium | |
| 724 | Find Pivot Index | Easy | |
| 535 | Encode and Decode TinyURL | Medium | |
| 125 | Valid Palindrome | Easy | |
| 768 | Max Chunks To Make Sorted II | Hard | |
| 815 | Bus Routes | Hard | |
| 2345 | Finding the Number of Visible Mountains | Medium | |
| 1319 | Number of Operations to Make Network Connected | Medium | |
| 703 | Kth Largest Element in a Stream | Easy | |
| 652 | Find Duplicate Subtrees | Medium | |
| 630 | Course Schedule III | Hard | |
| 213 | House Robber II | Medium | |
| 2065 | Maximum Path Quality of a Graph | Hard | |
| 416 | Partition Equal Subset Sum | Medium | |
| 1245 | Tree Diameter | Medium | |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | |
| 3170 | Lexicographically Minimum String After Removing Stars | Medium | |
| 934 | Shortest Bridge | Medium | |
| 2062 | Count Vowel Substrings of a String | Easy | |
| 54 | Spiral Matrix | Medium | |
| 1839 | Longest Substring Of All Vowels in Order | Medium | |
| 287 | Find the Duplicate Number | Medium | |
| 3366 | Minimum Array Sum | Medium | |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | |
| 312 | Burst Balloons | Hard | |
| 2534 | Time Taken to Cross the Door | Hard | |
| 658 | Find K Closest Elements | Medium | |
| 518 | Coin Change II | Medium | |
| 451 | Sort Characters By Frequency | Medium | |
| 981 | Time Based Key-Value Store | Medium | |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | |
| 727 | Minimum Window Subsequence | Hard | |
| 480 | Sliding Window Median | Hard | |
| 304 | Range Sum Query 2D - Immutable | Medium | |
| 1962 | Remove Stones to Minimize the Total | Medium | |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | |
| 560 | Subarray Sum Equals K | Medium | |
| 84 | Largest Rectangle in Histogram | Hard | |
| 778 | Swim in Rising Water | Hard | |
| 40 | Combination Sum II | Medium | |
| 780 | Reaching Points | Hard | |
| 1344 | Angle Between Hands of a Clock | Medium | |
| 567 | Permutation in String | Medium |