**Company:** Adobe\n**Role:** PPI & Internship\n**Exam:** Online Assessment\n\n### **Question 1:** \n\nGiven a tree with n nodes and n-1 edges. Each node in the tree has a weight assigned to it. The value of the tree is determined by adding up the weights of all the nodes in the tree. The **weight** of the **i-th node** is **i**.\n\nYour task is to divide the tree into two separate trees by removing one of the edges. The goal is to find the best way to split the tree so that the absolute difference in values between the two resulting trees is as small as possible. Find the minimum difference of the values of the two trees after splitting the original tree.\n\nNote: Given n and two arrays A and B. A and B have size of n-1, and there exists an edge between A[i] and B[i].\n\n**Constraints:**  \n* 1 <= *n* <= 10^5\n* 1 <= *A[i], B[i]* <= n\n* *A[i]* & *B[i]* form edges of a tree.\n\n**Example 1:**  \n\nInput: n = 3, A = {1, 1} B = {2, 3}\nOutput: 0\n\n**Explaination** - \nYou can remove the edge between 1 and 3 to get the minimum difference.\n\n**Example 2:**  \n\nInput: n = 4, A = {1, 1, 1} B = {2, 3, 4}\nOutput: 2\n\n**Explaination** - \nYou can remove the edge between 1 and  to get the minimum difference.\n\n\n\n\n### **Question 2:** \n\n**Geek** being the brightest student of the class is given the task to solve **n** puzzles by his teacher in minimum possible time. The puzzles are numbered from **1** to **n** and he has to complete them in the **order** of their numbers. Geek can solve a puzzle in two ways either solve on his **own** or he can **copy** from his book. As Geek is busy these days so now he has asked help from you to calculate the **minimum** possible time in which he can solve **all puzzles** in the order of their numbers. For you to do this task he has provided an array of integers **time[]** of size **n** where **time[i]** tells the time geek would have taken to solve the ith puzzle on his **own**. Also he gave you integer array **search[]** of size **n** where **search[i]** represents the time geek will to take search **ith** puzzle in his book and when geek does search for **ith** puzzle he also gets to know answer for the **next k** puzzles **(including the ith puzzle)** if **less than k puzzles after i exist than he gets answers of all remaining puzzles including i also**. After the search he can directly jump to any puzzle **(i+j)th** where **1-j<=min(k,n-i)** by copying answers of all puzzles from index **i** to **(i+j-1)**. It is **not** necessary for Geek to copy all **k** puzzles after **i** when he searched in the book for **ith puzzle**. So you have to determine the **minimum time** geek will take to solve all puzzles.\n\nNote: Copying answers does not take any time and It is **not** necessary for Geek to copy all k puzzles\n\n**Constraints:**  \n* 1 <= *n* <= 10^3\n* 1 <= *k* <= n\n* 1 <= *time[i]* <= 10^5\n* 1 <= *search[i]* <= 10^5\n\n**Example 1:**  \n\nInput: n = 4, k = 2, time = {3, 1, 8, 7}, search = {4, 4, 6, 2}\nOutput: 9\n\n**Explaination** - \nOptimal way to solve all puzzles is to solve puzzle 1 on your own that will take 3 mins and than we can search for puzzle 2 in book that will take 4 unit of time and also by doing this search we will also to know answer for puzzle 3 also which we can directly copy. Now again for puzzle 4 we can just search and copy the answer. So total it takes 3+4+2 total of 9 mins to complete all puzzles.\n\n**Example 2:**  \n\nInput: n = 3, k = 1, time = {1, 2, 2}, search = {4, 6, 6}\nOutput: 5\n\n**Explaination** - \nIt is Optimal to solve all the problems on your own. So answer is (1+2+2) = 5.\n\n\nIf there are any doubts or corrections, please let me know.\n\n\n

Company: Adobe\nRole: PPI & Internship\nExam: Online Assessment\n\n### Question 1: \n\nGiven a tree with n nodes and n-1 edges. Each node in the tree has a weig