Prep
Code
Questions
Roadmap
CSES Set
Patterns & Comp
Companies
Profile
Sign In
Create Account
Home
Companies
Salesforce
Salesforce
196 questions
Interview frequency breakdown: 30-day, 3-month, 6-month & all-time
25 Easy
120 Med
51 Hard
All
Unsolved
Solved
Starred
Table
Topics
Filters
Timeframe:
All Time
196
Last 30 Days
2
Last 3 Months
11
Last 6 Months
33
> 6 Months
143
Showing
196
questions
#2571
Minimum Operations to Reduce an Integer to 0
Medium
dynamic programming
WalkCCC
100% Freq
30d
#443
String Compression
Medium
two pointers
WalkCCC
94% Freq
3m
#2551
Put Marbles in Bags
Hard
array
WalkCCC
90% Freq
30d
#210
Course Schedule II
Medium
depth first search
NeetCode
90% Freq
3m
#2380
Time Needed to Rearrange a Binary String
Medium
string
WalkCCC
85% Freq
6m
#460
LFU Cache
Hard
hash table
NeetCode
81% Freq
3m
#3488
Closest Equal Element Queries
Medium
array
WalkCCC
78% Freq
#56
Merge Intervals
Medium
array
NeetCode
77% Freq
6m
#3893
Maximum Team Size with Overlapping Intervals
Medium
intervals
WalkCCC
77% Freq
6m
#113
Path Sum II
Medium
backtracking
NeetCode
72% Freq
3m
#207
Course Schedule
Medium
depth first search
NeetCode
72% Freq
3m
#465
Optimal Account Balancing
Hard
array
WalkCCC
72% Freq
3m
#735
Asteroid Collision
Medium
array
NeetCode
72% Freq
3m
#2204
Distance to a Cycle in Undirected Graph
Hard
depth first search
WalkCCC
72% Freq
3m
#2718
Sum of Matrix After Queries
Medium
array
WalkCCC
72% Freq
3m
#2366
Minimum Replacements to Sort the Array
Hard
array
WalkCCC
72% Freq
6m
#3398
Smallest Substring With Identical Characters I
Hard
array
WalkCCC
71% Freq
#3399
Smallest Substring With Identical Characters II
Hard
string
WalkCCC
71% Freq
#713
Subarray Product Less Than K
Medium
array
NeetCode
69% Freq
#146
LRU Cache
Medium
hash table
NeetCode
68% Freq
#628
Maximum Product of Three Numbers
Easy
array
WalkCCC
68% Freq
6m
#1297
Maximum Number of Occurrences of a Substring
Medium
hash table
WalkCCC
68% Freq
#3035
Maximum Palindromes After Operations
Medium
array
WalkCCC
68% Freq
#3607
Power Grid Maintenance
Medium
array
WalkCCC
66% Freq
#2858
Minimum Edge Reversals So Every Node Is Reachable
Hard
dynamic programming
WalkCCC
65% Freq
6m
#115
Distinct Subsequences
Hard
string
NeetCode
65% Freq
#2957
Remove Adjacent Almost-Equal Characters
Medium
string
WalkCCC
64% Freq
#1221
Split a String in Balanced Strings
Easy
string
WalkCCC
63% Freq
#3540
Minimum Time to Visit All Houses
Medium
array
WalkCCC
63% Freq
#3613
Minimize Maximum Component Cost
Medium
binary search
WalkCCC
61% Freq
Page 1 of 7
Prev
Next