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 Database Developer Interview Questions, Process, and Tips

Updated 25 Jan 2022

Top PolicyBazaar Senior Database Developer Interview Questions and Answers

  • Q1. Can you discuss the numeric data types available in SQL Server?
  • Q2. What is the difference between Merge and Union All transformations in SQL?
  • Q3. What is the difference between the Snowflake schema and the Star schema in data warehousing?
View all 17 questions

PolicyBazaar Senior Database Developer Interview Experiences

2 interviews found

I appeared for an interview in Mar 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on DBMS and SQL

  • Q1. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of data.

    • They work similar to the index in a book, allowing the database to quickly find the rows that match a certain value.

    • Examples of indexes include primary keys, unique keys, and composite indexes.

    • With...

  • Answered by AI
  • Q2. Can you discuss the numeric data types available in SQL Server?
  • Ans. 

    SQL Server offers various numeric data types for storing different types of numerical values.

    • SQL Server provides data types like int, bigint, smallint, tinyint for storing whole numbers.

    • Numeric data types like decimal and numeric are used for storing fixed-point numbers.

    • Float and real data types are used for storing floating-point numbers with different precision levels.

    • Money and smallmoney data types are used for stor

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DBMS and SSIS.

  • Q1. What is normalization in the context of database management systems?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization involves breaking down data into smaller, more manageable tables

    • It helps in reducing data redundancy by storing data in a structured manner

    • Normalization ensures data integrity by minimizing anomalies such as update, insert, and delete anomalies

    • There are different normal forms like 1NF, 2NF, 3NF, a

  • Answered by AI
  • Q2. Can you explain the concept of Containers in SSIS?
  • Ans. 

    Containers in SSIS are logical grouping of tasks and components that help in organizing and managing workflows.

    • Containers help in organizing and managing workflows in SSIS packages

    • They can be used to group related tasks together for better readability and maintenance

    • Examples of containers in SSIS include Sequence Container, For Loop Container, and Foreach Loop Container

  • Answered by AI
  • Q3. What are the different row transformations in SSIS?
  • Ans. 

    Different row transformations in SSIS include Conditional Split, Derived Column, Lookup, and Merge.

    • Conditional Split: Routes data rows to different outputs based on specified conditions.

    • Derived Column: Adds new columns or modifies existing columns using expressions.

    • Lookup: Retrieves data from a related table based on a specified key.

    • Merge: Combines data from multiple sources into a single dataset.

  • Answered by AI
  • Q4. What are event handlers in SSIS?
  • Ans. 

    Event handlers in SSIS are workflows that are triggered by specific events during the execution of a package.

    • Event handlers can be used to perform additional tasks or actions based on the success or failure of specific tasks within a package.

    • Common events that can trigger event handlers include OnError, OnPreExecute, OnPostExecute, OnWarning, etc.

    • Event handlers can be configured to send emails, log information, execute...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on Data warehousing and SSIS.

  • Q1. What is the difference between the Snowflake schema and the Star schema in data warehousing?
  • Ans. 

    Snowflake schema has normalized dimension tables while Star schema has denormalized dimension tables.

    • Snowflake schema has a centralized fact table connected to multiple dimension tables normalized into sub-dimension tables.

    • Star schema has a denormalized structure with dimension tables directly connected to the fact table.

    • Snowflake schema requires more joins for querying data compared to Star schema.

    • Star schema is easie...

  • Answered by AI
  • Q2. What is the difference between Merge and Union All transformations in SQL?
  • Ans. 

    Merge combines two result sets into one, while Union All combines and includes duplicates.

    • Merge is used to combine two result sets into one, eliminating duplicates.

    • Union All is used to combine two result sets into one, including duplicates.

    • Merge requires the result sets to have the same number of columns and compatible data types.

    • Union All does not require the result sets to have the same number of columns or data type

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. Eligibility criteriaAbove 7 CGPAPolicyBazaar.com interview preparation:Topics to prepare for the interview - Database, SSIS, Algorithms, System Design, Operating SystemsTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Mar 2021. There were 6 interview rounds.

Interview Questionnaire 

