practice a little every day, paws crossed ♡
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 3361–3390 of 9403 results
- GleanMediumSoftware EngineerImplement 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 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 2048-Style Tile Slides and Merges for All Four Board Directions
A software engineer phone-screen coding exercise: implement the slide-and-merge move of a 2048-style tile board, first to the left with working tests, then for all four directions. It tests careful array manipulation, the single-merge rule, and the trade-off between rotating the board and remapping row and column indices.
Software Engineering FundamentalsTechnical Screen - GleanMediumMachine Learning EngineerImplement Rate-Limited Wikipedia Crawler
This question evaluates a candidate's ability to implement a rate-limited web crawler, testing skills in crawl frontier management, prioritization by page-title initial, deduplication, rate limiting, and robust error handling.
Coding & AlgorithmsOnsite - GleanMediumFrontend EngineerImplement Two-Player Connect Four on a 6x7 Board with Win and Draw Detection
Implement two-player Connect Four on a 6x7 board: drop discs into columns, detect four in a row in every direction, handle full columns and draws, and render a playable interface. Tests clean separation of game logic from UI, efficient win checks from the last move and careful edge handling.
Software Engineering FundamentalsOnsite - 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 EngineerImplement 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 EngineerPrioritizing QA Work Under Deadline Pressure
This behavioral question assesses your ability to apply risk-based prioritization, manage quality trade-offs, and communicate transparently with stakeholders when engineering deadlines constrain testing capacity.
Behavioral & LeadershipTechnical ScreenBehavioralQA & TestingRisk Management - GleanMediumData ScientistProduct Case: Define Success Metrics for a Product, Using Enterprise Search as Example
A data scientist product case: define how to measure the success of a product, practiced on an enterprise search tool. Tests building a metric hierarchy with a north star, input metrics and guardrails, separating users from paying customers, defining a successful search and attributing changes causally.
Analytics & ExperimentationOnsite - 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 - GleanMediumSoftware EngineerRobust Selenium Code to Extract Text from Two Elements
This problem tests your ability to write robust browser automation code using Selenium, focusing on handling dynamic content, timing issues, and basic error handling.
Software Engineering FundamentalsTechnical ScreenSeleniumTest AutomationPython - GleanMediumData ScientistSQL: Zero-Filled DAU, Rolling 30-Day MAU, and the MAU Impact of a User-ID Rehash
Three SQL questions on a login table: daily active users with zero-filled days, rolling 30-day MAU per date with a weekday-usage follow-up, and how a user-ID rehash inflates MAU. Tests distinct counting, calendar generation, window boundaries, query cost and reasoning about metric artifacts.
Data Manipulation (SQL/Python)Onsite - 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 EngineerServe 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 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 - 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 - GleanEasyData ScientistWhat are sum expectation and variance?
This question evaluates understanding of expectation, variance and covariance and the ability to reason about how sums of random variables affect their moments, including the role of covariance and the special case of independence in the Statistics & Math domain.
Statistics & MathOnsite - GlovoMediumSoftware EngineerWhy 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 - GofundmeEasySoftware EngineerExplain React and Firebase data interaction
This question tests your understanding of data synchronization patterns between a React frontend and Firebase, specifically focusing on the trade-offs between real-time listeners and manual data fetching.
Software Engineering FundamentalsTechnical ScreenReactFirebaseFrontend - GofundmeMediumData ScientistExplain an AI Agent You Built: Design, Evaluation, and Governance
Practice explaining an AI-agent project through design ownership, task evaluation, hallucination controls and data governance.
ML System DesignOnsite - Goldman SachsMediumProduct ManagerBehavioral Decision-Making & Growth
Practice behavioral PM answers for decision-making and growth in regulated, data-heavy domains. The guide covers upskilling plans, learning backlogs, build-versus-buy trade-offs, projects derailed by external events, risk and compliance handling, customer discovery, metrics, and cross-functional leadership.
Behavioral & LeadershipOnsite - Goldman SachsEasyData ScientistBound the Rank of BA Given Rank of AB
Determine the set of possible values for the rank of the matrix product BA given that A and B are 4x4 real matrices and rank(AB) = 2. This question tests fundamental linear algebra inequalities involving matrix ranks and nullities.
Statistics & MathOnline AssessmentLinear AlgebraMatrix TheoryRank Inequalities - Goldman SachsEasySoftware EngineerCache 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 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 SachsHardMachine Learning EngineerComplete decision tree and gradient descent functions
This question evaluates implementation skills in supervised machine learning and numerical optimization, specifically computing Gini impurity and selecting optimal binary splits for a decision tree alongside deriving and applying a single-step gradient descent update for linear regression.
Coding & AlgorithmsOnline Assessment
Glean
Goldman Sachs