## [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 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.

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

Reverse a singly linked list.

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 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.

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 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 a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

Invert a binary tree.

Given a binary tree, return the preorder traversal of its nodes’ values.

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Remove all elements from a linked list of integers that have value val.

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

Given a binary tree, return all root-to-leaf paths.

Given two binary trees, write a function to check if they are equal or not.

Write a function that takes an unsigned integer and returns the number of ’1' bits it has.

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.