Maximum Difference Between Adjacent Elements in a Circular Array Given a circular array nums, find the maximum absolute difference between adjacent elements. Note: In a circular array, the first...
Maximum Difference Between Even and Odd Frequency II You are given a string s and an integer k. Your task is to find the maximum difference between the frequency of two characters, freq[a] - freq...
Simplify Path You are given an absolute path for a Unix-style file system, which always begins with a slash ‘/’. Your task is to transform this absolute path into its simplified canonical path. ...
Maximum Difference Between Even and Odd Frequency I You are given a string s consisting of lowercase English letters. Your task is to find the maximum difference diff = a1 - a2 between the frequ...
Lexicographical Numbers Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order. You must write an algorithm that runs in O(n) time and uses O(1) extra spa...
Lexicographically Minimum String After Removing Stars You are given a string s. It may contain any number of ‘’ characters. Your task is to remove all ‘’ characters. While there is a ‘*’, do the...
Lexicographically Smallest Equivalent String You are given two strings of the same length s1 and s2 and a string baseStr. We say s1[i] and s2[i] are equivalent characters. For example, if s1 = ...
Find the Lexicographically Largest String From the Box I You are given a string word, and an integer numFriends. Alice is organizing a game for her numFriends friends. There are multiple rounds ...
Maximum Candies You Can Get from Boxes You have n boxes labeled from 0 to n - 1. You are given four arrays: status, candies, keys, and containedBoxes where: status[i] is 1 if the ith box is open...
Distribute Candies Among Children II You are given two positive integers n and limit. Return the total number of ways to distribute *n *candies among *3 children such that no child gets more tha...