Online Test: 2hrs 2 coding Question( 75 min) Easy, based on “Fractional Knapsack Problem”: Given array boxes({weight, profit}), and truck capacity W, find max profit. Medium, based on binary search: Given an array of candies (arr) and several children(n). Each element in the array denotes a pile of candies of size, you can merge the continuous pile and give it to any child. Find max (min ( candy given to ith child ) 1<=i<=N ). 10 question( c++ error correction ) 20 reasoning. 40 behaviour questions. Interview (One round) For 2 hrs Introduction Project related Question Basic of OOPs, ( class, abstraction, inheritance ). Coding Question Longest substring: using recursive, using iterative zig zag traversal using: deque, two queues Result: Selected Summer-time is here and so is the time to skill-up! More than 5,000 learners have now completed their journey from basics of DSA to advanced level development programs such as Full-Stack, Backend Development, Data Science.