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 1351–1380 of 2810 results

  • Lead BankMediumSoftware Engineer
    Implement a versioned hash map with snapshot

    This question evaluates understanding of versioned hash maps, time-travel key-value stores, temporal retrieval semantics, and snapshot creation, testing algorithms and data-structure design in the Coding & Algorithms domain and emphasizing practical implementation with conceptual reasoning about correctness and timestamp semantics.

    Coding & AlgorithmsTechnical Screen
  • LeagueMediumSoftware Engineer
    Design scalable insurance claims processing system

    Walks through designing a scalable insurance claims processing system: ingestion, validation, routing, and the reliability and consistency trade-offs. Includes a worked system design solution.

    System DesignTechnical Screen
  • LegoraMediumSoftware Engineer
    Senior engineer project deep dive: trade-offs, scale, challenges, hardest part

    Behavioral question for senior software engineers: lead a 20-minute deep dive into a past project and answer probing questions about trade-offs, operating scale, challenges and the hardest part. It assesses ownership, engineering judgment, use of concrete numbers, and clear technical communication under time pressure.

    Behavioral & LeadershipTechnical Screen
  • LiftoffMediumSoftware Engineer
    Implement minimal RLE encode/decode with max run K

    This question evaluates proficiency in string parsing and compression techniques, specifically run-length encoding/decoding, pattern detection, and algorithmic optimization for producing minimal-length encodings under a maximum pattern length constraint.

    Coding & AlgorithmsTechnical Screen
  • LimeEasySoftware Engineer
    Combine Overlapping Closed Intervals Into a Sorted Disjoint List

    Given an unordered list of closed integer intervals, possibly with duplicates, nested intervals and touching endpoints, combine every chain of overlapping intervals and return the disjoint result ordered by start. It tests interval reasoning, precise overlap rules at shared endpoints, and careful handling of edge cases.

    Coding & AlgorithmsTechnical Screen
  • LinkedInEasySoftware Engineer
    Answer Repeated Shortest Word Distance Queries

    Design a data structure that preprocesses a list of words to efficiently answer repeated queries for the shortest index distance between two distinct words.

    Coding & AlgorithmsTechnical Screenhash-tabletwo-pointersdesign
  • LinkedInEasySoftware Engineer
    Arrange Nonnegative Integers to Form the Largest Number

    Tests custom sorting logic and string manipulation to arrange a list of nonnegative integers into the lexicographically largest combined numerical string.

    Coding & AlgorithmsTechnical Screensortinggreedystring
  • LinkedInMediumSoftware Engineer
    Can You Place N Objects?

    This problem tests your ability to handle greedy array traversal while maintaining specific adjacency constraints, requiring careful management of boundary indices.

    Coding & AlgorithmsTechnical ScreenArraysGreedySimulation
  • LinkedInMediumSoftware Engineer
    Check Whether a String Is a Signed Decimal Number Without Exponent Notation

    Write a function that decides whether a string is a valid plain decimal number with an optional sign and fractional part, rejecting exponents, stray symbols, and repeated decimal points. It tests turning a small grammar into careful character-by-character validation and covering edge cases such as empty strings and bare signs.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Compare heap and stack memory

    This question evaluates understanding of memory management concepts including stack versus heap allocation, object lifetimes, allocation and free behavior, access patterns, performance characteristics, and thread visibility within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • LinkedInEasySoftware Engineer
    Design O(1) Randomized Multiset

    This problem tests your ability to design a data structure that supports efficient insertion, deletion, and uniform random sampling by combining dynamic arrays with hash maps to achieve constant time complexity.

    Coding & AlgorithmsTechnical ScreenHash MapArrayDesign
  • LinkedInMediumSoftware Engineer
    Design a Calendar System

    Tests your ability to design a scalable calendar backend that supports single and recurring events, attendee invitations, and time-based reminder notifications with timezone awareness.

    System DesignTechnical ScreenDistributed SystemsData ModelingScheduling
  • LinkedInHardSoftware Engineer
    Design a Multi-Region Malicious-IP Detection System

    Design a globally distributed, low-latency edge security service that detects and blocks malicious IP addresses across regions, featuring decentralized evaluation, asynchronous intelligence sharing, and rapid false-positive rollback.

    System DesignTechnical ScreenDistributed SystemsSecurityLow Latency
  • LinkedInMediumSoftware Engineer
    Design a Raffle Drum That Draws Duplicate Tickets Fairly in O(1)

    Design a drum that holds raffle ticket codes, where the same code can be dropped in more than once, and supports adding a ticket, pulling a specific ticket out, and drawing one at random so every physical ticket in the drum is equally likely to come out — all in average O(1) time. Tests combining an array with a hash index so removal and random draw both stay constant time even with string keys and duplicates.

    Software Engineering FundamentalsTechnical Screendesignhash-maprandomization
  • LinkedInMediumSoftware Engineer
    Design a Randomized Multiset

    This question evaluates the ability to design and implement a randomized multiset that correctly handles duplicate integer occurrences while providing expected O(1) insert, remove, and uniform getRandom operations, testing knowledge of data structures, randomness, and performance constraints.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Design a Top-K search words service

    The question evaluates understanding of scalable, low-latency analytics and search-event systems, including high-throughput event ingestion, Top-K aggregation across all-time and sliding windows, normalization/deduplication trade-offs, and multi-region consistency considerations.

    System DesignTechnical Screen
  • LinkedInMediumSoftware Engineer
    Design a stack with max removal

    This question evaluates data-structure design and algorithmic complexity analysis by requiring a stack-like structure that supports standard stack operations plus efficient maximum retrieval and targeted removal, assessing practical implementation skills and time-complexity reasoning at a practical application level.

    Coding & AlgorithmsTechnical Screen
  • LinkedInHardSoftware Engineer
    Design distributed parallel job processing

    This question evaluates understanding of distributed systems architecture, parallel job scheduling, fault tolerance, coordination and concurrency control, API and data model design, idempotency, observability, and capacity planning for multi-tenant, heterogeneous workloads.

    System DesignTechnical Screen
  • LinkedInHardSoftware Engineer
    Explain a Technical Project with an Architecture Diagram

    This question evaluates your ability to clearly explain a complex software architecture, articulate your personal technical ownership, justify design trade-offs, and quantify business and operational impact.

    Behavioral & LeadershipTechnical Screenbehavioralsystem architecturetechnical leadership
  • LinkedInMediumSoftware Engineer
    Explain a past project and critique a prior team

    This question evaluates communication of technical ownership, system architecture reasoning, and leadership competencies such as collaboration, conflict resolution, and influencing change within a Software Engineer role.

    Behavioral & LeadershipTechnical Screen
  • LinkedInMediumSoftware Engineer
    Explain database transactions and ACID

    This question evaluates a candidate's understanding of database transactions including ACID properties, isolation levels (read uncommitted, read committed, repeatable read, serializable), common anomalies (dirty reads, non-repeatable reads, phantom reads), MVCC, and commit/rollback semantics, testing competency in transactional correctness and concurrency control. Commonly asked in System Design and database contexts because it probes reasoning about data integrity, visibility, and durability under concurrent workloads, and it tests both conceptual understanding of transactional guarantees and practical application of isolation behavior in relational database systems.

    System DesignTechnical Screen
  • LinkedInEasySoftware Engineer
    Find dictionary words that match a phone keypad digit sequence

    Coding problem: given a list of known words and a digit string typed on a standard phone keypad, return every known word whose letters map to exactly that digit sequence, in sorted order. It tests string encoding, choosing a lookup structure for the dictionary, and analyzing time complexity.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Find the Node Where Two Singly Linked Lists Merge

    Two singly linked lists stored in one successor array may merge at some node and share every node after it. Given both heads, return the first shared node, or -1 if the lists never meet. It tests linked-list traversal and careful handling of cases such as one list starting inside the other.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    Generate All Distinct Permutations of a List with Duplicate Values

    Given a list of up to eight integers that may contain duplicates, return every distinct permutation exactly once, sorted in lexicographic order. It tests systematic enumeration, avoiding duplicate results caused by equal values, and producing a deterministic output order.

    Coding & AlgorithmsTechnical Screen
  • LinkedInMediumSoftware Engineer
    How do you win project buy-in?

    This question evaluates leadership, stakeholder management, and team resiliency competencies by probing experience in securing project buy-in and in preventing single-point-of-failure through knowledge sharing, documentation, and ownership distribution.

    Behavioral & LeadershipTechnical Screen
  • 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
  • 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