leetcode - The Poor Coder | Algorithm Solutions (Page 4)

leetcode

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

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

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

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

leetcode

Leetcode - Decrypt String from Alphabet to Integer Mapping Solution

Given a string s formed by digits ('0' - '9') and '#' . We want to map s to English lowercase characters as follows: * Characters ('a' to 'i') are represented by ('1' to '9') respectively. * Characters ('j&

leetcode

Leetcode - Find N Unique Integers Sum up to Zero Solution

Given an integer n, return any array containing n unique integers such that they add up to 0. Example 1: Input: n = 5 Output: [-7,-1,1,3,4] Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4]. Example 2: Input: n = 3

leetcode

Leetcode - Replace Elements with Greatest Element on Right Side Solution

Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1. After doing so, return the array. Example 1: Input: arr = [17,18,5,4,6,1] Output: [18,6,6,6,1,-1]

leetcode

Leetcode - Find Numbers with Even Number of Digits Solution

Given an array nums of integers, return how many of them contain an even number of digits. Example 1: Input: nums = [12,345,2,6,7896] Output: 2 Explanation: 12 contains 2 digits (even number of digits). 345 contains 3 digits (odd number of digits). 2 contains 1 digit (odd

leetcode

Leetcode - Group the People Given the Group Size They Belong To Solution

There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to n - 1. You are given an integer array groupSizes, where groupSizes[i] is the size of the group that person i is in. For example,

leetcode

Leetcode - Subtract the Product and Sum of Digits of an Integer Solution

Given an integer number n, return the difference between the product of its digits and the sum of its digits. Example 1: Input: n = 234 Output: 15 Explanation: Product of digits = 2 * 3 * 4 = 24 Sum of digits = 2 + 3 + 4 = 9 Result = 24 - 9 = 15 Example 2: Input:

leetcode

Leetcode - Remove Sub-Folders from the Filesystem Solution

Given a list of folders, remove all sub-folders in those folders and return in any order the folders after removing. If a folder[i] is located within another folder[j], it is called a sub-folder of it. The format of a path is one or more concatenated strings of the

leetcode

Leetcode - Split a String in Balanced Strings Solution

Balanced strings are those that have an equal quantity of 'L' and 'R' characters. Given a balanced string s, split it in the maximum amount of balanced strings. Return the maximum amount of split balanced strings. Example 1: Input: s = "RLRRLLRLRL" Output: 4 Explanation: