PharmEasy interview experience Real time questions & tips from candidates to crack your interview

Technical Lead

PharmEasy
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: Data structures, Low level design, High level design, DBMS, OOPS
Tip
Tip

Tip 1 : Think from very basic level for LLD
Tip 2 : Think from very basic level for HLD 
 

Application process
Where: Other
Eligibility: No Criteria
Resume Tip
Resume tip

Tip 1 : You should have knowledge of your project from a holistic point.
Tip 2 : Don't put the skills on which you haven't worked on.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date21 Apr 2022
Coding problem2

1. Number Of Subsets

Moderate
0/80
Asked in company
PharmEasy

You are given an array 'arr' of size 'n' containing positive integers and a target sum 'k'.


Find the number of ways of selecting the elements from the array such that the sum of chosen elements is equal to the target 'k'.


Since the number of ways can be very large, print it modulo 10 ^ 9 + 7.


Example:
Input: 'arr' = [1, 1, 4, 5]

Output: 3

Explanation: The possible ways are:
[1, 4]
[1, 4]
[5]
Hence the output will be 3. Please note that both 1 present in 'arr' are treated differently.
Problem approach

solved both the questions

Try solving now

2. Minimum time

Moderate
15m average time
85% success
0/80
Asked in companies
Rubrik, Inc.PharmEasy

You are given an arbitrary graph consisting of V vertices and E edges, a source node (S) and a destination node (D). Every node of the graph has a colour (Red, Blue or Green) associated with it. The cost of travelling from one node to some adjacent node takes 1 second. If you stop at a node for 1 second, you will get a colour ball of the colour of the current node.

You have to find the minimum time taken in order to reach from source to destination node ensuring that the number of balls of each colour is equal and non-zero. The source and destination nodes will always be in different colours.

Note:

1. The given graph is never empty and consists of at least 3 nodes with the colour Red, Green and Blue each.
2. There are no self-loops(an edge connecting a node to itself) in a graph.
3. There are no parallel edges i.e no two nodes are directly connected by more than 1 edge in the given graph.
4. The nodes in the graph are numbered from 1 to V.
5. All the edges in the graph are bidirectional.
6. You can stay at one node for more than 1 second as well, but every second you stay there you will get an additional colour ball of the colour of that node.
7. Number of edges(E) in the graph is always equal to V-1.
8. You can also collect the ball from the destination and the source node itself. Also if you reach the destination without having an equal number of balls for each colour, the time calculated would not be valid.
Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date25 Apr 2022
Coding problem1

1. System Design Question

Design Parking Lot

Requirement
1) Ticket should be issued at time of entry
2) Ticket will contain slot information
3) At exit, I need to calculate the price
4) Payment Integeration/ Modes

03
Round
Easy
Video Call
Duration75 minutes
Interview date10 May 2022
Coding problem1

1. System Design Questions

Design Online Multiplayer Game for Ludo.
And then the low level design of same.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
Frontend Developer
4 rounds | 4 problems
Interviewed by PharmEasy
1337 views
0 comments
0 upvotes
Software Engineer
5 rounds | 4 problems
Interviewed by PharmEasy
1044 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
1408 views
0 comments
0 upvotes
Senior Software Engineer
2 rounds | 4 problems
Interviewed by PharmEasy
136 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Technical Lead
2 rounds | 2 problems
Interviewed by Mindtree
1399 views
0 comments
0 upvotes
company logo
Technical Lead
3 rounds | 3 problems
Interviewed by Mindtree
983 views
0 comments
0 upvotes
company logo
Technical Lead
3 rounds | 3 problems
Interviewed by Mindtree
867 views
0 comments
0 upvotes