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 3871–3900 of 9403 results
- GoogleMediumSoftware EngineerSolve Grid and Counting Problems
This question evaluates skills in grid-based graph traversal and connected-component detection for the island counting task, and combinatorial counting with multiset considerations for the target-word formation task.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerSolve Quickselect, Tree Distance, and Prefix Substrings
This multi-part question evaluates algorithmic problem-solving across selection algorithms, graph/tree traversal, and string processing, testing competencies such as Quickselect behavior and pivot reasoning, computation of node distances in a tree, and prefix-based substring counting.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerSolve Rooms and Top-K Streams
Design an online resource scheduler that dynamically allocates compute rooms to incoming streaming sessions and tracks the top-k most active streams by cumulative duration.
Coding & AlgorithmsTechnical Screenheapinterval-schedulingdesign - GoogleMediumSoftware EngineerSolve Shortest Paths and Rental Allocation
This problem tests your ability to combine graph traversal (Dijkstra's) with greedy interval scheduling to optimize fleet distribution across multiple locations.
Coding & AlgorithmsOnsiteGraphsDijkstraGreedy - GoogleMediumSoftware EngineerSolve Three Array and Matrix Path Problems
Tests multi-paradigm algorithmic fluency across dynamic programming with auxiliary states, greedy interval coverage, and monotonic deque optimization for bounded subarrays.
Coding & AlgorithmsOnsiteDynamic ProgrammingGreedyMonotonic Deque - GoogleMediumSoftware EngineerSolve Two Coding Interview Problems
This question evaluates proficiency in parsing and expression evaluation, recursion/stack management, and string-processing for nested function-style arithmetic, alongside graph modeling, geometric distance reasoning, and traversal algorithms for the bomb chain-reaction scenario; the category is Coding & Algorithms.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerSolve array-sum and city-community problems
This question tests the ability to solve two distinct algorithmic patterns: using a prefix sum hash map to count subarrays with a target sum, and using flood fill to determine the size of connected components in a grid.
Coding & AlgorithmsTechnical ScreenHash MapPrefix SumDFS - GoogleHardSoftware EngineerSolve checksum and dependency debugging tasks
Validate feature configuration strings using modular polynomial checksums and resolve valid deployment sequences using dependency graph analysis and cycle detection.
Coding & AlgorithmsOnline Assessmentgraphtopological-sortstring-parsing - GoogleMediumSoftware EngineerSolve graph and linked list tasks
This problem tests your ability to model complex system dependencies as a directed graph and determine the minimum time to complete a set of tasks given sequential constraints.
Coding & AlgorithmsOnsiteGraphTopological SortDynamic Programming - GoogleMediumSoftware EngineerSolve matrix groups and recipe inventory
This problem tests your ability to manage hierarchical dependencies using topological sorting and perform block-wise aggregate computations on grid-based data structures.
Coding & AlgorithmsTechnical ScreenSliding WindowTopological SortGraphs - GoogleMediumSoftware EngineerSolve meeting-room scheduling and shortest paths
This problem tests your ability to manage overlapping intervals using a priority queue and calculate the shortest path in a DAG representing dependencies.
Coding & AlgorithmsOnsiteSortingPriority QueueGraph - GoogleHardSoftware EngineerSolve order-statistics and XOR-triplet problems
This problem tests your ability to use Fenwick trees for order statistics and the properties of prefix XORs to solve counting problems efficiently.
Coding & AlgorithmsOnsiteFenwick TreeBit ManipulationPrefix Sum - GoogleMediumSoftware EngineerSolve several coding interview problems
This problem tests your ability to perform string-based arithmetic and handle edge cases in digit-by-digit computation.
Coding & AlgorithmsTechnical ScreenStringsMathSimulation - GoogleHardMachine Learning EngineerSolve several streaming, DAG, and DP tasks
Implement an ML pipeline optimization engine that calculates critical path latency and peak parallelism for a task DAG, and optimizes streaming checkpoint placement under sliding-window constraints using dynamic programming.
Coding & AlgorithmsOnsiteDAGDynamic ProgrammingSliding Window - GoogleMediumSoftware EngineerSolve three coding interview problems
This set tests proficiency in recursive string decoding, dynamic programming for sequential decision-making, and graph-based traversal algorithms for grid analysis.
Coding & AlgorithmsOnsiteRecursionDynamic ProgrammingGraph Traversal - GoogleEasySoftware EngineerSolve three coding problems
This set of problems evaluates algorithmic problem-solving across combinatorics and enumeration (finding the N-th lexicographic license plate), constrained geometric and graph traversal reasoning (counting Android-style 3x3 unlock patterns), and interval-processing algorithms (computing intersections of sorted, non-overlapping intervals) within the domain of algorithms and data structures. These questions are commonly asked because they reveal ability to reason about discrete enumeration, constraint handling, and efficient time/space implementations for edge-case-heavy inputs, and the level of abstraction spans both conceptual understanding (combinatorial and geometric constraints) and practical application (efficient algorithm and data-structure implementation).
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerStreaming Points: Remove Any Pair Within a Distance
This problem tests the ability to maintain and query a dynamic sorted collection of points to perform efficient proximity-based removals.
Coding & AlgorithmsOnsiteSorted StructuresGreedyBST - GoogleMediumSoftware EngineerSuccessful Project, Teammate Conflict, a Changed View of a Teammate, and Values You Seek
A behavioral round for a senior software engineer covering a successful project, a conflict with teammates, a time your negative view of a teammate turned positive, and the organizational values you want next. It tests ownership, conflict handling, self-awareness and genuine motivation.
Behavioral & LeadershipTechnical Screen - GoogleMediumSoftware EngineerTechnical Deep Dive: Present and Defend the Design of a Service You Own
Technical deep-dive question from a senior software engineer loop at Google: explain the architecture of a service you own and walk through its technical details. It tests whether a candidate can present purpose, scale and data flow clearly, then defend design choices, failure handling and trade-offs under probing.
System DesignOther - GoogleMediumSoftware EngineerTell Me About a Compromise: Outcome, Follow-Through and What You Would Change
A behavioral conflict question asking for a time you had to compromise, followed by probes on whether you were satisfied with the result, what you did afterwards to achieve what you gave up, and how you will act differently. It tests conflict handling, judgment, follow-through and honest self-reflection.
Behavioral & LeadershipTechnical Screen - GoogleMediumData ScientistTest a coefficient and explain t-distribution
This question evaluates a candidate's competence in statistical inference for linear regression—specifically hypothesis testing for OLS coefficients, construction of t-statistics, estimation of standard errors, and the role of estimated error variance—within the Statistics & Math domain for Data Scientist roles.
Statistics & MathTechnical Screen - GoogleMediumData ScientistTest if one value comes from N(μ,σ²)
This question tests the ability to perform statistical hypothesis testing on a single observation, evaluate the limitations of small sample sizes, and explain the trade-offs between Type I and Type II errors.
Statistics & MathTechnical ScreenStatisticsHypothesis TestingNormal Distribution - GoogleHardSoftware EngineerToughest Project, Cross-Team Work, Mentoring, Criticism, Ambiguity and Conflict Stories
Six behavioral questions for a software engineer covering the most challenging project, collaboration with another team, mentoring, receiving criticism, handling ambiguity, and responding when someone disagrees with you. It tests story selection, a clearly personal role, honest reflection, and concise STAR-style delivery without a warm-up introduction.
Behavioral & LeadershipTechnical Screen - GoogleMediumSoftware EngineerTrack Island Counts as Land Is Added
Report the initial number of grid islands and update that count after each requested water-to-land addition. The problem probes incremental connectivity, duplicate additions, local merge effects, scalability to large grids, and alternatives to recomputing the entire map.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerTrack the User with the Most Distinct Contacts: O(1) Query and Top-K for Changing k
Design a class that records undirected messages between users and returns the user who has talked with the most distinct people, then make that query constant time and add a top-K query whose k changes on every call. It tests deduplication with hash sets, space analysis of per-user sets, and incremental ranking structures.
Software Engineering FundamentalsTechnical Screen - GoogleMediumSoftware EngineerTrie-Based URL Router with Path Variables and Catch-All Tails
Implement a request router that registers path templates with {variable} and {*catch-all} segments and resolves a concrete path to its handler and captured values. Tests trie design, literal-over-variable precedence with backtracking, conflict detection, and lookup complexity.
Software Engineering FundamentalsTechnical Screentriebacktrackingdesign - GoogleMediumSoftware EngineerTroubleshoot CPU, latency, and DNS issues
This question evaluates system troubleshooting and diagnostic competencies, including Linux CPU and IO performance analysis, network latency and packet-level investigation, and DNS resolution and query tooling knowledge.
Coding & AlgorithmsOnsite - GoogleMediumProduct ManagerTurning a Newly Built Text-to-Video Model into a Launched Product
A product strategy prompt asking how a product manager would take a newly developed text-to-video generation model to market. It tests choosing a first segment, product form and distribution, safety and likeness safeguards, pricing under high compute costs, and a staged launch with clear success metrics.
Product Design & StrategyOther - GoogleMediumData ScientistUnderstand Simpson's Paradox with Simple Examples
This interview question evaluates statistical assumptions, formulas, estimation strategy, uncertainty, edge cases, and interpretation in a realistic interview setting. A strong answer for Understand Simpson's Paradox with Simple Examples states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Statistics & MathOnsite - GoogleMediumData EngineerUser Activity Analytics: Unique Users per Activity and Average Time on Site
This question evaluates a candidate's ability to process semi-structured event data using grouping, deduplication, and timestamp arithmetic in Python. It falls under coding and algorithms, commonly asked to assess practical data-wrangling skills such as aggregating per-key counts and computing time-based metrics while handling edge cases like unordered records and single-event users.
Coding & AlgorithmsTechnical Screen
Google