Microsoft rounds often ask string and tree problems where careful index handling decides whether your code is correct. Longest palindromic substring tests exactly this, because you must handle both odd and even centres without going out of bounds. Use the expand-around-centre idea when you need O(1) extra space instead of an n × n DP table. Forgetting even-length palindromes like "bb" is the most common bug interviewers look for.