925. Long Pressed Name
1237. Find Positive Integer Solution for a Given Equation
1237. Find Positive Integer Solution for a Given Equation
Description
Given a callable function f(x, y)
with a hidden formula and a value z
, reverse engineer the formula and return all positive integer pairs x
and y
where f(x,y) == z
. You may return the pairs in any order.
2422. Merge Operations to Turn Array Into a Palindrome
2422. Merge Operations to Turn Array Into a Palindrome
Description
You are given an array nums
consisting of positive integers.
452. Minimum Number of Arrows to Burst Balloons
452. Minimum Number of Arrows to Burst Balloons
Description
There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points
where points[i] = [xstart, xend] denotes a balloon whose horizontal diameter stretches between xstart and xend. You do not know the exact y-coordinates of the balloons.
2673. Make Costs of Paths Equal in a Binary Tree
2673. Make Costs of Paths Equal in a Binary Tree
Description
You are given an integer n
representing the number of nodes in a perfect binary tree consisting of nodes numbered from 1
to n
. The root of the tree is node 1
and each node i
in the tree has two children where the left child is the node 2 * i
and the right child is 2 * i + 1
.
733. Flood Fill
166. Fraction to Recurring Decimal
166. Fraction to Recurring Decimal
Description
Given two integers representing the numerator
and denominator
of a fraction, return the fraction in string format.