Fraction to Recurring Decimal Problem

Fraction to Recurring Decimal Problem — ExecCode Medium DSA Practice

Solve the Fraction to Recurring Decimal problem on ExecCode. Free online medium DSA practice in Math. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating, enclose the repeating part in parentheses If multiple answers are possible, return any of them. It is guaranteed that the length of the answer string is less than 10^4 for all the given inputs. Note that if the fraction can be represented as a finite length string, you must return it. Examples Example 1 Input: numerator = 1, denominator = 2 Output: "0.5" Example 2 Input: numerator = 2, denominator = 1 Output: "2" Example 3 Input: numerator = 4, denominator = 333 Output: "0.(012)" Constraints -2^31 <= numerator, denominator <= 2^31 - 1 denominator != 0

Examples

Input numerator = 1, denominator = 2; Output "0.5". Input numerator = 2, denominator = 1; Output "2". Input numerator = 4, denominator = 333; Output "0.(012)"

Constraints

-2^31 <= numerator, denominator <= 2^31 - 1 denominator != 0

Practice Fraction to Recurring Decimal free on ExecCode. Browse DSA problems, topic map, and placement guides.