← All problemsSign in

Chef and Tikna

Chef and Tikna are good friends and both of them like to solve problems. They both are going to participate in ACM ICPC this year. Tikna is very good at mathematical problems but not with strings based problems. Chef was given this problem by him .In the problem a string is given which consist of distinct lower case alpahabets. The task is to calculate all possible strings which can be formed fr

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

Sign in to chat with the tutor and save your progress.

Sign in to start