Smallest range list
Given a sorted unique integer array, return the smallest list of ranges that exactly cover all the numbers, formatted as 'a->b' or 'a' for singletons.
Implement
summary_ranges(nums: list[int]) → list[str]Examples
in
[[0,1,2,4,5,7]]out["0->2","4->5","7"]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[0,1,2,4,5,7]]["0->2","4->5","7"]not run yetsample