Problem of the day

Login

New update is available. Click here to update.

All Problems

Problem title

Difficulty

Avg time to solve

SQL Practice

Easy

--

Running Median

Hard

46 mins

Rotting Oranges

Moderate

20 mins

Reverse Level Order Traversal

Moderate

30 mins

Subtree of Another Tree

Easy

10 mins

Compare Version Numbers

Easy

10 mins

Circularly Linked

Easy

15 mins

Print Reverse LinkedList

Easy

15 mins

Sorted Matrix

Moderate

25 mins

Diagonal Sum

Easy

23 mins

Problem

Submissions

```
Example :
For the given binary tree :
```

```
Output : 24 14 2
Explanation: Rightmost diagonal contains elements {5, 10 , 9} its sum is 24, middle diagonal contains elements {6, 3, 5} its sum is 14, leftmost diagonal contains elements {2}. Thus the answer should be “24 14 2”.
```

Detailed explanation ( Input/output format, Notes, Constraints, Images )

```
The only line of the test case contains elements in the level order form. The line consists of values of nodes separated by a single space. In case a node is null, we take -1 on its place.
For example, the input for the tree depicted in the below image would be :
```

```
1
2 3
4 -1 5 6
-1 7 -1 -1 -1 -1
-1 -1
```

```
Level 1 :
The root node of the tree is 1
Level 2 :
Left child of 1 = 2
Right child of 1 = 3
Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6
Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)
Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)
The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null (-1).
```

```
The above format was just to provide clarity on how the input is formed for a given tree.
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
```

```
Print the only line of output will contain a list containing diagonal sums from right diagonal to left diagonal.
```

```
You are not required to print the output explicitly, it has already been taken care of. Just implement the function.
```

```
0 <= N <= 10^5
0 <= node.data <= 10^9
Time Limit : 1 sec
```

```
1 2 3 -1 4 4 -1 -1 5 6 -1 -1 -1 -1 -1
```

```
4 15 6
```

```
The input binary tree will be represented as
```

```
From the above representation, the rightmost diagonal contains elements {1, 3}, the middle diagonal contains elements {2, 4, 4, 5} and leftmost diagonal elements are {6}. Thus the list should contain “4 15 6”.
```

```
1 2 3 -1 -1 -1 -1
```

```
4 2
```

Java (SE 1.8)

Console

Change Theme

Full Screen Mode

Solution submission not allowed

Reset Code