Katkat

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 1441–1470 of 3640 results

  • GoogleMediumProduct Manager
    Favorite Products & Optimization

    Practice a product sense and roadmapping prompt about admired products and improvement planning. The solution compares Google Maps, Notion, and IKEA, then deep-dives on a Google Maps parking confidence roadmap with target users, pain points, MVP phases, success metrics, experiments, and guardrails.

    Behavioral & LeadershipOnsite
  • GoogleEasySoftware Engineer
    Find Common Free Time Slots Across Calendars

    Tests your ability to process and merge multiple sets of time intervals to find mutually available time windows within a given working day.

    Coding & AlgorithmsOnsiteintervalssortingsweep-line
  • GoogleMediumSoftware Engineer
    Find Earliest Fully Connected Time

    This problem tests your ability to efficiently track the connectivity of a graph as edges are added over time, requiring an understanding of Union-Find data structures and graph theory.

    Coding & AlgorithmsOnsiteGraphDSUSorting
  • GoogleMediumSoftware Engineer
    Find Paths Across a Weighted Binary Grid

    Implement algorithms to analyze top-to-bottom paths in a blocked, cell-weighted grid: reachability check, deterministic path enumeration, and minimum-cost path finding with lexicographic tie-breaking.

    Coding & AlgorithmsOnsiteGraphBFS/DFSDijkstra
  • GoogleMediumSoftware Engineer
    Find Shortest Queue with Few Calls

    This problem tests your ability to optimize search operations across multiple data sources, focusing on minimizing high-latency API calls by using heuristic strategies and efficient state management.

    Coding & AlgorithmsOnsiteAlgorithmsOptimizationHeuristics
  • GoogleHardSoftware Engineer
    Find best-matching binary pattern with wildcards

    This problem tests your ability to efficiently match a query string against a dictionary of patterns containing wildcards and determine the best match based on predefined precedence rules.

    Coding & AlgorithmsOnsiteStringsPattern MatchingGreedy
  • GoogleMediumSoftware Engineer
    Find cheapest common ancestor in a tree

    This problem tests your ability to navigate tree structures and perform post-order traversal to identify an ancestor node based on a custom aggregate criterion (the minimum value).

    Coding & AlgorithmsOnsiteTreesRecursionLCA
  • GoogleHardSoftware Engineer
    Find conflicting pair using black-box run()

    This problem tests your ability to optimize search operations within a hidden set of dependencies by minimizing calls to a costly black-box oracle.

    Coding & AlgorithmsOnsiteBinary SearchQuery ComplexityAlgorithms
  • GoogleMediumSoftware Engineer
    Find horizontal cut balancing square areas

    This question evaluates computational geometry and algorithm design skills, focusing on area computation, monotonicity reasoning, existence proofs, root-finding under floating-point constraints, and considerations of numerical stability and complexity.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Find shortest path with blocked nodes

    This question evaluates proficiency in graph traversal and shortest-path computation, including handling nodes that are blocked or that incur additional costs. It is commonly asked in the coding and algorithms domain (graph algorithms) to assess both practical implementation skills and conceptual understanding of complexity, edge cases, and trade-offs between unweighted and weighted path models.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Find the Longest Consecutive Path in a Binary Tree

    Practice a Google coding interview problem focused on find the longest consecutive path in a binary tree. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Find the Longest Continuous Increasing Subsequence

    Tests array traversal, state tracking, and boundary handling to find the maximum length of a contiguous, strictly increasing run in linear time.

    Coding & AlgorithmsOnsiteArraysTwo PointersSliding Window
  • GoogleMediumSoftware Engineer
    Find the Longest Path of Equal-Valued Tree Nodes

    This problem tests tree traversal techniques and dynamic programming on trees, specifically how to track path lengths across subtree boundaries using a recursive helper function.

    Coding & AlgorithmsOnsiteBinary TreesRecursionDFS
  • GoogleMediumSoftware Engineer
    Find the Time for Grid Signals to Reach Every Target

    Implement a multi-source breadth-first search to find the minimum time needed for signals emitted from multiple sources to reach all target cells on a grid with obstacles.

    Coding & AlgorithmsOnsiteBFSMulti-Source BFSGrid
  • GoogleMediumSoftware Engineer
    Find the nearest common manager of K employees in a reporting tree

    Given a company reporting tree in which every employee except the top one has a single direct manager, find the nearest manager shared by a list of K employees, counting each employee as part of their own chain. Tests tree reasoning, ancestor chains and very deep hierarchies.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Find top-k distinct elements

    This question tests the ability to combine frequency counting with heap-based selection to extract the k most frequent distinct elements from an input stream.

    Coding & AlgorithmsOnsiteHash TableHeapSorting
  • GoogleMediumSoftware Engineer
    Generate Every Ordered Sum Using Ones and Twos

    Tests backtracking and recursion to generate all valid ordered compositions of a target integer using only digits 1 and 2 in lexicographical order.

    Coding & AlgorithmsOnsiteRecursionBacktrackingCombinatorics
  • GoogleMediumMachine Learning Engineer
    Generate values by weighted probabilities

    This question evaluates understanding of probabilistic sampling, numerical stability, input validation, and algorithmic trade-offs for streaming weighted random draws, including generator determinism via seeding and methods such as CDF/binary-search versus alias for performance.

    Statistics & MathOnsite
  • GoogleHardProduct Manager
    Google Strategic Foresight

    Practice a Google product strategy case on five-year threats and technology trends. The solution frames Google's moats, evaluates AI-native search, regulation, distribution shifts, multimodal and privacy-preserving trends, and deep-dives on AI assistants with execution challenges, product applications, monetization, and guardrails.

    Product / Decision MakingOnsite
  • GoogleMediumProduct Manager
    Googleness & Behavioral Deep-Dive

    Practice PM onsite prompts covering product critique, going above and beyond for users, and resolving disagreement with metrics. The guide shows how to analyze a poorly designed product, define improvements and trade-offs, tell STARL stories, and use trusted metrics to align stakeholders.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    Grid Reachability From Start to Target With Impassable Water Cells

    Decide whether a start cell can reach a target cell in a square grid when some cells are water and moves are limited to up, down, left and right. It tests modeling a grid as a graph, choosing a traversal, and handling walled-off regions and grid edges correctly.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Handle overwhelmed team as senior manager

    This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Handle overwhelmed team as senior manager states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    Handling Someone Taking Credit for Your Work and Juggling Competing Priorities

    A two-part behavioral interview asking how you would handle a colleague taking credit for your work, and how you manage your time and coordinate with others when juggling several tasks with different priorities. It evaluates conflict resolution, communication and prioritization judgment.

    Behavioral & LeadershipOnsite
  • GoogleHardProduct Manager
    Historical FX-Rate Service – System Design

    Practice designing a historical FX-rate service for 10k QPS with APIs, data models, precision, versioned corrections, hot and cold storage, caching, consistency, snapshot semantics, scalability, multi-region reliability, monitoring, and operations.

    Product / Decision MakingOnsite
  • GoogleMediumSoftware Engineer
    How You Prioritize When You Have a Large Amount of Work

    A behavioral interview question asking how you prioritize when you have a large amount of work, illustrated with a real example. It tests the criteria you use to order work, how you handle dependencies and conflicting requests, what you choose to defer, and how you communicate those trade-offs.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    How do you handle conflict and ambiguity?

    This question evaluates a candidate's conflict resolution, communication, teamwork, leadership, ethical judgment, influence, and adaptability skills in a software engineering context.

    Behavioral & LeadershipOnsite
  • GoogleMediumSoftware Engineer
    How to handle huge inputs?

    Answer the coding interview follow-up "what if the input is huge?" Covers memory checks, streaming, chunking, external sort, approximate structures, distributed processing, and engineering tradeoffs.

    Software Engineering FundamentalsOnsite
  • GoogleMediumData Scientist
    How would you use propensity score matching here

    Evaluates proficiency with propensity score matching and broader causal inference concepts for observational treatment effect estimation, including identification assumptions, propensity score estimation and covariate selection, matching algorithms and common support, balance diagnostics, choice of estimand (ATE vs ATT) and uncertainty quantification, plus sensitivity checks and alternative methods. Common in Analytics & Experimentation interviews for Data Scientist roles because it probes understanding of confounding and identification in nonrandomized settings and requires intermediate-to-advanced applied statistics reasoning about methodological trade-offs.

    Analytics & ExperimentationOnsite
  • GoogleMediumSoftware Engineer
    Implement Multi-Player Tic-Tac-Toe

    This problem tests object-oriented design and grid traversal logic by requiring the implementation of a generic N-player Tic-Tac-Toe game where win conditions are evaluated based on a specific run-length.

    Coding & AlgorithmsOnsiteOOPGridGame Design
  • GoogleHardSoftware Engineer
    Implement a URL router that matches request paths against patterns with placeholders

    Implement a URL router that registers path patterns with placeholder segments such as {userId} and returns the registered pattern that matches a concrete request path. It tests choosing a segment-level data structure, defining precedence between literal and placeholder matches, and analyzing registration and lookup complexity.

    Software Engineering FundamentalsOnsite