First, find the length of the longest substring without repeating characters. Second, given a 2D matrix, implement efficient sub-matrix sum queries between two points.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.