MTS-2 Nutanix Interview DSA
August 1, 2025 · 81 reads
Summary
I interviewed for the MTS-2 role at Nutanix, which primarily focused on Data Structures & Algorithms, and was asked two specific LeetCode problems.
Full Experience
Interview Questions (2)
1.
Longest Common Subsequence
Data Structures & Algorithms·Medium
Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
2.
Sqrt(x)
Data Structures & Algorithms·Easy
Given a non-negative integer x, compute and return the square root of x. Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned.