Facebook (Phone Screening)| Research Scientist, Machine Learning (Ph.D) | Seattle, Menlo Park, NYC| September 2021 \nStatus: CS, Ph.D Student\n\n**Technical Phone  Screening**: \n\t\t1.  Similar to [pick index with weight](https://leetcode.com/problems/random-pick-with-weight/)\n\t\t2.  Similar to [minimum window substring](https://leetcode.com/problems/minimum-window-substring/)\n\n\nDid not solved the first one optimally, solved the second one optimally. The interviewer was very friendly and tried to make me unstack inthe first one. The second one I solved optimally in a very short amount of time.\n\nFrom what I understood, interviewers want to see how you will respond in a problem you have not seen and not necessarily in a problem you might have already seen.\nBy the time of the screening I had done around 230 LC problems around 40% Easy, 50% medium and 10% hard.\n\nI would say complete the facebook card and the top facebook problems.\nCheers!\nIf you find this post helpfull please upvote, I wil answer in as amny questions as I can!\n\n\n\n

Facebook (Phone Screening)| Research Scientist, Machine Learning (Ph.D) | Seattle, Menlo Park, NYC| September 2021 \nStatus: CS, Ph.D Student\n\nTechnical Phone