Hi everyone! I did frequent commits, my solution (in C#) at:
https://github.com/ajlopez/TddOnTheRocks/tree/master/Consonants The evolution of code https://github.com/ajlopez/TddOnTheRocks/commits/master/Consonants It detects the positions of substrings with n consonants. And then, it apply a simple formula to have the total count. I had problems with the large input (time), I should reviewed it. On Mon, May 13, 2013 at 8:01 AM, Vaibhav Tulsyan <[email protected]>wrote: > I solved the problem in Java. > My logic to solve the 'Consonants' problem is as follows: > 1. Find all possible substrings from the name of length 'n' or greater > (using substring( ) function) > 2. In each substring, check if 'n' consonants appear consecutively. > > > > This is an O(N^4) solution. For names of length (10^6) > > -- > Regards, > Vaibhav Tulsyan. > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
