Snapchat Interview Question Bank
Snap interviews are highly interviewer-dependent: candidates report classic graph and cache problems, open-ended backend coding, product-heavy system design, and MLE loops that dig into recommendation systems, ranking, fundamentals, and project judgment. The safest preparation strategy is to be fluent in BFS/DFS, cache/data-structure implementation, feed and ads design, and concise behavioral stories around innovation, ambiguity, and execution.
100
questions
Last updated
Before you start
Showing 23 of 23
OJ Problems
practice in the online judgeThread-Safe LRU CacheSmallest Range Covering Elements from K Sorted ListsMost Stones Removed with Same Row or ColumnBuild an AI-Assisted Chat BackendReturn the Sizes of All IslandsFind Duplicate Files Without a Directory-Walking UtilityCourse Schedule (Cycle Detection in Directed Graph)K Closest Points to Origin (N log K)Maximum Island Perimeter (Max over components)Count Increment Calls After a TimestampMerge N sorted lists into one sorted listCan a target string be formed using double-sided letter cards (each card used at most once)?Count events in a time window with unsorted duplicate timestampsDesign a Key-Value Database Supporting Column QueriesDesign a Stream Top-K Class (Online Top-K Elements/Frequencies)Determine Whether Three Cards Form a Valid Set (SET Game Variant)Max Unique Users in Any Time WindowMost Reliable Path in a Probabilistic GraphPrefix Key-Value Sum Query (MapSum)Design a data structure (with TTL extension)Maximum Number of Vowels in a Substring of Given LengthWord Ladder Reachability (Boolean)Search from the end in a sorted array (variant)Grid/Graph BFS Problem from 1point3acres Link (expects possible O(1) query with preprocessing)IP Address Transformation / Increment-with-carry Variant ("One Step Dance" variant)BFS Shortest Distance on a 2D GridRate Limiter (Sliding Window)Grid Evacuation Reachability / Minimum Escape Time (Multi-source BFS)O(1) Get and Add Data StructureBinary Search with Boundary Conditions