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 1–30 of 3276 results
- 6SenseMediumSoftware EngineerCount Squares from Points in the Plane
This problem tests your ability to efficiently store spatial coordinates and leverage geometric properties (like midpoints or diagonals) to detect squares within a 2D plane.
Coding & AlgorithmsTechnical ScreenGeometryHash SetArrays - AMDMediumSoftware EngineerFind the Largest K Elements with Partitioning
Find the largest k occurrences with partition-based selection, sort only the output, and compare quickselect pivot risks with heap and full-sort alternatives.
Coding & AlgorithmsOnsite - Abnormal SecurityMediumSoftware EngineerDesign a duplicate-file removal algorithm
Design a duplicate-file removal algorithm 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 - AbridgeHardSoftware EngineerExpand a Nested Repeat-Count Encoded String
From an Abridge online assessment: decode a string in which k[text] means the bracketed text repeated k times, with multi-digit counts, nested brackets and plain letters between encoded parts. It tests parsing nested structure correctly and building the expanded output efficiently.
Coding & AlgorithmsOnline Assessment - AbridgeHardSoftware EngineerRun-Length Compress a Character List With Multi-Digit Counts
From an Abridge online assessment: run-length compress a list of characters, writing each run of equal adjacent characters as the character followed by its length, with lengths of 10 or more split into separate digit characters. It tests careful run handling and the in-place, constant-space form of the problem.
Coding & AlgorithmsOnline Assessment - AbridgeHardSoftware EngineerSum of Integers Up to n Divisible by 3, 5, or 7
From an Abridge online assessment: given a positive integer n, return the sum of all integers from 1 to n that are divisible by 3, 5 or 7, adding numbers such as 15 or 21 only once. It tests precise handling of overlapping divisibility conditions and inclusive range boundaries.
Coding & AlgorithmsOnline Assessment - AccentureMediumSoftware EngineerFind minimum racks for 2D bin packing
This question evaluates understanding of combinatorial optimization and multi-dimensional bin packing, assessing algorithmic design, resource-allocation reasoning, and computational complexity awareness.
Coding & AlgorithmsTechnical Screen - AddeparMediumSoftware EngineerImplement a Transactional In-Memory Table
Design an in-memory tabular data store that supports transactional modifications (create, update, delete, find-and-replace) with commit and rollback capabilities.
Coding & AlgorithmsTechnical ScreenObject-Oriented DesignData StructuresDatabase Internals - Additive AiMediumSoftware EngineerAdvance Game of Life with Reduced Auxiliary Storage
This problem tests array manipulation techniques, specifically bitwise operations and modular arithmetic, to transform a grid in-place while preserving original state information for simultaneous updates.
Coding & AlgorithmsTechnical ScreenArraysBit ManipulationMatrix - AdiaEasyData ScientistCompute Score Difference in Reversing Array Game
This question tests the ability to manage state changes while iterating through an array based on index-dependent rules, specifically involving conditional array modifications.
Coding & AlgorithmsTechnical ScreenArraysSimulationDeque - AdobeMediumSoftware EngineerBuild a React team builder with role constraints
This problem tests your ability to manage complex UI state in React, enforce business constraints (role limits) during data manipulation, and implement stable UI rendering based on sorted state.
Coding & AlgorithmsTechnical ScreenReactState ManagementFrontend - AdobeMediumSoftware EngineerDesign a nested-list iterator
This question evaluates the ability to implement an efficient iterator over nested lists, testing skills in iterator state management, lazy traversal, explicit stack usage, and algorithmic complexity reasoning.
Coding & AlgorithmsTechnical Screen - AdobeMediumSoftware EngineerDetermine feasible task ordering
This question evaluates knowledge of graph algorithms and dependency management, emphasizing concepts such as topological ordering and cycle detection and the ability to determine feasibility and produce a valid execution sequence.
Coding & AlgorithmsTechnical Screen - AdobeMediumMachine Learning EngineerDetermine if a multiple-sum subarray exists
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine if a multiple-sum subarray exists states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AdobeMediumSoftware EngineerDetermine task order with prerequisites
This question evaluates a candidate's proficiency with graph-theoretic concepts like dependency modeling and cycle detection, and their ability to produce valid task orderings under constraints within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - AdobeMediumSoftware EngineerFind the Lowest Common Ancestor Only When Both Nodes Exist
Return the lowest common ancestor of two target values only when both are present in a potentially skewed binary tree. Handle absent targets, equal targets, empty input, and cases where one target is the ancestor.
Coding & AlgorithmsOnsite - AdobeMediumMachine Learning EngineerImplement K-means clustering from scratch
This problem tests your understanding of the K-means clustering algorithm, specifically the iterative process of centroid initialization, assignment, and update steps.
Coding & AlgorithmsTechnical ScreenK-meansClusteringUnsupervised Learning - AdobeMediumSoftware EngineerImplement file word count
This question evaluates a candidate's skills in text processing, large-scale I/O, token normalization, memory-constrained computation and algorithmic trade-offs for frequency aggregation, and it falls under the Coding & Algorithms domain because it combines parsing, data structures and external processing concerns.
Coding & AlgorithmsTechnical Screen - AdobeMediumSoftware EngineerReturn a Binary Tree in Level Order
Return a binary tree's values grouped by depth in level order while preserving left-to-right order within each level. Handle empty, repeated-value, skewed, and very large trees without changing the requested nested output shape.
Coding & AlgorithmsOnsite - AdobeMediumSoftware EngineerTraverse a path and print directory tree
This problem tests your ability to recursively traverse a directory structure and format the output into a human-readable, indented tree structure while handling potential I/O errors.
Coding & AlgorithmsTechnical ScreenRecursionNode.jsFilesystem - AdyenMediumSoftware EngineerImplement LRU and target-sum combinations
Implement LRU and target-sum combinations 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 - AeoneaMediumSoftware EngineerFind two numbers summing to target
This question evaluates algorithm design and complexity analysis skills, specifically the ability to identify element pairs in arrays and reason about time-space tradeoffs.
Coding & AlgorithmsTechnical Screen - AeoneaMediumSoftware EngineerImplement a tennis score tracker
This question evaluates a candidate's ability to implement stateful scoring logic and choose appropriate data structures for tracking sequential events, specifically handling tennis scoring rules such as 0/15/30/40 progression, Deuce, Advantage, and the two-point lead requirement.
Coding & AlgorithmsTechnical Screen - AffirmMediumSoftware EngineerAggregate loans and match repayments
Implement a transaction matching engine that aggregates user loans and allocates repayments chronologically to outstanding balances using a FIFO waterfall approach.
Coding & AlgorithmsTechnical Screenarrayshash-tablesorting - AffirmHardSoftware EngineerCompute Balances and Minimize Settlements
Tests transaction aggregation into net balances and combinatorial optimization (backtracking/bitmask DP) to find the minimum number of settlement transfers needed to clear all debts.
Coding & AlgorithmsOnsiteDynamic ProgrammingBacktrackingBitmask - AffirmMediumSoftware EngineerDetect fraud events and extract PII
This problem tests your ability to process nested JSON-like structures, perform deduplication, and map related entities to detect fraudulent patterns.
Coding & AlgorithmsTechnical ScreenGraphHash MapDSU - AffirmMediumSoftware EngineerDetermine Redeemable Promotion Offers
This problem tests your ability to manage stateful constraints by processing a stream of promotional event logs to determine if a user remains eligible for a discount based on a per-user, per-promotion usage limit.
Coding & AlgorithmsTechnical ScreenHashMapsDataAggregationStreamProcessing - AffirmMediumSoftware EngineerFind shortest unique substring per word
This problem tests your ability to manipulate string data structures (like Tries or Suffix Trees) to efficiently identify the shortest, lexicographically smallest substring that is unique to a given word within a provided collection.
Coding & AlgorithmsTechnical ScreenStringsTrieHash Map - AffirmEasySoftware EngineerImplement an LRU cache
This question tests the ability to combine a hash map and a doubly linked list to achieve constant-time performance for both data retrieval and update operations in a cache.
Coding & AlgorithmsOnsiteHash MapLinked ListDesign - AgodaMediumSoftware EngineerCompute triangle min path and dice stopping stats
This composite question evaluates dynamic programming and algorithmic optimization via the triangle minimum path problem and probability, stopping-time analysis and Monte Carlo simulation through the two-dice experiment, testing competencies in DP, discrete probability, expected-value reasoning and empirical estimation.
Coding & AlgorithmsTechnical Screen
Abridge
Adobe
Affirm
Agoda