PharmEasy interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
PharmEasy
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Journey
I started my journey from a government school were i was first introduce with the computer when i was at my 11 th standard now i am a software developer.
Application story
This company visited our campus for hiring their only i applied for the same it has many round starting with online assessment at the starting.
Why selected/rejected for the role?
I was not able to provide all the answers upto the points and hence i am not able to get through the interview .
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Mention some good projects on resume
Tip 2 : Be confident
Tip 3 : Good with computer science basics and ds and algo
Application process
Where: Campus
Eligibility: Above 6 CGPA
Tip 1 : Good Projects
Tip 2 : Having some achievements is plus point
Interview rounds
01
Round
Medium
Video Call
Duration60 minutes
Interview date15 Feb 2023
Coding problem2
1. Minimum Coins
Moderate
30m average time
70% success
0/80
Asked in companies
Bob went to his favourite bakery to buy some pastries. After picking up his favourite pastries his total bill was P cents. Bob lives in Berland where all the ...
View more
2. Left View of Binary Tree
Moderate
30m average time
60% success
0/80
Asked in companies
You have been given a Binary Tree of 'n' nodes, where the nodes have integer values
Print the left view of the binary tree.
Example :
View more
Problem approach
Given a binary tree. Print the Left View of the Tree.
02
Round
Medium
Video Call
Duration60 minutes
Interview date15 Feb 2023
Coding problem2
1. Connect n ropes with minimum cost
Easy
20m average time
80% success
0/40
Asked in companies
You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connec...
View more
Problem approach
You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.
The test-data is such that the result will fit into a 32-bit integer.
2. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80
Asked in companies
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum ...
View more
Problem approach
You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
What is the result of 4 % 2?
Start a Discussion
Similar interview experiences
Business Technology Analyst
4 rounds | 5 problems
Interviewed by Squadstack
Selected 
2269 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by PharmEasy
Rejected
655 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by PharmEasy
Rejected
627 views
0 comments
0 upvotes
Product Engineer
3 rounds | 5 problems
Interviewed by Squadstack
Selected 1399 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 103832 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 49225 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 30722 views
6 comments
0 upvotes