Divide an Array Into Subarrays With Minimum Cost I You are given an array of integers nums of length n. The cost of an array is the value of its first element. For example, the cost of [1,2,3] i...
Find Smallest Letter Greater Than Target You are given an array of characters letters that is sorted in non-decreasing order, and a character target. There are at least two different characters i...
Minimum Cost to Convert String II You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English characters. You are also given two 0-indexed string a...
Minimum Cost to Convert String I You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character ar...
Minimum Cost Path with Edge Reversals You are given a directed, weighted graph with n nodes labeled from 0 to n - 1, and an array edges where edges[i] = [ui, vi, wi] represents a directed edge fr...
Minimum Absolute Difference Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list of pairs in ascending orde...
Minimum Difference Between Highest and Lowest of K Scores You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k. Pi...
Minimize Maximum Pair Sum in Array The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs. For example, if we have pairs (1,5), (2,3), an...
Minimum Pair Removal to Sort Array I Given an array nums, you can perform the following operation any number of times: Select the **adjacent** pair with the **minimum** sum in nums. If multiple ...
Construct the Minimum Bitwise Array I You are given an array nums consisting of n prime integers. You need to construct an array ans of length n, such that, for each index i, the bitwise OR of a...