READ. UNDERSTAND. PRACTICE.
Interview questions
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
1,290 resources · Page 34 of 54
Interview questions · Chariot
Explore an HTTP Maze
This question evaluates the ability to integrate HTTP-based APIs with graph traversal and state management, covering concepts such as breadth-first exploration for shallow-first search, cycle avoidance, transient error handling, and key-lock resource constraints.
Interview questions · Meta
Explore Behavioral Growth and Adaptability in Data Science.
Meta data scientist behavioral deep-dive covering growth mindset, failure learning, adaptability, cross-team trust, conflict handling, inclusion, STAR-L storytelling, and quantified impact.
Interview questions · Meta
Extend a Maze Solver
This question evaluates algorithmic problem-solving and software engineering skills, specifically graph traversal (BFS), state-space modeling for keys and doors, handling movement constraints, and debugging an existing codebase within the Coding & Algorithms domain.
Interview questions · Amazon
Facilitate Effective Collaboration in Tech Data-Science Teams
This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Facilitate Effective Collaboration in Tech Data-Science Teams states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Optiver
Fastest 1000 Meters: Max Average Speed from 5-Second Distance Splits
Given the meters a runner covers in each consecutive 5-second interval, find the highest average speed over any continuous stretch of exactly 1000 meters, where stretches may start or end mid-interval. Tests sliding-window reasoning, linear interpolation at boundaries and edge cases such as one interval exceeding 1000 meters.
Interview questions · Motive
Fetch and parse JSON from REST API
A Motive Software Engineer onsite coding exercise: build a small, resilient script from scratch that performs an authenticated HTTP GET against a paginated REST API, parses the JSON, extracts and transforms records, and produces both serialized CSV/JSON output and per-category top-k aggregates. It evaluates HTTP/REST integration, rate-limit and retry handling with backoff, timeouts, malformed-record handling, unit testing, logging, and complexity analysis.
Interview questions · Peregrine
Fetch, group, and print paginated activities
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Fetch, group, and print paginated activities states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Pinterest
Fewest Board Switches to Travel Between Two Pins via Shared Boards
Given boards that each hold a list of pins, where one pin can appear on several boards, compute the fewest board switches needed to travel from a start pin to an end pin. Tests graph modeling of shared memberships, minimum-step search, and careful handling of same-board and unreachable cases.
Interview questions · Aeonea
Fill missing values with means
This question evaluates proficiency in missing-data imputation and pandas DataFrame manipulation, testing skills in column-wise aggregation, group-wise operations, and edge-case handling within the Data Manipulation (SQL/Python) domain.
Interview questions · TikTok
Find and count target-sum subarrays
Find and count target-sum subarrays 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
Find Any Local Minimum with Iterative Binary Search
Find the index of any strict local minimum in a nonempty array whose adjacent values differ, using an iterative logarithmic-time algorithm. The task tests search invariants, boundary-as-infinity semantics, singleton and monotone arrays, and correctness when several indices are valid.
Interview questions · Meta
Find balanced subarray and increasing tree path
This question evaluates array and tree algorithm skills, testing competency in identifying longest balanced subarrays in binary sequences and locating maximal strictly increasing downward paths in binary trees.
Interview questions · Microsoft
Find common friends from directed edges
This question evaluates a candidate's ability to manipulate relational data and reason about graph reciprocity, specifically testing SQL query formulation, aggregation, deduplication, and indexing for performance in the Data Manipulation (SQL/Python) domain.
Interview questions · Oracle
Find Each Island's Maximum Height
Practice connected-component traversal on a height grid while returning each island's maximum in a canonical discovery order.
Interview questions · ZipHQ
Find flush and straight groups in cards
This question evaluates array and string manipulation, grouping and sequence-detection competencies, specifically handling same-rank aggregation and same-suit consecutive runs with overlap and maximality considerations.
Interview questions · LinkedIn
Find k closest values in a BST
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find k closest values in a BST states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · PayPal
Find k most frequent in linear time
This question evaluates a candidate's ability to design and analyze efficient frequency-counting algorithms and related data structures, testing competencies in hashing, bucket-based grouping, heap usage, and time/space complexity reasoning.
Interview questions · Capital One
Find lexicographically smallest string and elimination order
These problems evaluate string-manipulation and algorithmic-simulation competencies—specifically lexicographic ordering and prefix/suffix transformations for the first problem, and cumulative-time aggregation with elimination and lexicographic tie-breaking for the second.
Interview questions · Amazon
Find longest common contiguous subarray
This question evaluates a candidate's proficiency in array and substring algorithm design, including concepts such as dynamic programming, hashing, and efficient search techniques.
Interview questions · Meta
Find mode or minimum with time-space tradeoffs
This question evaluates algorithm design and analysis skills—particularly time–space tradeoffs, frequency counting techniques (sorting, hashing, and counting arrays), and handling streaming or memory-constrained inputs in the Coding & Algorithms domain.
Interview questions · Uber
Find Robots by Nearest-Blocker Distances
Locate every robot whose left, top, bottom, and right distances to the nearest blocker or grid boundary match a four-value query.
Interview questions · Meta
Find shortest path and compare BFS vs DFS
This question evaluates understanding of graph traversal and shortest-path concepts, specifically the differences between BFS and DFS, algorithmic complexity analysis, and adaptation for weighted graphs within the coding & algorithms domain.
Interview questions · Meta
Find target using robot movement API
This question evaluates a candidate's ability to design exploration and state-space search strategies for a robot operating in an unknown, partially blocked 2D grid using a constrained movement and sensing API, testing competency in traversal algorithms, state management, and handling limited observability.
Interview questions · Salesforce
Find the Kth Smallest Value in a Binary Search Tree
Return the one-based kth smallest value from a potentially deep binary search tree represented by parallel value and child-index arrays. Handle empty trees and out-of-range values of k using the specified sentinel.