Virtual onsite consisted of 2 coding rounds and one behaviorial. 2 LC for each coding round.

Problems:

1st round:

543:
https://leetcode.com/problems/diameter-of-binary-tree/description/

498 (very annoying question if I were to do it for the first time but luckily I did it before):
https://leetcode.com/problems/diagonal-traverse/description/

Pretty much everything went perfectly this round, I'd say Hire/Strong Hire

2nd round:

Slightly modified 77 [NOT TAGGED] (instead of n, you're given a list of numbers):
https://leetcode.com/problems/combinations/

Easier version of 23 (the lists are normal lists instead of LL):
https://leetcode.com/problems/merge-k-sorted-lists/description/

'First question went well. The second question tripped me up (I originally misread the part about it being normal lists but corrected myself before I started coding), don't actually know if my final solution had any bugs (it's a pretty long solution and it was my last interview and I was tired). Self assessment: Lean Hire/Hire

YOE: 1yr
Comp: 140|33|14

Hope this post ends up helping whoever is currently preparing for a Meta interview. My best general tip is to first talk through the solution you are planning to implement and getting the OK from the interviewer instead of just coding immediately. Good luck everyone!