Snowflake interview questions

Showing 61–90 of 130 results

• Design under vague distributed requirementsHard

  This question evaluates expertise in distributed system architecture, metadata and schema management, transactional DDL semantics, consistency and replication strategies, API and data-model design, multi-tenant isolation, observability, security, and capacity planning.

  SnowflakeSoftware EngineerSystem DesignTechnical Screen
• Determine Whether an Undirected Graph Is 3-ColorableMedium

  This problem tests knowledge of graph theory, specifically constraint satisfaction, and the ability to implement a backtracking algorithm to solve NP-complete problems on small constraints.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Discuss a Proud Project, Conflict, Challenge, and Team AdviceHard

  This question assesses your ability to articulate professional growth, conflict resolution, technical decision-making, and self-awareness within a collaborative engineering environment.

  SnowflakeSoftware EngineerBehavioral & LeadershipOnsite
• Discuss challenges and cross-functional collaborationMedium

  Snowflake software-engineer onsite behavioral question: walk through your most challenging project end to end. It probes goals and constraints, your individual ownership, key decisions and trade-offs, technical and organizational obstacles, cross-functional collaboration (PM, Design, Security, Data, Infra/SRE), a specific conflict you resolved, how you measured success, and what you would do differently.

  SnowflakeSoftware EngineerBehavioral & LeadershipOnsite
• Effective Permissions in an Inheritance DAG with Allow and Deny ListsMedium

  Nodes of a directed acyclic graph carry allow and deny permission lists that are inherited along its edges; compute every node's final permissions. It tests topological processing, settling an unstated conflict rule between allow and deny, cycle detection and incremental updates.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Evaluate an Arithmetic Expression with Parentheses, Unary Minus and Four OperatorsMedium

  Evaluate an arithmetic expression string with non-negative integers, addition, subtraction, multiplication, division truncating toward zero, parentheses and a unary minus. It tests tokenizing, operator precedence, left-to-right evaluation and deeply nested parentheses without eval.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate arithmetic expression with variablesMedium

  This question evaluates implementation skills for a linear-time expression parser and evaluator, covering tokenization, variable substitution, operator precedence and associativity (including unary +/−), parentheses handling, integer arithmetic semantics (division truncation), error detection, and adherence to O(L) time and space constraints.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain React classes, lifecycle, and hooksMedium

  This question assesses the evolution of React component patterns, specifically focusing on the transition from class-based lifecycles to functional hooks, and the management of stateful side effects.

  SnowflakeFrontend EngineerSoftware Engineering FundamentalsTechnical Screen
• Explain a Technical Project from Milestone to ProductionMedium

  Explain a technical project from background and ownership through a major milestone, launch problems, production validation, and lessons learned.

  SnowflakeSoftware EngineerBehavioral & LeadershipTechnical Screen
