Timeline for Hackerrank Submission Optimisation for Melodious Password
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2017 at 10:50 | comment | added | janos |
@ChatterOne The depth of recursions is n.
|
|
| Mar 16, 2017 at 10:36 | comment | added | ChatterOne | If for n=6 there are 2000000 possible strings, that sounds quite big of a number to be able to use recursion. If you then want n=7 or n=8, I guess it will blow up quickly. | |
| Mar 15, 2017 at 22:31 | comment | added | Sreetam Das | Love the algorithm that you've suggested; will personally implement it and post results here. Cheers! | |
| Mar 15, 2017 at 19:46 | history | answered | janos | CC BY-SA 3.0 |