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

Associate Developer

Pristyn Care

3 rounds | 3 Coding problems

Anonymous

Fresher | Oct 2021

Selected

Interview preparation journey

Preparation

Duration: 4

Topics: Data Structures, Algorithms, OOPs, System design, Quant

Tip

Tip 1 : rewise DSA theory with coding practice
Tip 2 : solve atleast 300 coding problems, from all topics, graph, trees, linked list, DP etc
Tip 3 :

Application process

Where: Campus

Eligibility: No criteria

Resume tip

Tip 1: don't mention anything, you have not done
Tip 2: mention some good projects, not common ones

Interview rounds

Round

Medium

Video Call

Duration60

Interview date20 Oct 2021

Coding problem1

1. Two sum problem, using concept of map

Easy

10m average time

90% success

0/40

Asked in companies

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity.

Problem approach

It is very famous question. I told him the simple approach first, told the time complexity. Then, optimised it further and wrote the code. Made my own test case and tested it.

Try solving now

Round

Medium

Video Call

Duration60

Interview date28 Oct 2021

Coding problem1

It was a mix of DSA and problem solving

1. Find second largest element in an array.

Easy

15m average time

80% success

0/40

Asked in companies

You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

Note:

a) Duplicate elements may be present.

b) If no such element is present return -1.

Example:

Input: Given a sequence of five numbers 2, 4, 5, 6, 8.

Output:  6

Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.

Problem approach

First, told a very simple solution that was brute force. Then, told the optimised solution, coded it and tested the code.

Try solving now

Round

Easy

Telephonic

Duration5

Interview date2 Nov 2021

Coding problem1

It was a telephonic conversation with CTO.

1.

It was very simple question. What are searching techniques are there and when to use which one?

Problem approach

Tip 1: Rewise DSA theory
Tip 2: practice atleast 300 problems on different topics
Tip 3: if you prepare for the best, you will easily crack simple and medium ones