10 Questions

  • Q1. 1. What is indexing. some practical questions based on indexing?
  • Q2. 2. What is Bookmarking, Row id, Key Index, covering index?
  • Ans. 

    Explanation of database terms: Bookmarking, Row id, Key Index, covering index.

    • Bookmarking is a feature that allows users to save the location of a record in a database for future reference.

    • Row id is a unique identifier assigned to each row in a table.

    • Key Index is an index created on a column or set of columns that uniquely identifies each row in a table.

    • Covering index is an index that contains all the columns required ...

  • Answered by AI
  • Q3. 3.Details of all types of Data Types
  • Ans. 

    Data types are classifications of data items that determine the nature of operations that can be performed on them.

    • Numeric data types: int, float, double, decimal

    • Character and string data types: char, varchar, text

    • Date and time data types: date, time, datetime

    • Boolean data type: bool

    • Binary data types: binary, varbinary, image

  • Answered by AI
  • Q4. 4. What is Normalization
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and dependency.

    • It involves breaking down a table into smaller tables and defining relationships between them.

    • Normalization helps to eliminate data inconsistencies and anomalies.

    • There are different levels of normalization, with each level having specific rules to follow.

    • For example, first normal form (1NF) requires that each column in a t...

  • Answered by AI
  • Q5. 5.Containers in SSIS
  • Ans. 

    Containers in SSIS are logical groupings of tasks and containers that define the workflow of an SSIS package.

    • Containers can be used to group related tasks together and provide a clear visual representation of the package workflow.

    • There are several types of containers in SSIS, including Sequence Containers, For Loop Containers, and Foreach Loop Containers.

    • Sequence Containers are used to group tasks together and define t...

  • Answered by AI
  • Q6. 6.Types of Transformations in SSIS?
  • Ans. 

    Transformations in SSIS are used to modify data during ETL process.

    • Data Conversion Transformation

    • Conditional Split Transformation

    • Aggregate Transformation

    • Sort Transformation

    • Merge Transformation

    • Lookup Transformation

    • Derived Column Transformation

    • Multicast Transformation

    • Union All Transformation

    • Pivot Transformation

    • Unpivot Transformation

  • Answered by AI
  • Q7. 7.Event Handling and Error Handling in SSIS?
  • Ans. 

    Event and error handling are crucial in SSIS to ensure smooth execution and proper handling of exceptions.

    • Event handling involves capturing and responding to events that occur during package execution.

    • Error handling involves identifying and handling errors that occur during package execution.

    • SSIS provides various built-in event handlers and error handlers, such as OnError, OnTaskFailed, OnPostExecute, etc.

    • Custom event ...

  • Answered by AI
  • Q8. 8.Star Flake and Snow Flake Schema which one's performance is better?
  • Ans. 

    Snow Flake Schema has better performance than Star Flake Schema.

    • Snow Flake Schema has normalized tables which reduces data redundancy and improves query performance.

    • Star Flake Schema has denormalized tables which can lead to data redundancy and slower query performance.

    • Snow Flake Schema is better suited for complex queries with multiple joins.

    • Star Flake Schema is better suited for simple queries with fewer joins.

    • Perfor...

  • Answered by AI
  • Q9. 9.What is Temp Variables, Temp Tables, CTE
  • Ans. 

    Temp variables, tables, and CTE are used in SQL to store temporary data during query execution.

    • Temp variables are used to store temporary data within a query.

    • Temp tables are used to store temporary data that can be accessed by multiple queries.

    • CTE (Common Table Expression) is a temporary result set that can be referenced within a SELECT, INSERT, UPDATE, or DELETE statement.

    • Temp variables and tables are created using th...

  • Answered by AI
  • Q10. 10. Difference between merge and union?
  • Ans. 

    Merge combines two tables based on a specified condition, while union combines two tables with the same structure.

    • Merge is used to update or insert data into a target table based on a join condition with a source table.

    • Union is used to combine the results of two SELECT statements into a single result set.

    • Merge requires a join condition and can perform insert, update, and delete operations.

    • Union requires that both table...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Look Good. Be Confident, Always wear a watch during Interview. Try to make eye contact even you can't see interviewer on screen

