902. Numbers At Most N Given Digit Set
902. Numbers At Most N Given Digit Set
Description
Given an array of digits which is sorted in non-decreasing order. You can write numbers using each digits[i] as many times as we want. For example, if digits = ['1','3','5'], we may write numbers such as '13', '551', and '1351315'.
2376. Count Special Integers
2213. Longest Substring of One Repeating Character
2213. Longest Substring of One Repeating Character
Description
You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries.
307. Range Sum Query - Mutable
307. Range Sum Query - Mutable
Description
Given an integer array nums, handle multiple queries of the following types:
3347. Maximum Frequency of an Element After Performing Operations II
3347. Maximum Frequency of an Element After Performing Operations II
Description
You are given an integer array nums and two integers k and numOperations.
3346. Maximum Frequency of an Element After Performing Operations I
3346. Maximum Frequency of an Element After Performing Operations I
Description
You are given an integer array nums and two integers k and numOperations.
3343. Count Number of Balanced Permutations
3343. Count Number of Balanced Permutations
Description
You are given a string num. A string of digits is called balanced if the sum of the digits at even indices is equal to the sum of the digits at odd indices.
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.