Cisco Networking Academy Interview Questions and Answers

Round duration - 50 minutes
Round difficulty - Medium

Two panellist were there, one was asking question based upon CN + OS + DBMS, one was asking question based upon DS + Algo.

Q1. 
Binary Search Tree Insertion
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...read more
Ans. 
Insert a new node with a given value into a binary search tree while maintaining BST properties.
• Parse input for tree elements and value to be inserted

• Insert the new node into the BST while maintaining BST properties

• Return '1' if a correct tree configuration is achieved, else '0'
Answered by AI
Add your answer
Q2. 
LCA in a Binary Search Tree
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...read more
Ans. 
The task is to find the Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree (BST).
• Traverse the BST from the root to find the LCA of nodes P and Q.

• Compare the values of nodes P and Q with the current node's value to determine the path to follow.

• Continue traversing until you find the LCA node.

• If one node is the ancestor of the other, return that node as the LCA.

• Example: For input 2 3 and BST 1 2 3 4 -1 5 6 ...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Round duration - 15 Minutes
Round difficulty - Easy

Round duration - 90 minutes
Round difficulty - Medium

The test was scheduled on 1st November 2020 at 6 pm . 
Platform: Hackerrank
Number of questions : 2 coding and 25 MCQ
Language allowed for coding ques : Java ( Cisco only allows java )
Difficulty level : Moderate - Hard
Tip : Focus on one coding ques and do maximum MCQ's , it will be enough.

Q1. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
• Use Breadth First Search (BFS) algorithm to find the shortest path on the board.

• Maintain a queue to keep track of the cells to be visited next.

• Consider the special cases of snakes and ladders while calculating the next cell to move to.

• Return -1 if the last cell is unreachable.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

The technical interview was scheduled on webex teams at 10 am on 11th November 2020.
There were 2 panelists.
Interview went on for around 80 mins where they asked me questions on resume , projects , internships , Networking and Dsa .
Networking was asked because i mentioned a project on my resume that uses Socket.io .
Most of the time of interview was taken up by Dsa question.

Q1. 
Corporate Flight Bookings Problem Statement
You are given an array/list BOOKINGS representing the booking details of 'N' flights from 1 to 'N'. Each booking detail consists of three positive integers: [fi...read more
Ans. 
Given flight booking details, calculate total seats reserved for each flight.
• Iterate through each booking detail and update the total seats reserved for each flight within the range

• Use an array to store the total seats reserved for each flight

• Handle overlapping booking details by adding seats to the corresponding flights
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round consist of 2 coding questions and they were of good level based on strings and dynamic programming.

Round duration - 20 minutes
Round difficulty - Easy

Q1. What is the best way to retrieve the minimum number at any point in time from a bag where numbers are continuously inserted and removed?
Ans. 
Use a min heap to efficiently retrieve the minimum number from a bag where numbers are continuously inserted and removed.
• Implement a min heap data structure to keep track of the minimum number at any point in time.

• When a number is inserted, add it to the min heap.

• When a number is removed, remove it from the min heap.

• The root of the min heap will always contain the minimum number.
Answered by AI
Add your answer