Interview Round 1
Asked the projects worked in previous office
Algo qstn : Give n courses from 1 to N ,find the no of semesters to complete the courses .under condition there are dependencies for Courses such as you need to complete i course before taking j course , the courses with No dependency will take 1 semester ,and any number of courses can be taken in 1 semester . Find minimum no of semester to complete course . Also check condition for if their is loop .
Topological sortInterview Round 2
given and array,a[i] parent of i ,construct a n-arr tree
Dp problem ,to find the no of way u can have breakfast in n days ,given Bread butter can be eaten every day, Omelette you cannot have on consecutive days .