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

PolicyBazaar Senior MIS Executive Interview Questions and Answers

Updated 10 Jan 2022

PolicyBazaar Senior MIS Executive Interview Experiences

1 interview found

I applied via Referral and was interviewed in Jul 2021. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Why should we hire you? Can you solve these questions in this amount of time? Do you think there is a need for communication in MIS?
  • Ans. First of all, be confident and then answer them in such a way that you have been in this work for many years and you are an expert. And the point is to solve the question and make sure to attempt all questions .
  • Answered by Jyoti Kashyap

Interview Preparation Tips

Interview preparation tips for other job seekers - First your body language noticed, your way of talking, your confidence , thn your skills ,

Interview questions from similar companies

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com

Interview Questionnaire 

2 Questions

  • Q1. Why Amazon?
  • Q2. What do you expect from Amazon?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be open to anything, and keep your expectations low as your expectations might kill you. Just relax and take everything in a healthy way

Associate Interview Questions & Answers

Amazon user image Arshiya Saba

posted on 10 Sep 2020

I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Basic Q & A

Interview Preparation Tips

Interview preparation tips for other job seekers - First-round I had English grammatical questions following that it took me to speech recognition, listen and type or type & email drafting. all you need is a calm mind and peaceful place and your set to go.

I applied via Referral and was interviewed before May 2021. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. How much time u work continues
  • Q2. How much salary do u expect

Interview Preparation Tips

Interview preparation tips for other job seekers - Really hard work as associate good for Hrs

I was interviewed in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. They asked about How have you developed Business in your Ex Company

Interview Preparation Tips

Interview preparation tips for other job seekers - I explained that we rigorously used to do telling calling as well as Birthday-Anniversary wish and offer calling and thus we used to develop our Business. I was First Got Hired through Consultancy via Naukari and after seeing my performance, Amazon-Prione consumed me to the main business on pay roll.

I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. SQL, Business cases

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with examples for each of the 14 principles

I applied via Walk-in and was interviewed before Jun 2021. There were 2 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 tips
Round 2 - Group Discussion 

HR told about the company on the first day, how it works, told the rules, showed the management and a lot

Interview Preparation Tips

Topics to prepare for Amazon Associate interview:
  • Safery
  • Environment
  • Cleaning
Interview preparation tips for other job seekers - There is nothing to worry, if you have the desire to work and have passion, then you can work anywhere.

I was interviewed before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

    • Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

PolicyBazaar Interview FAQs

How to prepare for PolicyBazaar Senior MIS Executive interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at PolicyBazaar. The most common topics and skills that interviewers at PolicyBazaar expect are Advanced Excel, Conditional Formatting, Countif, Formulas and HLOOKUP.

Tell us how to improve this page.

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 Senior MIS Executive Salary
based on 63 salaries
₹3.4 L/yr - ₹6.2 L/yr
17% more than the average Senior MIS Executive Salary in India
View more details

PolicyBazaar Senior MIS Executive Reviews and Ratings

based on 7 reviews

3.7/5

Rating in categories

3.8

Skill development

3.6

Work-life balance

3.9

Salary

3.8

Job security

3.8

Company culture

4.0

Promotions

3.5

Work satisfaction

Explore 7 Reviews and Ratings
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
904 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
367 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Associate
362 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