• 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

Number Theory

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

C++ OOPs Part1

Number of Islands BFS/DFS

CodeChef’ RRCOPY

C Program for TAIL command of UNIX

Serialise Deserialise N-ary Tree

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Reliance Jio Software Developer Interview Experience

Naurki.com Security Breach

DFS (Depth First Search)

SAP Off Campus Hiring_ March 2015 Sample Questions

Count Possible Decodings of a given Digit Sequence

Advanced SQL Injection

Cisco Hiring Event 21st – 22nd Feb 2015

Leetcode: Edit Distance

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

BFS (Breath First Search)

Edit Distance ( Dynamic Programming )

Walmart Labs Interview Experience

Adobe Interview Questions 8 month Exp

Add Sub Multiply very large number stored as string

flattens 2 D linked list to a single sorted link list

Common Ancestor in a Binary Tree or Binary Search Tree

Facebook Interview Question : Interleave List

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

SAP Interview Questions

Apriori algorithm C Code Data Mining

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 ?

Given a sorted array and a number x, find the pair in array whose sum is closest to x

How Radix sort works

Skiing on Mountains Matrix

Copyright © 2026 · Genesis Framework · WordPress · Log in