SDE - 1

Ninja decided to visit the new Buffet Restaurant in the neighbourhood. There are a total of ‘N’ different dishes, numbered ‘0 to N-1’. But there is a restriction. The ninja cannot make orders on his own will. There are ‘M’ types of orders that he can make. Each Order ‘i’ consists of three values represented by array ‘C’, ‘L’ and ‘R’, which means Ninja can order all dishes numbered ‘L’ to ‘R’ with the cost of ‘C’ Ninja currency.

Ninja wants to taste all ‘N’ dishes, but he wants to spend the minimum amount of Ninja Currency.

Can you help Ninja figure out the minimum amount of Ninja Currency he needs to spend to taste all dishes.

You can assume that for given constraints, answers always exist.

Example :

N = 4
M = 3
A = [ [ 0, 2, 1 ] , [ 1, 2, 4 ] , [ 2, 3, 3 ] ]

If Ninja chooses [ 0, 2, 1 ] and [ 2, 3, 3 ], he can taste each dish for 4 Ninja Currency.

You are given a Binary Tree.

Return the length of the diameter of the tree.

Note :

The diameter of a binary tree is the length of the longest path between any two end nodes in a tree.

The number of edges between two nodes represents the length of the path between them.

Example :

Input: Consider the given binary tree:

Output: 6

Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.

Design Zomato kind of Food App

Questions on arrays, datastructure then Mutithreading questions were there

What keeps you motivated?

Who is your role model?