Skills evaluated in this interview

Senior Database Developer Interview Questions Asked at Other Companies

Q1. Can you discuss the numeric data types available in SQL Server?
Q2. What is the difference between Merge and Union All transformation ... read more
Q3. What is the difference between the Snowflake schema and the Star ... read more
Q4. 8.Star Flake and Snow Flake Schema which one's performance is bet ... read more
Q5. What is indexing in the context of databases?

Interview questions from similar companies

I applied via Job Portal and was interviewed before Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Data structure
  • Q2. Java concepts
  • Q3. Handson coding

Interview Preparation Tips

Interview preparation tips for other job seekers - Get handson in any language but be confident

Interview Questionnaire 

7 Questions

  • Q1. Some of The most important Salary Immideyetly Processes
  • Q2. Oneandof Yaer NoukrNoukri.com *****
  • Q3. Noukri.com Online Payment
  • Q4. Fast forward Noukri.com
  • Q5. Brhamanc IT Course hdca and core java programming language Brhamanc IT Information Technology World Asia Pacific region India Tamilnadu Coimbatore Chinnathdagam 641108
  • Q6. Brhamanc IT Course hdca and core java programming language
  • Q7. QUALIFICATION:10TH STANDARD

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Online test which can be attempted anytime between 22 May 2020, 06:00 AM and 25 May 2020, 01:00 AM

  • Q1. 

    Postfix Expression Evaluation Problem Statement

    Given a postfix expression, your task is to evaluate the expression. The operator will appear in the expression after the operands. The output for each expr...

  • Ans. 

    Evaluate postfix expressions by applying operators to operands in a given order.

    • Iterate through the postfix expression and push operands onto a stack

    • When an operator is encountered, pop the required number of operands from the stack, apply the operator, and push the result back onto the stack

    • Continue until the entire expression is evaluated and the final result is left on the stack

  • Answered by AI
  • Q2. 

    Dice Throws Problem Statement

    You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...

  • Ans. 

    The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the number of ways to achieve each sum with different number of dice.

    • Iterate through the dice and sum possibilities to fill up the array.

    • Return the result modulo 10^9 + 7.

    • Optimize the solution ...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

June 25 2020
Timing: 12:00 pm to 1:00 pm
This round was completely devoted to coding. I was asked to introduce myself and then 2 coding questions were asked.

  • Q1. 

    Find First and Last Positions of an Element in a Sorted Array

    Given a sorted array ARR consisting of N integers and an integer X, find the first and last positions of occurrence of X in the array.

    Note:

    ...
  • Ans. 

    Find the first and last positions of an element in a sorted array efficiently.

    • Use binary search to find the first occurrence of X in the array.

    • Use binary search to find the last occurrence of X in the array.

    • Handle cases where X is not present or present only once.

    • Return the first and last positions as 0-based indices.

  • Answered by AI
  • Q2. 

    Maze with N Doors and 1 Key Problem Statement

    You are given an N x N maze where some cells have doors, and you have a key that can be used only once to open a door. Determine if there exists a path from t...

  • Ans. 

    Determine if there exists a path from the top-left cell to the bottom-right cell of a maze with N doors and 1 key.

    • Use depth-first search (DFS) or breadth-first search (BFS) to explore possible paths through the maze.

    • Keep track of the cells visited and use the key only once to open doors.

    • Check if the bottom-right cell is reachable after traversing the maze.

    • Handle edge cases such as the top-left and bottom-right cells ha...

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

9th July 2020
6:30PM to 7:30PM

Round 4 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

23-July 2020
4:00 PM to 5:00 PM
Coding questions + Several questions on computer fundamentals and networking were asked in a rapid-fire manner.

  • Q1. 

    Stock Trading Maximum Profit Problem

    Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...

  • Ans. 

    The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.

    • Iterate through the stock prices and buy on the days when the price is lower than the next day's price, and sell on the days when the price is higher than the next day's price.

    • Calculate the profit by summing up the differences between buying and selling prices.

    • Repeat the process for each test case and output

  • Answered by AI
