Timeline for Print out all possible letter combinations a given phone number can represent
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2019 at 16:01 | answer | added | Aweuzegaga | timeline score: 2 | |
| Oct 4, 2018 at 20:56 | comment | added | Ralf Kleberhoff |
One small hint regarding the new HashMap<>(8): in your case, it's not worth deciding on an initial capacity. And if you really care, you should start with a bigger capacity, as a new HashMap<>(8) will not accept 8 entries without growth, but only 6. The default load factor is 75%, meaning that the HashMap will grow as soon as it's 75% filled.
|
|
| Oct 4, 2018 at 7:43 | comment | added | Toby Speight | The number of outputs will be 3^n or more (not n^3), so that's obviously a lower bound on the complexity. You won't be able to get lower than that without omitting some of the results. | |
| Oct 4, 2018 at 7:26 | answer | added | Sharon Ben Asher | timeline score: 3 | |
| Oct 4, 2018 at 6:30 | history | edited | 200_success | CC BY-SA 4.0 |
added 10 characters in body; edited title; edited tags
|
| Oct 4, 2018 at 4:40 | review | First posts | |||
| Oct 4, 2018 at 7:45 | |||||
| Oct 4, 2018 at 4:38 | history | asked | dragons | CC BY-SA 4.0 |