Skip to content

Tag Archives: Brocade

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: 4->5->6->7->8->9… 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: 4->5->6->7->8->9… 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: 4->5->6->7->8->9… 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: 4->5->6->7->8->9… Read More
Given two sorted arrays A[] and B[] of sizes N and M respectively, the task is to merge them in a sorted manner. Examples: Input:… Read More
Given two sorted arrays, we need to merge them in O((n+m)*log(n+m)) time with O(1) extra space into a sorted array, when n is the size… 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… Read More
  Given two sorted arrays, the task is to merge them in a sorted manner.Examples:  Input: arr1[] = { 1, 3, 4, 5}, arr2[] =… Read More
We are given two sorted arrays. We need to merge these two arrays such that the initial numbers (after complete sorting) are in the first… Read More
I attended interview at Brocade for the post of Software Engineer (0-2.5 years experience). Some 200+ people had walked-in and it was a pretty large… Read More
Recently I attended Brocade Communications Interview. I would like to share my experiences. First Round: Written round 15 Aptitude + 25 Technical MCQs (c++ (mainly… Read More
AuxiliaryGiven two sorted linked lists consisting of N and M nodes respectively. The task is to merge both of the lists (in place) and return the… Read More
There are two sorted arrays. First one is of size m+n containing only m elements. Another one is of size n and contains n elements.… Read More
  Write an efficient program to count the number of 1s in the binary representation of an integer.Examples :  Input : n = 6Output :… Read More

Start Your Coding Journey Now!