i
PolicyBazaar
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2023. There were 4 interview rounds.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed before Mar 2023. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Dec 2023. There were 2 interview rounds.
To handle a fast-paced industry, prioritize tasks, delegate effectively, stay organized, and adapt quickly to changes.
Prioritize tasks based on urgency and importance
Delegate tasks to team members to ensure efficiency
Stay organized with to-do lists, calendars, and project management tools
Adapt quickly to changes in the industry by staying informed and being flexible
Creating a team involves identifying goals, selecting team members, fostering communication, and promoting collaboration.
Identify the goals and objectives of the team
Select team members with diverse skills and strengths
Foster open communication and encourage feedback
Promote collaboration and teamwork
Provide opportunities for team building activities
Set clear expectations and roles for each team member
To manage a team efficiently, it is important to set clear goals, communicate effectively, delegate tasks, provide support, and recognize achievements.
Set clear goals and expectations for each team member
Communicate regularly and effectively with the team
Delegate tasks based on team members' strengths and skills
Provide support and resources to help team members succeed
Recognize and reward achievements to motivate the t
I lead my ledger ship in real estate by setting clear goals, empowering my team, and staying updated on market trends.
Setting clear goals and objectives for the team to work towards
Empowering team members to make decisions and take ownership of their work
Staying updated on market trends and adapting strategies accordingly
Building strong relationships with clients and stakeholders
Implementing efficient processes and sys
I applied via Referral and was interviewed before Jan 2024. There was 1 interview round.
I have over 10 years of experience in various management roles, including leading teams, developing strategies, and driving business growth.
Led cross-functional teams to successfully launch new products
Developed and implemented strategic plans to increase revenue by 20%
Managed budgets and resources effectively to meet financial targets
Built strong relationships with key stakeholders to drive collaboration and achieve g
I applied via Referral and was interviewed in May 2021. There were 5 interview rounds.
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.
The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.
Traverse the n-ary tree using a depth-first search (DFS) algorithm
Keep track of the count of 'B' occurrences
When the count reaches 3, return the current position
If the end of the tree is reached before the 3rd 'B', return -1
Check if a given string is a composite of two words from a limited dictionary.
Create a hash set of all the words in the dictionary.
Iterate through all possible pairs of substrings in the given string.
Check if both substrings are present in the hash set.
If yes, return true. Else, return false.
Switch adjacent nodes in a single linked list.
Traverse the linked list and swap adjacent nodes.
Keep track of previous node to update its next pointer.
Handle edge cases for first two nodes and last node.
Example: 1->2->3->4 becomes 2->1->4->3.
Traverse only the left sub-tree of a binary search tree.
Start at the root node
If the left child exists, visit it and repeat the process
If the left child does not exist, return to the parent node
Continue until all nodes in the left sub-tree have been visited
Design an efficient data structure for two lifts in a building of n floors.
Use a priority queue to keep track of the floors each lift is heading to
Implement a scheduling algorithm to determine which lift to assign to a new request
Consider adding a weight limit to each lift to prevent overloading
Use a hash table to keep track of the current location of each lift
To find the maximum number that can be formed from the digits of an integer.
Convert the integer to a string
Sort the characters in descending order
Join the sorted characters to form the maximum number
based on 2 interviews
Interview experience
based on 12 reviews
Rating in categories
Sales Executive
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Sales Consultant
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
608
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Associate
381
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
380
salaries
| ₹0 L/yr - ₹0 L/yr |
Coverfox
BankBazaar
Paytm Money
Easypolicy.com