SDE - 1

Which one of the following is the process of inserting an element in the stack?

a. Insert
b. Add
c. Push
d. None of the above

Which data structure is mainly used for implementing the recursive algorithm?

a. Queue
b. Stack
c. Binary tree
d. Linked list

Which data structure is required to convert the infix to prefix notation?

a. Stack
b. Linked list
c. Binary tree
d. Queue

Imagine a group of people meeting each other for the first time, and in keeping with protocol, each person must greet and elbow bump every other person once.
If there were seven people in the group, how many elbow bumps would occur in total?
Also outline, as a short note in the comment section, the process you used to come to this conclusion.

We were given 3 topics to choose from and do a full stack project on the topic.
Face Recognition
Develop a browser-based application or a native mobile application to demonstrate the application of Face Recognition technology.
Data Analysis
Develop an application to demonstrate how the Automotive Industry could harness data to take informed decisions.
Algorithms
Demonstrate through your app the different kinds of algorithms that a web-streaming app (like Netflix) or an audio-streaming app (like Spotify) may use for their Recommendation Engine.

Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may have to assume that ‘ARR1’ has a size equal to ‘M’ + ‘N’ such that ‘ARR1’ has enough space to add all the elements of ‘ARR2’ in ‘ARR1’.

For example:

‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’. 
‘ARR1’ = [3 4 6 9 10]

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.