The query problem

CodeChefRating 3359Open on judge ↗

Given a (multi)set of N strings, each 8 characters long. (Note that the set may contain duplicate strings). Answer M queries. Each query has two parameters: S and d, where S is a 8 characters long string. You have to find how many strings from the original set are at edit distance of exactly d from S. Informally, the Levenshtein distance between two words is the minimum number of single-character

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