MTS-2 Nutanix Interview DSA
- Posted
- 1 Aug 2025
Summary
I interviewed for the MTS-2 role at Nutanix, which primarily focused on Data Structures & Algorithms, and was asked two specific LeetCode problems.
How it went
Questions asked (2)
- 01
Longest Common Subsequence
Data Structures & Algorithms · Medium
Open the problemGiven two strings
text1andtext2, return the length of their longest common subsequence. If there is no common subsequence, return 0. - 02
Sqrt(x)
Data Structures & Algorithms · Easy
Open the problemGiven a non-negative integer
x, compute and return the square root ofx. Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned.