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

Backend Developer

NoBroker
upvote
share-icon
1 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
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.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Other
Eligibility: Above 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.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date20 Dec 2021
Coding problem4

This was a technical interview round with questions on DSA, OOPS and Low Level design.

1. Print a Binary Tree in Vertical Order

Moderate
35m average time
65% success
0/80
Asked in companies
MakeMyTripAppleSalesforce

Given a binary tree, return the vertical order traversal of the values of the nodes of the given tree.

For each node at position (X, Y), (X-1, Y-1) will be its left child position while (X+1, Y-1) will be the right child position.

Running a vertical line from X = -infinity to X = +infinity, now whenever this vertical line touches some nodes, we need to add those values of the nodes in order starting from top to bottom with the decreasing ‘Y’ coordinates.

Note:
If two nodes have the same position, then the value of the node that is added first will be the value that is on the left side.
For example:
For the binary tree in the image below.

alt text

The vertical order traversal will be {2, 7, 5, 2, 6, 5, 11, 4, 9}.
Problem approach

Level Order Traversal can be used here. 
Algorithm :
1. Maintain a hash map for the branch of each node.
2. Traverse the tree in level order fashion.
3. In level order traversal, maintain a queue which holds, node and its vertical branch.
* pop from queue.
* add this node's data in vector corresponding to its branch in the hash.
* if this node hash left child, insert in the queue, left with branch - 1.
* if this node hash right child, insert in the queue, right with branch + 1.


Time Complexity of the above implementation is O(n Log n).

Try solving now

2. OOPS Question

Why is Java called an Object Oriented Programming Language?

Problem approach

Java is purely an object oriented language due to the absence of global scope, Everything in java is an object, all the program codes and data resides within classes and objects. It comes with an extensive set of classes, arranged in packages, object model in java in sample and easy to extend.

3. DBMS Question

What is indexing and partitioning in DBMS?

Problem approach

Indexing is used to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed. The index is a type of data structure. It is used to locate and access the data in a database table quickly.
Index structure:
Indexes can be created using some database columns.
The first column of the database is the search key that contains a copy of the primary key or candidate key of the table. The values of the primary key are stored in sorted order so that the corresponding data can be accessed easily.
The second column of the database is the data reference. It contains a set of pointers holding the address of the disk block where the value of the particular key can be found.

Partitioning is the database process where very large tables are divided into multiple smaller parts. By splitting a large table into smaller, individual tables, queries that access only a fraction of the data can run faster because there is less data to scan. The main of goal of partitioning is to aid in maintenance of large tables and to reduce the overall response time to read and load data for particular SQL operations.

4. System Design Question

Design a movie site booking portal using objects and classes. Design the table diagram and the ways different tables will be linked for a movie booking website like bookmyshow.

Problem approach

Tip 1 : Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.


Tip 2 : Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the initial doubt, and you will get to know what are the specific detail interviewer wants to consider in this service.


Tip 3 : Design your structure and functions according to the requirements and try to convey your thoughts properly to the interviewer so that you do not mess up while implementing the idea .

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 - 2
3 rounds | 3 problems
Interviewed by NoBroker
1350 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by NoBroker
1815 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3319 views
0 comments
0 upvotes