The OA had two problems: one required implementing BFS, likely involving graph traversal, shortest path, or level-order processing. The other was related to binary trees, possibly dealing with traversal, recursion, or tree modifications like lowest common ancestor or subtree calculations. Both were quite challenging, requiring efficient algorithms and strong problem-solving skills.