Meta Phone Screen | E5

I recently completed a phone screen interview for a Software Engineer position at Meta.

The interviewer presented two coding challenges:

1. Given two strings, pattern = f36 and s = focus, determine if the pattern is a valid abbreviation of the string. This is similar to the problem "Valid Word Abbreviation". I provided an optimal solution.
2. Given a sorted array and a target value, find the number of occurrences of the target. For example, target = 1, arr = [0,1,1,2,2,3]. I initially used a brute-force approach but discussed the optimal binary search approach with the interviewer, explaining how to search the left and right sides of the array. I believe I covered approximately 80% of the optimal solution.

Overall, I felt the interview went well.