Round 5 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

6- Aug 2020
3:00 PM to 4:00 PM
Resceduled to: @5:30 PM
Projects, Fundamentals check, Behavioral, Coding

  • Q1. 

    Path Counting in Directed Graph

    Given a directed graph with a specified number of vertices V and edges E, your task is to calculate the total number of distinct paths from a given source node S to all ot...

  • Ans. 

    Calculate total number of distinct paths from a given source node to all other nodes in a directed graph.

    • Use dynamic programming to keep track of the number of paths from the source node to each node.

    • Consider the modulo operation to handle large numbers efficiently.

    • Start by initializing the number of paths from the source node to itself as 1.

    • Iterate through all edges and update the number of paths for each destination ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. Eligibility criteriaDevelopment skills and leadership principlesAmazon interview preparation:Topics to prepare for the interview - Data structures, OOPS, Operating systems, DBMS, NetworkingTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Be confident while answering questions
Tip 2 : Make the interview conversational and Always keep a smiling face
Tip 3 : Ask something at the end of the interview which shows your interest in the company
Tip 4 : Prepare projects on the skills mentioned in the resume

Application resume tips for other job seekers

Tip 1 : Mention projects and internships.
Tip 2 : Keep your resume short and crisp.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

Two coding questions were asked and 90 minutes of time was allotted to solve both the problems

  • Q1. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    Given an array of integers and a target, find all pairs of elements that add up to the target.

    • Iterate through the array and for each element, check if the target minus the element exists in a hash set.

    • If it exists, add the pair to the result. If not, add the element to the hash set.

    • Handle cases where the same element is used twice to form a pair.

    • Return (-1, -1) if no pair is found.

  • Answered by AI
  • Q2. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) algorithm to find the shortest path in the binary matrix.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse the matrix.

    • Return -1 if no valid path exists from source to destination.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The duration was approx 1 hour. The interview was taken by a young SDE-2.

  • Q1. 

    Character Frequency Problem Statement

    You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    The task is to find the frequency of each character from 'a' to 'z' in a given string.

    • Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

    • Iterate through the string and increment the count of the corresponding character in the array.

    • Print the array of frequencies as the output.

  • Answered by AI
  • Q2. 

    Fire in the Cells Problem Statement

    Given a matrix MAT of size N * M, where each cell is either on fire or safe, determine if a person can reach an escape cell without being burnt. The person starts from ...

  • Ans. 

    Determine if a person can reach an escape cell without encountering fire in a matrix.

    • Check if the person can reach an escape cell without encountering fire by simulating the movement of the person and fire spread.

    • If the person can reach an escape cell, return the time taken; otherwise, return -1.

    • Consider the constraints and edge cases while implementing the solution.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

The interviewer introduced himself and asked me to introduce myself.
I told him about the different projects that I had done and the work in the previous company.
I had worked on AWS(Amazon Web Services) so he asked me all the AWS services that I had worked with and to explain one of them. 
I explained about the working of ECS(Elastic Container Service).
After this, he moved to the coding questions.

  • Q1. 

    Maximum 0-1 Distance Problem Statement

    Given a binary matrix of size N*M, find the maximum distance 'di' for every 0-cell to its nearest 1-cell, where the distance is measured using Manhattan distance. Th...

  • Ans. 

    Find the maximum Manhattan distance from a 0-cell to its nearest 1-cell in a binary matrix.

    • Iterate through the matrix to find all 0-cells and calculate their distances to nearest 1-cells using Manhattan distance formula

    • Keep track of the maximum distance found so far and update it if a larger distance is encountered

    • Return the maximum distance as the final result

  • Answered by AI
  • Q2. 

    Search for Indices with Given Difference and Distance

    You are provided with an array containing 'N' non-negative integers, along with two other non-negative integers 'K' and 'M'. Your task is to identify ...

  • Ans. 

    Find a pair of indices in an array with given difference and distance constraints.

    • Iterate through the array and check all possible pairs of indices to satisfy the conditions

    • Use nested loops to compare each pair of indices and their corresponding elements

    • Return 'valid' if a pair of indices is found that meets the conditions, otherwise return 'invalid'

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer was a very senior person with at least 10-15 years of experience. He introduced himself and asked me to tell him about myself. (Leadership principle questions followed)
 

  • Q1. 

    Special Binary Tree Problem Statement

    Determine whether an arbitrary binary tree is special. A binary tree is called special if every node in this tree has either zero or two children.

    Example:

    Input:
    ...
  • Ans. 

    Determine if a binary tree is special if every node has zero or two children.

    • Traverse the tree and check if each node has either 0 or 2 children.

    • Use a recursive approach to check children of each node.

    • If any node has only one child, return false immediately.

    • Example: For the given input, the output should be true.

  • Answered by AI
