## [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 an array of integers, find if the array contains any duplicates.

Given a binary search tree, find the kth smallest element in it.

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Find a peak element in an array and return its index.

Given an integer, write a function to determine if it is a power of two.

Find a duplicate in an array with some other requirements.

Rotate an array of n elements to the right by k steps.

Given a binary tree, find its maximum depth.

Given a binary tree, find its minimum depth.

Reverse digits of an integer. Return 0 when the reversed integer overflows.

Reverse a singly linked list.

Add two linked lists representing two non-negative numbers.

Given a string, find the length of the longest substring without repeating characters.

Given two binary strings, return their sum (also a binary string).

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.

Find if a duplicate exists among the recent k numbers.

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 a non-negative number represented as an array of digits, plus one to the number.

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

Get the nth sequence of the count-and-say sequences.

Calculate the total sum of all root-to-leaf numbers.

Given a string s consists of upper/lower-case alphabets and empty space characters ‘ ‘, return the length of last word in the string.

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 an array and a value, remove all instances of that value in place and return the new length.

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

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.