Salesforce

Typical loop

1. 1Recruiter screen
2. 2Technical phone screen
3. 3Onsite: two coding rounds
4. 4Multi-tenant system design round
5. 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

• Encode and Decode TinyURLmediumHash TableStringDesignHash Functionfrequency 27.7
• Exclusive Time of FunctionsmediumArrayStackfrequency 27.7
• Find Duplicate SubtreesmediumHash TableTreeDepth-First SearchBinary Treefrequency 27.7
• Find K Closest ElementsmediumArrayTwo PointersBinary SearchSliding Window+2frequency 27.7
• Find Pivot IndexeasyArrayPrefix Sumfrequency 27.7
• Find the Duplicate NumbermediumArrayTwo PointersBinary SearchBit Manipulation+2frequency 27.7
• Find the Smallest Divisor Given a ThresholdmediumArrayBinary Searchfrequency 27.7
• Finding the Number of Visible MountainsmediumArrayStackSortingMonotonic Stackfrequency 27.7
• Fruit Into BasketsmediumArrayHash TableSliding Windowfrequency 27.7
• Game of LifemediumArrayMatrixSimulationfrequency 27.7
• House Robber IImediumArrayDynamic Programmingfrequency 27.7
• Integer to RomanmediumHash TableMathStringfrequency 27.7
• Largest Rectangle in HistogramhardArrayStackMonotonic StackRange Minimum/Maximum Queryfrequency 27.7
• Last Stone WeighteasyArrayHeap (Priority Queue)frequency 27.7
• Least Number of Unique Integers after K RemovalsmediumArrayHash TableGreedySorting+1frequency 27.7
• Lexicographically Minimum String After Removing StarsmediumHash TableStringStackGreedy+1frequency 27.7
• Longest Consecutive SequencemediumArrayHash TableUnion-Findfrequency 27.7
• Longest Substring Of All Vowels in OrdermediumStringSliding Windowfrequency 27.7
• Max Chunks To Make Sorted IIhardArrayStackGreedySorting+1frequency 27.7
• Maximum Earnings From TaximediumArrayHash TableBinary SearchDynamic Programming+1frequency 27.7
• Maximum Number of Non-overlapping Palindrome SubstringshardTwo PointersStringDynamic ProgrammingGreedyfrequency 27.7
• Maximum Number of Ways to Partition an ArrayhardArrayHash TableCountingEnumeration+1frequency 27.7
• Minimum Array SummediumArrayDynamic Programmingfrequency 27.7
• Minimum Equal Sum of Two Arrays After Replacing ZerosmediumArrayGreedyfrequency 27.7
• Minimum Window SubsequencehardStringDynamic ProgrammingSliding Windowfrequency 27.7
• Number of Operations to Make Network ConnectedmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 27.7
• Palindrome PartitioningmediumStringDynamic ProgrammingBacktrackingfrequency 27.7
• Partition Array Into Two Arrays to Minimize Sum DifferencehardArrayTwo PointersBinary SearchDynamic Programming+5frequency 27.7
• Partition Equal Subset SummediumArrayDynamic ProgrammingKnapsack Problem0-1 Knapsackfrequency 27.7
• Path Sum IIImediumTreeDepth-First SearchBinary Treefrequency 27.7
• Permutation in StringmediumHash TableTwo PointersStringSliding Windowfrequency 27.7
• Range Sum Query 2D - ImmutablemediumArrayDesignMatrixPrefix Sumfrequency 27.7
• Reaching PointshardMathEuclidean AlgorithmGreatest Common Divisorfrequency 27.7
• Roman to IntegereasyHash TableMathStringfrequency 27.7
• Shortest BridgemediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 27.7
• Shortest Distance to Target String in a Circular ArrayeasyArrayStringfrequency 27.7
• Sort Characters By FrequencymediumHash TableStringSortingHeap (Priority Queue)+2frequency 27.7
• Spiral MatrixmediumArrayMatrixSimulationfrequency 27.7
• Subarray Sum Equals KmediumArrayHash TablePrefix Sumfrequency 27.7
• Swim in Rising WaterhardArrayBinary SearchDepth-First SearchBreadth-First Search+5frequency 27.7
• Time Based Key-Value StoremediumHash TableStringBinary SearchDesignfrequency 27.7
• Time Taken to Cross the DoorhardArrayQueueSimulationfrequency 27.7
• Valid PalindromeeasyTwo PointersStringfrequency 27.7