1st problem was similar to Gas Station Problem on Leetcode , and everyone got stuck on the 12th testcase ,according to the problem statement there always existed a valid starting position but there was no valid answer for last test case (you will think that you should report -1 for that but no last position was being accepted, and I got to know this by guessing )

2nd problem was shortest path finding problem and you had to print it also

3rd one was a grid problem in which you had to count all the coordinates you can reach from 0,0 by going U,D,L,R.

I think all the problems were betweeen easy-medium if you know the basic algorithms , First problem was ambigutious . I will also like to mention that I struggled a lot because of the compiler ,they were using c++11.