From d82d5a57a268def6fa8180cc9362e3c1520be2c0 Mon Sep 17 00:00:00 2001
From: chayan das <110921638+Chayandas07@users.noreply.github.com>
Date: Wed, 12 Mar 2025 17:03:22 +0530
Subject: [PATCH] Create 2529. Maximum Count of Positive Integer and Negative
 Integer

---
 ...t of Positive Integer and Negative Integer | 26 +++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 2529. Maximum Count of Positive Integer and Negative Integer

diff --git a/2529. Maximum Count of Positive Integer and Negative Integer b/2529. Maximum Count of Positive Integer and Negative Integer
new file mode 100644
index 0000000..02fb9cf
--- /dev/null
+++ b/2529. Maximum Count of Positive Integer and Negative Integer	
@@ -0,0 +1,26 @@
+class Solution {
+public:
+    int maximumCount(vector<int>& nums) {
+        int n = nums.size();
+        int l = 0, r = n - 1;
+        while (l <= r){
+            int mid = (l + r) >> 1;
+            if (nums[mid] < 0)
+                l = mid + 1;
+            else
+                r = mid - 1;
+        }
+        if (l < n && nums[l] != 0)
+            return max(l, n - l);
+        int neg = l;
+        r = n - 1;
+        while (l <= r){
+            int mid = (l + r) >> 1;
+            if (nums[mid] == 0)
+                l = mid + 1;
+            else
+                r = mid - 1; 
+        }
+        return max(neg, n - l);
+    }
+};