(curr)
| 12 | }; |
| 13 | |
| 14 | const dfs = (curr) => { |
| 15 | const prev = reverseList(curr.next); /* Time O(N) | Space O(N) */ |
| 16 | |
| 17 | curr.next.next = curr; |
| 18 | curr.next = null; |
| 19 | |
| 20 | return prev; |
| 21 | }; |
| 22 | |
| 23 | /** |
| 24 | * https://leetcode.com/problems/reverse-linked-list/ |
no test coverage detected