3154. Find Number of Ways to Reach the K-th Stair
3154. Find Number of Ways to Reach the K-th Stair
Description
You are given a non-negative integer k. There exists a staircase with an infinite number of stairs, with the lowest stair numbered 0.
3153. Sum of Digit Differences of All Pairs
3153. Sum of Digit Differences of All Pairs
Description
You are given an array nums consisting of positive integers where all integers have the same number of digits.
3152. Special Array II
3151. Special Array I
3149. Find the Minimum Cost Array Permutation
3149. Find the Minimum Cost Array Permutation
Description
You are given an array nums which is a permutation of [0, 1, 2, ..., n - 1]. The score of any permutation of [0, 1, 2, ..., n - 1] named perm is defined as:
46. Permutations
3148. Maximum Difference Score in a Grid
3148. Maximum Difference Score in a Grid
Description
You are given an m x n matrix grid consisting of positive integers. You can move from a cell in the matrix to any other cell that is either to the bottom or to the right (not necessarily adjacent). The score of a move from a cell with the value c1 to a cell with the value c2 is c2 - c1.
3147. Taking Maximum Energy From the Mystic Dungeon
3147. Taking Maximum Energy From the Mystic Dungeon
Description
In a mystic dungeon, n magicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you.
3146. Permutation Difference between Two Strings
3146. Permutation Difference between Two Strings
Description
You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s.
3144. Minimum Substring Partition of Equal Character Frequency
3144. Minimum Substring Partition of Equal Character Frequency
Description
Given a string s, you need to partition it into one or more balanced substrings. For example, if s == "ababcc" then ("abab", "c", "c"), ("ab", "abc", "c"), and ("ababcc") are all valid partitions, but ("a", "bab" , "cc"), ("aba" , "bc", "c"), and ("ab", "abcc") are not. The unbalanced substrings are bolded.