Made changes according to PA

Author: thevijayshankersharma

dsa-solutions/lc-solutions/0000-0099/0033-search-in-rotated-sorted-array.md

@@ -1,54 +1,52 @@
 ---
 id: search-in-rotated-sorted-array
 title: Search in Rotated Sorted Array (LeetCode)
-difficulty: Medium
 sidebar_label: 0033-SearchInRotatedSortedArray
 description: Search for a target element in a rotated sorted array with distinct values using an algorithm with O(log n) runtime complexity.
 ---
 
 ## Problem Description
 
-
 | Problem Statement | Solution Link | LeetCode Profile |
 | :---------------- | :------------ | :--------------- |
 | [Merge Two Sorted Lists](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Merge Two Sorted Lists Solution on LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array/solutions/) |  [VijayShankerSharma](https://leetcode.com/u/darkknight648/) |
 
 ## Problem Description
 
-There is an integer array $nums$ sorted in ascending order (with distinct values).
+There is an integer array nums sorted in ascending order (with distinct values).
 
-Prior to being passed to your function, $nums$ is possibly rotated at an unknown pivot index $k$ (0 <= k < nums.length) such that the resulting array is $[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]$ (0-indexed).
+Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed).
 
-Given the array $nums$ after the possible rotation and an integer $target$, return the index of $target$ if it is in $nums, or -1 if it is not in $nums$.
+Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.
 
 You must write an algorithm with $O(log n)$ runtime complexity.
 
 ### Examples
 
 #### Example 1
 
-- **Input:** $nums = [4,5,6,7,0,1,2]$, $target = 0$
-- **Output:** $4$
-- **Explanation:** 0 is located at index 4 in the rotated sorted array $[4,5,6,7,0,1,2]$.
+- **Input:** nums = [4,5,6,7,0,1,2], target = 0
+- **Output:** 4
+- **Explanation:** 0 is located at index 4 in the rotated sorted array [4,5,6,7,0,1,2].
 
 #### Example 2
 
-- **Input:** $nums = [4,5,6,7,0,1,2]$, $target = 3$
-- **Output:** $-1$
-- **Explanation:** 3 is not in $nums$, so return -1.
+- **Input:** nums = [4,5,6,7,0,1,2], target = 3
+- **Output:** -1
+- **Explanation:** 3 is not in nums, so return -1.
 
 #### Example 3
 
-- **Input:** $nums = [1]$, $target = 0$
-- **Output:** $-1$
-- **Explanation:** 0 is not in $nums$, so return -1.
+- **Input:** nums = [1], target = 0
+- **Output:** -1
+- **Explanation:** 0 is not in nums, so return -1.
 
 ### Constraints
 
 - $v1 <= nums.length <= 5000$
 - $-10^4 <= nums[i] <= 10^4$
 - All values of $nums$ are unique.
-- $nums$ is an ascending array that is possibly rotated.
+- nums is an ascending array that is possibly rotated.
 - $-10^4 <= target <= 10^4$
 
 ### Approach