Coding & Algorithms interview questions

Showing 2551–2580 of 3276 results

• Solve Two OA Coding ProblemsMedium

  These two problems evaluate in-place array manipulation and run-length encoding implementation for character sequences, and algorithmic reasoning about integer operations and minimal-operation sequences, falling squarely within the Coding & Algorithms domain.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve sliding window, heap, DP, in-place tasksHard

  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.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate a Generalized Word AbbreviationMedium

  Validate whether a lowercase word matches a generalized abbreviation whose positive numbers skip characters. Enforce exact letter matching, full consumption, multi-digit counts, and the prohibition on leading zeroes.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Implement Markdown-to-HTML parserMedium

  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.

  SamsaraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Parse Markdown Links Without RegexMedium

  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.

  SamsaraSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count islands in a binary gridEasy

  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.

  SamsungSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize sum of non-adjacent valuesMedium

  This question evaluates algorithmic problem-solving skills, specifically understanding of dynamic programming and optimization when selecting non-adjacent elements, within the Coding & Algorithms domain.

  SamsungMachine Learning EngineerCoding & AlgorithmsOnsite
• Validate palindrome with constraintsMedium

  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.

  SamsungMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement JavaScript utility and API functionsMedium

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

  SapSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute clock hand angle with seconds and millisecondsMedium

  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.

  Scale AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute party time blocks per neighborhoodMedium

  This question evaluates a candidate's ability to perform interval merging and temporal aggregation across joined datasets, testing algorithmic efficiency, data-processing skills, and handling of sorting and grouping in the Coding & Algorithms domain.

  Scale AISoftware EngineerCoding & AlgorithmsOnsite
• Find LCA in a N-ary tree via DFSMedium

  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.

  Scale AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Dependency-Aware Task SchedulerHard

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

  Scale AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Dependency-Aware Task SchedulerEasy

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

  Scale AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Task ProcessorMedium

  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.

  Scale AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement multi-head attention and LLM samplingEasy

  This problem tests your ability to implement the core mechanics of a Transformer's attention mechanism and the logic required to sample the next token from a model's output logits.

  Scale AIMachine Learning EngineerCoding & AlgorithmsOnsite
• Schedule Ready Tasks by DeadlineMedium

  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.

  Scale AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute probability last passenger gets own seatMedium

  This question evaluates a candidate's understanding of probability theory, combinatorics, and reasoning about sequential random processes, with emphasis on symmetry and conditional dependence.

  SchonfeldData ScientistCoding & AlgorithmsOnline Assessment
• Find smallest N for 5-and-21 sumsMedium

  This question evaluates understanding of integer linear combinations and elementary number theory, framed as a Frobenius coin problem that examines representability using non-negative multiples of 5 and 21.

  SchonfeldData ScientistCoding & AlgorithmsOnline Assessment
• Decode Ambiguous Morse MessagesMedium

  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.

  SealthSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement one-cluster k-meansEasy

  This question tests the ability to implement a one-cluster k-means algorithm (finding the geometric centroid) and understanding of the mathematical property that minimizes sum of squared errors.

  SealthMachine Learning EngineerCoding & AlgorithmsOnsite
• Find Shared Motion Periods Across Camera StreamsMedium

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

  ServalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Summarize Transcript Events in a Sliding WindowMedium

  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.

  Sesame AiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve array modulo and parentheses tasksMedium

  This question evaluates proficiency in modular arithmetic and subarray-sum reasoning for remainder counting, together with string manipulation and parentheses-balancing competencies, testing algorithmic problem-solving, correctness justification, and implementation skills in the Coding & Algorithms domain.

  SheinSoftware EngineerCoding & AlgorithmsOnsite
• Count Pairs with the Minimum Absolute DifferenceEasy

  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.

  Shield AiSoftware EngineerCoding & AlgorithmsTechnical Screen
• Calculate Jaccard Similarity Score for Two String ListsMedium

  This question evaluates understanding of similarity metrics and competency in comparing string collections, reflecting knowledge of set-theoretic concepts and manipulation of collection data structures used in data processing.

  ShopifyData ScientistCoding & AlgorithmsOnsite
• Compute Jaccard Similarity for ListsMedium

  This question evaluates understanding of Jaccard similarity and set-based operations, assessing competency in deduplicating lists, precise string comparisons (case-sensitivity and whitespace), and handling edge cases.

  ShopifyData ScientistCoding & AlgorithmsTechnical Screen
• Compute Theme SimilarityMedium

  This question tests the ability to implement a set-based similarity metric, specifically the Jaccard index, to compare collections of theme-related features.

  ShopifyData ScientistCoding & AlgorithmsTechnical Screen
• Grid Robot Command SimulatorMedium

  Implement a 2D grid simulation for an automated warehouse robot executing movement and rotation commands while respecting boundaries and obstacles.

  ShopifySoftware EngineerCoding & AlgorithmsTechnical Screen
• Identify Pirate Themes Using Similarity Score AlgorithmMedium

  This question evaluates understanding of similarity scoring, set-based comparison of structured records, and practical data deduplication techniques commonly used in data science.

  ShopifyData ScientistCoding & AlgorithmsTechnical Screen