## Microsoft Interview Experience | Set 138 (Off-Campus)

Hi all, I recently gave an interview at microsoft for a particular team. I got this opportunity via referal. There were around 30 people who… Read More »

## Juniper Interview Experience | Set 3 (On-Campus)

Round 1 It was an online test of 90 mins duration. It consisted 35 aptitude and technical Multiple choice Quizzes and 3 Coding Questions. All… Read More »

## Target Corporation Interview Experience | Set 5

Round 1: In 1st round there was 11 questions 10 was objective and 1 coding question (given an expression string in prefix form and u… Read More »

## Python Program for Range sum queries without updates

Given an array arr of integers of size n. We need to compute sum of elements from index i to index j. The queries consisting… Read More »

## Java Program for Range sum queries without updates

Given an array arr of integers of size n. We need to compute sum of elements from index i to index j. The queries consisting… Read More »

## C++ Program for Range sum queries without updates

Given an array arr of integers of size n. We need to compute sum of elements from index i to index j. The queries consisting… Read More »

## Range sum queries without updates

Given an array arr of integers of size n. We need to compute sum of elements from index i to index j. The queries consisting… Read More »

## Amazon Interview Experience | Set 403 (On Campus for Full Time)

Codding round (90 min): 20 objectives from DS, OS, DBMS, Networking and 2 coding questions: https://www.hackerrank.com/contests/dakshonline/challenges/yule-ball https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/i-demand-trial-by-combat-13/ ROUND I: Given a binary string (e.g. 01,… Read More »

## Minimum bitwise operations to convert given a into b.

Given two positive integer a and b you have to change a to b by applying any of the three operations on binary form of… Read More »

## Output of C++ programs | Set 48 (Bit Manipulation)

Q.1 What Is The Output Of this program ? filter_none edit close play_arrow link brightness_4 code #include <iostream> using namespace std; int main() {     int… Read More »

## Differences between Flatten() and Ravel() | Numpy

We have two similar kind of ways to convert a ndarray to 1D array : Flatten() and Ravel() import numpy as np a = np.array(… Read More »

## DFS for a n-ary tree (acyclic graph) represented as adjacency list

A tree consisting of n nodes is given, we need to print its DFS. Examples : Input : Edges of graph 1 2 1 3… Read More »

## Mathematics | Introduction to Propositional Logic | Set 2

Prerequisite : Introduction to Propositional Logic – Set 1 De Morgan’s Law : In propositional logic and boolean algebra, De Morgan’s laws are a pair… Read More »

## SQL | SUB Queries

In SQL a Subquery can be simply defined as a query within another query. In other words we can say that a Subquery is a… Read More »

## Minimum flips required to maximize a number with k set bits

Given two numbers n and k, we need to find the minimum number of flips required to maximize given number by flipping its bits such… Read More »