Tricks

• 巧妙构造虚拟头节点, 可以使遍历处理逻辑更加统一
• 灵活使用递归
• 链表区间逆序
• 链表寻找中间节点
• 合并 K 个有序链表
• 链表归类
• 链表排序
• 判断链表是否存在环

Problem Set

• add two numbers
• remove nth node from end of list
• merge two sorted lists
• merge k sorted lists
• swap nodes in k-group
• rorate list
• remove duplicates from sorted List II
• remove duplicates from sorted List
• partition list
• reverse linked list II
• convert sorted list to binary search tree
• copy list with random pointer
• linked list cycle
• linked list cycle II
• reorder list
• insertion sort list
• sort list
• intersection of two linked lists
• remove linked list elements
• reverse linked list
• palindrome linked list
• delete node in a linked list
• odd even linked list
• add two number II
• design linked list
• split linked list in parts
• linked list components
• middle of the linked list
• next greater node in linked list
• remove zero sum consecutive nodes from linked list
• convert binary number in a linked list to integer
• merge in between linked lists
• design front middle back queue
• swapping nodes in a linked list