Cisco
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
It was Hacker rank test with 5 coding questions
I appeared for an interview in Dec 2021.
Round duration - 60 minutes
Round difficulty - Hard
There were 2 coding questions and 15 MCQs (related to OOPs, OS, DBMS, CN, DSA, and Aptitude).
Alice has a garden represented as a ‘N’ * ‘N’ grid called ‘MATRIX’. She wants to collect apples following these rules:
1
-> Alice can pick an apple from this cell and ...The problem involves finding the maximum number of apples Alice can collect in a grid while following specific rules.
Create a recursive function to explore all possible paths from the starting point to the ending point while keeping track of the collected apples.
Consider the constraints and optimize the solution to avoid unnecessary computations.
Use dynamic programming to store and reuse the results of subproblems to i...
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in constant time complexity.
Handle edge cases like empty stack appropriately.
Example: If input is '5 3 10 5 1 2 4', the output should be '10 1 false'.
Round duration - 40 minutes
Round difficulty - Medium
It was a technical interview round where I was asked questions based on DSA.
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.
Initialize two pointers, slow and fast, and move them at different speeds to detect a cycle.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer reaches the end of the list (null), there is
Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer N
. The representation contains exactly one '1' and the rest are...
Find the position of the lone '1' bit in the binary representation of a given non-negative integer.
Iterate through the bits of the integer to find the position of the lone '1'.
Use bitwise operations to check if there is exactly one '1' bit in the binary representation.
Return the position of the lone '1' or -1 if there isn't exactly one '1'.
Round duration - 30 minutes
Round difficulty - Medium
It was a technical interview round where I was asked questions based on DSA, OS, and Networking.
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice to form a pair.
Return (-1, -1) if no pair is found.
Priority inversion is a scenario in scheduling where a lower priority task holds a resource needed by a higher priority task, causing the higher priority task to wait.
Occurs when a low priority task locks a resource needed by a high priority task
Results in the high priority task being blocked and unable to proceed
Can lead to delays in critical tasks and impact system performance
Commonly addressed through priority inher
During system boot, the BIOS performs Power-On Self Test (POST), loads the operating system, and initializes hardware components.
BIOS (Basic Input/Output System) performs Power-On Self Test (POST) to check hardware components
BIOS loads the bootloader from the boot device (e.g. hard drive, SSD)
Bootloader loads the operating system kernel into memory
Operating system initializes hardware components and starts system servi...
An IP address is a unique numerical label assigned to each device connected to a computer network, typically represented by 32 bits.
An IP address is used to identify and locate devices on a network.
It consists of four sets of numbers separated by periods, such as 192.168.1.1.
IPv4 addresses are 32 bits long, while IPv6 addresses are 128 bits long.
Round duration - 10 minutes
Round difficulty - Easy
This was an HR round. The interviewer asked me some questions.
Finally, she asked if I had any questions for her.
Tip 1 : For DSA questions in interviews, start explaining from the brute force approach and then move to the optimal one. Convey your thought process to the interviewers, so that they can help you out if you get stuck. Communication skills matter a lot, and I think that is what makes the difference!
Tip 2 : Do some research about the company you are interviewing for and prepare the answers to the questions like Why should we hire you? (frame your answer in such a way that shows that your career goals align with the goals of the company), Why XYZ company?, Competitors of XYZ, etc. beforehand. Read about some latest news related to the company so that you can ask questions based upon that when the interviewer allows you to ask any question. This shows that you are genuinely interested to work for the company.
Tip 3 : Spend proper time making your resume and get it reviewed by seniors. Do not write anything that you are not confident of. Even if you write something that you don’t know, just be prepared that how you will defend it. The interviewers are much much experienced than you and they’ll catch you easily if you lie. So don’t take risks here.
Tip 1 : Try to include at least 1 development project in your resume.
Tip 2 : Do not write anything that you are not confident of. Even if you write something that you don’t know, just be prepared that how you will defend it.
I appeared for an interview before Jan 2016.
Seeking new challenges and growth opportunities.
I felt that I had reached a plateau in my role and was no longer being challenged.
I was interested in exploring new technologies and wanted to work on more innovative projects.
I wanted to work in a more collaborative and dynamic environment.
I left on good terms and have maintained positive relationships with my former colleagues.
I am excited to bring my skills and experie...
I am excited to join Centurylink because of their reputation for innovation and commitment to customer satisfaction.
Centurylink has a strong focus on developing cutting-edge technology solutions
The company values customer feedback and strives to provide excellent service
I am impressed by Centurylink's dedication to diversity and inclusion in the workplace
Relocated to Noida for better career opportunities and growth.
Noida is a hub for IT companies and offers a lot of job opportunities in the software development field.
The city has a good work-life balance and a lower cost of living compared to other metropolitan cities.
I was also attracted to the diverse culture and the opportunity to work with people from different backgrounds.
I did my research and found that Noida has...
Yes, I am comfortable working in US shift.
I have prior experience working in US shift.
I am flexible with my work timings.
I understand the importance of meeting project deadlines.
I am willing to adjust my personal schedule to accommodate work requirements.
I currently reside in New York City.
I live in an apartment in Manhattan.
My neighborhood is known for its diverse food options.
I have easy access to public transportation.
I enjoy exploring the city in my free time.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on OOPS and OS mainly.
Little Endian and Big Endian refer to the order in which bytes are stored in computer memory.
Little Endian stores the least significant byte first, while Big Endian stores the most significant byte first.
Little Endian is commonly used in x86 architecture, while Big Endian is used in architectures like SPARC and PowerPC.
Endianness can affect data transmission between systems with different byte orders.
Program to determine system's endianness
Check the endianness by storing a multi-byte integer and checking the byte order
Use bitwise operations to extract the least significant byte
If the least significant byte is at the lowest memory address, it's little-endian
If the least significant byte is at the highest memory address, it's big-endian
The volatile keyword in programming is used to indicate that a variable's value can be changed unexpectedly.
Volatile keyword is used in multithreaded programming to prevent compiler optimizations on variables that can be changed by other threads.
It tells the compiler not to cache the variable's value in a register, ensuring that every access is made to the variable's memory location.
Commonly used in embedded systems pr...
Function pointers in C are used to store the address of functions, allowing for dynamic function calls and callbacks.
Function pointers can be used to implement callbacks in event-driven programming.
They can be used to switch between different functions at runtime.
Function pointers are commonly used in implementing data structures like function pointers in an array of function pointers.
Example: void (*funcPtr)(int) = &a
Design a data structure for multi-threading
Use a thread-safe queue to manage tasks for each thread
Implement a lock or semaphore to control access to shared resources
Consider using condition variables for synchronization
Use atomic operations for shared variables to prevent race conditions
The kernel is the core component of an operating system that manages system resources and provides a bridge between software and hardware.
Manages system resources such as CPU, memory, and I/O devices
Provides a bridge between software applications and hardware components
Handles tasks such as process scheduling, memory management, and device drivers
Controls communication between hardware and software layers
A storage class in programming defines the scope and lifetime of variables.
Storage classes include auto, register, static, and extern.
Auto variables are created when a function is called and destroyed when the function ends.
Register variables are stored in CPU registers for faster access.
Static variables retain their value between function calls.
Extern variables are declared outside of any function and can be accessed
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
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 9 Dec 2021
I applied via Naukri.com and was interviewed before Dec 2020. There were 3 interview rounds.
OOPs concept stands for Object-Oriented Programming concepts which includes encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation is the process of hiding the implementation details from the user.
Inheritance allows a class to inherit properties and methods from another class.
Polymorphism allows objects to take on multiple forms or behaviors.
Abstraction is the process of hiding unnecessary details from
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
It improves page load time and performance.
It is commonly used for images, videos, and other media files.
It can be implemented using JavaScript libraries like LazyLoad or Intersection Observer API.
Lazy loading can also be used for modules and components in web applications.
It helps to reduce the initial load time of th
Eager loading is a technique used in software development to load related data in advance to avoid multiple database queries.
Eager loading is used to optimize database queries and improve performance.
It loads all the required data in a single query instead of making multiple queries.
It is commonly used in Object-Relational Mapping (ORM) frameworks like Hibernate, Entity Framework, etc.
Eager loading can be used with var...
I appeared for an interview in Oct 2023.
I applied via Approached by Company and was interviewed before Apr 2023. There were 3 interview rounds.
Questions regarding JS concepts. JS and React specific rounds, closures, Promises, etc
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
Some of the top questions asked at the Cisco Software Developer interview for experienced candidates -
The duration of Cisco Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 1 interview
Interview experience
based on 45 reviews
Rating in categories
Software Engineer
2.7k
salaries
| ₹10 L/yr - ₹40 L/yr |
Senior Software Engineer
653
salaries
| ₹14 L/yr - ₹48.8 L/yr |
Technical Consulting Engineer
651
salaries
| ₹7.5 L/yr - ₹30 L/yr |
Network Engineer
394
salaries
| ₹3.9 L/yr - ₹17 L/yr |
Software Developer
364
salaries
| ₹18.3 L/yr - ₹42.6 L/yr |
Microsoft Corporation
Sterlite Technologies
Nokia Networks