LeetCode

Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.   /** * Definition f

Total Accepted: 8726 Total Submissions: 35450 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2

Total Accepted: 12841 Total Submissions: 39914 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Total Accepted: 9476 Total Submissions: 35578

Total Accepted: 12160 Total Submissions: 38223 Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->

Total Accepted: 14403 Total Submissions: 41497 Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?

Total Accepted: 10163 Total Submissions: 33266 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space?