Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso UnifyApps (Gurgaon, Haryana) nel mese di ago 2024
Colloquio
first round of interview : find largest area of rectangle in a histogram and some theory questions of DSA about finding a cycle and difference between tree and graph
Second Round : given number from 1 to n , and edge between them can exist if they have gcd greater than 1, given q queries find if a and b given are connected or not
Domande di colloquio [1]
Domanda 1
Mostly They asked DSA and asked for my resume but didn't ask any questions from projects
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso UnifyApps (Kānpur, Uttar Pradesh) nel mese di ago 2024
Colloquio
The interview consisted to two technical rounds. I was given two DSA questions in both of them and asked to give the most optimal approach for each of them along with a proper working code.
Domande di colloquio [4]
Domanda 1
Given an integer array nums, find a subarray that has the largest product, and return the product.
There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai.
For example, the pair [0, 1], indicates that to take course 0 you have to first take course 1.
Return true if you can finish all courses. Otherwise, return false.
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.
There are n cities and some health centres and injured people were given at some nodes and an integer k.
the city was connected by m roads with each having certain weight denoting the time taken to travel that road. the road was bidirectional.
find out if each injured person can reach the nearest health centre within that k time.
Ho presentato la mia candidatura online. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso UnifyApps (Gurgaon, Haryana) nel mese di lug 2024
Colloquio
good dsa questions, oops and dbms. no OS, CN.
Both round dsa questions were easy, overall a pretty easy interview process
interviewer was nice. i got selected even after not being able to give my best in the second round of interviews.
.
.
They were giving only 50k stipend per month
