Snap Software Engineer Onsite Coding Questions
67+ questions from real Snap Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.
What does the Snap Onsite Coding round test?
The Snap onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.
Top Topics in This Round
Snap Software Engineer Onsite Coding Questions
Snap | onsite | length of the shortest path
Given an R x C grid of letters "P", "F", and ".", you have one person "P" and his friends "F". The person will go visit all his friends and can...
#347 Top K Frequent Elements
LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at Snap in the last 6 months.
#200 Number of Islands
LeetCode #200: Number of Islands. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at Snap in the last 6 months.
#227 Basic Calculator II
LeetCode #227: Basic Calculator II. Difficulty: Medium. Topics: Math, String, Stack. Asked at Snap in the last 6 months.
#253 Meeting Rooms II
LeetCode #253: Meeting Rooms II. Difficulty: Medium. Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum. Asked at Snap in the last 6 months.
#296 Best Meeting Point
LeetCode #296: Best Meeting Point. Difficulty: Hard. Topics: Array, Math, Sorting, Matrix. Asked at Snap in the last 6 months.
LeetCode #2258: Escape the Spreading Fire. Difficulty: Hard. Topics: Array, Binary Search, Breadth-First Search, Matrix. Asked at Snap in the last 6 months.
#146 LRU Cache
LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at Snap in the last 6 months.
#231 Power of Two
LeetCode #231: Power of Two. Difficulty: Easy. Topics: Math, Bit Manipulation, Recursion. Asked at Snap in the last 6 months.
#875 Koko Eating Bananas
LeetCode #875: Koko Eating Bananas. Difficulty: Medium. Topics: Array, Binary Search. Asked at Snap in the last 6 months.
LeetCode #939: Minimum Area Rectangle. Difficulty: Medium. Topics: Array, Hash Table, Math, Geometry, Sorting. Asked at Snap in the last 6 months.
LeetCode #947: Most Stones Removed with Same Row or Column. Difficulty: Medium. Topics: Hash Table, Depth-First Search, Union-Find, Graph Theory. Asked at Snap in the last 6 months.
#210 Course Schedule II
LeetCode #210: Course Schedule II. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at Snap in the last 6 months.
#362 Design Hit Counter
LeetCode #362: Design Hit Counter. Difficulty: Medium. Topics: Array, Binary Search, Design, Queue, Data Stream. Asked at Snap in the last 6 months.
#752 Open the Lock
LeetCode #752: Open the Lock. Difficulty: Medium. Topics: Array, Hash Table, String, Breadth-First Search. Asked at Snap in the last 6 months.
## Problem: Course Schedule (Can You Finish All Courses?) You are given an integer `numCourses` (course labels `0 ... numCourses-1`) and an array `prerequisites`, where each element is `[a, b]` meani
Given a 2D integer array `points` where `points[i] = [xi, yi]` represents a point on the plane, and an integer `K`, return the `K` points closest to the origin `(0,0)` (Euclidean distance). Requireme
Implement a counter class that supports two operations: 1. `increment(timestamp)`: records one call. `timestamp` is an integer and is guaranteed to be **strictly increasing** across calls. 2. `query(
Given `N` lists sorted in non-decreasing order, merge them into one sorted list. **Example** - `lists = [[1,4,5],[1,3,4],[2,6]]` - Output: `[1,1,2,3,4,4,5,6]` **Assumed constraints** - `1 <= N <= 1e
Can a target string be formed using double-sided letter cards (each card used at most once)?
You are given `cards`, where each card has two sides and each side contains one lowercase English letter, e.g., `cards = [["a","b"], ["c","d"]]`. Rules: - Each card can be used at most once. - When a
What to Expect in the Snap Onsite Coding Round
The Snap Software Engineer Onsite Coding round has a specific calibration purpose distinct from other rounds in the loop. Across 67+ verified reports on LeakCode for this exact round type, the consistent expectations: clear scoping of the problem before diving into a solution, explicit reasoning about complexity, structured handling of edge cases, and the ability to discuss trade-offs between two reasonable approaches.
Reports tagged with the Onsite Coding round at Snap show recurring patterns in difficulty and topic distribution. The Onsite Coding round is typically 45-60 minutes; the interviewer is calibrated against a specific rubric. The discriminator between candidates who advance and candidates who do not is rarely the final correctness of the answer. It is the path: did you clarify, did you verbalize your approach, did you handle edge cases, and did you communicate throughout.
How To Prepare for This Specific Round
Filter the questions below to the most recent reports (past 6-12 months). Questions tagged for this exact round type from this exact company at this exact role level are the highest-signal data available. Older reports may reference questions that have since rotated out of the company's pool.
Practice 4-6 representative problems from this set under timed conditions. The goal is not memorization (companies rotate questions); the goal is to internalize the patterns the interviewer typically reaches for and the depth of follow-up to expect. Reports on LeakCode also tag the typical follow-up depth at this round type, which is the discriminating signal between hire and no-hire calibration.
Onsite Coding Round Timing and Format
The Onsite Coding round at Snap typically runs 45-60 minutes. Use the first 2-3 minutes to clarify requirements; you should never start coding or designing without verifying the input/output format, constraints, and edge cases out loud. Use the next 5-7 minutes to verbalize your approach before writing any code. The middle 20-30 minutes are implementation. Reserve the final 10 minutes for testing with concrete examples and discussing optimization or trade-offs.
Time budget discipline is one of the most reliable senior-vs-junior discriminators in this round. Strong candidates verbalize where they are in their budget out loud ("I've used about 20 minutes, I have 15 minutes left for testing and one optimization"). This signals engineering maturity to the interviewer and creates positive feedback they can capture in writing.
Common Failure Modes in This Round
Reports tagged "no hire" at Snap Software Engineer Onsite Coding commonly cite: coding silently without verbalizing approach, jumping to implementation before clarifying requirements, missing edge cases (empty input, single element, very large input), producing working code that the candidate cannot refactor when asked, and failing to test their solution with concrete examples before declaring done.
The single most predictive failure mode in 2025-2026 reports: not asking clarifying questions. Interviewers at all FAANG companies are explicitly trained to weight this dimension. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's notes.
See All 67 Questions from This Round
Full question text, answer context, and frequency data for subscribers.
Get Access