Katkat

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 991–1020 of 2629 results

  • GoogleHardSoftware Engineer
    Find secret word with match-count feedback

    This question evaluates algorithmic reasoning and inference from constrained feedback, testing skills in information-theoretic deduction, pattern matching, and search strategy within a bounded-query interactive setting.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Find shared objects across two log files

    This question evaluates the ability to design efficient algorithms and data-processing strategies for identifying shared object identifiers across large log files, testing skills in streaming processing, set membership handling, and external-memory algorithm reasoning.

    Coding & AlgorithmsTechnical Screen
  • 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 shortest relationship path using BFS

    This problem tests your ability to model a relationship network as a graph and implement Breadth-First Search (BFS) to find the shortest path length between two nodes.

    Coding & AlgorithmsTechnical ScreenGraphBFSShortest Path
  • GoogleMediumSoftware Engineer
    Find shortest subarray with at least k distinct

    This problem tests your ability to use the sliding window (two-pointer) technique combined with hash maps to find an optimal subarray satisfying a frequency constraint.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapArrays
  • GoogleMediumSoftware Engineer
    Find shortest subarray with ≥k distinct integers

    This question tests the ability to solve subarray problems using the sliding window (two-pointer) technique and hash maps to track element frequencies.

    Coding & AlgorithmsTechnical ScreenSliding WindowTwo PointersHash Map
  • GoogleMediumSoftware Engineer
    Find the Largest Monotone Increasing Number

    Tests greedy algorithms, digit manipulation, and boundary handling to find the largest number less than or equal to n with non-decreasing decimal digits.

    Coding & AlgorithmsTechnical Screengreedymathstring
  • 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
  • GoogleHardSoftware Engineer
    Find the Longest Straight Run of One Color

    Tests grid traversal and dynamic programming to find the maximum consecutive sequence of identical elements along horizontal, vertical, and diagonal lines.

    Coding & AlgorithmsTechnical Screenmatrixdynamic-programmingarray
  • 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
    Find where to cut cake into equal areas

    This problem tests your ability to model a geometric area as a function and solve for a specific threshold using a binary search or linear sweep approach.

    Coding & AlgorithmsTechnical ScreenGeometryArraysPrefix Sums
  • 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
  • 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
  • GoogleEasySoftware Engineer
    Implement Batched Undo/Redo Layer

    This question evaluates understanding of state management, undo/redo semantics, batched transactional edits, and memory-efficient change history representation for map-based document layers.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Implement Checksums and Feature Rollout Evaluation

    This question evaluates string processing, checksum computation with modular indexing, parsing of dependency data, and business-logic evaluation for feature rollouts, including conditional eligibility checks and dependency resolution.

    Coding & AlgorithmsOnline Assessment
  • GoogleHardSoftware Engineer
    Implement Longest-Match Text Replacement

    This question evaluates string processing, pattern matching, greedy algorithm reasoning, and data structure design for efficient longest-prefix token replacement, and is categorized under Coding & Algorithms.

    Coding & AlgorithmsTechnical Screen
  • 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
  • GoogleMediumSoftware Engineer
    Implement Trie Insert and Exact-Word Search

    Implement trie insertion and exact-word search for up to a million total characters, distinguishing terminal words from mere prefixes and returning search results in operation order.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Implement a Reusable Locker Allocation System

    Design and implement a locker bank management system that assigns the lowest available locker index, handles invalid store and pickup operations, releases lockers immediately, and tracks the last package successfully stored in each locker.

    Coding & AlgorithmsTechnical Screenheaphash-tabledesign
  • GoogleMediumSoftware Engineer
    Implement 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 Engineer
    Implement frequency + distance top‑K queries

    This pair of problems evaluates algorithmic and data-structure skills including frequency counting, multi-criteria ordering and selection for top-K results, geometric distance computation for tie-breaking, and time-indexed storage with nearest-timestamp retrieval.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Implement iterator merging lists with filtering

    This problem tests your ability to design a stateful iterator that performs a multi-way merge on sorted streams while applying filtering and deduplication logic on the fly.

    Coding & AlgorithmsTechnical ScreenIteratorsHeapMerge K Sorted
  • GoogleEasySoftware Engineer
    Implement string formatting and request tracking tasks

    This question tests string manipulation, character mapping logic for rotational symmetry, and the ability to manage time-ordered event tracking using appropriate data structures.

    Coding & AlgorithmsTechnical ScreenStringsTwo PointersHash Maps
  • GoogleMediumSoftware Engineer
    Implement 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
  • GoogleHardSoftware Engineer
    Infection Spread on a Grid (Cellular Automaton)

    Implement an optimized discrete-time cellular automaton simulating epidemic spread on a 2D grid with recovery durations, barriers, and multi-neighbor infection thresholds.

    Coding & AlgorithmsTechnical ScreenBreadth-First SearchSimulationMatrix
  • GoogleMediumSoftware Engineer
    Intervals with Exactly X Concurrent Meetings

    Implement an algorithm to identify all maximal time intervals during which exactly X meetings overlap, using a sweep-line technique over half-open intervals.

    Coding & AlgorithmsOnsitesweep-lineintervalssorting