SDE - 1

You are given two binary trees with 'n' and 'm' nodes respectively.

You need to return true if the two trees are identical. Otherwise, return false.

Example:

For the trees given below:- 

The given trees are identical as:-
1. The number of nodes in both trees is the same. 
2. The number of edges in both trees is the same. 
3. The data for root for both the trees is the same i.e 5. 
4. The data of root -> left (root’s left child) for both the trees is the same i.e 2.
5. The data of root -> right (root’s right child) for both the trees is the same i.e 3.
6. The data of root -> right -> left ( left child of root’s right child) for both the trees is the same i.e 6.
7. Nodes with data 2 and 6 are the leaf nodes for both the binary trees. 

Ninja loves playing with numbers. So his friend gives him an array on his birthday. The array consists of positive and negative integers. Now Ninja is interested in finding the length of the longest subarray whose sum is zero.

How will you design an ecommerce application and how ill you scale it.
What is horizontal scaling, vertical scaling, consistent hashing, CDNs,
How microservices interact within a system ?
Kafka ?
Redis ?
Kubernatis