1525.Number of Good Ways to Split a String

Problem description:

You are given a string s, a split is called good if you can split s into 2 non-empty strings p and q where its concatenation is equal to s and the number of distinct letters in p and q are the same.

Readmore

1423.Maximum Points You Can Obtain from Cards

Problem description:

There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints.

Readmore

1293.Shortest Path in a Grid with Obstacles Elimination

Problem description:

You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step.

Readmore

1197.Minimum Knight Moves

Problem description:

In an infinite chess board with coordinates from -infinity to +infinity, you have a knight at square [0, 0].

Readmore

735.Asteroid Collision

Problem description:

We are given an array asteroids of integers representing asteroids in a row.

Readmore

443.String Compression

Problem description:

Given an array of characters chars, compress it using the following algorithm:

Readmore

724.Find Pivot Index

Problem description:

Given an array of integers nums, calculate the pivot index of this array.

Readmore

934.Shortest Bridge

Problem description:

In a given 2D binary array grid, there are two islands. (An island is a 4-directionally connected group of 1s not connected to any other 1s.)

Readmore

1048.Longest String Chain

Problem description:

You are given an array of words where each word consists of lowercase English letters.

Readmore

1559.Detect Cycles in 2D Grid

Problem description:

Given a 2D array of characters grid of size m x n, you need to find if there exists any cycle consisting of the same value in grid.

Readmore