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 1051–1080 of 2629 results
- GoogleMediumSoftware EngineerReturn dictionary words matching a prefix
This problem evaluates string-processing and filtering skills, focusing on exact prefix matching, case sensitivity, duplicate handling, and edge-case management over arrays of strings. Commonly asked in Coding & Algorithms interviews, it assesses practical implementation ability and understanding of algorithmic complexity at an implementation-level (basic to intermediate).
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerReturn the Lexicographically Smallest Two-Sum Index Pair
Find the lexicographically smallest pair of distinct indices whose array values sum to a target. Success depends on deterministic tie handling, duplicates, missing-result behavior, nonmutation, hash-based performance, and comparison with sorting-based alternatives.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerSchedule Priority Jobs with Cooldowns
Design a recurring job scheduler that selects the highest-priority eligible job and enforces cooldown periods measured by subsequent retrieval invocations.
Coding & AlgorithmsOnsiteheapdesignpriority-queue - GoogleMediumSoftware EngineerSearch a Pattern Across the Leaf Text of a Binary Tree
Tests binary tree traversal combined with streaming pattern matching (such as the Knuth-Morris-Pratt algorithm) to detect substrings across leaf boundaries without buffering the entire text in memory.
Coding & AlgorithmsOnsitebinary-treestring-matchingkmp - GoogleHardSoftware EngineerShuffle array using random integer API
This question evaluates understanding of randomized algorithms, uniform probability distributions over permutations, in-place array manipulation, and time/space complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerSimulate an In-Memory Directory Tree with mkdir, ls, Append and Read
A Google coding problem that simulates an in-memory file system through a sequence of mkdir, ls, add and read operations, with missing directories created on demand and existing files appended to. It tests tree modeling, path parsing, sorted directory listings and precise operation semantics.
Coding & AlgorithmsOther - GoogleMediumSoftware EngineerSimulate meeting-room bookings and return busiest room
This problem tests your ability to manage interval-based resource allocation using a priority queue and a frequency map to track usage statistics.
Coding & AlgorithmsOnsiteHeapSimulationGreedy - GoogleMediumSoftware EngineerSimulate room assignments for scheduled meetings
This problem tests your ability to manage resources over time using a priority queue and sorting, focusing on handling events and tie-breaking logic for room availability.
Coding & AlgorithmsTechnical ScreenSortingPriority QueueSimulation - GoogleMediumSoftware EngineerSliding Window Average After Dropping the Largest Values
This problem tests your ability to maintain order and perform efficient removals within a sliding window using balanced data structures or heaps.
Coding & AlgorithmsTechnical ScreenSliding WindowData StructuresHeaps - GoogleMediumSoftware EngineerSliding-Window Mean After Removing the Largest K Values
Maintain sliding-window means after removing the largest k occurrences, with duplicate-aware rebalancing, exact fractions, and bounded streaming state.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerSolve Banana Speed and Interval Merge
Solve minimum eating speed and merge intervals for a new graduate phone screen. The solution covers binary search on answer, integer ceiling division, monotonic feasibility, interval sorting, overlap merging, correctness, complexity, and edge cases.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerSolve Flower Placement and Directory Deletion
Implement algorithms for two interview tasks: minimal directory deletion in a hierarchical filesystem using tree traversal, and valid flower placement on a grid using constraint satisfaction.
Coding & AlgorithmsOnsiteTrieTreeBacktracking - 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 - 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 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 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
Google