Upload Button Icon Add office photos

PharmEasy

Compare button icon Compare button icon Compare

Filter interviews by

PharmEasy Lead Analyst Interview Questions and Answers

Updated 13 Aug 2024

PharmEasy Lead Analyst Interview Experiences

1 interview found

Lead Analyst Interview Questions & Answers

user image Anonymous

posted on 13 Aug 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Running sum of numbers
  • Ans. 

    Running sum of numbers is a cumulative sum of elements in an array.

    • Iterate through the array and keep adding the current element to the running sum.

    • Store the running sum at each index in a new array.

    • Example: Input array [1, 2, 3, 4], Running sum array [1, 3, 6, 10].

  • Answered by AI
  • Q2. Output of inner, left , outer joins
  • Ans. 

    Inner join returns only matching rows, left join returns all rows from left table and matching rows from right table, outer join returns all rows from both tables

    • Inner join: Returns rows that have matching values in both tables

    • Left join: Returns all rows from the left table and the matched rows from the right table

    • Outer join: Returns all rows when there is a match in either left or right table

  • Answered by AI
Round 2 - Case Study 

Questions about drop in conversion rate

Skills evaluated in this interview

Interview questions from similar companies

I applied via Other and was interviewed in Dec 2021. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Arrange odd and even numbers in an array , so that all even are placed on RHS and odd on LHS
  • Ans. 

    Arrange odd and even numbers in an array, even on RHS and odd on LHS.

    • Create two pointers, one at the start and one at the end of the array.

    • Swap the elements at the pointers if they are in the wrong position.

    • Continue swapping until the pointers meet in the middle.

  • Answered by AI
  • Q2. Evaluate BODMAS expression
  • Ans. 

    BODMAS is a mathematical rule used to evaluate expressions with multiple operators.

    • BODMAS stands for Brackets, Orders, Division, Multiplication, Addition, and Subtraction.

    • It is used to determine the order in which operations are performed in an expression.

    • Brackets are evaluated first, followed by orders (exponents and roots), then division and multiplication, and finally addition and subtraction.

    • For example, in the exp...

  • Answered by AI
  • Q3. Infix and Post fix expression
  • Q4. Android questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on DS Algo, and Android core fundamentals.

Skills evaluated in this interview

Round 1 - One-on-one 

(3 Questions)

  • Q1. Remove duplicates from array
  • Ans. 

    Remove duplicates from array of strings

    • Create a new empty array

    • Loop through the original array

    • Check if the current element exists in the new array

    • If not, add it to the new array

    • Return the new array

  • Answered by AI
  • Q2. Check if num is int or not
  • Ans. 

    Use isinstance() function to check if num is int or not.

    • Use isinstance(num, int) to check if num is an instance of int class.

    • This function returns True if num is an instance of int class, else False.

    • Example: isinstance(5, int) will return True.

    • Example: isinstance(5.0, int) will return False.

  • Answered by AI
  • Q3. JS questions and fundamentalss

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn JS concepts and DSA really well.

Skills evaluated in this interview

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

I applied via LinkedIn and was interviewed in Jul 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Tell me About yourself
  • Q2. Excel formula sum if countif
  • Ans. 

    Using Excel formula SUMIF and COUNTIF to calculate a sum based on a condition.

    • SUMIF function adds the values in a range that meet a specified condition.

    • COUNTIF function counts the number of cells in a range that meet a specified condition.

    • Combine both functions to calculate the sum based on a condition.

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - Coding Test 

4 questions , 3 DSA questions medium level and 1 DB design round

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions on OOPs, Networking, OS app development, projects and DSA questions
Round 3 - One-on-one 

(1 Question)

  • Q1. DB related questions (joins,query) and Linked list medium DSA question.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Walk-in and was interviewed before Apr 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

There was a aptitude test with coding problems

Round 2 - Technical 

(1 Question)

  • Q1. Basic Puzzles were asked

Software Engineer Interview Questions & Answers

Medlife user image nerella saikrishna

