2573. Find the String with LCP

Given an n×n matrix lcp, where lcp[i][j] is the claimed length of the longest common prefix of the suffixes of a string starting at positions i and j, reconstruct the lexicographically smallest…