Yingying

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes. You should try to do it in

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. My code： public TreeNode sortedListToBST(ListNode head) { if(head==null) ret

Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given m, n satisfy t

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return i

Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. public ListNode rotateRight(L

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->3->3->4->4->5, return 1->2->5. Given 1->

Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen. Follow up: What if the linked list is extremely large and i

Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up: Can you solve it without using extra space?

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You must do this in-place without altering the nodes' values. For example, Given {1,2,3,4}, reorder it

Sort a linked list using insertion sort. public ListNode insertionSortList(ListNode head) { ListNode helper = new ListNode(0); ListNode pre = helper; ListNode cur =head;

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? public boolean hasCycle(ListNode head) { if(head==null) return false;

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. My code: public ListNode mergeTwoLists(ListNode l1,

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘

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. My code： public Li

Remove all elements from a linked list of integers that have value val. Example Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6 Return: 1 --> 2 --> 3 --> 4 --> 5 My code: public Lis

Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space? public class Solution { public boolean isPalindrome(ListNode head) {

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->3. Your algorithm should use only constant space. Y

Reverse a singly linked list. My code: Iteratively: public ListNode reverseList(ListNode head) { if(head==null) return head; ListNode pre = null; ListNode cur = head;