• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Euclid's Algorithm

Introduction To Number Theory ( Part 1 )

December 27, 2017 by Dhaval Dave

Number Theory is used a lot for solving real world problems and for the same reason It’s asked most of the time in interviews. This article marks the beginning of series of articles over Number … Read More

Filed Under: Algorithm, Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions Tagged With: Euclid's Algorithm, Modular Exponentiation, Number Theory

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Printing intermediate Integers between one element & next element of array

Binary Tree in Java

LeetCode: Binary Tree Maximum Path Sum

Flipkart Set 1 On Campus with Answers

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Find min element in Sorted Rotated Array (Without Duplicates)

Diagonal Traversal of Binary Tree

Code Chef PRGIFT Solution

Level order traversal in Spiral form

Mirror of Tree

HackeEarth Flipkart’s Drone

Trie Dictionary

VMWare Openings

SAP Interview Questions

Check if an array has duplicate numbers in O(n) time and O(1) space

Serialise Deserialise N-ary Tree

Stickler thief

Practo Hiring Experience

Subset Sum Problem Dynamic programming

Apriori algorithm C Code Data Mining

Adobe Interview Questions 8 month Exp

CodeChef Code SGARDEN

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Word Break Problem

DFS (Depth First Search)

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Maximum sum contiguous subarray of an Array

Maximum size of square sub matrix with all 1’s in a binary matrix

How Radix sort works

Find Nearest Minimum number in left side in O(n)

Copyright © 2026 · Genesis Framework · WordPress · Log in