i
Teleone
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Jul 2021. There were 4 interview rounds.
The second round is qualified to documentation round
Open mind test, attitude test
How much salary do you expectation now?
I applied via Referral and was interviewed before Apr 2020. There was 1 interview round.
The key to business growth is effective sales and marketing strategies.
Developing a strong sales and marketing plan
Identifying and targeting the right customer segments
Building brand awareness and reputation
Creating compelling marketing campaigns
Providing excellent customer service
Adapting to market trends and changes
Leveraging technology and data analytics
Building and maintaining strong relationships with customers an
I applied via Campus Placement
What should I know that is not on your resume?
What are your hobbies?
Discuss POR and Extra curricular CV points.
Why did you decide to leave your well secure job in PSU?
What do you know about Coal India?
Suppose I am a customer and you have to give a pitch of services that udaan offers. Give me a pitch of 2 minutes.
How B2B marketing is different from B2C marketing?
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
Attitude in the market refers to the overall mindset and approach of individuals towards buying and selling products or services.
Attitude can greatly impact sales and marketing success
Positive attitude can lead to better customer relationships and increased sales
Negative attitude can hinder progress and lead to lost opportunities
Adapting to market trends and customer needs is essential for a successful attitude in the
Negotiable based on experience and benefits package
My expected salary is negotiable and dependent on the overall benefits package offered by the company
I am open to discussing salary based on the responsibilities of the role and market standards
I am looking for a competitive salary that reflects my experience and skills
I applied via Campus Placement
Handled a challenge while handling XYZ POR
Identified the root cause of the challenge
Developed a plan to address the challenge
Collaborated with cross-functional teams to implement the plan
Monitored progress and made adjustments as needed
Successfully resolved the challenge and achieved desired results
I applied via Campus Placement
Different GD which was like a proper conversation where everybody got a chance to speak. Not like a fish market. It was also guided by company people.
Case on how would you manage the big billion sale in amazon- everything from sales to inventory to logistics to tech.
Then after discussion, everybody was given a specific vertical to speak on how to develop and one person to summarize overall. Overall, it was a good gd.
I would improve the Udaan business model by expanding its reach and diversifying its offerings.
Increase the number of cities and towns where Udaan operates to reach more customers
Add new product categories to attract a wider range of buyers and sellers
Invest in technology to improve the user experience and streamline operations
Offer more value-added services such as financing and logistics to differentiate from competi...
Udaan's approach to handling non-repayment of loans to small businesses
Udaan has a rigorous screening process to ensure borrowers have the ability to repay the loan
In case of non-repayment, Udaan has a dedicated team to follow up with the borrower and understand the reason for non-payment
Udaan may offer a repayment plan or negotiate a settlement with the borrower
If necessary, Udaan may take legal action to recover the ...
I applied via Campus Placement
6 panelists.
Case-based GD.
Topic: Improving profits of Swiggy.
Most of the panelists were speaking on Cost side and about improving efficiency of operations. I focused on improving revenue and I introduced ongoing concept called Cloud Kitchen.
4 people were selected.
Each of us was asked to elaborate on our proposed ideas individually and there was no discussion to be done among us.
I mentioned Swiggy could collaborate with Udaan for vegetables etc.
I applied via Company Website and was interviewed in Jan 2022. There were 5 interview rounds.
Marketing and selling
Best policy in the product assistant manager
I was interviewed before Dec 2020.
Round duration - 120 minutes
Round difficulty - Medium
The Entire Test is held in HackerRank Platform. It has:
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
The fi...
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
Given an arbitrary array arr
consisting of N
non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...
Find the unique element in an array where every other element appears thrice.
Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.
Round duration - 60 minutes
Round difficulty - Medium
It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Program to find the number with maximum frequency in an array of integers.
Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Telecaller
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Tele Sales Executive
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
39
salaries
| ₹0 L/yr - ₹0 L/yr |
Telecalling Executive
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
16
salaries
| ₹0 L/yr - ₹0 L/yr |
HomeShop18
SHOP CJ Network
Naaptol Online Shopping
Star Cj Alive