3102. Minimize Manhattan Distances
You are given a 0-indexed array
pointsrepresenting integer coordinates of some points on a 2D plane, wherepoints[i] = [xi, yi].The distance between two points is defined as their Manhattan distance.
Return the minimum possible value for maximum distance between any two points by removing exactly one point.
3101. Count Alternating Subarrays
You are given a binary array
nums.We call a subarray alternating if no two adjacent elements in the subarray have the same value.
Return the number of alternating subarrays in
nums.