865.Smallest Subtree with all the Deepest Nodes

Problem description:

Given the root of a binary tree, the depth of each node is the shortest distance to the root.

Readmore

1011.Capacity To Ship Packages Within D Days

Problem description:

A conveyor belt has packages that must be shipped from one port to another within days days.

Readmore

843.Guess the Word

Problem description:

This is an interactive problem.

Readmore

548.Split Array with Equal Sum

Problem description:

Given an integer array nums of length n, return true if there is a triplet (i, j, k) which satisfies the following conditions:

Readmore

1509.Minimum Difference Between Largest and Smallest Value in Three Moves

Problem description:

Given an array nums, you are allowed to choose one element of nums and change it by any value in one move.

Readmore

1277.Count Square Submatrices with All Ones

Problem description:

Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.

Readmore

1161.Maximum Level Sum of a Binary Tree

Problem description:

Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.

Readmore

359.Logger Rate Limiter

Problem description:

Design a logger system that receives a stream of messages along with their timestamps. Each unique message should only be printed at most every 10 seconds (i.e. a message printed at timestamp t will prevent other identical messages from being printed until timestamp t + 10).

Readmore

329.Longest Increasing Path in a Matrix

Problem description:

Given an m x n integers matrix, return the length of the longest increasing path in matrix.

Readmore

778.Swim in Rising Water

Problem description:

You are given an n x n integer matrix grid where each value grid[i][j] represents the elevation at that point (i, j).

Readmore