update site data

Author: neetcode-gh

.problemSiteData.json

@@ -1,15 +1,12 @@
-class Solution {
-public:
-    int removeDuplicates(vector<int>& nums) {
-        int left = 1;
-
-        for(int right = 1; right < nums.size(); right++){
-            if(nums[right] != nums[right - 1]){
-                nums[left] = nums[right];
-                left++;
-            }
+int removeDuplicates(int* nums, int numsSize){
+    int indx = 1;
+    
+    for(int i = 1; i < numsSize; i++){
+        if(nums[i] != nums[i-1]){
+            nums[indx] = nums[i];
+            indx++;
         }
-
-        return left;
     }
-};
+    return indx;
+}
+

cpp/0026-remove-duplicates-from-sorted-array.c

@@ -1,22 +1,37 @@
+/*
+  Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well.
+  You must not use any built-in exponent function or operator.
+
+  For example, do not use pow(x, 0.5) in c++ or x ** 0.5 in python.
+
+  Ex. Input: x = 4
+      Output: 2
+      Explanation: The square root of 4 is 2, so we return 2.
+
+  Time  : O(log N)
+  Space : O(1)
+*/
+
 class Solution {
 public:
     int mySqrt(int x) {
-
-        int l = 0;
-        int r = x;
-
-        while(l <= r){
-            long int m = (l + r) / 2;
-            if(m * m == x){
-                return m;
-            }
-            else if(m * m > x){
-                r = m - 1;
-            }
-            else{
-                l = m + 1;
-            }
+        if(x == 0 || x == 1)
+            return x;
+            
+        long long beg = 0, mid = 0, end = x/2;
+        while(beg <= end) {
+            mid = (beg + end)/2;
+            if(mid * mid < x) {
+                if((mid + 1) * (mid + 1) > x)
+                    return mid;
+                beg = mid+1;
+            } else if(mid * mid > x) {
+                if( (mid - 1) * (mid - 1) < x)
+                    return mid-1;
+                end = mid - 1;
+            } else 
+                return mid;
         }
-        return r;
+        return mid;
     }
-};
+};

cpp/0026-remove-duplicates-from-sorted-array.cpp

@@ -1,57 +1,18 @@
 class MyHashSet {
-    final int mod = 10000;
-    ListNode[] set;
-
-    class ListNode {
-        int val;
-        ListNode next;
-        private ListNode(int val) {
-            this.val = val;
-            this.next = null;
-        }
-    }
-
+    boolean [] setArray;
     public MyHashSet() {
-        this.set = new ListNode[mod];
-        for (int i = 0; i < set.length; i++) {
-            set[i] = new ListNode(0);
-        }
+        setArray=new boolean[(int)1e6+1];
     }
-    
+
     public void add(int key) {
-        ListNode head = set[key % mod];
-        while (head.next != null) {
-            if (head.next.val == key) return;
-            head = head.next;
-        }
-        head.next = new ListNode(key);
+        setArray[key]=true;
     }
-    
+
     public void remove(int key) {
-        ListNode head = set[key % mod];
-        while (head.next != null) {
-            if (head.next.val == key) {
-                head.next = head.next.next;
-                return;
-            }
-            head = head.next;
-        }
+        setArray[key]=false;
     }
-    
+
     public boolean contains(int key) {
-        ListNode head = set[key % mod];
-        while (head.next != null) {
-            if (head.next.val == key) return true;
-            head = head.next;
-        }
-        return false;
+        return setArray[key];
     }
-}
-
-/**
- * Your MyHashSet object will be instantiated and called as such:
- * MyHashSet obj = new MyHashSet();
- * obj.add(key);
- * obj.remove(key);
- * boolean param_3 = obj.contains(key);
- */
+}