Snowflake interview questions

Showing 1–30 of 130 results

• Adapt Throne Inheritance When Initialization Does Not Supply a KingMedium

  Design a throne inheritance system with an uninitialized monarch, handling dynamic root establishment, pre-order succession, and edge-case validation.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Answer Repeated Lookup Queries EfficientlyMedium

  This problem tests binary search proficiency and the ability to optimize performance for repetitive computational tasks using memoization.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Answer conflict, tight deadline, and mentorship promptsEasy

  This Behavioral & Leadership question evaluates conflict resolution, prioritization and risk-communication under tight deadlines, and mentorship or coaching ability within cross-functional software engineering teams.

  SnowflakeSoftware EngineerBehavioral & LeadershipOnsite
• Assign Each Person the Nearest Cake in a One-Dimensional RowMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Behavioral Stories on Ownership, Ambiguity, Deep Dives and ConflictMedium

  A behavioral round for an entry-level software engineer that probes four competencies: taking ownership, making progress under ambiguity, digging deep into a problem, and handling conflict with a colleague. It tests whether candidates give specific, structured stories with a clear personal role and concrete results.

  SnowflakeSoftware EngineerBehavioral & LeadershipOnsite
• Behavioral: Proudest Project, Conflict, and FailureMedium

  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.

  SnowflakeSoftware EngineerBehavioral & LeadershipTechnical Screen
• Build a Tiered Rate Limiter With Runtime-Updatable Limits, Then Test and Scale ItHard

  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.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Build a Top-Down Reporting Forest from Employee-Manager PairsMedium

  Given employee-to-manager pairs of integer IDs, build the top-down reporting forest with every top-level manager as a root, and return it as a preorder listing of IDs and depths. Tests finding the roots, building child lists, deterministic sibling ordering, and handling long reporting chains.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Build a Tree Whose Nodes Hold the Original Tree's Subtree SumsMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a cohort dashboard with Streamlit and SQLMedium

  This question evaluates proficiency in cohort analysis using SQL window functions, time-based aggregation, ARPU calculation, and integration of data querying with a Streamlit visualization front end, including handling timezones and data-quality checks.

  SnowflakeData ScientistData Manipulation (SQL/Python)Onsite
• Build an Arrow-Controlled Kanban Board in ReactMedium

  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.

  SnowflakeFrontend EngineerSoftware Engineering FundamentalsTechnical Screen
• Check Whether a Proposed Course Order Respects Every PrerequisiteMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check if each recipe is a contiguous subsequenceHard

  This problem tests your ability to efficiently determine if one sequence exists as a contiguous segment within another using pattern matching techniques.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Clarify and Prune an N-ary Tree to a Depth LimitHard

  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.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Collect a Binary Tree's Outer Boundary Values AnticlockwiseMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Effective Letter Permissions in a DAGMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Progressive Income Tax in Cents from Bracket LimitsMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute height after deletions; enumerate valid delete setsMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute height of tree with deleted nodes; minimize deletionsHard

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute shortest path between tree nodesMedium

  Given a binary tree and two node values u and v, return the shortest path between them as an ordered list of node values. This Snowflake onsite question tests lowest-common-ancestor logic, path reconstruction, iterative vs. recursive implementation, complexity analysis, and preprocessing strategies (parent pointers, binary lifting, Euler tour + RMQ) for answering many queries efficiently.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Compute task order and layered executionMedium

  This question evaluates a candidate's understanding of graph algorithms and dependency resolution, covering concepts such as topological ordering and cycle detection.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Compute task order with prerequisitesMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute total time to finish all coursesMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Contrast FCF vs NI; choose one statementMedium

  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.

  SnowflakeData ScientistStatistics & MathTechnical Screen
• Core Components of LLM Agent Memory: What Each Stores and How It Is Written and ReadMedium

  Explain the common components of an LLM agent's memory, from the context window to session, episodic, semantic and procedural memory, and how each is written, retrieved and maintained. It tests agent architecture knowledge, context budgeting, conflict handling, forgetting and memory security.

  SnowflakeMachine Learning EngineerMachine LearningOnsite
• Count a Distributed Tree with Nonblocking MessagesHard

  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.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Count the Nodes of a Process Tree Using Only Asynchronous MessagesMedium

  Each node of a tree is a separate process that can only send asynchronous messages and block on receive; write the logic that lets the root learn how many nodes exist. Follow-ups cover lost and duplicated messages, retries and idempotency, and how to structure a result that may be incomplete.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Decide Whether Repeatedly Summing Squared Digits Reaches 1Medium

  Starting from a positive integer, repeatedly replace it by the sum of the squares of its digits and decide whether the sequence reaches 1 or falls into a cycle. It tests cycle detection on an implicit sequence and reasoning about why the values stay bounded.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Decide Whether an Undirected Graph Can Be Colored with Three ColorsMedium

  Given an undirected graph with up to fifteen nodes, decide whether every node can receive one of three colors so that no edge joins two nodes of the same color. It tests backtracking search with pruning and reasoning about odd cycles and cliques.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Deep-Copy a Linked List Whose Nodes Also Carry a Random PointerMedium

  Return a deep copy of a singly linked list in which every node also has a random pointer to any node or to nothing, so that the copy shares no node with the original. It tests mapping original nodes to copies, pointer wiring and constant-space alternatives.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen