This was a coding round in which two questions were asked. I solved first question fully and the second question partially.
Count of ways to distribute N items among 3 people with one person receiving maximum
Given an integer N, the task is to find the total number of ways to distribute N among 3 people such that:
Exactly one person gets the maximum number of items among all the 3 people.
Each person gets at least 1 item.
Given a matrix of ‘O’ and ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’.
I used Codezen platform of Coding Ninjas to practice data structures related questions . There you will get topic wise questions. So try to do as much as practice there or at any other coding portal to enhance your speed and efficiency.
Mention good level projects in your resume and also your internships or previous experiences with a brief explanation about what you have done in that internship.