Available question text
Given a non-decreasing sorted array, return the larger of the counts of positive and negative numbers (zeros are ignored). Because the array is sorted, you can compute these counts in O(log n) by binary-searching the boundaries between negative/zero/positive regions.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2529. Maximum Count of Positive Integer and Negative Integer
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source