Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Get started
Compute GCD With Tests
00:00
5 left

Compute GCD With Tests

HardPython

Problem

HackerEarth assessment inputs may contain integers larger than Python's native integer limits in restricted environments. Given two signed integers as decimal strings, compute their greatest common divisor without converting either entire input to a built-in integer.

Use Euclid's algorithm, where gcd(a, b) = gcd(b, a mod b), and implement decimal remainder arithmetic on strings.

Formal Specification

Implement gcd_huge(a, b).

  • Input: Two strings a and b, each representing a signed base-10 integer.
  • Output: A string representing the non-negative greatest common divisor.
  • Leading zeroes may appear in either input. If both values are zero, return "0".

Constraints

  • 1 <= len(a), len(b) <= 100000
  • Each input contains an optional leading '+' or '-' followed by decimal digits
  • At least one digit follows any sign
  • Do not convert the complete input strings to built-in integers
  • Return a canonical non-negative decimal string

Function Signature

def gcd_huge(a, b):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.