Pinterest • The world’s catalogue of ideas

Two linked lists A and B are joined on a particular node, called the point of intersection of the linked lists. Find the point of intersection, i.e. the first node after which both lists have same nodes. Algorithm uses a hash. Here is a video to find if two linked lists intersect with the help of examples and animations. The algorithm has O(m+n) time and O(n) space complexity.Java code is provided in Code Snippet section.

1

Find intersection of two Linked Lists

ideserve.co.in

Given 2 sorted linked lists, merge the lists to a single sorted linked list. Java solution is provided in code snippet section. Java visualization is provided in algorithm visualization section.

Merge two sorted linked lists

ideserve.co.in

Sum of Two Linked Lists using Recursion | Set 2 - IDeserve

Sum of Two Linked Lists using Recursion | Set 2

ideserve.co.in

Given a linked list and a number k, reverse every alternate k nodes of the list. Java code is provided in code snippet section. Java visualization is provided in algorithm visualization section.

Reverse every alternate k nodes of a Linked List

ideserve.co.in

Given a linked list having n nodes. Reverse the list using recursive approach. Here is a video solution that reverses a linked list recursively. Explained the algorithm with the help of examples and animations.Java code is provided in Code Snippet Section.

Reverse a Linked List - Recursive

ideserve.co.in

Given a linked list having n nodes. Reverse the list using iterative method. Here is a video solution that reverses a linked list iteratively using 3 pointers. Explained the algorithm with the help of examples and animations.Java code is provided in Code Snippet Section.

Reverse a Linked List - Iterative

ideserve.co.in

Sum of Two Linked Lists using Stacks - IDeserve

Sum of Two Linked Lists using Stacks

ideserve.co.in

Sum of Two Linked Lists using Recursion | Set 1 - IDeserve

Sum of Two Linked Lists using Recursion | Set 1

ideserve.co.in

Given a doubly linked list in sorted order with previous and next nodes. Convert the doubly linked list to a binary search tree with left as previous node and right as next node. This should be done in-place. Java solution is provided in code snippet section. Java visualization is provided in algorithm visualization section.

Convert a sorted Doubly Linked List to Balanced Binary Search Tree

ideserve.co.in

Two linked lists list1 and list2 are joined a particular node, called the point of intersection of the linked lists. Find the point of intersection, i.e. the first node after which both lists have same nodes. Desired order is O(m + n) Time Complexity and O(1) Space Complexity. Here is a video to find if two linked lists intersect with the help of examples and animations.Java code is provided in Code Snippet section.

Find intersection of two Linked Lists - O(m + n) Time Complexity and O(1) Space Complexity

ideserve.co.in