Companies
Amazon942 questions
Meta509 questions
Google438 questions
Uber321 questions
ByteDance / TikTok359 questions
Apple167 questions
Microsoft238 questions
Snowflake183 questions
OpenAI196 questions
Stripe197 questions
Databricks111 questions
Netflix94 questions
DoorDash128 questions
Anthropic103 questions
Roblox79 questions
IBM118 questions
Bloomberg113 questions
Coinbase89 questions
Capital One106 questions
Citadel / Citadel Securities99 questions
LinkedIn98 questions
Salesforce97 questions
Goldman Sachs97 questions
Rippling80 questions
Snapchat92 questions
Airbnb90 questions
Waymo86 questions
Pinterest84 questions
JPMorgan Chase78 questions
Oracle73 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.
97
questions
Last updated
Before you start
Showing 30 of 30
OJ Problems
practice in the online judgeOptimal Account BalancingDelete One Character Type to Minimize Unique-Character SegmentsLongest Increasing SubsequenceMaximal SquareOrder 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 :)
