Timeline for Confirming existence of lapindromes
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2015 at 13:11 | history | edited | Quill | CC BY-SA 3.0 |
Improved Formatting; Fixed title; added challenge link; added tag
|
| Jul 25, 2015 at 13:09 | answer | added | janos | timeline score: 10 | |
| Jul 25, 2015 at 12:25 | history | edited | nhgrif |
edited tags
|
|
| Jul 25, 2015 at 12:25 | answer | added | nhgrif | timeline score: 11 | |
| Jul 25, 2015 at 9:27 | answer | added | Abr001am | timeline score: -1 | |
| Jul 25, 2015 at 9:15 | comment | added | Martin R | I wonder if you take advice from answers to your previous questions into account. E.g. from codereview.stackexchange.com/a/73498/35991: "Loading all the functionality in to the main method is making your code hard to read, and reuse. " and "You do not have enough white-space in your code. Also called breathing room, or suffocation". | |
| Jul 25, 2015 at 9:01 | comment | added | Abr001am | try to hash letters with their number of appearance until you cross the half, then proceed to subtract hashvales , if all counters are 0, task done and string is Lapindrome . | |
| Jul 25, 2015 at 8:00 | comment | added | Shubham Sharma | the code is correct and i got 0.07s and 2mb in codechef | |
| Jul 25, 2015 at 7:58 | history | asked | Shubham Sharma | CC BY-SA 3.0 |