3381. Maximum Subarray Sum With Length Divisible by K
3381. Maximum Subarray Sum With Length Divisible by K
Description
You are given an array of integers nums and an integer k.
3380. Maximum Area Rectangle With Point Constraints I
3380. Maximum Area Rectangle With Point Constraints I
Description
You are given an array points where points[i] = [xi, yi] represents the coordinates of a point on an infinite plane.
3378. Count Connected Components in LCM Graph
3378. Count Connected Components in LCM Graph
Description
You are given an array of integers nums of size n and a positive integer threshold.
3377. Digit Operations to Make Two Integers Equal
3377. Digit Operations to Make Two Integers Equal
Description
You are given two integers n and m that consist of the same number of digits.
3376. Minimum Time to Break Locks I
3376. Minimum Time to Break Locks I
Description
Bob is stuck in a dungeon and must break n locks, each requiring some amount of energy to break. The required energy for each lock is stored in an array called strength where strength[i] indicates the energy needed to break the i^th lock.
3373. Maximize the Number of Target Nodes After Connecting Trees II
3373. Maximize the Number of Target Nodes After Connecting Trees II
Description
There exist two undirected trees with n and m nodes, labeled from [0, n - 1] and [0, m - 1], respectively.
3372. Maximize the Number of Target Nodes After Connecting Trees I
3372. Maximize the Number of Target Nodes After Connecting Trees I
Description
There exist two undirected trees with n and m nodes, with distinct labels in ranges [0, n - 1] and [0, m - 1], respectively.
3371. Identify the Largest Outlier in an Array
3371. Identify the Largest Outlier in an Array
Description
You are given an integer array nums. This array contains n elements, where exactly n - 2 elements are special numbers . One of the remaining two elements is the sum of these special numbers , and the other is an outlier .
3367. Maximize Sum of Weights after Edge Removals
3367. Maximize Sum of Weights after Edge Removals
Description
There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 2D integer array edges of length n - 1, where edges[i] = [ui, vi, wi] indicates that there is an edge between nodes ui and vi with weight wi in the tree.