amadeus labs logo
Amadeus Labs· sde-1 intern

Amadeus Labs | Intern(SDE-1) | Bangalore | Sep 2022 [Offer]

Result
Offer
Location
bangalore
Posted
15 Jan 2023
277 reads

Summary

I successfully interviewed for an SDE-1 Intern position at Amadeus Labs in Bangalore, ultimately receiving an offer after navigating through online assessments and multiple interview rounds that covered data structures, algorithms, computer science fundamentals, and behavioral questions.

How it went

I hold a Bachelor's degree in Electrical Engineering from a Tier 2 college. Before this interview, I had rigorously practiced, solving over 700 questions on LeetCode, 400 on GFG, and 200 on CodeChef. My previous interview experience was with Oracle, where I was rejected after two rounds, likely due to nervousness as it was my first technical interview.

Round 1 (Online Assessment):
Initially, I filled out a Google form and then received a test link for a Hackerearth assessment. The test duration was 1 hour 30 minutes and consisted of 31 questions. There were 29 MCQs covering CS fundamentals and input-output, which I found very tough, managing to solve only 22. Following the MCQs, there were two coding questions.

Question 1: The End Game
I was presented with a game involving N pawns, each with a power Pi, and a king with power S. My task was to determine the minimum number of moves to defeat the king or print 'Impossible'. I successfully solved this question. Sample input and output were provided:
1
3 20 5
5 7 3
Output: 5

Question 2: Path MEX
This problem involved a rooted tree with N nodes, rooted at node 1, where each node had an integer value 'val' associated with it. For each node i (1 <= i <= N), I needed to print the MEX (smallest positive integer not present) of the path values from the root node to node i. I managed to pass 12 out of 15 test cases for this question. Sample input and output were provided:
1
6
1 3 2 2 4 2
1 1 2 2 5
Output: 2 2 3 4 2 5

After this round, 110 students proceeded to the next stage.

Round 2 (SHL Assessment):
This round consisted of questions on reading comprehension, numerical reasoning, and situational judgment. It was 29 minutes long, split into two sections of 14 and 15 minutes. I've seen similar tests, and a reference link for understanding this type of assessment is: https://www.shl.com/shldirect/en/example-questions/

Round 3 (Interview - Offline):
The interview began with my introduction and an in-depth discussion about my most recent project. Following this, the interviewer explained a string matching question, which I had encountered before. I wrote the complete code on paper and explained my approach, which pleased the interviewer. We then moved on to CS fundamental questions:
DBMS:
  • What is Machine language?
  • What is RDBMS and its properties with examples?
  • What is Normalization?
  • What is Denormalization and why do we use it?
OOPs:
  • What is the difference between Object-oriented programming and Object-based programming?
  • What is a virtual function?
  • What is function overloading and overriding with proper code?
  • Follow-up: What happens when we put a 'static' keyword in front of a function? Will it override or overload, or neither?
OS:
  • What is process synchronization?
  • What is paging?
The interview lasted about 45-60 minutes, and I found the overall experience very easy.

Round 4 (HR Interview - Offline):
Approximately 15 minutes after the technical round, I was called for the HR interview. I felt confident at this point. The HR manager asked me to introduce myself and to explain my project and its motivation. Other questions included:
  • Given my electrical background, how did I manage to learn and balance both disciplines simultaneously?
  • What would be my approach to learning new technology?
  • Who are Amadeus's competitors?
  • Why did I want to join Amadeus Labs?
This round was about 30 minutes long, covering various topics as mentioned.

The interviews took place in the placement block, where we were present from 8:30 AM. Results were announced around 9 PM, and a nice touch was that they gave out goodies while calling out the names of selected students.

Questions asked (17)

  1. 01

    The End Game (Pawn Power vs King)

    Data Structures & Algorithms

    You are playing a game that consists of N pawns. Each pawn has some power. The i-th pawn's power is represented as Pi. The game also has a king whose power is S. Your task is to determine the minimum number of moves within which the king can be defeated. If there is no such number, print 'Impossible'.

    Sample Input

    1
    3 20 5
    5 7 3
    Sample Output
    5

  2. 02

    Path MEX in a Rooted Tree

    Data Structures & Algorithms

    You are given a rooted tree having N nodes. A tree is a connected undirected graph with N-1 edges. Here, the root node is 1. Each node has some integer value 'val' associated with it. For each node i (1 <= i <= N), print the MEX of the path values from the root node to node i.

    Notes:

    • Assume 1-based indexing.
    • The MEX of an array is equal to the smallest positive integer that is not present in the array. For example, MEX(1, 2, 4, 2, 3, 6, 7) = 5.

    Sample Input
    1
    6
    1 3 2 2 4 2
    1 1 2 2 5
    Sample Output
    2 2 3 4 2 5

  3. 03

    String Matching Algorithm

    Data Structures & Algorithms

    The interviewer explained a string matching question. I had encountered this type of problem earlier and was able to write the entire code on paper and provide a thorough explanation.

  4. 04

    What is Machine Language?

    Other

    What is Machine language?

  5. 05

    RDBMS and Properties

    Other

    What is RDBMS and its properties with examples?

  6. 06

    What is Normalization?

    Other

    What is Normalization?

  7. 07

    Denormalization and Usage

    Other

    What is Denormalization and why do we use it?

  8. 08

    OOP vs Object-Based Programming

    Other

    What is the difference between Object-oriented programming and Object-based programming?

  9. 09

    What is a Virtual Function?

    Other

    What is virtual function?

  10. 10

    Function Overloading and Overriding

    Other

    What is function overloading and overriding with proper code? Follow-up question: what happens when we put a 'static' keyword in front of a function? Will it override or overload, or neither?

  11. 11

    What is Process Synchronization?

    Other

    What is process synchronization?

  12. 12

    What is Paging?

    Other

    What is paging?

  13. 13

    Motivation for Projects

    Behavioral

    Introduce yourself and explain your project and the motivation behind that.

  14. 14

    Learning from Electrical Background

    Behavioral

    You are from an electrical branch, how did you manage and learn both things simultaneously?

  15. 15

    Approach to Learn New Technology

    Behavioral

    What will be your approach to learn new technology?

  16. 16

    Amadeus Competitors

    Behavioral

    Who are the competitors of Amadeus?

  17. 17

    Why Join Amadeus Labs?

    Behavioral

    Why do you want to join Amadeus Labs?

How they prepared

I diligently practiced until I achieved success. For Data Structures and Algorithms (DSA) and various CS fundamental concepts, I followed resources from Striver, Aditya Verma, and Gate Smashers. For Object-Oriented Programming (OOPs), I specifically referred to C++ content by Saurabh Shukla Sir.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amadeus Labs recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!