Cisco
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via LinkedIn and was interviewed in Jan 2022. There was 1 interview round.
Programs to find second largest in an integer array and denomination to get amount.
For finding the second largest number, sort the array in descending order and return the second element.
For finding the denomination, loop through the array of denominations and keep dividing the amount until it becomes zero.
Use integer division to get the number of notes of each denomination.
Questions related to Java and automation testing
ArrayList is implemented as a resizable array, while LinkedList is implemented as a doubly linked list
For loop, enhanced for loop, Iterator, ListIterator can be used to iterate through a list
List is an ordered collection, Set is an unordered collection, Map is a collection of key-value pairs
Abstract class cannot be instantiated, its implementation is done by extending it ...
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 20 Feb 2024
I applied via Naukri.com and was interviewed in Aug 2023. There were 4 interview rounds.
Generic dotnet questions mcq
One problem is given need to make logic and your current project details
Managerial round was taken at the end
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 12 Feb 2024
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.
The question asks to find the memory of a given structure by considering struct padding.
Struct padding refers to the unused bytes added to align the members of a structure.
To find the memory of a structure, we need to consider the size of each member and the padding added.
The total memory of a structure is the sum of the sizes of its members and the padding.
Code to find the position of a number in a BST
Implement a recursive function to traverse the BST
Compare the target number with the current node value
If the target is smaller, go to the left subtree; if larger, go to the right subtree
Repeat until the target is found or the subtree is null
A Trie is a tree-like data structure used for efficient retrieval of strings. It supports insertion and search operations.
A Trie is also known as a prefix tree.
Each node in the Trie represents a character.
The root node represents an empty string.
Each node can have multiple children, each representing a different character.
Insertion involves traversing the Trie and creating new nodes as needed.
Search involves traversing...
I applied via Referral and was interviewed in Nov 2023. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Jun 2023. There were 2 interview rounds.
Javascript related test
Shopping cart, How to develop a shopping cart, its architecture
posted on 11 Sep 2024
Check if a string containing parenthesis, curly brackets, and square brackets is valid.
Use a stack to keep track of opening brackets
Pop from stack when encountering a closing bracket, ensuring it matches the corresponding opening bracket
Return false if stack is not empty at the end
Some of the top questions asked at the Cisco QA Engineer Automation QA.Selenium interview -
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