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

SDE - 1

Codezero2pi
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
I took admission in VIT college in computer science stream. I was advised by my seniors to practice DSA from the very starting of B.Tech and I did not took that seriously. Honestly speaking, I regretted not taking their advice and in third year I started doing coding and I had to increase practice hours because I started late.
Application story
I got to know about the openings and that the hiring drive of the company going to visit our college for hiring candidates as SDE-1. I prepared myself for the same and after the selection process, I got the offer letter.
Why selected/rejected for the role?
I think my skills and knowledge were up to the mark that they found me as a valuable candidate. Moreover, my communication skills added up to my numbers.
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS, OS, DBMS
Tip
Tip

Tip 1 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 2 : Do at-least 2 good projects and you must know every bit of them.

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

Tip 1 : Every skill must be mentioned.
Tip 2 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date5 Jul 2021
Coding problem2

1. Maximum Subarray Sum

Moderate
25m average time
75% success
0/80
Asked in companies
SquadstackAmazonRazorpay

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.


For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.


Given the array [-5, -1, -8, -9], the maximum sum would be -1.


Follow up: Do this in O(N) time.

Try solving now

2. Optimal BST

Hard
55m average time
45% success
0/120
Asked in companies
OracleShareChatLinkedIn

Given a sorted array of keys of BST and an array of frequency counts of each key in the same order as in the given inorder traversal. The frequency of an element is the number of searches made to that element. Construct a binary search tree from the given keys such that the total cost of all the searches is minimum.

Cost of searching a key is its frequency multiplied by its level number in the BST.

A binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree.

For example:

Input keys = [ 1, 3, 5 ] 
Frequency = [ 3, 10, 7 ] 

All the unique BST possible from the given keys are: 

Among all these possible BST, the minimum cost is obtained from the below BST: 

Cost = 1 * (freq of 3) + 2 * (freq of 1) + 2 * (freq of 5) = 30 
where 1 is the level of node 3, 2 is the level of the node 1 and node 5. 
Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date10 Jul 2021
Coding problem3

1. Word Ladder

Hard
10m average time
90% success
0/120
Asked in companies
OlaSalesforceMakeMyTrip

You are given two strings BEGIN and END and an array of strings DICT. Your task is to find the length of the shortest transformation sequence from BEGIN to END such that in every transformation you can change exactly one alphabet and the word formed after each transformation must exist in DICT.

Note:

1. If there is no possible path to change BEGIN to END then just return -1.
2. All the words have the same length and contain only lowercase english alphabets.
3. The beginning word i.e. BEGIN will always be different from the end word i.e. END (BEGIN != END).
Try solving now

2. OOPS Question

What is the difference between a class and a structure?
Can you call the base class method without creating an instance?
What is hybrid inheritance?
What are the limitations of inheritance?
What is static polymorphism?
What is dynamic polymorphism?

3. DBMS Questions

Define a Relation Schema and a Relation.
What are the disadvantages of file processing systems?
Explain the functionality of DML Compiler.
What do you mean by durability in DBMS?
What is normalization?
What is Denormalization?

03
Round
Easy
HR Round
Duration20 minutes
Interview date24 Jul 2021
Coding problem1

1. Basic HR Questions

Introduce yourself
Why do you want to join us?
What are your hobbies?
What do you think makes you a better choice than the other candidates?
What are your strengths and weaknesses?
How do you think one can overcome his weaknesses?
How will you react if you are asked to work overtime at the same pay?

Here's your problem of the day

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Codezero2pi
374 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Codezero2pi
365 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by Codezero2pi
450 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Codezero2pi
376 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes