Companies
Amazon920 questions
Meta505 questions
Google424 questions
Uber319 questions
ByteDance / TikTok350 questions
Snowflake182 questions
Microsoft234 questions
OpenAI193 questions
Apple156 questions
Stripe197 questions
Databricks105 questions
Netflix89 questions
DoorDash124 questions
Anthropic100 questions
Roblox79 questions
IBM117 questions
Bloomberg112 questions
Coinbase89 questions
Capital One104 questions
Goldman Sachs97 questions
LinkedIn96 questions
Citadel / Citadel Securities91 questions
Snapchat91 questions
Salesforce89 questions
Rippling75 questions
Waymo86 questions
Pinterest81 questions
Airbnb81 questions
JPMorgan Chase77 questions
Oracle72 questions

Salesforce Interview Question Bank
Salesforce's loop is bank-driven: a small set of coding prompts (LFU Cache, Flatten JSON, linked-list dedup, frontend curry + traffic light, OA HackerRank classics) and one signature system design (Coffee Ordering, with its SQL follow-ups) cover the bulk of recent rounds. Down-leveling at offer time is common — the HM screen and behavioural depth materially shape the final level, often more than coding correctness alone.
89
questions
Last updated
Before you start
Showing 26 of 26
OJ Problems
practice in the online judgeOrder a Nearly Sorted UDP Packet StreamMinimum Knight Moves on a ChessboardMaximal RectangleMaximal SquareMinimum Sum of Weekly Campaign MaximaMaximum Requests in a Time WindowMaximum Number of Palindromic Strings After Cross-String Character SwapsHands-on Coding Project: High-Concurrency Web Crawler to CSVRemove Invalid Parentheses (Extended: three bracket types)Flatten JSON using DFSArray In-place OperationString Anagram WindowsTop K PointsSliding Window Character CountBinary String 01 to 10 swapCheck Duplicates in ArrayFlatten Nested HashMap JSONImplement LFU CacheMin Elements to Remove to Make Almost Sorted ArrayString Compression ProblemLongest Subsequence which is a SubstringSpam ClassificationString CompressionSplit Array Largest SumFind Words in String Not in Subsequence (MLE :)Find Longest Subsequence Common to X as Substring in Y (MLE :)Minimum Removals to Make Array Almost SortedMinimum Substitutions for No Adjacent Duplicate CharactersBit Pattern (MTS)Get Special Substring (MTS)
