Sign in Subscribe

Topic

leetcode

A collection of 131 issues

Leetcode - Display Table of Food Orders in a Restaurant Solution

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 - Reformat The String Solution

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 - Create Target Array in the Given Order Solution

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 With Increment Operation Solution

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 - Generate a String With Characters That Have Odd Counts Solution

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 - Increasing Decreasing String Solution

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

Leetcode - How Many Numbers Are Smaller Than the Current Number Solution

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i]. Return the answer

Leetcode - Number of Steps to Reduce a Number to Zero Solution

Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it. Example 1: Input: num = 14 Output: 6 Explanation: Step 1) 14 is even; divide

Leetcode - Maximum 69 Number Solution

Given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6). Example 1: Input: num = 9669 Output: 9969 Explanation: Changing the first digit results in 6669. Changing the second

Leetcode - Decompress Run-Length Encoded List Solution

We are given a list nums of integers representing a list compressed with run-length encoding. Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]] (with i >= 0). For each such pair, there are freq elements with value val concatenated in a sublist. Concatenate