Timeline for "Critter Tracking: When does it cross its own path?"
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4, 2018 at 22:25 | answer | added | Errorsatz | timeline score: 0 | |
| May 23, 2017 at 12:40 | history | edited | CommunityBot | replaced http://stackoverflow.com/ with https://stackoverflow.com/ | |
| Apr 13, 2017 at 12:40 | history | edited | CommunityBot | replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/ | |
| Apr 13, 2017 at 12:38 | history | edited | CommunityBot | replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/ | |
| Jul 2, 2015 at 14:15 | history | edited | WernerCD | CC BY-SA 3.0 | added 152 characters in body |
| Jun 30, 2015 at 23:54 | answer | added | Rick Davin | timeline score: 3 | |
| Jun 30, 2015 at 22:47 | comment | added | WernerCD | @outoftime yeah, the question itself is different (TapeEquilibrium vs CrossedCritter) but the basic layout is the same (Input: Int[], Output: int, -1 is error, method signature is given: public int solution(int[] A) {...}, etc) | |
| Jun 30, 2015 at 21:44 | answer | added | outoftime | timeline score: 2 | |
| Jun 30, 2015 at 20:25 | comment | added | outoftime | Read you edits, linked problem is different from described in your post. Maybe you mean input/output format only. Installing mono, I'll look what I can archive with random generators. | |
| Jun 30, 2015 at 20:14 | comment | added | WernerCD | @outoftime I'll look into that when I get home tonight. I haven't used Tuples before, and when all you have is a Hammer... er... a list... :) | |
| Jun 30, 2015 at 20:12 | history | edited | WernerCD | CC BY-SA 3.0 | added 297 characters in body |
| Jun 30, 2015 at 20:09 | comment | added | outoftime | What about Dictionary<Tuple<int,int>, int> it looks like obvious solution? | |
| Jun 30, 2015 at 20:06 | comment | added | WernerCD | @outoftime the "answer" is the index at which you cross the path. So a single int. Example has you move back across your path on move #7, A[6] - the answer would be 6. | |
| Jun 30, 2015 at 20:02 | comment | added | outoftime | Do you need single move, or all moves, in which locations are equal? | |
| Jun 30, 2015 at 19:51 | answer | added | Jesse C. Slicer | timeline score: 2 | |
| Jun 30, 2015 at 18:23 | history | edited | WernerCD | CC BY-SA 3.0 | added 4 characters in body |
| Jun 30, 2015 at 18:20 | history | edited | RubberDuck | edited tags | |
| Jun 30, 2015 at 18:10 | history | edited | Jamal | CC BY-SA 3.0 | deleted 9 characters in body; edited title |
| Jun 30, 2015 at 17:52 | history | asked | WernerCD | CC BY-SA 3.0 |