SDE - Intern

You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. You have to colour this graph in two different colours, say blue and red such that no two vertices connected by an edge are of the same colour.

Note :

The given graph may have connected components.

Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given input. He needs your help to solve this problem.

If two or more elements contend for the maximum frequency, return the element which occurs in the array first i.e. whose index is lowest.

For example,

For 'arr' = [ 1, 2, 3, 1, 2]. you need to return 1.

Explain deadlock and its conditions. 
What is synchronization?
What is paging?
Semaphore vs Mutex

How did you make this project and what technologies you use?
Any challenges you've overcome in the last few months?
Why Walmart?
How do you approach a problem statement?
How do you design a system?
Any time when you showed leadership?