i
JustDial
Filter interviews by
Clear (1)
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 was interviewed in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
Function to check if a string of parenthesis is balanced
Use a stack to keep track of opening parenthesis
If a closing parenthesis is encountered, pop from stack and check if it matches
If stack is empty and a closing parenthesis is encountered, return False
If all parenthesis are matched and stack is empty, return True
Count the occurrences of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Create a dictionary to store the count of each word.
Iterate through the words and increment the count in the dictionary.
Return the dictionary with the word counts.
Find common elements out of two sorted array
Use two pointers to traverse both arrays simultaneously
Compare elements at each pointer and move the pointer of the smaller element
If elements are equal, add to common elements list and move both pointers
Stop when either pointer reaches end of array
Convert a Binary Search Tree to a Doubly Linked List.
Create a DLL node class with left, right, and data fields.
Traverse the BST in-order and add each node to the DLL.
Adjust the left and right pointers of each node to create the DLL.
Return the head of the DLL.
The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.
Use a level order traversal to process the tree nodes.
Maintain a queue to store the nodes at each level.
For each node, set its 'next' field to the next node in the queue.
If a node is the last node at its level, set its 'next' field to NULL.
To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.
Create a hash table to store the anagrams
Iterate through each word in the dictionary
Sort the characters of the word and use it as a key in the hash table
If the key already exists, add the word to the list of values for that key
Print the list of values for the
Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.
Use a hash table to store the file name and line number of each occurrence of the string.
Iterate through each file and for each line, check if the string is present and update the hash table accordingly.
Print the hash table entries for the string.
Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.
Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.
The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.
Amazon offers numerous opportunities for growth and career advancement, allowing me to con...
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before May 2020. There were 4 interview rounds.
based on 5 interviews
Interview experience
based on 3 reviews
Rating in categories
Tele Marketing Executive
1.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
657
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
553
salaries
| ₹0 L/yr - ₹0 L/yr |
Certified Internet Consultant
453
salaries
| ₹0 L/yr - ₹0 L/yr |
Sulekha.com
Indiamart Intermesh
Urban Company