CNoodle

摘要： Given an integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no su 阅读全文

摘要： Given an array of integers and an integer k, you need to find the minimum size of continuous no-empty subarrays whose sum equals to k, and return its 阅读全文

摘要： Given two integers num and k, consider a set of positive integers with the following properties: The units digit of each integer is k. The sum of the 阅读全文

摘要： Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements beyond the 阅读全文

摘要： Given a string str and a dictionary dict, you need to find out which words in the dictionary are subsequences of the string and return those words.The 阅读全文

摘要： There is a bookstore. In the next n days, customer[i] customers will arrive on the i-th day and leave at the end of that day. However, the bookstore o 阅读全文

摘要： Winter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses. Every house can b 阅读全文

摘要： Given n books and each book has the same number of pages. There are k persons to copy these books and the i-th person needs times[i] minutes to copy a 阅读全文

摘要： Given n pieces of wood with length L[i] (integer array). Cut them into small pieces to guarantee you could have equal or more than k pieces with the s 阅读全文

摘要： A sentence is a string of single-space separated words where each word can contain digits, lowercase letters, and the dollar sign '$'. A word represen 阅读全文

摘要： You are given a 2D integer array stockPrices where stockPrices[i] = [dayi, pricei] indicates the price of the stock on day dayi is pricei. A line char 阅读全文

摘要： Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets. A triplet (arr[i], arr[j], arr[k]) is goo 阅读全文

摘要： Given a 0-indexed integer array nums, return the number of distinct quadruplets (a, b, c, d) such that: nums[a] + nums[b] + nums[c] == nums[d], and a 阅读全文

摘要： Design a max stack data structure that supports the stack operations and supports finding the stack's maximum element. Implement the MaxStack class: M 阅读全文

摘要： You are given an integer array nums. You want to maximize the number of points you get by performing the following operation any number of times: Pick 阅读全文

摘要： You have a 2-D grid of size m x n representing a box, and you have n balls. The box is open on the top and bottom sides. Each cell in the box has a di 阅读全文

摘要： There are n dominoes in a line, and we place each domino vertically upright. In the beginning, we simultaneously push some of the dominoes either to t 阅读全文

摘要： There are n houses evenly lined up on the street, and each house is beautifully painted. You are given a 0-indexed integer array colors of length n, w 阅读全文

摘要： Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0 <= i < 阅读全文

摘要： You are given two strings s1 and s2 of equal length. A string swap is an operation where you choose two indices in a string (not necessarily different 阅读全文