Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Review: GCD Problems

Posted on January 18, 2018July 26, 2020 by braindenny

gcd problems



  • CheatSheet: Leetcode For Code Interview
  • CheatSheet: Common Code Problems & Follow-ups

Bezout’s identity (also called Bezout’s lemma) is a theorem in the elementary theory of numbers:

let a and b be nonzero integers and let d be their greatest common divisor. Then there exist integers x
and y such that ax+by=d

In addition, the greatest common divisor d is the smallest positive integer that can be written as ax + by

every integer of the form ax + by is a multiple of the greatest common divisor d.
https://leetcode.com/problems/water-and-jug-problem/discuss/83715/Math-solution-Java-solution

See all gcd problems: #gcd

  • Review: GCD Problems
  • LeetCode: X of a Kind in a Deck of Cards
  • LeetCode: Water and Jug Problem
  • LeetCode: Max Points on a Line
  • LeetCode: Greatest Common Divisor of Strings
  • LeetCode: Fraction Addition and Subtraction
  • LeetCode: Check If It Is a Good Array

See more blog posts.

linkedin
github
slack

Post Views: 4
Posted in ReviewTagged gcd, review

Post navigation

LeetCode: Sum of Square Numbers
Review: Minimax Problems

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #blog #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum binarysearch editdistance hashmap intervaldp knapsack monotone oodesign presum rectangle redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • a
  • a
  • a
  • a
  • a

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.