Prototype: implement prototype(List<String> labels, int limit) returning int with a direct baseline.
Final: implement solve(List<String> labels, int limit) with the mechanism and bounds described above. Return the greatest contiguous length with at most limit distinct exact strings. Empty input and limit zero return zero. Negative limit raises IllegalArgumentException. Both stages have the same observable contract. The prototype may use the simpler method; final must use the target data structure.
All methods are static members of Exercise.
Drag or use the arrow keys to resize. Home collapses the question; End collapses the editor. Enter or double-click resets the split.
Loading editor…
Loading editor…
No results yet.
Complete the starter code, then run the checks.
Results and errors will appear here.
Java runs on this device with CheerpJ 4.3.