Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Naukri Team. If you also belong to the team, you can get access from here

Naukri Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Naukri Nokia Sales Promoter Interview Questions and Answers

Updated 9 Jun 2024

Naukri Nokia Sales Promoter Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in May 2024. There were 3 interview rounds.

Round 1 - Assignment 

How do you work in this company in people?

Round 2 - One-on-one 

(2 Questions)

  • Q1. How do you work in this company?
  • Q2. What are the uses in company?
  • Ans. 

    The uses of Nokia products in a company include communication, collaboration, productivity, and data security.

    • Communication: Nokia phones and devices are used for making calls, sending messages, and staying connected with colleagues.

    • Collaboration: Nokia products enable employees to work together on projects, share files, and communicate effectively.

    • Productivity: Nokia devices help employees stay organized, manage their...

  • Answered by AI
Round 3 - Assignment 

How to use in this company?

Interview Preparation Tips

Interview preparation tips for other job seekers - Hardwork &honesty in people

Interview questions from similar companies

I applied via Walk-in and was interviewed before Aug 2021. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Why you want to join us

Interview Preparation Tips

Interview preparation tips for other job seekers - Just be confident .
They are just checking your communication skill

I applied via Naukri.com and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. What do you know about the company and what we do.
  • Ans. 

    The company is a leading provider of sales solutions and services.

    • The company offers a wide range of sales solutions, including CRM software, lead generation, and sales training.

    • They have a strong track record of helping businesses increase their sales and revenue.

    • The company has a team of experienced sales professionals who work closely with clients to understand their needs and provide tailored solutions.

    • They have a ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - This is a very simple question but some people get confused about selling and comparing. The company compares the policy and provide you the best policy suited and sell policy.

I applied via Recruitment Consultant and was interviewed in Dec 2019. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Tell me about yourself
  • Q2. What your key point
  • Ans. 

    My key point is my ability to build strong relationships with clients and exceed sales targets.

    • Building strong relationships with clients

    • Exceeding sales targets consistently

    • Effective communication and negotiation skills

    • In-depth knowledge of the product or service being sold

    • Ability to identify and capitalize on new sales opportunities

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Any interview say what you are

