3213. Construct String with Minimum Cost
Problem You are given a string target, an array of strings words, and an integer array costs, both arrays of the same length....
Problem You are given a string target, an array of strings words, and an integer array costs, both arrays of the same length....
Problem You are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every second, for all indices 0 <= i &...
Problem You are given an undirected weighted connected graph containing n nodes labeled from 0 to n - 1, and an integer array...
Problem You are given an array pairs, where pairs[i] = [xᵢ, yᵢ], and: There are no duplicates. xᵢ < yᵢ Let ways be the n...
Problem You are given an integer n representing the length of an unknown array that you are trying to recover. You are also g...
Problem Run-length encoding is a string compression method that works by replacing consecutive identical characters (repeated...
Problem You are given two positive integers xCorner and yCorner, and a 2D array circles, where circles[i] = [xᵢ, yᵢ, rᵢ] deno...