Coding & Algorithms interview questions

Showing 2671–2700 of 3276 results

• 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 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
• 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
• Implement course scheduling and rate limiter analysisHard

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement crawler and bracket validatorMedium

  This question evaluates competencies in web crawling and string validation, covering graph traversal and cycle avoidance with domain filtering for crawl discovery, and delimiter matching with error indexing for multi-type bracket validation.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Implement topological sort and tree boundary traversalMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• List the Nodes on the Path Between Two Nodes of a Binary TreeMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize revenue by choosing one query typeHard

  This problem tests greedy optimization and modular arithmetic skills to determine the most profitable query strategy given a limited time window.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize coins with overpay and changeHard

  This problem tests your ability to optimize combinatorial decisions under constraints by identifying a greedy approach with a fallback to search or dynamic programming.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Months to Finish All Courses with Durations and Unlimited ParallelismMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Node Deletions to Bring an N-ary Tree's Height Within kMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Prunes to Bring a Filesystem Tree's Depth Under a LimitMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Most Frequent k Words or Bestselling Titles with Alphabetical Tie-BreaksMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Most Meetings You Can Attend When Each Takes One Day Within Its RangeMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• N-ary Tree Height After Deleting Nodes and Reattaching Their ChildrenMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Print an Org Chart as a Depth-Ordered List from Supervisor PairsMedium

  Given a flat list of (person, supervisor) ID pairs, reconstruct the organization as a forest rooted at whoever has no supervisor, then emit a deterministic preorder listing of (id, depth). Tests root detection, building ordered adjacency lists, and careful DFS ordering.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Propagate Permission Letters Through a DAG Using Each Node's Final StateMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Query Unique and Most-Frequent Keys in a Recent Event WindowMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Replay Ops on a Freezer-Probe Stack That Tracks Its Minimum in O(1)Medium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return the Prerequisite Route for a Target CourseMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reverse a Character Array In Place with Constant Extra MemoryMedium

  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.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Schedule prerequisite classes with retakesEasy

  This problem tests your ability to model dependencies using a Directed Acyclic Graph (DAG) and perform a topological sort while accounting for re-take conditions.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Serialize and deserialize a dictionary trieMedium

  Snowflake software-engineer onsite coding question: design a compact, robust wire format to serialize and deserialize a dictionary trie. Covers DFS vs BFS encodings, delimiter vs length-prefix framing and escaping, explicit end-of-word markers, streaming, malformed/partial-input handling, forward/backward compatibility, Unicode, compression, memory limits, and O(N) complexity.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
• Solve Array Distance and Wiki NavigationMedium

  This question evaluates array-processing and graph-algorithm skills, specifically minimum-distance computation between marked elements in a one-dimensional array and shortest-path navigation in a directed link graph, plus edge-case reasoning and test-case design.

  SnowflakeSoftware EngineerCoding & AlgorithmsOnline Assessment