Coding & Algorithms interview questions

Showing 2701–2730 of 3276 results

• Solve Matrix and Array Distance ProblemsMedium

  Implement a multi-source breadth-first search to find the shortest path from every compute node to its nearest data warehouse in a grid with obstacles.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve and optimize 3Sum and variants at scaleMedium

  This question evaluates algorithmic problem-solving skills in array processing, deduplication and combinatorial counting, external-memory and streaming algorithm design, and complexity analysis including integer overflow considerations.

  SnowflakeData ScientistCoding & AlgorithmsOnsite
• Solve build ordering and expression evaluationMedium

  This question evaluates competency in graph algorithms (topological ordering and cycle detection) and in parsing/evaluating arithmetic expressions with correct operator precedence, associativity, unary operators, and 64-bit integer semantics.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve scheduling and tree path problemsHard

  This problem tests your ability to optimize path calculations in a tree by combining depth-first traversal with a greedy or dynamic programming approach to select paths that satisfy specific constraints.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Sort an RGB Record Collection In PlaceMedium

  This question tests the ability to partition an array into three distinct groups (Red, Green, Blue) in a single pass using constant extra space, which is a classic application of the Dutch National Flag algorithm.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Stack with Constant-Time Minimum over a Sequence of OperationsMedium

  Design a stack that supports push, pop, top and reading its current minimum in constant time, then run it over a sequence of operations and return what the reads produce. Tests data structure design, duplicate minimum values and keeping auxiliary state consistent on every pop.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Transform tree using counterpart subtree sumsMedium

  This question evaluates proficiency with binary tree algorithms and in-place subtree aggregation, emphasizing traversal strategies, shape verification, and handling subtree sums under linear-time and O(h) space constraints.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Transform tree with subtree sum mappingMedium

  Transform tree with subtree sum mapping evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Traverse All Reachable Pages With Parallel BFSMedium

  Implement a concurrent breadth-first web crawler that discovers all reachable pages from a start URL. The crawler must fetch pages concurrently while maintaining deterministic level-order output and safely handling cycles and fetch errors.

  SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count completed car journeys from sensor logsEasy

  This question evaluates stateful event-stream processing and per-entity state management, testing the ability to track and reconcile time-ordered sensor events while handling edge cases like unmatched or spurious events.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a key-value store with getLastMedium

  Design a key-value store with getLast evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Kth Unique MaximumMedium

  This problem tests your ability to efficiently manage deduplication and order-statistics using hash maps or sorting techniques while handling multiple input collections.

  SoFiSoftware EngineerCoding & AlgorithmsOnsite
• Find Smallest Common Row ValueEasy

  This question evaluates algorithmic problem-solving skills focused on array processing, intersection across multiple sorted sequences, and time/space complexity analysis.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the second most frequent tagMedium

  This question evaluates a candidate's ability to perform frequency analysis and stable tie-breaking on a linear sequence, exercising skills in hashing, counting, and handling edge cases such as equal frequencies.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Format words into wrapped/justified linesMedium

  This problem tests your ability to implement a greedy word-wrapping algorithm that packs words into lines of a fixed width while managing spacing constraints.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a multithreaded task executor with semaphoresMedium

  This question evaluates understanding of concurrent programming, thread-safety, semaphore-style resource management, exception-safe permit release, and extensible API design, and it falls under the Coding & Algorithms category testing concurrency/multithreading, synchronization primitives, and resource management.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement tree ops and LRU cacheMedium

  This question evaluates proficiency with tree-based mutable data structures and cache design, specifically maintaining aggregated state in a full binary tree after leaf updates and implementing an LRU cache supporting O(1) get/put operations.

  SoFiSoftware EngineerCoding & AlgorithmsOnsite
• Return All Nodes Reachable from a Starting VertexEasy

  This problem tests your ability to perform a graph traversal (BFS or DFS) to identify all reachable nodes from a specified starting point in an undirected graph.

  SoFiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute days until a higher readingHard

  This question evaluates proficiency in array processing and the next-greater-element concept, measuring algorithmic reasoning about sequence traversal, comparisons, and managing time/space trade-offs.

  SonatusSoftware EngineerCoding & AlgorithmsTechnical Screen
• Dynamic Island CountsMedium

  Report the exact island count after each land addition by tracking only activated cells and merging distinct neighboring components efficiently.

  SpacexSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Logic Puzzles: Algorithms and Proofs RequiredMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve Logic Puzzles: Algorithms and Proofs Required states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  SpokeoData ScientistCoding & AlgorithmsOnsite
• Join Tables and Rank UsersMedium

  This question evaluates proficiency in SQL and data-engineering skills—specifically joins, aggregation and ranking via window functions, event deduplication, and query performance considerations across analytics tables.

  SpotifyMachine Learning EngineerCoding & AlgorithmsOnsite
• Longest Contiguous Stretch of Distinct Characters in a StringMedium

  A Spotify backend technical-screen coding problem: given a string, find the length of the longest contiguous substring in which no character repeats. It tests careful string scanning, linear-time reasoning, and edge cases such as case sensitivity, ties and empty input.

  SpotifyBackend EngineerCoding & AlgorithmsTechnical Screen
• Build a Trust-Aware BIN DatabaseMedium

  Build an in-memory card-prefix database that resolves brand and card type independently across overlapping writes. Practice combining longest-prefix matching with trust and recency rules while preserving omitted fields and supporting heavy lookup traffic.

  SquareSoftware EngineerCoding & AlgorithmsOnsite
• Implement transaction network queriesHard

  This question evaluates the ability to model and query dynamic graph connectivity and reachability for pairwise transactions, testing competencies in graph representation, dynamic data structures, and reachability queries within the Coding & Algorithms domain and emphasizing practical application of algorithmic concepts.

  SquareSoftware EngineerCoding & AlgorithmsTechnical Screen
• List the Two-by-Two Blocks Covering Each Black CellEasy

  This problem tests your ability to navigate grid coordinates, implement range boundaries, and perform efficient dictionary-based data collection.

  SquareSoftware EngineerCoding & AlgorithmsTechnical Screen
• Apply Insert, Update, and Remove Operations to a Keyed StoreEasy

  Implement an in-memory key-value store processor that executes insert, update, and remove commands with strict handling for missing or duplicate keys, returning the final state in deterministic order.

  SquarepointSoftware EngineerCoding & AlgorithmsOnsite
• Compute drawdown, profit, and coin changeMedium

  This question evaluates a candidate's ability to compute financial time-series metrics and apply algorithmic techniques such as array processing and optimization/dynamic programming to identify maximum drawdown and its indices.

  SquarepointData ScientistCoding & AlgorithmsTechnical Screen
• Count Index Triplets With an Even Product Modulo a Given NumberMedium

  From a Squarepoint technical screen: count the triplets of distinct positions in an integer array whose three values have an even product, and return the count modulo a given number. It tests efficient counting on large inputs, parity with zero and negative values, and remembering to apply the required modulo.

  SquarepointData ScientistCoding & AlgorithmsTechnical Screen
• Count Ways to Reach Step n With a Given Set of Step SizesMedium

  From a Squarepoint technical screen: count the ordered sequences of moves that climb exactly n stairs when every move uses a step size from a given set. It tests careful counting of ordered choices, targets that cannot be reached, and the interviewer's follow-up about reducing the extra space the solution uses.

  SquarepointData ScientistCoding & AlgorithmsTechnical Screen