061.Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.

Read More

160.Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.

Read More

328.Odd Even Linked List

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.

Read More

142.Linked List Cycle II

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

Read More

138.Copy List With Random Pointer

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Read More

025.Reverse Nodes in K-Group

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

Read More

369.Plus One Linked List

Given a non-negative number represented as a singly linked list of digits, plus one to the number.

Read More

234.Palindrome Linked List

Given a singly linked list, determine if it is a palindrome.

Read More

083.Remove Duplicates From Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.

Read More

024.Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.

Read More

019.Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head.

For example, given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.

Note:
Given n will always be valid. Try to do this in one pass.

Read More

CS 5412 Cloud Computing Notes

    Read More

    Queue

    Read More

    284.Peekable Iterator

    Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation – it essentially peek() at the element that will be returned by the next call to next().

    Read More

    Max Root to Leaf Sum

    Find out the maximum cost of all the possible root-to-leaf paths

    Read More