Round 1 [PS/DSA Round] -

1. Continuous Subarray With Maximum Sum
   https://leetcode.com/problems/maximum-subarray/
2. Maximum Sum Circular Subarray
   https://leetcode.com/problems/maximum-sum-circular-subarray/
3. Buy And Sell A Pen With Maximum Profit
   https://leetcode.com/problems/best-time-to-buy-and-sell-stock/

Round 2 [HLD Round] -

1. Asked Me How Different Dependent Projects Get Compiled?
   I Was Able To Give Topological Sort Approach, Interviewer Was Satisfied With The Approach.

Round 3 [HM Round] -

1. Some Java Concepts, How JVM Works Internally, How Hibernate Works Internally