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 1261–1290 of 1706 results

  • RobloxEasyMachine Learning Engineer
    Implement recent-requests counter

    This question evaluates a candidate's ability to design efficient in-memory data structures and manage time-windowed event counting, testing algorithmic reasoning and performance optimization for high-throughput services.

    Coding & AlgorithmsTechnical Screen
  • RobloxMediumData Scientist
    Implement streaming CTR with deduplication

    This question evaluates streaming data-processing and algorithmic design skills, specifically time-windowed aggregation, click deduplication, late-event handling, state management, and selection of data structures for per-campaign CTR computation.

    Coding & AlgorithmsTechnical Screen
  • RobloxMediumMachine Learning Engineer
    Level-Ordered Dependency Build Order

    This problem tests your ability to perform a Kahn’s algorithm-based topological sort while grouping tasks into parallelizable layers, ensuring cycle detection and dependency validation.

    Coding & AlgorithmsTechnical ScreenGraphBFSTopological Sort
  • RobloxMediumSoftware Engineer
    Match-3 Grid: Find Horizontal and Vertical Runs, Then Clear and Drop Cells

    A two-part grid problem modeled on a Match-3 game: report every horizontal and vertical run of three or more equal values in a fixed scan order, then clear the matched cells and let the remaining values in each column fall to the bottom. It tests precise run detection, ordering rules and grid simulation.

    Coding & AlgorithmsTechnical Screen
  • RobloxMediumSoftware Engineer
    Randomly partition array into k segments

    This question evaluates algorithm design, randomization techniques, and time/space complexity analysis within the Coding & Algorithms domain, focusing on partitioning an array into random non-empty segments.

    Coding & AlgorithmsTechnical Screen
  • RobloxHardSoftware Engineer
    Rank queries by prefix, frequency, and time

    This question evaluates understanding of string processing, frequency aggregation, earliest-timestamp tracking, and efficient prefix-based retrieval for large datasets.

    Coding & AlgorithmsTechnical Screen
  • RunloopMediumSoftware Engineer
    Return a Topological Order or Detect a Cycle

    This problem tests your ability to implement Kahn's algorithm for topological sorting while incorporating a priority-based tie-breaking mechanism to ensure deterministic output.

    Coding & AlgorithmsTechnical ScreenGraphTopological SortHeap
  • SalesforceMediumSoftware Engineer
    Design O(nm) grouping of rearranged strings

    This question evaluates a candidate's understanding of string manipulation, hashing and frequency-count techniques, algorithmic optimization, and time/space complexity analysis when grouping anagrams.

    Coding & AlgorithmsTechnical Screen
  • SalesforceMediumSoftware Engineer
    Generate All Balanced Parenthesis Strings with n Pairs in Sorted Order

    Return every balanced string made of n opening and n closing parentheses, for n up to 8, sorted in ascending lexicographic order. It tests systematic generation of combinatorial strings under a validity constraint, with an exact canonical ordering of the output.

    Coding & AlgorithmsTechnical Screen
  • SalesforceMediumSoftware Engineer
    Implement 64-bit modular exponentiation safely

    This question evaluates proficiency in modular arithmetic, safe 64‑bit integer operations, and algorithmic techniques for overflow‑resistant modular multiplication and exponentiation.

    Coding & AlgorithmsTechnical Screen
  • SalesforceMediumSoftware Engineer
    Implement a traffic-light UI with JS

    This question evaluates front-end web development competencies, including DOM manipulation, CSS-driven UI state, JavaScript timing and asynchronous state management for interactive components.

    Coding & AlgorithmsTechnical Screen
  • SalesforceMediumSoftware Engineer
    Maximal Square and Longest Increasing Subsequence

    This problem tests proficiency with 2D dynamic programming for geometric pattern recognition and 1D dynamic programming for sequence optimization.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingBinary SearchMatrix
  • SalesforceMediumSoftware Engineer
    Maximize events attended given date ranges

    This problem tests your ability to solve a classic greedy interval scheduling variation by using sorting and a priority queue to maximize overlapping resource utilization.

    Coding & AlgorithmsTechnical ScreenGreedyHeapSorting
  • SalesforceMediumSoftware Engineer
    Minimize steps to reduce integer

    This question evaluates algorithm design skills and proficiency with integer operations and decision-making under parity constraints, testing competencies such as bitwise reasoning, greedy and dynamic-programming intuition, and complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • SalesforceHardSoftware Engineer
    Solve sliding window, heap, DP, in-place tasks

    This problem tests your ability to combine sliding window techniques with hash map frequency tracking to identify all starting indices of valid anagrams in a target string.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapStrings
  • SamsaraMediumSoftware Engineer
    Implement Markdown-to-HTML parser

    This question evaluates parsing and string-processing skills, including tokenization, stateful scanning, inline versus block-level markup handling, edge-case management (e.g., unmatched delimiters, trailing spaces, empty paragraphs) and reasoning about time and space complexity.

    Coding & AlgorithmsTechnical Screen
  • SamsaraMediumSoftware Engineer
    Parse Markdown Links Without Regex

    This question evaluates proficiency in string parsing, tokenization, escape-sequence handling, and input validation required to convert simplified Markdown-style link syntax into HTML anchors without using regular expressions.

    Coding & AlgorithmsTechnical Screen
  • SamsungEasySoftware Engineer
    Count islands in a binary grid

    This question evaluates a candidate's ability to analyze grid-based data structures and identify connected components, testing spatial adjacency reasoning and state management within 2D arrays.

    Coding & AlgorithmsTechnical Screen
  • SamsungMediumMachine Learning Engineer
    Validate palindrome with constraints

    This question evaluates a candidate's ability to implement string-processing algorithms and two-pointer techniques under O(n) time and O(1) extra space constraints, including character filtering, case normalization, edge-case handling, and algorithmic complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • SapMediumSoftware Engineer
    Implement JavaScript utility and API functions

    This problem tests proficiency in JavaScript functional programming patterns, data manipulation, and asynchronous error handling when interacting with REST APIs.

    Coding & AlgorithmsTechnical ScreenJavaScriptFunctional ProgrammingAsynchronous
  • Scale AIMediumSoftware Engineer
    Compute clock hand angle with seconds and milliseconds

    This question evaluates understanding of angular geometry and numeric precision in time-based systems, testing competency in parsing varying time formats and computing continuous clock-hand positions; it is in the Coding & Algorithms domain and requires both conceptual understanding of angular motion and practical application in precise computation. Interviewers commonly ask this problem to assess an applicant's ability to model continuous motion, handle 12/24-hour representations and edge cases, and manage seconds- and milliseconds-level precision when deriving and implementing numerical formulas.

    Coding & AlgorithmsTechnical Screen
  • Scale AIMediumSoftware Engineer
    Find LCA in a N-ary tree via DFS

    This question evaluates understanding of tree algorithms and recursive DFS traversal for computing the lowest common ancestor in an N-ary tree, including handling node references, subtree detection, and correctness in a single traversal.

    Coding & AlgorithmsTechnical Screen
  • Scale AIHardSoftware Engineer
    Implement Dependency-Aware Task Scheduler

    Design and implement a dependency-aware task scheduler that supports dynamic task registration, cycle detection, priority-based ready task retrieval, and state transitions.

    Coding & AlgorithmsTechnical ScreenGraphHeapDesign
  • Scale AIEasySoftware Engineer
    Implement a Dependency-Aware Task Scheduler

    This question evaluates skills in dependency management, deadline-driven scheduling and algorithmic data-structure design, focusing on handling directed acyclic graphs and ordering constraints.

    Coding & AlgorithmsTechnical Screen
  • Scale AIMediumSoftware Engineer
    Implement a Task Processor

    This problem tests your ability to manage tasks with dependencies using a combination of graph-based topological sorting (Kahn's algorithm) and a priority queue to ensure deadlines are respected.

    Coding & AlgorithmsTechnical ScreenGraphsHeapsTopological Sort
  • Scale AIMediumSoftware Engineer
    Schedule Ready Tasks by Deadline

    This question evaluates understanding of task scheduling and dependency management in directed acyclic graphs, along with algorithmic selection and data-structure-based optimization for repeated minimum-deadline retrieval.

    Coding & AlgorithmsTechnical Screen
  • SealthMediumSoftware Engineer
    Decode Ambiguous Morse Messages

    This question evaluates string parsing, pattern matching, and combinatorial decoding skills using a Morse-to-letter mapping, covering both deterministic separator handling and enumeration of ambiguous letter partitions.

    Coding & AlgorithmsTechnical Screen
  • ServalMediumSoftware Engineer
    Find Shared Motion Periods Across Camera Streams

    Tests your ability to parse thresholded time-series sensor data into continuous intervals and compute multi-way interval intersections.

    Coding & AlgorithmsTechnical ScreenIntervalsTwo PointersTime Series
  • Sesame AiMediumSoftware Engineer
    Summarize Transcript Events in a Sliding Window

    This problem tests your ability to maintain window-based statistics using an efficient data structure, specifically focusing on tracking counts of distinct elements and the maximum value in a sliding window.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapMonotonic Deque
  • Shield AiEasySoftware Engineer
    Count Pairs with the Minimum Absolute Difference

    This problem tests the ability to efficiently find the minimum absolute difference between elements in an array and count the number of pairs that achieve this difference using combinatorial counting.

    Coding & AlgorithmsTechnical ScreenSortingArraysCombinatorics