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 271–300 of 520 results

  • Jump TradingMediumSoftware Engineer
    Identify read-only files from permission records

    This problem tests your ability to parse Unix-style permission strings and implement filtering logic based on bitmask-like constraints.

    Coding & AlgorithmsOnline AssessmentString ParsingFilteringAlgorithms
  • KneronMediumSoftware Engineer
    Compute sum of minima with removals

    Compute sum of minima with removals evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnline Assessment
  • KneronMediumSoftware Engineer
    Count IoT devices matching date and threshold

    This question evaluates handling of paginated REST APIs, JSON parsing and nested-data filtering, month/year date parsing, and numeric threshold comparisons, reflecting skills in data retrieval and programmatic data manipulation.

    Data Manipulation (SQL/Python)Online Assessment
  • KneronMediumSoftware Engineer
    Optimize machines for distributed merging cost

    Optimize machines for distributed merging cost evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignOnline Assessment
  • LyftMediumSoftware Engineer
    Assign Minimum Workers to Jobs

    This problem tests your ability to manage overlapping intervals and greedy resource allocation using minute-based time arithmetic.

    Coding & AlgorithmsOnline AssessmentSweep-lineIntervalsGreedy
  • MathWorksMediumSoftware Engineer
    Calculate cost from orders with SQL

    This question evaluates a candidate's ability to perform SQL data manipulation and business-rule calculations, including conditional joins, date-range filtering, and numeric arithmetic for discounts and taxes.

    Data Manipulation (SQL/Python)Online Assessment
  • MathWorksMediumSoftware Engineer
    Calculate tiered cost and break-even

    This question evaluates the ability to model tiered piecewise cost functions, compute total and average unit costs, and perform break-even analysis using basic algebra and arithmetic.

    Statistics & MathOnline Assessment
  • MathWorksMediumSoftware Engineer
    Compute intersections for each segment

    This question evaluates algorithmic problem-solving, interval reasoning, and complexity-analysis skills by requiring an efficient method to count how many other segments intersect each interval while accounting for edge cases like equal endpoints and duplicate segments.

    Coding & AlgorithmsOnline Assessment
  • MathWorksEasySoftware Engineer
    Compute probability of drawing reds

    This question evaluates understanding of probability theory and combinatorics, specifically reasoning about sampling without replacement and calculating event probabilities using counting methods.

    Statistics & MathOnline Assessment
  • MathWorksEasySoftware Engineer
    Compute urn-draw probabilities and expectations

    This question evaluates understanding of elementary probability concepts—dependent events, conditional probability, and expected value—using an urn model with draws without replacement.

    Statistics & MathOnline Assessment
  • MathWorksMediumSoftware Engineer
    Decide transform via one-to-one mapping

    This question evaluates understanding of character-to-character mappings in strings, modeling those mappings as directed graphs, detection and handling of cycles, and the ability to construct a sequence of replacements.

    Coding & AlgorithmsOnline Assessment
  • MathWorksHardSoftware Engineer
    Deduce position from logic clues

    This question evaluates the ability to model and reason about constraint-satisfaction on a 2D grid, including logical inference with directional and adjacency relations, combinatorial placement constraints, and determination of uniqueness.

    Statistics & MathOnline Assessment
  • MathWorksEasySoftware Engineer
    Deduce row order from logic clues

    This question evaluates logical deduction, constraint satisfaction, and basic combinatorial reasoning used to infer ordering from positional clues. Commonly asked to assess a candidate's ability to apply discrete math and spatial reasoning within the Statistics & Math domain, it targets conceptual understanding of constraints rather than practical implementation.

    Statistics & MathOnline Assessment
  • MathWorksMediumSoftware Engineer
    Design a multi-tenant course purchase and delivery system

    This question tests the ability to design a scalable multi-tenant architecture that manages course content, user entitlements, and purchase workflows across different organizational silos.

    System DesignOnline AssessmentMulti-tenancyAPI DesignScalability
  • MathWorksMediumSoftware Engineer
    Determine string transform via end-append moves

    This question evaluates a candidate's understanding of string manipulation, permutation feasibility, and algorithmic optimization for computing minimal move counts.

    Coding & AlgorithmsOnline Assessment
  • MathWorksMediumSoftware Engineer
    Find shortest path using BFS

    This question evaluates a candidate's proficiency with graph traversal algorithms—particularly breadth-first search—and the ability to model grid-based shortest-path problems while reasoning about time and space complexity.

    Coding & AlgorithmsOnline Assessment
  • MathWorksMediumSoftware Engineer
    Implement BFS shortest paths with reconstruction

    This question evaluates understanding of graph traversal via breadth-first search, computation of shortest paths in unweighted graphs, and path reconstruction using parent arrays, assessing algorithmic reasoning and implementation skills in the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • MathWorksMediumSoftware Engineer
    Maximize disjoint k-sum pairs

    This question evaluates proficiency in array algorithms, pairing logic, data structure selection, and complexity analysis, focusing on maximizing disjoint k-sum pairs and reasoning about space–time trade-offs.

    Coding & AlgorithmsOnline Assessment
  • MathWorksMediumSoftware Engineer
    Maximize operations by removing target-sum pairs

    This question evaluates a candidate's ability to design and analyze efficient array algorithms and use appropriate data structures and techniques such as hash maps or sorting with two-pointer strategies, with attention to time and space complexity.

    Coding & AlgorithmsOnline Assessment
  • MetaMediumSoftware Engineer
    Describe proudest project and cross-team work

    This question evaluates leadership, cross-team collaboration, ownership, and reflective learning by asking about a candidate's proudest project and a specific instance of working across teams, and it falls under the Behavioral & Leadership category within the software engineering domain.

    Behavioral & LeadershipOnline Assessment
  • MetaMediumSoftware Engineer
    Describe teamwork and stress handling

    This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Describe teamwork and stress handling states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipOnline Assessment
  • MetaMediumSoftware Engineer
    Design a bank system with scheduled transfers

    This question evaluates object-oriented design and stateful system skills, including time-ordered event processing, scheduling and cancellation semantics, balance accounting, and top-k aggregation using appropriate data structures.

    Coding & AlgorithmsOnline Assessment
  • MetaHardSoftware Engineer
    Design a basic bank system API

    This question evaluates a candidate's ability to design and implement an in-memory banking API, focusing on data modeling, API semantics, invariants (such as monotonic timestamps and non-negative balances), idempotency, and basic concurrency control.

    System DesignOnline Assessment
  • MetaMediumSoftware Engineer
    Design a fitness tracking app

    This problem tests your ability to design a scalable backend for a fitness tracking application, focusing on high-frequency sensor data ingestion, geospatial route storage, and efficient retrieval of historical user activities.

    System DesignOnline AssessmentScalabilityGeospatialNoSQL
  • MetaMediumSoftware Engineer
    Design an in-memory cloud file system

    This question evaluates understanding of object-oriented design, stateful data structures, and resource management including user quotas, ownership semantics, and file metadata operations.

    Coding & AlgorithmsOnline Assessment
  • MetaHardSoftware Engineer
    Design an in-memory cloud storage system

    This question tests your ability to design a high-performance, in-memory distributed metadata store that supports hierarchical file structures, quota management, and efficient retrieval of top-k largest files.

    System DesignOnline AssessmentData StructuresConcurrencyTrie
  • MetaMediumSoftware Engineer
    Design an in-memory database with TTL and history

    This question evaluates understanding of time-versioned in-memory key–field–value stores, covering TTL-based expiration, historical reads, atomic compare-and-set/delete semantics, efficient scan/scan-by-prefix operations, and time/space complexity analysis, and it belongs to the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • MetaMediumSoftware Engineer
    Extend cloud file system with copy and compression

    This question evaluates understanding of data structures and algorithms for stateful resource management, covering bookkeeping of per-user quotas, file metadata operations (copy, compress/decompress), string filtering and sorting, and efficient selection and deletion of largest elements.

    Coding & AlgorithmsOnline Assessment
  • MetaEasySoftware Engineer
    Implement Multi-Level In-Memory Services

    This question evaluates a candidate's ability to design and implement mutable in-memory data structures and algorithms for stateful service simulations, covering account and file modeling, temporal operations with lazy expiration, ranking queries, merging entities, and capacity constraints.

    Coding & AlgorithmsOnline Assessment
  • MetaHardSoftware Engineer
    Implement a Timestamped Banking System

    This problem tests the ability to manage time-series data using efficient lookups and range queries, specifically requiring a balance between transactional updates and historical state retrieval.

    Coding & AlgorithmsOnline AssessmentData StructuresBinary SearchTime-series