posted on 9 Jan 2016

Interview Questionnaire 

12 Questions

  • Q1. Insert a node in a Linked List, if a pointer to a node(it's not a head pointer) of Linked List is given.
  • Q2. What is the Time Complexity of Binary Search and it's derivation
  • Ans. 

    Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.

    • Binary Search is a search algorithm that works on sorted arrays.

    • It starts by comparing the target value to the middle element of the array.

    • If the target value is smaller, the search continues on the lower half of the array.

    • If the target value is larger, the search continues on the upper half of the array.

    • T...

  • Answered by AI
  • Q3. Write code for QuickSort
  • Ans. 

    QuickSort is a sorting algorithm that uses divide and conquer approach.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot

    • Recursively apply the above steps to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q4. Write code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
  • Ans. 

    Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming

    • Recursion: Define a function that calls itself with the previous two numbers in the series as arguments

    • Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration

    • Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series

  • Answered by AI
  • Q5. How to implement an operation with Stacks which will be similar to Queue
  • Ans. 

    Implementing a Queue using Stacks

    • Use two stacks to implement a queue

    • Push elements onto the first stack

    • When dequeuing, pop all elements from the first stack and push onto the second stack

    • Pop the top element from the second stack to dequeue

    • If the second stack is empty, pop all elements from the first stack and push onto the second stack

  • Answered by AI
  • Q6. Write code for MergeSort
  • Ans. 

    MergeSort is a divide and conquer algorithm that sorts an array of strings.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q7. 2 types of detective ball puzzles
  • Q8. 25 Horses, 5 Tracks, 3 Fastest Puzzle
  • Q9. How the letters of a text are determined(Basically about OCR)
  • Q10. Write code for Insertion Sort and Selection Sort and find their time complexities and also the cases where their usage is efficient
  • Q11. Explain about Counting Sort
  • Ans. 

    Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.

    • Count the occurrences of each element in the array

    • Calculate the cumulative sum of the counts

    • Place each element in the sorted array based on its count and cumulative sum

    • Time complexity is O(n+k) where n is the number of elements and k is the range of input

    • Example: Sort an array of strings based on their

  • Answered by AI
  • Q12. When we type a part of a word in chrome, how is it able to show all the types of words, which are consisted of that part
  • Ans. 

    Chrome uses an algorithm to predict and suggest words based on user input.

    • Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.

    • The algorithm also takes into account the frequency and recency of the user's input.

    • Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.

    • The suggestions are di...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: First Question, at the start I was not able to answer and he gave me an hint(He asked me the insertion in an array). So, I got the idea for the insertion in Linked List and was able to answer it.
Remaining questions, I was able to answer confidently.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I was able to answer all the questions confidently, since I know the answers for them, But the last question was out of my scope and I explained based on my intuition and knowledge.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I have given the answers for 1&2 questions with clear explanation. And the third question is again out of my scope and I explained this also based intuition.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

General Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skill Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skills: Logical Puzzles, Algorithms And DataStructures
College Name: IIT Madras
Motivation: 1. Primary Reason: Passionate about Programming and Problem solving.
2. The profile is software Engineer.
3. You can see your idea, having an impact on the society which is possible with this type of company.
4. And a good package.
Funny Moments: Nothing Really...

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There was Pool Campus Placement of  4 Colleges together(NIT Jalandhar,NIT Hamirpur ,Candigarh University and CGC Landran ) at Chandigarh University.Written test was taken on Hacker Rank. There were 5 Coding Questions of Linklist , Dynamic Programming,Priority Queues etc . 
You didn't have to do All the questions (3 can get you to the next round).

One thing that need to be beware of is that on Hacker Rank Your Draft is Saved every second(or so). So don't copy from the internet and just paste there(they will get to know).
Tips: Make sure you practice lot of Algorithms.
Duration: 120 minutes
Total Questions: 5

Round: Problem Statement
Experience: Only 8 Students were selected for this round
20 mins were given for it
and afterwards each student had personal discussion(10 mins) with them to explain their schema .
3-4 Questions were also asked related to your schema and how to perform a particular query
Tips: You should Be Through with DBMS
Make sure there is no redundant table and Primary keys are marked

Round: Technical Interview
Experience: 2 were selected for the Interview
Firstly they make you very Comfortable and ask how were the previous Rounds.
Then they asked about the two questions of First Round and my approach 
Then couple of questions on The design that was made Earlier.
Then there were questions on How Internet Works ,gcc,Linux,git,sql.

Then the Interviewer asked if I have any question
I asked about (as the work on doctor's app) how they know the credibility of a doctor which is enlisted in their app.
Interviewer was really Impressed by the question and told me all about it with all details.


Both were selected
Tips: Be cool in the Interview
Think Loudly and Interact with them well.
If they want you to ask any question ,it should not be related to technical stuff ,it should be related to the company

College Name: NIT JALANDHAR

I applied via Referral

Interview Questionnaire 

5 Questions

  • Q1. I was asked to optimize the last program mentioned above
  • Q2. I was asked in detail about my internship experience and projects
  • Q3. I was asked why I did not contribute to any open source projects
  • Q4. I was asked to explain the code of my android app from my dropbox account
  • Q5. The usual HR questions followed after that

Interview Preparation Tips

Skills:
College Name: NA

Software Engineer Interview Questions & Answers

Practo user image BEKKAM VENKATA ADITYA

posted on 27 Sep 2015

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. General questions. Where are you from, tell about yourself etc..,
  • Q2. Asked me about the projects which i have mentioned in my resume
  • Q3. Some algorithmic questions including data structures. Time complexity, space complexity etc.,
  • Q4. How would you design a snake game present in basic nokia mobiles. Just the data structure part and some functions which are used as the game goes on

Interview Preparation Tips

Round: Test
Experience: A bit difficult but sensible way to get started with the selection procedure. Questions purely attack the algorithmic and stastitic aspects.
Tips: Get yourself ready with conceptual clartity regarding algorithms and stastics . Don't be ambitious to attempt all the questions, completely solving one problem would be more than enough for getting through this level.
Duration: 120 minutes
Total Questions: 3

Round: Technical Interview
Experience: Believe me. You never feel inferior, it's really interactive and very friendly. Interviewer gave me a few chances and hints whenever i've gone wrong. Overall interview experience was awesome.
Tips: If you're up to this round, they believe you have the potential. So don't panic if you are unable to answer their questions. Just tell them which aspects which you are comfortable with and they will proceed correspondingly, Just be honest whatsoever.

Skill Tips: Prefer having some revision about the above skills before undergoing the selection process.
Skills: Math Puzzles, Algorithmic Approach To Problem Solving, Data Structures
Duration: 2months
College Name: IIT Madras
Funny Moments: Receiving the offer letter from HR official who visited our campus :)

PharmEasy Interview FAQs

How many rounds are there in PharmEasy Lead Analyst interview?
PharmEasy interview process usually has 2 rounds. The most common rounds in the PharmEasy interview process are Technical and Case Study.
What are the top questions asked in PharmEasy Lead Analyst interview?

Some of the top questions asked at the PharmEasy Lead Analyst interview -

  1. Output of inner, left , outer jo...read more
  2. Running sum of numb...read more

Tell us how to improve this page.

PharmEasy Lead Analyst Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 330 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Blinkit Interview Questions
3.7
 • 181 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Digit Insurance Interview Questions
4.0
 • 142 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
Urban Company Interview Questions
3.4
 • 134 Interviews
View all
PharmEasy Lead Analyst Salary
based on 4 salaries
₹22 L/yr - ₹26.5 L/yr
62% more than the average Lead Analyst Salary in India
View more details
Pharmacist
281 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
191 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Delight Officer
147 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
113 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
95 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare PharmEasy with

Medlife

3.7
Compare

Tata 1mg

3.6
Compare

Netmeds.com

3.6
Compare

Practo

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