Overview

A collection of interview problems focused on binary search, array manipulation, and efficient data access patterns.

Problem	Level	Key Topics
Measuring Service Success	L3-L5	Binary search on sorted time-series data
Binary Search in a Run-Length Encoded List	L4-L5	RLE, prefix sums, binary search
Find the Largest Subsequence of K Digits	L3-L5	Greedy, monotonic stack
Splitting Cakes	L3-L5	Binary search on continuous domain, geometry
Longest Non-Decreasing Sequence After Substitution	L3-L4	Sliding window, greedy, array manipulation
Find a Number in a Sorted Array (String)	L3	Binary search, string parsing
Google Shopping: Price Retrieval	L3-L5	Sorted containers, binary search, system design