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 3481–3510 of 9403 results
- GoogleMediumSoftware EngineerChoose best/worst actions in workplace ethics scenarios
This question evaluates workplace ethics, confidentiality handling, conflict-of-interest recognition, anti-harassment awareness, integrity, and escalation judgment for software engineers.
Behavioral & LeadershipOnline Assessment - 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 - GoogleMediumData ScientistClarify ambiguous requirements under pressure
This question evaluates a data scientist's competency in problem understanding and stakeholder clarification, covering active listening, assumption management, requirement elicitation, and cross-functional communication within the Behavioral & Leadership category.
Behavioral & LeadershipTechnical Screen - GoogleMediumSoftware EngineerCode Review of a Go Token Bucket Rate Limiter Used as HTTP Middleware
A code review exercise built around a token bucket rate limiter written in Go and used as HTTP middleware. It tests finding the defects that matter in a production web service, deciding what blocks a merge, writing actionable review comments, and proposing a corrected limiter with tests that control time instead of sleeping.
Software Engineering FundamentalsOnsite - GoogleHardMachine Learning EngineerCompare Language-Model Post-Training Methods
This question tests your conceptual depth in LLM alignment by asking you to differentiate between supervised fine-tuning (SFT), reinforcement learning from human feedback (RLHF), direct preference optimization (DPO), and group-relative optimization (e.g., GRPO) based on their mathematical objectives and operational characteristics.
Machine LearningTechnical ScreenLLMAlignmentRLHF - GoogleMediumData ScientistCompare Logistic Regression and Random Forest in Limited Data Scenarios
Evaluates binary classification model selection with limited labeled data. Strong answers explain logistic regression and cross-entropy loss, compare it with Random Forests, cover L1 and L2 regularization, diagnose overfitting, and contrast Random Forests with boosting.
Machine LearningOnsite - GoogleMediumMachine Learning EngineerCompare NLP tokenization and LLM recommendations
This question tests the conceptual understanding of tokenization strategies in NLP and the architectural trade-offs when integrating LLMs into recommendation systems.
Machine LearningOnsiteNLPLLMRecommendation-Systems - GoogleHardData ScientistCompare two stores’ profits rigorously
This question evaluates a data scientist's skills in experimental design, causal inference (including difference-in-differences), measurement and metric construction for profitability, uncertainty quantification (confidence intervals and power checks), and operational guardrails for real-world data collection.
Analytics & ExperimentationTechnical Screen - GoogleHardProduct ManagerComprehensive Product Improvement Drill
Practice a comprehensive Spotify product improvement case covering product taste, target users, North Star metrics, Smart Offline Mode, roadmap prioritization, experiments, guardrails, and stakeholder alignment. The solution emphasizes quality-adjusted listening, offline pain points, MVP scope, and cross-functional execution.
Product / Decision MakingOnsite - GoogleMediumSoftware EngineerCompute Entity Size and Validate a Hierarchical File System
Implement methods to compute the recursive byte size of an entity in a hierarchical file system and validate the structural integrity of the file system graph.
Software Engineering FundamentalsOnsiteGraphTreeDFS/BFS - GoogleHardSoftware EngineerCompute Turnstile Crossing Times
This problem tests your ability to manage state in a queue-based simulation and implement complex tie-breaking logic using data structures like heaps or prioritized queues.
Coding & AlgorithmsTechnical ScreenSimulationQueueHeap - GoogleMediumSoftware EngineerCompute a Depth-Weighted Sum of a Nested List
Implement and compare recursive and iterative traversals to compute the depth-weighted sum of an arbitrarily nested list of integers, handling deep nesting and edge cases.
Coding & AlgorithmsOnsitedfsbfsstack - GoogleMediumSoftware EngineerCompute distance to nearest taxi in grid
This problem tests your ability to efficiently compute shortest path distances from multiple sources to all reachable grid cells using multi-source Breadth-First Search (BFS).
Coding & AlgorithmsTechnical ScreenBFSGraphGrid - GoogleEasySoftware EngineerCompute max coins with 3-step token moves
This question evaluates combinatorial optimization, state-space reasoning, and algorithmic design for constrained token movements on a linear board, and falls under the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - GoogleHardSoftware EngineerCompute minimax grid path and network delay
This question tests the ability to solve pathfinding problems using non-standard cost metrics: first, finding a minimax path in a grid, and second, calculating the earliest arrival time in a network with weighted edges.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingDijkstraBinary Search - GoogleMediumSoftware EngineerCompute minimum servers for cyclic tasks
This problem tests your ability to manage overlapping intervals in a circular domain by converting cyclic tasks into linear sub-intervals and applying a sweep-line or greedy approach to determine resource requirements.
Coding & AlgorithmsTechnical ScreenIntervalsGreedySweep-line - GoogleMediumData ScientistCompute precision–recall curve on imbalanced data
This question evaluates a data scientist's competency in model evaluation for imbalanced binary classification, covering understanding of precision–recall dynamics, calibration, AUPRC, cost‑sensitive metrics, and practical implementation concerns like computing thresholds and handling ties and numerical edge cases; domain: Coding & Algorithms and machine learning model evaluation. It is commonly asked in technical interviews because it assesses both conceptual understanding of evaluation trade‑offs and the practical application of efficient, robust metric computation and threshold selection under asymmetric costs and operational constraints.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerCompute servers needed for daily recurring jobs
This question evaluates understanding of interval-based resource allocation and job grouping by identifier, testing competency in managing overlapping time intervals, capacity planning, and handling day-boundary truncation.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerCompute shortest delivery route with dangerous stops
This question evaluates understanding of graph traversal and shortest-path techniques under constraints, including avoidance of forbidden nodes, multi-criteria optimization (minimizing dangerous-node visits then steps), and reasoning about augmented state and visited-structure design.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerCompute shortest paths with blocked nodes
This question evaluates proficiency with graph algorithms, shortest-path and reachability concepts when nodes are removed or blocked, and the ability to analyze time and space complexity across directed and undirected graphs.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerCompute sliding-window average excluding top k
This problem tests your ability to maintain order statistics in a sliding window using balanced data structures or heaps to perform efficient removals and updates while excluding the top k elements.
Coding & AlgorithmsTechnical ScreenSliding WindowOrder StatisticsData Structures - GoogleMediumMachine Learning EngineerCompute sum over consecutive-step subarrays
This problem tests your ability to identify contiguous subarrays that follow an arithmetic progression with a common difference of 1 (consecutive steps) and calculate the sum of elements within these subarrays efficiently.
Coding & AlgorithmsOnsiteArraysMathSliding Window - GoogleMediumSoftware EngineerCompute the Union of Two Sorted Interval Lists
Merge two sorted lists of disjoint closed intervals into a single sorted list of disjoint intervals in linear time.
Coding & AlgorithmsOnsiteIntervalsTwo PointersMerge Sort - GoogleMediumResearch ScientistConnect Your Research Experience to a Team's Work and Goals
This question assesses the candidate's ability to bridge their past academic or research expertise with the practical, scaled objectives of a commercial product team while demonstrating technical humility and goal alignment.
Behavioral & LeadershipOnsiteBehavioralResearch StrategyTechnical Alignment - GoogleMediumSoftware EngineerConsolidate On-Call Rotation Segments
Consolidate overlapping on-call shift intervals into non-overlapping segments, each annotated with the sorted list of active engineers.
Coding & AlgorithmsOnline Assessmentintervalsweep-linesorting - GoogleHardMachine Learning EngineerConstruct connected crop layout and safe paths
This problem tests your ability to design a constructive grid layout that satisfies connectivity and size constraints, followed by pathfinding through dynamic or constrained environments.
Coding & AlgorithmsTechnical ScreenBacktrackingGraph TheoryBFS - GoogleMediumSoftware EngineerCount Clusters of 2D Points Within a Radius
This problem tests your ability to model geometric data as a graph and identify connected components using traversal algorithms or Disjoint Set Union (DSU).
Coding & AlgorithmsTechnical ScreenGraphsGeometryDFS/BFS - GoogleMediumSoftware EngineerCount Connected Clusters of Two-Dimensional Points
Tests modeling geometric proximity as a graph problem, using Disjoint Set Union or graph traversal to identify connected components while ensuring exact integer arithmetic and handling duplicate coordinates.
Coding & AlgorithmsTechnical Screengraphsunion-findgeometry - GoogleHardFrontend EngineerCount Islands with Diagonal Connectivity
Practice counting binary-grid components when diagonal neighbors connect, changing the usual four-direction island definition.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerCount Prefix-Matching Simple Paths in a Labeled Graph
Tests graph traversal, bitmask dynamic programming or backtracking with pruning, and prefix counting on small labeled graphs.
Coding & AlgorithmsTechnical Screengraphbitmask-dpbacktracking
Google