Skip to content

Tag Archives: Juniper Networks

Given a singly linked list of 0s and 1s find its decimal equivalent. Input: 0->0->0->1->1->0->0->1->0 Output: 50 Input: 1->0->0 Output: 4 The decimal value of… Read More
Given a singly linked list of 0s and 1s find its decimal equivalent. Input: 0->0->0->1->1->0->0->1->0 Output: 50 Input: 1->0->0 Output: 4 The decimal value of… Read More
Given a singly linked list of 0s and 1s find its decimal equivalent. Input: 0->0->0->1->1->0->0->1->0 Output: 50 Input: 1->0->0 Output: 4 The decimal value of… Read More
Given a singly linked list of 0s and 1s find its decimal equivalent. Input: 0->0->0->1->1->0->0->1->0 Output: 50 Input: 1->0->0 Output: 4 The decimal value of… Read More
Given a singly linked list of 0s and 1s find its decimal equivalent. Input: 0->0->0->1->1->0->0->1->0 Output: 50 Input: 1->0->0 Output: 4 The decimal value of… Read More
Round 1: ONLINE TEST:- 20 aptitude questions, 15 technical questions, 3 programming problems. aptitude- difficulty level is high. questions were from mixtures, ages, analytical reasoning,… Read More
Juniper Networks Interview Experience For Internship Juniper Networks visited our campus for hiring interns. Firstly, there was an online round, after which 15-20 people were… Read More
About Company Recruitment Process Questions Asked in Juniper Networks Interview Experiences Where to Apply ? About Company : Juniper Networks, Inc. is an American multinational… Read More
Given two overlapping rectangles on a plane. We are given bottom left and top right points of the two rectangles. We need to find the… Read More
Telephonic round: Multithreading, current project, prev company project, packet transfer over network Deadlock, situation for deadlock, min thread/resource required for dead lock, how to overcome… Read More
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… Read More
Round 1 It was an online test of 90 mins duration. It consisted 35 aptitude and technical Multiple choice Quizzes and 3 Coding Questions. All… 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 arrays, the task is to merge them in a sorted manner.Examples:  Input: arr1[] = { 1, 3, 4, 5}, arr2[] =… Read More

Start Your Coding Journey Now!