Katkat
Technical Screen

Hexadecimal AND and Binary Tree Recursion

Akuna CapitalSoftware Engineer · Technical Screen · Aug 2026

This technical interview mainly covered C++ fundamentals, bitwise operations, binary-tree recursion, and dynamic memory management. The questions themselves were not difficult, but there was a strong focus on pointer use, boundary conditions, and low-level implementation details. Bitwise Operation Question: Calculate: Convert both hexadecimal values to binary: After applying the bitwise AND: Ther…

Shared by a candidate · reported Aug 2026. Interview formats change; use it as a guide, not a script.