3117. Minimum Sum of Values by Dividing Array
3117. Minimum Sum of Values by Dividing Array
Description
You are given two arrays nums
and andValues
of length n
and m
respectively.
3117. Minimum Sum of Values by Dividing Array
You are given two arrays nums
and andValues
of length n
and m
respectively.
3114. Latest Time You Can Obtain After Replacing Characters
You are given a string s
representing a 12-hour format time where some of the digits (possibly none) are replaced with a "?"
.
3113. Find the Number of Subarrays Where Boundary Elements Are Maximum
You are given an array of positive integers nums
.
3112. Minimum Time to Visit Disappearing Nodes
There is an undirected graph of n
nodes. You are given a 2D array edges
, where edges[i] = [ui, vi, lengthi]
describes an edge between node ui
and node vi
with a traversal time of lengthi
units.
3111. Minimum Rectangles to Cover Points
You are given a 2D integer array points
, where points[i] = [xi, yi]
. You are also given an integer w
. Your task is to cover all the given points with rectangles.
3108. Minimum Cost Walk in Weighted Graph
There is an undirected weighted graph with n
vertices labeled from 0
to n - 1
.
3107. Minimum Operations to Make Median of Array Equal to K
You are given an integer array nums
and a non-negative integer k
. In one operation, you can increase or decrease any element by 1.
3106. Lexicographically Smallest String After Operations With Constraint
You are given a string s
and an integer k
.
3105. Longest Strictly Increasing or Strictly Decreasing Subarray
You are given an array of integers nums
. Return the length of the longest subarray of nums
which is either strictly increasing or strictly decreasing.