READ. UNDERSTAND. PRACTICE.
Interview questions
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
1,290 resources · Page 50 of 54
Interview questions · Fidelity
Solve concurrency in Java
Solve concurrency in Java 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 · Meta
Solve four algorithmic problems
This multi-part question evaluates algorithmic problem-solving and data-structure proficiency across string processing (validating parentheses with minimal deletions), tree operations (lowest common ancestor using parent pointers), nested-structure traversal and accumulation (depth-weighted sum), and geometric selection/ordering (k closest points).
Interview questions · Meta
Solve four data structure and algorithms tasks
This set of tasks evaluates core algorithmic competencies such as tree traversal and level-order processing, data-structure design and counting maps, recursive subtree aggregation for statistical checks, and optimization/search techniques for partitioning problems, all within the Coding & Algorithms domain.
Interview questions · Apple
Solve interval, grid-fill, and heap tasks
These combined tasks evaluate algorithmic problem-solving and data-structure design skills, specifically interval aggregation and counting over large timestamp ranges, constructive grid-filling with 4-directional connectivity constraints, and multiset operations supporting efficient retrieval and removal of minima and maxima.
Interview questions · Grammarly
Solve interval merge and string dedup problems
This set of questions evaluates algorithmic reasoning for array and string manipulation, specifically competencies in interval merging, detection and elimination of adjacent duplicates, and handling grouped removals under input and performance constraints.
Interview questions · ByteDance
Solve interval merging and histogram area
This question evaluates algorithmic problem-solving skills focused on interval manipulation and histogram-based area computation, emphasizing data structures, ordering, and reasoning about time and space complexity.
Interview questions · Meta
Solve linked list, top-K, and string reduction
Solve linked list, top-K, and string reduction 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 · Meta
Solve linked list, tree, and grid problems
This set evaluates mastery of core data structures and algorithmic reasoning across singly linked lists (cycle entry detection), binary search trees with parent pointers (in-order successor), constant-time state tracking for n×n game boards, and grid connectivity for maximizing component size, emphasizing pointer manipulation, traversal logic, state-design, and component analysis. Commonly asked to gauge proficiency in Coding & Algorithms and complexity analysis, these problems test both conceptual understanding of traversal and connectivity principles and practical application of space- and time-efficient implementations under typical interview constraints.
Interview questions · Spokeo
Solve Logic Puzzles: Algorithms and Proofs Required
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 Logic Puzzles: Algorithms and Proofs Required states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Bloomberg
Solve Magic Dictionary and unknown traversal
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 Magic Dictionary and unknown traversal states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Meta
Solve matrix diagonal and sliding-window statistics
Solve matrix diagonal and sliding-window statistics 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 · DRW
Solve movie ratings, array, release scheduler
This question tests algorithmic problem-solving across three domains: greedy array optimization, tree-based data structure design, and efficient sequence merging. It evaluates practical coding ability and complexity analysis, commonly used in quantitative and data science interviews to assess how candidates identify inefficiencies and select the right data structure to improve performance.
Interview questions · Amazon
Solve Nearby Inventory and Word Segmentation Tasks
Implement two independent tasks: identify stocked centers close enough to a graph destination and return any exact dictionary segmentation of a string. Handle disconnected routes, duplicate edges, missing inventory, repeated suffix work, and large inputs while explaining complexity.
Interview questions · Meta
Solve palindrome-check and vertical-order traversal
This prompt evaluates string-processing and tree-traversal competencies by asking whether a string can become a palindrome after at most one deletion and by requiring a vertical-order traversal of a binary tree, testing understanding of palindrome properties, node ordering, and handling of edge cases in the coding and algorithms domain.
Interview questions · Meta
Solve peak element and unique word abbreviation
This question evaluates algorithmic design and data-structure skills by combining a binary-search peak-finding problem with a string-abbreviation uniqueness problem, testing competence in time-complexity reasoning and creation of minimal unique representations.
Interview questions · Capital One
Solve powers, phases, grid pops, and swaps
This multi-part Coding & Algorithms question evaluates algorithmic problem-solving competencies including number-theoretic checks for powers, modular date arithmetic, grid-based graph traversal and simulation with gravity, string manipulation with combinatorial matching, and analysis of time and space complexity.
Interview questions · Meta
Solve PTO window and sparse unique counting
Solve PTO window and sparse unique counting 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 · Amazon
Solve server updates and grid inconvenience minimization
This question evaluates a candidate's ability to design efficient dynamic data structures and algorithms for large-scale batch updates and for optimizing grid-based metrics, testing skills in update/query efficiency, metric-space reasoning (Chebyshev distance), and rigorous complexity and edge-case analysis.
Interview questions · Meta
Solve sliding window and tree BFS
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 sliding window and tree BFS states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Meta
Solve SQL and Python coding tasks
This question evaluates SQL proficiency in relational querying (joins, filtering, aggregation) and Python algorithmic problem-solving for non-adjacent selection, measuring a data engineer's ability to manipulate relational data and implement efficient algorithms.
Interview questions · Wayfair
Solve SQL and Python OA tasks
This question evaluates SQL and pandas data-manipulation skills, including joined aggregations over date windows, handling of missing values with median imputation, and multi-criteria sorting and tie-breaking.
Interview questions · Uber
Solve stock profit and vertical tree traversal
Assesses proficiency in array processing and binary tree traversal algorithms—specifically single-pass analysis of time-series data and coordinate-based vertical ordering of tree nodes; Category: Coding & Algorithms; Level of abstraction: implementation-level algorithmic coding.
Interview questions · Goldman Sachs
Solve string and hashmap interview tasks
This question evaluates proficiency in string manipulation and hash-based aggregation, specifically skills such as frequency counting, map/dictionary usage, and numeric aggregation for averages.
Interview questions · TikTok
Solve three algorithm tasks
This multi-part question evaluates algorithmic problem-solving across string processing (text justification), handling ambiguous state in sequence validation (parentheses with wildcards), and grid graph traversal with path reconstruction, testing competencies in formatting and spacing logic, state-tracking for correctness under uncertainty, and shortest-path search and reconstruction. It is commonly asked in Coding & Algorithms interviews to assess correctness under edge cases, ability to reason about trade-offs and invariants, and the analysis of time and space complexity, requiring both conceptual understanding and practical implementation skills.