Removed unneccesary extra solution

Author: a93a

kotlin/0034-find-first-and-last-position-of-element-in-sorted-array.kt

@@ -30,40 +30,3 @@ class Solution {
         return res
     }
 }
-
-class Solution {
-    fun searchRange(nums: IntArray, target: Int): IntArray {
-        val res = intArrayOf(-1,-1)
-        var left = 0
-        var right = nums.size-1
-        var pos = -1
-        var mid = -1
-        while(left <= right){
-            mid = (left + right) / 2
-            if(target > nums[mid]){
-                left = mid + 1
-            }else if(target < nums[mid]){
-                right = mid - 1
-            }else{
-                pos = mid
-                right = mid -1
-            }
-            res[0] = pos
-        }    
-        left = 0
-        right = nums.size-1
-        while(left <= right){
-            mid = (left + right) / 2
-            if(target > nums[mid]){
-                left = mid + 1
-            }else if(target < nums[mid]){
-                right = mid - 1
-            }else{
-                pos = mid
-                left = mid + 1
-            }
-            res[1] = pos
-        }    
-        return res
-    }
-}