Skip to content

Tag Archives: Belzabar

Profile: Sr. Computer scientist (3.4 years Experienced ) , frontend JS developer There were 4 rounds of interview: Round 1: It was a written round… Read More
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 Output… Read More
Given that integers are being read from a data stream. Find the median of all the elements read so far starting from the first integer… Read More
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
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 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
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 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
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 minimum… Read More
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
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