I appeared for an interview before Jan 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The round was held on Google Meet and I was given 2 coding problems for which first I had to explain my approach and then I had to write code in Shared Google Docs and dry run on sample test cases and discuss Time and Space Complexity.

  • Q1. 

    Validate BST Problem Statement

    Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.

    A binary search tree (BST)...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both left and right subtrees are also binary search trees.

  • Answered by AI
  • Q2. 

    Maximum Sum Path from Leaf to Root

    Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.

    Example:

    All the possibl...

  • Ans. 

    Find the path from a leaf node to the root node with the maximum sum in a binary tree.

    • Traverse the binary tree from leaf to root while keeping track of the sum of each path.

    • Compare the sums of all paths and return the path with the maximum sum.

    • Use recursion to traverse the tree efficiently and keep updating the maximum sum path.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithms round where I was asked to solve 2 coding problems explaining my approach with proper Complexity Analysis . After the coding questions were over there was some time left so the interviewer asked me some concepts related to DBMS.

  • Q1. 

    Next Permutation Problem Statement

    You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...

  • Ans. 

    The task is to rearrange a given permutation of 'N' integers to form the lexicographically next greater permutation.

    • Iterate from right to left to find the first element that is smaller than the element to its right.

    • Swap this element with the smallest element to its right that is greater than it.

    • Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.

  • Answered by AI
  • Q2. 

    Largest BST Subtree Problem Statement

    You are given a binary tree with 'N' nodes. Your task is to determine the size of the largest subtree within the binary tree which is also a Binary Search Tree (BST).

    ...
  • Ans. 

    Find the size of the largest subtree in a binary tree that is also a Binary Search Tree.

    • Traverse the tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST subtree encountered so far.

    • Use recursion to solve this problem efficiently.

    • Example: For the input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the largest BST subtree has a size of 3.

  • Answered by AI
  • Q3. Can you explain indexing in databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

    • Types of indexes include B-tree, hash, and bitmap indexes.

    • Indexes can improve the performance of SELECT queries but may slow down INSERT, UPDATE, and DELETE operation...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round also had 2 questions related to DS and Algo . One was from graphs and the other was an implementation of a LRU Cache . There were 2 interviewers and both of them were quite friendly and helpful. Overall, this round went well.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges (edges that point to an ancestor node).

    • Maintain a visited array to keep track of visited nodes and a recursion stack to keep track of nodes in the current path.

    • If a back edge is found during traversal, a cycle exists in the graph.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when inserting new items.

    • Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.

    • Implement get(...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Oct 2019. There were 5 interview rounds.

Interview Questionnaire 

9 Questions

  • Q1. Graph Question:- There is a chessboard. It is different from the normal chessboard. White and black blocks can be anywhere. Source and destination block are given. I was asked to find the path with a mini...
  • Q2. Find the sum of k smallest number in a BST.
  • Ans. 

    Find sum of k smallest numbers in a BST.

    • Traverse the BST in-order and add the k smallest numbers to a sum variable.

    • Use a priority queue to keep track of the k smallest numbers.

    • If k is greater than the number of nodes in the BST, return the sum of all nodes.

    • If k is 0, return 0.

  • Answered by AI
  • Q3. System design of BookMyShow. Design the algorithm and database for the seat booking system. How this the system will handle the case when the payment gets failed. Again he asked me to write the query for...
  • Ans. 

    Design algorithm and database for seat booking system of BookMyShow and handle failed payments.

    • Create a database with tables for movies, theaters, seats, bookings, and payments

    • Use a locking mechanism to prevent double booking of seats

    • If payment fails, release the locked seats and notify the user

    • Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;

  • Answered by AI
  • Q4. Write the code for the time stamp in C.
  • Ans. 

    Code for time stamp in C

    • Use the time.h header file

    • Call the time() function to get the current time in seconds

    • Convert the time to a string using strftime() function

    • Use the format string to specify the desired format of the time stamp

  • Answered by AI
  • Q5. Write the code for rearranging the array in consecutive pair multiplication. For example consider an array with 10 element A0, A1, A2......A9. The resultant array will be A0*A1, A1*A2, A2*A3, and so on. Th...
  • Ans. 

    Rearrange array in consecutive pair multiplication in descending order.

    • Create a new array to store the multiplied values

    • Use a loop to iterate through the original array and multiply consecutive pairs

    • Write a compare function to sort the new array in descending order

  • Answered by AI
  • Q6. Write the code to rearrange the array in maximum-minimum form.
  • Ans. 

    Code to rearrange an array in maximum-minimum form.

    • Sort the array in descending order.

    • Create a new array and alternate between adding the maximum and minimum values from the sorted array.

    • Return the new array.

    • Time complexity: O(nlogn)

    • Space complexity: O(n)

  • Answered by AI
  • Q7. What is stoi function (stoi() function)? Its uses and code to Implement stoi function.
  • Ans. 

    stoi() function converts a string to an integer.

    • stoi() is a C++ function that takes a string as input and returns an integer.

    • It is used to convert a string of digits into an integer.

    • It can also handle negative numbers and ignore leading whitespace.

    • Example: int num = stoi("123"); // num is now 123

  • Answered by AI
  • Q8. Write code for Longest Common Substring. (time limit for writing this code was 5-6 minutes)
  • Ans. 

    Code for finding the longest common substring in an array of strings.

    • Iterate through the first string and check for all possible substrings

    • Check if the substring is present in all other strings

    • Keep track of the longest common substring found so far

    • Return the longest common substring

  • Answered by AI
  • Q9. Q: What is a Transaction in DBMS and ACID properties? Q: What is Thread and how it is different from the Process? Q: What are some Linux commands. Write any 5 commands? Q: Why sudo is used for commands?...
  • Ans. 

    Answers to common technical questions in a software engineering interview

    • A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.

    • A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.

    • Common Linux commands include ls...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident about what you speak.

Take your step forward. Try to be firstly interviewed if choice arrives ( They get screwed up at the end and ask questions that the previous candidates failed ).

Before approaching the solution to be clear with edge test-cases. Once you are completely sure then come up with an approach.

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Naukri Interview FAQs

How many rounds are there in Naukri Nokia Sales Promoter interview?
Naukri interview process usually has 3 rounds. The most common rounds in the Naukri interview process are Assignment and One-on-one Round.

Tell us how to improve this page.

Naukri Nokia Sales Promoter Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
3.9
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 433 Interviews
PolicyBazaar Interview Questions
3.6
 • 371 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
Meesho Interview Questions
3.7
 • 331 Interviews
JustDial Interview Questions
3.5
 • 330 Interviews
Info Edge Interview Questions
3.9
 • 318 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
View all

Naukri Nokia Sales Promoter Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

4.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Assistant Manager
131 salaries
unlock blur

₹3.8 L/yr - ₹10 L/yr

Senior Executive
108 salaries
unlock blur

₹3 L/yr - ₹8 L/yr

Senior Executive Corporate Sales
95 salaries
unlock blur

₹4 L/yr - ₹7 L/yr

Deputy Manager
85 salaries
unlock blur

₹6 L/yr - ₹14 L/yr

Assistant Manager Corporate Sales
79 salaries
unlock blur

₹4.3 L/yr - ₹9.5 L/yr

Explore more salaries
Compare Naukri with

Amazon

4.1
Compare

Flipkart

3.9
Compare

Udaan

3.9
Compare

Indiamart Intermesh

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview