Le processus a pris 1 jour. J'ai passé un entretien chez BuyHatke
Entretien
Nice interview good
Q
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack
Questions d'entretien [1]
Question 1
Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez BuyHatke (Bengaluru) en juin 2023
Entretien
The interviewer first ask me to introduce myself and after that he shared a doc file which had a dsa question based on max heap and I had 30 mins to solve the question,