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 871–900 of 2629 results
- FigmaMediumSoftware EngineerConvert Leveled Rich-Text Tokens into Nested Lists
Tests parsing a linear sequence of leveled tokens into a hierarchical tree or nested list structure using stack-based tree construction.
Coding & AlgorithmsOnsiteStackTreeAlgorithms - FigmaMediumSoftware EngineerDesign document layer with undo/redo
This question evaluates a candidate's understanding of reversible state mutation and undo/redo semantics, covering batching, inverse operation representation, operation compression, failure handling, and choice of data structures for edit history.
Coding & AlgorithmsTechnical Screen - FigmaMediumSoftware EngineerValidate a Balanced INDENT and DEDENT Token Stream
Determine if a sequence of structural tokens maintains valid scoping rules—never closing an un-opened level and closing all levels by the end. Tests single-pass balance checking, edge-case handling for empty streams, and O(1) space optimization.
Coding & AlgorithmsOnsiteStackParsingState Machine - FlexportHardSoftware EngineerIdentify a Target Word with Repeated Minimax Guesses
This problem tests advanced search heuristics and state-space pruning by requiring the implementation of a Wordle-style feedback system that uses a minimax strategy to identify a secret word from a dictionary.
Coding & AlgorithmsOnsiteMinimaxHeuristicsPruning - FlexportHardSoftware EngineerMeasure Meeting Coverage and Required Rooms
This problem tests your ability to manipulate interval data, specifically calculating the total coverage area and finding the maximum concurrency using a sweep-line algorithm.
Coding & AlgorithmsOnsiteSortingSweep-lineIntervals - FlexportMediumSoftware EngineerSolve Two Robbery Optimization Variants
This problem tests your ability to apply dynamic programming to linear structures and tree-based data structures to find the maximum weight independent set under constraints.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingTreesRecursion - FlexportMediumSoftware EngineerValidate and restore IPv4 addresses
This question evaluates string processing, strict input validation rules, and constrained combinatorial search skills (e.g., backtracking) for generating and verifying IPv4 addresses.
Coding & AlgorithmsTechnical Screen - FlipsterEasySoftware EngineerCompute max profit from one stock trade
This question evaluates a candidate's understanding of array-based data processing, difference maximization, and basic algorithmic optimization for time-series inputs. It is commonly asked in Coding & Algorithms interviews to assess fundamental practical programming ability and attention to edge cases (e.g.
Coding & AlgorithmsTechnical Screen - Fora TravelMediumSoftware EngineerMerge Sorted Arrays
This question evaluates competency in implementing and generalizing merge operations on sorted arrays, exercising algorithmic problem-solving, array manipulation, handling of edge cases (empty arrays, negative numbers, duplicates), and analysis of time and space complexity.
Coding & AlgorithmsOnsite - Fora TravelMediumSoftware EngineerMerge Two Unsorted Arrays into the First Array
Tests array manipulation, handling buffer capacity without relying on placeholder values, and analyzing the trade-offs of in-place sorting strategies.
Coding & AlgorithmsTechnical ScreenArraysSortingIn-Place - FortinetMediumSoftware EngineerSolve linked list reversal and minima problems
This problem tests your ability to manipulate linked list pointers iteratively and perform efficient binary search on a structurally complex matrix.
Coding & AlgorithmsTechnical ScreenLinked ListPointersBinary Search - Fuse EnergyMediumSoftware EngineerImplement simplified Excel with SET/GET/SUM
This question evaluates understanding of data structures and algorithms for modeling and implementing a simplified spreadsheet, covering dependency graphs, formula evaluation, incremental updates, and cycle detection.
Coding & AlgorithmsTechnical Screen - GarminMediumSoftware EngineerValue on the Secondary Diagonal of a Center-Out Clockwise Spiral Matrix
A matrix coding question: an odd-sized square matrix is filled with a clockwise spiral that starts at the center cell, and you must return the number on its secondary diagonal a given number of rows above or below the middle row. It tests precise index arithmetic and reasoning about how the spiral grows outward ring by ring.
Coding & AlgorithmsOnsite - Garner HealthMediumSoftware EngineerValidate a String of Brackets
This problem tests the candidate's ability to use a stack data structure to track nested states and handle character matching logic.
Coding & AlgorithmsTechnical ScreenStackStringsData Structures - GeMediumSoftware EngineerCount visible people to the right
This question evaluates algorithmic problem-solving with arrays and visibility relations, assessing competency in array traversal, handling of relative ordering constraints, and designing time- and space-efficient approaches.
Coding & AlgorithmsTechnical Screen - GeMediumSoftware EngineerMinimize total distance to a store
This pair of problems evaluates algorithmic problem-solving skills, focusing on spatial optimization with Manhattan distances for grid-based demand aggregation and sequential penalty minimization on binary time-series data, emphasizing reasoning about aggregation and trade-offs.
Coding & AlgorithmsOnsite - GeicoHardSoftware EngineerSolve Refueling and JSON Parsing Tasks
This problem tests greedy strategies for path optimization and recursive descent parsing techniques for custom data structures.
Coding & AlgorithmsOnsiteGreedyPriority QueueRecursive Descent - GleanMediumSoftware EngineerDelete the Fewest Parentheses to Balance a String of Only Open and Close Brackets
Given a string of only open and close parentheses, delete the fewest characters so the rest is balanced and return the resulting string, using standard left-to-right matching to define a unique answer. Tests bracket matching, linear-time scanning and careful handling of leftover unmatched characters.
Coding & AlgorithmsOnsite - GleanMediumSoftware EngineerFind Which Words From a List Can Be Traced Through Adjacent Cells of a Letter Grid
Given a letter grid and a list of words, return every word that can be spelled by a path of edge-adjacent cells without reusing a cell, sorted lexicographically. Covers the single-word search and its many-words follow-up, and tests backtracking and pruning on a large word list.
Coding & AlgorithmsOnsite - GleanMediumSoftware EngineerFind the Kth Largest in Two Sorted Arrays
This question evaluates proficiency with array manipulation and selection algorithms, specifically understanding order statistics and working with two sorted sequences.
Coding & AlgorithmsTechnical Screen - GleanMediumSoftware EngineerFind the k-th Largest Value Across Two Sorted Arrays Without Fully Merging Them
Given two arrays sorted in non-decreasing order and an integer k, return the k-th largest value among all their elements, counting duplicates separately. Tests reasoning about ranks across two sorted sequences, careful handling of empty arrays and duplicates, and moving past a linear scan toward logarithmic time.
Coding & AlgorithmsOnsite - GleanMediumSoftware EngineerGroup Words into Transitive Synonym Sets by Shared Two-Words-Before-and-After Context
Given a list of sentences, treat two words as synonyms when they share the same two words before and two words after, close the relation transitively, and return every synonym group in a canonical sorted order. Tests context hashing, union-find or connected components, and exact output formatting.
Coding & AlgorithmsOnsite - GleanMediumSoftware EngineerImplement 2048 Game Logic
This question evaluates array and matrix manipulation, stateful simulation of game mechanics, and handling edge cases such as merge constraints, single-merge-per-move rules, and empty-cell management.
Coding & AlgorithmsTechnical Screen - GleanHardSoftware EngineerImplement 2048 tilt move
This question evaluates a candidate's ability to implement array and matrix manipulation, deterministic state-transition logic, and rule-based merging behavior in a grid-based simulation.
Coding & AlgorithmsTechnical Screen - GleanMediumSoftware EngineerImplement a Byte Pair Encoding (BPE) Tokenizer
Implement a Byte Pair Encoding (BPE) tokenizer with training, encoding, and decoding capabilities using frequency-based iterative merging.
Coding & AlgorithmsTechnical ScreenNLPStringsDesign - GleanMediumSoftware EngineerRank Every Cell of a Distinct-Value Matrix Consistently Within Its Row and Column
Replace every value in a matrix of distinct integers with the smallest rank such that larger values outrank smaller ones within each row and column. Tests processing values in sorted order, tracking per-row and per-column state, and the one-dimensional special case.
Coding & AlgorithmsOnsite - GleanMediumSoftware EngineerRestore an Array with One Displaced Element
Restore a nearly sorted array where at most one element has been removed and reinserted elsewhere, in linear time and without mutating the input array.
Coding & AlgorithmsTechnical Screenarraystwo-pointerssorting - GleanMediumSoftware EngineerReturn Top Department Suggestions
Design an in-memory prefix search system that returns the top-k department suggestions based on popularity scores, with deterministic tie-breaking.
Coding & AlgorithmsTechnical ScreenTrieHeapPrefix Search - GleanHardSoftware EngineerSearch Words in a Character Grid
This question evaluates algorithmic problem-solving in grid traversal and multi-word string search, targeting competencies in pathfinding, string matching, efficient use of data structures for shared prefixes, and time/space complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - GleanMediumSoftware EngineerShortest Manhattan Distance Between Any X and Any Y in a String or Grid
Find the shortest distance between any X and any Y, first in a string and then in a 2D grid using Manhattan distance, returning -1 when one letter is missing. Tests moving from a linear scan to multi-source breadth-first search and reasoning about efficiency on large grids.
Coding & AlgorithmsOnsite
Figma
Glean