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

Software Engineer

Codezero2pi
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
In the lockdown period, I started my journey to where I am today. When the first lockdown prevailed I started to learn DSA, and I think that was the best time to learn DSA because no pressure from college was there for its useless assignments and all. In the lockdown of around 6 months, I learnt the basic algorithms and at the end I started practising on leetcode and codechef like platforms, they helped me a lot during my journey.
Application story
I was practising DSA on a regular day when I saw a small advertisement kind of on leetcode. I opened it and I got to find that company is looking for some fresher graduates to serve as SDE-1. I applied to it and after three rounds, I was selected.
Why selected/rejected for the role?
Tip 1 : Have at-least 2 good projects explained in short with all important points covered. Tip 2 : Every skill must be mentioned.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Networking
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.

Application process
Where: Leetcode
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date13 Aug 2022
Coding problem2

1. Minimum Cost of Reducing Array

Hard
15m average time
80% success
0/120
Asked in companies
DunzoZS AssociatesGrab

You are given an array 'ARR' consisting of 'N' positive integers, and you need to reduce the size of the array to 1 by performing an operation several number of times. In a single operation, you can merge any two adjacent elements of the array, and the cost of merging will be equal to the sum of those two elements. Find the minimum cost of reducing the given array by performing this operation several number of times.

In a single merge operation, the two elements are removed, and their sum is inserted at its place, hence decreasing the size of the array by 1 after each operation. For eg: Consider the array A1, A2, Ai-2, Ai-1, Ai, Aj, Aj+1, Aj+2 ,,,, An. Let the operation be performed on two indices i and j, So after merging the array will look like A1, A2, Ai-2, Ai-1, Ai+Aj, Aj+1, Aj+2,,,, An.

Note:

Note that the given operation will be performed only 'N'-1 times, where 'N' is the size of the given array.
Try solving now

2. Implement strStr()

Moderate
25m average time
70% success
0/80
Asked in companies
IBMFacebookSamsung R&D Institute

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?
Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date17 Aug 2022
Coding problem2

1. Kth ancestor of a node in binary tree

Hard
50m average time
35% success
0/120
Asked in companies
AmazonFlipkartWalmart

You are given an arbitrary binary tree consisting of N nodes numbered from 1 to N, an integer 'K', and a node 'TARGET_NODE_VAL' from the tree. You need to find the Kth ancestor of the node 'TARGET_NODE_VAL'. If there is no such ancestor, then print -1.

The Kth ancestor of a node in a binary tree is the Kth node in the path going up from the given node to the root of the tree. Refer to sample test cases for further explanation.

Note:
1. The given node 'TARGET_NODE_VAL' is always present in the tree.
2. The value of each node in the tree is unique.
3. Notice that the Kth ancestor node if present will always be unique.
Try solving now

2. Course Schedule II

Hard
50m average time
50% success
0/120
Asked in companies
AppleUberPhonePe

You have been given ‘N’ courses and some courses may have prerequisites. Now consider a matrix ‘PREREQUISITES’ of size 'M' x 2 which represents that you must complete the course 'PREREQUISITES[i][1]' before the course 'PREREQUISITES[i][0]'.


Your task is to return the order of courses you should take to finish all courses.


Note:
If it is impossible to finish all courses, return an empty array. If there are multiple answers, return any one.


For example:
Input:
3 2
1 2
2 3

There are three courses to take. To start with, First course 3 is taken. Then course 2 is taken for which course 3 must be completed. 

At last course 1 is taken for which course 2 must be completed. So the correct course order is [3,2,1].    
Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date25 Aug 2022
Coding problem1

1. Basic HR Questions

Introduce yourself.
How will you react if you are asked to work overtime at the same pay?
How will you handle conflict in your colleagues?
Are you willing to relocate?
What do you know about the work culture here in our organisation?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which keyword is used for inheritance?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Codezero2pi
305 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by Codezero2pi
371 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Codezero2pi
312 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Codezero2pi
315 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
11562 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7349 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9153 views
1 comments
0 upvotes