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 2971–3000 of 5874 results

  • LinkedInMediumSoftware Engineer
    Longest Run of Ones After One Flip

    This problem tests your ability to manage a sliding window with a flexible constraint, specifically counting zeros to determine the maximum length of a sequence after a single modification.

    Coding & AlgorithmsTechnical ScreenSliding WindowTwo PointersArray
  • LinkedInMediumSoftware Engineer
    Maximum Product of a Contiguous Subarray With Negatives and Zeros

    Given an integer array that may contain negative numbers and zeros, return the largest product of any non-empty contiguous subarray. The problem tests careful reasoning about sign changes, zeros and single-element subarrays under tight input-size limits.

    Coding & AlgorithmsOnsite
  • LinkedInEasySoftware Engineer
    Merge Two N-ary Trees by Matching Node Keys

    Merge two rooted n-ary trees in which every node has an integer key, combining nodes only when their keys match under matching parents. Tests recursive tree traversal, matching children by key, handling roots with different keys, and producing a canonical preorder encoding of the merged tree.

    Coding & AlgorithmsTechnical Screen
  • LinkedInHardSoftware Engineer
    Merge and Serialize N-ary Trees

    Tests recursive tree manipulation, immutable merging semantics, and robust string serialization/deserialization with input validation.

    Software Engineering FundamentalsTechnical Screentreerecursionparsing
  • LinkedInMediumSoftware Engineer
    Minimize adjacent-color assignment cost

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Minimize adjacent-color assignment cost states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • LinkedInEasySoftware Engineer
    Minimum index distance between two given words in a word list

    Coding problem: given a list of words and two different target words that both appear in it, return the smallest distance between an index of one word and an index of the other. It tests single-pass scanning with position tracking, handling of repeated occurrences, and time complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Randomized String Multiset With Average O(1) Insert, Remove and Weighted Random Pick

    Design a collection of strings that allows duplicates and supports insert, remove and a random pick in average constant time, where each stored occurrence is equally likely to be returned. It tests hash map and array layout, index bookkeeping on removal, and how string keys change the cost analysis.

    Software Engineering FundamentalsTechnical Screen
  • LinkedInHardSoftware Engineer
    Reduce Stale Listings in a Job Marketplace

    Design an auditable staleness-detection and remediation engine for a global job marketplace that aggregates heterogeneous signals, enforces graduated interventions, and supports low-latency employer appeals.

    System DesignTechnical ScreenDistributed SystemsEvent-Driven ArchitectureAudit Logging
  • LinkedInMediumSoftware Engineer
    Reverse a linked list

    This question evaluates understanding of linked list data structures and proficiency manipulating pointers or references to perform in-place transformations when reversing a linked list. Commonly asked in Coding & Algorithms interviews, it gauges algorithmic thinking and practical application-level competency in list operations rather than purely conceptual theory.

    Coding & AlgorithmsOnsite
  • LinkedInEasySoftware Engineer
    Review a Web Application Architecture

    This question evaluates system design competencies such as scalability, reliability, fault tolerance, database architecture, load balancing, external dependency management, and observability, and is categorized under System Design.

    System DesignTechnical Screen
  • LinkedInMediumSoftware Engineer
    Scale a NoSQL Key–Value Store to One Million QPS

    Design a distributed, highly available NoSQL key-value store capable of serving 1M QPS across 50 million key-value pairs with low p99 latency.

    System DesignOnsitesystem-designnosqldistributed-systems
  • LinkedInMediumSoftware Engineer
    Second-Smallest Value in a Min Tournament Tree in Logarithmic Time

    Given a full binary tournament tree stored in array order, where each internal node holds the smaller of its two children, return the second-smallest leaf value in logarithmic time. It tests reasoning about how a knockout structure constrains where the runner-up can be, array-based tree indexing, and justifying a partial search.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Shortest Substring Containing Every Character of a Pattern

    Return the shortest substring of a string that contains every character of a pattern with matching multiplicity, case-sensitively, choosing the leftmost substring on ties and an empty string when none exists. Tests efficient substring search and careful character-count bookkeeping.

    Coding & AlgorithmsOther
  • LinkedInHardSoftware Engineer
    Shortest Word Distance Queries

    Tests designing an inverted index and using two-pointer or binary search techniques to efficiently compute the minimum absolute index distance between word occurrences across repeated queries.

    Coding & AlgorithmsTechnical Screenhash-tabletwo-pointersbinary-search
  • LinkedInMediumSoftware Engineer
    Solve Cache, Window, and Heap Problems

    This question evaluates competency in advanced data structures and algorithmic techniques—specifically frequency-based cache design, sliding-window substring search, and heap-driven k-pair generation—along with time and space complexity analysis and robust edge-case handling.

    Coding & AlgorithmsOnsite
  • LinkedInMediumSoftware Engineer
    Solve common string and subarray problems

    Assesses core string and array manipulation skills by requiring string reversal and contiguous-subarray computations for maximum sum and maximum product, identified under the Coding & Algorithms category.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Solve min window & animal conflicts

    This question evaluates understanding of string algorithms, frequency-based sliding window techniques and hashmap/graph-based conflict detection, focusing on minimal substring search and modeling pairwise exclusions.

    Coding & AlgorithmsOnsite
  • LinkedInMediumSoftware Engineer
    Solve six algorithmic problems

    This multi-part question evaluates algorithmic problem solving, data-structure selection, complexity analysis, API design, and the handling of trees, arrays, grids, circular structures, and dynamic updates.

    Coding & AlgorithmsOnsite
  • LinkedInMediumSoftware Engineer
    Solve substring and top‑K pair problems

    This problem tests your ability to solve a sliding window string problem followed by a heap-based retrieval task for ranked items.

    Coding & AlgorithmsOnsiteSliding WindowHeapString Manipulation
  • LinkedInMediumSoftware Engineer
    Traverse a Binary Tree in Zigzag Level Order

    Return binary-tree values level by level while alternating left-to-right and right-to-left order without changing level membership.

    Coding & AlgorithmsOnsite
  • Listen LabsMediumSoftware Engineer
    Parse a Truncated Streaming JSON Prefix of Strings and Nested Arrays

    Write a function that turns a truncated prefix of streamed JSON, made only of strings and nested arrays, into the value received so far. It tests careful parsing of half-received strings, unclosed arrays and input that ends after a comma, along with writing your own edge-case tests.

    Coding & AlgorithmsTechnical Screen
  • Listen LabsMediumSoftware Engineer
    Reconstruct a Warehouse Pick-List From a Dropped Scanner Feed

    Write a function that turns a scanner feed cut off mid-transmission into the best pick-list it can represent so far, recovering half-written labels and unfinished bin groupings. Tests careful state-machine parsing of truncated nested data.

    Coding & AlgorithmsTechnical Screenparsingstacksstrings
  • Lowe'sMediumSoftware Engineer
    Explain Python internals and practices

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Explain Python internals and practices states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • Lowe'sHardSoftware Engineer
    Explain cloud computing fundamentals

    This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Explain cloud computing fundamentals states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignTechnical Screen
  • Lowe'sMediumSoftware Engineer
    Find longest unique substring

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find longest unique substring states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • Luma AIMediumSoftware Engineer
    Build Collaborative Document Editing Shared by People and AI Agents

    A take-home asks you to build collaborative document editing in which people and AI agents edit the same document, then defend its scaling limits and add approval, audit history and selective revert for agent edits. Tests concurrency control, real-time sync, anchoring slow agent edits, attribution, and prototype scoping.

    System DesignOnsite
  • Luma AIMediumSoftware Engineer
    Build a Scalable Text-to-Speech Service Prototype, Then Defend and Extend It

    An 8 to 12 hour take-home asks you to build a scalable text-to-speech service with AI coding agents, then defend its trade-offs and scaling limits in a product review and plan a new customer requirement. Tests 0-to-1 scoping, streaming and batch synthesis design, capacity reasoning, and estimation and roadmap skills.

    System DesignOnsite
  • Luma AIMediumSoftware Engineer
    Explain Your Motivation and How You Use AI Development Tools in Your Workflow

    A recruiter screen for an AI product engineering role asks about your motivation for moving, why this company, your hands-on experience with AI development tools and workflows, and which areas of development interest you. Tests concrete, verifiable examples of agent-assisted work and a coherent career story.

    Behavioral & LeadershipOnsite
  • Luma AIHardSoftware Engineer
    Implement Refactoring Assessment Features

    This problem tests your ability to manage stateful data with temporal versioning and reconstruct valid paths in a graph while ensuring data integrity under constraints.

    Coding & AlgorithmsTechnical ScreenGraphsData StructuresVersioning
  • Luma AIHardSoftware Engineer
    Manage Prompt and Model Behavior in Production

    This question tests the ability to design an end-to-end configuration management and observability system for LLM applications that ensures reproducibility, safety, and rapid recovery from performance drift.

    ML System DesignTechnical ScreenLLMOpsSystem DesignObservability