tatsuyax25

/**
 * @param {number} n
 * @param {number} k
 * @param {number} maxPts
 * @return {number}
 */
var new21Game = function(n, k, maxPts) {
    // Edge case: if k == 0, Alice doesn't draw any cards, so score is 0 (always < n)
    // Or if n >= k + maxPts, Alice can reach any score < n with certainty
    if (k === 0 || n >= k + maxPts) return 1;

tatsuyax25

/**
 * @param {number} num
 * @return {number}
 */
var maximum69Number  = function(num) {
    // Convert the number into an array of digits
    const digits = num.toString().split('');

    let maxNum = num;

tatsuyax25

/**
 * @param {number} n
 * @return {boolean}
 */
var isPowerOfFour = function(n) {
    // Powers of four must be positive
    if (n <= 0) return false;

    // Check if n is a power of two: only one bit is set
    if ((n & (n - 1)) !== 0) return false;

tatsuyax25

/**
 * @param {string} num
 * @return {string}
 */
var largestGoodInteger = function(num) {
    // Match all substrings of three identical digits using a regular expression
    const matches = num.match(/(\d)\1{2}/g);

    // If no matches are found, return an empty string
    if (!matches) return '';

tatsuyax25

/**
 * @param {number} n
 * @return {boolean}
 */
var isPowerOfThree = function(n) {
    // Powers of 3 are always positive (3^0 = 1, 3^1 = 3, etc.)
    if (n < 1) return false;

    // Keep dividing n by 3 as long it's it's divisible
    while (n % 3 === 0) {

tatsuyax25

/**
 * @param {number} n
 * @param {number} x
 * @return {number}
 */
var numberOfWays = function(n, x) {
    const MOD = 1e9 + 7;

    // Memoization cache: key = `${total},${current}`
    const memo = new Map();

tatsuyax25

/**
 * @param {number} n
 * @param {number[][]} queries
 * @return {number[]}
 */
var productQueries = function(n, queries) {
    const MOD = 1e9 + 7;

    // Step 1: Decompose n into powers of 2 using its binary representation
    const powers = [];

tatsuyax25

/**
 * @param {number} n
 * @return {boolean}
 */
var reorderedPowerOf2 = function(n) {
    // Convert the number to an array of digit characters
    const digits = n.toString().split('');

    // Helper function to generate all unique permutations of the digits
    function getPermutations(arr) {

tatsuyax25

/**
 * @param {number} n
 * @return {boolean}
 */
var isPowerOfTwo = function(n) {
    // Powers of two must be positive integers greater than zero
    if (n < 1) {
        return false;
    }

tatsuyax25

/**
 * @param {number} n
 * @return {number}
 */
var soupServings = function(n) {
    // Optimization: for large n, the probability approaches 1
    if (n >= 4800) return 1.0;

    // Convert mL to units of 25 mL to reduce state space
    const N = Math.ceil(n / 25);