← Back to Interview Questions

Salesforce LeetCode Problems

6 most frequently asked LeetCode problems in Salesforce technical interviews

Difficulty breakdown: 0 Easy, 5 Medium, 1 Hard

ProblemDifficultyDiffFrequencyTagsAction
K-diff Pairs in an Array
100%
MediumM
100%
ArrayHash Table+3
Solve→
Maximum Number of Occurrences of a Substring
100%
MediumM
100%
Hash TableString+1
Solve→
Number of Islands
88%
MediumM
88%
ArrayDepth-First Search+3
Solve→
Longest Increasing Subsequence
88%
MediumM
88%
ArrayBinary Search+1
Solve→
LFU Cache
88%
HardH
88%
Hash TableLinked List+2
Solve→
Palindromic Substrings
88%
MediumM
88%
Two PointersString+1
Solve→
Skip to content

Interview Solver

FeaturesPricing
Sign In
Interview Solver
  • Home
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Use Cases
  • Software Engineer
  • Product Manager
  • Privacy Policy
  • Terms and Conditions
  • Discord Community
  • Affiliate Program
  • Interview Questions
  • Google Interview Questions
  • Amazon Interview Questions
  • Microsoft Interview Questions
  • Meta Interview Questions
  • Apple Interview Questions
  • TikTok Interview Questions
  • View All →
© 2025 Interview Solver, Inc. All rights reserved.