Good String

CodeChefOpen on judge ↗

You are given N strings s1, s2, s3,... sN-1, sN which are formed by using letters of first k alphabet ([a-z]). Let us define a string at index 'i' (si) to be Good String, if the following holds true: There exists some index j ( j != i ), Such that sj is a [subsequence](https://en.wikipedia.org/wiki/Subsequence) of any permutation of string si. You are asked to print the number of Good Strings pre

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