Had a phone screen interview (5 mins intro, then about 35 mins coding) and was asked 2 questions.

1. Given a nums array consisting of single digit numbers from 0-9 and another integer K, return the max sum that can be obtained by using K numbers from the nums array.

2. Balance a Binary search Tree.

Solved both of them optimally.
Rejected after 2 weeks.

YOE - MS with 4 years