Description https://leetcode.com/problems/maximum-69-number/ Given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by…

Description https://leetcode.com/problems/water-bottles/ Given numBottles full water bottles, you can exchange numExchange empty water bottles for one full water bottle. The operation of drinking a…

Description https://leetcode.com/problems/base-7/ Given an integer num, return a string of its base 7 representation. Example 1: Input: num = 100 Output: “202” Example 2:…

Description https://leetcode.com/problems/sum-of-digits-in-base-k/ Given an integer n (in base 10) and a base k, return the sum of the digits of n after converting n from base 10 to base k. After converting, each digit should…

Description https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/ Given two non-negative integers low and high. Return the count of odd numbers between low and high (inclusive). Example 1: Input: low = 3, high =…

Description https://leetcode.com/problems/valid-perfect-square/ Given a positive integer num, write a function which returns True if num is a perfect square else False. Follow up: Do not use any…

Description https://leetcode.com/problems/n-th-tribonacci-number/ The Tribonacci sequence Tn is defined as follows:  T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for…

Description https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/ Given an integer n. No-Zero integer is a positive integer which doesn’t contain any 0 in its decimal representation. Return a list…

Description https://leetcode.com/problems/distribute-candies/ Alice has n candies, where the ith candy is of type candyType[i]. Alice noticed that she started to gain weight, so she visited…

Description https://leetcode.com/problems/add-digits/ Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.…