AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
PolicyBazaar
Work with us 
Compare
Filter interviews by
PolicyBazaar Software Developer Interview Questions and Answers
7 Interview questions
I'm a passionate software developer with a strong background in full-stack development and a love for solving complex problems.
Over 5 years of experience in software development, specializing in JavaScript and Python.
Developed a full-stack web application for a local business, increasing their online sales by 30%.
Strong understanding of Agile methodologies, having worked in Scrum teams to deliver projects on time.
...
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 conditions F(1) = F(2) = 1.
Input:
...
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.
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 ...
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.
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 between vertices are provided in the 'GRA...
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
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 0...
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.
Consi...
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 construct...
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.
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 ...
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 b...
PolicyBazaar Software Developer Interview Experiences
6 interviews found
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.
(1 Question)
- Q1. Tell me About yourself
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
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 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 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
Software Developer Interview Questions & Answers
Eternal Limited
Gulshan Kumar
posted on 30 Nov 2015
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
I applied via Referral
Interview Questionnaire
6 Questions
- Q1. Design the most optimal data structures for an LRU cache
- Q2. Convert a sorted array to balanced binary search tree
- Ans.
Convert a sorted array to balanced binary search tree
Find the middle element of the array and make it the root of the tree
Recursively construct the left subtree using the left half of the array
Recursively construct the right subtree using the right half of the array
Repeat until all elements are added to the tree
- Q3. Reverse a singly linked list in groups of k inplace
- Ans.
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
- Q4. Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings
- Q5. Write a recursive routine to calculate a ^ n
- Ans.
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
- Q6. Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest
- Ans.
Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.
Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.
Maintain two heaps, one for kth largest and one for kth smallest.
For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.
Alternatively, use a...
Interview Preparation Tips
College Name: NA
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 Sales Associate Interview Questions
- PolicyBazaar Relationship Manager Interview Questions
- PolicyBazaar Customer Service Associate Interview Questions
- PolicyBazaar Sales Consultant Interview Questions
- PolicyBazaar Business Analyst Interview Questions
- PolicyBazaar Financial Advisor Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 5 interview experiences
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
PolicyBazaar Software Developer Reviews and Ratings
based on 6 reviews
Rating in categories
|
Sales Executive
1.3k
salaries
|  ₹2 L/yr - ₹5.7 L/yr |
|
Associate Sales Consultant
1.3k
salaries
| ₹2 L/yr - ₹4.5 L/yr |
|
Relationship Manager
1k
salaries
| ₹2.3 L/yr - ₹6 L/yr |
|
Team Lead
429
salaries
| ₹4.8 L/yr - ₹9.5 L/yr |
|
Sales Associate
422
salaries
| ₹2 L/yr - ₹5.5 L/yr |
Amazon
Flipkart
Indiamart Intermesh
BigBasket
- Home >
- Interviews >
- PolicyBazaar Interview Questions
