DSA 1. Find all the substrings of the given string "abc" 2. Reverse an integer array with an optimized solution 3. Find mid node of the given LinkedList 4. Write the algorithm to find the max number in a stack.

1st round was DSA round. It was a generic question to write a data structure with 3 functionality (add, remove, find random). 2nd question was related to a mathematic formula and i was asked to resolve it using coding (handling brackets for +- symbol). I was able to pass the 1st round, 2nd round was technical specific, in my case it was Android. The questions were simpler including lifecycle, viewmodel, jetpack etc. The 3rd round includes HM round, which was a combination of Behavioural and technical round. This lasts for 30 minutes. After this, recruiter informed me that some HR will contact and start the further process, but i never got any call.