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 7921–7950 of 9403 results
- SnowflakeMediumSoftware EngineerDesign error detection and propagation algorithms
This question evaluates algorithm design and complexity-analysis skills across search and graph problems, specifically log search for first-error detection, reachability and failure propagation in directed service dependency graphs, and longest-path reasoning under cycle or DAG assumptions.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerDesign multi-core service startup scheduler
This question evaluates scheduling and resource-management skills, including DAG dependency handling, concurrency bounding, timeout/retry strategies, observability, and correctness reasoning for service startup orchestration.
System DesignOnsite - SnowflakeHardSoftware EngineerDesign transactional in-memory key-value store
This question evaluates understanding of in-memory key–value store semantics, transactional and nested transaction behavior, and practical competencies in hash-based data structures and thread-safety for concurrent access.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerDesign under vague distributed requirements
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.
System DesignTechnical Screen - SnowflakeMediumSoftware EngineerDetermine Whether an Undirected Graph Is 3-Colorable
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.
Coding & AlgorithmsTechnical ScreenGraphBacktrackingRecursion - SnowflakeHardSoftware EngineerDiscuss a Proud Project, Conflict, Challenge, and Team Advice
This question assesses your ability to articulate professional growth, conflict resolution, technical decision-making, and self-awareness within a collaborative engineering environment.
Behavioral & LeadershipOnsiteBehavioralLeadershipCommunication - SnowflakeMediumSoftware EngineerDiscuss challenges and cross-functional collaboration
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.
Behavioral & LeadershipOnsite - SnowflakeMediumSoftware EngineerEffective Permissions in an Inheritance DAG with Allow and Deny Lists
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.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumSoftware EngineerEvaluate an Arithmetic Expression with Parentheses, Unary Minus and Four Operators
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerEvaluate arithmetic expression with variables
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumFrontend EngineerExplain React classes, lifecycle, and hooks
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.
Software Engineering FundamentalsTechnical ScreenReactFrontendJavaScript - SnowflakeMediumSoftware EngineerExplain a Technical Project from Milestone to Production
Explain a technical project from background and ownership through a major milestone, launch problems, production validation, and lessons learned.
Behavioral & LeadershipTechnical Screen - SnowflakeMediumSoftware EngineerFewest Buses Needed to Cover Every Scheduled Trip
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFewest Link Clicks Between Two Wiki Pages, Then Scale the Search
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.
Software Engineering FundamentalsTechnical Screen - SnowflakeMediumSoftware EngineerFewest Node Additions and Removals to Make a Binary Tree Perfect
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFewest Semesters to Finish All Courses Taking At Most k per Semester
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFilter hierarchical paths after deletions
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.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerFind Every Three-Card Set Among Cards With Four Attributes
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFind Shortest Grid Path
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFind Shortest Wiki Click Path
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFind Tree Height After Deleting Nodes and Promoting Children
Compute tree height after deleting nodes while promoting their children, preserving descendants and counting retained nodes without rebuilding the tree.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFind longest substring with at most k distinct
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.
Coding & AlgorithmsOnsite - SnowflakeMediumSoftware EngineerFind the Minimum Bus Fleet with Station Constraints
Minimize a bus fleet when trips have origin and destination stations, tracking when buses become available at the correct departure station.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFind the Minimum Fleet for a Bus Timetable
Find the minimum number of buses needed for a timetable by tracking overlapping trips and allowing reuse at equal arrival and departure times.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerFind the Nearest Target Character and Support Streaming Updates
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.
Coding & AlgorithmsTechnical Screendata-structuresbinary-searchdesign - SnowflakeMediumSoftware EngineerFind the Shortest Click Path with a Fallible Link API
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.
Software Engineering FundamentalsTechnical Screenbfsgrapherror-handling - SnowflakeMediumSoftware EngineerFind the Winner of a Connect Four Game from Its Move Sequence
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerHandle an AI-Led Screening Interview
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.
Behavioral & LeadershipHR Screen - SnowflakeMediumSoftware EngineerHeight of an N-ary Tree After Deleting Nodes and Promoting Their Children
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.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerHighest Total Profit from Non-Overlapping Jobs When Endpoints May Touch
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.
Coding & AlgorithmsTechnical Screen
Snowflake