Wanted to give back for everything this community gave me so far. Here is my 2 cents.
SWE role for L4 positions. 4 YOE.

**Phone Interview: **
Question 1:
https://leetcode.com/problems/binary-tree-level-order-traversal/
This question but instead of binary tree, it is an n-ary tree.

Question 2:
https://leetcode.com/problems/find-original-array-from-doubled-array/

Virtual Onsite:
Interview 1: variation of merge intervals:
https://leetcode.com/problems/merge-intervals/https://leetcode.com/problems/merge-intervals/

Interview 2: variation of this:
https://leetcode.com/problems/time-based-key-value-store/

Interview 3: Topological Sort?
Evaluate a file path. Given " /usr/bin/$HOME/$TMP/somefile.txt", evaluate and find the actual path. So if $HOMEand$TMP were stored in a hashmap already. $HOME="username"and$TMP could be equal to "$PRIVATE/name".And$PRIVATE is "tmpfolder". The final return should be the actual path "/usr/bin/username/tmpfolder/somefile.txt"

Interview 4: Given a list of places you can visit, each place has some money you can collect. There is a list of connections between each place. Without revisiting the same place, maximize the money you can collect visiting up to only 4 places in total.