Mts-2 Nutanix Interview Dsa

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

question 1: https://leetcode.com/problems/longest-common-subsequence/description/ question2:https://leetcode.com/problems/sqrtx/submissions/668823403/

Interview Questions (2)

Longest Common Subsequence

Data Structures & AlgorithmsMedium

Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.

Sqrt(x)

Data Structures & AlgorithmsEasy

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.

Help the Community

Summary

Full Experience

Interview Questions (2)

Join the Discussion

No comments yet