There were 2 Online Assesment. OA 1- 1 Coding Question, 5 mcq from each 8 topics like Data stuctures, Algorithms, Psuedo codes, cn, Database Query Languages, linux, Software methodologies, Software Testing concepts.
OA-2, in which they asked two coding questions one hard and one easy problem and
Finally an interview, where the asked two dsa problem.
Problem 1- ''Given a 2D array [[1,2,4,8],[3,0,2,1],[1,2,4,9]] where each element represents number of fruits harvested ,and given (row, coulmn) as starting position , and given k , which is number of steps, we have to find maximum number of fruits harvested in k steps.
Problem 2- "Given a binary tree and an integer target, check whether there is a root-to-leaf path with its sum as target. Here is the link to second problem:" https://www.geeksforgeeks.org/problems/root-to-leaf-path-sum/1