Round 5 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The interview started with introductions and some Leadership principle questions. The interviewer was again a senior person with at least 10-15 years of experience.

I was asked to explain some AWS services.
He asked me to tell about a time when I had a tight deadline and how I worked during it.
He asked me about a time when I took initiative and came up with something new which helped the entire team.
I had prepared well for the LP questions and was able to answer everything.
After this, we move on to coding questions.

  • Q1. 

    Word Presence in Sentence

    Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.

    Input:

    The first line contains an in...
  • Ans. 

    Check if a given word is present in a sentence as a complete word.

    • Split the sentence into words using spaces as delimiter.

    • Check if the given word matches any of the words in the sentence.

    • Ensure that the word is not just a substring of another word in the sentence.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly.

    • Ensure to handle cache capacity by evicting the least recently used item when the cache is full.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Visvesvaraya National Institute Of Technology. I applied for the job as SDE - 1 in HyderabadEligibility criteriaNoneAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, Graphs, TreesTime required to prepare for the interview - 7 MonthsInterview preparation tips for other job seekers

Tip 1 : Start with the basics if you have lost touch with competitive coding. Don't directly jump to interview questions.
Tip 2 : Create a timetable and set goals. Keep aside 3-4 hours for studying. Consistency is the key.
Tip 3 : Focus on medium and hard questions. Solving a lot of easy questions doesn't help.

Application resume tips for other job seekers

Tip 1 : You should have good projects to showcase.
Tip 2 : Keep it clean and simple.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview 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 appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions
Based on ds and algorithms

  • Q1. 

    Ninja's Pattern with Powers of 2

    Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...

  • Ans. 

    Generate a pattern of numbers in rows following a specific sequence based on powers of 2.

    • Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on based on powers of 2.

    • Fill the pattern with numbers in increasing sequence from 1 to 9, recycling back to 1 after reaching 9.

    • Output the pattern for a given number 'N' of rows.

    • Example: For N = 4, the pattern would be 1, 23, 4567,

  • Answered by AI
  • Q2. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Example: For a node with data 4, left subtree nodes (2, 1, 3) are smaller and righ

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

