Samsung Research Research and Development Interview Questions and Answers

One coding question from dynamic programming

Q1. Segment tree maximum/minimum
Add your answer
Q2. Binary lifting ancestors problem
Ans. 
Binary lifting ancestors problem involves finding the k-th ancestor of a node in a binary tree efficiently.
• Binary lifting is a technique used to find ancestors in a binary tree.

• It involves precomputing the ancestors of each node using dynamic programming.

• The k-th ancestor of a node can be found by repeatedly jumping up the tree in powers of 2.

• Example: Given a binary tree with nodes 1, 2, 3, 4, 5, 6, 7, the 2nd ancestor
Answered by AI
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Why we hire you?
Add your answer