Harry and Beautiful Arrays

CodeChefOpen on judge ↗

Harry is present at the morning assembly where there are two rows of children of length $N$ and $M$ respectively. Each child in both the rows has a favourite english alphabet. Harry is fond of maximising beauty of pairs of arrays. Beauty of a pair of arrays is defined by maximum number of children with same relative order in the arrays having same favourite alphabet. For example beauty of the t

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