YOE: 3\nLocation: London\n\nI was asked 2 questions in a 45 Minute phone screening round.\n\nQuestion 1 was similar to https://leetcode.com/problems/valid-palindrome/ \nAfter coding the solution we had some more discussion on space and time optimization. He also asked if the string cannot fit in the memory of 1 system, how will I modify my approach?\n\nQuestion 2 was similar to https://leetcode.com/problems/clone-graph/ \nIt had an adjacency list like input and required a similar output. After proposing a solution he asked me to code it. We discussed various kinds of test cases against which the code should be tested. Further, we discussed the time complexity in for disconnected and connected graphs.\n\nI got the feedback email in an hour. Will have an onsite in a few weeks.\n\nadding details about my later rounds: https://leetcode.com/discuss/interview-experience/892893/facebook-e4-london-sept-20-offer/731256

YOE: 3\nLocation: London\n\nI was asked 2 questions in a 45 Minute phone screening round.\n\nQuestion 1 was similar to https://leetcode.com/problems/valid-palin