## Merge two sorted lists (in-place)

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space). Examples: Input : head1: 5->7->9 head2: 4->6->8… Read More »

## Median of Stream of Running Integers using STL

Given that integers are being read from a data stream. Find median of all the elements read so far starting from the first integer till… Read More »

## Belzabar Software Interview Experience | Set 5 (Off-Campus for Software Developer)

I applied in Belzabar off-campus, and got a chance to be interviewed by them. There were total of 5 rounds. Online Coding Round: 1 hr… Read More »

## Belzabar Software Interview Experience | Set 4

I recently had interview at Belzabar. After aptitude round only 69 students were shortlisted out of 256. First Round(F2F): He started asking questions about data… Read More »

Given a snake and ladder board, find the minimum number of dice throws required to reach the destination or last cell from source or 1st… Read More »

## Belzabar Software Interview Experience

Belzabar recently visited our campus to hire full time employees. About 120 students gave the first round, 50 made it to the next round and… Read More »

## Belzabar interview experience for Computer Scientist

First round was a written round. second round was a written coding round. third was a technical personal interview round. fourth and fifth were HR… Read More »

## Belzabar Interview Computer Scientist Internship

Belzabar Software Design & Development recently visited our Campus, as a regular offering Computer Scientist Internships to 2-3 students of the college from CS/IT Engineering… Read More »

## HeapSort

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the… Read More »

## Median in a stream of integers (running integers)

Given that integers are read from a data stream. Find median of elements read so for in efficient way. For simplicity assume there are no… Read More »

## Merge two sorted linked lists

Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which… Read More »

## How to determine if a binary tree is height-balanced?

A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of “much farther”… Read More »

## Convert a Binary Tree into its Mirror Tree

Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.… Read More »