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 3091–3120 of 5874 results

  • MergeMediumSoftware Engineer
    Org Chart from a Reporting List: Count Orgs, Print by Level, Find a Common Manager

    Given a company's employees as (id, title, reports_to) tuples with heads reporting to None, count the separate orgs, print employees level by level, and find the first manager two employees share. It tests building a tree from manager pointers, level-order traversal, ancestor queries and edge cases under a tight time limit.

    Software Engineering FundamentalsTechnical Screen
  • MetaMediumSoftware Engineer
    Add Two Arbitrarily Long Non-Negative Integers Given as Decimal Strings

    Add two non-negative integers that are given as decimal digit strings, possibly thousands of digits long, and return the sum as a string without converting to built-in numbers. Tests digit-by-digit addition with carries, inputs of unequal length and canonical output without leading zeros.

    Coding & AlgorithmsOther
  • MetaHardSoftware Engineer
    Analyze Minimum Completion Time for Target Courses in a Prerequisite DAG

    Analyze the minimum time needed to finish target courses and only their transitive prerequisites in a DAG. Distinguish total study effort from elapsed time with parallel courses, count shared prerequisites once, exclude unrelated nodes, and detect reachable cycles.

    Software Engineering FundamentalsOnsite
  • MetaHardSoftware Engineer
    Answer Repeated Range Aggregate Queries on a Static BST

    Preprocess a sorted array derived from a static BST to answer many inclusive range queries. Use binary-search boundaries and wide prefix sums to return both the sum and count for each range without rescanning the tree.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Answer conflict, ambiguity, feedback, difficult coworker prompts

    This question evaluates a candidate's ability to handle conflict with supervisors, clarify ambiguous requirements, provide constructive feedback and mentorship, and manage difficult collaborators.

    Behavioral & LeadershipTechnical Screen
  • MetaMediumSoftware Engineer
    Answer four string/array/battery coding questions

    This set of four problems evaluates algorithmic competencies including ASCII string processing and character classification, array transformation and operation-count reasoning, cost-minimization for enforcing monotonicity under only-increase constraints, and time-based simulation of resource scheduling with recharge cycles.

    Coding & AlgorithmsOnsite
  • MetaHardSoftware Engineer
    Answer key behavioral prompts effectively

    This set of behavioral prompts evaluates ownership, communication, conflict resolution, adaptability, and the ability to receive and act on feedback, targeting leadership and interpersonal competencies relevant to software engineering.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Behavioral: Acting on Critical Manager Feedback and a Simplification Beyond Your Depth

    A senior behavioral question on growth: explain how you handled critical feedback from your manager, and a time you tried to simplify something before you understood it well enough. It tests self-awareness, learning speed and how you turn a misstep into lasting changes in your habits.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Behavioral: Cross-Functional Disagreement and a Manager Conflict You Got Wrong

    A senior behavioral question on conflict: describe a significant disagreement with a partner from another function and a conflict with your manager in which you turned out to be wrong. It tests how you raise disagreement, argue from evidence, change your mind gracefully and protect working relationships.

    Behavioral & LeadershipTechnical Screen
  • MetaMediumSoftware Engineer
    Behavioral: Managing Shifting Priorities and Changing Approach Mid-Project

    A senior behavioral question on prioritization and adaptability: how you manage several competing priorities, whether you prefer shifting or steady work, and a project where you had to change approach midway. It probes trade-off reasoning, stakeholder communication and recognizing when to change course.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Behavioral: Your Highest-Impact Project and an Innovation You Did Not Plan

    A senior behavioral question pairing two prompts: walk through the most impactful project you have worked on, and a time you came up with an innovation you had not set out to create. It probes scope beyond your own team, ownership of ambiguous problems, measurable outcomes and what the experience changed in how you work.

    Behavioral & LeadershipTechnical Screen
  • MetaMediumSoftware Engineer
    Build a FastAPI summarization service

    This question evaluates web API development and backend engineering competencies, including FastAPI usage, Python type hints, Pydantic-based request/response validation, error handling, in-memory state management, and modular router/service/model layering, and it belongs to the Coding & Algorithms category with a focus on backend web service and API design. It is commonly asked to assess practical ability to deliver production-ready REST endpoints with proper validation and error handling under constrained resources, and the level of abstraction required is primarily practical implementation with attention to architectural design.

    Coding & AlgorithmsOnsite
  • MetaHardSoftware Engineer
    Build a Mistral-powered RAG agent

    This question evaluates a candidate's ability to design and implement a retrieval-augmented generation (RAG) system using a large language model API, including document ingestion, chunking, vector indexing and retrieval, streaming completions, service interfaces (CLI and HTTP), and resilience features like retries, persistence, and structured error handling. Commonly asked in the ML System Design domain to assess practical engineering and architectural reasoning, it tests API integration, production-readiness (configuration, error handling, persistence, and testing) and emphasizes practical application with conceptual understanding of retrieval trade-offs.

    ML System DesignOnsite
  • MetaMediumSoftware Engineer
    Canonicalize an Absolute Unix-Style Path With Dot and Double-Dot Segments

    Convert an absolute Unix-style file path into its canonical form by collapsing repeated slashes, dropping single-dot segments, resolving double-dot segments against the parent directory, and treating other dot sequences as ordinary names. It tests careful string parsing and edge cases such as the root directory.

    Coding & AlgorithmsOnsite
  • MetaHardSoftware Engineer
    Check Whether Deleting at Most K Characters Can Form a Palindrome

    Determine whether a string can be transformed into a palindrome by removing at most k characters. Tests dynamic programming, palindrome properties, and recursive search with branch bounding.

    Coding & AlgorithmsOnsiteDynamic ProgrammingTwo PointersString
  • MetaEasySoftware Engineer
    Check Whether a Letters-and-Numbers Abbreviation Matches a Word

    Decide whether an abbreviation made of lowercase letters and decimal skip counts matches a given word, where each number skips that many characters and any number with a leading zero is invalid. It tests careful string scanning, multi-digit number parsing and end-of-input boundary checks.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Choose the Cheapest Round Trip

    This problem tests the ability to optimize a two-step decision process by maintaining track of the best previous state, requiring a linear scan approach.

    Coding & AlgorithmsOnsiteArraysGreedyOptimization
  • MetaHardSoftware Engineer
    Choose the Longest Set of Words with No Repeated Characters

    Tests bitmask representation, backtracking with pruning, and combinatorial optimization under character-uniqueness constraints.

    Coding & AlgorithmsOnsitebitmaskbacktrackingdepth-first-search
  • MetaMediumSoftware Engineer
    Clone list with random pointers

    Meta software-engineer technical-screen coding question: deep-copy a singly linked list whose nodes carry an arbitrary random pointer (which may be null, point backward, or form cycles). It tests both the O(n)-space hash-map solution and the O(1)-auxiliary-space in-place weaving technique, plus reasoning about pointer integrity, cycle safety, and verifying the copy is structurally equal to and isolated from the original.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Combine Many Sorted Integer Arrays into One Non-Decreasing Array

    A coding question asking you to merge many integer arrays, each already sorted in non-decreasing order, into a single sorted array that keeps every duplicate value. It tests multi-way merging, efficiency as the number of input arrays grows, and edge cases such as empty inputs and arrays of different lengths.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Compute BST range sum

    This question evaluates understanding of binary search tree properties, traversal techniques, and the ability to implement both recursive and iterative algorithms while reasoning about time and space complexity.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Compute Exclusive Execution Times

    This problem tests your ability to manage state in nested processes using a stack data structure to track the exclusive execution time of functions based on a log of start and end events.

    Coding & AlgorithmsTechnical ScreenStackString ParsingSimulation
  • MetaEasySoftware Engineer
    Compute Range Sum Quickly

    This question tests the ability to trade preprocessing time for query performance using prefix sum arrays to efficiently calculate the sum of elements within a specified range.

    Coding & AlgorithmsTechnical ScreenPrefix SumArraysOptimization
  • MetaEasySoftware Engineer
    Compute Sliding Window Averages

    This question tests the ability to implement a sliding window algorithm to compute the average of contiguous subarrays, emphasizing optimization of time complexity.

    Coding & AlgorithmsTechnical ScreenSliding WindowArraysOptimization
  • MetaMediumSoftware Engineer
    Compute Stock Profit with One or Unlimited Transactions

    Compute maximum stock profit for both one transaction and unlimited nonoverlapping transactions in linear time, returning zero when no positive trade is available.

    Coding & AlgorithmsOnsite
  • MetaEasySoftware Engineer
    Compute an Overnight Alarm Interval

    This problem tests the ability to calculate time intervals across date rollovers by converting 12-hour clock times into a continuous 24-hour linear timeline.

    Statistics & MathHR ScreenMathDate-TimeAlgorithms
  • MetaMediumSoftware Engineer
    Compute binary tree diameter

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute binary tree diameter states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute interval mode, BST range sum, exclusive time

    This multipart question evaluates proficiency in interval coverage and frequency analysis, binary search tree range-sum queries with preprocessing for repeated queries, and exclusive-time computation from call logs, covering concepts such as event counting/sweep-line, BST traversal and augmentation, and nested-call time accounting.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute left and right views once

    This question evaluates understanding of binary tree traversal, depth tracking, and view computation for left and right perspectives, plus the ability to implement a concurrent single-pass traversal while handling edge cases such as empty trees and duplicate keys.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute longest increasing path in a matrix

    Compute longest increasing path in a matrix 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