Maximum Matrix Sum 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 by ...

Rotating the Box You are given an m x n matrix of characters box representing a side-view of a box. Each cell of the box is one of the following: A stone '#' A stationary obstacle '*' Empty '.' ...

Flip Columns For Maximum Number of Equal Rows You are given an m x n binary matrix matrix. You can choose any number of columns in the matrix and flip every cell in that column (i.e., Change the...

Count Unguarded Cells in the Grid You are given two integers m and n representing a 0-indexed m x n grid. You are also given two 2D integer arrays guards and walls where guards[i] = [rowi, coli] ...

Take K of Each Character From Left and Right You are given a string s consisting of the characters ‘a’, ‘b’, and ‘c’ and a non-negative integer k. Each minute, you may take either the leftmost ch...

Maximum Sum of Distinct Subarrays With Length K You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions...

Defuse the Bomb You have a bomb to defuse, and your time is running out! Your informer will provide you with a circular array code of length of n and a key k. To decrypt the code, you must repla...

Shortest Subarray with Sum at Least K Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of *nums with a sum of at least *k. If there is no such su...

Find the Power of K-Size Subarrays II You are given an array of integers nums of length n and a positive integer k. The power of an array is defined as: Its **maximum** element if *all* of its ...

Find the Power of K-Size Subarrays I You are given an array of integers nums of length n and a positive integer k. The power of an array is defined as: Its **maximum** element if *all* of its e...