Cisco interview experience Real time questions & tips from candidates to crack your interview

Intern

Cisco
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: C, C++, Java Data Structures, Pointers, OOPS, Operating System, Networking
Tip
Tip

Tip 1 : Must do Previously asked Interviews Questions.
Tip 2 : Prepare OS, DBMS, OOPs, Computer Networks well.
Tip 3 : Prepare well for one project mentioned in the resume, the interviewer may ask any question related to the project, especially about the networking part of the project.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have at least 2 good projects mentioned in your resume with a link
Tip 2 : Focus on skills, internships, projects, and experiences.
Tip 3 : Make it simple, crisp, and one page
Tip 4 : Only write those skills in which you are good.

Interview rounds

01
Round
Easy
Online Coding Test
Duration90 Minutes
Interview date9 Apr 2019
Coding problem2

This was an online test on the hackerrank platform. The test consists of 15 MCQs question based on DBMS, CN, Operating system and 2 coding questions to be solved in 90 mins.

1. Minimum Subarray With Required Sum

Moderate
18m average time
85% success
0/80
Asked in companies
FacebookGoldman SachsThought Works

You have been given an array(ARR) of positive integers and an integer X. You have to find the minimum length subarray such that the sum of all of its elements is strictly greater than the given integer X.

Note:
A subarray is a contiguous block of elements that can be formed by deleting some (possibly zero) elements from the beginning or the end of the original array. 
For example :
If the given array is [1, 2, 3, 4, 5], then [2, 3, 4], [1, 2], [5] are some subarrays while [1, 3], [2, 3, 5] are not.

If there are multiple subarrays with minimum length, find one which appears earlier in the array (i.e. subarray that starts with lower index).

If there is no such subarray, print an empty line.
Try solving now

2. Duplicate In Array

Easy
15m average time
85% success
0/40
Asked in companies
QualcommSAP LabsAmazon

You are given an array ‘ARR’ of size ‘N’ containing each number between 1 and ‘N’ - 1 at least once. There is a single integer value that is present in the array twice. Your task is to find the duplicate integer value present in the array.

For example:

Consider ARR = [1, 2, 3, 4, 4], the duplicate integer value present in the array is 4. Hence, the answer is 4 in this case.
Note :
A duplicate number is always present in the given array.
Problem approach

lass Solution {
public boolean containsDuplicate(int[] nums) {
HashMap fmap = new HashMap<>();

for(int i: nums){
if(fmap.containsKey(i)) 
return true;

else
fmap.put(i,1);
}
return false;
}
}

Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date16 Apr 2019
Coding problem2

This was 1st technical round taken by the software engineer. Interviewer was very friendly, he started with his introduction and then asked me to introduce myself.

He asked various questions:

• What is the reason of having Multiple table in databases,why not a huge single table?
• DBMS transaction, ACID property.
• DBMS DEADLOCKS.
• Indexing in DBMS.Why Indexing?
• Why C++ is considered to advance then c language.
• What is Structured Programming?
• Discussion on Virtual function, Pure Virtual Function and Abstract Classes.

1. Contains Duplicate ll

Moderate
35m average time
75% success
0/80
Asked in companies
CiscoAmazon

Given an array 'arr' of 'N' integers and an integer 'K'. The array 'arr' may contain duplicate integers. Return "true" if the array contains any duplicate element within the 'K' distance from each other, otherwise, return "false".

Problem approach

C++ solution

class Solution {
public:
bool containsNearbyDuplicate(vector& nums, int k) {
map mp;
for(int i = 0; i < nums.size(); i++){
if(mp.find(nums[i]) != mp.end() && i-mp[nums[i]] <= k) return true;
mp[nums[i]] = i;
}
return false;
}
};

Try solving now

2. Kth largest element in the unsorted array

Moderate
10m average time
90% success
0/80
Asked in companies
FacebookUberMicrosoft

You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.

Example:
Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
Note:
1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order. 

2) All the elements of the array are pairwise distinct.
Try solving now
03
Round
Easy
HR Round
Duration60 Minutes
Interview date19 Apr 2019
Coding problem1

It was the technical + HR round taken by the technical manager. During the interview, the interviewer was very friendly and helpful whenever I had any questions. I was asked to introduce myself after he gave his introduction.

1. Technical Questions

Introduction
What are OOPs concepts and its pillar
Is java support multiple inheritance or not
what are acid properties
Write a SQL query to find the 2nd largest salary from employee table
What is Virtual Destructor and why? Explain Free and Delete. Difference Between them? Assignment operator in classes.(default and Userdedfined)
Shallow copy Deep copy.
How is runtime polymorphism done? explain compiler step to step process?
Abstract Classes.
What are Your suggestions for making a company/Organization populate among campus students?
What is your dream company?
What is the biggest challenge in life?
What are your future plans. Where do you see yourself after 2 years.
What is your goal.
Are you comfortable with the new locations of the company?

Problem approach

Tip 1 : Use the star method to tackle situational-based questions. 
Tip 2 : Try to interact more with the interviewer. 
Tip 3 : Ask questions from the interviewer until it’s not clear to you.
Tip 4 : Try to give the answer to the point and make sure your explanation will be more accurate.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

To make an AI less repetitive in a long paragraph, you should increase:

Choose another skill to practice
Similar interview experiences
company logo
Data Engineer
3 rounds | 4 problems
Interviewed by Cisco
0 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Cisco
1557 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Cisco
1473 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Cisco
637 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Intern
2 rounds | 2 problems
Interviewed by Microsoft
1446 views
0 comments
0 upvotes
company logo
Intern
2 rounds | 2 problems
Interviewed by Adobe
985 views
0 comments
0 upvotes
company logo
Intern
3 rounds | 4 problems
Interviewed by Oracle
1258 views
0 comments
0 upvotes