This was for Hyderabad location .
1.Maximize happiness problem. Given number of days and number of activities we need to maximize sum of happiness . We can not do two same activity in consecutive day. This is 2d Array with column is day number and row is activity. a[i][j] will represent doing ith activity on jth day will give you happiness say x.
This can be solved using DP table. something like :dp[i][j] = max(dp[i-1][j], dp[i+1][j, ….)
2. Given a list or may be array(upto our implementation) and some input like (type, value). for type=1 add item to left end of list and for type =2 add item to right end of array. and then there will be a query say type, index1, index 2. so for type =3 we need to return sum of index from index1 to index2. where 0 start from left end. all should be in constant time.
- Deserialize and serialize binary tree.
- Chess game design(LLD).
- Some questions on List internal implementation.
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.