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 1291–1320 of 3276 results
- GoogleMediumSoftware EngineerSolve three coding interview problems
This set tests proficiency in recursive string decoding, dynamic programming for sequential decision-making, and graph-based traversal algorithms for grid analysis.
Coding & AlgorithmsOnsiteRecursionDynamic ProgrammingGraph Traversal - GoogleEasySoftware EngineerSolve three coding problems
This set of problems evaluates algorithmic problem-solving across combinatorics and enumeration (finding the N-th lexicographic license plate), constrained geometric and graph traversal reasoning (counting Android-style 3x3 unlock patterns), and interval-processing algorithms (computing intersections of sorted, non-overlapping intervals) within the domain of algorithms and data structures. These questions are commonly asked because they reveal ability to reason about discrete enumeration, constraint handling, and efficient time/space implementations for edge-case-heavy inputs, and the level of abstraction spans both conceptual understanding (combinatorial and geometric constraints) and practical application (efficient algorithm and data-structure implementation).
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerStreaming Points: Remove Any Pair Within a Distance
This problem tests the ability to maintain and query a dynamic sorted collection of points to perform efficient proximity-based removals.
Coding & AlgorithmsOnsiteSorted StructuresGreedyBST - GoogleMediumSoftware EngineerTrack Island Counts as Land Is Added
Report the initial number of grid islands and update that count after each requested water-to-land addition. The problem probes incremental connectivity, duplicate additions, local merge effects, scalability to large grids, and alternatives to recomputing the entire map.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerTroubleshoot CPU, latency, and DNS issues
This question evaluates system troubleshooting and diagnostic competencies, including Linux CPU and IO performance analysis, network latency and packet-level investigation, and DNS resolution and query tooling knowledge.
Coding & AlgorithmsOnsite - GoogleMediumData EngineerUser Activity Analytics: Unique Users per Activity and Average Time on Site
This question evaluates a candidate's ability to process semi-structured event data using grouping, deduplication, and timestamp arithmetic in Python. It falls under coding and algorithms, commonly asked to assess practical data-wrangling skills such as aggregating per-key counts and computing time-based metrics while handling edge cases like unordered records and single-event users.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerValidate course catalog dependencies
This question evaluates understanding of graph algorithms and data validation, specifically dependency analysis, cycle detection, and topological ordering.
Coding & AlgorithmsTechnical Screen - GoogleMediumData EngineerWrite SQL and merge linked lists
Solve a SQL customer order aggregation task and merge two sorted linked lists. The solution uses CTEs, window functions, LEFT JOINs, COALESCE, latest-order tie handling, optional returned-order filtering, and an O(m+n) dummy-head linked-list merge.
Coding & AlgorithmsTechnical Screen - GrammarlyMediumSoftware EngineerImplement a Transactional Key-Value Store
This question evaluates understanding of transactional state management, data structure design, and consistency/visibility semantics in an in-memory key-value store that supports nested transactions.
Coding & AlgorithmsOnsite - GrammarlyMediumSoftware EngineerMerge overlapping corrections
This question evaluates a candidate's ability to manage and manipulate overlapping intervals with multi-criteria tie-breaking, preserve original metadata across splits, and design efficient data structures and algorithms for producing non-overlapping correction spans.
Coding & AlgorithmsOnsite - GrammarlyEasySoftware EngineerRecover a Rooted Tree from Depth-Annotated Preorder
Reconstruct a general ordered tree from its depth-annotated preorder traversal string and return it as a nested tuple.
Coding & AlgorithmsTechnical Screentreesstackparsing - GrammarlyMediumSoftware EngineerReverse a Singly Linked List
This problem tests your understanding of pointer manipulation and iterative/recursive techniques for modifying linked structures in-place.
Coding & AlgorithmsTechnical ScreenLinked ListIn-placePointer Manipulation - Grayswan AiEasySoftware EngineerImplement a debounced function (with leading option)
This problem tests your understanding of higher-order functions, closure scope, and asynchronous execution control by requiring the implementation of a flexible debounce utility.
Coding & AlgorithmsTechnical ScreenJavaScriptClosuresAsynchronous - GsaHardData ScientistOptimize Matrix-Chain Multiplication
This problem tests your ability to solve a classic dynamic programming challenge, focusing on finding the optimal order of matrix multiplications to minimize the total number of scalar operations.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingAlgorithmsOptimization - GustoMediumSoftware EngineerFairly Distribute Money With Limits
This problem tests your ability to implement a greedy allocation algorithm while respecting individual upper bounds and handling iterative redistribution of remaining resources.
Coding & AlgorithmsTechnical ScreenGreedyBinary SearchSorting - GustoMediumSoftware EngineerImplement a timestamped map
This problem tests your ability to design a time-indexed key-value store that supports efficient lookups of historical values using binary search.
Coding & AlgorithmsTechnical ScreenHash MapBinary SearchData Structures - HackerRankMediumMachine Learning EngineerCount Good Subsequences With Equal Character Frequencies
Practice a combinatorics coding problem that counts good subsequences where every selected character has the same frequency. The prompt targets frequency counting, combinations, modular arithmetic, and grouping subsequences by common selected count.
Coding & AlgorithmsOnline Assessment - HackerRankMediumSoftware EngineerFind Final Ball Holder
This problem tests your ability to optimize repeated state transitions by identifying cycles in a functional graph or using modular arithmetic to jump through large steps.
Coding & AlgorithmsTechnical ScreenMathModulo ArithmeticSimulation - HadrianHardSoftware EngineerWork Order Lead Time: Critical Path Through an Operations DAG to Shipping
A manufacturing work order is modeled as a directed acyclic graph of operations with durations in days, and every path ends at one shipping node. Compute the total lead time as the critical path length from any starting operation to shipping. It tests graph modeling, dependency ordering and longest-path reasoning.
Coding & AlgorithmsTechnical Screen - HarveyHardSoftware EngineerBuild an In-Memory File Vault with Duplicate-Name Handling
Design an in-memory hierarchical file vault supporting automatic directory creation, lexicographical directory listings, and duplicate-name resolution using the smallest available numeric suffix.
Coding & AlgorithmsOnsiteTrieDesignTree - HarveyMediumSoftware EngineerDesign Spreadsheet Formula Cells
This question evaluates ability to design and implement data structures and algorithms for expression parsing, dependency tracking, incremental evaluation, and cycle detection in an in-memory spreadsheet.
Coding & AlgorithmsOnsite - HarveyMediumSoftware EngineerDesign a constrained in-memory file system
This question evaluates design and implementation skills for hierarchical in-memory data structures, string parsing and file-name collision handling under constraints, and the ability to reason about time and space complexity.
Coding & AlgorithmsTechnical Screen - HarveyHardSoftware EngineerDesign an In-Memory Spreadsheet Engine
Design an in-memory spreadsheet engine that supports cell updates, formula evaluations, cycle detection, and O(1) value lookups via proactive cache propagation.
Coding & AlgorithmsTechnical ScreenGraphTopological SortSystem Design - HarveyMediumSoftware EngineerDesign an in-memory file system with limits
This question evaluates the ability to design and implement hierarchical in-memory data structures, manage capacity constraints and OS-style duplicate naming, and reason about edge cases and time/space complexity.
Coding & AlgorithmsTechnical Screen - HarveyMediumSoftware EngineerEager Spreadsheet Formulas with Constant-Time Reads
Implement eager spreadsheet formulas with constant-time cached reads, transitive dependency updates, cycle rejection, and atomic definition replacement.
Coding & AlgorithmsTechnical Screen - HarveyMediumSoftware EngineerEvaluate Symbol Expressions
Implement an expression evaluator for a dictionary of symbolic definitions with arithmetic operations, resolving dependencies, and detecting cycles and undefined references.
Coding & AlgorithmsOnsitedirected-graphtopological-sortexpression-parsing - HarveyMediumSoftware EngineerHandle multi-source string matching and tagging
This question evaluates skills in string matching, pattern recognition, overlap handling, text annotation, and counting occurrences across multiple source strings.
Coding & AlgorithmsTechnical Screen - HarveyHardSoftware EngineerImplement Spreadsheet Cell Updates
This problem tests your ability to manage a directed graph of dependencies and implement a topological update mechanism to recompute spreadsheet cell values efficiently.
Coding & AlgorithmsTechnical ScreenGraphDependency ManagementTopological Sort - HarveyMediumSoftware EngineerImplement a Cursor-Based Text Editor
Design an in-memory cursor-based text editor supporting character insertion, deletion, and cursor navigation with efficient time complexity.
Coding & AlgorithmsOnsitedata-structuresstackdesign - HarveyMediumSoftware EngineerImplement a Database Connection Pool
Tests your ability to implement a thread-safe connection pool that manages connection lifecycles, blocking acquisition with timeouts, and resource reuse under concurrent access.
Coding & AlgorithmsOnsiteConcurrencyMultithreadingObject-Oriented Design
Google
Grammarly
Gusto
Harvey