LeetCode Question · Oct 2019 · Singapore

Google | OA Summer Intern 2020 | Greatest Common Divisor

SWE OA Intern

61 upvotes 28,460 views 22 replies

Question Details

Google Singapore OA Question Summer 2020 Internship Interview on CoCubes ### Question #1: GCD (Greatest Common Divisor) of two positive integers is the largest positive integer that divides both numbers without a remainder. Siblings: Nodes...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree Math

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Binary Tree Questions →