Katkat

practice a little every day, paws crossed ♡

Software Engineer 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 2191–2220 of 2629 results

  • SnowflakeMediumSoftware Engineer
    Return 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 Engineer
    Reverse 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
  • SnowflakeEasySoftware Engineer
    Schedule prerequisite classes with retakes

    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.

    Coding & AlgorithmsOnsiteGraphTopological SortDependency Resolution
  • SnowflakeMediumSoftware Engineer
    Serialize and deserialize a dictionary trie

    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.

    Coding & AlgorithmsOnsite
  • SnowflakeMediumSoftware Engineer
    Solve Array Distance and Wiki Navigation

    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.

    Coding & AlgorithmsOnline Assessment
  • SnowflakeMediumSoftware Engineer
    Solve Matrix and Array Distance Problems

    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.

    Coding & AlgorithmsTechnical ScreenGraphBFSMatrix
  • SnowflakeMediumSoftware Engineer
    Solve build ordering and expression evaluation

    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.

    Coding & AlgorithmsTechnical Screen
  • SnowflakeHardSoftware Engineer
    Solve scheduling and tree path problems

    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.

    Coding & AlgorithmsTechnical ScreenTreesDynamic ProgrammingRecursion
  • SnowflakeMediumSoftware Engineer
    Sort an RGB Record Collection In Place

    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.

    Coding & AlgorithmsTechnical ScreenSortingTwo PointersIn-place
  • SnowflakeMediumSoftware Engineer
    Stack with Constant-Time Minimum over a Sequence of Operations

    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.

    Coding & AlgorithmsTechnical Screen
  • SnowflakeMediumSoftware Engineer
    Transform tree using counterpart subtree sums

    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.

    Coding & AlgorithmsTechnical Screen
  • SnowflakeMediumSoftware Engineer
    Transform tree with subtree sum mapping

    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.

    Coding & AlgorithmsTechnical Screen
  • SnowflakeMediumSoftware Engineer
    Traverse All Reachable Pages With Parallel BFS

    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.

    Coding & AlgorithmsTechnical ScreenBreadth-First SearchConcurrencyGraph
  • SoFiEasySoftware Engineer
    Count completed car journeys from sensor logs

    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.

    Coding & AlgorithmsTechnical Screen
  • SoFiMediumSoftware Engineer
    Design a key-value store with getLast

    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.

    Coding & AlgorithmsTechnical Screen
  • SoFiMediumSoftware Engineer
    Find Kth Unique Maximum

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

    Coding & AlgorithmsOnsiteHash MapSortingFrequency Count
  • SoFiEasySoftware Engineer
    Find Smallest Common Row Value

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

    Coding & AlgorithmsTechnical Screen
  • SoFiMediumSoftware Engineer
    Find the second most frequent tag

    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.

    Coding & AlgorithmsTechnical Screen
  • SoFiMediumSoftware Engineer
    Format words into wrapped/justified lines

    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.

    Coding & AlgorithmsTechnical ScreenStringsGreedyArray
  • SoFiMediumSoftware Engineer
    Implement a multithreaded task executor with semaphores

    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.

    Coding & AlgorithmsTechnical Screen
  • SoFiMediumSoftware Engineer
    Implement tree ops and LRU cache

    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.

    Coding & AlgorithmsOnsite
  • SoFiEasySoftware Engineer
    Return All Nodes Reachable from a Starting Vertex

    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.

    Coding & AlgorithmsTechnical ScreenGraphsBFSDFS
  • SonatusHardSoftware Engineer
    Compute days until a higher reading

    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.

    Coding & AlgorithmsTechnical Screen
  • SpacexMediumSoftware Engineer
    Dynamic Island Counts

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

    Coding & AlgorithmsTechnical Screen
  • SquareMediumSoftware Engineer
    Build a Trust-Aware BIN Database

    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.

    Coding & AlgorithmsOnsite
  • SquareHardSoftware Engineer
    Implement transaction network queries

    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.

    Coding & AlgorithmsTechnical Screen
  • SquareEasySoftware Engineer
    List the Two-by-Two Blocks Covering Each Black Cell

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

    Coding & AlgorithmsTechnical ScreenArraysHash MapsGrid
  • SquarepointEasySoftware Engineer
    Apply Insert, Update, and Remove Operations to a Keyed Store

    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.

    Coding & AlgorithmsOnsiteHash MapDesignString
  • SquarepointMediumSoftware Engineer
    Find the Most Frequent Character with a Tie-Breaker

    Tests string traversal, frequency counting, and deterministic tie-breaking under large input constraints.

    Coding & AlgorithmsHR ScreenStringsHash TableCounting
  • SquarepointMediumSoftware Engineer
    Parse payroll file and answer queries

    This question evaluates proficiency in robust file parsing, schema-driven data modeling, type conversion, validation, duplicate handling, and implementing aggregate and ranking queries using Python's standard library for messy, delimited payroll data.

    Coding & AlgorithmsOnline Assessment