Round 1: Virtual online test: 4 coding questions and 1 SQL Query.
- Almost equivalent strings (easy)
- Maximum Gap (medium)
- Nearest neighboring cities (easy)
- Palindromic Subsequence (hard)
- An SQL query (easy – medium level)
Around 300 students gave the test and 35 were shortlisted for the interview. There were 3 rounds of interviews, 2 technical and 1 HR.
Round 1: 2 coding questions, 1 output-based question, CN and DBMS
- Consider a given array as different coin denominations, using every coin once and as many coins as you wish, and return the smallest amount that cannot be made using the given denominations.
Ex arr=[1,2,5] We can make 1 by using 1 rupee coin We can make 2 by using 2 rupees coin We can make 3 by using 1 rupee and 2 rupees coins But we cannot make 4 rupees Hence, return 4
- Given two arrays arr1 and arr2 tell if arr2 is a subsequence of arr1 or not
Ex arr1=[1,3,2,5,4,6]
arr2=[1,2,4,6]
return true
For the same arr1 if arr2=[2,3,4,6]
return false- What is the output of the code?
int add(int a, int b){
cout << "2 params";
return a + b;
}
int add(int a, int b, int c = 0){
cout << "3 params";
return a+b+c;
}
int main(){
cout << add(2,3);
}- Explain ACID properties
- What is Ethernet protocol?
- Explain ARP.
11 students were shortlisted for this round.
Round 2: Resume-based questions, 1 coding question, OS, CN, and DBMS
- Two sum- https://leetcode.com/problems/two-sum/
- DBMS query – Given the employees’ table find the employee with the highest salary in each department
- Difference between primary key, and candidate key.
- What is DNS? What is DNS Cache? What is DNS cache poisoning?
- What is inode in Linux?
- Difference b/w thread and process.
- 8 Students were shortlisted for this round.
Round 3: HR Round: 3 students got selected and I was one among them.
Article Tags :
Recommended Articles