LeetCode 441. Arranging Coins
Description https://leetcode.com/problems/arranging-coins/ You have a total of n coins that you want to form in a staircase shape, where every k-th row must…
Category: Binary Search
LeetCode 410. Split Array Largest Sum
Description https://leetcode.com/problems/split-array-largest-sum/ Given an array nums which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays.…
LeetCode 315. Count of Smaller Numbers After Self
Description https://leetcode.com/problems/count-of-smaller-numbers-after-self/ You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the…
LeetCode 852. Peak Index in a Mountain Array
Description https://leetcode.com/problems/peak-index-in-a-mountain-array/ Let’s call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length -…
LeetCode 240. Search a 2D Matrix II
Description https://leetcode.com/problems/search-a-2d-matrix-ii/ Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers…
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] ≠…
LeetCode 33. Search in Rotated Sorted Array
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]).…
LeetCode 278. First Bad Version
Description You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version…
LeetCode 69. Sqrt(x)
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…
LeetCode 34. Find First and Last Position of Element in Sorted Array
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…