Tip 1 : Good knowledge of basics of data structure.
Tip 2 : Question need to be done with optimized time complexity until you won't be able to pass all test cases.
Tip 1 : Atleast one good project
Tip 2 : Specially mention Java and JavaScript
So the round contains an assignment in which you have to make a table regarding your information like Roll number, Name ,College etc. an send it to them using an API link and max time you can hit that link is 10.
Tip 1 : So I basically made a table with good padding and margin
Tip 2 : Highlight the major things.
The round contains mcqs on core java , javascript , oops and two coding questions of data structures.
The exam was at 7pm
Platform was good



Consider ARR = [[1 , 2 , 3] , [3 , 4 , 1] , [2 , 1 , 2]] and Queries = [[0 , 0 , 1 , 2]], the submatrix with the left top index (0 , 0) and right bottom index (1 , 2) is
[[1 , 2 , 3] ,
[3 , 4 , 1]].
The sum of the submatrix is 14. Hence, the answer is 14 in this case.
I added all column and rows and put them in hashmap with their frequencies and then loop over queries and traverse over the hashmap that how many values of sum range between that row of query.




My approach was to rotate first string until its length and if at any stage it become equal to another string printed true else check and if not print false.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?