123Movies TADKA Interview Questions and Answers

LCA of a binary tree is the lowest common ancestor of two nodes in the tree.

• Traverse the tree from the root node to find the paths from root to the two given nodes.

• Compare the paths to find the last common node, which is the LCA.

• Use recursion to solve the problem efficiently.

• Handle edge cases like if one of the nodes is the ancestor of the other.

Swift was chosen for its performance, native iOS support, and better integration with Apple's ecosystem.

• Swift offers better performance compared to React Native due to its native code execution.

• Swift provides seamless integration with Apple's ecosystem, allowing for better utilization of iOS features.

• Swift is the preferred choice for developing iOS apps as it is the native language for iOS development.

• React Native may have limitations in accessing certain iOS features or APIs...read more

Observable in Swift is a property wrapper that allows for automatic notifications when the value changes.

• Observable is a property wrapper introduced in Swift 5.1.

• It can be used with any property that needs to be observed for changes.

• When the value of the property changes, any views using that property will be automatically updated.

• Example: @Published var score: Int = 0

Depth first search in tree is implemented using recursion to explore each branch fully before moving to the next.

• Start at the root node and recursively visit each child node before moving to the next sibling node.

• Use a stack to keep track of nodes to visit, pushing children onto the stack before siblings.

• Base case is when the current node is null or a leaf node, then backtrack to the parent node.