Schrödinger Intervew - Machine learning Full stack developer
- Posted
- 14 Mar 2026
Summary
I had an interview for a Machine Learning Full Stack Developer role at Schrödinger. The process included an Online Assessment round and a subsequent interview, which I unfortunately did not clear.
How it went
Round 1(OA) - 2 leetcode hard medium(solved) 1 hard(13/15 testcases passed).
Round 2(Interview)(didn't clear) -
Questions asked (2)
- 01
Count Distinct Triplets with Product X and Adjacent Pair
Data Structures & Algorithms · Medium
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 < k < n
nums[i] * nums[j] * nums[k] == x
At least one pair in the triplet must be adjacent in the array, i.e.:
either j = i + 1,
or k = j + 1.
Two triplets are considered different if their indices are different. - 02
Count Good Intervals in Bacteria Infection
Data Structures & Algorithms · Medium
You are given n bacteria labeled from 1 to n.
There are m infection relationships represented by two arrays:
infected[] of size m
vulnerable[] of size m
For each index i, bacteria infected[i] can infect bacteria vulnerable[i].
An interval [L, R] (where 1 ≤ L ≤ R ≤ n) is called good if:
No bacteria within this interval can infect another bacteria within the same interval.
Return the number of good intervals.