Salesforce
Enterprise-scale loops — data structures, then multi-tenant design questions and a values round built around the company's Ohana framing.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: two coding rounds
- 4Multi-tenant system design round
- 5Values and behavioral round
Questions
Callback's practice questions and the LeetCode questions Salesforce has been asking, filtered together.
Asked on LeetCode
193 questions · all time
- Minimum Operations to Reduce an Integer to 0mediumDynamic ProgrammingGreedyBit Manipulationfrequency 100.0
- String CompressionmediumTwo PointersStringfrequency 88.1
- Time Needed to Rearrange a Binary StringmediumStringDynamic ProgrammingSimulationfrequency 79.6
- LFU CachehardHash TableLinked ListDesignDoubly-Linked Listfrequency 78.9
- Closest Equal Element QueriesmediumArrayHash TableBinary Searchfrequency 75.5
- Smallest Substring With Identical Characters IhardArrayBinary SearchEnumerationfrequency 71.5
- Smallest Substring With Identical Characters IIhardStringBinary Searchfrequency 71.5
- Maximum Product of Three NumberseasyArrayMathSortingfrequency 67.8
- Remove Adjacent Almost-Equal CharactersmediumStringDynamic ProgrammingGreedyfrequency 67.8
- Maximum Number of Occurrences of a SubstringmediumHash TableStringSliding Windowfrequency 66.4
- Maximum Palindromes After OperationsmediumArrayHash TableStringGreedy+2frequency 66.4
- Minimize Malware SpreadhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 66.4
- Subarray Product Less Than KmediumArrayBinary SearchSliding WindowPrefix Sumfrequency 66.4
- Course Schedule IImediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 64.9
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 64.9
- Merge IntervalsmediumArraySortingQuicksortfrequency 64.9
- Power Grid MaintenancemediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 64.9
- Distinct SubsequenceshardStringDynamic Programmingfrequency 63.3
- Longest Substring Without Repeating CharactersmediumHash TableStringSliding Windowfrequency 61.5
- Minimize Maximum Component CostmediumBinary SearchUnion-FindGraph TheorySortingfrequency 61.5
- Group AnagramsmediumArrayHash TableStringSortingfrequency 59.6
- Minimum Time to Visit All HousesmediumArrayPrefix Sumfrequency 59.6
- Split a String in Balanced StringseasyStringGreedyCountingfrequency 59.6
- Count the Number of Fair PairsmediumArrayTwo PointersBinary SearchSortingfrequency 57.5
- Decrypt String from Alphabet to Integer MappingeasyStringfrequency 57.5
- Delete and EarnmediumArrayHash TableDynamic Programmingfrequency 57.5
- Maximum Frequency StackhardHash TableStackDesignOrdered Setfrequency 57.5
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 57.5
- Palindromic SubstringsmediumTwo PointersStringDynamic Programmingfrequency 57.5
- Special Binary StringhardStringDivide and ConquerSortingfrequency 57.5
- Average Waiting TimemediumArraySimulationfrequency 55.1
- Beautiful Towers ImediumArrayStackMonotonic Stackfrequency 55.1
- Beautiful Towers IImediumArrayStackMonotonic Stackfrequency 55.1
- Binary Tree Maximum Path SumhardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 55.1
- Check If a Number Is Majority Element in a Sorted ArrayeasyArrayBinary Searchfrequency 55.1
- Check Whether Two Strings are Almost EquivalenteasyHash TableStringCountingfrequency 55.1
- Count the Number of InversionshardArrayDynamic Programmingfrequency 55.1
- Equalize Strings by Adding or Removing Characters at EndsmediumStringBinary SearchDynamic ProgrammingSliding Window+1frequency 55.1
- Exam RoommediumDesignHeap (Priority Queue)Ordered Setfrequency 55.1
- Find Subarray With Bitwise OR Closest to KhardArrayBinary SearchBit ManipulationSegment Treefrequency 55.1
- Find the Last Marked Nodes in TreehardTreeDepth-First Searchfrequency 55.1
- Find the Minimum Area to Cover All Ones ImediumArrayMatrixfrequency 55.1
- Find the Minimum Area to Cover All Ones IIhardArrayMatrixEnumerationfrequency 55.1
- Height CheckereasyArraySortingCounting SortBubble Sortfrequency 55.1
- Longest Common SubsequencemediumStringDynamic ProgrammingLongest Common Subsequencefrequency 55.1
- Matrix Similarity After Cyclic ShiftseasyArrayMathMatrixSimulationfrequency 55.1
- Maximize Grid HappinesshardDynamic ProgrammingBit ManipulationMemoizationBitmaskfrequency 55.1
- Maximum Height of a TriangleeasyArrayEnumerationfrequency 55.1
- Maximum Number That Makes Result of Bitwise AND ZeromediumStringGreedySortingfrequency 55.1
- Minimum Removals to Balance ArraymediumArrayBinary SearchSliding WindowSortingfrequency 55.1