# LeetCode 162. Find Peak Element

Description https://leetcode.com/problems/find-peak-element/ A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠…

Be a Good Techer and Tech for Good. www.goodtecher.com

Description https://leetcode.com/problems/find-peak-element/ A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠…

Description https://leetcode.com/problems/search-in-rotated-sorted-array/ Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).…

Description You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version…

Description Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the…

Description Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s…

Description https://leetcode.com/problems/search-insert-position/description/ Given a sorted array and a target value, return the index if the target is found. If not,…

Description https://leetcode.com/problems/median-of-two-sorted-arrays/ There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of…