You are given two integers low and high. Return the number of symmetric integers in the range [low, high]. A symmetric integer has an even number of digits, and the sum of the first half of its digits equals the sum of the second half. Numbers with an odd number of digits are never symmetric.
You are given a non-negative integer represented as a string num. In one operation, you can remove any single digit from the string. If you remove all digits, the result becomes 0. Your task is to return the minimum number of operations required to make the number divisible by 25. A number is divisible by 25 if it ends in 00, 25, 50, or 75.
You are given a starting position (sx, sy) and a target position (fx, fy) on an infinite 2D grid. You need to determine if it’s possible to reach the target in exactly t seconds, moving to any adjacent cell each second.
You are given a binary string s containing at least one ‘1’. Your task is to rearrange the bits in such a way that the resulting binary number is the largest possible odd binary number that can be formed from the given bits. A binary number is odd if its least significant bit (last bit) is ‘1’. The resulting binary number may contain leading zeros.
You are given two positive integers, n and m. Calculate the difference between the sum of integers in the range [1, n] that are not divisible by m (num1) and the sum of integers in the range [1, n] that are divisible by m (num2). Return the result of num1 - num2.
You are given two positive integers, ’n’ (number of candies) and ’limit’ (maximum number of candies each child can receive). Your task is to calculate how many different ways you can distribute ’n’ candies among 3 children such that no child receives more than ’limit’ candies.