Round 1: This was kind of phone screen round. I was asked to write code and test cases but interviewer didn't compile it . she just aksed me to dry run on multiple test cases.

• Char array with only lower case letters given. We need to divide the array in maximum number of segments such that all same chars will appear in one segment only.
  Ex. {a,b,c,d,a,e,f} ans = [4,1,1];
• String containing special char and lower case letter is given. We need to consider special char as Backspace and print resultant string.

First round went well just after 5 minutes of interview recruiter called me and told me about OA on hackerearth.

Round 2: It was a 1 hour coding round on hackerearth. There were total 3 questions.

• Two integers N and K are given where N means there are N type of candies and K means max no of candies that could be consumed in a day(1....K) . Next a quantity and a priority array of N size is given for candies where index means type of candy. Tom can only eat candy with priority p when no candy of p+1 priority is available.given two integers t and d. We need to tell if there is anyway when Tom would be able consume t'th type of candy on d'th day.

• An integer array of size N is given. We can only move to index -1 or index+2 if they exist where cost of this move will be arr[index]. We need to print minumum cost to jump out of array(this means size+1 to inf) if we start from first index.

• Three integers a , b and N are given. In each iteration (a,b) will be converted (b-a, b+a). we need to print value of a and b after Nth iteration.

PS. Please comment down your thoughts on coding round. For me this is too much for 1 hour coding round.