Done Binary Search 2

Problem-1

@@ -0,0 +1,57 @@
+//Time Complexity: O(logn)
+
+
+class Solution {
+
+    private int leftSearch(int[] nums,int target,int low, int high)
+    {
+        while(low<=high)
+        {
+            int mid=low+(high-low)/2;
+            if(nums[mid]==target)
+            {
+                if(mid==0 || nums[mid]!=nums[mid-1])
+                    return mid;
+                else
+                    high=mid-1;
+            }
+            else if(target>nums[mid])
+                low=mid+1;
+            else
+                high=mid-1;
+
+        }
+        return -1;
+    }
+    private int rightSearch(int[] nums,int target,int low, int high)
+    {
+        while(low<=high)
+        {
+            int mid=low+(high-low)/2;
+            if(nums[mid]==target)
+            {
+                if(mid==nums.length-1 || nums[mid]!=nums[mid+1])
+                    return mid;
+                else
+                    low=mid+1;
+            }
+            else if(target>nums[mid])
+                low=mid+1;
+            else
+                high=mid-1;
+
+        }
+        return -1;
+    }
+    public int[] searchRange(int[] nums, int target) {
+        if(nums.length==0)
+            return new int[]{-1,-1};
+        int left =leftSearch(nums,target, 0,nums.length-1);
+        int right;
+        if(left==-1)
+            return new int[]{-1,-1};
+        else
+            right=rightSearch(nums,target,0,nums.length-1);
+        return new int[]{left,right};
+    }
+}

Problem-2

@@ -0,0 +1,22 @@
+//time complexity : O(logn)
+class Solution {
+    public int findMin(int[] nums) {
+        int low,mid,high;
+        low=0;
+        int length=nums.length;
+        high=nums.length-1;
+        while(low<=high)
+        {
+            mid=low+(high-low)/2;
+            if(nums[low]<=nums[high])
+                return nums[low];
+            else if((mid==0||nums[mid]<nums[mid-1])&& (mid==length-1|| nums[mid]<nums[mid+1]))
+                return nums[mid];
+            else if(nums[low]<=nums[mid] )
+                low=mid+1;
+            else
+                high=mid-1;
+        }
+        return 0;
+    }
+}

Problem-3

@@ -0,0 +1,21 @@
+//Time complexity: O(logn)
+
+class Solution {
+    public int findPeakElement(int[] nums) {
+        int low,high,mid,length;
+        length=nums.length;
+        low=0;
+        high=length-1;
+        while(low<=high)
+        {
+            mid=low+(high-low)/2;
+            if((mid==0||nums[mid]>nums[mid-1])&&(mid==length-1||nums[mid]>nums[mid+1]))
+                return mid;
+            else if(mid>0&&nums[mid]<nums[mid-1])
+                high=mid-1;
+            else    
+                low=mid+1;
+        }
+        return 0;
+    }
+}