Round 1: (1 hour)
2 Programming Question

1. Find Second Largest Element in an array.
   Constraints -> Time : O(n), Space: O(1);
2. Valid Parenthese: https://leetcode.com/problems/valid-parentheses/

Round 2: (1 hour)
2 Programming Question

1. Given an array with head node of sorted linked list, Convert it into a single linked list(sorted)
   Constraint-> Space : O(1)
2. Majority Element: https://leetcode.com/problems/majority-element/
   Constraint-> Time : O(n), Space -> O(1)

Round 3: (1 hour)

1. How can we ensure security of API.
2. Components of JWT.
3. Use Case of SQL and NoSQL.
4. Question on Join(Inner Join and Left Join).
5. Different types of attack and how can we ensure safety from them. eg. DDOS, SQL injection.

==========================
YOE:- 2 Years in Product Based Company