I had phone screen with FB , after that I got feedback that they want to have following interview

1- phone screen
given an array of numbers and a sum k find if there is a continuous numbers that sum to k
was easy quesiton that i solved it

2- second phone screen

• add two binary
• validate BST
• create data structure which has add and remove method with only use array.

questions was easy , only last is tricky in remove you don't need to shift the array just swip with the last element with removed element and reduse the array size

• I got rejected because they need higher level