Company: BrowserStack SDET
Difficulty: medium
Wordplay Given an integer N where N denotes the total number of words in word_list . You are given an array word_list of words that can be used to make the longest word without any repeating characters. Return the length of the longest word that can be formed by concatenating the words from the array word_list without any repeating characters. Function description Complete the solve() function. This function takes the following 2 arguments and returns the answer: N : Represents the total number of words in word_list word_list[] : Represents the array word_list that consists of the words that can be used to make the longest word without any repeating character Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code The first line contains an integer N denoting the total number of words in word_list . The second line contains an array of N strings denoting the words that can