practice a little every day, paws crossed ♡
Coding & Algorithms 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 151–180 of 1080 results
- 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 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 - AppleMediumMachine Learning EngineerSolve stock and banana problems
This question evaluates algorithmic problem-solving skills related to array processing, optimization under constraints, and reasoning about performance trade-offs by presenting a maximum single-transaction stock profit problem and a minimum banana-eating speed problem.
Coding & AlgorithmsOnsite - 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 - 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 IntuitionEasySoftware EngineerFind intersection of two line segments
This question evaluates a candidate's skills in computational geometry and numerical robustness, focusing on line-segment intersection reasoning, endpoint touching, collinearity, and precision handling.
Coding & AlgorithmsOnsite - Applied IntuitionEasySoftware EngineerGroup duplicate files by content
This question evaluates understanding of file deduplication, efficient I/O and hashing strategies, streaming large-file processing, and scalable algorithm design for identifying files with identical byte-for-byte contents.
Coding & AlgorithmsOnsite - Applied IntuitionMediumSoftware EngineerImplement a fixed-capacity generic circular buffer
This question tests the ability to implement a space-efficient data structure using fixed-size arrays, modular arithmetic for index wrapping, and generic type constraints.
Coding & AlgorithmsOnsiteData StructuresArraysGenerics - Applied IntuitionMediumSoftware EngineerImplement a single-thread task scheduler API
This problem tests your ability to design a priority-based scheduler using a min-heap to manage tasks triggered by relative or absolute timestamps, ensuring execution occurs in the correct temporal order.
Coding & AlgorithmsOnsiteData StructuresPriority QueueAlgorithms - AsanaMediumSoftware EngineerCompute Products Excluding Each Index
This question evaluates array manipulation skills, arithmetic reasoning with cumulative products, edge-case handling for zeros and negative numbers, and time/space complexity optimization for in-place or constant-extra-space algorithms.
Coding & AlgorithmsOnsite - AsanaMediumSoftware EngineerImplement an ASCII Art Printer
This question evaluates the ability to implement text rendering and string/array manipulation concepts, including glyph concatenation with inter-character spacing, newline-preserved blocks, blank glyph rendering for spaces, and handling of unsupported characters.
Coding & AlgorithmsOnsite - AsanaMediumSoftware EngineerImplement core puzzle/array/grid routines
This question set evaluates algorithmic problem-solving competencies including backtracking and constraint satisfaction for jigsaw assembly, simulation and state manipulation for ASCII canvas and 2048 move logic, and linear-time in-place array transformation for the product-of-array problem.
Coding & AlgorithmsOnsite - AsanaMediumSoftware EngineerReturn the K Closest Points with Deterministic Ties
This problem tests the ability to efficiently find the nearest neighbors to a target coordinate while maintaining a deterministic ordering for ties, ensuring reproducible results.
Coding & AlgorithmsOnsiteHeapSortingGeometry - AtlassianMediumMachine Learning EngineerAssign bookings to minimum tennis courts
This problem tests your ability to manage overlapping time intervals using a greedy approach, specifically requiring the calculation of the maximum number of concurrent bookings to determine the minimum resource count.
Coding & AlgorithmsOnsiteGreedySortingIntervals - AtlassianMediumSoftware EngineerAssign tennis bookings to minimum courts
Design an algorithm to assign a schedule of tennis court bookings to the minimum number of courts required, resolving resource contention efficiently.
Coding & AlgorithmsOnsiteIntervalsHeapGreedy - AtlassianHardMachine Learning EngineerCompute a moving average on a stream
This problem tests your ability to maintain a running average over a sliding window of size K in a high-throughput streaming environment while managing numerical precision and memory efficiency.
Coding & AlgorithmsOnsiteAlgorithmsData StructuresStreaming - AtlassianMediumMachine Learning EngineerCompute inverse-depth weighted sum of a nested list
This problem tests your ability to traverse nested list structures using recursion or iterative stacks and compute a value based on the nesting depth of individual elements.
Coding & AlgorithmsOnsiteRecursionTreesData Structures - AtlassianMediumMachine Learning EngineerCompute moving average over last N stream
This question evaluates understanding of streaming algorithms and sliding-window aggregation within the Coding & Algorithms domain, focusing on incremental computation, state management, and numerical stability when computing moving averages.
Coding & AlgorithmsOnsite - AtlassianMediumMachine Learning EngineerDesign O(1) cache and moving average
This problem tests your ability to maintain constant-time complexity for both cache management and sliding-window statistics by using a combination of a doubly-linked list and hash maps.
Coding & AlgorithmsOnsiteLRU CacheData StructuresSliding Window - AtlassianMediumMachine Learning EngineerFind LCA in a tree and extend to a DAG
This problem tests your understanding of tree traversal, graph theory, and how to generalize path-finding algorithms from trees to directed acyclic graphs (DAGs).
Coding & AlgorithmsOnsiteGraphsLCATrees - AtlassianHardMachine Learning EngineerFind a secret word using match feedback
Design an optimal querying strategy to identify a secret word from a candidate vocabulary using exact-match character feedback under a strict query budget.
Coding & AlgorithmsOnsiteAlgorithmsMinimaxInformation Theory - AttentiveMediumSoftware EngineerEvaluate a Scoped Lisp Expression
Implement a recursive descent or token-based interpreter to evaluate a scoped, Lisp-like arithmetic expression supporting addition, multiplication, and sequential variable bindings with shadowing.
Coding & AlgorithmsOnsiterecursionparsinghash-table - AttentiveMediumSoftware EngineerReturn Log Entries Within an Inclusive Time Range From a Sorted Log
Given an in-memory log sorted by integer timestamp, return every entry whose timestamp lies within an inclusive start and end time. The problem tests exact boundary handling with duplicate timestamps, empty results when the range misses the log, and locating a range efficiently in sorted data.
Coding & AlgorithmsOnsite - AxonMediumSoftware EngineerDesign body camera checkout system
Design an in-memory inventory management system for body-worn cameras that supports O(1) registration, uniform random checkout, and checkin operations.
Coding & AlgorithmsOnsiteData StructuresHash TableRandomized Algorithms - AxonMediumSoftware EngineerImplement encryption and constant-time random set
This problem tests your ability to implement a cryptographic XOR-based transformation and design a randomized data structure with O(1) performance using an array-based map.
Coding & AlgorithmsOnsiteCryptographyHash MapArray - BalyasnyHardSoftware EngineerProcess Get and Set Operations in a Key-Value Cache
This problem tests your ability to implement an efficient, thread-safe, and memory-constrained LRU (Least Recently Used) cache using a combination of a hash map and a doubly linked list.
Coding & AlgorithmsOnsiteHash MapLinked ListLRU Cache - BelvederetradingMediumSoftware EngineerImplement Concurrent Utilities in C++
This question tests your ability to implement a thread-safe, generic blocking queue in C++ using synchronization primitives like mutexes and condition variables.
Coding & AlgorithmsOnsiteC++ConcurrencyMultithreading - BloombergMediumSoftware EngineerGenerate all strings by expanding wildcards
This question evaluates algorithmic string manipulation and combinatorial enumeration skills, focusing on handling wildcard characters and generating all possible binary outcomes from a pattern.
Coding & AlgorithmsOnsite - BloombergMediumSoftware EngineerImplement island counting with BFS and DFS
A Bloomberg Software Engineer onsite coding question: count the number of islands (connected land regions) in an m x n grid under four-directional connectivity. It asks for a linear-time O(m·n) flood-fill plus a second, explicit breadth-first-search implementation, with correctness and complexity analysis, edge-case handling, tests, and a diagonal-adjacency follow-up.
Coding & AlgorithmsOnsite
Apple
Applied Intuition
Asana
Atlassian
Attentive
Axon
Bloomberg