• 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

Max Sum in circularly situated Values

Python Dictionaries

Naurki.com Security Breach

ADOBE Aptitude C Language Test

BlueStone E-commerce Interview Experience

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

SAP Off Campus Hiring_ March 2015 Verbal Skills

System Design: Designing a LLD for Hotel Booking

Hackerearth : Counting Subarrays

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

Apriori algorithm C Code Data Mining

Best Java Book | Top Java Programming Book for Beginners

Test Cases for Round Function

Maximum path sum between two leaves

Leetcode: Merge Intervals

Flipkart SDET Interview Experience

Find the number ABCD such that when multipled by 4 gives DCBA.

Implement a generic binary search algorithm for Integer Double String etc

Binary Tree Isomorphic to each other

Advanced SQL Injection

Stock Buy Sell to Maximize Profit

Get Minimum element in O(1) from input numbers or Stack

BFS (Breath First Search)

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Add Sub Multiply very large number stored as string

Fibonacci Hashing & Fastest Hashtable

Leetcode: Edit Distance

Find min element in Sorted Rotated Array (Without Duplicates)

Generic Object Oriented Stack with Template

Implement LRU Cache

Copyright © 2026 · Genesis Framework · WordPress · Log in