33. Search in Rotated Sorted Array 📄 Problem Statement : There is an integer array nums sorted in ascending order (with distinct values). Before being passed to your function, nums may be rotated at an unknown pivot index k (where 1 <= k < nums.length ) such that the array becomes [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] . You are given the array nums after the rotation and an integer target . Your task is to return the index of the target if it exists in nums , or return -1 if it does not exist. You must solve it in O(log n) time. 📚 Examples : Example 1 : Input: nums = [4,5,6,7,0,1,2], target = 0 Output: 4 Example 2 : Input: nums = [4,5,6,7,0,1,2], target = 3 Output: -1 Example 3 : Input: nums = [1], target = 0 Output: -1 📜 Constraints : 1 <= nums.length <= 5000 -10⁴ <= nums[i] <= 10⁴ All values of nums are unique . nums is a sorted array, possibly rotated . -10⁴ <= target <= 10⁴ ...
How To Sleep Faster For Students.
Hello everyone.
This blog is about how to sleep faster for students,parents,boys, ladies, businessman,etc. i am so sure this will work for you and helps you to sleep well and faster.
so here's are the tips
10 Sleep Tips
• Stick to a schedule and avoid long naps
• Don't be a night owl (but your ideal bedtime may be later when you are young)
• Wake up to early morning light
• Get moving during the day
• Watch what you eat or drink - no caffeine after lunch and don't eat or drink for 3 hours before bed
• Mind your medicines (that may affect sleep)
• Cool, quiet and dark place to sleep
• Eliminate electronics (a few hours before bedtime)
• Establish bedtime rituals, such as reading
• Know the warning signs of poor sleep
Comments
Post a Comment
If you have any suggestions then comment me .