READ. UNDERSTAND. PRACTICE.
Interview questions
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
1,290 resources · Page 51 of 54
Interview questions · DRW
Solve three algorithmic OA tasks
Solve three algorithmic OA tasks 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.
Interview questions · Uber
Solve three algorithmic optimization and search problems
This multi-part question evaluates algorithmic problem-solving skills in combinatorial optimization and graph theory, covering task assignment under cardinality constraints (maximizing reward when exactly k tasks go to one worker) and directed-tree reorientation to create a single reachable root.
Interview questions · Meta
Solve Three Coding Interview Problems
This set of tasks evaluates proficiency in data structures and algorithms, covering tree traversal and lowest common ancestor reasoning, interval merging and overlap resolution, and combinatorial subset selection under uniqueness constraints.
Interview questions · Amazon
Solve three coding tasks: binary search, tree path, subarray
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve three coding tasks: binary search, tree path, subarray states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Oracle
Solve three DSA problems: trie, window, intervals
This multi-part question evaluates proficiency with core data structures and algorithms — specifically trie-based string indexing and autocomplete design, sliding-window/prefix-sum optimization for maximizing a one-shot decrypted range, and interval merging — within the Coding & Algorithms domain, emphasizing practical implementation, complexity analysis and edge-case handling. It is commonly asked in technical interviews to assess the ability to design efficient data structures and linear-time algorithms, reason about time/space trade-offs and ordering constraints, and demonstrate both conceptual understanding and practical application through clear complexity analysis.
Interview questions · Booking.com
Solve three OA coding questions
This 90-minute assessment evaluates algorithmic problem-solving skills including string manipulation and grouping for anagram detection, digit-level reasoning for one-swap maximization, and text tokenization with aggregation and ranking for sentiment-based scoring.
Interview questions · Microsoft
Solve three scheduling and array problems
This multi-part question evaluates algorithmic problem-solving skills across task scheduling with cooldowns, in-place array deduplication, and string rearrangement to avoid adjacent duplicates, highlighting concepts such as frequency counting, scheduling constraints, and two-pointer or in-place techniques within the Coding & Algorithms domain.
Interview questions · TikTok
Solve Topological Sort and Anagram Indices
This question evaluates algorithmic problem-solving and implementation skills across graph algorithms (topological sort and cycle detection) and string algorithms (anagram substring search) in the Coding & Algorithms domain.
Interview questions · Current
Solve transaction aggregation and search tasks
Solve transaction aggregation and search tasks 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.
Interview questions · DoorDash
Solve tree distance and design file system
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve tree distance and design file system states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Meta
Solve tree traversal and interval merging tasks
This question evaluates algorithmic problem-solving and data-structure competency, focusing on binary tree traversal and column-wise ordering (including BFS versus DFS trade-offs) as well as interval merging and sorting strategies for scheduling.
Interview questions · Bloomberg
Solve two array and string problems
This two-part question evaluates combinatorial enumeration and subset-generation concepts for arrays alongside string parsing and parentheses-sequence validation for noisy input, measuring algorithm design, correctness, and complexity reasoning in array and string contexts.
Interview questions · Amazon
Solve two set and graph problems
This question evaluates proficiency in data-structure manipulation (set operations, mapping and deduplication), directed-graph modeling and traversal for reachability, and algorithmic time/space complexity analysis.
Interview questions · NVIDIA
Solve unique triplets summing to target
Solve unique triplets summing to target 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.
Interview questions
Solve window-function SQL without joins
This question evaluates proficiency with SQL window functions, including running and cumulative sums, LAG/forward-fill event logic, ranking functions (RANK/DENSE_RANK/ROW_NUMBER), tie-breaking strategies, and temporal date arithmetic for payments and subscription events.
Interview questions · Meta
Solve word count, node, segmentation, stock tasks
This multipart question evaluates skills in tokenization and streaming text processing, generic rooted-tree data-structure design and traversal APIs, dictionary-based string segmentation (dynamic programming and prefix/prefix-structure optimization), and constrained algorithmic optimization for stock-trading problems.
Interview questions · Bloomberg
Solve word path in grid and trapped water
This pair of problems evaluates algorithmic problem-solving skills in arrays and grids, covering concepts like graph traversal/backtracking for 2D word path search and array processing techniques for computing trapped water, and tests understanding of data structures, traversal strategies, and complexity analysis.
Interview questions · Intuit
Solve word segmentation and React palindrome validation
This question evaluates competencies in string algorithms (word segmentation and palindrome validation), data structures and complexity analysis, and practical frontend React implementation with performance considerations.
Interview questions · Experian
Sort and Rearrange: Efficient Algorithms for Diverse Challenges
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Sort and Rearrange: Efficient Algorithms for Diverse Challenges states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Amazon
Spreadsheet Formulas with Dependency Updates
Implement spreadsheet SET, SUM, and GET operations with live formulas, repeated-reference multiplicity, and efficient dependency updates.
Interview questions · Palantir
Stack Item and Category Coupons with an Eighty-Percent Cap
Apply multiplicative item and category discounts, cap unrounded savings at eighty percent, and round each final item discount once.
Interview questions · LinkedIn
Sum Every Element of an N-Dimensional Array Readable Only by Index Lists
Compute the sum of all elements of an array with any number of dimensions when the array exposes only its dimension sizes and a get method that reads one element from a full list of indices. It tests systematic enumeration of every index combination and exact handling of sums beyond the 32-bit range.
Interview questions · IBM
Sum the XOR of Every Cross-Array Pair
Compute the sum of XOR values across every pair drawn from two integer arrays without enumerating the full Cartesian product. The problem tests bit-frequency reasoning, duplicate handling, and overflow-safe accumulation under large input limits.
Interview questions · MongoDB
Summarize background, challenge project, and failure
This prompt evaluates leadership, technical ownership, communication, system-design reasoning, and incident-analysis competencies by requesting a concise career narrative, a deep-dive into a challenging project (including constraints, trade-offs, architecture, validation, and metrics), and a meaningful failure retrospective.