Premium Employer

i

This company page is being actively managed by PolicyBazaar Team. If you also belong to the team, you can get access from here

PolicyBazaar Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

PolicyBazaar Softwaretest Engineer Interview Questions and Answers

Updated 7 Dec 2024

PolicyBazaar Softwaretest Engineer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I was interviewed in Jun 2024.

Round 1 - Coding Test 

Basic leetcode easy question. Find unique number in strung

Round 2 - Technical 

(2 Questions)

  • Q1. Sql - Find nth highest salary of employees
  • Q2. DSA - Sorted array to BST

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Very easy question over online platform

Round 2 - Technical 

(2 Questions)

  • Q1. I don't remember
  • Q2. Explain the project you have been working on
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Mar 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

The first round is OA and the majority questions are from leet code or similar

Round 3 - One-on-one 

(2 Questions)

  • Q1. Second round is one to one and be ready for coding as well as some behavioural
  • Q2. Leet code questions of easy to medium level
Round 4 - One-on-one 

(3 Questions)

  • Q1. The third round is also same as second and sometimes they go for 3rd also
  • Q2. Leet code of medium level
  • Ans. 

    Find the longest substring with at most k distinct characters.

    • Use a sliding window approach to keep track of the distinct characters in the substring.

    • Keep track of the start and end indices of the current substring.

    • Update the start index of the substring when the number of distinct characters exceeds k.

    • Update the end index of the substring and the length of the longest substring when a new longest substring is found.

  • Answered by AI
  • Q3. Explain an indecent when you failed in your task

Interview Preparation Tips

Interview preparation tips for other job seekers - Just do leet code and sharpen your understanding for DSA

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Be Confident, clear fundamentals, Stepwise Explanation with your actual experience with the technology or project
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Feb 2023. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Coding Test 

2 da questions based on maps and set

Round 3 - Coding Test 

2 questions again on graph and dp

Round 4 - HR 

(1 Question)

  • Q1. Design big basket service
  • Ans. 

    Design a service for online grocery shopping with a wide range of products and delivery options.

    • Create a user-friendly website or app for customers to browse and order groceries

    • Implement a secure payment gateway for online transactions

    • Integrate a robust inventory management system to track products and availability

    • Offer various delivery options such as express delivery or scheduled delivery

    • Provide customer support for

  • Answered by AI
Round 5 - HR 

(1 Question)

  • Q1. Bar raiser and one graph question

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Coding Test 

2 medium/hard level algorithm questions

Interview Preparation Tips

Interview preparation tips for other job seekers - get very familiar with lite code and hacker ranks challenges and you should be good
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Design Parking - at C# ~ hour

Interview Preparation Tips

Interview preparation tips for other job seekers - learn design, take one day free for all interviews
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Sliding Window and Dynamic Programming questions

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Best leadership principle
  • Q2. Work experience
Round 2 - Coding Test 

Leetcode medium - given an array of words, determine how many

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

PolicyBazaar Interview FAQs

How many rounds are there in PolicyBazaar Softwaretest Engineer interview?
PolicyBazaar interview process usually has 2 rounds. The most common rounds in the PolicyBazaar interview process are Technical and Coding Test.
What are the top questions asked in PolicyBazaar Softwaretest Engineer interview?

Some of the top questions asked at the PolicyBazaar Softwaretest Engineer interview -

  1. Sql - Find nth highest salary of employ...read more
  2. DSA - Sorted array to ...read more

Recently Viewed

INTERVIEWS

Capgemini

No Interviews

INTERVIEWS

Capgemini

No Interviews

INTERVIEWS

Credera

No Interviews

DESIGNATION

INTERVIEWS

Fiserv

No Interviews

INTERVIEWS

Tech Mahindra

No Interviews

INTERVIEWS

Knorr-Bremse

No Interviews

INTERVIEWS

NASDAQ

No Interviews

LIST OF COMPANIES

Discover companies

Find best workplace

INTERVIEWS

Piramal Group

No Interviews

Tell us how to improve this page.

PolicyBazaar Softwaretest Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Join PolicyBazaar Let's find you the Best Insurance

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
CARS24 Interview Questions
3.5
 • 331 Interviews
JustDial Interview Questions
3.5
 • 328 Interviews
Info Edge Interview Questions
3.9
 • 317 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Lenskart Interview Questions
3.2
 • 304 Interviews
Square Yards Interview Questions
3.8
 • 198 Interviews
View all
PolicyBazaar Softwaretest Engineer Salary
based on 9 salaries
₹3.5 L/yr - ₹8 L/yr
6% more than the average Softwaretest Engineer Salary in India
View more details
Sales Executive
1.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Sales Consultant
1.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Relationship Manager
608 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Associate
381 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
380 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare PolicyBazaar with

Coverfox

4.2
Compare

BankBazaar

3.4
Compare

Paytm Money

3.2
Compare

Easypolicy.com

3.4
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent