680. Valid Palindrome II

Problem description:

Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.

Readmore

314. Binary Tree Vertical Order Traversal

Problem description:

Given a binary tree, return the vertical order traversal of its nodes’ values. (ie, from top to bottom, column by column).

Readmore

301. Remove Invalid Parentheses

Problem description:

Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.

Readmore

273. Integer to English Words

Problem description:

Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 2^31 - 1.

Readmore

17. Letter Combinations of a Phone Number

Problem description:

Given a digit string, return all possible letter combinations that the number could represent.

Readmore

152. Maximum Product Subarray

Problem description:

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

Readmore

516. Longest Palindromic Subsequence

Problem description:

Given a string s, find the longest palindromic subsequence’s length in s. You may assume that the maximum length of s is 1000.

Readmore

647. Palindromic Substrings

Problem description:

Given a string, your task is to count how many palindromic substrings in this string.

Readmore

227. Basic Calculator II

Problem description:

Implement a basic calculator to evaluate a simple expression string.

Readmore

332. Reconstruct Itinerary

Problem description:

Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK.

Readmore