Prototype: implement prototype(String left, String right) returning int with a direct baseline.
Final: implement solve(String left, String right) with the mechanism and bounds described above. Return unit-cost Levenshtein distance over exact Unicode code points. Transposition is two edits; case and normalization forms remain distinct. Empty-string distance equals the other string's code-point count. Java char iteration is insufficient for supplementary characters. 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.
Complete the starter code, then run the checks.
Results and errors will appear here.
Java runs on this device with CheerpJ 4.3.