Quantiphi Analytics Solutions Private Limited Software Developer Interview Questions and Answers for Freshers

Was tough but can be cracked in one go

Easy to moderate need to study dsa

Q1. Self introduction
Add your answer
Q2. Tell me about your projects
Ans. 
I have worked on various projects including a web application for a healthcare company and a mobile app for a retail business.
• Developed a web application for a healthcare company to manage patient records and appointments

• Created a mobile app for a retail business to enhance customer shopping experience

• Implemented features such as user authentication, data visualization, and real-time updates

• Utilized technologies like R
Answered by AI
Add your answer

78 mcq questions and 2 dsa

Coding based round on dsa

Basic dsa plus aptitude total of 50 ques

Q1. Array and array matrix coding question and some logical question
Add your answer

Q1. Noarmal hr question and then some logical tricky question , situation based question
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Fruits and Baskets Problem Statement
You are given 'n' fruit trees planted along a road, numbered from 0 to n-1. Each tree bears a fruit type represented by an uppercase English alphabet. A Ninja walking ...read more
Ans. 
The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.
• The Ninja can start at any tree and end at any tree, but cannot skip a tree.

• He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.

• The restriction is that each basket can have only one type of fruit.

• We need to find the maximum number of fruits that ca
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Was Shortlisted For this round with in total of 22 students, 7 in my profile.
It was Technical round with 30 mins of time allotted.
The interviewer was friendly, started with basic questions about me followed by project specific and then a puzzle.

Q1. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
The problem requires sorting an array of 0s, 1s, and 2s in a single scan.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s.

• Initialize the low pointer at the beginning of the array and the high pointer at the end.

• Iterate through the array using a current pointer and swap elements based on their values.

• Move the pointers accordingly until the array is sorted.

• The time complexity of this solution is O(N) a
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Hard

The interview was scheduled for 15 mins and 12 students were shortlisted for this round. 5 in my profile.
The interviewer didn't on his video whereas mine was, the interviewer was friendly and maintained a poker voice.
Asked Basic HR questions but crossed questioned several times.