Compensation : 1.2 lpm
Type : On-site

Hackerrank OA :

• Given total no of wheels $n$, determine how many distinct combinations of 4 wheeler and 2 wheeler vehicles can be formed.
• SQL qsn based on joins
• Given a grid with empty and blocked cells, find path which maximizes the minimum distance to a blocked cell from cells of the path and return the maximized minimum distance.

Interview Round 1 :

• Given an array $arr$, find no of distinct ways to partition the array into 3 consecutive non-empty subarrays such that : S2<=S1+S3
  S1 = sum of 1st subarray (left)
  S2 = sum of 2nd subarray (center)
  S3 = sum of 3rd subarray (right)

• Given an array $transactions$, find longest subsequence of transactions such that when performed in order (summation) the amount in your account never goes negative.

Interview Round 2 :

• Based on projects and behavioral qsns