i
JustDial
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2020. There were 3 interview rounds.
Yes, I am open for field sales.
I have experience in field sales and enjoy the face-to-face interaction with clients.
I am willing to travel and work flexible hours to meet sales targets.
I understand the importance of building relationships with clients and providing excellent customer service.
I am comfortable with using technology to manage sales activities and track progress.
I am excited about the opportunity to repres...
posted on 12 Jul 2024
I applied via AmbitionBox and was interviewed in Jun 2024. There was 1 interview round.
posted on 2 Dec 2023
I applied via Recruitment Consulltant and was interviewed in Nov 2023. There were 3 interview rounds.
Technological Impect
I applied via LinkedIn and was interviewed in Dec 2021. There was 1 interview round.
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in Nov 2020. There was 1 interview round.
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
Iterate through the linked list to determine its size.
Calculate the position of the k-th node from the end based on the size of the list.
Traverse the list again to reach the k-th node from the end.
Return a pointer to the k-th node from the end.
Round duration - 60 Minutes
Round difficulty - Easy
High level System Design
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
User app for booking rides and tracking
Driver app for accepting rides and navigation
Server for handling requests and communication between apps
Database for storing user, driver, and ride information
Algorithms for matching riders with drivers and routing
Round duration - 45 minutes
Round difficulty - Easy
Basic HR questions
Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation
Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
based on 1 interview
Interview experience
based on 17 reviews
Rating in categories
Tele Marketing Executive
1.3k
salaries
| ₹1.4 L/yr - ₹4.2 L/yr |
Sales Executive
806
salaries
| ₹1.2 L/yr - ₹4.4 L/yr |
Business Development Executive
663
salaries
| ₹1.8 L/yr - ₹5 L/yr |
Team Lead
523
salaries
| ₹2 L/yr - ₹7.2 L/yr |
Certified Internet Consultant
397
salaries
| ₹1.5 L/yr - ₹4.5 L/yr |
Amazon
Flipkart
Amazon Development Centre India