Data Engineer-Intern

Given an array arr of size N containing positive and negative integers. Arrange the array alternatively such that every non-negative integer is followed by a negative integer and vice-versa.

Note:

The number of positive integers and negative integers may not be equal. In such cases, add the extra integers at the end.

For Example:

For array {4, -9, -2, 6, -8}, the output will be {-9, 4, -2, 6, -8}

For array {1, 2, 3, -5}, the output will be {-5, 1, 2, 3}   

Given two unsorted arrays of non-negative integers, 'arr1' and 'arr2' of size 'N' and 'M', respectively. Your task is to find the pair of elements (one from each array), such that their absolute (non-negative) difference is the smallest, and return the difference.

Example :

N = 3, arr1 = [10, 20, 30]
M = 2, arr2 = [17, 15]
The smallest difference pair is (20, 17) with an absolute difference of 3. So, the answer is 3.

Note :

Both the arrays are unsorted, and all array elements are non-negative integers.

Explain how and where did I use the DBMS concept while making my project.
Asked me about Normalization, the difference between trigger and cursors, the difference between N-RDBMS and RDBMS, types of joins, what are primary key and composite key? what is indexing?
The last question of this interview was a scenario-based question where he gave me a table and asked me to fetch a piece of specific information.(it used self join concept)

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

Fibonacci number is calculated using the following formula:

F(n) = F(n-1) + F(n-2), 
Where, F(1) = F(2) = 1.

For Example:

For ‘N’ = 5, the output will be 5.

Why do we need OOP? Properties of OOP in depth with examples, Polymorphism types, Friend Function, Binding.

What is malloc? Any alternative of malloc in C++ (“new” keyword), what is new? What is using namespace std? What is dynamic memory allocation? what is heap and stack memory and where are they located?

What are Greedy Algorithms? What is Dynamic Programming? What is a quick sort? What is Merge sort? Which is more efficient among both and in which case? DFS vs BFS, in which case do we use stack? What is level order traversal?

Meanwhile, he went through my resume where I had mentioned my Deep Learning project, he asked me about the difference between machine learning and deep learning, what are activation functions, what is vanishing gradient problems, what is leaky-ReLU. Lastly, he asked: "Since you have done most of your projects on Deep Learning, what if we assign you work related to Full-Stack Development? "

The last question of this interview was a scenario-based question where he gave me a table and asked me to fetch a piece of specific information. Initially, I explained to him my approach ( hoping to get away with this like last time, but this time I wasn’t that lucky xD), I started writing the query and committed an error but the interviewer knew my approach was correct so he assisted me a little and lastly he was satisfied with my code. ( Basically, it used the Self-Join concept)

HR round tests how well you communicate your thoughts and present yourself.
This round started with the usual tell me about yourself question. She then asked me about my previous work experience and my role in that team (even if you haven’t had any prior work experience it won’t make any much difference ) continuing to this she asked me about my low moments (if any) working for that organization and how did I manage to overcome that. She then asked me why do I want to join a FinTech company though I had worked in the field of AI and robotics till now. Will you be satisfied with any development roles which will not be of your choice?
She then asked me about the hackathon experience which I had mentioned in my CV and asked me about my role in making that project. She asked me where did we lose out in the final round of that hackathon and the learning I got from that.
Lastly, she wished me with a bright smile and asked me to give it another try for that hackathon.