Trent
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2022. There were 2 interview rounds.
Work
It's a very hectic daily job
Top trending discussions
I applied via AngelList and was interviewed before Mar 2023. There were 3 interview rounds.
Had multiple questions on Array and String overall the difficulty level was medium the interviewer was friendly and patient
I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.
Sliding window problem involves finding a subarray of fixed size k with maximum sum.
Use a sliding window approach to iterate through the array and calculate the sum of each subarray of size k.
Keep track of the maximum sum encountered so far.
Move the window by one element at a time and update the sum accordingly.
Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and k = 3, the subarray with maximum sum is [5, 3, 6] with su
Handling critical situations requires quick thinking, clear communication, and a calm demeanor.
Assess the situation and prioritize actions
Communicate clearly and effectively with all parties involved
Remain calm and focused
Take decisive action while considering potential consequences
Seek assistance or advice from colleagues or superiors if necessary
I prioritize the problems based on urgency and importance, and then allocate time and resources accordingly.
Assess the urgency and importance of each problem
Create a plan of action for each problem
Allocate time and resources based on the plan
Regularly reassess and adjust the plan as needed
Example: If one problem is a deadline that cannot be missed and the other is a minor issue, prioritize the deadline and allocate mor
I was interviewed in May 2021.
Round duration - 120 Minutes
Round difficulty - Easy
Given a string S
and a list wordList
containing N
distinct words, determine if each word in wordList
is present in S
. Return a boolean array where the value at index 'i' indi...
Given a string and a list of words, determine if each word in the list is present in the string and return a boolean array indicating their presence.
Iterate through each word in the word list and check if it is present in the string.
Use a boolean array to store the presence of each word in the string.
Consider case sensitivity when checking for word presence.
Do not use built-in string-matching methods.
Return the boolean
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Try solving Love Babbar 450 Prog questions
Tip 2 : Have a good resume
Tip 3 : Do learn some extra technologies eg. ML/AI
Tip 1 : Do not lie at all
Tip 2 : Have some projects listed
posted on 15 Jan 2025
I have a background in management consulting with experience in various industries.
Worked as a consultant at a top consulting firm for 5+ years
Led projects in industries such as healthcare, technology, and finance
Developed strategies for clients to improve operational efficiency and profitability
Department Manager
538
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Officer
287
salaries
| ₹0 L/yr - ₹0 L/yr |
Store Manager
202
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Associate
183
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
97
salaries
| ₹0 L/yr - ₹0 L/yr |
Westside
Shoppers Stop
Reliance Retail
Future Group