Brocade

15 posts

Last Updated: 06 December 2023

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

Brocade

Interview Preparation

Recruitment Process

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

Last Updated: 17 August 2023

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples:Input: head1: 5->7->9 ...read more

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

Last Updated: 11 January 2022

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples:Input: head1: 5->7->9 ...read more

Similar Topics

DSA

21.9k+ articles

Amazon

1.7k+ articles

Linked List

1.1k+ articles

Microsoft

730+ articles

Accolite

290+ articles

Samsung

290+ articles

Oracle

290+ articles

Flipkart

210+ articles

Synopsys

32+ articles

Belzabar

20+ articles

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

Last Updated: 11 January 2022

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples:Input: head1: 5->7->9 ...read more

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

Last Updated: 14 January 2022

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples:Input: head1: 5-7-9 h ...read more

Merge two sorted arrays using Priority queue

Last Updated: 18 October 2022

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

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

Last Updated: 02 December 2022

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

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

Last Updated: 18 September 2023

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

Merge two sorted lists (in-place)

Last Updated: 21 April 2024

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples:Input : head1: 5-7-9 ...read more

Merge two sorted arrays with O(1) extra space

Last Updated: 20 April 2024

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 ar...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 pret ...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 Tec ...read more

Interview Experiences

Brocade

Experiences

Merge two sorted linked lists

Last Updated: 04 March 2024

Given 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 he...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 th...read more

Count set bits in an integer

Last Updated: 11 April 2023

Write an efficient program to count the number of 1s in the binary representation of an integer.Examples :Input : n = 6Output : 2Binary repr...read more