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 361–390 of 2629 results
- AppleMediumSoftware EngineerImplement a FIFO Queue Using Two Stacks
This problem tests the ability to adapt data structure behaviors by implementing a First-In-First-Out (FIFO) queue using only Last-In-First-Out (LIFO) stacks.
Coding & AlgorithmsOnsiteData StructuresStacksQueues - AppleMediumSoftware EngineerImplement a debounce function
This problem tests your understanding of JavaScript closures, asynchronous timers, and the ability to maintain internal state across multiple function invocations.
Coding & AlgorithmsTechnical ScreenJavaScriptClosuresAsynchronous - AppleHardSoftware EngineerImplement a lazy inorder traversal iterator
This problem tests your ability to implement a binary tree iterator that performs inorder traversal using O(h) extra space, where h is the height of the tree, while maintaining an amortized time complexity of O(1) per call.
Coding & AlgorithmsTechnical ScreenTreesIteratorStack - AppleMediumSoftware EngineerImplement a robust socket message reader
This question evaluates understanding of socket programming, stream message framing, internal buffer management, EOF and error handling, input size limits, unit testing, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerImplement deep clone for complex objects
This question evaluates mastery of deep object cloning, reference and memory management, and knowledge of language runtime details such as prototypes, property descriptors, symbol-keyed and non-enumerable properties, and built-in types like Maps, Sets, Dates, RegExps, and typed arrays.
Coding & AlgorithmsTechnical Screen - AppleEasySoftware EngineerImplement flood fill using BFS and DFS
This question tests the ability to implement graph traversal algorithms (BFS and DFS) on a 2D grid, focusing on boundary conditions and state management.
Coding & AlgorithmsTechnical ScreenGraphBFSDFS - AppleMediumSoftware EngineerImplement rotation, LRU cache, streaming median, cycle detection
This question evaluates understanding of array/matrix manipulation, cache and data structure design, streaming algorithms for median maintenance, and graph theory for cycle detection, with emphasis on algorithmic complexity analysis and handling of edge cases.
Coding & AlgorithmsOnsite - AppleMediumSoftware EngineerMaximize funds with capital-gated projects
Maximize funds with capital-gated projects 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 - AppleMediumSoftware EngineerMerge Two Strings Using the Longest Edge Overlap
Compare both suffix-to-prefix concatenation orders, merge the longest edge overlap, and favor the original string order when overlap lengths tie.
Coding & AlgorithmsOnline Assessment - AppleMediumSoftware EngineerMerge overlapping time intervals
This problem tests your ability to manipulate array-based data using sorting and linear scanning to identify and merge overlapping intervals.
Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy - AppleHardSoftware EngineerMinimum Cells to Bridge a Magic Grid
Tests graph modeling and shortest-path optimization on a 2D grid with zero-weight transitions and unit-weight bridges using 0-1 BFS or Dijkstra's algorithm.
Coding & AlgorithmsTechnical ScreenGraph0-1 BFSMatrix - AppleMediumSoftware EngineerMultiply Two Sparse Matrices
This problem tests your ability to optimize matrix multiplication by leveraging data sparsity to avoid unnecessary computations and handle memory efficiently.
Coding & AlgorithmsTechnical ScreenArraysMatricesOptimization - AppleMediumSoftware EngineerRefactor rock–paper–scissors for config and ties
This question evaluates a candidate's proficiency in object-oriented design, configuration injection, extensibility, state tracking (including ties), and testability when refactoring a Rock–Paper–Scissors tournament to support configurable rounds.
Coding & AlgorithmsOnsite - AppleMediumSoftware EngineerSimulate a Fixed-Capacity Least-Recently-Used Cache over a Stream of Operations
A coding question that asks you to implement a fixed-capacity key-value cache with least-recently-used eviction and run it over a stream of get and put operations. It tests precise recency and eviction rules, updates to keys already in the cache, and the design of a data structure with constant-time operations.
Coding & AlgorithmsTechnical Screen - AppleHardSoftware EngineerSmallest Valid Task Order from Dependency Pairs (Topological Sort)
Given a number of tasks and dependency pairs, return the lexicographically smallest order that completes every task while respecting all dependencies, or an empty list when a cycle makes that impossible. Tests topological sorting, cycle detection and deterministic tie-breaking on large dependency graphs.
Coding & AlgorithmsOnsite - AppleMediumSoftware EngineerSolve 15 common Apple coding questions
This set evaluates algorithmic problem-solving and data-structure competence, including mastery of hash tables, linked lists, stacks, queues, heaps, graphs, sliding-window and two-pointer techniques, complexity analysis, and in-place transformations.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve 15 common interview problems
This collection evaluates algorithmic problem-solving skills, mastery of fundamental data structures (arrays, strings, hash maps, stacks, queues, trees, graphs, linked lists) and the ability to reason about time and space complexity.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve Digit-Square and Grid BFS Problems
This question evaluates understanding of digit-based state convergence and cycle detection alongside graph traversal and constrained shortest-path search, testing skills in number manipulation, state-space search, and BFS-style exploration.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve Subset Sum And Return All Matching Subsets
This problem tests your ability to navigate the trade-off between dynamic programming and backtracking to find all unique combinations of elements that sum to a target value.
Coding & AlgorithmsTechnical ScreenBacktrackingRecursionSorting - AppleMediumSoftware EngineerSolve interval, grid-fill, and heap tasks
These combined tasks evaluate algorithmic problem-solving and data-structure design skills, specifically interval aggregation and counting over large timestamp ranges, constructive grid-filling with 4-directional connectivity constraints, and multiset operations supporting efficient retrieval and removal of minima and maxima.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSolve linked list, grid BFS, and median queries
This problem tests your ability to manipulate linked list pointers in-place, perform a multi-source Breadth-First Search on a grid, and maintain a sorted structure to retrieve medians efficiently.
Coding & AlgorithmsOnsiteLinked ListBFSHeaps - AppleMediumSoftware EngineerSolve mixed coding tasks from interviews
This question evaluates binary tree traversal and leaf detection, calendrical date arithmetic and palindrome checking, discrete-time edge-detection/stateful sequence processing, and implementation of comparison-based sorting; category/domain: Coding & Algorithms. It is commonly asked to assess correctness and edge-case handling (e.g.
Coding & AlgorithmsTechnical Screen - AppleEasySoftware EngineerSolve three easy algorithm problems
This multi-part prompt evaluates proficiency in fundamental algorithmic concepts including sorted array handling, single-transaction optimization in time-series data, and bracket-sequence validation, measuring understanding of array and string manipulation, common data structures, algorithmic complexity, and edge-case reasoning.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerSort and merge string lists by length
This question evaluates understanding of sorting algorithms, stability, merging strategies, and time/space complexity analysis when ordering strings by length, and is categorized under Coding & Algorithms.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerUnit Ratio Queries Across Independent Unit Families with Modular Answers
A graph coding problem: given multiplicative conversion factors between units that split into independent families, answer queries for how many units of one unit equal one unit of another, returning the ratio modulo a prime or -1 when the units cannot be converted. It tests graph traversal over a forest and modular arithmetic.
Coding & AlgorithmsTechnical Screen - AppleMediumSoftware EngineerVertical Order Traversal of a Binary Tree
This problem tests your ability to map tree nodes to a 2D coordinate system and group them based on their horizontal distance from the root, followed by specific sorting criteria.
Coding & AlgorithmsOnsiteBinary TreeHash TableSorting - AppleMediumSoftware EngineerZero out duplicates and sort an array
This question evaluates proficiency in array manipulation, duplicate handling, and custom sorting logic with attention to time and space complexity, and it falls within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerCompress vertices into uniques and indices
This question tests the ability to efficiently identify unique elements in a sequence while maintaining their original relative order, mapping them to integer indices to compress a large dataset.
Coding & AlgorithmsOnsiteHashingData StructuresOptimization - Applied IntuitionMediumSoftware EngineerDesign a nested transaction store
This question evaluates understanding of transactional state management, nested transaction semantics, scope resolution, and data-structure design for an in-memory key–value store.
Coding & AlgorithmsOnsite - Applied IntuitionMediumSoftware EngineerDesign a transactional in-memory key–value store
This question evaluates understanding of transactional state management, nested transaction semantics, scope shadowing, and efficient data-structure design for an in-memory key–value store, assessing competency in correctness, consistency, and algorithmic complexity under nested BEGIN/ROLLBACK/COMMIT operations.
Coding & AlgorithmsTechnical Screen
Apple
Applied Intuition