Schrödinger - Machine learning Full stack developer(Interview) Round 1(OA) - 2 leetcode hard medium(solved) 1 hard(13/15 testcases passed).
Round 2(Interview)(didn't clear) -
Q1 - You are given an integer array nums of size n and an integer x.
Return the number of distinct triplets (i, j, k) such that:
0 ≤ i < j