Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/ Given an array nums of integers, we must modify the array in the following way: we choose an i and replace nums[i] with -nums[i], and we repeat…
Description https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/ There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to n -…
Description https://leetcode.com/problems/maximum-number-of-balls-in-a-box/ You are working in a ball factory where you have n balls numbered from lowLimit up to highLimit inclusive (i.e., n == highLimit – lowLimit +…
Description https://leetcode.com/problems/kth-largest-element-in-a-stream/ Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted…
Description https://leetcode.com/problems/distribute-candies-to-people/ We distribute some number of candies, to a row of n = num_people people in the following way: We then give 1 candy…
Description https://leetcode.com/problems/pascals-triangle-ii/ Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal’s triangle. In Pascal’s triangle, each number is the sum of the…
Description https://leetcode.com/problems/reformat-phone-number/ You are given a phone number as a string number. number consists of digits, spaces ‘ ‘, and/or dashes ‘-‘. You would like…
Description https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/ Given two integer arrays startTime and endTime and given an integer queryTime. The ith student started doing their homework at the time startTime[i] and finished it at…
Description https://leetcode.com/problems/minimum-distance-to-the-target-element/ Given an integer array nums (0-indexed) and two integers target and start, find an index i such that nums[i] == target and abs(i – start) is minimized. Note that abs(x) is the absolute…
Description https://leetcode.com/problems/path-crossing/ Given a string path, where path[i] = ‘N’, ‘S’, ‘E’ or ‘W’, each representing moving one unit north, south, east, or west, respectively. You start…