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.
3324. Find the Sequence of Strings Appeared on the Screen
1652. Defuse the Bomb
2379. Minimum Recolors to Get K Consecutive Black Blocks
2379. Minimum Recolors to Get K Consecutive Black Blocks
Description
You are given a 0-indexed string blocks of length n, where blocks[i] is either 'W' or 'B', representing the color of the i^th block. The characters 'W' and 'B' denote the colors white and black, respectively.
2090. K Radius Subarray Averages
2090. K Radius Subarray Averages
Description
You are given a 0-indexed array nums of n integers, and an integer k.
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
Description
Given an array of integers arr and two integers k and threshold, return the number of sub-arrays of size k and average greater than or equal to threshold.
643. Maximum Average Subarray I
643. Maximum Average Subarray I
Description
You are given an integer array nums consisting of n elements, and an integer k.