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 61–90 of 2629 results
- AirtableMediumSoftware EngineerCount business days excluding holidays
This problem tests date manipulation skills and the ability to efficiently calculate working day durations while accounting for dynamic holiday schedules.
Coding & AlgorithmsOnsiteAlgorithmsDate-TimeOptimization - AirtableMediumSoftware EngineerImplement BFS serializer and deserializer
This question evaluates the skill of serializing and deserializing Python object graphs using BFS, including handling primitives, dictionaries, shared subobjects, and circular references while preserving object identity.
Coding & AlgorithmsOnsite - AirwallexMediumSoftware EngineerFind All Index Quadruples Summing to a Target Without Losing Positions
Given an integer array and a target, return every quadruple of original indices i < j < k < l whose values sum to the target, in lexicographic order. Tests an efficient search beyond brute force, index-based deduplication, overflow awareness and handling of repeated values without losing positions.
Coding & AlgorithmsTechnical Screen - AirwallexMediumSoftware EngineerLargest Square of Ones
Tests dynamic programming on a 2D grid, specifically optimizing state transitions to achieve O(n) auxiliary space.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingMatrixSpace Optimization - Akuna CapitalMediumSoftware EngineerCompute max profit across dated stock quotes
This question evaluates a candidate's ability to reason about time-series and transaction-constrained optimization, including handling unsorted inputs, duplicate records, and constructing an explicit sequence of trades under ordering and no-short-selling constraints.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerCompute min operations to transform integers
This question evaluates algorithmic problem-solving skills related to integer transformations and reasoning about sequences of allowed operations, focusing on optimizing the number of steps. It is commonly used in the Coding & Algorithms domain to assess practical application of algorithmic thinking and time-complexity analysis, testing efficiency reasoning rather than purely conceptual knowledge.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerDesign two-user communications handler with exceptions
This question evaluates object-oriented design, state management, and custom exception handling skills for enforcing a single active communication pair and related invariants between two users.
Coding & AlgorithmsHR Screen - Akuna CapitalMediumSoftware EngineerHeapify an array into a max-heap
This question evaluates understanding of heap data structures and the in-place bottom-up heapify algorithm for building a max-heap on a 0-indexed array, testing skills in array manipulation, heap invariants, and algorithmic reasoning.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerImplement a ring buffer
This question evaluates implementation skills for fixed-capacity circular buffers and competency in array-based data structures, including O(1) push/pop/peek/isEmpty/isFull/size operations and logical-order iteration.
Coding & AlgorithmsTechnical Screen - Akuna CapitalHardSoftware EngineerMaximize Distinct Values with Cross-Array Swaps
This problem tests greedy strategy optimization and frequency counting to maximize the count of unique elements across two arrays after a limited number of swaps.
Coding & AlgorithmsTechnical ScreenGreedyArraysHashing - Akuna CapitalHardSoftware EngineerMinimum Movement Cost to Segregate Binary Digits
This problem tests greedy algorithm design and sequence optimization by calculating the cumulative distance required to shift all '1's to the end of a binary string.
Coding & AlgorithmsTechnical ScreenGreedyStringsArrays - Akuna CapitalMediumSoftware EngineerSolve swaps, graph paths, and movie DP
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve swaps, graph paths, and movie DP states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerSolve three C++ algorithmic tasks
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve three C++ algorithmic tasks states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerTrace code and find frequent character
Trace code and find frequent character 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 & AlgorithmsOnline Assessment - AlibabaMediumSoftware EngineerFixed-Capacity Cache That Evicts the Least Frequently Used Key, Ties by Recency
Build a fixed-capacity key-value cache that evicts the key with the fewest uses, breaking ties by least recent use, and replay a sequence of get and put operations to return each read result. It tests careful per-key frequency and recency tracking with constant average time per operation.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerAdd One Source to Minimize Grid Inconvenience
Minimize the worst inconvenience in a binary grid by adding one colored source. Movement is allowed in eight directions, and the solution must handle grids that begin with no source at all.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerAnswer a large batch of variable-ratio queries from division equations
Given division equations between named variables and their values, answer a large batch of ratio queries, returning -1.0 whenever a ratio cannot be determined. It tests chaining ratios through shared variables, handling unknown and disconnected variables, and reusing work across many queries, the scale follow-up raised in the interview.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerAnswer two coding questions (SQL and DP)
This problem tests SQL data aggregation skills with NULL handling and algorithmic proficiency in dynamic programming to count palindromic subsequences in a string.
Coding & AlgorithmsTechnical ScreenSQLDynamic ProgrammingAggregation - AmazonMediumSoftware EngineerBuild a BFS Web Crawler
This question evaluates understanding of breadth-first traversal, URL normalization, domain scoping, duplicate detection, and retry/error handling, measuring algorithmic design and robustness in networked code.
Coding & AlgorithmsTechnical Screen - AmazonHardSoftware EngineerBuild a Searchable Sentence Index
This problem tests your ability to design an in-memory inverted index for text retrieval, requiring efficient tokenization, case-insensitive mapping, and dynamic updates to a collection of sentences.
Coding & AlgorithmsOnsiteHash MapsInverted IndexData Structures - AmazonHardSoftware EngineerBuild an LRU Cache with a Hash Map and Linked List
This problem tests your ability to design a cache with O(1) time complexity for both get and put operations by combining a hash map with a doubly linked list.
Coding & AlgorithmsHR ScreenHash MapLinked ListDesign - AmazonMediumSoftware EngineerBuild the Largest Available Sequence
This problem tests your ability to use a greedy approach combined with a frequency map to construct the lexicographically largest sequence under specific constraints.
Coding & AlgorithmsOnline AssessmentGreedyPriority QueueFrequency Map - AmazonMediumSoftware EngineerCaesar Cipher with Translation-Table Optimization
This question tests string manipulation, modular arithmetic, and the ability to optimize performance by trading space for time using a precomputed lookup table.
Coding & AlgorithmsTechnical ScreenStringsOptimizationAlgorithms - AmazonMediumSoftware EngineerCalculate Circular Route Query Distance
This question evaluates a candidate's ability to reason about circular arrays, distance computations, and query-efficient algorithms, assessing concepts such as modular indexing and cumulative distances.
Coding & AlgorithmsTechnical Screen - AmazonEasySoftware EngineerCheck a Palindrome While Ignoring Case and Punctuation
Tests string manipulation and two-pointer traversal techniques to verify if a string is a palindrome while ignoring non-alphanumeric characters and case.
Coding & AlgorithmsTechnical ScreenStringsTwo PointersEasy - AmazonMediumSoftware EngineerCheck path in N-ary tree
This question evaluates understanding of tree traversal and sequence matching in N-ary trees, including handling non-unique node values and maintaining traversal state across branches.
Coding & AlgorithmsOnsite - AmazonHardSoftware EngineerCircular Drone Hub Delivery Route
This question evaluates a candidate's ability to work with circular array structures and prefix sums to compute shortest distances on a ring topology. It tests practical coding skill in efficiently handling wraparound arithmetic and cumulative sums, a common pattern in algorithm interviews assessing array manipulation and optimization under scale constraints.
Coding & AlgorithmsOnline Assessment - AmazonMediumSoftware EngineerCompute Edit Distance
Tests dynamic programming and string manipulation by calculating the minimum number of single-character edits (insertions, deletions, substitutions) needed to transform one string into another.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingStringsAlgorithms - AmazonMediumSoftware EngineerCompute Latencies and Search Grid Path
This question evaluates parsing and processing of timestamped event logs to compute message latencies and implementation of constrained grid path search, testing competencies in file I/O, record alignment/matching, time-delta computation, graph traversal, and stateful backtracking.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCompute delay times in priority array
This question evaluates algorithmic efficiency in array processing, specifically reasoning about nearest-smaller relationships and the use of auxiliary structures to achieve subquadratic performance.
Coding & AlgorithmsOnline Assessment
Airtable
Airwallex
Akuna Capital
Alibaba
Amazon