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 4261–4290 of 5874 results

  • OtherMediumSoftware Engineer
    Solve a Set of Probability and Quantitative Reasoning Problems

    Work through fourteen quantitative interview problems covering probability, counting, expectation, algebra, logical constraints, and rate reasoning. Each result should be auditable, use the correct sample space, and state any interpretation that affects the calculation.

    Statistics & MathOnline Assessment
  • OtherMediumSoftware Engineer
    Spreadsheet Formulas, Dependencies, and Circular References

    Implement spreadsheet formulas with dependency updates, repeated references, unset cells, and cycle detection that recovers after formulas change.

    Coding & AlgorithmsOther
  • OtherMediumSoftware Engineer
    Test Severity Filtering with Contract-Distinguishing Cases

    Test severity filtering with independent expected results, inclusive boundaries, misleading message text, missing fields, empty records, and preserved order and duplicates.

    Software Engineering FundamentalsOnsite
  • OtherEasySoftware Engineer
    Track Workers, Sessions, Promotions, and Bonus Pay

    Implement worker sessions, current metadata, promotions, ordered filtering, and time-clipped compensation with historical rates and non-stacking double-pay intervals.

    Coding & AlgorithmsOnline Assessment
  • OtherEasySoftware Engineer
    Validate Nested Parentheses, Brackets, and Braces

    Validate nested parentheses, brackets, and braces with correct handling of empty input, mismatched closing symbols, and unfinished groups.

    Coding & AlgorithmsOnline Assessment
  • OthersMediumSoftware Engineer
    Answer k-step ancestor queries in a rooted tree

    This problem tests your ability to optimize ancestor lookups in a tree using the Binary Lifting technique to achieve logarithmic query time.

    Coding & AlgorithmsOnline AssessmentTreesBinary LiftingDynamic Programming
  • OthersMediumSoftware Engineer
    Write a quarterly SQL report and a bash max-file script

    This problem tests your ability to perform conditional aggregation in SQL for time-series reporting and your proficiency in recursive shell scripting for system administration tasks.

    Software Engineering FundamentalsOnline AssessmentSQLBashData Aggregation
  • Otter.AiMediumSoftware Engineer
    Design a Fault-Tolerant Meeting Bot Allocation System

    Design the infrastructure between a web UI and a bot pool. Connect requirements and APIs to data modeling, consistency, scaling, failure recovery, observability, and the important design trade-offs.

    System DesignOnsite
  • Otter.AiMediumSoftware Engineer
    Design a Google Docs-Style Real-Time Collaborative Editing Backend

    Design the backend of a Google Docs-style editor in which many users edit the same document in real time and every copy converges to the same text. Tests concurrency control for simultaneous edits, routing of document sessions, operation storage and revision history, presence, and recovery from disconnects and server failures.

    System DesignOnsite
  • Otter.AiMediumSoftware Engineer
    Evaluate Arithmetic Expressions

    This problem tests your ability to parse and evaluate a string representing a mathematical expression with basic operator precedence, typically requiring a stack-based approach or a recursive descent parser.

    Coding & AlgorithmsTechnical ScreenStackString ParsingMath
  • Otter.AiEasySoftware Engineer
    Extend a Key-Value Store with Commits and Explicit Rollover Semantics

    Design a versioned key-value store supporting staging, atomic commits, point-in-time snapshot reads, and automated rollover compaction.

    System DesignTechnical ScreenKey-Value StoreMVCCConcurrency
  • Otter.AiMediumSoftware Engineer
    Fewest Adjacent-GCD Operations to Turn Every Array Element into 1

    Given an array of positive integers, find the fewest operations that make every element 1, where each operation replaces one of two neighboring values with their greatest common divisor, or return -1 if it cannot be done. Tests GCD properties, lower-bound reasoning and careful case analysis on small arrays.

    Coding & AlgorithmsOnsite
  • Otter.AiMediumSoftware Engineer
    Fixed-Width Text Display

    This question tests a candidate's ability to implement greedy line-packing and space-distribution algorithms, core string manipulation skills evaluated in software engineering interviews. It assesses practical application of text layout logic, including handling edge cases like single-word lines and justified formatting with uneven space distribution.

    Coding & AlgorithmsTechnical Screen
  • Otter.AiMediumSoftware Engineer
    Implement an Arithmetic Expression Evaluator

    This problem tests your ability to parse and evaluate mathematical expressions containing non-negative integers, addition, subtraction, multiplication, and nested parentheses using a stack-based approach or recursion.

    Coding & AlgorithmsTechnical ScreenStackParsingMath
  • Otter.AiMediumSoftware Engineer
    In-Memory Key-Value Store with Nested Transactions

    This problem tests the ability to implement a nested transactional key-value store using stack-based state management and scope shadowing.

    Coding & AlgorithmsTechnical ScreenHash MapStackTransactions
  • Otter.AiEasySoftware Engineer
    Validate Password Against Multiple Rules

    This problem tests your ability to efficiently iterate through a string while maintaining multiple state-based flags to satisfy diverse validation criteria.

    Coding & AlgorithmsTechnical ScreenStringsValidationAlgorithms
  • OuraMediumSoftware Engineer
    Implement Server Number Allocation

    This problem tests your ability to manage and reuse resources efficiently using data structures that allow for logarithmic time allocation and deallocation within partitioned namespaces.

    Coding & AlgorithmsOnline AssessmentData StructuresHeapHash Map
  • PalantirMediumSoftware Engineer
    Apply Item Coupons with Exact Per-Item Cent Rounding

    Implement a checkout calculation engine that applies item-specific coupons to cart lines using exact banker's rounding (round-half-to-even) per unit and returns the final cart total in integer cents.

    Coding & AlgorithmsOnline AssessmentSimulationData StructuresMath
  • PalantirMediumSoftware Engineer
    Design a Real-Time Collision Warning System for Drones in Shared Airspace

    Design a system that ingests live telemetry from many drones sharing airspace and warns operators when two of them are predicted to come too close. It tests streaming ingestion, spatial partitioning, trajectory-based conflict prediction, alert delivery and reliability under the latency and safety demands of a real-time system.

    System DesignOther
  • PalantirEasySoftware Engineer
    Design a Server Metrics Monitor

    This question evaluates knowledge of distributed system design, scheduling and orchestration, concurrency, fault tolerance, and observability in the context of large-scale metric collection.

    System DesignOnsite
  • PalantirMediumSoftware Engineer
    Design a Tool Registration, Discovery and Safe Execution Layer for LLM Agents

    A senior system design question about the platform that lets LLM-driven agents discover and call backend tools. It probes tool registration and discovery, schema definition versus runtime validation of model-generated arguments, the interface between backend services and agents, and patterns for executing actions safely.

    System DesignOther
  • PalantirMediumSoftware Engineer
    Design a compliant multi-tenant analytics platform

    This question tests the ability to design a secure, scalable multi-tenant analytics platform that enforces strict data isolation and fine-grained access control while maintaining rigorous audit trails.

    System DesignOnsiteMulti-tenancySecurityABAC
  • PalantirHardSoftware Engineer
    Design a scalable interview question bank

    Design a scalable interview question bank 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 DesignTechnical Screen
  • PalantirMediumSoftware Engineer
    Discuss logistics and compensation

    Discuss logistics and compensation evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipTechnical Screen
  • PalantirEasySoftware Engineer
    Find Shortest Paths in Road Network

    This question evaluates understanding of graph data structures and shortest-path concepts, including correct modeling of undirected edges, unweighted versus weighted pathfinding, and algorithmic time and space complexity.

    Coding & AlgorithmsOnsite
  • PalantirMediumSoftware Engineer
    Group employees by shared interests

    This question evaluates a candidate's competency in organizing and querying collections, mapping relationships between entities, and reasoning about algorithmic time and space complexity within data structures and grouping operations.

    Coding & AlgorithmsTechnical Screen
  • PalantirMediumSoftware Engineer
    Handle value conflicts and disagreeing with leadership

    This question evaluates ethical judgment, professional disagreement, stakeholder communication, and ownership/accountability within leadership and team contexts for software engineers.

    Behavioral & LeadershipOnsite
  • PalantirEasySoftware Engineer
    Merge K Individually Sorted Integer Arrays Into One Sorted Array

    Merge k integer arrays, each sorted in non-decreasing order, into one sorted array that keeps every duplicate. The interviewer asked for the two-pointer method and divide and conquer, so the problem tests merging sorted sequences and how the cost grows with the number of arrays.

    Coding & AlgorithmsTechnical Screen
  • PalantirMediumSoftware Engineer
    Optimize Coupon Selection Under a Twenty-Point Budget

    Optimize coupon activations under a 20-point budget to maximize monetary savings while handling item/category stacking, savings caps, rounding, and tie-breaking.

    Software Engineering FundamentalsOnline AssessmentAlgorithmsDynamic ProgrammingBit Manipulation
  • PalantirMediumSoftware Engineer
    Reflect on experiences and teamwork

    Reflect on experiences and teamwork evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipTechnical Screen