Round 1 :

1. Write a function that accepts an array of numbers as an argument, where each number is given as a string and returns the second maximum value from the input array. If there is no second maximum return -1.
   Restrictions :

   1. Time complexity should be O(n).
   2. You are not allowed to change the array.
   3. Maximum length of a single element can be 1024 digits.

2. https://leetcode.com/problems/3sum/

Round 2 :

1. https://leetcode.com/problems/kth-smallest-element-in-a-bst/
2. https://leetcode.com/problems/trapping-rain-water/
3. Restaurant management system low level design and workflow
4. couple of more easy level leetcode questions

Round 3 :

1. current responsibilities & project discussions.
2. write a funciton to find if number is prime or not.
3. cricket game app backend design.