findMostRecurrentSequences Flipkart Grid 8 Round 3

Problem Preview

"You are a data analyst at a tech company provided with the task of enhancing user experience by understanding communication patterns across various platforms. Your team has gathered a diverse dataset comprising of N distinct words(keywords) present in chat conversations, social media posts, and text messages. Your task is to develop a program capable of identifying recurring sequences of characters within these messages, ensuring that only sequences with a minimum length of three characters are considered for analysis and output. By identifying these common patterns, your team can gain insights into popular phrases or topics discussed among users. The output should provide these common patterns in ascending order. Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the standard output and test cases will fail. **Constraints:** * 2 ≤ N < 3000 * keywords consists of words written in lowercase. * keywords has only distinct words. * keywords should only contain alphabets. **Input Format:** The first line of input contains an integer N, total number of strings. The second line of input contains a string array called keywords, which contains N strings, each separated by a single whitespace. **Output Format:** The output consists of one or more strings, each separated by a single whitespace. These strings represents recurring sequences of minimum three characters within keywords. **Sample Input 1:** ```text 4 hakuna kunafa kubernetes fridge ``` **Sample Output 1:** ```text kun kuna una ``` **Sample Input 2:** ```text 6 apple chocolate honeybee pineapple home street ``` **Sample Output 2:** ```text app appl apple ple ppl pple ```"