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 1351–1380 of 2336 results

  • MetaMediumSoftware Engineer
    Find shortest subarray with range ≥ k

    This question evaluates proficiency with array algorithms and range-query reasoning, testing understanding of max/min behavior over contiguous subarrays and use of appropriate data-structure techniques; it belongs to the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Find shortest substring with N unique characters

    This question evaluates proficiency in string processing, handling character-uniqueness constraints, and algorithmic thinking about time and space efficiency.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Find the Unique Pair of Array Indices Whose Values Sum to a Target

    Given an integer array and a target, return the indices of the only pair of different elements whose values add up to the target, smaller index first. Arrays hold up to 10,000 values of up to one billion in magnitude, and the task is a common warm-up that tests clean, efficient array reasoning.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Find top-K frequent elements in a stream

    This question evaluates understanding of streaming algorithms, frequency estimation, and data-structure-based top-K selection, emphasizing space/time and accuracy trade-offs when processing large or unbounded data.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Group Binary Tree Nodes by Vertical Column, Top to Bottom and Left to Right

    Return a binary tree's node values grouped by vertical column from left to right, ordering each column top to bottom and breaking ties within a row by left-to-right position. The tree arrives as a level-order list, and the task tests coordinate tracking during traversal and precise tie handling.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Handle conflict and missed delivery deadlines

    This question evaluates interpersonal competencies such as conflict resolution, relationship management, communication, ownership, and accountability in scenarios involving missed delivery deadlines and team dynamics.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Handle feedback and priority conflicts

    Handle feedback and priority conflicts 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 & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Handle priority conflicts, setbacks, and initiatives

    This question evaluates interpersonal and leadership competencies—communication and influence, structured decision-making and tradeoff reasoning, ownership and accountability, a learning mindset, and the ability to execute through ambiguity and cross-functional constraints.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    How to answer Staff (L6) behavioral interview questions

    These behavioral prompts evaluate leadership competencies including setting technical direction, stakeholder management, influence without formal authority, trade-off analysis, and mentoring at an organization-wide (Staff/L6) level within the Behavioral & Leadership domain for senior software engineers.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Impact and Conflict Stories for a Level-Calibrating Behavioral Interview

    A behavioral interview asking for a story about your most impactful work and a story about a significant conflict, in a round that weighs heavily in level calibration. It tests scope, ownership, measurable results, handling disagreement constructively, and how well stories hold up under follow-up probing.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Implement basic expression evaluator

    This question evaluates proficiency in expression parsing, operator precedence handling, integer arithmetic semantics (including truncating division), and efficient tokenization and evaluation within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Implement sparse vector dot product

    Meta's sparse vector dot product question asks you to design a SparseVector class that stores only non-zero entries and computes dot products in time proportional to the number of non-zeros rather than the full vector length. It tests sparse data representation, two-pointer vs. hash-map trade-offs, and time/space complexity analysis.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Implement weighted random index picker

    Implement weighted random index picker 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 & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Infer an Unknown Alphabet Order

    This question evaluates a candidate's competency in graph-based reasoning, inference of ordering constraints from sequences of strings, and algorithmic manipulation of characters and relations.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Longest Balanced Substring in a String of Parentheses

    A Meta coding interview problem: given a string made only of opening and closing parentheses, return the length of the longest contiguous substring that is correctly balanced. It tests careful handling of matched pairs, unmatched characters that break a run, and efficient processing of long inputs.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Maximize Unique Characters from Words

    This question evaluates a candidate's ability to reason about combinatorial constraints and set disjointness while maximizing unique coverage, testing competencies in algorithm design, combinatorics, and constraint-based optimization.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Maximize number with one digit swap

    Maximize number with one digit swap 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 & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Maximize score in 15-sum card game

    This problem tests your ability to use memoized recursion or dynamic programming to explore state spaces in a combinatorial game where you must decide which cards to remove to maximize your total score.

    Coding & AlgorithmsOnsiteRecursionMemoizationBacktracking
  • MetaMediumSoftware Engineer
    Merge Two Lists of Non-Overlapping Intervals

    This question evaluates a candidate's ability to merge two pre-sorted, non-overlapping interval lists into a single consolidated set, a core array and two-pointer/merging skill in coding interviews. It tests correct handling of edge cases like touching endpoints versus true gaps, assessing precision in interval logic and algorithmic reasoning under linear-time constraints.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Merge overlapping intervals

    This problem tests your ability to manipulate array-based data by sorting and performing linear sweeps to consolidate overlapping ranges.

    Coding & AlgorithmsOnsiteArraysSortingGreedy
  • MetaMediumSoftware Engineer
    Minimum Round-Trip Flight Cost

    This question evaluates a candidate's ability to optimize over paired sequences using array traversal and running-minimum tracking, a core array-processing technique in coding interviews. It tests practical application of single-pass optimization under an ordering constraint rather than brute-force pairwise comparison, commonly used to assess algorithmic efficiency and edge-case handling.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Move Work Forward Across Teams

    This question evaluates your ability as a senior engineer to drive cross-functional alignment, manage complex technical dependencies, and deliver impact across multiple teams with competing priorities.

    Behavioral & LeadershipOnsiteBehavioralCross-Team CollaborationLeadership
  • MetaHardSoftware Engineer
    Navigate Stakeholder Conflict During a Compressed Delivery Timeline

    Describe a project where a deadline moved earlier and stakeholders disagreed about what should ship. Explain how you exposed the conflict, tested a failing approach, incorporated senior feedback, changed course, and used a concrete result to assess the compromise.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Prepare answers for core behavioral questions

    This question set evaluates interpersonal and leadership competencies such as communication, conflict resolution, giving and receiving feedback, problem-solving, ownership, handling ambiguity, and the ability to articulate measurable impact and self-awareness.

    Behavioral & LeadershipOnsite
  • MetaHardSoftware Engineer
    Resolve Ambiguous Requirements Before Building

    Tests your ability to drive clarity and make responsible engineering progress when assigned a critical project with underspecified or conflicting requirements.

    Behavioral & LeadershipOnsiteBehavioralRequirements AmbiguityStakeholder Alignment
  • MetaMediumSoftware Engineer
    Resolve a cd Path Against the Current Directory

    Implement simplified Unix-style cd path resolution for absolute and relative inputs containing repeated separators, dot components, and parent-directory steps. The challenge focuses on component semantics, root boundaries, empty arguments, exact normalization, and linear processing of long paths without filesystem lookups.

    Coding & AlgorithmsOnsite
  • MetaHardSoftware Engineer
    Respond to Critical Feedback and Show the Change

    This question assesses a candidate's ability to handle constructive criticism professionally, their capacity for self-reflection, and their demonstrated commitment to measurable professional growth.

    Behavioral & LeadershipOnsiteBehavioralLeadershipGrowth Mindset
  • MetaMediumSoftware Engineer
    Return a Shortest Path Through a Binary Grid

    Implement breadth-first search on an 8-directional binary grid to find and reconstruct a deterministic shortest path from the top-left to the bottom-right cell.

    Coding & AlgorithmsOnsiteBFSGraphMatrix
  • MetaMediumSoftware Engineer
    Return all root-to-leaf path sums

    This question evaluates competency in binary tree traversal and path-state accumulation, focusing on the ability to compute sums along root-to-leaf paths while handling edge cases like empty trees and negative values.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Return right and left side views of a tree

    This problem tests your ability to perform level-order traversal on a binary tree and manipulate the results to extract the boundary nodes.

    Coding & AlgorithmsOnsiteBinary TreeBFSDFS