Hey guys,\n\n\nPhone screen (Oct 3rd week)\n\n\ntree traversal - similar to boundary of tree\narray traversal - similar to minimum subarray k sum\nAced - move to onsite - got back in ~5 days.\n\n\nOnsite (Nov 3rd week)\n\n\ntopological sort\nbfs traversal - similar to rotten oranges\nnext permutation (interviewer asked if the solution would work for all cases - found the case it would not work for and updated the solution) - used O(N) space which he did not say anything about but he was satisified I figured and got a working solution.\nbinary search application on string generation\nSolved all questions shared examples and interviewers were happy with them.\n\n\nBehavioral - smooth - had stories ready for everything. Most chill interviewer I saw at Meta.\n\n\nML Sys design - kinda screwed in a few parts - the interviewer kept coming back to a part of the system in ML modeling and I did not have a good response to it.\nThe only thing that went not as expected.\n\n\nCan someone share what they think - or have seen / heard a similar situation happen to someon else?

Hey guys,\n\n\nPhone screen (Oct 3rd week)\n\n\ntree traversal - similar to boundary of tree\narray traversal - similar to minimum subarray k sum\nAced - move t