# LeetCode 160. Intersection of Two Linked Lists

Intersection of Two Linked Lists The trick is to find the length of each linked list.

# LeetCode 143. Reorder List

Reorder List. Classical List operations. 1, Find the middle of the list. 2, Break and reverse the second half of the list. 3, Merge two half of the lists.

# LeetCode 142. Linked List Cycle II

Linked List Cycle II. The way I solve this problem is not optimized, which required O(N) space. There is a better way depending on the meet position with a 1-2…

# LeetCode 117. Populating Next Right Pointers in Each Node II

Populating Next Right Pointers in Each Node II. Same asĀ Populating Next Right Pointers in Each Node. But you need to be more flexible because all the next pointers of a…

# LeetCode 116. Populating Next Right Pointers in Each Node

Populating Next Right Pointers in Each Node. Low level list node operation. You need to link the left child to the right child of a root first, then link the…

# LeetCode 109. Convert Sorted List to Binary Search Tree

Convert Sorted List to Binary Search Tree. Same solution asĀ Convert Sorted Array to Binary Search Tree. But you need to use a trick to get the middle point in the…

# 237. Delete Node in a Linked List

Delete Node in a Linked List. The trick is that you can update the value of a node…

# LeetCode 234. Palindrome Linked List

Palindrome Linked List. I am using recursion so I am actually not doing it with O(1) space.

# LeetCode 203. Remove Linked List Elements

Remove Linked List Elements. Straight forward list node operation.