Salesforce Interview Questions
Practice the exact questions companies are asking right now.
Find longest subsequence of x that is a substring of y
Given two strings x and y, compute the maximum length of a string s such that: - s is a subsequence of x (can delete zero or more characters from x wi...
Implement an LFU cache
Problem: LFU Cache Design and implement a Least Frequently Used (LFU) cache with a fixed capacity. The cache supports the following operations: - get(...
Solve array duplicate flags and binary swaps
Problem 1: Flag duplicates on the left and right You are given an integer array nums of length n. For each index i, determine: 1. Left-duplicate: whet...
Design a 911 emergency calling service
System Design Prompt Design a 911 emergency calling service (or emergency call routing platform) that allows users to place emergency calls from mobil...
Flatten nested JSON into a string map
Problem You are given an input JSON object that may contain nested objects and arrays. Your task is to flatten it into a single-level key/value mappin...
Design a recommendation system
Design a User–Item Recommendation System Context You are asked to design an end-to-end recommendation service that suggests items to users. The servic...
Design cloud & k8s architecture
Technical Screen: Kubernetes, Cloud Services, and Secure CI/CD Context You are designing and operating services on Kubernetes in a public cloud. Answe...
Determine minimal substitutions and removals
Question Given a list of words, determine the minimum number of character substitutions required so that, in every word, no two adjacent characters ar...
Remove duplicates from a singly linked list
You are given the head of a singly linked list of integers. Modify the list in place so that it contains only the first occurrence of each value (i.e....
Implement 64-bit modular exponentiation safely
Implement a function to compute (a^b) mod m where 0 ≤ a,b < 2^61−1 and 1 ≤ m < 2^61−1 using only 64-bit operations without overflow. Provide implement...
Convert integer to NAF form
Question Convert a given integer into its Non-Adjacent Form (NAF) representation such that no two non-zero digits are adjacent, and prove that the res...
Compare cloud compute; design Kubernetes security and CI/CD
Cloud Compute Models, Testing Strategies, Kubernetes Deep Dive, Security, and CI/CD to GKE Context You are designing and operating services across pub...
Explain background and Salesforce motivation
Behavioral: Background, Motivation, and Team Fit (Salesforce, GCP-Focused) Prompt Provide a concise, structured response that covers: 1. Background ov...
Design secure Kubernetes with CI/CD
Kubernetes Architecture, Troubleshooting, Security, and CI/CD (GKE/EKS) Context: You are the on-call software engineer for a managed Kubernetes cluste...
Minimize steps to reduce integer
Given a positive integer n (1 <= n <= 2^61 - 1), in one step you may replace n with n/2 if n is even, or with n+1 or n-1 if n is odd. Return the minim...
Remove duplicates in linked list
Question Given a linked list, remove all duplicate values so that each value appears only once. Provide solutions for both sorted and unsorted linked ...
Design an end-to-end recommendation system
System Design Prompt: End-to-End Movie Recommendation System You are tasked with designing an end-to-end movie recommendation system for a large-scale...
Architect serving and storage for recommender
System Design: Recommendation Service (Serving + Data Infrastructure) Context Design a production-ready recommendation service for a large-scale consu...
Convert Integer to Non-Adjacent Form
Implement toNAF(n) that converts an integer n (allow negative n) to its Non-Adjacent Form using digits from {-1, 0, 1} with no two adjacent nonzero di...
Explain background and Salesforce motivation
Behavioral Prompt: SDE II (GCP-Focused Team) You are interviewing for an SDE II role on a GCP-focused team at Salesforce during a technical screen. Pr...