Position: E4
Location: London

Round Summary
Got 2 coding questions in my interview:

1. Valid Word Abbreviation
   https://leetcode.com/problems/valid-word-abbreviation/description/

   • Spent most of the time (~30 mins) on this one.
   • Interviewer asked me to list all possible test cases — I gave several, but missed the case with a 0 in the abbreviation. He pointed it out, and I updated my code to handle it.

   Not sure if missing it initially will count against me.

2. Pow(x, n)
   https://leetcode.com/problems/powx-n/description/

   • This was given when very little time was left, so I was a bit nervous.
   • I first explained the brute force approach, then moved on to the O(log n) optimized approach.
   • Got slightly confused while discussing space complexity.

Given this performance, what do you think my chances are of clearing this round?

Update: Passed