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

QA Automation

Nirmata

3 rounds | 2 Coding problems

Anonymous

Fresher | Nov 2024

Rejected

Interview preparation journey

Journey

I applied for a QA Automation role at Nirmata. The first round was an HR-based screening process where I was asked about my projects, domains, etc. After that, I received an email for the first technical round, where I was asked questions on arrays. Following this, I was invited to the second technical round, where I was asked theoretical questions on OOP concepts, as well as tree based questions.

Application story

I applied for the role through a referral and passed the screening process, which was conducted via a phone call with HR. I cleared the first technical round but was rejected in the second technical round.

Why selected/rejected for the role?

I was rejected for the role because I lacked sufficient knowledge of QA Automation. I was unable to solve the binary tree question and struggled with the space and time complexity questions as well.

Preparation

Duration: 3 months

Topics: DSA, OOPS, Arrays, QA Automation, Binary Trees

Tip

Tip 1 : Revise OOPS concepts.
Tip 2 : Learn about the company background and what they do.

Application process

Where: Referral

Eligibility: NA (Salary package: 3.6 LPA)

Resume tip

Tip 1: Keep the resume short and crisp.
Tip 2: Mention skills and projects that you are confident with.

Interview rounds

Round

Easy

HR Round

Duration30 minutes

Interview date8 Nov 2024

Coding problem0

I received a call at evening, they asked me about my projects, which domain were they from, why did I chose them, etc. They also asked why I applied for this particular role despite there being many other openings in different domains as well. Then they asked how many hours will I be able to devote, what is my college schedule, when is the 4th year about to end, etc.

Round

Easy

Video Call

Duration60 minutes

Interview date14 Nov 2024

Coding problem1

It was a coding round in which they gave me a coding question, asked me to solve it and then explain my approach and its reasoning.

1. Two Sum

Easy

10m average time

90% success

0/40

Asked in companies

Two sum array problem - Problem: Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

Constraints:

Each input has exactly one solution.
You may not use the same element twice.
You can return the answer in any order.

Problem approach

Tried the brute force approach but was asked to optimize the code. Then I reduced the looping process from 1 nested loops which was O(n^2) time complexity to a single loop of O(n)

Try solving now

Round

Easy

Video Call

Duration60 minutes

Interview date18 Nov 2024

Coding problem1

It was a coding round in which they gave me a question on tree traversal.

1. Inorder Traversal

Easy

32m average time

0/40

Asked in companies

Binary trees - Problem: Given the root of a binary tree, return its inorder traversal (Left, Root, Right).
Follow-up: Can you implement the traversal iteratively?

Try solving now