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 901–930 of 2629 results
- GleanMediumSoftware EngineerSimulate Modulo-Assigned Document Indexers with Wrap-Around and Rank the Busiest
Simulate documents assigned to indexers by index modulo m, falling through to the next free indexer with wrap-around and dropping documents when all are busy, then report processed totals, the busiest indexer and the top-k share. Tests event simulation, finding the next free slot efficiently and precise tie rules.
Coding & AlgorithmsOnsite - GleanHardSoftware EngineerSimulate document assignment to indexers
This question evaluates simulation of parallel worker scheduling, time-based queue processing, modular assignment logic, and aggregation/ranking (top-k and percentage) competencies for tracking per-worker workloads.
Coding & AlgorithmsTechnical Screen - GleanMediumSoftware EngineerSort in Linear Time an Array Where At Most One Element Was Moved Out of Place
Given an array that was sorted until one element was moved to another position, return it sorted again in linear time without a full sort. Tests locating the displaced element in either direction, handling duplicates and already-sorted input, and reasoning about O(n) time with constant extra space.
Coding & AlgorithmsOnsite - Goldman SachsMediumSoftware EngineerCollect the Most Rocks with Upward and Rightward Moves
Tests dynamic programming on a grid to find an optimal path from the bottom-left to top-right corner using constrained directional moves.
Coding & AlgorithmsOnsitedynamic-programminggridmatrix - Goldman SachsMediumSoftware EngineerCount segments and optimize 3-server assignment
This two-part problem evaluates array-processing and counting competency for identifying fixed-length strictly increasing subarrays and combinatorial partitioning and optimization competency for assigning elements to three groups to maximize a minimal pairwise-difference metric, and is commonly asked to assess efficient algorithm design, correctness under constraints, and the ability to handle large inputs. Belonging to the Coding & Algorithms domain, it tests practical algorithmic application, data-structure-aware implementation and complexity analysis rather than purely theoretical understanding.
Coding & AlgorithmsOnline Assessment - Goldman SachsMediumSoftware EngineerDesign a Workspace Resource Manager
This problem tests your ability to design a tree-based hierarchical resource management system and implement efficient operations for path-based access, relocation, and cycle detection.
Coding & AlgorithmsTechnical ScreenTreesGraphsData Structures - Goldman SachsMediumSoftware EngineerFind the Root of the Largest Tree in a Child-to-Parent Forest
Given a list of child-to-parent pairs that form a forest of rooted trees, return the root ID of the tree with the most nodes, breaking size ties by the smallest root ID. Tests building a forest from an edge list, identifying roots, counting tree sizes, and applying a precise tie-break rule.
Coding & AlgorithmsTechnical Screen - Goldman SachsEasySoftware EngineerImplement a String Deque
This question evaluates competence with fundamental data structures and algorithms by requiring an implementation of a string double-ended queue (deque), checking understanding of constant-time (O(1)) operations, manipulation of node links or references, and correct handling of edge cases; category: Coding & Algorithms; level: practical implementation rather than purely conceptual. It is commonly asked to assess the ability to implement low-level data structure mechanics, guarantee performance bounds, and expose attention to correctness and boundary conditions in algorithmic coding tasks.
Coding & AlgorithmsTechnical Screen - Goldman SachsMediumSoftware EngineerMaximize Element Frequency with Limited Increments
Tests sorting and sliding window techniques to maximize an element's frequency within an increment budget.
Coding & AlgorithmsOnsitearraysliding-windowsorting - Goldman SachsMediumSoftware EngineerRolling Ball Maze Reachability
This problem tests your ability to model a grid-based movement simulation as a graph reachability problem, requiring efficient state traversal.
Coding & AlgorithmsOnsiteBFSGraphsSimulation - Goldman SachsEasySoftware EngineerSearch for a Target in a Matrix Sorted by Rows and Columns
Tests the ability to search efficiently in a 2D grid sorted along both dimensions by exploiting boundary invariants to achieve an O(m + n) time complexity.
Coding & AlgorithmsOnsitearraysmatrixbinary-search - Goldman SachsMediumSoftware EngineerSolve string and hashmap coding tasks
This problem tests your ability to manipulate strings, utilize hash maps for grouping data, and perform iterative simulations based on sequential command logs.
Coding & AlgorithmsTechnical ScreenStringsHashMapsData-Processing - Goldman SachsMediumSoftware EngineerSolve string and hashmap interview tasks
This question evaluates proficiency in string manipulation and hash-based aggregation, specifically skills such as frequency counting, map/dictionary usage, and numeric aggregation for averages.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerAdd two big integers from digit lists
This question evaluates algorithmic skills in manipulating linked lists or arrays to perform addition of large integers, focusing on carry propagation, handling differing lengths, and analysis of time and space complexity.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerAnswer parity-alternation range queries
This problem tests your ability to use prefix sums or dynamic tracking to determine if a range [L, R] consists of elements that alternate between odd and even parity in O(1) time after O(N) preprocessing.
Coding & AlgorithmsTechnical ScreenArraysPrefix SumAlgorithms - GoogleMediumSoftware EngineerArrange Crops into Connected Regions in Rectangular and Two-Square Gardens
Arrange exact crop counts into connected grid regions, prove a rectangular construction, and analyze the geometry needed for a two-square garden follow-up.
Coding & AlgorithmsOnsite - GoogleEasySoftware EngineerAssign the Minimum Fleet to Rental Reservations
Determine the minimum fleet size and a deterministic vehicle assignment for a list of rental reservations using interval scheduling and priority queues.
Coding & AlgorithmsOnsiteGreedyHeapIntervals - GoogleMediumSoftware EngineerBoolean Expression Tree with Leaf Flips
This problem tests recursive tree evaluation logic and the ability to optimize updates by propagating changes only to necessary ancestors.
Coding & AlgorithmsOnsiteTreesRecursionBoolean Logic - GoogleMediumSoftware EngineerBuild Prefix Lookup with a Trie
Tests implementation of a Trie (prefix tree) data structure to support word insertion, exact word search, prefix existence checks, and lexicographical autocomplete suggestions with a capacity limit.
Coding & AlgorithmsTechnical Screentriestringsdfs - GoogleEasySoftware EngineerBuild a next-word frequency predictor
This problem tests your ability to process sequential text data, efficiently store word adjacency frequencies, and retrieve the most likely successor.
Coding & AlgorithmsOnsiteHash MapData StructuresString Processing - GoogleEasySoftware EngineerBusiest Rental Car
This problem tests your ability to manage state and apply custom sorting logic to simulate resource allocation across time intervals.
Coding & AlgorithmsOnsiteHash MapSimulationGreedy - GoogleMediumSoftware EngineerCalculate Highway Tolls from Ordered Checkpoint Logs
Tests tracking vehicle state across interleaved chronological event streams and computing distance-based segment tolls regardless of travel direction or checkpoint repetition.
Coding & AlgorithmsOnsitehash-tablearrayssimulation - GoogleMediumSoftware EngineerCan board states be transformed?
This problem tests your ability to determine if one board state can be transformed into another using reversible movement rules, requiring the identification of invariants to avoid exhaustive searching.
Coding & AlgorithmsTechnical ScreenStringsInvariantsTwo Pointers - GoogleMediumSoftware EngineerCheck Whether Digits Are Monotone Increasing
Determine if a non-negative integer has digits that are monotonically non-decreasing from left to right, handling edge cases without unnecessary memory allocation.
Coding & AlgorithmsTechnical Screenmathstringsfundamentals - GoogleEasySoftware EngineerCheck an Interval Against Existing Intervals for Conflicts
Determine whether a proposed half-open interval overlaps with any interval in an unsorted list. This tests basic interval overlap logic and boundary condition handling.
Coding & AlgorithmsTechnical ScreenIntervalsArraysGeometry - GoogleMediumSoftware EngineerCheck if all substrings are anagrams of words
This question evaluates string-processing skills and combinatorial reasoning about character multisets, specifically anagram recognition, substring enumeration, and the use of efficient representations for repeated checks.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerCheck if all substrings are dictionary words
This question evaluates string-processing skills such as substring enumeration and membership testing against a dictionary, along with algorithmic reasoning about correctness and complexity.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerChoose Non-Overlapping Weighted Jobs to Maximize Total Profit
Choose a set of jobs, each with a start time, end time and profit, so that no two chosen jobs overlap and the total profit is as large as possible. It tests sorting intervals, defining an optimal-substructure recurrence, and finding the latest compatible earlier job efficiently for large inputs.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerChoose One Blocker Removal for the Fastest Grid Signals
Determine at most one obstacle to remove in a grid to minimize the maximum time for signals to reach all target cells from multiple sources.
Coding & AlgorithmsOnsiteBFSGraphMatrix - GoogleMediumSoftware EngineerChoose optimal guesses for green-only Wordle
This problem tests your ability to model uncertainty and implement a greedy strategy to minimize the expected search space size when provided with restricted (green-only) feedback.
Coding & AlgorithmsTechnical ScreenProbabilityGreedyOptimization
Glean
Goldman Sachs
Google