## proto van Emde Boas Trees | Set 1 (Background and Introduction)

Let us consider the below problem statement and think of different solutions for it. Given a set S of elements such that the elements are… Read More »

## Morgan Stanley Interview | Set 24 (On-Campus for Internship)

Recently Morgan Stanley visited our campus for internship. Here is my experience. Round 1 (Coding and Aptitude- Online Test 75 minutes): 19 MCQ on C++,… Read More »

## ChainMap in Python

Python contains a container called “ChainMap” which encapsulates many dictionaries into one unit. ChainMap is member of module “collections“. Example: filter_none edit close play_arrow link… Read More »

## Remove Invalid Parentheses

An expression will be given which can contain open and close parentheses and optionally some characters, No other operator will be there in string. We… Read More »

## Flip Binary Tree

Given a binary tree, the task is to flip the binary tree towards right direction that is clockwise. See below examples to see the transformation.… Read More »

## Implement a Phone Directory

Given a list of contacts which exist in a phone directory. The task is to implement search query for the phone directory. The search query… Read More »

## Tolexo Interview Experience | Set 3 (For Senior Software Developer)

First of all, there is a 70%/7.5 cgpa above eligibility criteria in Tolexo. After this there is one aptitude test and 2 technical interviews +… Read More »

## Finding sum of digits of a number until sum becomes single digit

Given a number n, we need to find the sum of its digits such that: If n < 10 digSum(n) = n Else digSum(n) =… Read More »

## Kuliza Interview Experience | Set 4 (On-Campus)

Recently kuliza technology conducted interview at NIT campus . The company did not come to campus , they took interview through skype and hangouts .… Read More »

## Find all reachable nodes from every node present in a given set

Given an undirected graph and a set of vertices, find all reachable nodes from every vertex present in the given set. Consider below undirected graph… Read More »

## Execution of printf with ++ operators

Consider below C++ program and predict its output. filter_none edit close play_arrow link brightness_4 code printf(“%d %d %d”, i, ++i, i++); chevron_right filter_none The above… Read More »

## Pairs of complete strings in two sets of strings

Two strings are said to be complete if on concatenation, they contain all the 26 English alphabets. For example, “abcdefghi” and “jklmnopqrstuvwxyz” are complete as… Read More »

## Contributing to Open Source : Getting Started

Open-source software is software that is freely available to use, redistribute, and modify. Open source software is already integrated into our daily lives, even more if… Read More »

## Vigenère Cipher

Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form of polyalphabetic substitution. A polyalphabetic cipher is any cipher based on… Read More »

## Count all increasing subsequences

We are given an array of digits (values lie in range from 0 to 9). The task is to count all the sub sequences possible… Read More »