Paired drawers: Peak ticket
Stuck or curious how this works? Visualize Two Pointers ↗
Inputs
drawers contains exactly two lists of numbers. The first list is drawers[0]; the second is drawers[1].
Your tasks
- Create a list
merged.drawerscontains two lists, each already sorted from smallest to largest. Combine their numbers into one sortedmerged. Keep all repeated numbers, including copies from both input lists. - Find the largest number in
merged. Store it inlargest. - Complete
pairedDrawersPeakTicketso it returnslargest. Return it, do not print it.
Example
If drawers is [[-7, 3, 6, 6, 11], [-7, 3, 6, 6, 11]], then merged is [-7, -7, 3, 3, 6, 6, 6, 6, 11, 11] and pairedDrawersPeakTicket returns 11.
Rules
- If
mergedis empty, return 0.
Test data
TEST DATA 1: drawers is [[-11, 0, 7, 17, 17], []].
TEST DATA 2: drawers is [[-5, 5, 5, 5], [4]].
Examples
Input: drawers = [[-11,0,7,17,17],[]] Output: 17
merged is [-11, 0, 7, 17, 17]. The largest number is 17. Return 17.
Input: drawers = [[-5,5,5,5],[4]] Output: 5
merged is [-5, 4, 5, 5, 5]. The largest number is 5. Return 5.
Input: drawers = [[],[]] Output: 0
merged is []. The list is empty, so return 0.
Input limits
- 0 <= input size <= 50000 per row.
- Answers fit in a signed 32-bit integer: -2,147,483,648 through 2,147,483,647.
- Input numbers have no decimal part. They range from -1,000,000 to 1,000,000. Follow any extra input rules in task 1.
- The input has exactly two rows, each containing at most 50000 integers.
Efficiency goal
Big-O describes how the work or memory needed grows as the input gets larger.
Efficiency goal: time O(n); extra memory, including the helper list, O(n). n is the combined length of the two lists. These labels describe how work and memory grow with the input.
Practice focus
Build merged first, then return exactly what the tasks ask for. Follow the order, keep repeated values when the rule says so, and check the empty case.