Filter interviews by
I applied via Recruitment Consultant and was interviewed in Nov 2021. There was 1 interview round.
I applied via AngelList and was interviewed before May 2023. There was 1 interview round.
I applied via Indeed and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Referral and was interviewed in Jul 2021. There were 2 interview rounds.
Kisan Network interview questions for popular designations
I applied via Company Website and was interviewed in Dec 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2019. There were 3 interview rounds.
To create a new buyer, you need to identify potential customers, understand their needs, develop a compelling value proposition, and engage them through targeted marketing and sales efforts.
Identify potential customers through market research and analysis
Understand the needs and preferences of the target audience
Develop a compelling value proposition that addresses their pain points
Create targeted marketing campaigns t...
Top trending discussions
I applied via Campus Placement
It just like like a screen test they will ask you questions based on your cv
It will hardly take 30minutes to complete the test.
It will take hardly 30 minutes to complete coding test.
I applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
Python dictionary is implemented using hash tables.
Python dictionary is a collection of key-value pairs.
The keys in a dictionary must be unique and immutable.
The values in a dictionary can be of any data type.
Python dictionary is implemented using hash tables.
Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.
The hash function used in Python dictionary is based on the key's h...
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.
It has a time complexity of O(n log n) and is not stable.
Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
posted on 13 May 2024
I applied via Approached by Company and was interviewed in Nov 2023. There were 2 interview rounds.
Contracts review and abstraction
based on 1 interview
Interview experience
based on 34 reviews
Rating in categories
Sales Executive
8
salaries
| ₹1.5 L/yr - ₹3.5 L/yr |
Program Executive
6
salaries
| ₹2.8 L/yr - ₹3.5 L/yr |
Field Executive
5
salaries
| ₹2 L/yr - ₹2.5 L/yr |
Purchase Executive
4
salaries
| ₹2.4 L/yr - ₹3 L/yr |
Customer Care Executive
4
salaries
| ₹1.9 L/yr - ₹2 L/yr |
InsanelyGood
Vegrow
Pepper Content
Elevate