Had PS for E4 role USA.\nQ1: Tarverse charecters in 2D array in reverse diagonal. Variant of [490](https://leetcode.com/problems/diagonal-traverse)\nQ2: Check if binary tree is complete [598](https://leetcode.com/problems/check-completeness-of-a-binary-tree)\n\nSolved Q1 easily and Q2 after a while, didnt think of parent and children id relation immediately and used col number for all levels and verified that with increasing sequence and level size. Works well but definitely could be optimized to O(n) then klogn. I got cold feet I guess.\n\nHope for the best!!

Had PS for E4 role USA.\nQ1: Tarverse charecters in 2D array in reverse diagonal. Variant of 490\nQ2: Check if binary tree is complete 598\n\nSolved Q1 easily a