3342. Find Minimum Time to Reach Last Room II
3342. Find Minimum Time to Reach Last Room II
Description
There is a dungeon with n x m rooms arranged as a grid.
3341. Find Minimum Time to Reach Last Room I
3341. Find Minimum Time to Reach Last Room I
Description
There is a dungeon with n x m rooms arranged as a grid.
3337. Total Characters in String After Transformations II
3337. Total Characters in String After Transformations II
Description
You are given a string s consisting of lowercase English letters, an integer t representing the number of transformations to perform, and an array nums of size 26. In one transformation , every character in s is replaced according to the following rules:
3336. Find the Number of Subsequences With Equal GCD
3336. Find the Number of Subsequences With Equal GCD
Description
You are given an integer array nums.
3335. Total Characters in String After Transformations I
3335. Total Characters in String After Transformations I
Description
You are given a string s and an integer t, representing the number of transformations to perform. In one transformation , every character in s is replaced according to the following rules:
3334. Find the Maximum Factor Score of Array
3333. Find the Original Typed String II
3333. Find the Original Typed String II
Description
Alice is attempting to type a specific string on her computer. However, she tends to be clumsy and may press a key for too long, resulting in a character being typed multiple times.
3332. Maximum Points Tourist Can Earn
3332. Maximum Points Tourist Can Earn
Description
You are given two integers, n and k, along with two 2D integer arrays, stayScore and travelScore.
3331. Find Subtree Sizes After Changes
3331. Find Subtree Sizes After Changes
Description
You are given a tree rooted at node 0 that consists of n nodes numbered from 0 to n - 1. The tree is represented by an array parent of size n, where parent[i] is the parent of node i. Since node 0 is the root, parent[0] == -1.