last day (156 days later) » 

John L.
John L.
4:54 PM
Thanks for the answer. What I understand with respect to the implementation is that I can read each string one by one and in the meantime I can keep some sort of frequency array. In that array (with 26 positions) each position will point to a specific character in the English alphabet. The positions will be 0 initialized and each time I find that a character is dominant in a string (that is its number of occurrences is bigger than half of the string letters) i will increment by one its corresponding position. In the end i will select the biggest number in the array. Correct me if I'm wrong. — jakeprog123 11 mins ago
 
jakeprog123
jakeprog123
Hello
Thanks a lot for the answer
I actually think now I know to solve the problem
 
John L.
John L.
@jakeprog123 Cool!
 
jakeprog123
jakeprog123
My comment might have been a bit redundant
but I just wanted to be sure that I got the idea
I`d like to be able to invite people to chat rooms but I think I need more reputation. I say this because I might have other questions in the future.
Anyway thanks again
 
John L.
John L.
@jakeprog123 You can invite them to chat here. I would not mind. Or, you can invite them to chat anywhere, say, on a google document of yours.
 
jakeprog123
jakeprog123
perfect so this chat room will remain available even when I log out? And I would also like to find out how I can invite someone to talk with here. But the second way with the google doc is clear to me.
thanks anyway
 
John L.
John L.
5:10 PM
Yes, a chat room remains available for some days basically. You are welcome. By the way, StackExchange encourages people to ask questions on the site, not in chat rooms.
 
jakeprog123
jakeprog123
I will ask them on the site firstly of course
 
 
5 hours later…
jakeprog123
jakeprog123
10:30 PM
I`d like to ask you for a bit more clarification if possible. MOre exactly take the folowing example. The strings are:
4
ccc
bb
aaa
aab
c is dominant in the 1st string; b is dominant in the 2nd; a is dominant in the 3rd and 4th; So you could be tempted to say that the maximum number osf strings that can be concatenated and have a dominant letter is 2 (the 3rd and 4th). But the fact is I realised it is 3 because you can concatenate the 2nd string and still have a as dominant letter.
So yeah I struggle to find a way to make a program for this. Also you asked me if I can see the greedy strategy? Does this imply any kind of sorting over the set of strings? I just want to see if I missed something, because at that moment I initially had no idea about solving the problem, but now I know something but it seems not to be enough.
Maybe Ill think later about this. And sorry for bothering you.
 

  last day (156 days later) »