1. Online Test : - duration(90 minutes) - 10 MCQS(dbms,OS,DS,OOPS) and 3 coding questions.
i. Find the elements in an array whose occurrence is more than N/3 times.
ii. A matrix is given having 0 and 1 find that one cell which we can change from 0 to 1 in order to increase our area consists of cells having 1.
iii. A Binary tree is given we have to find the maximum sum of the nodes but it can't be having parent-child relationships.
2. Technical round 1(30 minutes): - 1. tell me about yourself
2. what is object oriented programming
3. encapsulation
4. abstraction
5. can we override method from abstract class
6. ques did in test & optimize it
7. Q1: How many time N occurs N times continuously
a = [1,2,3,4,2,2,4,5,6,6,6,6,6,6,6,8,9,0,1]
N= 6
Output = 2
2. Technical Round 2 (1 hour)- 1 brief intro
2 explain project
3 Coding ques: - I love india. it is my country.
I love my country. It is India.
Output - Return :- True
Check the number of occurrences of words in both the sentence is equal or not.
4. Missing and repeated elements in the array
5. Deadlock
6. TCP/IP
7. BCNF
3. Technical round 3 (30 minutes)- It was the same as previous rounds DBMS, CN, OS, OOPS were asked and one coding ques were asked which was based upon the KMP pattern matching algorithm.
4. HR round: - it was 15 min round more of a formality no elimination was there.
