Just remember that there will be two conditions to check. (Look out for abc and abcde in below test cases):

1. The prefix string comes before the longer string.

   • 7
   • aab
   • defgab
   • abc
   • abcde
   • cedaaa
   • bbbbbbbbbb
   • jabjjjad

2. Prefix string will come after the longer string.

   • 7
   • aab
   • defgab
   • abcde
   • abc
   • cedaaa
   • bbbbbbbbbb
   • jabjjjad

Make sure that you get correct output for both the cases, and you may trust that other things will fall in place.

@bokamvinaykumar Please upload the test cases.

These instructions are not clear. They say "Output GOOD SET if the set is valid. Else, output BAD SET followed by the first string for which the condition fails."

Is the first string for which the condition fails the string that is a prefix of another string, the string that is prefixed by another string, or the first string that appears ordinally in the input list?

how to optimize the code for this as my code is not running for last 5 cases . help me !!!

awesome guys, do post new questions on suffix trees, segment trees, Binary Indexed Tree, kd-trees.

Thanks