Edit Distance Revisited

CodeChefOpen on judge ↗

You are given N arrays of size K each, such that each array contains all numbers from 1 to K, and no two arrays are the same (two arrays are called same if for every index they have the same value). Edit distance between two arrays A1 and A2 is denoted by E(A1 , A2 ), and is defined as the least number of steps needed to make the two arrays same if these 2 operations are allowed: - Delete any

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI