Timeline for Counting numbers with specific digits
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 31, 2016 at 16:59 | answer | added | nhgrif | timeline score: 0 | |
| Jan 31, 2016 at 12:14 | answer | added | lex82 | timeline score: 0 | |
| Jan 23, 2016 at 15:24 | history | tweeted | twitter.com/StackCodeReview/status/690918112225542144 | ||
| Jan 23, 2016 at 5:22 | review | Suggested edits | |||
| Jan 23, 2016 at 5:54 | |||||
| Jan 23, 2016 at 1:19 | answer | added | Edward | timeline score: 10 | |
| Jan 22, 2016 at 21:59 | answer | added | gardenhead | timeline score: 0 | |
| Jan 22, 2016 at 17:46 | answer | added | Alberto | timeline score: 3 | |
| Jan 22, 2016 at 14:57 | comment | added | SylvainD | As a general advice for programming challenge, when the input can be super-huge (like Constraints : 1 ≤ N ≤ 10^12), it is a hint that a good solution will not involve checking each and every possible number. See Pimgd's excellent answer for more details. | |
| Jan 22, 2016 at 14:01 | answer | added | Pimgd | timeline score: 17 | |
| S Jan 22, 2016 at 13:38 | history | suggested | Shelby115 | CC BY-SA 3.0 |
Fixed indentation
|
| Jan 22, 2016 at 13:14 | review | Suggested edits | |||
| S Jan 22, 2016 at 13:38 | |||||
| Jan 22, 2016 at 13:12 | history | edited | Pimgd | CC BY-SA 3.0 |
lucky sounds good, but is not searchable
|
| Jan 22, 2016 at 13:11 | history | edited | Phrancis | CC BY-SA 3.0 |
added 37 characters in body
|
| Jan 22, 2016 at 13:10 | history | edited | Pimgd | CC BY-SA 3.0 |
formattting
|
| Jan 22, 2016 at 13:09 | history | edited | Pimgd | CC BY-SA 3.0 |
formattting
|
| Jan 22, 2016 at 13:00 | history | asked | G V Sandeep | CC BY-SA 3.0 |