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 751–780 of 2810 results

  • CommureMediumSoftware Engineer
    Present Your Background and Respond to an AI-Use Concern

    This exercise evaluates your ability to provide a structured professional narrative, demonstrate technical depth through project ownership, and maintain poise when confronted with a challenging, ethical, or unexpected behavioral probe.

    Behavioral & LeadershipTechnical ScreenBehavioralCommunicationEthics
  • ConfluentMediumSoftware Engineer
    Answer standard behavioral prompts

    This set of behavioral prompts evaluates ownership, leadership, communication, judgment, accountability, resilience, and time-management competencies for software engineers.

    Behavioral & LeadershipTechnical Screen
  • ConfluentHardSoftware Engineer
    Design a distributed key-value store at scale

    Design a distributed key-value store at scale 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
  • ConfluentHardSoftware Engineer
    Design a temporary email service

    This question evaluates a candidate's ability to design scalable, highly available, and privacy-focused email ingestion systems, probing competencies in distributed systems, networking (SMTP/MX), storage lifecycle management, rate limiting, security/privacy, and observability.

    System DesignTechnical Screen
  • ConfluentHardSoftware Engineer
    Explain variadic functions

    Explain variadic functions evaluates requirements, assumptions, structured reasoning, trade-offs, and verification 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 FundamentalsTechnical Screen
  • ConfluentMediumSoftware Engineer
    Implement tail N lines

    Confluent software-engineer technical-screen coding question: implement tail(path, N) to print the last N lines of a possibly multi-GB file or an unbounded stream without loading it into memory. It tests a backward block scan for seekable files versus an O(N) ring buffer for non-seekable streams, plus correct handling of \n/\r\n/\r newlines, UTF-8 multibyte characters, missing trailing newlines, and extremely long lines, with follow-ups on tail -f, log rotation/truncation, and the -c last-N-bytes option.

    Coding & AlgorithmsTechnical Screen
  • ConfluentEasySoftware Engineer
    Process pod logs with global increments and pop-min

    This problem tests your ability to manage a collection of values under global update operations while maintaining the ability to efficiently extract the minimum value.

    Coding & AlgorithmsTechnical ScreenHeapsData StructuresAlgorithms
  • ConfluentMediumSoftware Engineer
    Solve constrained monster traversal

    Solve constrained monster traversal 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 & AlgorithmsTechnical Screen
  • CoreweaveEasySoftware Engineer
    Build a Resilient Concurrent Python CLI for Local-Service Lookups

    Design a Python CLI for serial-number lookups with timeout, HTTP, and JSON handling, bounded thread-pool concurrency, and ordered results.

    Software Engineering FundamentalsTechnical Screen
  • CoreweaveMediumSoftware Engineer
    Coordinate Basic Threads and Inspect Them on Linux

    Use basic Python threading primitives for bounded concurrent function calls, exception capture and joining, then inspect native threads with Linux tools.

    Software Engineering FundamentalsTechnical Screen
  • CoreweaveMediumSoftware Engineer
    Design a predicate structure and filter records with comparison, AND and OR

    Design a data structure for predicates that combine greater-than and less-than comparisons with AND and OR, then implement filter(data, predicate) to return the matching items. Tests recursive structure design, extensibility to new operators, evaluation with early exit, and handling of missing fields and type mismatches.

    Software Engineering FundamentalsTechnical Screen
  • CortexMediumSoftware Engineer
    Parse API JSON and print org chart

    This question evaluates HTTP and JSON parsing, CSV processing, hierarchical data modeling, sorting, and algorithmic efficiency for building and printing an organizational chart.

    Coding & AlgorithmsTechnical Screen
  • CostcoMediumSoftware Engineer
    Debug a Google Cloud Web App Where 80% of Users See Only a Loading Spinner

    A production debugging scenario: a web app deployed on Google Cloud loads for only 20% of users while the other 80% see a loading spinner forever. It tests a systematic walkthrough that scopes the failure, gathers browser and server evidence, and tests explanations for the split one at a time.

    Software Engineering FundamentalsTechnical Screen
  • CoupangEasySoftware Engineer
    Find the Closest Value in a Binary Search Tree

    This question tests your ability to traverse a binary search tree efficiently by leveraging its ordering property to find the node value closest to a given target number.

    Coding & AlgorithmsTechnical ScreenBinary Search TreeBinary TreeTree Traversal
  • CourseraHardSoftware Engineer
    Implement Plurality and Runoff Voting

    This question evaluates understanding of voting algorithms, tie-breaking rules, ballot processing, and correctness under edge cases such as incomplete or exhausted ballots, and is commonly asked to assess algorithmic implementation, state simulation, and careful handling of corner cases in interview settings.

    Coding & AlgorithmsTechnical Screen
  • Credit GenieMediumSoftware Engineer
    Implement FastAPI CRUD endpoints from skeletons

    This question evaluates a candidate's ability to implement RESTful CRUD endpoints with FastAPI, focusing on API contract consistency, HTTP status codes and idempotency, input validation and exception handling, and unit testing.

    Software Engineering FundamentalsTechnical Screen
  • Credit GenieMediumSoftware Engineer
    Implement and analyze number-pattern function

    This question evaluates algorithmic thinking and implementation skills related to string construction, time and auxiliary space complexity analysis, and handling boundary/edge-case off-by-one errors.

    Coding & AlgorithmsTechnical Screen
  • Credit GenieMediumSoftware Engineer
    Introduce yourself and show mission alignment

    This question evaluates behavioral and leadership competencies including communication, mission alignment, expectation-setting, and collaborative API/interface ownership within an ML engineering context.

    Behavioral & LeadershipTechnical Screen
  • CrestaMediumSoftware Engineer
    Design sequence decoding with greedy and beam search

    This interview question evaluates core ML concepts, assumptions, math intuition, training/evaluation trade-offs, and practical failure modes in a realistic interview setting. A strong answer for Design sequence decoding with greedy and beam search states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Machine LearningTechnical Screen
  • CrestaMediumSoftware Engineer
    Job Dispatcher with Least-Loaded, Round-Robin Assignment and Executor Removal

    A coding exercise to implement Executor and JobDispatcher classes that send each integer job ID to the executor with the fewest pending jobs, breaking ties round-robin, while executors join and leave. It tests precise tie-break semantics, consistent load tracking, reassigning a removed executor's queued jobs, and edge cases.

    Software Engineering FundamentalsTechnical Screen
  • CrestaEasySoftware Engineer
    Productionize a Successful Proof of Concept

    Explain how to take a successful proof of concept into production, including the engineering and operational gaps that must be closed.

    System DesignTechnical Screen
  • CriblMediumSoftware Engineer
    Design an LLM Log Parsing Workflow

    This question evaluates skills in ML-enabled log parsing, schema inference, structured data extraction, and designing scalable, reliable production workflows that combine probabilistic LLMs with deterministic parsers and operational engineering.

    ML System DesignTechnical Screen
  • CrowdstrikeMediumSoftware Engineer
    Design scalable worker pool for template jobs

    This question evaluates a candidate's competency in designing scalable, concurrent backend systems, covering distributed worker pools, producer–consumer patterns, queuing, load balancing, fault tolerance, backpressure, and domain-specific considerations like template parsing and caching.

    System DesignTechnical Screen
  • CrusoeMediumSoftware Engineer
    Calculate charge with a single price override

    This problem tests your ability to handle overlapping time intervals and apply conditional overrides to calculate the total charge for a billing period.

    Coding & AlgorithmsTechnical ScreenIntervalsArraysLogic
  • CubistMediumSoftware Engineer
    Design a class to submit jobs with dependencies and track their status

    Design and implement a job tracker class that accepts job submissions with dependencies, hands out jobs that are ready to run, and reports each job's status. It tests state-machine design, dependency-graph bookkeeping, handling of failures and cycles, and thread safety when several workers call the class at once.

    Software Engineering FundamentalsTechnical Screen
  • CubistMediumSoftware Engineer
    Design a reusable event-driven framework for trading strategies

    Design a reusable, event-driven framework for trading strategies that a team can keep extending after a take-home handoff. It tests event modeling and dispatch ordering, strategy interfaces, backtest and live parity, order and risk management, and the tests and documentation that make a framework maintainable.

    Software Engineering FundamentalsTechnical Screen
  • CubistMediumSoftware Engineer
    Rebuild a binary search tree from its postorder traversal in linear time

    Rebuild a binary search tree with distinct values from its postorder traversal and return the rebuilt tree's preorder traversal. The problem tests BST ordering properties, traversal orders, and meeting a strict O(n) time bound on inputs that include deeply skewed trees.

    Coding & AlgorithmsTechnical Screen
  • CurrentMediumSoftware Engineer
    Describe a previous project and outcomes

    Describe a previous project and outcomes 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
  • CurrentHardSoftware Engineer
    Design a metrics monitoring system

    Design a metrics monitoring system 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
  • CursorMediumSoftware Engineer
    Build a Merkle Tree over a Directory with Hash Lookup and Tree Diff

    Implement a Merkle tree over a real directory in Python, with N-ary directory nodes, a build method, a hash lookup by path, and a diff that compares two trees, and write the tests yourself. It tests deterministic hashing design, file-system traversal, pruning identical subtrees, and disciplined testing under time pressure.

    Software Engineering FundamentalsTechnical Screen