Coding & Algorithms interview questions

Showing 2311–2340 of 3276 results

• Find list pair with maximum overlapMedium

  This question evaluates proficiency with set operations and similarity metrics (Jaccard), scalable algorithm design and complexity analysis for large datasets, and the ability to handle streaming updates and deterministic tie-breaking.

  PinterestData ScientistCoding & AlgorithmsOnsite
• Find minimum shuttle transfersMedium

  Find minimum shuttle transfers 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.

  PinterestSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Minimum Number of Coins for an AmountMedium

  Tests dynamic programming and breadth-first search techniques to find the minimum number of coin denominations required to reach a target value, including edge cases like zero and unreachable sums.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• First Word Matching Each Prefix QueryMedium

  This problem tests your ability to efficiently query a list of strings to find the first occurrence that matches a given prefix, focusing on optimal space-time tradeoffs using tree-based or map-based indexing.

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• Generate all hyperparameter combinationsMedium

  This problem tests your ability to generate the Cartesian product of multiple lists, a fundamental task in grid search for hyperparameter tuning.

  PinterestMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Hierarchical Access Control for an Advertising PlatformMedium

  This problem tests graph traversal algorithms and efficient membership checking within a directed acyclic graph (DAG) representing hierarchical organizational permissions.

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• How to Design a Proportional Randomized Sampler?Medium

  This question evaluates proficiency in randomized algorithms and probabilistic sampling, with emphasis on numerical precision, large-weight handling, and memory-versus-accuracy trade-offs. Commonly asked in Coding & Algorithms interviews for data-science roles, it assesses practical application ability grounded in conceptual understanding of numerical stability and relevant data-structure choices.

  PinterestData ScientistCoding & AlgorithmsOnsite
• Implement Data Structure for Top-K Elements in StreamsMedium

  This question evaluates competency in streaming algorithms, dynamic data structures for maintaining top-K elements in real time, and scalability considerations for handling large or distributed input streams.

  PinterestData ScientistCoding & AlgorithmsOnsite
• Implement Function to Return First n Prime NumbersMedium

  This question evaluates algorithmic problem-solving and basic number-theory competency by requiring generation of prime numbers with attention to correctness and performance characteristics.

  PinterestData ScientistCoding & AlgorithmsOnsite
• Implement Jackknife and Random ChoiceMedium

  Implement weighted random selection from scratch and compute delete-1 jackknife estimates of parameter bias and standard error for an arbitrary statistical estimator.

  PinterestData ScientistCoding & AlgorithmsTechnical Screen
• Implement LRUCache with O(1) Operations and Thread SafetyMedium

  This question evaluates a candidate's ability to implement a constant-time LRU cache and reason about thread-safety and concurrent access, testing data structure design and concurrency competencies in the Coding & Algorithms domain.

  PinterestData ScientistCoding & AlgorithmsOnsite
• Implement a Sparse Matrix ClassMedium

  Design and implement a memory-efficient sparse matrix class supporting entry retrieval, updates, addition, and matrix multiplication.

  PinterestMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement a Stateful Search Autocomplete SessionHard

  Design an interactive autocomplete system that tracks query frequencies, returns the top 3 ranking prefix matches per keystroke, and commits completed queries to dynamic history.

  PinterestMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement a min-heap column allocatorMedium

  This question evaluates a candidate's competency in data structures (priority queues/min-heaps), online algorithm design for stream processing, and complexity and memory analysis.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement and extend My Calendar IIIMedium

  This question evaluates competency in designing and implementing efficient dynamic interval data structures, handling correctness for duplicate and nested intervals, extending APIs with cancellation and point queries, and performing rigorous worst-case time/space analysis and resource-adaptation.

  PinterestData ScientistCoding & AlgorithmsTechnical Screen
• Implement np.random.choiceEasy

  This problem tests your ability to implement weighted random sampling from an array, focusing on probability distribution handling and efficient selection algorithms.

  PinterestData ScientistCoding & AlgorithmsTechnical Screen
• Implement sparse matrix storage, addition, and multiplicationMedium

  This problem tests your ability to design a memory-efficient representation for sparse matrices and implement arithmetic operations while leveraging the sparsity of the data.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Implement stream line reader and settle balancesMedium

  This question evaluates streaming I/O and buffered string-processing competency for Part 1 and transaction netting with balance computation for Part 2, covering skills in memory-bounded parsing, data-structure bookkeeping, and algorithmic flow reasoning.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Implement string-based big integer multiplicationMedium

  Implement multiplyStrings(a, b) to multiply two non-negative integers given as decimal strings, returning the product as a string without any big-integer or arbitrary-precision library. The solution covers grade-school O(n*m) long multiplication with linear memory, the Karatsuba and FFT/NTT scaling alternatives, correct carry and leading/trailing-zero handling, and a full edge-case test plan.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Implement string-based rounding without floatsEasy

  This question evaluates proficiency in string-based numeric processing, arbitrary-precision arithmetic concepts, precise rounding rules including deterministic tie-breaking, and handling of sign and decimal edge cases, and falls under the Coding & Algorithms domain.

  PinterestMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement trie-based autocompleteHard

  This problem tests your ability to implement a space-efficient Trie data structure capable of storing strings along with associated weights to return top-k suggestions for a given prefix.

  PinterestMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement weighted random choiceMedium

  This problem tests your ability to implement efficient weighted random selection, specifically focusing on cumulative distribution functions and binary search to achieve optimal query performance.

  PinterestData ScientistCoding & AlgorithmsTechnical Screen
• Insert Operators to Reach a TargetMedium

  Tests backtracking with operator precedence handling and operand formatting to construct all valid arithmetic expressions evaluating to a target value.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• List All Plus/Times Expressions Reaching a Target Under Operator PrecedenceHard

  Tests backtracking and state tracking with operator precedence to evaluate and enumerate arithmetic expressions using addition and multiplication.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• List Unallocated Experiment BucketsMedium

  Determine all unassigned experiment bucket IDs in the range [0, total_buckets - 1] given lists of control and treatment bucket allocations.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Mark and Compact a Heap-Indexed SubtreeMedium

  This problem tests array manipulation, heap-based tree traversal, and stable partitioning techniques while requiring memory efficiency without modifying the original input.

  PinterestSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize Non-Overlapping Task Scheduling EfficiencyMedium

  This question evaluates understanding of interval scheduling and resource optimization, focusing on reasoning about time intervals and conflict-free selection of tasks.

  PinterestData ScientistCoding & AlgorithmsOnsite
• Minimum Transfers Between Pin BoardsMedium

  Tests breadth-first search and graph modeling skills by finding the shortest path across overlapping collections without constructing a dense graph between every pair.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite
• Rebalance Experiment Buckets with Minimal ReassignmentMedium

  Implement a deterministic rebalancing algorithm that redistributes entities among experiment buckets to meet exact target counts while minimizing reassignments and applying canonical tie-breaking.

  PinterestSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reconstruct an Itinerary from Flight TicketsMedium

  Tests graph modeling, depth-first search (DFS), and Hierholzer's algorithm to construct an Eulerian path with lexicographical tie-breaking.

  PinterestSoftware EngineerCoding & AlgorithmsOnsite