PharmEasy Careers

Digital healthcare access for medicines, health products, diagnostics and consultations.

pharmeasy.in

About the company

Brand

PharmEasy

Parent company

API Holdings Limited

Founded

2015

Headquarters

Mumbai, Maharashtra, India

Industry

Digital healthcare and e-pharmacy

Corporate status

Active unlisted public company

Services

Medicines, health products, diagnostics and teleconsultations

Product range

More than 100,000 products

Registered users (June 2021)

25 million

Parent revenue (FY2025)

₹5,872 crore

PharmEasy marketplace technology was built in 2015 and the brand is part of API Holdings Limited. Its official about page lists a Mumbai office.

The platform provides home delivery for medicines and health products alongside diagnostic tests and teleconsultations. Its official site says the catalogue exceeds 100,000 products.

PharmEasy reported 25 million registered users as of June 30, 2021. Parent company API Holdings reported fiscal 2025 revenue of ₹5,872 crore, which is labeled separately to avoid treating parent financials as brand-only revenue.

Interview process at PharmEasy

(111 candidate-shared Glassdoor interviews, updated May 17, 2026)

Interview experience

56.7% positive

Interview difficulty

2.91 out of 5

Interview process length

11 days on average, based on 104 reports

Overall experience

EasyDifficult

Prep for your PharmEasy interview with AI

Practise coding, analytics, product and pharmacy discussions.

PharmEasy Interview Questions & Answers

Q: Explain callbacks in Node.js.

A: Define a callback as a function passed for later execution, then explain error-first conventions and how promises can improve composition.

Answer by AI

Use a small asynchronous example.
Mention error handling.
Explain callback nesting risks.

Q: How would you solve the Koko Eating Bananas problem?

A: Binary-search the eating rate and use the total required hours as a monotonic feasibility check.

Answer by AI

Set correct search bounds.
Use ceiling division.
State O(n log m) time.

Q: When would you use binary search, breadth-first search and depth-first search?

A: Use binary search on monotonic ordered spaces, breadth-first search for unweighted shortest paths and depth-first search for traversal or backtracking.

Answer by AI

Name the required structure.
Compare memory behavior.
Give one example for each.

Q: Reverse a linked list and make all tests pass.

A: Iteratively move through the list while preserving the next node and reversing each pointer, then test empty and single-node inputs.

Answer by AI

State the pointer invariant.
Avoid losing the remaining list.
Give O(n) time and O(1) space.