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 481–510 of 3276 results
- Applied IntuitionMediumSoftware EngineerParse a protobuf-like schema and answer queries
This problem tests your ability to parse a hierarchical schema definition, resolve nested type references using a symbol table, and implement an efficient lookup function for type paths.
Coding & AlgorithmsTechnical ScreenParsingTrieHash Table - Applied IntuitionHardBackend EngineerResolve Dependent Addition Equations
Implement an equation evaluator that computes the integer values of variables defined in terms of literals and other variables while detecting cycles and undefined references.
Coding & AlgorithmsTechnical ScreenGraphTopological SortDFS - Applied IntuitionMediumSoftware EngineerScale Game of Life to huge matrices
This question tests the ability to optimize grid-based simulations that exceed local memory capacity, focusing on sliding windows, buffer management, and efficient disk I/O.
Coding & AlgorithmsTechnical ScreenAlgorithmsSystem-DesignI/O-Optimization - Applied IntuitionHardSoftware EngineerTrack simulations and report timeouts
This question evaluates competency in algorithms and data-structure design for real-time stream processing, including maintaining per-simulation state, handling time-based expirations, and reasoning about performance and correctness.
Coding & AlgorithmsTechnical Screen - Applied IntuitionMediumSoftware EngineerValidate JSON against a protobuf-like schema
This problem tests your ability to recursively validate a JSON object against a structured schema definition and handle field presence constraints.
Coding & AlgorithmsTechnical ScreenRecursionJSONValidation - Applied IntuitionHardMachine Learning EngineerValidate Nested Configuration Objects
This question evaluates schema validation skills including recursive data structures, primitive and composite type checking, and structured error reporting for configuration objects, categorized under Coding & Algorithms for a Machine Learning Engineer role and focused on practical implementation.
Coding & AlgorithmsTechnical Screen - ApplovinHardSoftware EngineerCount invalid nodes in a BST
This question evaluates understanding of binary search tree invariants and the ability to identify nodes that violate ancestor-imposed value ranges, testing competency with tree data structures and constraint propagation in the coding & algorithms domain.
Coding & AlgorithmsTechnical Screen - AristaEasySoftware EngineerFind missing value in sorted consecutive array
This question evaluates understanding of array properties and algorithmic complexity, specifically detecting a single missing element in a sorted consecutive sequence within the Coding & Algorithms category.
Coding & AlgorithmsTechnical Screen - AristaEasySoftware EngineerRemove Target Values from a Linked List
This question evaluates proficiency with singly linked list manipulation, specifically in-place node removal and correct pointer/reference management. It is commonly asked to assess practical coding ability with data structures, handling of edge cases and resource implications; category: Coding & Algorithms (Data Structures), level of abstraction: practical implementation-focused.
Coding & AlgorithmsTechnical Screen - AristaEasySoftware EngineerSolve palindrome and missing-number variants
This question evaluates competencies in string processing, array manipulation, binary search, and algorithmic complexity analysis by asking a palindrome check and a missing-number problem that requires both O(n) and O(log n) reasoning, emphasizing edge-case handling and time/space complexity discussion.
Coding & AlgorithmsTechnical Screen - ArmadaMediumSoftware EngineerFetch paginated data from two APIs
This question evaluates a candidate's competency in robust API retrieval, pagination handling, defensive data validation, and joining records across endpoints while preserving the order of source records and safely handling missing or malformed fields.
Coding & AlgorithmsTechnical Screen - Art AdvisorsMediumSoftware EngineerSolve common array/graph interview problems
This problem tests your ability to manipulate matrices for grid traversal, apply BFS for shortest-path discovery in string transformations, and optimize sorting or counting logic for metric calculations.
Coding & AlgorithmsTechnical ScreenGraphBFSSorting - 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 EngineerFind the K Closest Points to the Origin
This problem tests proficiency with heap-based priority queues and custom sorting logic for spatial coordinates.
Coding & AlgorithmsTechnical ScreenSortingHeapGeometry - 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 EngineerPick the K Values Nearest a Target in a Sorted Integer Array
A coding exercise on a sorted integer array: return the k elements nearest a target value in ascending order, where equal distances favor the smaller value. It tests exploiting sorted order, handling targets outside the array's range, and treating duplicate values correctly.
Coding & AlgorithmsOther - 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 - AsanaMediumSoftware EngineerSolve a Jigsaw Puzzle
This question evaluates algorithmic problem-solving, constraint satisfaction, search and pruning strategies, and handling combinatorial state such as piece rotation and placement.
Coding & AlgorithmsTechnical Screen - Assort HealthMediumSoftware EngineerBuild Lab and Consultation Appointment Matches
Process raw 10-minute provider availability records into 30-minute appointment options and match consecutive lab and consultation appointments within a 60-minute wait window.
Coding & AlgorithmsTechnical ScreenIntervalsSortingTwo Pointers - 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 - AtlassianMediumSoftware EngineerDesign a trie-based URL router with wildcards
Design a trie-based URL router with wildcards 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 - AtlassianMediumSoftware EngineerDetermine whether a word exists in a letter grid
Implement a backtracking search to determine if a target word can be formed by sequentially adjacent cells in a 2D character grid without reusing any cell.
Coding & AlgorithmsTechnical Screenbacktrackingdfsmatrix - AtlassianEasySoftware EngineerFilter Invalid Data Events
Tests your ability to implement a multi-condition event filtering and deduplication pipeline while preserving input order, along with complexity analysis for batch and stream processing.
Coding & AlgorithmsTechnical Screenhash-tabledata-processingarrays - 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
Applied Intuition
Arista
Asana
Atlassian