# LeetCode 29. Divide Two Integers

Description https://leetcode.com/problems/divide-two-integers/ Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor.…

# LeetCode 168. Excel Sheet Column Title

Description https://leetcode.com/problems/excel-sheet-column-title/ Given an integer columnNumber, return its corresponding column title as it appears in an Excel sheet. For example: A ->…

# LeetCode 231. Power of Two

Description https://leetcode.com/problems/power-of-two/ Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two,…

# LeetCode 1323. Maximum 69 Number

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…

# LeetCode 1518. Water Bottles

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…

# LeetCode 504. Base 7

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:…

# LeetCode 1837. Sum of Digits in Base K

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…

# LeetCode 1523. Count Odd Numbers in an Interval Range

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 =…

# LeetCode 367. Valid Perfect Square

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…

# LeetCode 1137. N-th Tribonacci Number

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…