Flipkart OA Coding Round | Path Concatenation & Carrot Collection Logic | Recent Online Assessment 2025 | Binary Tree Sum & Matrix Optimization | Latest Flipkart Placement Questions

Question 1: Path Concatenation Sum in a Binary Tree Problem Statement: Consider a binary tree with N nodes (1 Root and N-1 descendants). Each node, X is related to the Root by some relations such as L, R, LL, LR... and so on, where X is left (L) to Root or left-left (LL) or right-left (RL) to Root and so on. Perform the following operations to find the value of Sum. If the given tree has M leaf nodes, there ...