Juniper Networks

20+ posts

Similar Topics

DSA

21k+ articles

Experiences

12k+ articles

Interview Experiences

11.1k+ articles

Arrays

6.4k+ articles

Sorting

1.7k+ articles

Linked List

1.1k+ articles

Goldman Sachs

260+ articles

Snapdeal

150+ articles

40+ articles

Brocade

10+ articles

Juniper Networks Recruitment Process

Last Updated: 28 March 2023

About Company Recruitment Process Questions Asked in Juniper Networks Interview Experiences Where to Apply ?About Company :Juniper Networks, Inc. is an...read more

Interview Experiences

Juniper Networks

interview-preparation

placement preparation

Recruitment Process

Experiences

Total area of two overlapping rectangles

Last Updated: 20 October 2023

Given the coordinates of two rectangles in a 2D plane, the first rectangle is defined by its bottom-left corner (ax1, ay1) and its top-right corner (ax2, ay2) and the seco...read more

Basic Coding Problems

Juniper Interview Experience | Set 5 (For SDE111)

Last Updated: 07 March 2018

Telephonic round:Multithreading, current project, prev company project, packet transfer over networkDeadlock, situation for deadlock, min thread/resource required for dead ...read more

Interview Experiences

Juniper Networks

Experiences

Juniper Networks Interview Experience | Set 4 (On Campus)

Last Updated: 31 October 2017

Round 1:Online Test consists of 35 MCQs and 3 Coding Questions.MCQs were both Technical and Aptitude.Aptitude Questions were of average difficulty level and Technical MCQs ...read more

Interview Experiences

Juniper Networks

Experiences

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

Merge two sorted arrays

Last Updated: 03 October 2023

Given two sorted arrays, the task is to merge them in a sorted manner.Examples:Input: arr1[] = { 1, 3, 4, 5}, arr2[] = {2, 4, 6, 8}Output: arr3[] = {1, 2, 3, 4, 4, 5, 6, 8...read more

Decimal Equivalent of Binary Linked List

Last Updated: 19 April 2023

Given a singly linked list of 0s and 1s find its decimal equivalent. Input : 0-0-0-1-1-0-0-1-0 Output : 25 Input : 1-0-0 Output : 4The decimal value of an empt ...read more

Linked List

Juniper Networks

DSA

Merge two sorted arrays with O(1) extra space

Last Updated: 19 October 2023

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 array and the remaining numbers a...read more

Juniper Networks Interview Experience

Last Updated: 19 February 2015

Written Test: Aptitude + CS Questions (mostly DS + Networks and some OS) + 2 Code questions.F2F 1:1) C Language questions. Learn C thoroughly. 2) Implement insert in a bin ...read more

Interview Experiences

Juniper Networks

Experiences

Insertion Sort - Data Structure and Algorithm Tutorials

Last Updated: 31 May 2023

Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted...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: 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 representation of 6 is 110 and has ...read more

1 2 >>

1 2 >>

1 2 >>