i
PolicyBazaar
Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Aug 2023. There was 1 interview round.
Top trending discussions
The actual rule for selling more products in this company is to focus on customer needs and provide excellent customer service.
Focus on customer needs and preferences
Provide excellent customer service
Offer promotions and discounts
Maintain high product quality
Stay up-to-date with market trends
Build strong relationships with customers
Encourage customer feedback and use it to improve
Train sales staff to be knowledgeable a
I applied via Naukri.com and was interviewed before Jun 2023. There was 1 interview round.
AI stands for Artificial Intelligence, which is the simulation of human intelligence processes by machines, especially computer systems.
AI involves the development of algorithms that can perform tasks that typically require human intelligence.
Examples of AI include speech recognition, image recognition, natural language processing, and autonomous vehicles.
AI can be categorized into narrow AI (focused on a specific task...
Machine learning is a branch of artificial intelligence that involves developing algorithms and models that can learn from and make predictions or decisions based on data.
Machine learning uses algorithms to analyze data, learn from it, and make predictions or decisions.
It is used in various fields such as healthcare, finance, marketing, and more.
Examples of machine learning applications include recommendation systems, ...
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
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 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 duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
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'.
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 seekersMake 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 interviewSelectedI applied via Naukri.com
I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.
I applied via Referral and was interviewed before May 2021. There was 1 interview round.
I was interviewed in Aug 2017.
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
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.
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)]
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
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 ...
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.
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)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
based on 1 interview
Interview experience
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
614
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
368
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Associate
362
salaries
| ₹0 L/yr - ₹0 L/yr |
Coverfox
BankBazaar
Paytm Money
Easypolicy.com