Salesforce

Salesforce

Leading CRM and enterprise cloud solutions

4 Rounds ~21 Days Medium
Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

Software Engineer Coding medium

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. This is often used in our application tier to cache frequently accessed Salesforce records.

#Data Structures #Linked List #Hash Map #Caching
Software Engineer Coding medium

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals. We use this logic when calculating available time slots for Salesforce Lightning Scheduler.

#Arrays #Sorting #Intervals
Software Engineer Coding hard

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. This is similar to how we parse continuous text in Einstein Search.

#Dynamic Programming #Backtracking #Trie
Software Engineer Coding medium

Given an array of strings words and an integer k, return the k most frequent strings. We use similar algorithms to analyze frequent search terms in our CRM logs.

#Hash Map #Heap #Priority Queue #Sorting
Software Engineer Coding easy

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. This is a foundational concept for our formula field parser.

#Stack #String Parsing
Software Engineer Coding medium

Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.

#Arrays #Hash Map #Prefix Sum
Software Engineer Coding medium

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. This algorithm is useful when calculating shared permissions in a Role Hierarchy.

#Trees #Depth-First Search #Recursion
Software Engineer Coding hard

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

#Arrays #Two Pointers #Dynamic Programming
Software Engineer Coding medium

Given an array of strings, group the anagrams together. You can return the answer in any order.

#Hash Map #String #Sorting
Software Engineer Coding medium

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.

#Graph #Depth-First Search #Breadth-First Search
Software Engineer Coding hard

There is a new alien language that uses the English alphabet. However, the order among the letters is unknown to you. Given a list of strings words from the alien language's dictionary, return a string of the unique letters sorted in lexicographical order.

#Graph #Topological Sort #Breadth-First Search
Software Engineer Coding medium

There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index. Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

#Binary Search #Arrays
Software Engineer Coding easy

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. Assume exactly one solution.

#Arrays #Hash Map
Software Engineer Coding medium

Given a string s, find the length of the longest substring without repeating characters.

#Sliding Window #Hash Set #String

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now