OCI VMI team
Round 1: LeetCode 1186.
Round 2:
Given a string s consisting of lowercase English letters, find the minimum length of a contiguous substring to delete so that every character in the remaining string appears at most once.
After deletion, join the remaining prefix and suffix together. If all characters are already distinct, return 0.
Example:
Input: s = "aabb"
Output: 2
Delete the middle "ab":
a[ab]b → ab
The remaining string "ab" has no repeated characters.
Round 3: The hiring manager interviewed me personally. Design a VM Provisioning Service. I was also asked what the hardest part is of the project I'm working on in my current team, and how I solved it.
I hadn't prepared any low-level system design, and I don't know the low-level internals of hypervisors and VMs, so they rejected me the next morning.
Discussion
Loading comments…