Prototype: implement prototype(long[] weights, long target) returning Pair with a direct baseline.
Final: implement solve(long[] weights, long target) with the mechanism and bounds described above. Return the lexicographically smallest ascending value Pair(a,b) with a+b == target using distinct positions, or null. Negative values and duplicates are valid. [5] cannot pair with itself; [5,5] can. Both stages have the same observable contract. The prototype may use the simpler method; final must use the target data structure.
The supplied nested record types define the API. 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.