Question asked in Google online coding challenge on 22nd AUG, 2020.

Please help me with this question.

You are given a tree with N nodes numbered 1 to N. Each node is having weight Ai. (1 <= i <= N)

Find the maximum path sum between any two node u and v of the tree. Return the maximum path sum value. constraints:

1 <= T <= 10
1 <= N <= 1e4
-1e6 <= Ai <= +1e6

Example:

Rev.	By	When	Δ	Comment
en3	vrkorat211	2020-08-23 11:48:59	14	Tiny change: 'e coding competition on 22nd A' -> 'e coding challenge on 22nd A'
en2	vrkorat211	2020-08-23 11:47:58	16
en1	vrkorat211	2020-08-23 11:46:18	781	Initial revision (published)

Rev.

Lang.

When

Comment

en3

2020-08-23 11:48:59

Tiny change: 'e coding competition on 22nd A' -> 'e coding challenge on 22nd A'

en2

2020-08-23 11:47:58

en1

2020-08-23 11:46:18

781

Initial revision (published)