Problem:\nhttps://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/\n\nThis test case is failing.\n![image](https://assets.leetcode.com/users/images/bc890687-0ffc-489b-ba93-0131e1e1cfcd_1655098210.5167916.png)\n\nwhat mistake I am making in my code ?\n\n\n```\nvector<int> searchRange(vector<int>& nums, int target) {\n        \n        vector<int> vec( 2, -1 );\n        \n        int lo = 0;\n        int hi = nums.size() - 1;\n        \n        //first position\n        while( lo <= hi )\n        {\n            \n            int mid = lo + (hi - lo) / 2;\n            \n            if( nums[ mid ] == target )\n            {\n                \n                vec[0] = mid;\n                //keep searching on left\n                hi = mid - 1;\n            }\n                \n             \n            if( nums[ mid ] < target )\n                lo = mid + 1;\n            \n            else\n                hi = mid - 1;\n        }\n        \n        //resetting the values of hi and lo\n        lo = 0;\n        hi = nums.size() - 1;\n        \n        \n        //last position\n        while( lo <= hi )\n        {\n            \n            int mid = lo + (hi - lo) / 2;\n            \n            if( nums[ mid ] == target )\n            {\n                \n                vec[1] = mid;\n                // keep searching on right\n                lo = mid + 1;\n            }\n             \n            if( nums[ mid ] < target )\n                lo = mid + 1;\n            \n            else\n                hi = mid - 1;\n        }\n        \n        return vec;\n        \n        \n    }\n```

Problem:\nhttps://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/\n\nThis test case is failing.\n\n\nwhat mistake I am making in 