practice a little every day, paws crossed ♡
Coding & Algorithms 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 1351–1380 of 1706 results
- 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 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 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 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 - SnowflakeHardData ScientistImplement DFS with cycle detection and topo order
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.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerImplement a JSON Parser
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.
Coding & AlgorithmsTechnical ScreenParsingRecursionString Processing - SnowflakeMediumFrontend EngineerImplement an event emitter
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.
Coding & AlgorithmsTechnical ScreenJavaScriptDesign PatternsEvent-Driven - SnowflakeHardSoftware EngineerImplement course scheduling and rate limiter analysis
This combined question evaluates proficiency in graph-based dependency reasoning (cycle detection and course scheduling) and time-series request processing (rate-limiter behavior and sliding-window request counting) within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerImplement topological sort and tree boundary traversal
These tasks evaluate core competencies in directed graph algorithms (topological ordering and cycle detection) and binary tree traversals (boundary identification and leaf enumeration), testing understanding of dependency modeling and traversal patterns.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerList the Nodes on the Path Between Two Nodes of a Binary Tree
Given a binary tree stored as child-index arrays and two node indices, return the nodes on the unique path between them, from the first node to the second. It tests parent tracking, ancestor reasoning and handling cases where one node lies above the other.
Coding & AlgorithmsTechnical Screen - SnowflakeHardSoftware EngineerMaximize revenue by choosing one query type
This problem tests greedy optimization and modular arithmetic skills to determine the most profitable query strategy given a limited time window.
Coding & AlgorithmsTechnical ScreenGreedyMathOptimization - SnowflakeHardSoftware EngineerMinimize coins with overpay and change
This problem tests your ability to optimize combinatorial decisions under constraints by identifying a greedy approach with a fallback to search or dynamic programming.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingOptimizationAlgorithms - SnowflakeMediumSoftware EngineerMinimum Months to Finish All Courses with Durations and Unlimited Parallelism
Courses take different numbers of months, some must finish before others start, and any number can run in parallel; return the minimum time to finish them all. It tests longest-path reasoning on a directed acyclic graph processed in topological order.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMinimum Node Deletions to Bring an N-ary Tree's Height Within k
Given an N-ary tree as a parent array and a limit k, find the fewest non-root nodes to delete, promoting each deleted node's children to its nearest surviving ancestor, so that the tree's height is at most k. It tests reasoning about root-to-leaf paths and choosing deletions that shorten many paths at once.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMinimum Prunes to Bring a Filesystem Tree's Depth Under a Limit
Given a directory tree where deleting a node reattaches its children to its own parent, find the minimum number of deletions needed to bring the deepest root-to-leaf path down to a given limit. Tests a budget-passing tree DP where deleting a node changes how much depth its children inherit.
Coding & AlgorithmsTechnical Screentreesdynamic-programmingrecursion - SnowflakeMediumSoftware EngineerMost Frequent k Words or Bestselling Titles with Alphabetical Tie-Breaks
Given a list of items such as trending words or bestselling book titles and a number k, return the k most frequent items ordered by count, with ties broken alphabetically. It tests frequency counting, sorting with a compound key and heap-based selection.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerMost Meetings You Can Attend When Each Takes One Day Within Its Range
Each meeting can be attended on any single day within its range, and only one meeting fits on each day; return the largest number of meetings you can attend. It tests interval scheduling reasoning and an exchange argument for why a local choice stays optimal.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerN-ary Tree Height After Deleting Nodes and Reattaching Their Children
Given an N-ary tree as a parent array and a set of nodes to delete, move each deleted node's children up to its nearest surviving ancestor and report the height of the resulting tree. Tests building a tree from parent links, reasoning about cascading deletions, and computing depths on a tree that can be a path of 100,000 nodes.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerPropagate Permission Letters Through a DAG Using Each Node's Final State
Given a directed acyclic graph in which each node grants and revokes letter permissions, compute every node's final set of letters when each node passes only its final state to its children. Tests topological processing, set propagation over multiple parents, and letters that descendants grant again after an ancestor revokes them.
Coding & AlgorithmsTechnical Screen - SnowflakeMediumSoftware EngineerQuery Unique and Most-Frequent Keys in a Recent Event Window
Design an in-memory event tracker that maintains the most recent m arrivals from a timestamped stream and efficiently queries distinct key counts and top-frequency keys above a cutoff timestamp.
Coding & AlgorithmsTechnical Screensliding-windowbinary-searchhash-table - SnowflakeMediumSoftware EngineerReplay Ops on a Freezer-Probe Stack That Tracks Its Minimum in O(1)
Replay a sequence of push/pop/peek/min-read operations on a stack of freezer temperature readings and return what each read produces, where reading the current minimum must be as fast as pushing or popping. Tests pairing a stack with running-minimum bookkeeping that stays correct through duplicate minimums and repeated pops.
Coding & AlgorithmsTechnical Screenstackdata-structuressimulation - SnowflakeMediumSoftware EngineerReturn the Prerequisite Route for a Target Course
Find a deterministic, lexicographically smallest topological order of all direct and indirect prerequisites for a specific target course while ignoring cycles outside the target's dependency subgraph.
Coding & AlgorithmsTechnical ScreenGraphTopological SortHeap - SnowflakeMediumSoftware EngineerReverse a Character Array In Place with Constant Extra Memory
Reverse a string given as an array of characters in place, using only constant extra memory, and return the same list. A short coding warm-up that tests index handling, swapping elements and odd and even lengths without building a copy.
Coding & AlgorithmsTechnical Screen
Snowflake