trees Interview Questions

This Databricks interview question challenges you to build a relational query plan optimizer capable of executing predicate pushdown transformations. You will work with a tree structure of query operators like scans, filters, and joins, ensuring that rewritten plans remain fully evaluable and semantically correct. This advanced problem evaluates deep architectural thinking, AST manipulation, and optimization theory. Access to the complete problem description and an optimal model solution requires a subscription.

Finding the longest possible distance between any pair of nodes in a hierarchical network is the focus of this graph theory challenge featured in Verkada interviews. You are tasked with analyzing an acyclic connected structure to determine its maximum span, which may not necessarily cross the central vertex. This problem tests your proficiency with recursive graph traversals, tree properties, and path optimization techniques. The complete problem statement, test cases, and a comprehensive model solution are available exclusively with a subscription.

Reported as a Google interview question, this scenario explores genealogical data where every individual maintains a direct pointer to their antecedent. Given two separate starting members, your task is to pinpoint the exact point where their lineage paths converge toward the root origin. This problem evaluates your graph traversal capabilities, pointer manipulation techniques, and your ability to reason about hierarchical relationships. Gain access to the full problem text, test suites, and expert-written solution by purchasing a subscription.