_2529. Question 2529.md

2529. Question 2529

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : March 12, 2025

Last updated : March 12, 2025

---

Related Topics : N/A

Acceptance Rate : Unknown

---

Solutions

• e2529 v1.py
• e2529 v2 oneliner.py

Python

e2529 v1.py

class Solution:
    def maximumCount(self, nums: List[int]) -> int:
        pos = neg = 0
        for n in nums :
            if n > 0 :
                pos += 1
            elif n < 0 :
                neg += 1
        return max(pos, neg)

e2529 v2 oneliner.py

class Solution:
    def maximumCount(self, nums: List[int]) -> int:
        return max((pos := sum(x > 0 for x in nums)), len(nums) - nums.count(0) - pos)