Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/ Given an array nums sorted in non-decreasing order, and a number target, return True if and only if target is a majority element. A majority element is an element…
Description https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/ Given an array nums of n integers where nums[i] is in the range [1, n], return an array of all the integers in the range [1, n] that…
Description https://leetcode.com/problems/rank-transform-of-an-array/ Given an array of integers arr, replace each element with its rank. The rank represents how large the element…
Description https://leetcode.com/problems/crawler-log-folder/ The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described…
Description https://leetcode.com/problems/maximum-ascending-subarray-sum/ Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums. A subarray is defined as…
Description https://leetcode.com/problems/valid-mountain-array/ Given an array of integers arr, return true if and only if it is a valid mountain array. Recall that arr…
Description https://leetcode.com/problems/special-positions-in-a-binary-matrix/ Given a rows x cols matrix mat, where mat[i][j] is either 0 or 1, return the number of special positions in mat. A position (i,j) is called special if mat[i][j] == 1 and all other elements…
Description https://leetcode.com/problems/monotonic-array/ An array is monotonic if it is either monotone increasing or monotone decreasing. An array A is monotone increasing if for all i…
Description https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/ You have some apples, where arr[i] is the weight of the i-th apple. You also have a basket that can carry…
Description https://leetcode.com/problems/shift-2d-grid/ Given a 2D grid of size m x n and an integer k. You need to shift the grid k times. In one shift operation: Element…