Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/goal-parser-interpretation/ You own a Goal Parser that can interpret a string command. The command consists of an alphabet of “G”, “()” and/or “(al)” in some order. The Goal Parser…
Description https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/ Given an integer number n, return the difference between the product of its digits and the sum of its…
Description https://leetcode.com/problems/duplicate-zeros/ Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right. Note…
Description https://leetcode.com/problems/group-sold-products-by-the-date/ SQL Schema Table Activities: +————-+———+ | Column Name | Type | +————-+———+ | sell_date | date | | product…
Description https://leetcode.com/problems/shuffle-string/ Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position…
Description https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/ Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number…
Description https://leetcode.com/problems/design-parking-system/ Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big,…
Description https://leetcode.com/problems/number-of-good-pairs/ Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Input: nums = [1,2,3,1,1,3]…
Description https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/ Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is,…
Description https://leetcode.com/problems/subrectangle-queries/ Implement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two…