The supplied immutable Key(namespace,name) uses exact string component equality; components are nonnull and may be empty.
Prototype: distinctCount(List<Key>) -> int counts logical distinct keys without input changes.
Final: frequencies(List<Key>) -> Map<Key,Integer> counts all occurrences and iterates keys in namespace then name String.compareTo order. Return a fresh map, preserving input; empty gives empty. Equal newly allocated records must merge; same name in different namespaces stays separate.
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.