Sum of k-Mirror Numbers A k-mirror number is a positive integer without leading zeros that reads the same both forward and backward in base-10 as well as in base-k. For example, 9 is a 2-mirror ...

Divide a String Into Groups of Size k A string s can be partitioned into groups of size k using the following procedure: The first group consists of the first k characters of the string, the sec...

Minimum Deletions to Make String K-Special You are given a string word and an integer k. We consider word to be k-special if freq(word[i]) - freq(word[j]) <= k for ...

Maximum Manhattan Distance After K Changes You are given a string s consisting of the characters ‘N’, ‘S’, ‘E’, and ‘W’, where s[i] indicates movements in an infinite grid: 'N' : Move north by 1...

Partition Array Such That Maximum Difference Is K You are given an integer array nums and an integer k. You may partition nums into one or more subsequences such that each element in nums appears...

Divide Array Into Arrays With Max Difference You are given an integer array nums of size n where n is a multiple of 3 and a positive integer k. Divide the array nums into n / 3 arrays of size 3 ...

Maximum Difference Between Increasing Elements 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 <=...

Max Difference You Can Get From Changing an Integer You are given an integer num. You will apply the following steps to num two separate times: Pick a digit x (0 <= x <= 9). Pick another d...

Maximum Difference by Remapping a Digit You are given an integer num. You know that Bob will sneakily remap one of the 10 possible digits (0 to 9) to another digit. Return *the difference betwee...

Minimize the Maximum Difference of Pairs You are given a 0-indexed integer array nums and an integer p. Find p pairs of indices of nums such that the maximum difference amongst all the pairs is m...