Problem
A dice simulator records every roll of a six-sided die in a list. A run is a group of consecutive rolls with the same value; a single roll is a run of length 1. Find the longest run. If several runs share the longest length, report the one that starts first.
Implement longest_run_of_rolls(rolls).
Input
rolls: The rolls in the order they happened, each from 1 to 6.
Output
Return [start, length]: the 0-based index where the longest run starts and its length. For an empty list return [-1, 0].
Constraints
0 ≤ number of rolls ≤ 10,000
1 ≤ roll ≤ 6
Examples
Input:
rolls = [1, 4, 4, 2, 6, 6, 6, 3]
Expected output:
expected = [4, 3]
Input:
std::vector<long long> rolls = {1, 4, 4, 2, 6, 6, 6, 3};
Expected output:
std::vector<long long> expected = {4, 3};
Input:
long[] rolls = new long[] {1, 4, 4, 2, 6, 6, 6, 3};
Expected output:
long[] expected = new long[] {4, 3};
Explanation
The three 6s starting at index 4 beat the two 4s: [4, 3].
Input:
rolls = [5, 5, 2, 2, 3]
Expected output:
expected = [0, 2]
Input:
std::vector<long long> rolls = {5, 5, 2, 2, 3};
Expected output:
std::vector<long long> expected = {0, 2};
Input:
long[] rolls = new long[] {5, 5, 2, 2, 3};
Expected output:
long[] expected = new long[] {0, 2};
Explanation
Both pairs have length 2; the 5s start first, at index 0: [0, 2].
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
Remember where the current run started.
Hint 2
When the value changes (or the list ends), compare the finished run with the best one.
Hint 3
Replace the best only when the new run is strictly longer.
Expected complexity
O(n) time, O(1) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.