Coding (Algo) · Easy · 20 min
Missing Result Pages
Algorithm: Hash set Difficulty: Easy Time: 20 minutes Goal Return page numbers from 1 through total that have not been cached.
View taskPublic task directory
Technical interview practice tasks
Every entry below is a crawlable link to a unique public task page. This directory complements the interactive filters and keeps the complete catalog connected through standard pagination.
Page 3 of 386 · 18,491 tasks
Coding (Algo) · Easy · 20 min
Shared Record IDs
Algorithm: Hash set Difficulty: Easy Time: 20 minutes Goal Return the set intersection in ascending numeric order.
View taskCoding (Algo) · Medium · 45 min
Merge Sorted Feeds
Algorithm: Heap Difficulty: Medium Time: 45 minutes Goal Merge all integer feeds while retaining duplicate timestamps.
View taskCoding (Algo) · Hard · 45 min
Report the Median After Every Reading
Algorithm: Heap Difficulty: Hard Time: 45 minutes Goal Return an array containing the median of every non-empty input prefix in the same order as the readings arrive.
View taskCoding (Algo) · Easy · 20 min
First Invalid Field
Algorithm: Input validation Difficulty: Easy Time: 20 minutes Goal Return the first field ID in layout order that appears in the error set.
View taskCoding (Algo) · Medium · 35 min
Merge Busy Slots
Algorithm: Intervals Difficulty: Medium Time: 35 minutes Goal Merge overlapping or touching half-open intervals and return them in chronological order.
View taskCoding (Algo) · Medium · 30 min
Merge Coverage Ranges
Algorithm: Intervals Difficulty: Medium Time: 30 minutes Goal Merge overlapping or touching closed intervals and return disjoint ranges in ascending start order.
View taskCoding (Algo) · Easy · 25 min
Count Records Before a Repeated Link
Algorithm: Linked list Difficulty: Easy Time: 25 minutes Goal Count distinct node indexes visited from head before reaching null or attempting to revisit an already seen node.
View taskCoding (Algo) · Medium · 35 min
Read a Record From the Preview End
Algorithm: Linked list Difficulty: Medium Time: 35 minutes Goal Return the stored value k positions from the end of the distinct reachable traversal or null when that preview has no such.
View taskCoding (Algo) · Medium · 35 min
Find the Shared Ancestor
Algorithm: Lowest common ancestor Difficulty: Medium Time: 35 minutes Goal Return the value of the lowest common ancestor of p and q, or null when either value is not reachable from the.
View taskCoding (Algo) · Easy · 15 min
Total the Primary Matrix Diagonal
Algorithm: Matrices Difficulty: Easy Time: 15 minutes Goal Return the signed sum of matrix[i][i] for every row index and exclude all off-diagonal cells.
View taskCoding (Algo) · Hard · 90 min
Maximum Replication Throughput
Algorithm: Maximum flow Difficulty: Hard Time: 90 minutes Goal Return maximum source-to-sink flow.
View taskCoding (Algo) · Hard · 50 min
Measure Network Transfer Capacity
Algorithm: Maximum flow Difficulty: Hard Time: 50 minutes Goal Return the maximum total integral flow from source to sink while respecting every link capacity and flow conservation at other.
View taskCoding (Algo) · Hard · 45 min
Count Target Subsets
Algorithm: Meet in the middle Difficulty: Hard Time: 45 minutes Goal Return the number of index subsets whose values sum to target. Each item may be selected at most once.
View taskCoding (Algo) · Medium · 45 min
Minimum Network Connection Cost
Algorithm: Minimum spanning tree Difficulty: Medium Time: 45 minutes Goal Return the minimum total weight of a spanning tree or null if the sites cannot all be connected.
View taskCoding (Algo) · Hard · 60 min
Required Service Wiring
Algorithm: Minimum spanning tree Difficulty: Hard Time: 60 minutes Goal Return the minimum total cost of a spanning tree that includes every required link and excludes every forbidden link.
View taskCoding (Algo) · Medium · 40 min
Find Earlier Lower Readings
Algorithm: Monotonic stack Difficulty: Medium Time: 40 minutes Goal Return the nearest earlier index with a strictly smaller value for each input position.
View taskCoding (Algo) · Hard · 45 min
Find the Largest Solid Rectangle
Algorithm: Monotonic stack Difficulty: Hard Time: 45 minutes Goal Return the maximum area of a rectangle spanning consecutive unit-width bars without exceeding any selected height.
View taskCoding (Algo) · Medium · 35 min
Find the Next Higher Reading
Algorithm: Monotonic stack Difficulty: Medium Time: 35 minutes Goal Return the first strictly higher value to the right of each measurement and null when no such value exists.
View taskCoding (Algo) · Medium · 40 min
Measure the Current High Span
Algorithm: Monotonic stack Difficulty: Medium Time: 40 minutes Goal Return the length of that ending period for every measurement in the supplied stream.
View taskCoding (Algo) · Medium · 30 min
Next Higher Reading
Algorithm: Monotonic stack Difficulty: Medium Time: 30 minutes Goal Return the first strictly greater value to the right of each index or -1 when no such value exists.
View taskCoding (Algo) · Easy · 25 min
Common Batch Size
Algorithm: Number theory Difficulty: Easy Time: 25 minutes Goal Return the greatest non-negative integer that divides every count without a remainder.
View taskCoding (Algo) · Medium · 40 min
Count Prime Shard Sizes
Algorithm: Number theory Difficulty: Medium Time: 40 minutes Goal Return how many prime integers are at least two and no greater than the supplied limit.
View taskCoding (Algo) · Medium · 40 min
Repeat a Modular Transform
Algorithm: Number theory Difficulty: Medium Time: 40 minutes Goal Return base raised to exponent modulo modulus as the canonical non-negative remainder.
View taskCoding (Algo) · Medium · 40 min
Synchronize Repeating Cycles
Algorithm: Number theory Difficulty: Medium Time: 40 minutes Goal Return the least common multiple of cycle magnitudes with exact integer arithmetic.
View taskCoding (Algo) · Medium · 40 min
Count Mirrored Text Ranges
Algorithm: Palindromes Difficulty: Medium Time: 40 minutes Goal Count all non-empty palindromic substrings by their start and end positions.
View taskCoding (Algo) · Medium · 40 min
Find the Longest Mirrored Range
Algorithm: Palindromes Difficulty: Medium Time: 40 minutes Goal Return the length of the longest contiguous palindromic substring without reconstructing it.
View taskCoding (Algo) · Easy · 25 min
Group Readings Around a Threshold
Algorithm: Partitioning Difficulty: Easy Time: 25 minutes Goal Return three ordered groups around the threshold while preserving every input occurrence.
View taskCoding (Algo) · Medium · 35 min
Count Overlapping Text Matches
Algorithm: Prefix function Difficulty: Medium Time: 35 minutes Goal Count every exact occurrence of pattern in text including overlapping matches and explicitly defined empty-pattern.
View taskCoding (Algo) · Hard · 45 min
Find a Pattern in a Stream
Algorithm: Prefix function Difficulty: Hard Time: 45 minutes Goal Return the first zero-based index where pattern matches text exactly in worst-case linear time or -1 if it never matches.
View taskCoding (Algo) · Easy · 20 min
Count Matching Name Prefixes
Algorithm: Prefix matching Difficulty: Easy Time: 20 minutes Goal Return how many entries in words begin with prefix, counting duplicates as separate matching records.
View taskCoding (Algo) · Medium · 40 min
Count Batch Aligned Periods
Algorithm: Prefix sum Difficulty: Medium Time: 40 minutes Goal Count all non-empty contiguous segments whose sum is evenly divisible by the positive divisor.
View taskCoding (Algo) · Medium · 35 min
Count Matching Ranges
Algorithm: Prefix sum Difficulty: Medium Time: 35 minutes Goal Implement solve(input) to return the number of non-empty contiguous ranges whose sum equals target. Count ranges by their start.
View taskCoding (Algo) · Hard · 45 min
Find the Longest Range Within Budget
Algorithm: Prefix sum Difficulty: Hard Time: 45 minutes Goal Return the greatest length of a non-empty contiguous segment whose signed sum is at most target or zero when no segment.
View taskCoding (Algo) · Hard · 45 min
Find the Shortest Signed Threshold Range
Algorithm: Prefix sum Difficulty: Hard Time: 45 minutes Goal Return the smallest length of a non-empty contiguous segment whose signed sum is at least target or zero if none qualifies.
View taskCoding (Algo) · Hard · 75 min
Historical Balance Ranges
Algorithm: Prefix sum Difficulty: Hard Time: 75 minutes Goal Answer inclusive account-range sums using entries at or before each query time.
View taskCoding (Algo) · Easy · 15 min
Ledger Prefix Balances
Algorithm: Prefix sum Difficulty: Easy Time: 15 minutes Goal Return the running balance after each adjustment.
View taskCoding (Algo) · Medium · 30 min
Products without Each Entry
Algorithm: Prefix sum Difficulty: Medium Time: 30 minutes Goal Return an array where output[i] is the product of all nums entries except nums[i] without using division.
View taskCoding (Algo) · Easy · 25 min
Total Readings Across Requested Periods
Algorithm: Prefix sum Difficulty: Easy Time: 25 minutes Goal Return one exact total for each requested inclusive period in the original query order.
View taskCoding (Algo) · Medium · 40 min
Combine Status Masks Across Periods
Algorithm: Prefix xor Difficulty: Medium Time: 40 minutes Goal Return the unsigned XOR of all masks in each inclusive query range in the requested order.
View taskCoding (Algo) · Medium · 35 min
Minimize Repeated Merge Work
Algorithm: Priority queue Difficulty: Medium Time: 35 minutes Goal Return the minimum total cost needed to combine all supplied batch lengths into one by repeatedly merging exactly two.
View taskCoding (Algo) · Medium · 40 min
Minimize the Largest Route Cost
Algorithm: Priority queue Difficulty: Medium Time: 40 minutes Goal Return the smallest achievable maximum edge weight along a directed source-to-target route and null when no route exists.
View taskCoding (Algo) · Easy · 15 min
Total One Array Range
Algorithm: Range boundaries Difficulty: Easy Time: 15 minutes Goal Return the sum of nums[left] through nums[right] inclusive without including values outside that range.
View taskCoding (Algo) · Easy · 20 min
Compress Status Runs
Algorithm: Run length encoding Difficulty: Easy Time: 20 minutes Goal Run-length encode adjacent equal statuses.
View taskCoding (Algo) · Medium · 40 min
Find the Lowest Reading in Each Period
Algorithm: Segment tree Difficulty: Medium Time: 40 minutes Goal Return the minimum numeric reading for every requested inclusive period without changing the snapshot.
View taskCoding (Algo) · Hard · 60 min
Live Validation Ranges
Algorithm: Segment tree Difficulty: Hard Time: 60 minutes Goal Apply point replacements and answer inclusive range sums of invalid counts.
View taskCoding (Algo) · Medium · 40 min
Select a Ranked Value
Algorithm: Selection Difficulty: Medium Time: 40 minutes Goal Return the kth largest entry with k counted from one, or null when k is outside the valid range.
View taskCoding (Algo) · Hard · 60 min
Bounded Transfer Cost
Algorithm: Shortest path Difficulty: Hard Time: 60 minutes Goal Return the cheapest source-to-target cost using at most k edges.
View task