New Grad SWE interview NYC
Phone interview was in November 2020

Phone Interview -

1. https://leetcode.com/problems/populating-next-right-pointers-in-each-node/
2. Given a linked list with 2 extra pointers backward and forward, return a boolean if the linked list is valid. A valid LL is when the backward pointer points to a node before it and the forward pointer points to a node after it.

Virtual onsite was in December 2020
1st Interview -

1. https://leetcode.com/problems/min-stack/
2. Given a collection of intervals, return a maximal set of non-overlapping intervals while prioritising the longer intervals.

2nd Interview-

1. https://leetcode.com/problems/all-paths-from-source-to-target/ [The given graph can have cycles though]
2. https://leetcode.com/problems/valid-parentheses/

I didn't pass the onsite. Solved the min stack question optimally, needed a hint in the intervals question. Solved the graph question with a small hint for managing cycles.