Prototype: implement prototype(List<List<Long>> feeds) returning List<Long> with a direct baseline.
Final: implement solve(List<List<Long>> feeds) with the mechanism and bounds described above. Every feed is sorted nondecreasingly. Return all values sorted with duplicates preserved. Empty feeds and empty outer input are valid. Never change an inner feed or the outer list; no sortedness validation is required. 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.