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

SDE - 1

Cisco
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
My journey started when I was in 2nd year of my college and I saw my friends practicing coding questions and some learning new coding languages and developing some individual projects. After seeing them I started to think that I should also start to learn more and practice coding questions. When I practicing coding questions on platform like Codechef and Hackerrank it made me realize that I need to think more to solve difficult problems and due to that I developed a habit of solving them.
Application story
I started preparing for the companies since 2nd year of my college and when I heard that this company is coming to our college I wanted to get selected in it.
Why selected/rejected for the role?
I was rejected because i was not able to answer all the questions which were asked in the exam
Preparation
Duration: 3 Months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : OOPS - You should be well versed with basic OOPS principles
Tip 2 : You should be confident and have profound knowledge about the projects you worked on
Tip 3 : Basic DB concepts like joins, normalisation

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

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds

01
Round
Easy
Video Call
Duration60 Minutes
Interview date10 Feb 2023
Coding problem2

1. Gray Code

Moderate
25m average time
70% success
0/80
Asked in companies
AdobeMicrosoftIBM

Given a number ‘grayNumber’. Find the gray code sequence.

Conditions for a gray code sequence :

1. Gray code sequence contains numbers from 0 to 2^'grayNumber'-1 in bit/binary form.
2. Two consecutive gray code sequence numbers only differ by 1 bit.
3. Gray code sequence must start with 0.

Example :

Given 'grayNumber' : 2.

alt text

As depicted from above image, the gray code sequence is 0,1,3,2.

Note :

1. The output sequence must contain the decimal representation of numbers instead of the binary form.
2. There can be multiple answers print anyone.
Try solving now

2. Anagram Pairs

Moderate
30m average time
60% success
0/80
Asked in companies
CiscoThought WorksInfosys

You are given two strings 'str1' and 'str1'.


You have to tell whether these strings form an anagram pair or not.


The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Pre-requisites:

Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams. 

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'
Note:
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 
Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date10 Feb 2023
Coding problem2

1. Reverse Stack Using Recursion

Easy
21m average time
80% success
0/40
Asked in companies
AmazonOracleRazorpay

Reverse a given stack of 'N' integers using recursion. You are required to make changes in the input parameter itself.


Note: You are not allowed to use any extra space other than the internal stack space used due to recursion.


Example:
Input: [1,2,3,4,5] 
Output: [5,4,3,2,1]

add image

Try solving now

2. Leftmost and rightmost nodes in a binary tree

Easy
20m average time
80% success
0/40
Asked in companies
AdobeSAP LabsPaytm (One97 Communications Limited)

You are given an arbitrary binary tree with N nodes, whose nodes have their values in the range of integers. You have to print the values of leftmost and rightmost nodes at each level of the given tree. In other words, for every level in the given tree, print the values of corner nodes.

Two nodes are said to be at the same level if they are at the same distance from the root node.

Note:

1. For all such levels where there is only one corner node the leftmost and the rightmost nodes are the same.
2. In the output, you have to print the leftmost and rightmost values in level order fashion i.e, the leftmost node of level1 followed by the rightmost node of level1 followed by the leftmost node of level2 followed by the rightmost node of level2 and so on.
Try solving now

Here's your problem of the day

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

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Cisco
1137 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Cisco
1112 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Cisco
625 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Cisco
692 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107831 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52129 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32260 views
6 comments
0 upvotes