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 961–990 of 2336 results
- GoogleMediumSoftware EngineerExplain Your Most Meaningful Project Contribution
Prepare a project story that makes your most meaningful contribution and personal ownership clear. Explain one consequential decision, its tradeoffs and obstacles, how you evaluated the outcome, and why the work still matters.
Behavioral & LeadershipOnsite - GoogleMediumSoftware EngineerExplain Your Most Technically Complex Project
This question assesses the candidate's ability to articulate complex technical challenges, justify architectural design decisions, and communicate the impact of their personal contributions in a collaborative environment.
Behavioral & LeadershipOnsiteBehavioralSystem DesignLeadership - GoogleMediumSoftware EngineerExplain handling a tight project deadline
This question evaluates time management, prioritization, communication, teamwork, and leadership competencies in delivering technical work under pressure.
Behavioral & LeadershipOnsite - GoogleEasySoftware EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerGenerate 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 - GoogleMediumSoftware EngineerGrid 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 EngineerHandle 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 EngineerHandling 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 - GoogleMediumSoftware EngineerHow 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 EngineerHow 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 EngineerHow 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 - GoogleMediumSoftware EngineerImplement 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 EngineerImplement 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 - GoogleMediumSoftware EngineerImplement an LRU cache
This question evaluates competency in data structure design and algorithmic complexity by requiring a bounded key-value cache with O(1) average-time get and put operations.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerImplement matrix transforms and discuss eigenvalues
This problem tests your ability to perform in-place 2D matrix transformations and your conceptual understanding of how linear algebraic properties like eigenvalues describe matrix behavior.
Software Engineering FundamentalsOnsiteArraysMatricesLinear Algebra - GoogleMediumSoftware EngineerImplement text wrapping, waitlist, and intervals
This problem tests your ability to implement a greedy word-wrapping algorithm and a custom queue data structure that supports efficient deletions based on time intervals.
Coding & AlgorithmsOnsiteGreedyString ManipulationData Structures
Google