i
JustDial
Filter interviews by
I applied via Walk-in and was interviewed in Aug 2024. There was 1 interview round.
This pen is not just a writing tool, it's a sleek and stylish accessory that will make you stand out in any professional setting.
Highlight the sleek design and professional look of the pen
Emphasize the high quality and durability of the pen
Mention how using this pen will make a great impression on clients and colleagues
I see myself as a top-performing Sales Internet Consultant, leading a team and driving revenue growth through innovative strategies.
Continuously improving my sales skills and knowledge of internet marketing trends
Building strong relationships with clients and exceeding sales targets
Mentoring and training junior consultants to help them succeed
Exploring new opportunities for business development and expansion
The company is a leading provider of internet marketing solutions for businesses.
Specializes in helping businesses improve their online presence
Offers services such as website design, SEO, social media marketing
Has a track record of successful client campaigns
I am passionate about helping businesses grow their online presence and believe in the company's innovative approach to internet sales.
I admire the company's reputation for delivering exceptional results for clients.
I am impressed by the company's cutting-edge technology and tools for internet sales.
I resonate with the company's values and culture, which prioritize customer satisfaction and continuous improvement.
My salary expectation is competitive and based on my experience, skills, and the market rate for this position.
Research the average salary range for Sales Internet Consultants in the industry
Consider your level of experience and skills when determining your salary expectation
Be prepared to negotiate based on the benefits and opportunities offered by the company
I applied via Apna Jobs and was interviewed in Sep 2023. There were 4 interview rounds.
Maths , resoning , general knowledge
Top trending discussions
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
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
based on 5 interviews
Interview experience
based on 3 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