Maximum 69 Number You are given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by changing at most one digit (6* becomes 9, and 9 becomes 6)*.  ...

Power of Four Given an integer n, return true if it is a power of four. Otherwise, return false. An integer n is a power of four, if there exists an integer x such that n == 4x.   Example 1: ...

Power of Three Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there exists an integer x such that n == 3x.   Example 1...

Ways to Express an Integer as Sum of Powers Given two positive integers n and x. Return the number of ways *n can be expressed as the sum of the xth power of unique positive integers, in other w...

Range Product Queries of Powers Given a positive integer n, there exists a 0-indexed array called powers, composed of the minimum number of powers of 2 that sum to n. The array is sorted in non-d...

Reordered Power of 2 You are given an integer n. We reorder the digits in any order (including the original order) such that the leading digit is not zero. Return true if and only if we can do t...

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, if there exists an integer x such that n == 2x.   Example 1: **...

Soup Servings You have two soups, A and B, each starting with n mL. On every turn, one of the following four serving operations is chosen at random, each with probability 0.25 independent of all ...

Soup Servings You have two soups, A and B, each starting with n mL. On every turn, one of the following four serving operations is chosen at random, each with probability 0.25 independent of all ...

Find the Maximum Number of Fruits Collected There is a game dungeon comprised of n x n rooms arranged in a grid. You are given a 2D array fruits of size n x n, where fruits[i][j] represents the ...