Three warm-up problems: (1) count how often each word appears in a string, (2) count the subarrays of an integer array whose sum equals K, and (3) merge K sorted lists into one sorted list.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.