Salesforce LeetCode Interview Questions
Practice 46 real coding problems frequently asked in Salesforce technical interviews. Master these questions to ace your next Salesforce software engineering interview.
Top Topics at Salesforce
Ace your Salesforce interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Salesforce Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Minimum Path Sum 100% | MediumM | Solve→ |
Maximum Beauty of an Array After Applying Operation 93% | MediumM | Solve→ |
Maximum Product Subarray 93% | MediumM | Solve→ |
Remove Nth Node From End of List 92% | MediumM | Solve→ |
Valid Number 91% | HardH | Solve→ |
Reverse Integer 88% | MediumM | Solve→ |
Squares of a Sorted Array 85% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 84% | HardH | Solve→ |
Recyclable and Low Fat Products 82% | EasyE | Solve→ |
Capacity To Ship Packages Within D Days 82% | MediumM | Solve→ |
K Closest Points to Origin 82% | MediumM | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 80% | EasyE | Solve→ |
Frequency of the Most Frequent Element 79% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 76% | MediumM | Solve→ |
Plus One 76% | EasyE | Solve→ |
Binary Search Tree Iterator 75% | MediumM | Solve→ |
Valid Palindrome III 74% | HardH | Solve→ |
Remove Letter To Equalize Frequency 71% | EasyE | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 67% | MediumM | Solve→ |
Analyze User Website Visit Pattern 64% | MediumM | Solve→ |
All Nodes Distance K in Binary Tree 64% | MediumM | Solve→ |
Find the Celebrity 63% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 62% | MediumM | Solve→ |
Zigzag Conversion 60% | MediumM | Solve→ |
Combination Sum II 59% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Meeting Rooms II 58% | MediumM | Solve→ |
Container With Most Water 58% | MediumM | Solve→ |
Reverse Nodes in k-Group 55% | HardH | Solve→ |
Search Insert Position 54% | EasyE | Solve→ |
Reverse Words in a String 53% | MediumM | Solve→ |
Maximum Subarray 52% | MediumM | Solve→ |
Minimum Absolute Difference 51% | EasyE | Solve→ |
Maximize Amount After Two Days of Conversions 47% | MediumM | Solve→ |
Basic Calculator 46% | HardH | Solve→ |
Roman to Integer 44% | EasyE | Solve→ |
Word Ladder 42% | HardH | Solve→ |
Shortest Word Distance II 41% | MediumM | Solve→ |
Move Pieces to Obtain a String 41% | MediumM | Solve→ |
Rank Transform of a Matrix 34% | HardH | Solve→ |
Decode String 34% | MediumM | Solve→ |
Subsets 33% | MediumM | Solve→ |
Minimum Array Sum 33% | MediumM | Solve→ |
Add Two Integers 28% | EasyE | Solve→ |
Make String a Subsequence Using Cyclic Increments 26% | MediumM | Solve→ |
Permutations 21% | MediumM | Solve→ |
Sliding Window Maximum 21% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Salesforce ask in interviews?
Salesforce commonly asks 46 coding problems in technical interviews, including Minimum Path Sum, Maximum Beauty of an Array After Applying Operation, Maximum Product Subarray. The difficulty breakdown is 9 Easy, 29 Medium, and 8 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 9 Easy (20%), 29 Medium (63%), and 8 Hard (17%) problems.
Ready to ace your Salesforce interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required