Salesforce LeetCode Interview Questions

Practice 193 coding problems currently tagged to Salesforce. Use the frequency and topic signals to build a focused software engineering interview practice plan.

Last updated: September 28, 2026

25 Easy

117 Medium

51 Hard

Top Topics at Salesforce

Array String Hash Table Dynamic Programming Sorting

Ace your Salesforce interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Problem	DifficultyDiff	Frequency	Topics	Action
Minimum Operations to Reduce an Integer to 0 100%	MediumM	100%	Dynamic Programming Greedy+1	Solve→
String Compression 88.1%	MediumM	88.1%	Two Pointers String	Solve→
Time Needed to Rearrange a Binary String 79.6%	MediumM	79.6%	String Dynamic Programming+1	Solve→
LFU Cache 78.9%	HardH	78.9%	Hash Table Linked List+2	Solve→
Closest Equal Element Queries 75.5%	MediumM	75.5%	Array Hash Table+1	Solve→
Smallest Substring With Identical Characters I 71.5%	HardH	71.5%	Array Binary Search+1	Solve→
Smallest Substring With Identical Characters II 71.5%	HardH	71.5%	String Binary Search	Solve→
Maximum Product of Three Numbers 67.8%	EasyE	67.8%	Array Math+1	Solve→
Remove Adjacent Almost-Equal Characters 67.8%	MediumM	67.8%	String Dynamic Programming+1	Solve→
Subarray Product Less Than K 66.4%	MediumM	66.4%	Array Binary Search+2	Solve→
Minimize Malware Spread 66.4%	HardH	66.4%	Array Hash Table+4	Solve→
Maximum Number of Occurrences of a Substring 66.4%	MediumM	66.4%	Hash Table String+1	Solve→
Maximum Palindromes After Operations 66.4%	MediumM	66.4%	Array Hash Table+4	Solve→
Merge Intervals 64.9%	MediumM	64.9%	Array Sorting+1	Solve→
LRU Cache 64.9%	MediumM	64.9%	Hash Table Linked List+2	Solve→
Course Schedule II 64.9%	MediumM	64.9%	Depth-First Search Breadth-First Search+2	Solve→
Power Grid Maintenance 64.9%	MediumM	64.9%	Array Hash Table+6	Solve→
Distinct Subsequences 63.3%	HardH	63.3%	String Dynamic Programming	Solve→
Longest Substring Without Repeating Characters 61.5%	MediumM	61.5%	Hash Table String+1	Solve→
Minimize Maximum Component Cost 61.5%	MediumM	61.5%	Binary Search Union-Find+2	Solve→
Group Anagrams 59.6%	MediumM	59.6%	Array Hash Table+2	Solve→
Split a String in Balanced Strings 59.6%	EasyE	59.6%	String Greedy+1	Solve→
Minimum Time to Visit All Houses 59.6%	MediumM	59.6%	Array Prefix Sum	Solve→
Number of Islands 57.5%	MediumM	57.5%	Array Depth-First Search+3	Solve→
Palindromic Substrings 57.5%	MediumM	57.5%	Two Pointers String+1	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Count the Number of Fair Pairs 57.5%	MediumM	57.5%	Array Two Pointers+2	Solve→
Maximum Frequency Stack 57.5%	HardH	57.5%	Hash Table Stack+2	Solve→
Delete and Earn 57.5%	MediumM	57.5%	Array Hash Table+1	Solve→
Special Binary String 57.5%	HardH	57.5%	String Divide and Conquer+1	Solve→
Decrypt String from Alphabet to Integer Mapping 57.5%	EasyE	57.5%	String	Solve→
Binary Tree Maximum Path Sum 55.1%	HardH	55.1%	Dynamic Programming Tree+3	Solve→
Check Whether Two Strings are Almost Equivalent 55.1%	EasyE	55.1%	Hash Table String+1	Solve→
Beautiful Towers II 55.1%	MediumM	55.1%	Array Stack+1	Solve→
Beautiful Towers I 55.1%	MediumM	55.1%	Array Stack+1	Solve→
Check If a Number Is Majority Element in a Sorted Array 55.1%	EasyE	55.1%	Array Binary Search	Solve→
Height Checker 55.1%	EasyE	55.1%	Array Sorting+2	Solve→
Matrix Similarity After Cyclic Shifts 55.1%	EasyE	55.1%	Array Math+2	Solve→
Number of Self-Divisible Permutations 55.1%	MediumM	55.1%	Array Math+5	Solve→
Maximum Number That Makes Result of Bitwise AND Zero 55.1%	MediumM	55.1%	String Greedy+1	Solve→
Find Subarray With Bitwise OR Closest to K 55.1%	HardH	55.1%	Array Binary Search+2	Solve→
Equalize Strings by Adding or Removing Characters at Ends 55.1%	MediumM	55.1%	String Binary Search+3	Solve→
Count the Number of Inversions 55.1%	HardH	55.1%	Array Dynamic Programming	Solve→
Find the Minimum Area to Cover All Ones II 55.1%	HardH	55.1%	Array Matrix+1	Solve→
Find the Minimum Area to Cover All Ones I 55.1%	MediumM	55.1%	Array Matrix	Solve→
Maximum Height of a Triangle 55.1%	EasyE	55.1%	Array Enumeration	Solve→
Maximize Grid Happiness 55.1%	HardH	55.1%	Dynamic Programming Bit Manipulation+2	Solve→
Average Waiting Time 55.1%	MediumM	55.1%	Array Simulation	Solve→
Find the Last Marked Nodes in Tree 55.1%	HardH	55.1%	Tree Depth-First Search	Solve→
Longest Common Subsequence 55.1%	MediumM	55.1%	String Dynamic Programming+1	Solve→
Minimum Removals to Balance Array 55.1%	MediumM	55.1%	Array Binary Search+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Exam Room 55.1%	MediumM	55.1%	Design Heap (Priority Queue)+1	Solve→
Asteroid Collision 52.4%	MediumM	52.4%	Array Stack+1	Solve→
Number of Divisible Triplet Sums 52.4%	MediumM	52.4%	Array Hash Table	Solve→
K-diff Pairs in an Array 52.4%	MediumM	52.4%	Array Hash Table+3	Solve→
Reverse Nodes in k-Group 52.4%	HardH	52.4%	Linked List Recursion	Solve→
All Nodes Distance K in Binary Tree 52.4%	MediumM	52.4%	Hash Table Tree+3	Solve→
Count Subarrays With Median K 52.4%	HardH	52.4%	Array Hash Table+1	Solve→
Longest Palindromic Substring 49.3%	MediumM	49.3%	Two Pointers String+2	Solve→
Trapping Rain Water 49.3%	HardH	49.3%	Array Two Pointers+3	Solve→
Best Time to Buy and Sell Stock 49.3%	EasyE	49.3%	Array Dynamic Programming	Solve→
Min Stack 49.3%	MediumM	49.3%	Stack Design	Solve→
Zigzag Conversion 49.3%	MediumM	49.3%	String	Solve→
Report Spam Message 49.3%	MediumM	49.3%	Array Hash Table+1	Solve→
Course Schedule 49.3%	MediumM	49.3%	Depth-First Search Breadth-First Search+3	Solve→
Container With Most Water 45.7%	MediumM	45.7%	Array Two Pointers+1	Solve→
Merge k Sorted Lists 45.7%	HardH	45.7%	Linked List Divide and Conquer+3	Solve→
Minimum Window Substring 45.7%	HardH	45.7%	Hash Table String+1	Solve→
Kth Largest Element in an Array 45.7%	MediumM	45.7%	Array Divide and Conquer+3	Solve→
Top K Frequent Elements 45.7%	MediumM	45.7%	Array Hash Table+6	Solve→
Minimum Number of Taps to Open to Water a Garden 45.7%	HardH	45.7%	Array Dynamic Programming+1	Solve→
Maximum Units on a Truck 45.7%	EasyE	45.7%	Array Greedy+1	Solve→
Word Search 45.7%	MediumM	45.7%	Array String+3	Solve→
Minimum Absolute Difference 45.7%	EasyE	45.7%	Array Sorting	Solve→
Koko Eating Bananas 45.7%	MediumM	45.7%	Array Binary Search	Solve→
Optimal Account Balancing 45.7%	HardH	45.7%	Array Dynamic Programming+3	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Remove All Adjacent Duplicates in String II 45.7%	MediumM	45.7%	String Stack	Solve→
Maximum Team Size with Overlapping Intervals 45.7%	MediumM	45.7%		Solve→
Sort Colors 41.2%	MediumM	41.2%	Array Two Pointers+3	Solve→
Validate Binary Search Tree 41.2%	MediumM	41.2%	Tree Depth-First Search+2	Solve→
Meeting Rooms II 41.2%	MediumM	41.2%	Array Two Pointers+4	Solve→
Coin Change 41.2%	MediumM	41.2%	Array Dynamic Programming+3	Solve→
Rotting Oranges 41.2%	MediumM	41.2%	Array Breadth-First Search+1	Solve→
Word Ladder 41.2%	HardH	41.2%	Hash Table String+2	Solve→
Number of Digit One 41.2%	HardH	41.2%	Math Dynamic Programming+1	Solve→
Largest Number After Digit Swaps by Parity 41.2%	EasyE	41.2%	Sorting Heap (Priority Queue)	Solve→
Verify Preorder Sequence in Binary Search Tree 41.2%	MediumM	41.2%	Array Stack+5	Solve→
Gas Station 41.2%	MediumM	41.2%	Array Greedy	Solve→
Longest Increasing Subsequence 41.2%	MediumM	41.2%	Array Binary Search+2	Solve→
Number of Visible People in a Queue 41.2%	HardH	41.2%	Array Stack+1	Solve→
Median of Two Sorted Arrays 41.2%	HardH	41.2%	Array Binary Search+1	Solve→
Minimum Difficulty of a Job Schedule 41.2%	HardH	41.2%	Array Dynamic Programming	Solve→
Boundary of Binary Tree 41.2%	MediumM	41.2%	Tree Depth-First Search+1	Solve→
Odd String Difference 41.2%	EasyE	41.2%	Array Hash Table+1	Solve→
Subarrays with K Different Integers 41.2%	HardH	41.2%	Array Hash Table+2	Solve→
Network Delay Time 41.2%	MediumM	41.2%	Depth-First Search Breadth-First Search+4	Solve→
Path with Maximum Gold 41.2%	MediumM	41.2%	Array Backtracking+1	Solve→
Design Twitter 41.2%	MediumM	41.2%	Hash Table Linked List+2	Solve→
Count Vowel Substrings of a String 41.2%	EasyE	41.2%	Hash Table String	Solve→
Collect Coins in a Tree 41.2%	HardH	41.2%	Array Tree+2	Solve→
Generate Parentheses 41.2%	MediumM	41.2%	String Dynamic Programming+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Minimum Replacements to Sort the Array 41.2%	HardH	41.2%	Array Math+1	Solve→
3Sum 35.6%	MediumM	35.6%	Array Two Pointers+1	Solve→
Valid Parentheses 35.6%	EasyE	35.6%	String Stack+1	Solve→
Search in Rotated Sorted Array 35.6%	MediumM	35.6%	Array Binary Search	Solve→
Combination Sum 35.6%	MediumM	35.6%	Array Backtracking	Solve→
First Missing Positive 35.6%	HardH	35.6%	Array Hash Table	Solve→
Maximal Square 35.6%	MediumM	35.6%	Array Dynamic Programming+1	Solve→
Product of Array Except Self 35.6%	MediumM	35.6%	Array Prefix Sum	Solve→
Find Median from Data Stream 35.6%	HardH	35.6%	Two Pointers Design+3	Solve→
Decode String 35.6%	MediumM	35.6%	String Stack+1	Solve→
Two Sum 35.6%	EasyE	35.6%	Array Hash Table	Solve→
Magnetic Force Between Two Balls 35.6%	MediumM	35.6%	Array Binary Search+1	Solve→
Maximum Subarray 35.6%	MediumM	35.6%	Array Divide and Conquer+1	Solve→
Top K Frequent Words 35.6%	MediumM	35.6%	Array Hash Table+6	Solve→
Longest Increasing Path in a Matrix 35.6%	HardH	35.6%	Array Dynamic Programming+7	Solve→
Find Leaves of Binary Tree 35.6%	MediumM	35.6%	Tree Depth-First Search+2	Solve→
K Closest Points to Origin 35.6%	MediumM	35.6%	Array Math+6	Solve→
Sliding Window Maximum 35.6%	HardH	35.6%	Array Queue+4	Solve→
Reorganize String 35.6%	MediumM	35.6%	Hash Table String+4	Solve→
Max Consecutive Ones III 35.6%	MediumM	35.6%	Array Binary Search+2	Solve→
Merge Two Sorted Lists 35.6%	EasyE	35.6%	Linked List Recursion	Solve→
All Possible Full Binary Trees 35.6%	MediumM	35.6%	Dynamic Programming Tree+3	Solve→
Maximal Rectangle 35.6%	HardH	35.6%	Array Dynamic Programming+3	Solve→
House Robber III 35.6%	MediumM	35.6%	Dynamic Programming Tree+3	Solve→
Reconstruct Itinerary 35.6%	HardH	35.6%	Array String+7	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Missing Number 35.6%	EasyE	35.6%	Array Hash Table+4	Solve→
Diameter of N-Ary Tree 35.6%	MediumM	35.6%	Tree Depth-First Search+1	Solve→
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 35.6%	MediumM	35.6%	Array Queue+4	Solve→
Valid Parenthesis String 35.6%	MediumM	35.6%	String Dynamic Programming+3	Solve→
Tree Diameter 35.6%	MediumM	35.6%	Tree Depth-First Search+4	Solve→
Using a Robot to Print the Lexicographically Smallest String 35.6%	MediumM	35.6%	Hash Table String+2	Solve→
Strange Printer 35.6%	HardH	35.6%	String Dynamic Programming	Solve→
Vertical Order Traversal of a Binary Tree 35.6%	HardH	35.6%	Hash Table Tree+4	Solve→
Remove Stones to Minimize the Total 35.6%	MediumM	35.6%	Array Greedy+1	Solve→
Minimum Edge Reversals So Every Node Is Reachable 35.6%	HardH	35.6%	Dynamic Programming Depth-First Search+2	Solve→
Integer to Roman 27.7%	MediumM	27.7%	Hash Table Math+1	Solve→
Roman to Integer 27.7%	EasyE	27.7%	Hash Table Math+1	Solve→
Count Binary Substrings 27.7%	EasyE	27.7%	Two Pointers String	Solve→
Maximum Number of Ways to Partition an Array 27.7%	HardH	27.7%	Array Hash Table+3	Solve→
Maximum Number of Non-overlapping Palindrome Substrings 27.7%	HardH	27.7%	Two Pointers String+2	Solve→
Basic Calculator 27.7%	HardH	27.7%	Math String+2	Solve→
Exclusive Time of Functions 27.7%	MediumM	27.7%	Array Stack	Solve→
Shortest Distance to Target String in a Circular Array 27.7%	EasyE	27.7%	Array String	Solve→
Game of Life 27.7%	MediumM	27.7%	Array Matrix+1	Solve→
Last Stone Weight 27.7%	EasyE	27.7%	Array Heap (Priority Queue)	Solve→
Path Sum III 27.7%	MediumM	27.7%	Tree Depth-First Search+1	Solve→
Candy 27.7%	HardH	27.7%	Array Greedy	Solve→
Maximum Earnings From Taxi 27.7%	MediumM	27.7%	Array Hash Table+3	Solve→
Least Number of Unique Integers after K Removals 27.7%	MediumM	27.7%	Array Hash Table+3	Solve→
Backspace String Compare 27.7%	EasyE	27.7%	Two Pointers String+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Design Snake Game 27.7%	MediumM	27.7%	Array Hash Table+3	Solve→
Find Pivot Index 27.7%	EasyE	27.7%	Array Prefix Sum	Solve→
Encode and Decode TinyURL 27.7%	MediumM	27.7%	Hash Table String+2	Solve→
Valid Palindrome 27.7%	EasyE	27.7%	Two Pointers String	Solve→
Max Chunks To Make Sorted II 27.7%	HardH	27.7%	Array Stack+3	Solve→
Bus Routes 27.7%	HardH	27.7%	Array Hash Table+1	Solve→
Finding the Number of Visible Mountains 27.7%	MediumM	27.7%	Array Stack+2	Solve→
Number of Operations to Make Network Connected 27.7%	MediumM	27.7%	Depth-First Search Breadth-First Search+2	Solve→
Find Duplicate Subtrees 27.7%	MediumM	27.7%	Hash Table Tree+2	Solve→
Course Schedule III 27.7%	HardH	27.7%	Array Greedy+2	Solve→
House Robber II 27.7%	MediumM	27.7%	Array Dynamic Programming	Solve→
Partition Equal Subset Sum 27.7%	MediumM	27.7%	Array Dynamic Programming+2	Solve→
Lexicographically Minimum String After Removing Stars 27.7%	MediumM	27.7%	Hash Table String+3	Solve→
Shortest Bridge 27.7%	MediumM	27.7%	Array Depth-First Search+2	Solve→
Spiral Matrix 27.7%	MediumM	27.7%	Array Matrix+1	Solve→
Longest Substring Of All Vowels in Order 27.7%	MediumM	27.7%	String Sliding Window	Solve→
Find the Duplicate Number 27.7%	MediumM	27.7%	Array Two Pointers+4	Solve→
Minimum Array Sum 27.7%	MediumM	27.7%	Array Dynamic Programming	Solve→
Construct Binary Tree from Preorder and Inorder Traversal 27.7%	MediumM	27.7%	Array Hash Table+3	Solve→
Burst Balloons 27.7%	HardH	27.7%	Array Dynamic Programming	Solve→
Time Taken to Cross the Door 27.7%	HardH	27.7%	Array Queue+1	Solve→
Find K Closest Elements 27.7%	MediumM	27.7%	Array Two Pointers+4	Solve→
Coin Change II 27.7%	MediumM	27.7%	Array Dynamic Programming+2	Solve→
Sort Characters By Frequency 27.7%	MediumM	27.7%	Hash Table String+4	Solve→
Time Based Key-Value Store 27.7%	MediumM	27.7%	Hash Table String+2	Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial

