Skip to content
All Medium Articles
Given a number ‘n’ and a prime ‘p’, find square root of n under modulo p if it exists. It may be given that p… Read More
Coding Round : 1. https://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/ 2. Do not remember second question but it was on binary tree. Group-fly round : Remove repeating charaters from a… Read More
1) Written Test on Unix Shell Scripting 1. write a script/command to find files older than 7days and zip them and move to specific folder.… Read More
Round 1: 1.Quantative (16 ques in 16 min) 2.Reasoning(14 in 14 min). 3.English(18 in 16 min). 4.Coding(2 question in 45 min). (I)Print pattern(for N=4) 1… Read More
Round 2: Paper written coding 1) Given an unsorted array with a group of characters taken from the user. Find the first occurrence of non… Read More
1. Written Round : 1) 30 Aptitude questions(30 min). 2) 2-Coding questions(30 min). 2-a) Write an algorithm for dutch national flag problem 2-b) Write an… Read More
Idea: Managing usage time of various apps/sites/softwares (by beep alerts and mail). Introduction ATLAS, coded in python, enables users to set maximum and minimum usage… Read More
Many people are very afraid of behavioural interview questions in technical interviews as they seem to be just something most programmers are not good at.… Read More
Geeksforgeeks has helped me a lot. In order to help other students I would like to share my experience. Step 1: I applied through a… Read More
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If an array is already sorted then the… Read More
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count… Read More
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks. The first network can carry a maximum payload of… Read More
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability p = 0.2 in every slot.… Read More
Given a large number n and a prime p, how to efficiently compute n! % p?Examples :   Input: n = 5, p = 13 Output:… Read More
I was interviewed on-campus for Software Development Engineering (SDE1) role Flipkart. Coding round: (90 minutes) Coding round was done on hackerrank . Given two numbers… Read More
In this post “Important top 10 algorithms and data structures for competitive coding “. Topics : Graph algorithms Dynamic programming Searching and Sorting: Number theory… Read More
Mira and Ram can do a piece of work in 6 and 9 days respectively; If they work on alternate days starting with Mira on the first day.… Read More
What is rank of a matrix? Rank of a matrix A of size M x N is defined as (a) Maximum number of linearly independent column vectors… Read More
Given a number n, check if it is prime or not. We have introduced and discussed School and Fermat methods for primality testing.Primality Test |… Read More
GeeksOfGeeks has helped me a lot, so, thought of making a little contribution from my side. Amazon Interview for Position SDE II Round 1: The… Read More