leetcode-potd

773. Sliding Puzzle

leetcode-potd

On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move consists of choosing 0 and a

1975. Maximum Matrix Sum

leetcode-potd

You are given an n x n integer matrix. You can do the following operation any number of times: Choose any two adjacent elements of matrix and multiply each of them

Scroll to Top