Remove adjacent duplicates and handle tree input
Company: Grammarly
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Quick Answer: This question evaluates string-processing and tree-construction skills, including efficient removal of adjacent or k-sized duplicate groups in strings and building a binary tree from a level-order array to compute properties such as the sum of left leaves.