Sorting and Binary Search Fixed

Author: omprashantjain

1 Leetcode Easy Problems/Leetcode 169 Majority Element using Sorting.java

@@ -0,0 +1,8 @@
+import java.util.*;
+
+class Solution {
+  public int majorityElement(int[] nums) {
+      Arrays.sort(nums);
+      return nums[nums.length/2];
+  }
+}

5 Sorting/problems/CountElements.java …ictly Smaller and Greater Elements .java5 Sorting/problems/CountElements.java renamed to 1 Leetcode Easy Problems/Leetcode 2148 Count Elements With Strictly Smaller and Greater Elements .java 5 Sorting/problems/CountElements.java renamed to 1 Leetcode Easy Problems/Leetcode 2148 Count Elements With Strictly Smaller and Greater Elements .java

@@ -0,0 +1,16 @@
+import java.util.*;
+
+class Solution {
+  public boolean containsDuplicate(int[] nums) {
+      // O(nlogn)
+      Arrays.sort(nums);
+      
+      // O(n)
+      for (int i = 0; i < nums.length - 1; i++) {
+          if (nums[i] == nums[i+1]) {
+              return true;
+          }
+      }
+      return false;
+  }
+}