15,509,806 members
1.00/5 (1 vote)
See more:
Write a function:
class Solution{ public int solution(String []A);}
that given an array A consisting of N strings, calculates the length of the longest string S fulfilling the conditions i.e. S is a concatenation of some of the strings from A and every letter in S is different.

Example: A=["do","lit","tyu"] should return 5.
A=["abc","yyy","def"] should return 6.

What I have tried:

Posted
Updated 11-Aug-22 22:40pm
Richard MacCutchan 12-Aug-22 4:29am
You need to create sets of strings making a note of any sets that contain unique letters. Once you have compared everything you can find the longest set.

Solution 1

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]