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 3121–3150 of 5874 results

  • MetaMediumSoftware Engineer
    Compute longest rising path in a grid

    This question evaluates mastery of graph traversal, dynamic programming, and complexity analysis for computing longest increasing paths in a matrix, focusing on algorithmic correctness and efficient use of time and space.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute max profit from single stock trade

    This question evaluates a candidate's ability to design efficient array algorithms, reason about time and space complexity constraints, and handle edge cases related to single-transaction profit calculation.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute nested depth-weighted sum

    This question evaluates understanding of tree-like nested data structures, traversal strategies (recursive DFS and iterative approaches), handling of edge cases such as empty lists and negative integers, and algorithmic reasoning about time and space complexity within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute sparse dot product and count islands

    This question evaluates competency in designing efficient algorithms for sparse data representations and for identifying connected components in grids, testing skills in handling large inputs, memory-efficient representations, and traversal/graph concepts.

    Coding & AlgorithmsTechnical Screen
  • MetaHardSoftware Engineer
    Compute the Dot Product of Sparse Vectors

    Compute the dot product of two sparse vectors stored as sorted index-value pairs without expanding them. A two-pointer traversal should visit only nonzero entries, multiply matching indices, and accumulate safely in a wide integer type.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Compute unmatched parentheses length

    This problem tests your ability to use stack-based logic to track balanced sequences and identify the length of characters that remain unmatched after processing all valid pairs.

    Coding & AlgorithmsOnsiteStringStackGreedy
  • MetaMediumSoftware Engineer
    Compute vertical order of a BST

    This question evaluates understanding of binary tree traversals and coordinate-based ordering, including tie-breaking by breadth-first visitation order, plus competency in algorithmic time and space complexity analysis and strategies for handling deep recursion and streaming large inputs.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Compute weighted sum of nested lists

    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 weighted sum of nested lists states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Convert BST to sorted doubly list

    This question evaluates understanding of binary search tree properties, in-order traversal, in-place pointer manipulation, and algorithmic complexity when converting tree nodes into a sorted doubly linked list.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Count Distinct Values in a Sorted Array When K Is Small

    Count distinct values in a sorted array efficiently when the number of unique values is much smaller than the array length. The challenge tests adapting complexity to output diversity rather than raw length, meeting an O(k log n) target with constant auxiliary space, and handling empty or uniform arrays.

    Coding & AlgorithmsOnsite
  • MetaMediumSoftware Engineer
    Count Subarrays with a Target Sum

    Tests the ability to use prefix sums and hash tables to count contiguous subarrays summing to a target in linear time, handling negative values and zeros.

    Coding & AlgorithmsOnsitearraysprefix-sumhash-table
  • MetaMediumSoftware Engineer
    Count palindrome substrings in a string

    This question evaluates proficiency in string algorithms, algorithmic design, and complexity analysis by targeting palindromic substring counting, string manipulation, and conceptual linear-time techniques.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Count subarrays equal to target

    This problem tests your ability to use a hash map to track prefix sums, allowing for an efficient solution to a subarray counting problem.

    Coding & AlgorithmsTechnical ScreenArrayHash MapPrefix Sum
  • MetaMediumSoftware Engineer
    Count subarrays summing to target

    This question evaluates understanding of prefix-sum concepts, use of linear-time data structures, and competence in handling negative numbers and edge cases such as zero targets and empty prefixes.

    Coding & AlgorithmsTechnical Screen
  • MetaHardSoftware Engineer
    Count three-digit numbers with distinct digits

    This problem tests your ability to count numbers satisfying digit-based constraints within a specific range using combinatorial logic or efficient iteration.

    Coding & AlgorithmsOnsiteMathCombinatoricsImplementation
  • MetaMediumSoftware Engineer
    Debug and optimize React performance issues

    This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Debug and optimize React performance issues states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignTechnical Screen
  • MetaMediumSoftware Engineer
    Decide palindrome within k deletions

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

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Demonstrate communication and teamwork

    This set of behavioral prompts evaluates communication, teamwork, leadership, stakeholder explanation, conflict resolution, and self-reflection skills relevant to a software engineer role.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Derive max distinct frequencies for n items

    The question evaluates combinatorial reasoning, discrete mathematics, and constructive extremal analysis by asking for the maximum number of distinct frequency counts in an array and a matching construction.

    Statistics & MathTechnical Screen
  • MetaEasySoftware Engineer
    Describe background and job motivations

    This question evaluates communication, self-awareness, motivation, and cultural-fit competencies within the Behavioral & Leadership domain for a Software Engineer role.

    Behavioral & LeadershipHR Screen
  • MetaMediumSoftware Engineer
    Describe conflict resolution and initiative

    This question evaluates conflict resolution, initiative, ownership, influence, and learning from failure within a Behavioral & Leadership context for a software engineer.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Describe conflict resolution and leadership

    This question evaluates conflict resolution, leadership, cross-team collaboration, stakeholder management, and senior-level ownership and communication competencies in the Behavioral & Leadership category within the software engineering domain.

    Behavioral & LeadershipTechnical Screen
  • MetaHardSoftware Engineer
    Describe conflict resolution and mentoring experiences

    Prepare engineering manager or senior engineer behavioral answers for conflict resolution, proud projects, self-reflection, and mentoring. Includes STAR structures, sample story patterns, and pitfalls.

    Behavioral & LeadershipOnsite
  • MetaMediumSoftware Engineer
    Describe cross-team collaboration and learning from failure

    This question evaluates a software engineer's proficiency in cross-team collaboration, conflict and constraint management, ownership alignment, and reflective learning from project failure, emphasizing interpersonal, leadership, and accountability competencies.

    Behavioral & LeadershipOnsite
  • 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 resolving conflict by persuading others

    This question evaluates persuasion, conflict-resolution, communication, and stakeholder-management competencies and falls within the Behavioral & Leadership domain.

    Behavioral & LeadershipOnsite
  • 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 24-Hour Ephemeral Stories for a Photo and Video Sharing App

    A system design question on ephemeral stories that followers can view for 24 hours before they disappear, covering media upload, the tray of accounts with unwatched stories, playback, and viewer tracking. It tests expiry semantics, fan-out for popular authors, watched-state storage, and media delivery.

    System DesignOnsite
  • MetaHardSoftware Engineer
    Design Boolean Search for Status Posts

    This problem tests the ability to design an inverted index system that supports complex logical queries, high-concurrency updates, and consistent pagination over a distributed dataset.

    System DesignOnsiteInverted IndexSearchDistributed Systems
  • MetaMediumSoftware Engineer
    Design Boolean Search over User Status Posts

    This problem tests the design of a scalable inverted index system capable of handling boolean queries (AND/OR/NOT) over a high-throughput stream of user status updates.

    System DesignOnsiteInverted IndexBoolean SearchConcurrency