AMAGI interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
AMAGI
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: DSA, OS, OOPs, Hashing, Ubuntu, DBMS, Algorithms
Tip 1 : Do know about hashing and how hash maps work . And study about OOPs as it will help in design problems.
Tip 2 : Know about your projects in and out thoroughly.
Tip 3 : Trust on your skills and be interactive with the interviewer
Application process
Where: Campus
Eligibility: 7 CGPA and No backlogs
Tip 1 : Keep it concise. Yes you heard it right. Recruiters have very less time to scan through your resumes so better if it is concise, also when writing about the projects make the important things in bold.
Tip 2 : Do link your important profiles in the resume, such as coding profile , github and email.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date28 Sep 2021
Coding problem1
1. MCQ Questions
OS , Aptitude, CN , Coding Questions.
Number Of MCQs - 60
02
Round
Medium
Face to Face
Duration120 minutes
Interview date30 Sep 2021
Coding problem2
1. First Missing Positive
Moderate
18m average time
84% success
0/80
Asked in companies
You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.
For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.
Problem approach
// Given an unsorted integer array nums, return the smallest missing positive integer.
// You must implement an algorithm that runs in O(n) time and uses constant extra space.
// Example 1:
// Input: nums = [1,2,0]
// Output: 3
// Example 2:
// Input: nums = [3,4,-1,1]
// Output: 2
#include
using namespace std;
int main() {
// Read input from STDIN; write output to STDOUT.
// 1 2 0
// -1 1 3 4
//
vector v{1,2,0};
unordered_map mymp;
for(int i=0;i<(int)v.size();i++)
{
mymp[i+1]++;
}
int ans=INT_MAX;
for(int i=0;i<(int)v.size();i++)
{
if(v[i]>0&&mymp.count(v[i])>0)
{
mymp[v[i]]=0;
}
}
for( auto x: mymp)
{
if(x.second==1)
{
ans=min(ans,x.first);
}
}
cout< return 0;
}
2. Pair Sum
Easy
15m average time
90% success
0/40
Asked in companies
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.
Note:
Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Problem approach
#include
#include
using namespace std;
int main() {
// Read input from STDIN; write output to STDOUT.
// [3,1,7,2,6,0]
// [2,1,5,0,4,6]
vector v{2,1,5,0,4,6};
int a=INT_MAX,b=INT_MAX;
bool exists=false;
for(int i=0;i<(int)v.size();i++)
{
if(a>v[i])a=v[i];
if(v[i]>a&&v[i]b)
{
exists=true;
break;
}
}
if(exists)cout<<"yes";
else cout<<"no"< return 0;
}
03
Round
Hard
Face to Face
Duration120 minutes
Interview date30 Sep 2021
Coding problem2
1. Dice Throws
Hard
35m average time
65% success
0/120
Asked in companies
You are given D dice, each having F faces numbered 1 to F, both inclusive. The task is to find the possible number of ways to roll the dice together such that the sum of face-up numbers equal the given target S.
Note :
As the answer can be large, return your answer modulo 10^9 + 7.
Follow Up :
Can you solve this using not more than O(S) extra space?
2. Implement strStr()
Moderate
25m average time
70% success
0/80
Asked in companies
You are given two strings A and B. Find the index of the first occurrence of A in B. If A is not present in B, then return -1.
For Example:
A = “bc”, B = “abcddbc”.
String “A” is present at index 1, and 5(0-based index), but we will return 1 as it is the first occurrence of “A” in string “B”.
Follow Up:
Can you solve this in linear time and space complexity?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
961 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6451 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7874 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 9973 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4310 views
1 comments
0 upvotes