SDE - 1
Citrix
2 rounds | 4 Coding problems
615 views
Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structure and algorithms, Object oriented programming, Operating system.
Tip

Do practice a lot of DP problems and pay more focus on Data Structure and algorithms related problems. I prepare for my interview through the interview preparation course of Coding Ninjas and it was too good. You will get all the concepts that are asked in an interview there.

Application process
Where: Campus
Eligibility: 7.5
Resume tip

Do mention 2-3 good projects and your previous internship experiences as it will give a good impression to the interviewer and increases your chances of selection.

Interview rounds
01
Round
Easy
Online Coding Test
Duration90 minutes
Interview date4 Sep 2019
Problems2
MCQ's

25 MCQs-> based on object-oriented programming, Operating system, Data communication and networking.

Last Stone Weight

We have a collection of stones, each stone has a positive integer weight.

Each turn, we choose the two heaviest stones and smash them together.  Suppose the stones have weights x and y with x <= y.  The result of this smash is:

If x == y, both stones are totally destroyed;

If x != y, the stone of weight x is totally destroyed, and the stone of weight ...

view more
Problem approach
• I used max priority queue to pop 2 stones and push back (Stone 1 weight-Stone 2 weight) and at the end returned front element of priority queue if left. Then the interviewer asked me to write its code and I wrote a neat and commented code and dry run it on the test cases given by the interviewer. He was satisfied with my approach.
02
Round
Easy
Face to Face
Duration60 minutes
Interview date5 Sep 2019
Problems2
Real time implementation of Object-oriented programming and types of polymorphism .
Problem approach
• I explained the concept of Object-oriented programming through shapes class example and gave him the definition of polymorphism by again giving the same example. Then he asked me to write code for function overriding which I explained to him through inheritance example with virtual function explanation.
Edit Distance

Given two strings str1 and str2 and below operations that can be performed on str1. Find minimum number of edits (operations) required to convert ‘str1’ into ‘str2’.

1. Insert

2. Remove

3. Replace

Problem approach
• Firstly I gave him a recursion approach and then the interviewer asked me to reduce time complexity as the complexity of recursion was exponential so I gave him top-down DP approach(recursion with memoization) and wrote its proper code. At last, he was pretty impressed by my approach.
Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by Citrix
213 views
Software Engineer
4 rounds | 3 problems
Interviewed by Citrix
164 views
Software Engineer
4 rounds | 7 problems
Interviewed by Citrix
161 views
SDE - 1
4 rounds | 9 problems
Interviewed by Citrix
254 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57082 views