Software Engineer · Phone Screen · Coding

[ OK ] 2e388a0a-be55-4a4c-88f8-7547915a1cb0 — full writeup

[ INFO ] category: Behavioral · Coding difficulty: 4 freq: first seen: 2026-03-19

[4][CODING]Binary TreeDynamic Programming

$ cat problem.md

Microsoft — Software Engineer

Level: Unknown Level

Round: Phone Screen · Type: Coding · Difficulty: 4/10 · Duration: 60 min · Interviewer: Neutral

Topics: Binary Tree, Dynamic Programming

Location: Seattle, WA, US

Interview date: 2025-12-21

I was first grilled on my project for half an hour. Then I was given two coding questions.

I was asked to implement the following two questions:

Flip and print a binary tree.
Find the longest palindromic subsequence. Due to time constraints, the interviewer said I didn't need to provide the optimal solution, just a working solution.

user@intervues:~/experiences/microsoft$