i
PolicyBazaar
Filter interviews by
I appeared for an interview in Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on DBMS and SQL
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...
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
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DBMS and SSIS.
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
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
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.
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...
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions based on Data warehousing and SSIS.
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...
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
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with behavioral problems.
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.
I applied via Naukri.com and was interviewed in Mar 2021. There were 6 interview rounds.
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 ...
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
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...
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...
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
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 ...
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...
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...
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...
Top trending discussions
I appeared for an interview before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The round was held on Google Meet and I was given 2 coding problems for which first I had to explain my approach and then I had to write code in Shared Google Docs and dry run on sample test cases and discuss Time and Space Complexity.
Given a binary tree with N
nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true
; otherwise, return false
.
A binary search tree (BST)...
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 left and right subtrees are also binary search trees.
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
All the possibl...
Find the path from a leaf node to the root node with the maximum sum in a binary tree.
Traverse the binary tree from leaf to root while keeping track of the sum of each path.
Compare the sums of all paths and return the path with the maximum sum.
Use recursion to traverse the tree efficiently and keep updating the maximum sum path.
Round duration - 60 Minutes
Round difficulty - Medium
This was also a Data Structures and Algorithms round where I was asked to solve 2 coding problems explaining my approach with proper Complexity Analysis . After the coding questions were over there was some time left so the interviewer asked me some concepts related to DBMS.
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...
The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.
Iterate from right to left to find the first element that is smaller than the element to its right.
Swap this element with the smallest element to its right that is greater than it.
Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.
You are given a binary tree with 'N' nodes. Your task is to determine the size of the largest subtree within the binary tree which is also a Binary Search Tree (BST).
...Find the size of the largest subtree in a binary tree that is also a Binary Search Tree.
Traverse the tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST subtree encountered so far.
Use recursion to solve this problem efficiently.
Example: For the input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the largest BST subtree has a size of 3.
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 rows that match a certain condition.
Types of indexes include B-tree, hash, and bitmap indexes.
Indexes can improve the performance of SELECT queries but may slow down INSERT, UPDATE, and DELETE operation...
Round duration - 50 Minutes
Round difficulty - Medium
This round also had 2 questions related to DS and Algo . One was from graphs and the other was an implementation of a LRU Cache . There were 2 interviewers and both of them were quite friendly and helpful. Overall, this round went well.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges (edges that point to an ancestor node).
Maintain a visited array to keep track of visited nodes and a recursion stack to keep track of nodes in the current path.
If a back edge is found during traversal, a cycle exists in the graph.
Return true if a cycle is detected, false otherwise.
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...
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 efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when inserting new items.
Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.
Implement get(...
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.
I appeared for an interview before Dec 2020.
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.
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...
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
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
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
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
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.
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.
I appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
Given an array A
containing 'N' integers and an integer m
, rearrange the elements of the array such that the differences between the array elements and m
are sor...
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.
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...
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
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
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
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...
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...
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.
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.
I applied via Campus Placement
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
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
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.
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.
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.
based on 1 review
Rating in categories
Sales Executive
1.2k
salaries
| ₹1.6 L/yr - ₹5 L/yr |
Associate Sales Consultant
1.1k
salaries
| ₹1.8 L/yr - ₹6 L/yr |
Relationship Manager
897
salaries
| ₹2.2 L/yr - ₹6 L/yr |
Sales Associate
384
salaries
| ₹1.8 L/yr - ₹5.2 L/yr |
Team Lead
378
salaries
| ₹3.1 L/yr - ₹12.2 L/yr |
Amazon
Flipkart
Indiamart Intermesh
BigBasket