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 1441–1470 of 2810 results

  • 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
  • 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
  • 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 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
  • 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
    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
  • 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
  • MetaMediumSoftware Engineer
    Design LCA and find K closest points

    This question evaluates understanding of tree algorithms (LCA using parent pointers) and selection algorithms (sorting, max-heap, quickselect), emphasizing data structures, algorithmic correctness, and time/space complexity within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Design Search And Web Crawling Systems

    This question tests the ability to design a scalable web crawler capable of handling billions of pages while maintaining freshness and avoiding redundant work.

    System DesignTechnical ScreenDistributed SystemsWeb CrawlingScalability
  • MetaMediumSoftware Engineer
    Design a Concurrent, Memory-Bounded Tally Service

    This problem tests the ability to design a high-throughput, memory-efficient data structure for time-series counting that balances concurrency, accuracy, and storage constraints.

    Software Engineering FundamentalsTechnical ScreenConcurrencyTime-SeriesData-Structures
  • MetaEasySoftware Engineer
    Design a String Calculator with Explicit Grammar and Evaluation Rules

    This problem tests the ability to implement a parser for basic mathematical expressions, specifically focusing on handling operator precedence and parentheses using a stack-based approach.

    Software Engineering FundamentalsTechnical ScreenStacksParsingAlgorithms
  • MetaEasySoftware Engineer
    Design a Trade Ledger Class

    This problem evaluates your ability to design a class interface that maintains an ordered collection of events and allows efficient retrieval based on time-based criteria.

    Software Engineering FundamentalsTechnical ScreenData StructuresAPI DesignBinary Search
  • MetaHardSoftware Engineer
    Design a bank system with scheduling and rankings

    Design a bank system with scheduling and rankings 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
  • MetaMediumSoftware Engineer
    Design a mini banking system

    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 Design a mini banking system states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    System DesignTechnical Screen
  • MetaMediumSoftware Engineer
    Design a ranking and recommendation system

    This problem tests your ability to design a multi-stage recommendation pipeline that balances low-latency retrieval with high-precision ranking at scale.

    System DesignTechnical ScreenMachine LearningRecommendation SystemsScalability
  • MetaMediumSoftware Engineer
    Design a real-time ad impression aggregator

    This question evaluates a candidate's ability in scalable real-time system design, covering competencies such as stream processing, event aggregation, time-windowed metrics, handling late and out-of-order events, and designing for very high write throughput.

    System DesignTechnical Screen
  • MetaHardSoftware Engineer
    Design a scalable banking system

    This problem tests your ability to design a distributed, high-concurrency ledger system that maintains strict consistency and atomicity for financial transactions.

    System DesignTechnical ScreenDistributed SystemsACIDDatabase Design
  • MetaHardSoftware Engineer
    Design an Automated Ticket Investigation Agent

    This question evaluates a candidate's ability to design AI-enabled agentic systems for automated ticket investigation, covering competencies in ticket understanding, classification and prioritization, multi-source evidence retrieval (logs, metrics, traces, documentation), root-cause diagnosis, remediation orchestration, and human-in-the-loop safety controls. It is commonly asked in the ML system design domain to assess architectural and integration thinking, data retrieval and evaluation strategies, production monitoring and safety considerations, and tests both high-level conceptual architecture and practical application-level implementation concerns.

    ML System DesignTechnical Screen
  • MetaHardSoftware Engineer
    Design an Online Game Leaderboard

    A Meta software-engineer system-design screen: design the backend for an online game leaderboard supporting score recording, a global top-N board, a friends board, a player's rank and nearby players, and daily/weekly/seasonal/all-time windows at high write volume and low read latency. The model answer separates a durable score event log from an in-memory sorted ranking store, computes the friends board on read, and covers tie-breaking, caching, sharding, consistency trade-offs, anti-cheat, and rebuilds.

    System DesignTechnical Screen