practice a little every day, paws crossed ♡
Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 3721–3750 of 4616 results
- SnapchatMediumSoftware EngineerHow do you deliver when time is tight?
This question evaluates a candidate's project management, prioritization, risk identification, trade-off negotiation, and stakeholder-communication skills when working under aggressive deadlines.
Behavioral & LeadershipTechnical Screen - SnapchatMediumSoftware EngineerImplement a Timestamped Counter
This problem tests your ability to design a data structure that handles time-series data and performs efficient range-based queries using binary search.
Coding & AlgorithmsTechnical ScreenBinary SearchData StructuresTime Series - SnapchatMediumSoftware EngineerImplement a custom list with iterator and map
This problem tests your understanding of linked list internals, the Iterator design pattern, and the application of higher-order functions in a custom data structure.
Coding & AlgorithmsTechnical ScreenLinked ListsDesign PatternsIterator - SnapchatHardMachine Learning EngineerImplement calculator and graph connectivity
This question evaluates proficiency in parsing and arithmetic expression evaluation (including operator precedence and nested parentheses) alongside implementation of disjoint-set (Union-Find) data structures for computing graph connected components.
Coding & AlgorithmsTechnical Screen - SnapchatMediumSoftware EngineerImplement sin(x) with precision constraints
This question evaluates understanding of numerical methods, floating-point arithmetic, and algorithmic implementation in the Coding & Algorithms domain by requiring an approximation of the sine function under explicit error bounds.
Coding & AlgorithmsTechnical Screen - SnapchatHardSoftware EngineerParallelize the lock BFS safely
Parallelize the lock BFS safely evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
System DesignTechnical Screen - SnapchatMediumSoftware EngineerRemove the Maximum Number of Connected Stones
Determine the maximum number of stones that can be removed from a 2D grid where a stone may only be removed if another stone shares its row or column. This tests graph modeling, connected components, and Union-Find or BFS/DFS traversals.
Coding & AlgorithmsTechnical ScreenGraphUnion-FindDFS - SnapchatMediumSoftware EngineerSolve Open the Lock BFS
This question evaluates the ability to model the lock as a state-space and apply graph traversal and shortest-path techniques (breadth-first search) to determine minimal move sequences under constraints.
Coding & AlgorithmsTechnical Screen - SnapchatMediumSoftware EngineerSolve a two-jug measuring problem
This question evaluates algorithm design, state-space modeling, graph-search techniques (BFS/DFS) and number-theoretic reasoning (gcd), along with handling edge cases and analyzing time and space complexity in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - SnapchatHardMachine Learning EngineerWhat Happens When All Neural-Network Weights Start at Zero?
Explain zero-weight initialization through hidden-unit symmetry and gradient flow, and contrast it with linear and logistic models.
Machine LearningTechnical Screen - SnorkelMediumSoftware EngineerDesign SnapshotMap with Sparse Histories and Constant-Time Snapshots
Design an in-memory key-value store supporting point-in-time snapshots, sparse version histories, binary-search historical reads, tombstones, and write coalescing.
Software Engineering FundamentalsTechnical Screendata-structuresbinary-searchsystem-design - SnowflakeMediumSoftware EngineerAdapt Throne Inheritance When Initialization Does Not Supply a King
Design a throne inheritance system with an uninitialized monarch, handling dynamic root establishment, pre-order succession, and edge-case validation.
Software Engineering FundamentalsTechnical Screentreedesigndfs - SnowflakeMediumSoftware EngineerAnswer Repeated Lookup Queries Efficiently
This problem tests binary search proficiency and the ability to optimize performance for repetitive computational tasks using memoization.
Coding & AlgorithmsTechnical ScreenBinary SearchCachingEfficiency - SnowflakeMediumSoftware EngineerAssign Each Person the Nearest Cake in a One-Dimensional Row
Given a one-dimensional row marking empty spots, people and cakes, return for each person the index of the nearest cake, breaking ties toward the smaller index. It tests linear scanning techniques for nearest-neighbor queries on a line and careful handling of ties and boundaries.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerBehavioral: Proudest Project, Conflict, and Failure
This question assesses the candidate's ability to articulate professional experiences regarding personal growth, interpersonal navigation, and self-reflection. It focuses on how the candidate handles success, manages disagreement, and processes failure to iterate on their working style.
Behavioral & LeadershipTechnical ScreenBehavioralSoft SkillsCommunication - SnowflakeHardSoftware EngineerBuild a Tiered Rate Limiter With Runtime-Updatable Limits, Then Test and Scale It
Build an in-memory rate limiting service in Python where clients belong to tiers such as free, pro and enterprise, tier limits change at runtime without a restart, and clients with missing or invalid tiers fall back to a global default policy. Follow-ups probe algorithm trade-offs, deterministic tests for refill timing, and a distributed design.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumSoftware EngineerBuild a Tree Whose Nodes Hold the Original Tree's Subtree Sums
Given a rooted tree as a parent array with a value on every node, return a same-shaped tree whose nodes hold the sum of each original subtree. It tests aggregating children before parents without hitting recursion limits, and leaving the original tree unchanged.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumFrontend EngineerBuild an Arrow-Controlled Kanban Board in React
Design and implement a performant React Kanban board in TypeScript with normalized state and accessible arrow controls for shifting tasks across ordered columns at scale.
Software Engineering FundamentalsTechnical Screenreacttypescriptfrontend - SnowflakeMediumSoftware EngineerCheck Whether a Proposed Course Order Respects Every Prerequisite
Given courses, prerequisite pairs and a proposed order, decide whether the order lists every course exactly once and places each course after all of its prerequisites. It tests position indexing, permutation checks and careful handling of missing or repeated courses.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerCheck if each recipe is a contiguous subsequence
This problem tests your ability to efficiently determine if one sequence exists as a contiguous segment within another using pattern matching techniques.
Coding & AlgorithmsTechnical ScreenArraysKMP AlgorithmPattern Matching - SnowflakeHardSoftware EngineerClarify and Prune an N-ary Tree to a Depth Limit
This problem tests tree traversal techniques and recursive state management by requiring the pruning of an N-ary tree nodes based on a depth constraint while maintaining valid structural connectivity.
Software Engineering FundamentalsTechnical ScreenTreesRecursionData Structures - SnowflakeMediumSoftware EngineerCollect a Binary Tree's Outer Boundary Values Anticlockwise
Given a binary tree stored as child-index arrays, return its boundary values anticlockwise: the root, the left boundary, the leaves from left to right and the right boundary from bottom to top, whose total is the boundary sum. It tests precise traversal rules and edge cases.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerCompute Effective Letter Permissions in a DAG
Compute the effective lowercase letter permissions for every node in a directed acyclic graph (DAG), where granted permissions propagate transitively to all descendants while explicit denials apply only locally.
Coding & AlgorithmsTechnical ScreenDAGtopological-sortbit-manipulation - SnowflakeMediumSoftware EngineerCompute Progressive Income Tax in Cents from Bracket Limits
Given progressive tax brackets as upper limits with percentage rates and an income in whole dollars, return the total tax owed in cents. It tests careful handling of bracket boundaries, partly filled brackets and exact integer arithmetic instead of floating point.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerCompute height after deletions; enumerate valid delete sets
This question evaluates competence in binary tree manipulation and combinatorial search, covering promotion-based node deletion, height computation across forest components after root deletion, enumeration of deletion sets with deduplication, pruning strategies, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerCompute height of tree with deleted nodes; minimize deletions
This question evaluates understanding of tree data structures, connectivity after node deletions, and optimization for minimizing additional removals, and is categorized under Coding & Algorithms. It is commonly asked to assess reasoning about tree pruning and height computation under constraints, testing both conceptual understanding of tree properties and practical algorithmic implementation.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerCompute task order with prerequisites
This question evaluates proficiency in graph algorithms—particularly topological ordering and cycle detection—along with the use of efficient data structures for representing dependencies and analyzing time and space complexity.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerCompute total time to finish all courses
This problem tests your ability to model task dependencies using a directed graph and calculate the earliest completion time for all tasks, effectively identifying the critical path in a project schedule.
Coding & AlgorithmsTechnical ScreenGraphTopological SortDynamic Programming - SnowflakeMediumData ScientistContrast FCF vs NI; choose one statement
This question evaluates financial statement analysis skills—specifically reconciling net income to free cash flow, identifying accounting and working-capital red flags, and selecting which single statement best informs credit risk, profitability trends, and cash runway, thereby testing valuation, solvency, and financial-modeling competency in the Statistics & Math domain. It is commonly asked because interviewers probe both conceptual understanding and practical application of accrual versus cash accounting, the effects of non‑cash charges, capex and working‑capital movements on valuation, and awareness of which metrics (for example FCF margin, interest coverage, and current ratio) become unreliable or unobtainable when only one statement is available.
Statistics & MathTechnical Screen - SnowflakeHardSoftware EngineerCount a Distributed Tree with Nonblocking Messages
This problem tests your ability to design a distributed protocol that ensures eventual consistency and message idempotency in a tree-based network without global synchronization.
Software Engineering FundamentalsTechnical ScreenDistributed SystemsProtocolsTrees
Snapchat
Snowflake