← All problemsSign in

Girls and Historical Similarity of Strings

Isha asked to Suhana, what is historical similarity of two strings ? Suhana says, "Two strings P and Q are historically similar if P can be converted into Q after applying following operation zero or more times." In one operation, Isha can replace all occurences of a single character in P with any character from alphabet Z subject to following simple rules : - Replace only happens when new char

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

Sign in to chat with the tutor and save your progress.

Sign in to start