**OA**\n\n1. 12 MCQ based on java and spring.\n2. 1 SQL Query\n3.  Maximum length subsequence with differnce between elements as either 0 or 1.\n\n\n**Technical Round I**\n\t\n\tJohn can watch maximum 3 hrs of movie in a day and he only watches the movies if he can watch it completely. You are given a list containing duration of movies , find minimum number of days taken by him to finish watching all the movies.\n\tinput: ArrayList<Float> duration\n\tconstraints:  0<duration[i]<= 3.0 \n\tduration.length<=10000\n\t\n\t\nFew questions about the projects I had worked on.\n\t\n\t\n\n\n

OA\n\n1. 12 MCQ based on java and spring.\n2. 1 SQL Query\n3.  Maximum length subsequence with differnce between elements as either 0 or 1.\n\n\nTechnical Round