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
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.
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
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.
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
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.
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
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.
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
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.
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
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.
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
fullstackinterviewsoftwareengineersoftwaredeveloperinterviewexperiencecitrixjavascriptinterviewtipsjobinterviewcareergrowthcitrix
r
ritwik chakraborty
Verified User
ā/Ctrl+D
Bookmark for later