Coding & Algorithms interview questions

Showing 2341–2370 of 3276 results

• Reconstruct itinerary with lexicographic tiesMedium

  This question evaluates a candidate's ability to model and traverse directed graphs with repeated edges, enforce lexicographic ordering among possible paths, and analyze time and space complexity for an algorithmic solution.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reconstruct route from unordered travel ticketsMedium

  This problem tests your ability to model a graph where each edge represents a transition, requiring you to find a valid linear sequence that visits every node exactly once.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Remove and Compact a Parent-Index ForestMedium

  Tests tree traversal to find subtrees, array compaction, and index remapping on a parent-pointer forest representation without mutating input data.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Round numeric string valuesMedium

  This question evaluates parsing and numeric manipulation skills, specifically implementing rounding rules for numeric strings and handling decimals, significant digits, and precision edge cases.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Select the Nearest Eligible ElevatorMedium

  Implement an elevator dispatch selection algorithm that finds the nearest eligible elevator for a passenger request based on floor, direction, and tie-breaking rules.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Settle Group Expenses with TransfersMedium

  This question evaluates the ability to compute and reconcile per-person financial balances from transactional data and to translate net liabilities into direct transfers, exercising skills in numeric bookkeeping and data aggregation.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Settle debts with minimal transactionsMedium

  Pinterest software-engineer onsite coding question: given a list of debts as (debtor, creditor, amount) triples, return settlement transfers that clear every net balance using the minimum number of transactions. It tests reducing to net balances, recognizing the problem is NP-hard, backtracking with pruning to find the optimum for small N, and a heap-based greedy heuristic plus correctness and time/space complexity analysis for large, skewed debt graphs.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Solve Expression and Tree-List ProblemsMedium

  This problem tests recursive backtracking for expression generation and pointer manipulation for in-place tree-to-linked-list conversion.

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve Four Interview Coding ProblemsMedium

  This set tests proficiency in graph algorithms, binary search on sorted data, grid simulations, and custom data structure design for real-time leaderboards.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Solve Multiple Coding Interview ProblemsMedium

  Tests breadth-first search and bipartite/dual-graph modeling to find the minimum number of transit lines needed to travel between two stops.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Two Grid Search ProblemsMedium

  This problem tests your ability to navigate 2D grids and apply graph traversal algorithms to identify connected components and calculate propagation distances.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve a 9x9 Sudoku puzzleHard

  This question evaluates algorithmic problem-solving skills focused on constraint satisfaction, state-space search, and implementation correctness for combinatorial puzzles.

  PinterestMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Solve five hard algorithm problemsMedium

  This problem tests your ability to optimize range-based operations using a difference array or prefix sum strategy and demonstrates your skill in balancing computational efficiency with memory constraints.

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve prefix, array, and string problemsMedium

  This problem tests your ability to efficiently manage prefix-based string searching using a Trie data structure, specifically focusing on handling wildcard character matching.

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve set equality and ad log top‑KMedium

  This multi-part question evaluates set and multiset operations, frequency counting, top-K computation over time windows, sliding-window and streaming data structures, and character-multiset matching for string construction within the coding & algorithms domain.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Support room moves and query top-k fastestHard

  This problem tests your ability to design a data structure that efficiently manages room assignments and retrieves the top-k rooms based on a primary priority (number of people) and a secondary priority (earliest arrival time).

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement Euclidean distance and k-nearest neighborsEasy

  This question evaluates understanding of Euclidean distance metrics, vector arithmetic, and nearest-neighbor retrieval, testing implementation skills for computing distances and selecting the k closest points.

  PitchbookSoftware EngineerCoding & AlgorithmsOnsite
• Calculate Ordered Job Makespan Across Parallel WorkersMedium

  Calculate the total makespan required to process a queue of ordered jobs across a fixed pool of identical parallel workers.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute discounted prices in a queueMedium

  This question evaluates proficiency in array processing, algorithm design, use of auxiliary data structures such as monotonic stacks, and formal complexity and correctness reasoning.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Completed Jobs in a Serial Multi-Worker PipelineMedium

  Calculate the total number of jobs completed by a given deadline across a multi-stage pipelined system with worker pools. The solution requires simulating stage-by-stage batch execution, tracking wave durations, and enforcing barrier synchronization between stages.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Completed Jobs in a Serial Single-Worker PipelineMedium

  Determine the total number of jobs completed by a single worker executing a sequence of stage-gated tasks before a time limit expires. Tests linear simulation, division/modulo arithmetic, handling of zero-duration and zero-count edge cases, and 64-bit integer safety.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a coupon redemption systemMedium

  This question evaluates proficiency in data structures and algorithms for building an in-memory service, including efficient lookup/update strategies, expiration handling, limit enforcement, idempotency, concurrency considerations, and time/space complexity reasoning.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Resolve routing-number to bank mappingEasy

  This question evaluates a candidate's skills in data normalization, deduplication, aggregation, and conflict resolution across multiple JSON data sources, with emphasis on canonicalization of aliases and handling inconsistent mappings.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate Evaluation Chains and Resolve Boolean OutcomesMedium

  Implement a graph traversal to resolve Boolean evaluation chains with negation, detecting cycles, paths leading to cycles, and undefined references in linear time.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate and Resolve Chained Decision RulesMedium

  Determine if all rules in a chained decision rule set resolve to a terminal 'pass' outcome without cycles or missing references.

  PlaidSoftware EngineerCoding & AlgorithmsTechnical Screen
• Classify relationships for multiple circle pairsMedium

  This question evaluates computational geometry skills, careful integer arithmetic for numeric precision, case-based classification logic, and analysis of time and space complexity in the Coding & Algorithms domain for Data Scientist roles.

  Point72Data ScientistCoding & AlgorithmsTechnical Screen
• Determine Circle Intersection Status for Rendering OrderMedium

  This question evaluates geometric reasoning and computational-geometry competency, including spatial relationship analysis and handling numerical edge cases relevant to pairwise object interaction.

  Point72Data ScientistCoding & AlgorithmsTechnical Screen
• Find kth missing integer and redundant operationsEasy

  This paired question evaluates array and algorithmic skills — specifically order-statistics and missing-number reasoning for the k-th missing positive, and time-window aggregation with frequency tracking for detecting redundant log events — within the coding & algorithms domain.

  Point72Data ScientistCoding & AlgorithmsOnline Assessment
• Find the Minimum in a Rotated Sorted ArrayMedium

  A strictly increasing array of distinct integers has been rotated at an unknown pivot. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

  Point72Quantitative ResearcherCoding & AlgorithmsTechnical Screen
• Find the Smallest String After One DecrementMedium

  This question evaluates string manipulation, lexicographic ordering, and reasoning about local character transformations including wrap-around behavior.

  Point72Machine Learning EngineerCoding & AlgorithmsTechnical Screen