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 2101–2130 of 2629 results
- SierraHardSoftware EngineerSplit Markdown Into Header-Aware Chunks
This question evaluates string parsing, stateful text-processing, and algorithmic chunking skills, focusing on hierarchical header tracking and enforcing size constraints while preserving document order.
Coding & AlgorithmsTechnical Screen - SigmacomputingMediumSoftware EngineerBuild a Pivot Table Aggregator
This question evaluates a candidate's ability to implement data aggregation and efficient lookup structures, focusing on grouping, associative aggregations, and maintaining intermediate state for derived metrics.
Coding & AlgorithmsTechnical Screen - SigmacomputingMediumSoftware EngineerEvaluate a Formula AST with Variables
This problem tests tree traversal techniques, recursive evaluation, and the implementation of short-circuit logic in expression trees containing variables.
Coding & AlgorithmsOnsiteTreesRecursionAST - SigmacomputingEasySoftware EngineerImplement a basic pivot table with totals
This question evaluates a candidate's ability to perform in-memory data aggregation, multi-dimensional grouping, handling missing combinations, and formatted text output for pivot tables including row/column totals.
Coding & AlgorithmsTechnical Screen - SnapchatMediumSoftware EngineerCheck if a binary tree is complete
This problem tests your understanding of binary tree properties and your ability to perform a level-order traversal to verify structural completeness.
Coding & AlgorithmsTechnical ScreenBinary TreeBFSData Structures - SnapchatMediumSoftware EngineerCompute islands in a binary grid
This question evaluates a candidate's competency in modeling grids as graphs, detecting connected components, applying graph traversal algorithms (DFS/BFS) and disjoint-set (Union-Find) data structures, and analyzing algorithmic time and space complexity.
Coding & AlgorithmsOnsite - SnapchatHardSoftware EngineerCompute longest increasing path in matrix
This question evaluates algorithmic problem-solving skills in graph traversal and dynamic programming on matrices, measuring understanding of state representation and performance trade-offs in grid-based searches within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - SnapchatHardSoftware EngineerCompute shortest path in a 2D grid
This question evaluates understanding of graph traversal and pathfinding concepts, including modeling a 2D grid as a graph and reasoning about shortest-path computations and obstacle handling.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerCompute shortest recursive string encoding
This question evaluates proficiency in string manipulation, pattern detection, recursion, and dynamic programming for efficient sequence compression in the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - SnapchatMediumSoftware EngineerCompute sliding window median
This question evaluates the ability to maintain a running median over a sliding window, testing competencies in data structures, order statistics, dynamic updates, and algorithmic efficiency within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - SnapchatMediumSoftware EngineerCount Grid Islands That Never Touch the Border
Coding problem on a binary grid where 0 marks land and 1 marks water: count the islands, connected horizontally or vertically, that have no cell on the grid's border. It tests grid traversal, connected components and careful handling of islands that reach the edge through a single cell.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerCount islands with eight-direction adjacency
This question evaluates a candidate's competency in graph traversal algorithms and data-structure trade-offs by counting connected components on a grid with eight-direction adjacency, focusing on BFS/DFS behavior and optional Union-Find approaches.
Coding & AlgorithmsTechnical Screen - SnapchatHardSoftware EngineerCount ways to decode digit string
This question evaluates a candidate's skill in dynamic programming and combinatorial reasoning about string partitioning, testing competency in counting valid decodings under constraint handling and edge-case analysis.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerDetermine blockage and parse HTML tokens
This question evaluates computational geometry and graph connectivity for the circular-stones subproblem and parsing plus tree data-structure manipulation for the HTML-like token subproblem, measuring skills in modeling spatial overlap, graph traversal/union operations, hierarchical DOM construction, and dynamic node insertion/deletion.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerFind Maximum Island Perimeter
This problem tests grid traversal techniques (DFS/BFS) and the ability to calculate boundary contributions within a connected component in a 2D matrix.
Coding & AlgorithmsTechnical ScreenDFSBFSGrid - SnapchatMediumSoftware EngineerFind index of first unique character
Find index of first unique character 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 - SnapchatMediumSoftware EngineerFind max node-value range across components
This problem tests your ability to traverse an undirected graph to identify connected components and perform aggregations over the nodes within each component.
Coding & AlgorithmsTechnical ScreenGraphDFSBFS - SnapchatMediumSoftware EngineerFind top co-purchased products
This question evaluates algorithmic problem-solving and data engineering skills, focusing on computing and ranking co-occurrence frequencies, choosing efficient data structures for pairwise counts, and contrasting offline batch implementation with streaming updates.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerHandle cards, islands, Trie, median
These problems evaluate proficiency in core data structures and algorithmic problem-solving, covering grouping/counting techniques, grid-based island detection, trie (prefix tree) design, and streaming median computation within the domain of data structures and algorithms.
Coding & AlgorithmsTechnical Screen - SnapchatHardSoftware EngineerImplement LRU cache and prime products array
This question evaluates proficiency in implementing efficient mutable data structures and in enumerating combinatorial results, specifically testing understanding of LRU cache eviction behavior and generation of all non-empty subset products from a set of primes.
Coding & AlgorithmsOnsite - SnapchatHardSoftware EngineerImplement a Leaky Bucket Limiter
This problem tests your ability to implement a thread-safe rate limiter using the Leaky Bucket algorithm, requiring careful management of timestamps and shared state.
Coding & AlgorithmsOnsiteConcurrencyRate-LimitingAlgorithms - SnapchatMediumSoftware EngineerImplement a Timestamped Counter
This problem tests your ability to design a data structure that handles time-series data and performs efficient range-based queries using binary search.
Coding & AlgorithmsTechnical ScreenBinary SearchData StructuresTime Series - SnapchatMediumSoftware EngineerImplement a custom list with iterator and map
This problem tests your understanding of linked list internals, the Iterator design pattern, and the application of higher-order functions in a custom data structure.
Coding & AlgorithmsTechnical ScreenLinked ListsDesign PatternsIterator - SnapchatHardSoftware EngineerImplement a size-bounded LRU cache
This problem tests your ability to extend the standard LRU cache pattern to support items with heterogeneous 'weights', requiring a data structure that maintains access order while managing a cumulative capacity constraint.
Coding & AlgorithmsOnsiteLRUHash MapDoubly Linked List - SnapchatMediumSoftware EngineerImplement binary search for boundary index
This question evaluates a candidate's ability to implement binary search for boundary indices, including correct handling of duplicates, providing iterative and recursive variants, and reasoning about time and space complexity.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerImplement sin(x) with precision constraints
This question evaluates understanding of numerical methods, floating-point arithmetic, and algorithmic implementation in the Coding & Algorithms domain by requiring an approximation of the sine function under explicit error bounds.
Coding & AlgorithmsTechnical Screen - SnapchatMediumSoftware EngineerMaximize correct guesses in a hat line puzzle
This problem tests your ability to devise a deterministic strategy for a group of people to maximize correct guesses about their own attributes based on observed information from others.
Coding & AlgorithmsOnsiteLogicParityGreedy Strategy - SnapchatMediumSoftware EngineerRadar Overlaps and Undetected Crossing of a Rectangular Room
Two-part geometry coding problem about circular radars placed inside a rectangular room. For each radar, list every other radar whose coverage overlaps it, then decide whether a point object can travel from the left wall to the right wall without entering any radar's coverage.
Coding & AlgorithmsOnsite - SnapchatMediumSoftware EngineerRemove the Maximum Number of Connected Stones
Determine the maximum number of stones that can be removed from a 2D grid where a stone may only be removed if another stone shares its row or column. This tests graph modeling, connected components, and Union-Find or BFS/DFS traversals.
Coding & AlgorithmsTechnical ScreenGraphUnion-FindDFS - SnapchatMediumSoftware EngineerSolve Open the Lock BFS
This question evaluates the ability to model the lock as a state-space and apply graph traversal and shortest-path techniques (breadth-first search) to determine minimal move sequences under constraints.
Coding & AlgorithmsTechnical Screen
Sierra
Snapchat