Question 1

Word Break — Salesforce Interview Question

Accepted Answer

"Word Break" is a medium difficulty problem asked at Salesforce interviews. It covers the following topics: Array, Hash Table, String, Dynamic Programming, Trie, Memoization. You can practice it on LeetCode: https://leetcode.com/problems/word-break

Question 2

Subarray Product Less Than K — Salesforce Interview Question

Accepted Answer

"Subarray Product Less Than K" is a medium difficulty problem asked at Salesforce interviews. It covers the following topics: Array, Binary Search, Sliding Window, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/subarray-product-less-than-k

Question 3

String Compression — Salesforce Interview Question

Accepted Answer

"String Compression" is a medium difficulty problem asked at Salesforce interviews. It covers the following topics: Two Pointers, String. You can practice it on LeetCode: https://leetcode.com/problems/string-compression

Question 4

LFU Cache — Salesforce Interview Question

Accepted Answer

"LFU Cache" is a hard difficulty problem asked at Salesforce interviews. It covers the following topics: Hash Table, Linked List, Design, Doubly-Linked List. You can practice it on LeetCode: https://leetcode.com/problems/lfu-cache

Question 5

Distinct Subsequences — Salesforce Interview Question

Accepted Answer

"Distinct Subsequences" is a hard difficulty problem asked at Salesforce interviews. It covers the following topics: String, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/distinct-subsequences

Question 6

Merge Intervals — Salesforce Interview Question

Accepted Answer

"Merge Intervals" is a medium difficulty problem asked at Salesforce interviews. It covers the following topics: Array, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/merge-intervals

#	Question Title	Difficulty	Frequency	Topics
1	Word Break	MEDIUM	93.6	ArrayHash TableString+3
2	Subarray Product Less Than K	MEDIUM	87.3	ArrayBinary SearchSliding Window+1
3	String Compression	MEDIUM	84.8	Two PointersString
4	LFU Cache	HARD	80.4	Hash TableLinked ListDesign+1
5	Distinct Subsequences	HARD	80.4	StringDynamic Programming
6	Merge Intervals	MEDIUM	80.4	ArraySorting
7	LRU Cache	MEDIUM	78.8	Hash TableLinked ListDesign+1
8	Group Anagrams	MEDIUM	75.1	ArrayHash TableString+1
9	Number of Islands	MEDIUM	75.1	ArrayDepth-First SearchBreadth-First Search+2
10	Longest Substring Without Repeating Characters	MEDIUM	73.0	Hash TableStringSliding Window

Explore 450+ Companies

Companies

Salesforce

Want to see more?

Salesforce Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Salesforce

Want to see more?

Salesforce Interview Questions

Ai Assistant Kas