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

Frontend Developer

PureSoftware Ltd

2 rounds | 2 Coding problems

Niraj Kumar

Experienced | Aug 2021

Selected

Interview preparation journey

Preparation

Duration: 10 Month

Topics: Data structures, Core Java, javascript, Html, CSS, React js, Angular, Flutter, Smartcomm, Opps concept, Node js

Tip

Tip 1 : Focus on DSA everyday solve atleast 1-2 questions
Tip 2 : strong atleast any one programming language and don't try to start learning multiple things at a time.

Application process

Where: Campus

Eligibility: Required 6 month experience candidate, also have good knowledge in frontend

Resume tip

Tip 1 : Make sure in resume spelling is correct and simple
Tip 2 : Add at least two projects either completed in college or in any organization.

Interview rounds

Round

Medium

Online Coding Interview

Duration35 Minutes

Interview date29 Aug 2021

Coding problem1

1. Merge Sort

Easy

15m average time

85% success

0/40

Asked in companies

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

Problem approach

I have explaine through example and that I right the code

Try solving now

Round

Medium

Online Coding Interview

Duration35 Minutes

Interview date28 Aug 2021

Coding problem1

1. Armstrong Number

Easy

15m average time

85% success

0/40

Asked in companies

You are given an integer ‘NUM’ . Your task is to find out whether this number is an Armstrong number or not.

A k-digit number ‘NUM’ is an Armstrong number if and only if the k-th power of each digit sums to ‘NUM’.

Example

153 = 1^3 + 5^3 + 3^3.

Therefore 153 is an Armstrong number.

Problem approach

First I have define what's Armstrong number like
A number is thought of as an Armstrong number if the sum of its own digits raised to the power number of digits gives the number itself. For example, 1, 153 etc

Try solving now