Diameter of a Binary Tree in O(n) [A new method]
The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two… Read More »
The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two… Read More »
Round 1 : Online round via hirepro Round 1 (90 mins): 4 Sections. Section 1: Time : 15 mins. 10 MCQ’s , Aptitude Section Aptitude… Read More »
VMware conducted first round via hirepro Round 1 (90 mins): There were 4 sections .Section 1 had 10 Aptitude questions ( Boats & Streams, Profit… Read More »
The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The… Read More »
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Inputs: 1->2->3->4->5->6->7->8->NULL and k… Read More »
Given k sorted linked lists each of size n, merge them and print the sorted output. Examples: Input: k = 3, n = 4 list1… Read More »
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »
Vmware conducted their online exam via hirepro. Round 1 : There were 3 sections quants, Technical questions and OOPs based questions, no section had negative… Read More »
VMware visited our campus to hire new graduates for their Propel Program. The CGPA cutoff was 7. Round 1 Online MCQ round. This had 3… Read More »
Round 1: Online Multiple Choice Questions It comprised of two sections. First section consisted around 15-20 questions related to logical reasoning (Quantitative – Easy-medium-level) and… Read More »
VMWare visited an extension centre of our campus for hiring IT App Developer. Round 1 The first round a written one, conducted on HirePro platform.… Read More »
Round 1: ONLINE OBJECTIVE ROUND on HIREPRO platform This round comprised of 30 objective difficult and lengthy paragraph based aptitude questions to be solved in… Read More »
Given a number x, determine whether the given number is Armstrong number or not. A positive integer of n digits is called an Armstrong number… Read More »
Given a set of strings, find the longest common prefix. Input : {“geeksforgeeks”, “geeks”, “geek”, “geezer”} Output : “gee” Input : {“apple”, “ape”, “april”} Output… Read More »