LeetCode 1165. Single-Row Keyboard
Description https://leetcode.com/problems/single-row-keyboard/ There is a special keyboard with all keys in a single row. Given a string keyboard of length 26 indicating the…
Category: Array
LeetCode 1389. Create Target Array in the Given Order
Description https://leetcode.com/problems/create-target-array-in-the-given-order/ Given two arrays of integers nums and index. Your task is to create target array under the following rules: Initially target array is empty. From…
LeetCode 1313. Decompress Run-Length Encoded List
Description https://leetcode.com/problems/decompress-run-length-encoded-list/ We are given a list nums of integers representing a list compressed with run-length encoding. Consider each adjacent pair of elements [freq,…
LeetCode 1089. Duplicate Zeros
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…
LeetCode 1603. Design Parking System
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,…
LeetCode 1512. Number of Good Pairs
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]…
LeetCode 1365. How Many Numbers Are Smaller Than the Current Number
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,…
LeetCode 1476. Subrectangle Queries
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…
LeetCode 1570. Dot Product of Two Sparse Vectors
Description https://leetcode.com/problems/dot-product-of-two-sparse-vectors/ Given two sparse vectors, compute their dot product. Implement class SparseVector: SparseVector(nums) Initializes the object with the vector nums dotProduct(vec) Compute the…
LeetCode 1431. Kids With the Greatest Number of Candies
Description https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/ Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has. For each kid check if…