## [Leetcode] Remove Nth Node From End of List

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

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

Given a linked list, determine if it has a cycle in it.

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

Given an array S of n integers, find there elements a, b, c in S such that a + b + c = 0.

Given an array S of n integers, find three integers in S such that the sum is closest to a given number.

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

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

Write an algorithm to determine if a number is "happy".

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

Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of [...]

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Find two vertical lines which form a container with x-axis , such that the container contains the most water.

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

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