Cisco
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
It was a 2 hour test with medium level questions
I applied via LinkedIn and was interviewed in Feb 2024. There were 2 interview rounds.
40 MCQ's, 2 Coding question
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.
It works by maintaining a set of nodes whose shortest distance from the starting node is known.
The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...
DSA, Behavioural, os, some networks basics
What people are saying about Cisco
I appeared for an interview before Mar 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Interviewer was very nice and made me feel pretty comfortable. We talked about our hobbies for about 10mins and then he asked about my projects and which was my favourite of all. He then asked me a coding question. Which was like pretty easy and I gave him the optimized approach right away. He was satisfied with my approach and just moved on to the next part. He asked me some basic questions related to Operating Systems(related to deadlocks and semaphores). He even asked some basic questions related to OOPS. Then he gave me the next question. This was like a pretty new question for me and I took some time to understand the problem statement and then took some time to think about the logic. I was also sharing my approach with interviewer as well.I finally told him about my approach. He told me that my approach was fine but there also was some other approach but normally no-one would come up with that approach until they have previously solved the question.
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree, find the number of nodes in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to count nodes in each subtree.
Maintain a count of nodes in each subtree while traversing the tree.
Start the DFS from the root node (node 0) and recursively count nodes in each subtree.
For leaf nodes, the subtree size will be 1 (the node itself).
Round duration - 30 Minutes
Round difficulty - Easy
Interviewer seemed to be a senior manager.He just asked about me and started with the interview.Interviewer asked me to design a standard map(hash-map). I gave him my approach and he also asked me to devise a hash function for it. I also gave him a hash function and he seemed to be pretty satisfied.
Design a basic hash map
Use an array of linked lists to handle collisions
Implement methods for adding, removing, and retrieving key-value pairs
Include a hashing function to map keys to indices in the array
Tip 1 : Practise as many questions as you can
Tip 2 : Try solving the question on your own.
Tip 3 : To learn the concepts of OOM its best to go through a project.
Tip 1 : Mention your coding achievements
Tip 2 : Do not make a big resume.
Cisco interview questions for designations
I appeared for an interview before Jun 2021.
Round duration - 45 Minutes
Round difficulty - Medium
The interviewer was nice and he made me feel comfortable
Topics :- Data structures, string manipulation and pointers
Timing :- Afternoon
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
Remove duplicate occurrences of characters in a given string.
Use a hash set to keep track of characters seen so far.
Iterate through the string and add non-duplicate characters to a new string.
Return the new string without duplicate characters.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer was very supportive and we had a good discussion regarding his role in cisco etc.
Questions on various topics were asked including my courses, resume and internship
You are provided with a binary tree consisting of integer-valued nodes. The task is to compute the In-Order, Pre-Order, and Post-Order traversals for the given binary tree.
Compute In-Order, Pre-Order, and Post-Order traversals for a given binary tree.
Implement tree traversal algorithms like In-Order, Pre-Order, and Post-Order.
Use recursion to traverse the binary tree efficiently.
Maintain separate lists for each traversal type and return them as nested lists.
Round duration - 30 Minutes
Round difficulty - Medium
It was the HR round
Tip 1 : Practice coding questions of each difficulty level in the ratio of 3:2:1 (easy:medium:hard)
Tip 2 : Make sure that you have thorough knowledge of your projects/internships
Tip 1 : Update your resume to highlight your strengths
Tip 2 : Remove unnecessary courses in which you aren’t confident
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Timing: Morning
How was the environment? It happened in the Computer Lab of my institution
All students were assigned a computer and we had to solve questions on hackerrank
Consider 'N' individuals numbered from 0 to N-1 standing in a queue. You are provided with two arrays: Height
and Infront
, each consisting of 'N' non-negative int...
The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.
Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.
Sort the list of tuples in descending order of height and ascending order of the number of taller people.
Create an empty result list and insert each tuple into the r...
Round duration - 60 Minutes
Round difficulty - Medium
Round was a mix of concepts from OOPS, OS and Problem Solving
Given a Binary Search Tree (BST) and a key value 'X', determine if there exists a node within the BST containing the value 'X'.
Consider the tree represe...
The task is to find if a given value is present in a Binary Search Tree (BST).
Start from the root node and compare the value with the target value.
If the value matches, return true.
If the target value is less than the current node value, move to the left child.
If the target value is greater than the current node value, move to the right child.
Repeat the process until a match is found or a leaf node is reached.
If a leaf...
Tip 1 : Try to code the data structures that you have learned to understand things better
Tip 2 : Try to solve the problem even if it is the worst possible solution you think and then try to optimize don't jump to get the
best possible solution
Tip 3 : Discuss things among peers it helps to improve the understanding, even try to teach someone anything new you learn, this is very helpful during the interviews as you will have habit of explaining things
Tip 1 : Try to be honest in the resume don't write something you don't know, most of the time it backfires.
Tip 2 : Try to make 2 good projects for cv and know about the challenges you can face on the project and think about how you can solve that challenge.
posted on 16 Sep 2021
I appeared for an interview in Apr 2021.
Round duration - 45 minutes
Round difficulty - Medium
Timing was 12 PM. Interviewer was nice.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from end to start and append each character to a new string.
Alternatively, use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints on the length of the string and number of test cases.
Your task is to rearrange a given array ARR
such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
Iterate through the array and maintain two pointers - one for the next position to place a zero and one for the next non-zero element.
Swap the elements at these pointers until all zeros are moved to the left and non-zero elements are in their relative order.
Time complexi...
SQL query to find the second highest salary from a table
Use the MAX() function to find the highest salary
Use the NOT IN operator to exclude the highest salary from the results
Order the salaries in descending order and limit the result to 1
Tip 1 : Do some projects.
Tip 2 : Practice problem solving questions.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
posted on 16 Nov 2021
I appeared for an interview in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Online test
Based on c++,c and java basics
MCQ questions based on C++, C, and Java basics.
Understand the differences between C++, C, and Java syntax and features.
Be familiar with basic concepts like data types, control structures, and functions.
Practice solving MCQs to improve your understanding of the languages.
Round duration - 150 Minutes
Round difficulty - Medium
Technical interview
The task is to determine the number of distinct elements in every sliding window of size 'K' across an array 'ARR' of size 'N'. A 'K' sized window is a contiguous sequ...
Calculate the count of distinct elements in each sliding window of size 'K' across an array 'ARR'.
Use a sliding window approach to iterate through the array and keep track of distinct elements using a hashmap or set.
Update the count of distinct elements in each window as it slides across the array.
Return the array detailing the count of distinct elements in each 'K' sized window for each test case.
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
The input consists of a single line contain...
Sort a Singly Linked List using Merge Sort algorithm.
Implement the Merge Sort algorithm for linked lists.
Divide the list into two halves, sort each half recursively, and then merge them.
Use a fast and slow pointer to find the middle of the list for splitting.
Handle the base cases of empty list or single node list.
Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Round duration - 20 minutes
Round difficulty - Hard
Hr interview
Tip 1 : Go through oosp concept properly
Tip 2 : Good knowledge on coding
Tip 3 : intermediate knowledge on database and data structures
Tip 1 : A project based on database
Tip 2 : Mention all the fields properly and have a prior knowledge on your project
posted on 15 Mar 2024
I applied via Job Fair and was interviewed before Mar 2023. There were 3 interview rounds.
2 data struture question advancevds i cpp
Implement a data structure for storing and manipulating an array of strings.
Use a dynamic array to store the strings.
Implement functions for adding, removing, and accessing strings in the array.
Consider memory management and resizing the array as needed.
posted on 9 Jul 2024
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
First round was aptitude + coding. 60 questions in 60 mi , 30 about aptitude (mostly quants) , 30 about coding mcqs related to dsa ,oops. There was negative marking also.
based on 3 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
2.6k
salaries
| ₹11 L/yr - ₹40 L/yr |
Technical Consulting Engineer
686
salaries
| ₹8 L/yr - ₹30.8 L/yr |
Senior Software Engineer
653
salaries
| ₹14 L/yr - ₹50 L/yr |
Network Engineer
395
salaries
| ₹3.9 L/yr - ₹17 L/yr |
Software Developer
353
salaries
| ₹18.5 L/yr - ₹43.7 L/yr |
Microsoft Corporation
Sterlite Technologies
Nokia Networks