Software Engineer
2 rounds | 3 Coding problems
1462 views
Interview preparation journey
Preparation
Duration: 6 months
Topics: DBMS, OOPS, Data structures, Dynamic Programming, Graphs, Algorithms, Sorting searching.
Tip

Tip 1 : Never give up
Tip 2 : When u start a topic, don't move on to next topic before you are 100% confident in previous topic
Tip 3 : Try to give maximum time on basics of a topic especially OOPS
Tip 4 : Practice everyday

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1: Write only those things in resume in which you are 100% confident
Tip 2: Write maximum projects you have and be ready to explain them thoroughly
Tip 3: Don't make any silly spelling mistakes on resume

Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date17 Sep 2020
Problems1
A matrix on n*n size is given with 0s and 1s as values. Wherever a 1 is present make the complete row and column of that element equal to 1. At the end tell how many 1s are present till the complete operation is completed.

#### Given a 2-dimensional boolean matrix mat of size N x M, modify the matrix such that if an element is 1, set its entire row and column to 1 i.e. if mat[i][j] = 1, then make...

view more
Problem approach

To do it in minimum time complexity, start from first index, maintain 2 variables of number of of columns and number of rows completely made 1 till now. maintain a variable num=0. Now whenever a 1 is encountered add n -num_column and n-num_row to num and also increment num_row and num_col.

02
Round
Medium
Video Call
Duration55 minutes
Interview date27 Sep 2020
Problems2
Implement a class which inherits features from another class. Basically i had to provide a list of employees of a particular department. along with their salary details when i was given a department of any organisation.
Problem approach

I used inheritance and also used hashmaps to maintain a map of an integer for every department.

10 boxes each with 10 stones are present. each box has stones of different weight but weight in each box is uniform. Only one box has one stone of non-uniform weight. Find optimised way to find in which box is this wrong stone present.
Problem approach

Take 1 stone from box1, 2 from box 2 and so on.
Its a straight-forward puzzle available on internet as well.

Start a Discussion
Similar interview experiences
Quality Testing Intern
3 rounds | 5 problems
463 views
SDE - 1
3 rounds | 5 problems
985 views
SDE - 1
3 rounds | 9 problems
Interviewed by Samsung
24 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Samsung
13 views
Companies with similar interview experiencs
Software Engineer
3 rounds | 3 problems
Interviewed by Mindtree
5478 views