## Circular array

An array is called circular if we consider first element as next of last element. Circular arrays are used to implement queue (Refer this and… Read More »

Featured Article

An array is called circular if we consider first element as next of last element. Circular arrays are used to implement queue (Refer this and… Read More »

Featured Article

We have briefly discussed sparse table in Range Minimum Query (Square Root Decomposition and Sparse Table) Sparse table concept is used for fast queries on… Read More »

Featured Article

A prime number is a whole number greater than 1, which is only divisible by 1 and itself. First few prime numbers are : 2… Read More »

Cache is a very important part of the computer hardware to give superfast response time. Cache Performance When the processor needs to read or write… Read More »

Given an array of n elements. Find maximum sum of pairwise multiplications. Sum can be larger so take mod with 10^9+7. If there are odd… Read More »

Given a rational number d, print the reduced fraction which gives d. Examples: Input : d = 2.5 Output : 5/2 Explanation: 5/2 gives 2.5… Read More »

The Android software stack generally consists of a Linux kernel and a collection of C/C++ libraries that is exposed through an application framework that provides… Read More »

The purpose of zip() is to map the similar index of multiple containers so that they can be used just using as single entity. Syntax… Read More »

Round 1 (2.5 hours) : First round was an aptitude test on AMCAT, consisting of verbal, quantative, logical reasoning and MCQs on data structures and… Read More »

Imagine if you give all of your time in building amazing apps and then deploying them without giving any of your time in managing servers.… Read More »

Given an array A of n integers, say A1, A2, A3, …, An. You are given Q queries of the form [l, r]. The task… Read More »

Many inbuilt functions in C++ return the pointers to the position in memory which gives an address of desired number, but has no relation with… Read More »

Given a positive integer ‘n'( 1 <= n <= 1015). Find the largest prime factor of a number. Input: 6 Output: 3 Explanation Prime factor… Read More »

Round 1: Distance between two given nodes in a binary tree. I was asked to write the optimal approach for the this. http://www.geeksforgeeks.org/find-distance-between-two-nodes-of-a-binary-tree/ A group of… Read More »

Given a binary tree containing n nodes. The problem is to get the sum of all the leaf nodes which are at minimum level in… Read More »

Round 1 (90 Mins) : In total there were 10 questions (6 MCQ and 4 Coding questions). MCQ questions not very tough. Coding questions were… Read More »

Prerequisite: Loops and String Note: Output of all these programs is tested on Python3 1. What is the output of the following? None geeksforgeeks i… Read More »

Prerequisite – Full adder, Full Subtractor Parallel Adder – A single full adder performs the addition of two one bit numbers and an input carry.… Read More »