Reorder Linked List: Recursive Technique Breakdown

Описание: In this video, we solved the Leetcode problem 143 : Reorder List

We used recursive algorithm to solve this problem. At first, we store all the nodes in a dictionary with its index (0-based)
Then we updated the pointers for 0th and nth node, and recursively call the function with 1, n-1

Space complexity is O(n) since we used extra storage to store the node in a dictionary. Run time complexity: O(n)

I write weekly newsletters on career growth, computer programming concepts and personal finance. Follow me on LinkedIn: https://linkedin.com/comm/mynetwork/d...