• 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

Modular Exponentiation

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

Right view of Binary tree

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

Amazon Interview Experience – SDE Chennai

System Design: Designing a LLD for Hotel Booking

Print Power Set of a Set

Printing each word reverse in string

Flipkart Set 1 On Campus with Answers

Leetcode: Edit Distance

The greedy coins game Dynamic Programming

Find loop in Singly linked list

Trapping Rain Water

Generate next palindrome number

Print all nodes that are at distance k from a leaf node

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

DFS (Depth First Search)

Reliance Jio Software Developer Interview Experience

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

Find min element in Sorted Rotated Array (With Duplicates)

Difference between a LinkedList and a Binary Search Tree BST

Given a string, find the first character which is non-repetitive

Best Java Book | Top Java Programming Book for Beginners

Skiing on Mountains Matrix

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

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

Binary Tree Isomorphic to each other

Spanning Tree

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

Find the kth number with prime factors 3, 5 and 7

Find two non repeating elements in an array of repeating elements

Maximum path sum between two leaves

Copyright © 2025 · Genesis Framework · WordPress · Log in