Meta E4 Screening Interview

Round 1

Questions: I got asked the following:

1. Valid Palindrome II

   • Follow up: How would I modify this if we were allowed to make n modifications?
   • What test cases would I use to test this?
   • Time and space complexity.

2. Top K Frequent Elements

   • Follow up: 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 n log n for that case.