Brocade

15 posts

Last Updated: 23 July 2025

This article will give you information about the company, its recruitment process, sample questions that have been asked previously, lots of experiences shared by other as...read more

Interview Experiences

Brocade

C++ Program To Merge Two Sorted Lists (In-Place)

Last Updated: 23 July 2025

Write a C++ program to merge two sorted linked lists into a single sorted linked list in place (i.e. without using extra space).Examples:Input: List1: 5 - 7 - 9, list2: 4 ...read more

Java Program To Merge Two Sorted Lists (In-Place)

Last Updated: 23 July 2025

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...read more

Python Program To Merge Two Sorted Lists (In-Place)

Last Updated: 23 July 2025

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...read more

Javascript Program To Merge Two Sorted Lists (In-Place)

Last Updated: 23 July 2025

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

Merge two sorted arrays using Priority queue

Last Updated: 23 July 2025

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: A[] = { 5, 6, 8 }, B[] = { 4, 7, 8 }Output:...read more

Merge two sorted arrays in O(1) extra space using QuickSort partition

Last Updated: 23 July 2025

Given two sorted arrays, arr[], brr[] of size N, and M, the task is to merge the two given arrays such that they form a sorted sequence of integers combining elements of b...read more

Efficiently merging two sorted arrays with O(1) extra space

Last Updated: 16 May 2024

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 of the first array, and m is the siz...read more

Merge two sorted lists (in-place)

Last Updated: 02 January 2025

Given two sorted linked lists consisting of n and mnodes respectively. The task is to merge both of the lists and return the head of the merged list.Example:Input: Output...read more

Merge Two Sorted Arrays Without Extra Space

Last Updated: 05 August 2025

Given two sorted arrays a[] and b[] of size n and m respectively, merge both the arrays and rearrange the elements such that the smallest n elements are in a[] and the rem...read more

Brocade Interview Experience | Set 2 (For Software Engineer 0-2.5 Years Experience)

Last Updated: 29 November 2015

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 gathering. Though loca...read more

Interview Experiences

Brocade

Experiences

Brocade Interview Experience

Last Updated: 14 December 2014

Recently I attended Brocade Communications Interview. I would like to share my experiences.First Round: Written round 15 Aptitude + 25 Technical MCQs (c++ (mainly output...read more

Interview Experiences

Brocade

Experiences

Merge two sorted linked lists

Last Updated: 30 August 2025

Given the heads of two sorted linked lists, merge them into a single sorted linked list and return the head of the merged list.Examples:Input: Output: 2 - 3 - 5 - 10 - 15...read more

Merge an array of size n into another array of size m+n

Last Updated: 13 July 2023

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. Merge these two arrays into the first a...read more

Count set bits in an integer

Last Updated: 01 October 2025

Given a positive number n count the set bit . Examples :Input : n = 6Output : 2Binary representation of 6 is 110 and has 2 set bitsInput : n = 13Output : 3Binary represent...read more