Me postulé a través de una facultad o universidad. Acudí a una entrevista en BuyHatke (Bengaluru) en jun 2023
Entrevista
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,
El proceso tomó 1 día. Acudí a una entrevista en BuyHatke
Entrevista
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
Preguntas de entrevista [1]
Pregunta 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