I got asked the following:

https://leetcode.com/problems/valid-palindrome-ii/description/?envType=company&envId=facebook&favoriteSlug=facebook-thirty-days

• Follow up: was asked how I would modify this if we were allowed to make n modifications
• asked what test cases I would use to test this
• time and space complexity

https://leetcode.com/problems/top-k-frequent-elements/description/

• followup: same as the follow up in the leetcode question aka "Your algorithm's time complexity must be better than O(n log n), where n is the array's size."
• specifically asked about the n == k case and how we can solve this problem to make it better than nlogn for that case

I got tripped up on the follow up for the second question, I think I did everything else well. Will update this post to see if I passed, really hope I did

Update: passed!