Filter interviews by
I applied via Walk-in and was interviewed in Feb 2023. There were 5 interview rounds.
Good knowledge Sales and March
Multiple Questions And Questions Answer Explain
Group Discussion Multiple Questions And Multiple Answer
I applied via Naukri.com and was interviewed in Oct 2022. There were 2 interview rounds.
My selling style is consultative and relationship-driven.
I focus on understanding the customer's needs and pain points.
I ask open-ended questions to gather information and build rapport.
I offer solutions that align with the customer's goals and budget.
I follow up regularly to ensure customer satisfaction and loyalty.
I applied via LinkedIn and was interviewed in Nov 2022. There were 2 interview rounds.
My current CTC is confidential, but I am open to discussing my salary expectations for this role.
Politely decline to disclose current CTC
Express openness to discussing salary expectations for the new role
Provide a salary range based on research and industry standards
There was multiple questions
I applied via Company Website and was interviewed in Oct 2022. There were 3 interview rounds.
Marketing ideas and how to make money
Marketing strategy is a plan of action designed to promote and sell a product or service.
Identifying target audience
Developing a unique selling proposition
Creating a marketing mix
Setting marketing goals and objectives
Analyzing market trends and competition
Implementing and monitoring the strategy
Examples: social media marketing, email marketing, content marketing
To implement plans, break them down into smaller tasks, assign responsibilities, set deadlines, and track progress.
Break down the plan into smaller, achievable tasks
Assign responsibilities to team members based on their strengths
Set deadlines for each task and hold team members accountable
Track progress regularly and make adjustments as needed
Communicate clearly with team members to ensure everyone is on the same page
To sell more, identify customer needs, build relationships, offer solutions, and follow up.
Understand customer needs and tailor your approach
Build relationships and establish trust
Offer solutions that meet their needs
Follow up to ensure satisfaction and address any concerns
Provide excellent customer service to encourage repeat business
I applied via Company Website
How to aproch the customers ,And to give good respect to move our product
I applied via Job Fair and was interviewed before Mar 2022. There were 2 interview rounds.
The first Governor General of India was Warren Hastings.
Warren Hastings served as the Governor General of India from 1773 to 1785.
He was appointed by the East India Company to oversee the British administration in India.
During his tenure, Hastings implemented several administrative and judicial reforms.
He also played a significant role in expanding British territories in India.
Hastings faced impeachment proceedings in ...
India has a population of over 1.3 billion people, making it the second most populous country in the world.
India's population is estimated to be around 1.366 billion as of 2020.
The country has a diverse population with various ethnic, linguistic, and religious groups.
India's population growth rate has been gradually declining over the years.
The states of Uttar Pradesh and Maharashtra have the highest population in Indi...
To sell a pen, highlight its features, demonstrate its quality, create a need, and close the sale.
Highlight the pen's unique features and benefits
Demonstrate the pen's quality and functionality
Create a need by showing how the pen can improve the customer's life or work
Close the sale by asking for the customer's commitment
I appeared for an interview before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.
Given an array ARR
consisting of N
integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Find the maximum sum of a contiguous subarray in an array of integers.
Use Kadane's algorithm to find the maximum subarray sum in linear time.
Initialize two variables: maxSum and currentSum.
Iterate through the array and update currentSum by adding the current element or starting a new subarray.
Update maxSum if currentSum becomes greater than maxSum.
Return maxSum as the maximum subarray sum.
Round duration - 50 Minutes
Round difficulty - Easy
This was face to face interview round.
You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...
Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.
Traverse the binary tree to find all possible triplets.
Check if the sum of each triplet is greater than X.
Ensure the relationship of grandparent-parent-child in each triplet.
Return the valid triplets in any order.
Handle constraints and edge cases appropriately.
Round duration - 60 Minutes
Round difficulty - Easy
FACE TO FACE ROUND INTERVIEW
Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.
Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.
Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.
Exampl...
Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces
Tip 1 : Only write the things on which you are the most confident about
Final outcome of the interviewRejectedI appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
There was 2 coding questions
Based on ds and algorithms
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize two pointers, one for arrival times and one for departure times.
Increment the platform count when a train arrives and decrement when it departs.
Keep track of the maximum platform count needed.
Return the maximum platform count as the minimum number o
Given a string S
of length N
, an array A
of length M
consisting of lowercase letters, and a positive integer K
, determine the minimum number of swaps r...
The minimum number of swaps required to make a string K-periodic by replacing characters with elements from an array.
Iterate through the string and check if each character matches the character K positions ahead.
Count the number of characters that need to be swapped to make the string K-periodic.
Use the array elements to swap characters in the string.
Return the total number of swaps needed for each test case.
Round duration - 45 minutes
Round difficulty - Medium
It was good round they asked me about all the ds and algo basics
With 2 problems by sharing the screeen
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity while traversing the matrix.
Handle edge ca...
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
Round duration - 50 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
Use BFS to traverse through the shops and keep track of the minimum jumps required.
If at any point the current shop is unreachable (Arr[i] = 0), return -1.
Optimize by using a visited array to avoid revisiting the same shop.
Tip 1 : Be enough confident, don't be nervous. Maintain atleast 2 projects in your resume.
Tip 2 : You should be able to answer each and every thing present in your resume. Don't lie in your resume.
Tip 3 : Prepare Data Structures and Algorithms well. They mostly check our Problem Solving ability to find the solutions for the real world problems
Tip 1 : Build your resume such that it grabs the eye of the interviewer
Tip 2 : metion your key skills and also maintain atleast 2 projects
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Sales Officer
189
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Territory Sales Manager
82
salaries
| ₹3.5 L/yr - ₹11 L/yr |
Deputy Manager
81
salaries
| ₹5.2 L/yr - ₹12.9 L/yr |
Assistant Manager
50
salaries
| ₹2.6 L/yr - ₹9.5 L/yr |
Senior Sales Officer
48
salaries
| ₹2.5 L/yr - ₹4.1 L/yr |
Flipkart
Myntra
Amazon
Snapdeal