Salesforce
188 LeetCode interview questions
Curated Lists
Categories
All Questions
Topics
- Minimum Operations to Reduce an Integer to 0Medium0.6%100.0%
- String CompressionMedium0.6%87.8%
- Time Needed to Rearrange a Binary StringMedium0.5%80.8%
- LFU CacheHard0.5%80.0%
- Closest Equal Element QueriesMedium0.5%76.6%
- Smallest Substring With Identical Characters IHard0.2%72.5%
- Smallest Substring With Identical Characters IIHard0.4%72.5%
- Remove Adjacent Almost-Equal CharactersMedium0.5%71.3%
- Subarray Product Less Than KMedium0.5%70.1%
- LRU CacheMedium0.5%67.4%
- Maximum Number of Occurrences of a SubstringMedium0.5%67.4%
- Maximum Palindromes After OperationsMedium0.5%67.4%
- Maximum Product of Three NumbersEasy0.5%65.8%
- Minimize Malware SpreadHard0.4%65.8%
- Distinct SubsequencesHard0.5%64.2%
- Power Grid MaintenanceMedium0.6%64.2%
- Longest Substring Without Repeating CharactersMedium0.4%62.4%
- Count the Number of Fair PairsMedium0.5%62.4%
- Maximum Frequency StackHard0.7%62.4%
- Minimize Maximum Component CostMedium0.4%62.4%
- Group AnagramsMedium0.7%60.5%
- Merge IntervalsMedium0.5%60.5%
- Check Whether Two Strings are Almost EquivalentEasy0.6%60.5%
- Number of IslandsMedium0.6%60.5%
- Course Schedule IIMedium0.6%60.5%
- Beautiful Towers IIMedium0.4%60.5%
- Beautiful Towers IMedium0.4%60.5%
- Check If a Number Is Majority Element in a Sorted ArrayEasy0.6%60.5%
- Height CheckerEasy0.8%60.5%
- Matrix Similarity After Cyclic ShiftsEasy0.7%60.5%
- Number of Self-Divisible PermutationsMedium0.7%60.5%
- Maximum Number That Makes Result of Bitwise AND ZeroMedium0.7%60.5%
- Find Subarray With Bitwise OR Closest to KHard0.3%60.5%
- Equalize Strings by Adding or Removing Characters at EndsMedium0.6%60.5%
- Count the Number of InversionsHard0.3%60.5%
- Find the Minimum Area to Cover All Ones IIHard0.6%60.5%
- Find the Minimum Area to Cover All Ones IMedium0.8%60.5%
- Maximum Height of a TriangleEasy0.4%60.5%
- Maximize Grid HappinessHard0.4%60.5%
- Average Waiting TimeMedium0.7%60.5%
- Split a String in Balanced StringsEasy0.9%60.5%
- Minimum Time to Visit All HousesMedium0.7%60.5%
- Palindromic SubstringsMedium0.7%58.3%
- Delete and EarnMedium0.6%58.3%
- Binary Tree Maximum Path SumHard0.4%55.9%
- Find the Last Marked Nodes in TreeHard0.6%55.9%
- Longest Common SubsequenceMedium0.6%55.9%
- Best Time to Buy and Sell StockEasy0.6%53.2%
- Minimum Number of Taps to Open to Water a GardenHard0.5%53.2%
- Number of Divisible Triplet SumsMedium0.7%53.2%
- K-diff Pairs in an ArrayMedium0.5%53.2%
- Reverse Nodes in k-GroupHard0.7%53.2%
- All Nodes Distance K in Binary TreeMedium0.7%53.2%
- Count Subarrays With Median KHard0.5%53.2%
- Minimum Removals to Balance ArrayMedium0.5%53.2%
- Longest Palindromic SubstringMedium0.4%50.1%
- Trapping Rain WaterHard0.7%50.1%
- Min StackMedium0.6%50.1%
- Count Palindromic SubsequencesHard0.4%50.1%
- Number of Digit OneHard0.4%50.1%
- Two SumEasy0.6%50.1%
- Zigzag ConversionMedium0.5%50.1%
- Report Spam MessageMedium0.5%50.1%
- Minimum Window SubstringHard0.5%46.4%
- Kth Largest Element in an ArrayMedium0.7%46.4%
- Top K Frequent ElementsMedium0.7%46.4%
- Asteroid CollisionMedium0.5%46.4%
- Search Suggestions SystemMedium0.7%46.4%
- Sum of Nodes with Even-Valued GrandparentMedium0.9%46.4%
- Divide Array Into Arrays With Max DifferenceMedium0.8%46.4%
- Maximum Units on a TruckEasy0.7%46.4%
- Word SearchMedium0.5%46.4%
- Koko Eating BananasMedium0.5%46.4%
- Container With Most WaterMedium0.6%41.9%
- Merge k Sorted ListsHard0.6%41.9%
- Sort ColorsMedium0.7%41.9%
- Validate Binary Search TreeMedium0.4%41.9%
- Meeting Rooms IIMedium0.5%41.9%
- Coin ChangeMedium0.5%41.9%
- Rotting OrangesMedium0.6%41.9%
- Word LadderHard0.5%41.9%
- Magnetic Force Between Two BallsMedium0.7%41.9%
- Largest Number After Digit Swaps by ParityEasy0.7%41.9%
- Maximum SubarrayMedium0.5%41.9%
- Minimum Absolute DifferenceEasy0.8%41.9%
- Gas StationMedium0.5%41.9%
- Median of Two Sorted ArraysHard0.5%41.9%
- Minimum Difficulty of a Job ScheduleHard0.6%41.9%
- Boundary of Binary TreeMedium0.5%41.9%
- Odd String DifferenceEasy0.6%41.9%
- Subarrays with K Different IntegersHard0.7%41.9%
- Remove All Adjacent Duplicates in String IIMedium0.6%41.9%
- Path with Maximum GoldMedium0.7%41.9%
- 3SumMedium0.4%36.1%
- Valid ParenthesesEasy0.4%36.1%
- Search in Rotated Sorted ArrayMedium0.5%36.1%
- First Missing PositiveHard0.4%36.1%
- Word BreakMedium0.5%36.1%
- Maximal SquareMedium0.5%36.1%
- Find Median from Data StreamHard0.5%36.1%
- Decode StringMedium0.6%36.1%
- Count Binary SubstringsEasy0.7%36.1%
- Top K Frequent WordsMedium0.6%36.1%
- Verify Preorder Sequence in Binary Search TreeMedium0.5%36.1%
- Longest Increasing Path in a MatrixHard0.6%36.1%
- Find Leaves of Binary TreeMedium0.8%36.1%
- Longest Increasing SubsequenceMedium0.6%36.1%
- Sliding Window MaximumHard0.5%36.1%
- Reorganize StringMedium0.6%36.1%
- Number of Visible People in a QueueHard0.7%36.1%
- Max Consecutive Ones IIIMedium0.7%36.1%
- Optimal Account BalancingHard0.5%36.1%
- Merge Two Sorted ListsEasy0.7%36.1%
- All Possible Full Binary TreesMedium0.8%36.1%
- Maximal RectangleHard0.6%36.1%
- House Robber IIIMedium0.6%36.1%
- Network Delay TimeMedium0.6%36.1%
- Reconstruct ItineraryHard0.4%36.1%
- Missing NumberEasy0.7%36.1%
- Design TwitterMedium0.4%36.1%
- Diameter of N-Ary TreeMedium0.8%36.1%
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitMedium0.6%36.1%
- Valid Parenthesis StringMedium0.4%36.1%
- Course ScheduleMedium0.5%36.1%
- Collect Coins in a TreeHard0.4%36.1%
- Generate ParenthesesMedium0.8%36.1%
- Strange PrinterHard0.6%36.1%
- Maximum Team Size with Overlapping IntervalsMedium0.5%36.1%
- Integer to RomanMedium0.7%28.2%
- Roman to IntegerEasy0.7%28.2%
- Combination SumMedium0.8%28.2%
- Product of Array Except SelfMedium0.7%28.2%
- Masking Personal InformationMedium0.6%28.2%
- Maximum Product SubarrayMedium0.4%28.2%
- Maximum Number of Ways to Partition an ArrayHard0.4%28.2%
- Maximum Number of Non-overlapping Palindrome SubstringsHard0.4%28.2%
- Basic CalculatorHard0.5%28.2%
- K Closest Points to OriginMedium0.7%28.2%
- Exclusive Time of FunctionsMedium0.7%28.2%
- Shortest Distance to Target String in a Circular ArrayEasy0.7%28.2%
- Game of LifeMedium0.7%28.2%
- Last Stone WeightEasy0.7%28.2%
- Path Sum IIIMedium0.5%28.2%
- CandyHard0.5%28.2%
- Maximum Earnings From TaxiMedium0.5%28.2%
- Least Number of Unique Integers after K RemovalsMedium0.6%28.2%
- Backspace String CompareEasy0.5%28.2%
- Design Snake GameMedium0.4%28.2%
- Find Pivot IndexEasy0.6%28.2%
- Encode and Decode TinyURLMedium0.9%28.2%
- Valid PalindromeEasy0.5%28.2%
- Max Chunks To Make Sorted IIHard0.5%28.2%
- Bus RoutesHard0.5%28.2%
- Minimum Equal Sum of Two Arrays After Replacing ZerosMedium0.5%28.2%
- Finding the Number of Visible MountainsMedium0.4%28.2%
- Number of Operations to Make Network ConnectedMedium0.7%28.2%
- Kth Largest Element in a StreamEasy0.6%28.2%
- Find Duplicate SubtreesMedium0.6%28.2%
- Course Schedule IIIHard0.4%28.2%
- House Robber IIMedium0.5%28.2%
- Maximum Path Quality of a GraphHard0.6%28.2%
- Partition Equal Subset SumMedium0.5%28.2%
- Tree DiameterMedium0.6%28.2%
- Using a Robot to Print the Lexicographically Smallest StringMedium0.6%28.2%
- Lexicographically Minimum String After Removing StarsMedium0.5%28.2%
- Shortest BridgeMedium0.6%28.2%
- Count Vowel Substrings of a StringEasy0.7%28.2%
- Spiral MatrixMedium0.6%28.2%
- Longest Substring Of All Vowels in OrderMedium0.5%28.2%
- Find the Duplicate NumberMedium0.6%28.2%
- Minimum Array SumMedium0.3%28.2%
- Construct Binary Tree from Preorder and Inorder TraversalMedium0.7%28.2%
- Burst BalloonsHard0.6%28.2%
- Time Taken to Cross the DoorHard0.5%28.2%
- Find K Closest ElementsMedium0.5%28.2%
- Coin Change IIMedium0.6%28.2%
- Sort Characters By FrequencyMedium0.8%28.2%
- Time Based Key-Value StoreMedium0.5%28.2%
- Vertical Order Traversal of a Binary TreeHard0.5%28.2%
- Minimum Window SubsequenceHard0.4%28.2%
- Sliding Window MedianHard0.4%28.2%
- Range Sum Query 2D - ImmutableMedium0.6%28.2%
- Remove Stones to Minimize the TotalMedium0.7%28.2%
- Minimum Replacements to Sort the ArrayHard0.5%28.2%
- Partition Array Into Two Arrays to Minimize Sum DifferenceHard0.2%28.2%
- Minimum Edge Reversals So Every Node Is ReachableHard0.6%28.2%
- Subarray Sum Equals KMedium0.5%28.2%
- Largest Rectangle in HistogramHard0.5%28.2%
Showing 188 of 188 questions.