Hey, great solution. Could anybody analyze the time and space complexity? My thinking is:
Space: O(n), n is length of String array
Time: O(n*m), n is the same as above, m is the average length of string element in array.
Please let me know what you guys think. Thanks.