Timeline for Get nth node from end in a linked list
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 23, 2016 at 18:09 | vote | accept | CodeYogi | ||
| Dec 23, 2016 at 11:57 | comment | added | linac | What if you are passed an empty list (head is null)? How do you want to handle the case of n >= the length of the list? Your code returns the first list element, @janos code will simply fail. In an assignment I would at least want to see that you realized there are potential problems. | |
| Dec 23, 2016 at 9:20 | history | tweeted | twitter.com/StackCodeReview/status/812226296889671681 | ||
| Dec 23, 2016 at 6:13 | answer | added | janos | timeline score: 9 | |
| Dec 23, 2016 at 5:54 | history | asked | CodeYogi | CC BY-SA 3.0 |