i
PolicyBazaar
Filter interviews by
Clear (1)
I was interviewed in Jun 2024.
Basic leetcode easy question. Find unique number in strung
Top trending discussions
Very easy question over online platform
I applied via Referral and was interviewed in Mar 2023. There were 4 interview rounds.
The first round is OA and the majority questions are from leet code or similar
Find the longest substring with at most k distinct characters.
Use a sliding window approach to keep track of the distinct characters in the substring.
Keep track of the start and end indices of the current substring.
Update the start index of the substring when the number of distinct characters exceeds k.
Update the end index of the substring and the length of the longest substring when a new longest substring is found.
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
I applied via Approached by Company and was interviewed in Feb 2023. There were 5 interview rounds.
2 da questions based on maps and set
2 questions again on graph and dp
Design a service for online grocery shopping with a wide range of products and delivery options.
Create a user-friendly website or app for customers to browse and order groceries
Implement a secure payment gateway for online transactions
Integrate a robust inventory management system to track products and availability
Offer various delivery options such as express delivery or scheduled delivery
Provide customer support for
I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.
2 medium/hard level algorithm questions
Design Parking - at C# ~ hour
Sliding Window and Dynamic Programming questions
Leetcode medium - given an array of words, determine how many
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 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
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