Dhritrashtra and Strings

CodeChefOpen on judge ↗

Dhritarashtra is trying to find the length of the pattern which is common between two strings. The pattern length must be the maximum number of characters common in both strings. As we all know characters are case sensitive i.e., upper-case, and lower-case letters are different. Characters can be repeated in the string and if there is a multiple occurrence of a character in both the strings it mus

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