← Microsoft questions

Delete m nodes after n, sum logic, infix expression, trim BST

Filed under Microsoft

Solve multiple algorithmic tasks: delete M nodes after N nodes in a linked list, format number sums based on digit counts, evaluate an infix expression, and trim a BST.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.