Katkat

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 241–270 of 1706 results

  • Applied IntuitionHardSoftware Engineer
    Merge Overlapping Straight Fence Runs From a Property Survey

    Collapse a pile of straight fence-line survey readings into one run per physically continuous stretch of fence, by detecting which readings sit on the same infinite line and connect up. Tests exact collinearity detection, correct handling of every orientation, and interval merging per line.

    Coding & AlgorithmsTechnical Screengeometryunion-findsorting
  • Applied IntuitionMediumSoftware Engineer
    Merge collinear overlapping 2D segments

    This problem tests your ability to handle geometric data by identifying and merging overlapping segments that lie on the same infinite line.

    Coding & AlgorithmsTechnical ScreenGeometryIntervalsSorting
  • Applied IntuitionMediumSoftware Engineer
    Merge overlapping 2D line segments

    This problem tests your ability to handle geometric data by sorting and merging 1D intervals that exist within a 2D space, specifically focusing on collinear segments.

    Coding & AlgorithmsTechnical ScreenGeometrySortingIntervals
  • Applied IntuitionMediumSoftware Engineer
    Multi-Agent Collision Simulator (Unicycle Kinematics)

    Implement a discrete-time multi-agent simulator using unicycle kinematics and forward Euler integration to track agent trajectories and detect inter-agent collisions.

    Coding & AlgorithmsTechnical ScreenRoboticsSimulationGeometry
  • Applied IntuitionMediumSoftware Engineer
    Parse 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 Engineer
    Resolve 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 Engineer
    Scale 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 Engineer
    Track 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 Engineer
    Validate 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 Engineer
    Validate 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 Engineer
    Count 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 Engineer
    Find 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 Engineer
    Remove 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 Engineer
    Solve 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 Engineer
    Fetch 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 Engineer
    Solve 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 Engineer
    Find 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 Engineer
    Solve 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 Engineer
    Build 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
  • AtlassianMediumSoftware Engineer
    Design 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 Engineer
    Determine 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 Engineer
    Filter 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
  • AtlassianMediumSoftware Engineer
    Find nearest common manager for multiple employees

    This question evaluates proficiency in tree and graph algorithms (lowest common ancestor), input validation for hierarchical data (cycle and disconnected component detection), API design for constructing and querying trees, and algorithmic time/space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • AtlassianMediumSoftware Engineer
    Find smallest common organization for employees

    This problem tests your ability to navigate hierarchical structures and find the Lowest Common Ancestor (LCA) in a tree or a directed acyclic graph representing organizational reporting lines.

    Coding & AlgorithmsTechnical ScreenTreeLCADFS
  • AtlassianMediumSoftware Engineer
    Highlight the Shortest Unique Substring in Each Label

    Find and highlight the shortest case-insensitive unique substring in each label using bracket notation, breaking ties by earliest index and preserving original casing.

    Coding & AlgorithmsTechnical Screenstringshash-tabletrie
  • AtlassianMediumData Scientist
    Implement Real-Time Rate Limiting for Web Service Requests

    This question evaluates understanding of real-time rate limiting, time-windowed traffic control, and efficient per-client state management under algorithmic constraints.

    Coding & AlgorithmsTechnical Screen
  • AtlassianMediumSoftware Engineer
    Implement sequential and parallel URL requests

    Implement an asynchronous batch URL fetcher that executes requests with bounded concurrency, deduplicates network calls, preserves input order, and handles per-request errors gracefully.

    Coding & AlgorithmsTechnical Screenconcurrencyasync-awaitnetworking
  • AtlassianMediumSoftware Engineer
    Implement sliding-window rate limiter function

    This problem tests your ability to design a thread-safe rate limiter using a sliding window approach, focusing on time complexity optimization and memory management.

    Coding & AlgorithmsTechnical ScreenConcurrencyData StructuresSliding Window
  • AtlassianMediumSoftware Engineer
    Merge intervals and design rating APIs

    Tests interval merging logic alongside stateful data structure design for tracking agent performance, calculating streaming averages, and ranking agents with deterministic tie-breaking.

    Coding & AlgorithmsTechnical Screenintervalsheaphash-table
  • AtlassianMediumSoftware Engineer
    Merge overlapping intervals

    This problem tests your ability to manipulate array-based data structures, specifically focusing on sorting and linear-time interval merging logic.

    Coding & AlgorithmsTechnical ScreenArraysSortingGreedy