1297. Maximum Number of Occurrences of a Substring
1297. Maximum Number of Occurrences of a Substring
Description
Given a string s, return the maximum number of occurrences of any substring under the following rules:
1423. Maximum Points You Can Obtain from Cards
1423. Maximum Points You Can Obtain from Cards
Description
There are several cards arranged in a row , and each card has an associated number of points. The points are given in the integer array cardPoints.
2461. Maximum Sum of Distinct Subarrays With Length K
2461. Maximum Sum of Distinct Subarrays With Length K
Description
You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions:
2841. Maximum Sum of Almost Unique Subarray
2841. Maximum Sum of Almost Unique Subarray
Description
You are given an integer array nums and two positive integers m and k.
1461. Check If a String Contains All Binary Codes of Size K
1461. Check If a String Contains All Binary Codes of Size K
Description
Given a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false.
1052. Grumpy Bookstore Owner
3327. Check if DFS Strings Are Palindromes
3327. Check if DFS Strings Are Palindromes
Description
You are given a tree rooted at node 0, consisting 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.
3326. Minimum Division Operations to Make Array Non Decreasing
3326. Minimum Division Operations to Make Array Non Decreasing
Description
You are given an integer array nums.
3325. Count Substrings With K-Frequency Characters I
3325. Count Substrings With K-Frequency Characters I
Description
Given a string s and an integer k, return the total number of substrings of s where at least one character appears at least k times.