There was 2 coding questions based on ds and algorithms

  • Q1. 

    Zig-Zag Array Rearrangement

    You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i, the element ARR[...

  • Ans. 

    Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.

    • Iterate through the array and swap elements to satisfy the zig-zag condition.

    • Ensure that for every odd index i, ARR[i] > ARR[i-1] and ARR[i] > ARR[i+1].

    • Multiple correct answers may exist for a given array.

  • Answered by AI
  • Q2. 

    Flatten a Linked List

    You are provided with a linked list of 'N' nodes. Each node contains two pointers: NEXT, pointing to the next node in the list, and CHILD, pointing to a linked list. Each child linke...

  • Ans. 

    Flatten a linked list of sorted child linked lists into a single sorted linked list.

    • Traverse the linked list and maintain a priority queue to keep track of the next smallest element.

    • Merge the child linked lists into the priority queue while traversing the main linked list.

    • Pop elements from the priority queue to create the final flattened linked list.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

My interview started at 9:30 and it took around 45 minutes to complete my interview.This was held on Amazon Chime and the interview lasted for 1 hour. Firstly the interviewer asked to introduce about myself, later asked regarding the projects I have mentioned in my resume. Then started displaying the coding question. The first question is number of islands in a matrix.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases like when the matrix is empty or all cells are water (0s).

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 65 percentAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating Systems, Computer Networks, JavaTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems

Application resume tips for other job seekers

Tip 1 : Mention your skills in which you are perfect
Tip 2 : Mention atleast two projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

10 min for debugging
40 min for problems(coding)
40 min for pyschometric
30 min for aptitude

  • Q1. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. 

    The task is to calculate the total number of unique paths from the top-left to bottom-right corner of an M x N matrix by moving only right or down.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of unique paths for each cell in the matrix.

    • Initialize the first row and first column with 1 as there is only one way to reach each cell in the first row and column.

    • For each cell ...

  • Answered by AI
  • Q2. 

    Most Frequent Word Problem Statement

    You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...

  • Ans. 

    Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.

    • Split strings 'A' and 'B' into words

    • Count frequency of each word in 'A'

    • Check if word is not in 'B' and is the most frequent and lexicographically smallest

    • Return the word or -1 if no such word exists

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

timing was 4 pm . we connected on amazon chime. Initially he asked me a few things from resume then moved on to problem solving.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Largest Rectangle in Histogram Problem Statement

    You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.

    ...
  • Ans. 

    Find the area of the largest rectangle that can be formed within the bounds of a given histogram.

    • Iterate through the histogram bars and maintain a stack to keep track of increasing heights.

    • Calculate the area of the rectangle formed by each bar as the smallest height in the stack times the width.

    • Update the maximum area found so far and return it as the result.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Data structures , oops, operating systems, database management system , algorithmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : be confident since interviewer is looking at how confident you are with your skills
Tip 2 : dont learn the algorithms but try to understand them
Tip 3 : focus on trees and graphs since amazon asks more of that

Application resume tips for other job seekers

Tip 1 : KEEP RESUME SHORT(1 PAGE)
Tip 2 : DONT BLUFF IN RESUME SINCE MY INTERVIEWER ASKED ME LOOKING FROM IT

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series, Prime function, linked lisk value access, query

Interview Preparation Tips

Interview preparation tips for other job seekers - First a test based on amcat. Followed by two technical interview. First Tech Interview basis and overview of you concept of ds and algo will ne asked. In second Tech interview indepth concept of topics such as arrays, linked list, os,algo, etc will be asked. Prepare ds and algo concept, dbms query & concept, internet basis such as protocols, methods,etc.

Best of luck

PolicyBazaar Interview FAQs

What are the top questions asked in PolicyBazaar Senior Database Developer interview?

Some of the top questions asked at the PolicyBazaar Senior Database Developer interview -

  1. 8.Star Flake and Snow Flake Schema which one's performance is bett...read more
  2. 2. What is Bookmarking, Row id, Key Index, covering ind...read more
  3. 9.What is Temp Variables, Temp Tables, ...read more

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.0
 • 5.1k Interviews
Flipkart Interview Questions
3.9
 • 1.4k Interviews
BigBasket Interview Questions
3.9
 • 362 Interviews
JustDial Interview Questions
3.5
 • 330 Interviews
Info Edge Interview Questions
3.9
 • 323 Interviews
Zomato Interview Questions
3.7
 • 312 Interviews
Naukri Interview Questions
4.0
 • 187 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
MakeMyTrip Interview Questions
3.7
 • 123 Interviews
View all

PolicyBazaar Senior Database Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

4.0

Skill development

5.0

Work-life balance

4.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Sales Executive
1.2k salaries
unlock blur

₹1.6 L/yr - ₹5 L/yr

Associate Sales Consultant
1.1k salaries
unlock blur

₹1.5 L/yr - ₹6 L/yr

Relationship Manager
907 salaries
unlock blur

₹2.2 L/yr - ₹5.7 L/yr

Sales Associate
387 salaries
unlock blur

₹1.5 L/yr - ₹5.2 L/yr

Team Lead
377 salaries
unlock blur

₹3.1 L/yr - ₹12.2 L/yr

Explore more salaries
Compare PolicyBazaar with

Amazon

4.0
Compare

Flipkart

3.9
Compare

Indiamart Intermesh

3.6
Compare

BigBasket

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview