Hi, I recently appeared for the 1st round of Directi’s recruitment process. Students were divided into 2 slots. The questions for the slots were as follows :
SLOT 1 :-
- Maximum Sized Rectangle in a binary Array
- Blueberry Cheese Cake: There is a school in a village. It has N classes. One fine day, someone donated B blue berry cheese cakes to schools. Now you need to divide these cakes such that:
- Each class gets at least 1 cake.
- Each class will share the cake(s) among students.
- Your aim is to minimize the maximum number of students per cake in any class.
- Tree Updation
SLOT 2 :-
- Given a binary tree, such that each node contains a number. Find the maximum possible sum in going from one leaf node to another.
- Toffee Shop. Similar to Knapsack problem. You have a budget which you input as b. You are given an array of calories for each toffee and another array with associated cost for each toffee. Your goal is to maximize the calorie intake before the money doesn’t exceed the budget. Each toffee can be purchased only once.
I solved 2 questions and knew the algorithm correctly but missed some edge case, and simply received “wrong answer”. No consideration to partial test cases.
Overall a very difficult experience for us. Only 1 student cleared this round. He was able to solve only 1 question and that too because he had solved the question earlier. Mostly he was selected because he had a CGPA above 9.5.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.