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 451–480 of 520 results

  • StripeMediumSoftware Engineer
    Implement bitmap font render/compress/invert

    This problem tests your ability to manipulate 2D bit arrays, implement Run-Length Encoding (RLE) for data compression, and perform grid-based coordinate transformations.

    Coding & AlgorithmsOnline AssessmentArraysStringsCompression
  • StripeMediumSoftware Engineer
    Implement multi-network card validator with Luhn

    This question evaluates a candidate's ability to implement and reason about the Luhn checksum, multi-network payment card format validation, combinatorial completion for redacted digits, single-error correction models, and efficient search/pruning with deterministic duplicate avoidance.

    Coding & AlgorithmsOnline Assessment
  • StripeEasySoftware Engineer
    Implement stateful connection router simulator

    This question evaluates design and implementation skills for a stateful connection router, focusing on round-robin load distribution, connection lifecycle handling (duplicate connects, disconnects, shutdowns), and per-target capacity and mapping management.

    Coding & AlgorithmsOnline Assessment
  • StripeMediumSoftware Engineer
    Register Data Centers and Route to the Nearest Healthy Region

    Implement a stateful command processor to register data centers, update their operational health, and route incoming requests to the nearest healthy data center using the Haversine distance formula.

    Coding & AlgorithmsOnline AssessmentDesignGeometryParsing
  • StripeEasySoftware Engineer
    Specify Proximity-Based Request Routing

    Clarify proximity metrics, destination eligibility, tie rules, and capacity before designing a request-routing algorithm.

    Software Engineering FundamentalsOnline Assessment
  • StripeHardSoftware Engineer
    Subtract Blocked Periods from Allowed Deployment Windows

    Compute available deployment windows by merging allowed and blocked half-open intervals, subtracting overlaps, and returning maximal sorted nonempty ranges.

    Coding & AlgorithmsOnline Assessment
  • TeslaEasySoftware Engineer
    Generate Per-Position Guess Feedback

    This problem tests your ability to process strings and manage state (character frequency) to determine exact matches versus partial matches, commonly used in word-guessing games.

    Coding & AlgorithmsOnline AssessmentStringHash MapArray
  • TestGorillaMediumSoftware Engineer
    Assess Spring IoC, AOP, JDBC, Security

    Assess Spring IoC, AOP, JDBC, Security evaluates engineering fundamentals, trade-offs, examples, pitfalls, and operational implications in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Software Engineering FundamentalsOnline Assessment
  • The Trade DeskMediumSoftware Engineer
    Design a Recipe Manager

    Evaluates API and in-memory data structure design, search and sorting semantics, user-associated operations, versioning/audit history, data normalization, and edge-case handling within the Software Engineering Fundamentals domain.

    Software Engineering FundamentalsOnline Assessment
  • The Trade DeskMediumSoftware Engineer
    Implement a Cloud Storage Service

    This question evaluates a candidate's ability to implement an in-memory cloud storage system, exercising skills in data structures and stateful API design, string handling and pattern matching, sorting and eviction algorithms, and per-user resource accounting.

    Coding & AlgorithmsOnline Assessment
  • TikTokMediumSoftware Engineer
    Implement list, form, and API rendering with pitfalls

    This question evaluates front-end web development competencies including local-state list rendering, form submission and validation behavior, client API integration with loading/success/error states, accessibility practices, idempotent update handling, and predictable re-rendering.

    Software Engineering FundamentalsOnline Assessment
  • TikTokMediumSoftware Engineer
    Solve four algorithm design tasks

    This multi-part question evaluates algorithm design and data-structure competencies including wildcard string pattern matching and trade-offs between dynamic programming and greedy strategies, dynamic pair-sum maintenance under frequent updates, O(1) LRU cache design, and scheduling/ordering for time-constrained threat neutralization.

    Coding & AlgorithmsOnline Assessment
  • TradedeskMediumSoftware Engineer
    Fetch and Cache Daily Stock Prices Across a Date Range

    This problem tests your ability to build a resilient data-fetching client that handles network unreliability, data integrity validation, and efficient caching patterns.

    Software Engineering FundamentalsOnline AssessmentAPICachingError Handling
  • TradedeskMediumSoftware Engineer
    Process Operations in a Timestamped In-Memory Database

    This problem tests your ability to design an in-memory data store with complex querying and expiration requirements using efficient nested data structures.

    Coding & AlgorithmsOnline AssessmentHash MapSortingData Structures
  • TripadvisorMediumSoftware Engineer
    Build blog UI with API data and likes

    This question evaluates front-end JavaScript competencies including UI rendering, client-side state management, asynchronous REST API integration, loading and error handling, and resolving author identity relative to the current user.

    Coding & AlgorithmsOnline Assessment
  • UberHardSoftware Engineer
    Check if each prefix forms 1..k permutation

    This question evaluates algorithmic thinking and understanding of permutations and prefix invariants, measuring the ability to recognize when the first k elements of a permutation can form the set {1..k}.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Compute final prices with next smaller discount

    This question evaluates array-processing and algorithmic problem-solving skills, focusing on reasoning about subsequent elements to compute element-wise discounts under input constraints.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Compute sums and maximum path in a tree

    This problem tests your ability to perform post-order tree traversals to calculate subtree metrics and solve optimization problems involving paths that can span across parent-child boundaries.

    Coding & AlgorithmsOnline AssessmentTreesRecursionDFS
  • UberHardSoftware Engineer
    Count Palindromic Ancestor Paths

    This problem tests your ability to use bit manipulation and prefix properties on trees to solve path-related queries efficiently, specifically focusing on the property that a set of characters can form a palindrome if at most one character has an odd frequency.

    Coding & AlgorithmsOnline AssessmentBit ManipulationTreesDFS
  • UberMediumSoftware Engineer
    Count paths with prime-ending jumps

    This question evaluates a candidate's ability to design and implement dynamic programming for counting paths, combining combinatorial reasoning with modular arithmetic and handling step-size constraints tied to primes ending in digit 3.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Count subarrays with at least k fruit pairs

    This question evaluates algorithmic problem-solving focused on frequency-based counting and efficient enumeration of subarrays, testing competence in designing subquadratic solutions and selecting appropriate data representations within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Count subarrays with ≥k identical pairs

    This question evaluates proficiency in array algorithms, frequency-based counting and combinatorial reasoning for identifying equal-element pairs within contiguous subarrays.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Describe your strongest project

    This question evaluates a candidate's technical leadership, ownership, communication, and ability to describe design trade-offs, metrics, and problem-solving within a software engineering project.

    Behavioral & LeadershipOnline Assessment
  • UberMediumSoftware Engineer
    Determine balanced k values in a permutation

    This question evaluates algorithmic reasoning about permutations and contiguous subarray properties, testing skills in array manipulation, positional reasoning, combinatorial insight, and complexity-aware algorithm design within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find leftmost point of maximum brightness

    This question evaluates understanding of interval overlap counting, efficient use of ordered data structures for range events, tie-breaking logic, and robustness to numeric edge cases such as large coordinates and floating-point radii.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find minimum activations to absorb all balls

    This question evaluates the ability to model Euclidean-distance relations as a static connectivity graph and reason about the minimum number of activations needed to absorb all nodes, testing computational geometry and graph algorithms competency.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find minimum reversals to orient edges away from root

    This question evaluates understanding of directed graphs and rooted trees, the ability to reason about edge orientations and minimal reversals, and competency in traversal techniques and complexity analysis.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Find next and closest palindromes

    This question evaluates string-based numeric manipulation and palindrome construction, including edge-case handling (all 9s, single-digit inputs, length changes), candidate generation and magnitude comparison of large numbers as strings, and carry propagation for fixed-length decimal palindromes.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Handle invalid Lisp expression parsing

    This question evaluates the ability to parse and evaluate nested Lisp-like expressions, manage variable bindings and scope resolution, and detect malformed input and syntax errors.

    Coding & AlgorithmsOnline Assessment
  • UberMediumSoftware Engineer
    Kth Employee Reached in an Ordered Hierarchy

    This problem tests tree traversal techniques, specifically finding the k-th node in an in-order traversal of a binary search tree while handling dynamic updates or specific subtree constraints.

    Coding & AlgorithmsOnline AssessmentTreesBinary Search TreeTraversal