Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

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

PharmEasy

2 rounds | 4 Coding
problems

Journey

I started my journey from a government school where 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 to my campus the placement .

Why selected/rejected for the role?

i was rejected because i was not able to maintain the timing of the questions to be answer i should be more fast.

Preparation

Duration: 4 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Practice coding from Leetcode, Interview bit, at least 100 questions

Tip 2 : Practice any one automation framework includes design patterns

Application process

Where: Campus

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Restrict your resume to 1 page and write your practical work only

Tip 2 : Mention top topics like Selenium, Rest Assured Automation, Language used Java etc

01

Round

Easy

Video Call

Duration60 minutes

Interview date3 Feb 2023

Coding problem2

View more

Problem approach

You are given an array of ‘N’ integers and your task is to sort the array using the following operations.

In one operation you can select a sub-array of the array and sort it. The cost of performing such an operation will be the square of the length of the sub-array you are sorting.

You task is to find the minimum cost of sorting the whole array.

View more

Problem approach

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

02

Round

Easy

Video Call

Duration60 minutes

Interview date3 Feb 2023

Coding problem2

View more

Problem approach

You are given two strings BEGIN and END and an array of strings DICT. Your task is to find the length of the shortest transformation sequence from BEGIN to END such that in every transformation you can change exactly one alphabet and the word formed after each transformation must exist in DICT.

View more

Problem approach

You are given a string 'STR' consisting of lowercase English letters. Your task is to return all permutations of the given string in lexicographically increasing order.

String A is lexicographically less than string B, if either A is a prefix of B (and A ≠ B), or there exists such i (1 <= i <= min(|A|, |B|)), that A[i] < B[i], and for any j (1 <= j < i) A[i] = B[i]. Here |A| d...

View more

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

2269 views

0 comments

0 upvotes

SDE - 1

2 rounds | 4 problems

Interviewed by PharmEasy

655 views

0 comments

0 upvotes

SDE - 1

2 rounds | 4 problems

Interviewed by PharmEasy

938 views

0 comments

0 upvotes

Product Engineer

3 rounds | 5 problems

Interviewed by Squadstack

1399 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

103832 views

24 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

49225 views

5 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

30722 views

6 comments

0 upvotes