Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise.

Return the number of negative numbers in grid.[……]

Skip to content
# Category: LeetCode

## LeetCode 1351. Count Negative Numbers in a Sorted Matrix

## LeetCode 1464. Maximum Product of Two Elements in an Array

## LeetCode 980. Unique Paths III

## LeetCode 1450. Number of Students Doing Homework at a Given Time

## LeetCode 1486. XOR Operation in an Array

## LeetCode 1389. Create Target Array in the Given Order

## LeetCode 1281. Subtract the Product and Sum of Digits of an Integer

## LeetCode 1313. Decompress Run-Length Encoded List

## LeetCode 1365. How Many Numbers Are Smaller Than the Current Number

## LeetCode 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree

Gerry的博客

Given a m * n matrix grid which is sorted in non-increasing order both row-wise and column-wise.

Return the number of negative numbers in grid.[……]

Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).[……]

On a 2-dimensional grid, there are 4 types of squares:

1 represents the starting square. There is exactly one starting square.

2 represents the e[……]

Given two integer arrays startTime and endTime and given an integer queryTime.

The ith student started doing their homework at the time startTime[i[……]

Given an integer n and an integer start.

Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length.

Return the bitwise X[……]

Given two arrays of integers nums and index. Your task is to create target array under the following rules:

Initially target array is empty.

From[……]

Given an integer number n, return the difference between the product of its digits and the sum of its digits.

Example 1:

Input: n = 234

Outp[……]

We are given a list nums of integers representing a list compressed with run-length encoding.

Consider each adjacent pair of elements [freq, val] =[……]

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the num[……]

Given two binary trees original and cloned and given a reference to a node target in the original tree.

The cloned tree is a copy of the original t[……]