Why So Perfect

CodeChefOpen on judge ↗

Consider the string "ab" we replace character a with 8 and b with 1, we get 81, which is a square. Given a string, find the largest square which can be obtained by replacing its characters by digits (leading zeros are not allowed) where same characters always map to the same digits and different characters always map to different digits. If no solution, return -1 Example Input: "ab" => Output:

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