Problem Statement

Wordplay Problem Description You're given an integer N, the count of entries in an array word_list, and the array word_list itself holding those N words. Find the greatest possible length of a string built by joining together some chosen subset of these words end to end, subject to the condition that no character repeats anywhere in the joined result. 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 wri