1570. Dot Product of Two Sparse Vectors

Problem description:

Given two sparse vectors, compute their dot product.

Readmore

1249. Minimum Remove to Make Valid Parentheses

Problem description:

Given a string s of '(' , ')' and lowercase English characters.

Readmore

1428. Leftmost Column with at Least a One

Problem description:

(This problem is an interactive problem.)

Readmore

1396. Design Underground System

Problem description:

An underground railway system is keeping track of customer travel times between different stations. They are using this data to calculate the average time it takes to travel from one station to another.

Readmore

953. Verifying an Alien Dictionary

Problem description:

In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

Readmore

117. Populating Next Right Pointers in Each Node II

Problem description:

Given a binary tree

Readmore

116. Populating Next Right Pointers in Each Node

Problem description:

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

Readmore

122. Best Time to Buy and Sell Stock II

Problem description:

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Readmore

863. All Nodes Distance K in Binary Tree

Problem description:

We are given a binary tree (with root node root), a target node, and an integer value K.

Readmore

1448. Count Good Nodes in Binary Tree

Problem description:

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.

Readmore