Problem Statement

Wordplay Problem Description Given an integer N representing the total number of words in a word_list, and an array word_list containing N words, find the maximum length of a string that can be formed by concatenating some words from the array such that the resulting string contains no repeating characters. You need to: Select a subset of words from the given word_list Concatenate these selected words to form a single string Ensure the final concatenated string has no duplicate characters Return the maximum possible length of such a string Function description Complete the solve() function. This function takes the following 2 arguments and returns the answer. N : An integer representing the total number of words in word_list word_list[] : An array of N strings representing the words that can be used to form the longest concatenated word 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 provid