There was a test first which contained Aptitude, oops, and data structure questions in MCQ format. Also, 3 coding problems were there
1 . Diagonal Traversal of Matrix
2. String match and increment decrement related.
3. BST shortest node.
The questions were very difficult apart from the coding problems.

Then there was an interview over Google meet.
1. Algorithm Design Techniques (like Greedy Technique)
2. What method to use to combine two sorted arrays and its time complexity.
3. Method to remove duplicates from an array and its time complexity.
4. Psuedo code to find numbers in an array and their multiples, when found we need to print certain strings, code should be written such that we can choose any count of numbers and multiples respectively.
5. Abstraction, Encapsulation.
6. Difference between abstract class and interface.
7. Normalization
8. Anomalies.
9. Effect of anomalies on updation and deletion

Question

There was a test first which contained Aptitude, oops, and data structure questions in MCQ format. Also, 3 coding problems were there
1 . Diagonal Traversal of Matrix
2. String match and increment decrement related.
3. BST shortest node.
The questions were very difficult apart from the coding problems.

Then there was an interview over Google meet.
1. Algorithm Design Techniques (like Greedy Technique)
2. What method to use to combine two sorted arrays and its time complexity.
3.  Method to remove duplicates from an array and its time complexity.
4. Psuedo code to find numbers in an array and their multiples, when found we need to print certain strings, code should be written such that we can choose any count of numbers and multiples respectively.
5. Abstraction, Encapsulation.
6. Difference between abstract class and interface.
7.  Normalization
8. Anomalies.
9. Effect of anomalies on updation and deletion

Sigiloso · Accepted Answer

I answered them quite well

SourceFuse

Pergunta de entrevista da empresa SourceFuse

Resposta da entrevista

Empresas seguidas

Buscas de vagas