Round 1:

1. Array of digits = [6, 8, 4, 5, 2, 3] ,
   Form 2 no numbers from the above digits (1 to 9) minimize the sum of those two num
   Ex -> 348 + 256 = 604

2. First element which is greater than the current element in the right side for every element. If there is not such element choose/print -1

Round 2: Work history (VP of engineering)
Round 3: LLD + Code - Elevator System for a building
Round 4: HM - CTO (behavioural questions)

Compensation Details : https://leetcode.com/discuss/compensation/1322032/Hevo-Data-or-SDE-2-or-Bangalore-India