leetcode.com 2026-03-25
🟡3546.equal-sum-grid-partition-i
🏷️ Tags
#array #enumeration #matrix #prefix_sum
🟡3546.equal-sum-grid-partition-i
🏷️ Tags
#array #enumeration #matrix #prefix_sum
Telegraph
equal-sum-grid-partition-i
You are given an m x n matrix grid of positive integers. Your task is to determine if it is possible to make either one horizontal or one vertical cut on the grid such that:
leetcode.cn 2026-03-26
🔴3548.equal-sum-grid-partition-ii
🏷️ Tags
#array #hash_table #enumeration #matrix #prefix_sum
🔴3548.equal-sum-grid-partition-ii
🏷️ Tags
#array #hash_table #enumeration #matrix #prefix_sum
Telegraph
equal-sum-grid-partition-ii
给你一个由正整数组成的 m x n 矩阵 grid。你的任务是判断是否可以通过 一条水平或一条垂直分割线 将矩阵分割成两部分,使得:
leetcode.com 2026-03-26
🔴3548.equal-sum-grid-partition-ii
🏷️ Tags
#array #hash_table #enumeration #matrix #prefix_sum
🔴3548.equal-sum-grid-partition-ii
🏷️ Tags
#array #hash_table #enumeration #matrix #prefix_sum
Telegraph
equal-sum-grid-partition-ii
You are given an m x n matrix grid of positive integers. Your task is to determine if it is possible to make either one horizontal or one vertical cut on the grid such that:
leetcode.cn 2026-06-04
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
Telegraph
total-waviness-of-numbers-in-range-i
给你两个整数 num1 和 num2,表示一个 闭 区间 [num1, num2]。
leetcode.com 2026-06-04
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
Telegraph
total-waviness-of-numbers-in-range-i
You are given two integers num1 and num2 representing an inclusive range [num1, num2]. The waviness of a number is defined as the total count of its peaks and valleys:
leetcode.cn 2026-06-27
🟡3020.find-the-maximum-number-of-elements-in-subset
🏷️ Tags
#array #hash_table #enumeration
🟡3020.find-the-maximum-number-of-elements-in-subset
🏷️ Tags
#array #hash_table #enumeration
Telegraph
find-the-maximum-number-of-elements-in-subset
给你一个 正整数 数组 nums 。 你需要从数组中选出一个满足下述条件的子集:
leetcode.com 2026-06-27
🟡3020.find-the-maximum-number-of-elements-in-subset
🏷️ Tags
#array #hash_table #enumeration
🟡3020.find-the-maximum-number-of-elements-in-subset
🏷️ Tags
#array #hash_table #enumeration
Telegraph
find-the-maximum-number-of-elements-in-subset
You are given an array of positive integers nums. You need to select a subset of nums which satisfies the following condition: