Software Development Engineer 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.
This question was asked in
Citrix Software Development Engineer 2 Interview Experience
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.