207. Course Schedule

Problem description:

There are a total of n courses you have to take, labeled from 0 to n-1.

Readmore

402. Remove K Digits

Problem description:

Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.

Readmore

767. Reorganize String

Problem description:

Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.

Readmore

452. Minimum Number of Arrows to Burst Balloons

Problem description:

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizontal, y-coordinates don’t matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 104 balloons.

Readmore

763. Partition Labels

Problem description:

A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.

Readmore

232. Implement Queue using Stacks

Problem description:

Implement the following operations of a queue using stacks.

Readmore

439. Ternary Expression Parser

Problem description:

Given a string representing arbitrarily nested ternary expressions, calculate the result of the expression. You can always assume that the given expression is valid and only consists of digits 0-9, ?, :, T and F (T and F represent True and False respectively).

Readmore

255. Verify Preorder Sequence in Binary Search Tree

Problem description:

Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree.

Readmore

131. Palindrome Partitioning

Problem description:

Given a string s, partition s such that every substring of the partition is a palindrome.

Readmore

77. Combinations

Problem description:

Given two integers n and k, return all possible combinations of k numbers out of 1 … n.

Readmore