3367. Maximize Sum of Weights after Edge Removals
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.
3365. Rearrange K Substrings to Form Target String
You are given two strings s and t, both of which are anagrams of each other, and an integer k.
3363. Find the Maximum Number of Fruits Collected
There is a game dungeon comprised ofn x n rooms arranged in a grid.
3362. Zero Array Transformation III
You are given an integer array nums of length n and a 2D array queries where queries[i] = [li, ri].
3361. Shift Distance Between Two Strings
You are given two strings s and t of the same length, and two integer arrays nextCost and previousCost.
3356. Zero Array Transformation II
You are given an integer array nums of length n and a 2D array queries where queries[i] = [li, ri, vali].
3355. Zero Array Transformation I
You are given an integer array nums of length n and a 2D array queries, where queries[i] = [li, ri].
3352. Count K-Reducible Numbers Less Than N
You are given a binary string s representing a number n in its binary form.