Kind Set

CodeChefOpen on judge ↗

You are given a set of words. You have to determine if the given set of words is a kind set. A set of words is said to be a kind set if it contains atleast one word which can be formed by any possible combination of kind characters of the set. The collection of all the first characters of each of the word of a set is referred to as kind characters of the set. Consider the set of words - recursio

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