Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Citrix interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Citrix
upvote
share-icon
4 rounds | 7 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 4 Months
Topics: DSA ( Graphs, trees, linked lists, arrays, strings), System design, Networks, OS, Math Puzzles
Tip
Tip

Tip 1 : Strings were the most asked topic during the 2021 placement season. 
Tip 2 : Prepare Networks and OS properly and be sure to answer all questions in an interview.

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

Tip 1 : Please keep it a one-pager, and do not include skills like Ms Word, and Excel.
Tip 2 : Ensure you highlight 2 dev projects that you know fully. You can get questions as to what you did in the project vs what your other teammates did. Never try to create any stories during the interview, it clearly shows that the candidate is lying.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date20 Jul 2020
Coding problem2

1. 2 programing Questions
2. 10 MCQs based on OS and Networking.

1. Find the City With the Smallest Number of Neighbors at a Threshold Distance
Moderate
15m average time
85% success
0/80
Asked in companies
GoogleUberCitrix

You are given ‘N’ cities numbered from 0 to N-1 and ‘M’ edges. These cities are connected with undirected weighted edges. You are also given a positive integer, ‘distanceThreshold’.

View more
Problem approach

1. Graph question
2. Use BFS to solve the same.
3. As it was an online round you just have to code it in hackerrank's IDE.

Try solving now
2. Left View Of Binary Tree
Moderate
30m average time
60% success
0/80
Asked in companies
SalesforceWalmartSnapdeal

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values



Example :
View more
Problem approach

1. Provided the head node 
2. BFS to get level order nodes of each level.
3. Print the first node of each level.

Try solving now
02
Round
Medium
Video Call
Duration60 Minutes
Interview date22 Jul 2020
Coding problem2

1. The interview was in the morning 10-11AM.
2. It was an online round using teams and hackerrank codepair.

1. Longest Common Substring
Moderate
25m average time
75% success
0/80
Asked in companies
Wells FargoShareChatAdobe

You are given two strings, 'str1' and 'str2'. You have to find the length of the longest common substring.


View more
Problem approach

1. I was able to provide the solution in 15 mins ( I had seen the problem during my practice) :)
2. Step1 : Brute Force :A simple solution is to one by one consider all substrings of the first string and for every substring check if it is a substring in the second string. Keep track of the maximum length substring. 

Step 2 : Optimize the solution using DP O(m*n)

Try solving now
2. Car Pooling
Moderate
30m average time
70% success
0/80
Asked in companies
GoogleAmazonMathworks

You are working as a cab driver. Your car moves in a straight line and moves toward the forward direction only. Initially, you have ‘C’ empty seats for the passengers.

View more
Try solving now
03
Round
Easy
Video Call
Duration60 Minutes
Interview date22 Jul 2020
Coding problem2

1. Managerial/Technical round
2. Right after the second round.
3. Lasted for 60 mins.

1. Build Heap
Moderate
30m average time
70% success
0/80
Asked in companies
OYOSamsungSAP Labs

You are given an integer array with N elements. Your task is to build a max binary heap from the array.

A max-heap is a complete...

View more
Problem approach

1. Replace first and last element of the array.
2. Go from mid of the array and check for the condition that it is greater than its children. If it is not, then swap it.
3. Repeat step 2 till you complete the loop from n/2 to 1.

Try solving now
2. OS Questions

What are the conditions of deadlock? What is a semaphore and what are mutex locks?

Problem approach

Tip 1 : Read the OS deadlocks and mutex locks chapter thoroughly.
Tip 2 : Ensure that you are strong in OS fundamentals ( Bankers algo, resource sharing graphs etc)
Tip 3 : Type os OS (modular, layered etc)

04
Round
Easy
HR Round
Duration30 Minutes
Interview date22 Jul 2020
Coding problem1

ROund occurred during evening time ( 5-6 pm).
After the third round.

1. Basic HR Questions

1. Why this company?
2. Do you have other offers?
3. Where will you be in 5 years?
4. Do you like to work on networking or only application development?
5. Planning for a masters?

Problem approach

Tip 1 : Be calm and confident.
Tip 2 : Prepare for general HR questions.
Tip 3 : Please, never say that you are planning for a masters.

Join the Discussion
1 reply
profile
10 months ago
Comment Removed
0 upvotes
0 replies
Reply
Similar interview experiences
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Citrix
993 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 3 problems
Interviewed by Citrix
539 views
0 comments
0 upvotes
company logo
Software Engineer
3 rounds | 3 problems
Interviewed by Citrix
645 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 9 problems
Interviewed by Citrix
703 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
9337 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
5934 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
6202 views
1 comments
0 upvotes