Finding intersecting node between two lists. (Data Structures and Algorithms #33)(Linked List #7)
This video explains how to find the intersecting node between two merged linked lists. There are two solutions to the problem:
1.) Using HashSet.
Time Complexity: O(n)
Space Complexity: O(n)
2.) By finding the length of the linked lists.
Time Complexity: O(n)
Space Complexity: O(1)
Code Repository Link: https://github.com/HimanshuVerma18111...
On this page of the site you can watch the video online Finding intersecting node between two lists. (Data Structures and Algorithms #33)(Linked List #7) with a duration of hours minute second in good quality, which was uploaded by the user Code Campaign 18 April 2020, share the link with friends and acquaintances, this video has already been watched 632 times on youtube and it was liked by 20 viewers. Enjoy your viewing!