Minimum Window Subsequence 27.7%	HardH	27.7%	String Dynamic Programming+1	Solve→
Range Sum Query 2D - Immutable 27.7%	MediumM	27.7%	Array Design+2	Solve→
Partition Array Into Two Arrays to Minimize Sum Difference 27.7%	HardH	27.7%	Array Two Pointers+7	Solve→
Subarray Sum Equals K 27.7%	MediumM	27.7%	Array Hash Table+1	Solve→
Largest Rectangle in Histogram 27.7%	HardH	27.7%	Array Stack+2	Solve→
Swim in Rising Water 27.7%	HardH	27.7%	Array Binary Search+7	Solve→
Combination Sum II 27.7%	MediumM	27.7%	Array Backtracking	Solve→
Reaching Points 27.7%	HardH	27.7%	Math Euclidean Algorithm+1	Solve→
Angle Between Hands of a Clock 27.7%	MediumM	27.7%	Math	Solve→
Permutation in String 27.7%	MediumM	27.7%	Hash Table Two Pointers+2	Solve→
Fruit Into Baskets 27.7%	MediumM	27.7%	Array Hash Table+1	Solve→
Construct Binary Search Tree from Preorder Traversal 27.7%	MediumM	27.7%	Array Stack+4	Solve→
Amount of Time for Binary Tree to Be Infected 27.7%	MediumM	27.7%	Hash Table Tree+3	Solve→
Find the Smallest Divisor Given a Threshold 27.7%	MediumM	27.7%	Array Binary Search	Solve→
Convert Sorted List to Binary Search Tree 27.7%	MediumM	27.7%	Linked List Divide and Conquer+3	Solve→
Longest Consecutive Sequence 27.7%	MediumM	27.7%	Array Hash Table+1	Solve→
Minimum Equal Sum of Two Arrays After Replacing Zeros 27.7%	MediumM	27.7%	Array Greedy	Solve→
Palindrome Partitioning 27.7%	MediumM	27.7%	String Dynamic Programming+1	Solve→

Explore company practice sets with a similar number of tagged coding questions.

Frequently Asked Questions

What LeetCode problems are tagged to Salesforce?

Our current Salesforce practice dataset contains 193 tagged coding problems, including Minimum Operations to Reduce an Integer to 0, String Compression, Time Needed to Rearrange a Binary String. The difficulty breakdown is 25 Easy, 117 Medium, and 51 Hard problems.

How should I prepare for a Salesforce coding interview?

Focus on the most frequently asked problems first, especially those with high frequency scores. Salesforce interviews typically emphasize Array and String. Practice explaining your thought process while coding.

What is the difficulty level of Salesforce coding interviews?

Based on our data, Salesforce interviews include 25 Easy (13%), 117 Medium (61%), and 51 Hard (26%) problems.

Ready to ace your Salesforce interview?

Join thousands of engineers who landed offers at top tech companies.

Get Started Free

No credit card required

Top Topics at Salesforce