Hi, Recently I appeared for interview at Nutanix for SDE-2 role.
Here is my interview experience
Q1) Implement multiply(3)(4)() in any language
Took some time understanding, switched from C++ to javascript, was able to solve this.
Concept -> Currying in javascript
Follow up : Implement multiply(1)(2)(3)....(n)()
Was not able to solve this. This is infinite currying problem and a famous interview question.
Q2.) 1823: Winner of Circular game => Leetcode
Was able to give a solution O(n*k) using queue and coded as well.
Tried giving optimized approach but time was over by then.
Whats the probability of clearing this round?