AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
PolicyBazaar
Compare
Filter interviews by
PolicyBazaar Software Developer Interview Questions, Process, and Tips
Top PolicyBazaar Software Developer Interview Questions and Answers
- Q1. BFS Traversal in a Graph Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output t ...read more
- Q2. DFS Traversal Problem Statement Given an undirected and disconnected graph G(V, E) , where V is the number of vertices and E is the number of edges, the connections betw ...read more
- Q3. Nth Fibonacci Number Problem Statement Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2) , with initial ...read more
PolicyBazaar Software Developer Interview Experiences
6 interviews found
Anonymous
Selected
I appeared for an interview in Jan 2025.
Basic aptitude questions to
Basic coding questions
(2 Questions)
- Q1. Thanks tougfh roubd was there
- Q2. What type of round was conducted during the interview?
Interview Preparation Tips
Selected
I appeared for an interview in Jan 2025.
Medium Leetcode questions : BSA concept
(1 Question)
- Q1. System design of oyo rooms
Selected
I appeared for an interview in Feb 2025, where I was asked the following questions.
- Q1. What are boxing and unboxing in programming?
- Ans.
Boxing is converting a value type to an object type, while unboxing is converting an object type back to a value type.
Boxing wraps a value type (e.g., int) in an object (e.g., object). Example: object obj = 42; // Boxing
Unboxing extracts the value type from the object. Example: int num = (int)obj; // Unboxing
Boxing incurs a performance cost due to memory allocation.
Unboxing requires type checking, which can lead to exc...
- Q2. How would you optimize your stored procedure.
- Ans.
Optimize stored procedures by analyzing performance, reducing complexity, and improving query efficiency.
Use proper indexing: Ensure that the columns used in WHERE clauses are indexed to speed up data retrieval.
Avoid SELECT *: Specify only the columns needed to reduce data transfer and processing time. Example: SELECT id, name FROM users.
Limit result sets: Use pagination or LIMIT clauses to return only the necessary ro...
(1 Question)
- Q1. Tell me About yourself
PolicyBazaar interview questions for designations
I appeared for an interview in Jul 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Easy level DSA questions were asked to implement.
- Q1.
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
- Ans.
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure the traversal starts from vertex 0 and follows the BFS order.
Output the BFS traversal sequence for each test case in a separate line.
Handle disconnected components by checking for unvisited nodes.
Consider t...
- Q2.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
DFS traversal problem to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
Iterate through all vertices and perform DFS on unvisited vertices to find connected components
- Q3.
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows:
F(n) = F(n-1) + F(n-2), with initial conditionsF(1) = F(2) = 1.Input:
... - Ans.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
DSA questions based on trees were asked to implement.
- Q1.
Determine the Left View of a Binary Tree
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
- Ans.
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.
Use a queue to perform level order traversal of the binary tree.
Store the leftmost node at each level in the result array.
Return the result array containing the left view of the binary
- Q2.
Right View of Binary Tree
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
- Ans.
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Perform level order traversal of the binary tree.
For each level, add the rightmost node to the result.
Print the result as the right view of the binary tree.
Handle null nodes represented by -1 in the input.
- Q3.
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...
- Ans.
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.
The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.
Consider edge cases like a single node tree or empty tree while calculating the height.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round where the interviewer asked questions to know more about me.
Interview Preparation Tips
Tip 1 : Learn DS, SQL for the interview as it will be ask and be confident about what you are saying
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.
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.
Skills evaluated in this interview
Get interview-ready with Top PolicyBazaar Interview Questions
I applied via LinkedIn and was interviewed in Jul 2021. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Priority queue code, Fibonacci series, bfs-dfs implementation,tree data structures (like height,left view,right view) basically easy level question of GFG on tree
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
(1 Question)
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
- Q1.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
- Q1.
Rearrange Array Elements Problem Statement
Given an array
Acontaining 'N' integers and an integerm, rearrange the elements of the array such that the differences between the array elements andmare sor... - Ans.
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
- Q2.
Print Nodes at Distance K from a Given Node
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
- Ans.
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
- Q1.
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
1
232
34545
4567654Explanation:
The pat...
- Ans.
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
- Q2. What is the difference between a web server and an application server?
- Ans.
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
- Q3. How does the internet work?
- Ans.
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
- Q4. Write a SQL query to find the nth highest salary.
- Ans.
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I applied via Campus Placement
Interview Preparation Tips
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.
Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix
Tips: All question were from geeksforgeeks
So practice it well ..u will make through it
Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible
Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...
Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens
Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar
Interview Questionnaire
9 Questions
- Q1. Write a regex for email validation?
- Ans.
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
- Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
- Q3. Print prime numbers in a given range and optimize the solution?
- Ans.
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
- Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
- Q5. Web related questions on Sessions and cookies?
- Q6. A lot of discussion on my resume, experience etc
- Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
- Ans.
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
- Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
- Ans.
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
- Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...
Interview Preparation Tips
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join
Skills evaluated in this interview
PolicyBazaar Interview FAQs
Tell us how to improve this page.
PolicyBazaar Interviews By Designations
- PolicyBazaar Sales Executive Interview Questions
- PolicyBazaar Associate Sales Consultant Interview Questions
- PolicyBazaar Relationship Manager Interview Questions
- PolicyBazaar Sales Associate Interview Questions
- PolicyBazaar Sales Consultant Interview Questions
- PolicyBazaar Customer Service Associate Interview Questions
- PolicyBazaar Software Developer Interview Questions
- PolicyBazaar Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
PolicyBazaar Software Developer Interview Process
based on 5 interviews
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
PolicyBazaar Software Developer Reviews and Ratings
based on 6 reviews
Rating in categories
|
Sales Executive
1.2k
salaries
|  ₹1.6 L/yr - ₹5.5 L/yr |
|
Associate Sales Consultant
1.1k
salaries
| ₹1.8 L/yr - ₹6 L/yr |
|
Relationship Manager
623
salaries
| ₹1.8 L/yr - ₹6 L/yr |
|
Sales Associate
380
salaries
| ₹1.5 L/yr - ₹4.7 L/yr |
|
Team Lead
375
salaries
| ₹3.1 L/yr - ₹12.2 L/yr |
Amazon
Flipkart
Indiamart Intermesh
BigBasket
- Home >
- Interviews >
- PolicyBazaar Interview Questions >
- PolicyBazaar Software Developer Interview Questions
