266.Palindrome Permutation

Problem description:

Given a string s, return true if a permutation of the string could form a palindrome.

Readmore

1216.Valid Palindrome III

Problem description:

Given a string s and an integer k, return true if s is a k-palindrome.

Readmore

691.Stickers to Spell Word

Problem description:

We are given n different types of stickers. Each sticker has a lowercase English word on it.

Readmore

1891.Cutting Ribbons

Problem description:

You are given an integer array ribbons, where ribbons[i] represents the length of the ith ribbon, and an integer k. You may cut any of the ribbons into any number of segments of positive integer lengths, or perform no cuts at all.

Readmore

986.Interval List Intersections

Problem description:

You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of intervals is pairwise disjoint and in sorted order.

Readmore

509.Fibonacci Number

Problem description:

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

Readmore

408.Valid Word Abbreviation

Problem description:

A string can be abbreviated by replacing any number of non-adjacent substrings with their lengths. For example, a string such as "substitution" could be abbreviated as (but not limited to):

Readmore

163. Missing Ranges

Problem description:

You are given an inclusive range [lower, upper] and a sorted unique integer array nums, where all elements are in the inclusive range.

Readmore

536. Construct Binary Tree from String

Problem description:

You need to construct a binary tree from a string consisting of parenthesis and integers.

Readmore

766. Toeplitz Matrix

Problem description:

Given an m x n matrix, return true if the matrix is Toeplitz. Otherwise, return false.

Readmore