Udaan-The Students Magazine interview experience Real time questions & tips from candidates to crack your interview

Software Engineer Intern

Udaan-The Students Magazine

2 rounds | 1 Coding problems

Anonymous

Fresher | Aug 2022

Rejected

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures and Algorithm, Low-level Design, Computer Fundamentals Topics, OOPS, DBMS.

Tip

Tip 1 : Practice at least 800+ problems before sitting for Top MNCs
Tip 2 : Focus On the project
Tip 3 : Good Dress-up
Tip 4 : Practice from trustable sources eg.(GFG,Codestudio,Leetcode)

Application process

Where: Campus

Eligibility: 7+ CGPA

Resume tip

Tip 1 : Recent Achievements
Tip 2 : At least two internship

Interview rounds

Round

Medium

Online Coding Test

Duration120 minutes

Interview date7 Aug 2022

Coding problem1

It was a Coding Round conducted on the HackerEarth Platform. In this, they asked 1 Coding question which should be solved in 2 hrs (Time was critical to break tie-off). The question is about BackTracking and wants to implement four different functionalities. The query comprises 14 test cases. My code passed 13/14 test cases in total for this round. Around 558 Students gave this round, and 22 were selected for the next round.

1. N Queens

Hard

55m average time

35% success

0/120

Asked in companies

You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.

A queen can be killed when it lies in the same row, or same column, or the same diagonal of any of the other queens. You have to print all such configurations.

Problem approach

1) Start in the leftmost column
2) If all queens are placed
return true
3) Try all rows in the current column.
Do following for every tried row.
a) If the queen can be placed safely in this row
then mark this [row, column] as part of the
solution and recursively check if placing
queen here leads to a solution.
b) If placing the queen in [row, column] leads to
a solution then returns true.
c) If placing queen doesn't lead to a solution then
unmark this [row, column] (Backtrack) and go to
step (a) to try other rows.
4) If all rows have been tried and nothing worked,
return false to trigger backtracking.

Try solving now

Round

Hard

Online Coding Test

Duration90 minutes

Interview date14 Aug 2022

Coding problem0

Round 2 was again the Coding Round, but the difference between Round 1 and Round 2 is that you have to do the task in the system and submit it as a ZIP file consisting of the solution and the README file. This round's problem requires 2 APIs in any language whose functionality was specified in the problem statement. This round is 1.5 hours in total. 6 students are selected for the next round out of 22 students participating in this round. Unfortunately, I was not among them.