I interviewed for Software Engineer, University Grad Position\n\n**Phone Screen**\n1. [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)\n2. [Subarray Sum](https://leetcode.com/problems/subarray-sum-equals-k/) \n\n\n**Onsite** \n\nRound 1 :\n1. [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)\n2. Variation of [Find Peak Element](https://leetcode.com/problems/find-peak-element/), Find Local Minima instead\n\nRound 2:\n1. [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)\nFollow up : [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)\n\n2. [Next Permutation](https://leetcode.com/problems/next-permutation/)\n\nBehavorial Round :\n\n1. Time when you had a great day at work ?\n2. Time when you worked on an ambiguous Project ?\n3. Time when you had less time to finish a task? \n4. Time when you received a negative feedback ? \n5. Time when you worked with a difficult person ?\n\n\nMy self assessment for Reject : My coding went all. Solved all optimally because I have solved these questions previously. I think behavioral costed me, Although I presented in STAR format, I felt I should have presented more actionable items focussing around the facebook core values.

I interviewed for Software Engineer, University Grad Position\n\nPhone Screen\n1. Binary Tree Vertical Order Traversal\n2. Subarray Sum \n\n\nOnsite \n\nRound 1