← All problemsSign in

Good or Bad

Rohit has got a list of **N** strings.He want to test his N strings accoding to his rule. .Each string contains only lowercase letters. According to Rohit **N** strings are called **WONDER** if no string is **prefix** of another string in the list else, it is **WORSE**. (If two strings are identical, they are considered prefixes of each other.) ###Input - First line contains **N**, the numbe

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