Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is: (A) 0, 1, 3, 7, 15,… Read More

All Medium Articles

In the LU decomposition of the matrix | 2 2 | | 4 9 | , if the diagonal elements of U are both 1,… Read More

Interplanetary trade: Hober Mallow wants to setup an inter-galactic trade which would allow trade between different planets. Each planet has its own set of currencies… Read More

Didn’t you buy _________ when you went shopping? (A) any paper (B) much paper (C) no paper (D) a few paper Answer: (A) Explanation: In… Read More

Predict the output of the following simple C++ program without any virtual function. #include <iostream> using namespace std; class Base { public: void print()… Read More

A complete binary tree is a binary tree whose all levels except the last level are completely filled and all the leaves in the last… Read More

Given a matrix where every row is sorted in increasing order. Write a function that finds and returns a common element in all rows. If… Read More

The memcpy function is used to copy a block of data from a source address to a destination address. Below is its prototype. void *… Read More

Given a positive integer n, find the period in decimal value of 1/n. Period in decimal value is number of digits (somewhere after decimal point)… Read More

I have recently attended Flipkart for SDE 1 @ Bangalore. Thanks to GeeksforGeeks team which has been the only single source of my preparation and… Read More

For Microsoft Bangalore CRM team. Experience: 1.7 years. Round 1:(Written test) Question 1 : Given a binary search tree . Print its level order traversal… Read More

I was interviewed for SDE – II position @ Flipkart. Below is my experience. Round 1 : Telephonic Round (around 90 minutes) He started with… Read More

I had my onsite rounds with Microsoft. There were 4 interviews. Round 1. Given a circular buffer, write Get( ) and Post( ) methods .… Read More

Consider a 3 game tournament between two teams. Assume that every game results in either a win or loss. The team that wins two or… Read More

Given a number n, create an array of size 2n such that the array contains 2 instances of every number from 1 to n, and… Read More

Given N jobs where every job is represented by following three elements of it. Start Time Finish Time Profit or Value Associated (>= 0) Find… Read More

I recently sat in on-campus interview for MAQ Software. The whole interview process comprised of the following rounds. Round 1: It comprised of general aptitude… Read More

I was interviewed recently and got through Oracle ST. I can’t remember many questions but I will try to tell as much as I can.… Read More

There were total 3 rounds. First Round: It was online coding round, conducted through hackerrank. There were total 6 questions, in which every type of… Read More

Given a directed graph, a source vertex ‘s’ and a destination vertex ‘d’, print all paths from given ‘s’ to ‘d’. Consider the following directed graph.… Read More