Citrix Software Development Engineer 2 Interview Experience
Software Development Engineer 2
Summary
AI Powered
The Citrix Software Development Engineer interview process involved two rounds with a focus on technical problem-solving skills. The first round included coding questions such as 'Connecting Islands' and 'Longest Common Subsequence', while the second round featured binary tree problems and a complex array merging challenge. Overall, the interview experience was rigorous and targeted, reflecting Citrix's emphasis on both coding proficiency and algorithmic thinking.
1
#1Connecting Islands
Medium
grid
dfs
bfs
Given a 2D grid representing land (1) and water (0), you need to connect all the islands together by converting the water (0) to land (1). Count the minimum number of 0s you will need to flip to connect all islands.
#1
Connecting Islands
Given a 2D grid representing land (1) and water (0), you need to connect all the islands together by converting the water (0) to land (1). Count the minimum number of 0s you will need to flip to connect all islands.
grid
dfs
bfs
Medium
#2Longest Common Subsequence
Medium
dynamic-programming
strings
Given two strings, find the length of their longest common subsequence. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. For example, given strings 'abcde' and 'ace', the longest common subsequence is 'ace' with length 3.
#2
Longest Common Subsequence
Given two strings, find the length of their longest common subsequence. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. For example, given strings 'abcde' and 'ace', the longest common subsequence is 'ace' with length 3.
dynamic-programming
strings
Medium
#3Left View of a Binary Tree
Medium
binary-tree
traversal
Given a binary tree, print the nodes that are visible when the tree is viewed from the left side. You are to return the left view as an array of node values.
#3
Left View of a Binary Tree
Given a binary tree, print the nodes that are visible when the tree is viewed from the left side. You are to return the left view as an array of node values.
binary-tree
traversal
Medium
#4Maximum Jumps Needed to Reach the End
Medium
greedy
dynamic-programming
You are given an array where each element represents your maximum jump length at that position. Write a function to find the minimum number of jumps needed to reach the last index of the array.
#4
Maximum Jumps Needed to Reach the End
You are given an array where each element represents your maximum jump length at that position. Write a function to find the minimum number of jumps needed to reach the last index of the array.
greedy
dynamic-programming
Medium
#5Subarray Range with Given Sum
Medium
subarrays
hashmap
Given an array of integers, find the maximum length of a contiguous subarray that sums to a given value. Provide an approach that achieves this in linear time.
#5
Subarray Range with Given Sum
Given an array of integers, find the maximum length of a contiguous subarray that sums to a given value. Provide an approach that achieves this in linear time.
subarrays
hashmap
Medium
2
#1Bottom View of a Binary Tree
Medium
binary-tree
traversal
Write a function to print the bottom view of a binary tree. The bottom view is defined as the nodes that are visible when the tree is viewed from below.
#1
Bottom View of a Binary Tree
Write a function to print the bottom view of a binary tree. The bottom view is defined as the nodes that are visible when the tree is viewed from below.
binary-tree
traversal
Medium
#2Merge Two Sorted Arrays
Medium
arrays
merging
Given two sorted arrays, merge them into the first array without using extra space. Handle cases where one of the arrays may include missing elements represented by -1.
#2
Merge Two Sorted Arrays
Given two sorted arrays, merge them into the first array without using extra space. Handle cases where one of the arrays may include missing elements represented by -1.
arrays
merging
Medium
fullstackinterviewsoftwareengineersoftwaredeveloperinterviewexperiencecitrixjavascriptinterviewtipsjobinterviewcareergrowthcitrix
r
ritwik chakraborty
Verified User