Good and simple process. Self introduction followed by a technical interview with three simple questions to solve , similar to leetcode kind of questions. To be solved using online compiler.
Questions d'entretien [1]
Question 1
Coins array given with denominations and to find the least number of coins needed to attain the amount.
J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez Testpress (Chennai) en mai 2025
Entretien
First round is the online assessment round - 10 mins (30 questions) all are MCQ based the CS Fundamentals and aptitude.
Second round is the Coding round (Offline) with 3 questions each having 30 mins to solve.
Third round is a technical round.
Questions d'entretien [2]
Question 1
1. You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1. You may assume that you have an infinite number of each kind of coin.
Given an array arr[] of integers and an integer k, your task is to find the maximum value for each contiguous subarray of size k. The output should be an array of maximum values corresponding to each contiguous subarray.
