Online Assessment

An 80-Minute OA with Tree Distances and Django Debugging

IBMSoftware Engineer · Online Assessment · Aug 2026

IBM's OA was unproctored. Here are a few pitfalls to watch out for: Q1: Tree Pythagorean Triples The problem: Given a tree and three fixed vertices x, y, z, count the vertices whose distances to those three vertices, sorted as a ≤ b ≤ c, form a Pythagorean triple: a² + b² = c², with all three distances positive integers. My approach: Run BFS or DFS once from each of x, y, z, record the distances…

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