Current Exp - 4 Y, Test Automation Engineer

Round1 -- OA HackerRank (75 mins)
2 Coding questions to be solved in 1 hour.
1 was very easy, 2nd one solution was obvious but needed some insight to avoid TLE

Round 2 -- MS Teams Coding round (60 mins)

1. Delete repeating characters from string
2. Find leading elements in an array ( element which is greater or equal to all elements in the right )
3. Find all elements in array which are equal to sum of remaining elements.
   Suppose x = a[i], a[i] will be in ans list if S - x == x, S = Sum of all elements

Round 3 - MS teams Problem solving, System Design (60 mins)

Asked to write pseudocode.

1. Check if a linked list of character is palindromic 0(n) time 0(1) space
2. Given an array of +ve and -ve integers including zero, move all zero's to end of array, preserving the order of all other elements.
   Ex: [0 0 -2 0 3 4 -6], Output - [-2 3 4 -6 0 0 0]
3. Design a file download application, handling all negative cases.
   Ex: How to efficiently restart download when network goes down, without redownloading whole file again
4. Follow up to above question, How do you make sure data integrity is preserved of the downloded file.

Interviewers were friendly, explained the question thoroughly, guided me when i was stuck.