Our team participated in Amazon Hackon24. Based on our performance, I received links for Online Assessments. After qualifying those, I reached the interview stage.

The first OA had:

• Two coding questions (easy)
• Sixty MCQ questions covering DBMS, Computer Organization, Aptitude, and Computer Networks.

The second OA had two questions: one easy and one medium.

One complete Binary tree is there. The root node has a value of 1.

The value of the first node in a level is 1 + the value of the last node in the previous level.

The value of the first node in a level is 1 + the value of the previous node in the same level.

You are given a target x. You have to find whether the value x is present or not in the tree. If it is present, find the path to it starting from the root node. If not present, return an empty array.

Example: X = 10; {1, 2, 5, 10} X = 10; {}