AIG interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

AIG

2 rounds | 2 Coding problems

Karan Agrawal

Fresher | Sep 2020

Selected

Interview preparation journey

Preparation

Duration: 2 months

Topics: Data Structures and Algorithms, Object Oriented Programming, Python Development, Web Designing, Dynamic memory allocation

Tip

Tip 1 : Stay focused, clear and confident before and during the interview.
Tip 2 : Language and body language must be formal.
Tip 3 : Put your creativity thoughts into action.

Application process

Where: Campus

Eligibility: More than 7.5

Resume tip

Tip 1 : Make it very formal, tight and crisp. Don't end up highlighting unnecessary details else it would be rejected.
Tip 2 : Ensure that it has all that certifications, projects and self profile explaining terms which makes it lucrative.

Interview rounds

Round

Easy

Online Coding Interview

Duration60 minutes

Interview date12 Sep 2020

Coding problem1

It was an online one on one call that was taken. Like many others, even i too got formal and straight forward with my interviewers. It was pretty good despite the connectivity issues. I have gained by the way they were asking me questions as the nature of the call was quite amicable. It was pretty good as it was during the day for me.

1. Longest Common Subsequence

Moderate

39m average time

0/80

Asked in companies

Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.

For a string 'str'(per se) of length K, the subsequences are the strings containing characters in the same relative order as they are present in 'str,' but not necessarily contiguous. Subsequences contain all the strings of length varying from 0 to K.

Example :

Subsequences of string "abc" are:  ""(empty string), a, b, c, ab, bc, ac, abc.

Try solving now

Round

Easy

Face to Face

Duration60 minutes

Interview date18 Oct 2020

Coding problem1

It was during the night. I was to attend an one on one interview. Though it was a shaky start in the beginning, sporadically i picked up. The affable nature of the interviewer made me feel special and comfortable. He not only asked me normal interview questions but also took me through the technical aspects of an interview and i could get them all!

1. Count Subsequences

Moderate

30m average time

60% success

0/80

Asked in companies

You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equal.

A subsequence of a given array is an array generated by deleting some elements of the given array with the order of elements in the subsequence remaining the same as the order of elements in the array.

Note :

As this value might be large, print it modulo 10^9 + 7

Problem approach

Step 1 : I first applied bubble sort. It was not good enough.
Step 2 : Interviewer asked me to optimise the solution.
Step 3 : Then I gave solution with merge sort and interviewer was happy.

Try solving now