leetcode
Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of(nums[i]-1)*(nums[j]-1). Example 1: Input: nums = [3,4,5,2] Output: 12 Explanation: If you choose the indices i=1 and j=2
leetcode
Given a sentence text (A sentence is a string of space-separated words) in the following format: * First letter is in upper case. * Each word in text are separated by a single space. Your task is to rearrange the words in text such that all words are rearranged in an increasing
leetcode
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 time endTime[i]. Return the number of students doing their homework at time queryTime. More formally, return the number of students where
leetcode
Given an array target and an integer n. In each iteration, you will read a number from list = {1,2,3..., n}. Build the target array using the following operations: * Push: Read a new element from the beginning list, and push it in the array. * Pop: delete the last element
leetcode
Given two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In other words s2 can break s1 or vice-versa. A string x can break string y (both of size n) if x[i] >
leetcode
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 there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of candies among them.
leetcode
Given the array orders, which represents the orders that customers have done in a restaurant. More specifically orders[i]=[customerNamei,tableNumberi,foodItemi] where customerNamei is the name of the customer, tableNumberi is the table customer sit at, and foodItemi is the item customer orders. Return the restaurant's “display
leetcode
Given alphanumeric string s. (Alphanumeric string is a string consisting of lowercase English letters and digits). You have to find a permutation of the string where no letter is followed by another letter and no digit is followed by another digit. That is, no two adjacent characters have the same
leetcode
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 left to right read nums[i] and index[i], insert at index index[i] the value nums[i] in target array. * Repeat the previous step
leetcode
Design a stack which supports the following operations. Implement the CustomStack class: * CustomStack(int maxSize) Initializes the object with maxSize which is the maximum number of elements in the stack or do nothing if the stack reached the maxSize. * void push(int x) Adds x to the top of the
leetcode
Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times. The returned string must contain only lowercase English letters. If there are multiples valid strings, return any of them. Example 1: Input: n = 4 Output: "pppz&
leetcode
Given a string s. You should re-order the string using the following algorithm: 1. Pick the smallest character from s and append it to the result. 2. Pick the smallest character from s which is greater than the last appended character to the result and append it. 3. Repeat step