PolicyBazaar.com interview experience Real time questions & tips from candidates to crack your interview
Technical Associate
PolicyBazaar.com
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
Since the first semester of my B.Tech, I've engaged in Competitive Programming due to the excellent coding environment provided by my college. Initially, I utilized coding platforms until the completion of the first semester. Upon recommendation from a friend, I transitioned to another coding platform, finding it more appealing for CP endeavors. During my third semester, I delved into web development focusing on coding challenges. In the fourth semester, with the internship season approaching, I shifted my focus to more platforms. Despite diligently preparing and completing interviews during the fourth semester, I unfortunately did not secure an internship. However, this setback motivated me to intensify my coding efforts, which persisted until the sixth semester.
Application story
This company visited our campus and everyone with a CGPA above 7 was eligible to give an Online assessment.
Why selected/rejected for the role?
I was selected for the role because my first approach was also very basic and when the interviewer asked me to optimize it I was always able to give an optimized solution and in this way, he was impressed with my explanation.
Preparation
Duration: 4 months
Topics: Dynamic programming, Graph, Tree, OOPS, DBMS, Operating system, Computer network, DSA
Tip 1: Focus on the concept, not on the number of questions
Tip 2: Must-do Development. Even a simple HTML, CSS, and JavaScript project can work.
Tip 3: Must do the most asked and most liked questions.
Tip 4: First, Solve the question by yourself, then jump for other solutions
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1: Must know everything in the resume(don't put false things).
Tip 2: Not more than 1 page.
Tip 3: Highlight your job-related achievements and experience.
Interview rounds
01
Round
Medium
Online Coding Test
Duration70 mins
Interview date28 Apr 2022
Coding problem2
1. Delete Node In A Linked List
Easy
15m average time
80% success
0/40
Asked in companies
You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that node from the linked list.
A singly linked list is a linear data structure in which we can traverse only in one direction i.e. from Head to Tail. It consists of several nodes where each node contains some data and a reference to the next node.
Problem approach
Copy data of the next node to the current node
The task question needs to be corrected. You cannot delete the node.
Instead of ONLY deleting the provided node, we are not just doing it but replacing the next node. It could be a better question wording (without clarification about options) and a better solution. The correct answer for the interview is: "You CANNOT do this by having the node reference only. But we can make a very similar operation by corrupting the next node. However, I may recommend something other than this solution for production applications.
2. Merge Two Sorted Linked Lists
Moderate
15m average time
80% success
0/80
Asked in companies
You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.
Problem approach
Apply divide and conquer algorithm
02
Round
Easy
Face to Face
Duration60 mins
Interview date28 Apr 2022
Coding problem2
The interviewer was very supportive and humble
1. Triple Sum
Easy
15m average time
85% success
0/40
Asked in companies
It was Todd’s Birthday, So Bojack decided to give Todd a Binary tree with ‘N’ nodes. But the binary tree was too big to keep in his house, so Bojack decided to give exactly three nodes from that tree such that the sum of these three numbers equals ‘X’. Can you help Bojack determine if it is possible to make a sum equal to ‘X’?
Problem approach
First of all, we will try the naive approach,
Create a vector triplet set to ensure all three triplets are unique.
Run three loops of i, j, and k to iterate over the array.
The triplet is valid if the values add up to 0.
Could you insert the valid triplet in the set?
2. LCA Of Binary Tree
Moderate
10m average time
90% success
0/80
Asked in companies
You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.
The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.
Problem approach
Applied recursive approach
03
Round
Easy
HR Round
Duration30 mins
Interview date28 Apr 2022
Coding problem1
Firstly, he asked me to introduce myself, and then he started asking about my hobbies, background, and curricular activities and also focused on my situation-based skills.
1. Basic HR Questions
Introduce yourself
What are your hobbies?
Tell me some extracurricular activities that you have done in your graduation.
Why should we hire you?
Problem approach
Tip 1: You should always show them you are only focused on learning.
Tip 2: Also make them feel that you will stay longer in their company
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by PolicyBazaar.com
Rejected
1158 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by PolicyBazaar.com
Rejected
882 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by PolicyBazaar.com
Rejected
870 views
0 comments
0 upvotes
Software Engineer Intern
2 rounds | 4 problems
Interviewed by PolicyBazaar.com
Rejected
2065 views
0 comments
0 upvotes