Hello Coders! Today we'll be looking at another Linked List problem. We will be solving it using the "Split and Connect" method (details in video!). The solution that is shown in this video is iterative. But you can also solve it recursively. 👀
This video is divided into 3 parts:
Part I: Problem description 0:10
Part II: Solution walk-thru 0:15
Part III: Actual code to solution 2:11
Runtime: O(n)
Space: O(1)
Hope you enjoy this video and happy coding! 💙
Let's be friends:
My Blog: jazwang.com
Email: [email protected]
LeetCode List: https://leetcode.com/list/xbahsr4j