## Euler’s Totient Function

Euler’s Totient function Φ (n) for an input n is the count of numbers in {1, 2, 3, …, n} that are relatively prime to… Read More »

## Legendre’s formula (Given p and n, find the largest x such that p^x divides n!)

Given an integer n and a prime number p, find the largest x such that px (p raised to power x) divides n! (factorial) Examples:… Read More »

## Interview experience at “Infinera Bangalore India”

Interview process took 3 to 4 hours and it was done. It was good interview. It was on Java, Data structures and algorithm. 1st round… Read More »

## MakeMyTrip Interview Questions | Set 6

Please refer to the following questions being asked at Make My Trip. 1. Write a program to calculate the value of 7n/9 without using multiplication… Read More »

## Python Program for Extended Euclidean algorithms

filter_none edit close play_arrow link brightness_4 code # Python program to demonstrate working of extended  # Euclidean Algorithm        # function for extended Euclidean Algorithm … Read More »

## Java Program for Extended Euclidean algorithms

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

## C Program for Extended Euclidean algorithms

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

## Python Program for Basic Euclidean algorithms

filter_none edit close play_arrow link brightness_4 code # Python program to demonstrate Basic Euclidean Algorithm       # Function to return gcd of a and… Read More »

## Java Program for Basic Euclidean algorithms

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

## C Program for Basic Euclidean algorithms

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

## Euclidean algorithms (Basic and Extended)

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

## How to efficiently sort a big list dates in 20’s

Given a big list of dates in ’20s, how to efficiently sort the list. Example:  Input: Date arr[] = {{20, 1, 2014}, {25, 3, 2010}, {… Read More »

## Data Link Layer in OSI Model

Below are some common GATE CS topics of data link layer. Carrier Sense Multiple Access (CSMA) Carrier Sense Multiple Access or CSMA method was developed… Read More »

## Snapdeal Interview Experience | Set 14 (On-Campus for Software Engineer 1)

Hi, Recently i was interviewed for Snapdeal Software engineer 1 Position in my college campus. Round 1: Online 1) Check whether two given lines intersect… Read More »

## Data Structure for a single resource reservations

Design a data structure to do reservations of future jobs on a single machine under following constraints. 1) Every job requires exactly k time units… Read More »