Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Detect Recurring Division

MediumPython00:00
Practice interviewer
In session
5 left
00:00

Your question is Detect Recurring Division. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Goldman Sachs Asset & Wealth Management systems may need to display exact ratios without floating-point rounding. Given a numerator and denominator, return the fraction's canonical decimal representation, placing recurring digits inside parentheses.

Formal Specification

Implement fraction_to_decimal(numerator, denominator). Both arguments are integers, denominator is nonzero, and the result is a string. A terminating fraction must be returned normally, such as 0.5. A nonterminating recurring fraction must identify its repeating cycle, such as 0.(3) or 0.1(6). Preserve a leading minus sign for negative nonzero results, and do not use floating-point arithmetic.

The integer portion must be included. For example, 22 / 7 returns 3.(142857). The repeating portion is the first cycle produced by long division, not an arbitrary repeated substring.

Constraints

  • -10^9 <= numerator <= 10^9
  • 1 <= abs(denominator) <= 10^9
  • denominator != 0
  • The output may contain up to abs(denominator) fractional digits
  • Floating-point arithmetic is not allowed

Function Signature

def fraction_to_decimal(numerator, denominator):
Your solutionPython 3
You need to log in / sign up to run or submit.
Run your code to see test output