Pairs of strings

CodeChefOpen on judge ↗

You are given 2 strings each of length N and an integer k. A string of length N has exactly N - k + 1 substrings of length k. The substring starting from the ith character is called the ith substring. Let A be the set of k-length substrings of the first string and B be the set of k-length substrings of the second string. For each pair of k-length strings, consisting of one string each from set A

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