Unknown Directory

CodeChefOpen on judge ↗

You are given a set of strings(say words) in lowercases and an encrypted unique code for each of the given word. The encrypted code contains only uppercase alphabets and is of length $5$. Now there are $Q$ queries. For each query you are given a string, you need to get the best word from the given set of words that has prefix same as this string and has lexicographically greatest encrypted code. N

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