• Fewest Buses Needed to Cover Every Scheduled TripMedium

  Given scheduled trips with start and end times, return the fewest buses needed so that no bus runs two trips at once, where a bus may start a trip the moment its previous one ends. It tests reasoning about maximum interval overlap and boundary handling.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fewest Link Clicks Between Two Wiki Pages, Then Scale the SearchMedium

  Find the fewest link clicks between two wiki pages when each page's links come from a slow fetch call, returning the path. Follow-ups cover parallel level-by-level search, bidirectional search with a correct stopping rule, and caching fetched link lists across searches.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Fewest Node Additions and Removals to Make a Binary Tree PerfectMedium

  Given a binary tree described by left and right child arrays, return the fewest single-node additions and leaf removals that turn it into a perfect binary tree, which is 0 exactly when it is already perfect. Tests tree traversal and reasoning about tree shape, including very deep, skewed trees.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fewest Semesters to Finish All Courses Taking At Most k per SemesterMedium

  Given up to fifteen courses with prerequisites and a cap of k courses per semester, return the fewest semesters needed to take every course. It tests why simple greedy choices fail and how to search the space of partial plans efficiently.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Filter hierarchical paths after deletionsMedium

  This question evaluates proficiency in hierarchical string processing, prefix-based filtering, edge-case handling (duplicates, trailing slashes, empty inputs), data-structure selection, and algorithmic time/space complexity analysis within the Coding & Algorithms domain, emphasizing practical implementation over purely conceptual reasoning.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Every Three-Card Set Among Cards With Four AttributesHard

  A coding problem based on a card game in which each card has four attributes with three values each, and three cards form a set when every attribute is all the same or all different. It asks for every set among a group of distinct cards, testing the validity rule, canonical output ordering and improving on a cubic brute force.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Shortest Grid PathMedium

  This question evaluates a candidate's ability to implement and reason about grid-based shortest-path algorithms, covering graph traversal, state representation, and obstacle handling.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Shortest Wiki Click PathMedium

  This question evaluates understanding of graph traversal and shortest-path concepts, testing competencies in algorithm design, handling cycles, complexity analysis, and integration with external link-retrieval APIs.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Tree Height After Deleting Nodes and Promoting ChildrenMedium

  Compute tree height after deleting nodes while promoting their children, preserving descendants and counting retained nodes without rebuilding the tree.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find longest substring with at most k distinctMedium

  This question evaluates a candidate's ability to design efficient string-processing algorithms using sliding-window techniques, reason about time and space complexity, and correctly handle Unicode grapheme clusters when returning substrings.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Find the Minimum Bus Fleet with Station ConstraintsMedium

  Minimize a bus fleet when trips have origin and destination stations, tracking when buses become available at the correct departure station.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Minimum Fleet for a Bus TimetableMedium

  Find the minimum number of buses needed for a timetable by tracking overlapping trips and allowing reuse at equal arrival and departure times.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Nearest Target Character and Support Streaming UpdatesMedium

  Design a data structure that tracks characters in a dynamic string, supporting streaming appends, character updates, and fast queries for the distance to the nearest target character.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Shortest Click Path with a Fallible Link APIMedium

  Implement a breadth-first search to find the shortest URL click path between two pages using a fallible link-fetching API with retry and tie-breaking logic.

  SnowflakeSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Find the Winner of a Connect Four Game from Its Move SequenceMedium

  Given a board size and the sequence of columns two players drop pieces into, return which player first lines up four pieces horizontally, vertically or diagonally, or 0 if nobody does. It tests grid simulation, gravity placement and careful line counting in all four directions.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Handle an AI-Led Screening InterviewMedium

  Prepare a structured Snowflake behavioral interview answer for handle an ai-led screening interview. The prompt helps candidates frame concrete stories, ownership, trade-offs, and follow-up-ready details.

  SnowflakeSoftware EngineerBehavioral & LeadershipHR Screen
• Height of an N-ary Tree After Deleting Nodes and Promoting Their ChildrenMedium

  Given an N-ary tree as a parent array and a set of nodes to delete, where each deleted node's children are promoted to its nearest surviving ancestor, return the height of the resulting tree. It tests tree traversal over a parent array and careful reasoning about how deletions change depths.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Highest Total Profit from Non-Overlapping Jobs When Endpoints May TouchMedium

  Each job has a start time, an end time and a profit; choose jobs that do not overlap, where one job may start exactly when another ends, to maximize the total profit. It tests weighted interval scheduling and handling touching endpoints correctly.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement DFS with cycle detection and topo orderHard

  This question evaluates mastery of graph algorithms—specifically depth-first search (both recursive and iterative), directed cycle detection, topological ordering, and discovery/finish timestamping—and falls under the Coding & Algorithms domain.

  SnowflakeData ScientistCoding & AlgorithmsTechnical Screen
• Implement a JSON ParserHard

  This problem tests your ability to implement a recursive-descent parser for a subset of the JSON format, focusing on string manipulation, state management, and hierarchical data structure construction.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an event emitterMedium

  This problem tests your understanding of the observer pattern, internal state management using maps, and the ability to handle edge cases in listener lifecycle management.

  SnowflakeFrontend EngineerCoding & AlgorithmsTechnical Screen