**First Phone screen**\nQ1. ```Minor variation of Verify a binary tree is BST.``` Variation --> It allowed nodes with equals values as well in left and right tree.\n\nExplained approach and coded optimal solution\nWorst mistake - told the incorrect time complexity. May be in interview nervousness or anxiety.\nThough this was easy question for me, I unnecessarily wasted extra time here and didn\u2019t pay attention to clock.\n\nQ2. ```Write to method to move words in place in char array in java (my coding language). e.g. \n\u201CDog bites man\u201D.   \u2014> \u201CMan bites dog\u201D. ```\n\nAfter some struggle early and interviewer hint (how about reverse the entire array first)\nI explained reverse array first and then two pointer approach by swap word encoutering space etc..\n15 min left. Asked me could you code it quickly. In next 10 min, I could complete almost 80% with a minor bug with quick dry on the way before he stopped for follow up question.\n\n\n**Outcome**  ***second phone screen.*** \nI was expecting rejecting but they asked me one of follow up screen as recruiter said interviewer couldn\u2019t get enough signal for virtual onsite round\nScheduled second one in 2 weeks.\nIn the meantime I revised questions and doing some FB top questions and questions from recent FB interview exp. post.\nBased on people feedback I didn\u2019t pay much focus on FB tagged hard question.\n\n**Second Phone screen**\nInterviewer asked me to tell if I have seen the question in the very beginning of the interview.\n\nQ1. ```Minor variation of Verifying an alien dictionary to find if words are sorted based on pattern``` (Pattern was char array not string. That\u2019s only variation)\nI know and told her this looks like that. Asked approach, explained. Moved to next question in next min.\n\nQ2. Flipped the first question into ```Alien Dictionary (LC Hard) to find the pattern if given words are sorted```\nI realized the end here. I have seen it once and wasn\u2019t expecting a LC hard.\nAfter discussing test data and cases, I explained the approach a bit. Use map, built edges and then BFS/DFS and find the order etc.\nAsked to code.\nI could complete around 70% code a minor bug by the time she asked me stop. no hint from interviewer this time.\n\n**Outcome** - ***rejection***\n\nFB Recruiter was amazing nice person I have seen.\nSent me do\u2019s and don\u2019t instructions, sending good luck email on the interview day and motivating for apply again saying a lots of engineers are selected in 2nd or 3 rd attempt.\n\n\nFB coding questions seems very much predictable about the FB tagged questions and you should do all recent FB tagged hard question as well (at least from FB top 50).\nSome hard question are almost impossible to in real interview if you hadn\u2019t seen them.\n\n\nI hope my experience help other.\n\nThanks

First Phone screen\nQ1. Minor variation of Verify a binary tree is BST. Variation --> It allowed nodes with equals values as well in left and right tree.\n\nExp