Link to Question: https://leetcode.com/problems/reverse-linked-list/description/ Time Complexity: O(n) - Need to go through every node in the linked list Space Complexity: O(n) - The call stack could go n levels deep
Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.
