Filter interviews by
I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.
Audio Listening & Given Answer
Tell m3 about yourself and one remember day of your life
I applied via Walk-in and was interviewed before Apr 2021. There were 2 interview rounds.
posted on 1 Aug 2020
I applied via Recruitment Consultant and was interviewed in Feb 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed before Dec 2020. There were 3 interview rounds.
Experienced retail professional with strong leadership skills and a proven track record of driving sales and exceeding targets.
Over 5 years of experience in retail management
Successfully led a team of 15 sales associates to achieve a 20% increase in sales revenue
Implemented new sales strategies that resulted in a 10% growth in customer base
Proficient in inventory management and budget planning
I expect a competitive salary that reflects my skills, experience, and the responsibilities of the Assistant Manager role.
I have researched the average salary range for Assistant Managers in this industry and location.
I have considered my qualifications, experience, and the value I can bring to the company.
I am open to discussing the salary package and benefits offered by the company.
I believe a fair and competitive sa...
I have extensive experience in the retail sector, including managing teams, driving sales, and ensuring excellent customer service.
Managed a team of 15 sales associates, providing guidance and support to achieve sales targets
Implemented strategies to increase customer satisfaction, resulting in a 20% improvement in customer feedback ratings
Developed and executed promotional campaigns to drive foot traffic and boost sal...
Reverse a linked list using iterative and recursive methods.
Iterative method involves traversing the list and changing the pointers to reverse the order.
Recursive method involves calling the function recursively on the next node and changing the pointers.
Both methods have O(n) time complexity and O(1) space complexity.
Example: 1->2->3->4->5 becomes 5->4->3->2->1.
Clone a linked list with a random pointer.
Create a new node for each node in the original list.
Use a hash table to map the original nodes to their clones.
Iterate through the original list again and update the random pointers of the clone nodes.
based on 2 interviews
Interview experience
based on 22 reviews
Rating in categories
Lead Generation Executive
15
salaries
| ₹1.5 L/yr - ₹3 L/yr |
International Process Associate
5
salaries
| ₹1.6 L/yr - ₹3 L/yr |
Customer Support Executive
4
salaries
| ₹2.5 L/yr - ₹3 L/yr |
Customer Care Executive
4
salaries
| ₹2 L/yr - ₹2.2 L/yr |
Data Entry Operator
3
salaries
| ₹0.9 L/yr - ₹2 L/yr |
NIKE
Adidas
Under Armour
Reebok