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 871–900 of 2336 results

  • GeicoHardSoftware Engineer
    Solve 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
  • GeneralmotorsMediumSoftware Engineer
    Meet a 10-second latency and 99% availability target across 3-5 dependent services

    An open-ended design discussion about an application that calls three to five dependent services and must keep latency under 10 seconds and availability at 99% or better. It tests objective definitions, availability and tail-latency math, timeouts, retries, fallbacks, and adapting as requirements change.

    System DesignOnsite
  • GigaMediumSoftware Engineer
    Design an Agentic Ticket Support System

    This question evaluates a candidate's ability to design ML-driven production systems that combine agentic AI, browser-based automation for services without an API, and external user-data APIs to produce personalized support responses.

    ML System DesignOnsite
  • GleanMediumSoftware Engineer
    Delete 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 Engineer
    Design a Test Strategy for a System That Counts the Leaves on a Large Tree

    An open-ended testing scenario: design a test strategy for a system that counts the leaves on a large tree. Tests clarifying an ambiguous system, finding a test oracle, functional and boundary cases, scale and robustness testing, and setting release criteria for counts that may be estimates.

    Software Engineering FundamentalsOnsite
  • GleanMediumSoftware Engineer
    Find 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 Engineer
    Find 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 Engineer
    Group 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 Engineer
    How a Tester Prioritizes and Organizes Work Under Project Deadline Pressure

    A behavioral question for a QA engineer: how you handle and organize testing work when a project deadline creates pressure. Tests risk-based prioritization, use of automation and collaboration, transparent communication of remaining risk, and a structured STAR answer with measurable results.

    Behavioral & LeadershipOnsite
  • GleanMediumSoftware Engineer
    Implement 2048 Board Tilts in Four Directions with Merging and Game-Over Detection

    Implement the move logic of the 2048 sliding-tile game on a 4x4 board: slide and merge tiles for left, right, up and down swipes so each tile merges at most once, then decide when no swipe can change the board. Tests edge-case precision, code reuse across directions and a correct game-over rule.

    Software Engineering FundamentalsOnsite
  • GleanMediumSoftware Engineer
    Implement a Byte-Pair Encoding Tokenizer: Threshold Training, Encode and Decode

    Implement a byte-pair encoding tokenizer with train, encode and decode, where training repeatedly merges the most frequent adjacent token pair whose count reaches a threshold, breaking ties lexicographically. Tests precise reading of the merge rules, round-trip correctness and the complexity of training on long text.

    Software Engineering FundamentalsOnsite
  • GleanMediumSoftware Engineer
    Rank 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 Engineer
    Serve Top-k Prefix Suggestions Filtered by Department Within a Tight Memory Budget

    Return the top k suggestions whose ngram starts with a query and whose department matches the user, from a static list that already fills half of the server's memory. Tests prefix indexing, top-k extraction without scanning all matches, and explicit memory accounting against latency.

    Software Engineering FundamentalsOnsite
  • GleanMediumSoftware Engineer
    Shortest 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
  • GleanMediumSoftware Engineer
    Simulate 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
  • GleanMediumSoftware Engineer
    Sort 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
  • GlovoMediumSoftware Engineer
    Why Glovo, Strengths and Weaknesses, People Management and Disagreeing with a Manager

    A behavioral question set from a mid-level software engineer loop at Glovo: introduce yourself and your recent work, explain why you want to join, describe your strengths and weaknesses, discuss any experience managing people, and recount a disagreement with your manager. It tests self-awareness, motivation and professional judgment.

    Behavioral & LeadershipOnsite
  • Goldman SachsEasySoftware Engineer
    Cache Trade-offs and a Constant-Time Least-Recently-Used Cache

    Tests understanding of caching trade-offs (latency, freshness, memory overhead) and the implementation of a fixed-capacity Least Recently Used (LRU) cache supporting constant-time operations.

    Software Engineering FundamentalsOnsitelru-cachehash-tabledoubly-linked-list
  • Goldman SachsMediumSoftware Engineer
    Collect 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 SachsEasySoftware Engineer
    Design a Pastebin Service: Requirements, Entities, APIs and End-to-End Architecture

    Design a scalable text sharing (Pastebin) service that generates unique short URLs for submitted text snippets. This question assesses API design, data modeling, storage decoupling, key generation strategies, and caching mechanisms under high read concurrency.

    System DesignOnsiteObject StorageCachingKey Generation
  • Goldman SachsMediumSoftware Engineer
    Design a Streaming Metrics Dashboard: Time-Range Queries and Event-Time Watermarks

    Design the backend of a dashboard that shows metrics computed from a continuous event stream and lets users query any time range. The discussion focuses on answering range queries from pre-aggregated data and on how watermarks decide when event-time windows are complete despite late or out-of-order events.

    System DesignOnsite
  • Goldman SachsMediumSoftware Engineer
    Design a Ten-Minute In-Memory Notification Deduplication Engine

    Design a high-throughput, low-latency in-memory deduplication service that identifies and suppresses duplicate notifications within a 10-minute sliding window.

    System DesignOnsiteIn-Memory CachingConcurrencyHigh Throughput
  • Goldman SachsMediumSoftware Engineer
    Highest Average Student Score: Out-of-Memory Input, Overflow and Thread Safety in Java

    Compute the highest average score among students from name and score records, then extend the code for data larger than memory, negative scores, integer overflow and multithreaded processing. The question also covers what atomic operations are in Java and how synchronized differs from ReentrantLock.

    Software Engineering FundamentalsOnsite
  • Goldman SachsMediumSoftware Engineer
    Maximize 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 Engineer
    Overlapping Meetings and Minimum Rooms: No Sweep Line, No Library Sort, Streams, Logs

    Starting from a list of meeting time intervals, decide whether one person can attend them all, then find the minimum number of rooms without a sweep line, order the meetings without a library sort, handle a stream of meetings, and explain how a Kafka-style append-only log broker works. It tests heaps, sorting, streaming and log storage.

    Software Engineering FundamentalsOnsite
  • Goldman SachsMediumSoftware Engineer
    Rolling 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 Engineer
    Search 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 Engineer
    Skip-Level Behavioral: Commitment, Working With PMs and EMs, and Following Up on SLAs

    A skip-level manager behavioral round that probes a commitment-to-delivery mindset, asks for a walkthrough of a significant past project, and focuses on how the candidate works with product and engineering managers and tracks and follows through on SLAs. It tests ownership, stakeholder management and reliability.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    A Leader or Manager Who Shaped You and How You Applied the Lesson Later

    A behavioral interview question asking you to describe a past leader or manager who had a strong positive influence on you and how you later applied what you learned. It tests reflection, the ability to turn an observed behavior into a reusable lesson, and evidence that the lesson changed your own work.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    Answer Staff-level leadership scenarios using STAR

    This question evaluates staff-level leadership competencies including technical decision-making, stakeholder alignment, conflict resolution, incident management, ownership, risk mitigation, and cross-team influence within the behavioral and leadership domain.

    Behavioral & LeadershipOnsite