Total Waviness of Numbers in Range I You are given two integers num1 and num2 representing an inclusive range [num1, num2]. The waviness of a number is defined as the total count of its peaks an...

Earliest Finish Time for Land and Water Rides II You are given two categories of theme park attractions: land rides and water rides. Land rides landStartTime[i] – the earliest time the ith lan...

Minimum Cost of Buying Candies With Discount A shop is selling candies at a discount. For every two candies sold, the shop gives a third candy for free. The customer can choose any candy to take...

Earliest Finish Time for Land and Water Rides I You are given two categories of theme park attractions: land rides and water rides. Land rides landStartTime[i] – the earliest time the ith land...

Destroying Asteroids You are given an integer mass, which represents the original mass of a planet. You are further given an integer array asteroids, where asteroids[i] is the mass of the ith ast...

Minimum Element After Replacement With Digit Sum You are given an integer array nums. You replace each element in nums with the sum of its digits. Return the minimum element in nums after all r...

Longest Common Suffix Queries You are given two arrays of strings wordsContainer and wordsQuery. For each wordsQuery[i], you need to find a string from wordsContainer that has the longest common...

Count the Number of Special Characters II You are given a string word. A letter c is called special if it appears both in lowercase and uppercase in word, and every lowercase occurrence of c appe...

Count the Number of Special Characters I You are given a string word. A letter is called special if it appears both in lowercase and uppercase in word. Return the number of* special letters in *...

Jump Game VII You are given a 0-indexed binary string s and two integers minJump and maxJump. In the beginning, you are standing at index 0, which is equal to ‘0’. You can move from index i to in...