leetcode.com 2026-10-10
🟡2333.minimum-sum-of-squared-difference
🏷️ Tags
#greedy #array #binary_search #sorting #heap_priority_queue
🟡2333.minimum-sum-of-squared-difference
🏷️ Tags
#greedy #array #binary_search #sorting #heap_priority_queue
Telegraph
minimum-sum-of-squared-difference
You are given two positive 0-indexed integer arrays nums1 and nums2, both of length n. The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n. You are also given two positive integers k1…
leetcode.cn 2026-10-12
🔴2897.apply-operations-on-array-to-maximize-sum-of-squares
🏷️ Tags
#greedy #bit_manipulation #array #hash_table
🔴2897.apply-operations-on-array-to-maximize-sum-of-squares
🏷️ Tags
#greedy #bit_manipulation #array #hash_table
Telegraph
apply-operations-on-array-to-maximize-sum-of-squares
给你一个下标从 0 开始的整数数组 nums 和一个 正 整数 k 。 你可以对数组执行以下操作 任意次 :
leetcode.com 2026-10-12
🔴2897.apply-operations-on-array-to-maximize-sum-of-squares
🏷️ Tags
#greedy #bit_manipulation #array #hash_table
🔴2897.apply-operations-on-array-to-maximize-sum-of-squares
🏷️ Tags
#greedy #bit_manipulation #array #hash_table
Telegraph
apply-operations-on-array-to-maximize-sum-of-squares
You are given a 0-indexed integer array nums and a positive integer k. You can do the following operation on the array any number of times:
leetcode.cn 2026-10-15
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-i
给你一个下标从 0 开始的整数数组 nums 。 定义 nums 一个子数组的 不同计数 值如下:
leetcode.com 2026-10-15
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-i
You are given a 0-indexed integer array nums. The distinct count of a subarray of nums is defined as:
leetcode.cn 2026-10-16
🔴2916.subarrays-distinct-element-sum-of-squares-ii
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🔴2916.subarrays-distinct-element-sum-of-squares-ii
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-ii
给你一个下标从 0 开始的整数数组 nums 。 定义 nums 一个子数组的 不同计数 值如下: