3739. Count Subarrays With Majority Element II

LeetCodeArrayHash TableDivide and ConquerSegment TreeMerge SortPrefix SumOpen on judge ↗

You are given an integer array nums and an integer target. Return the number of subarrays of nums in which target is the majority element. The majority element of a subarray is the element that appears strictly more than half of the times in that subarray. Example 1: Input: nums = [1,2,2,3], target = 2 Output: 5 Explanation: Valid subarrays with target = 2 as the majority element: - nums

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI