Role - Java backend developer
Location - Remote
Experience - 3 years 1 month

Round 1 - Problem Solving

• https://leetcode.com/problems/minimum-size-subarray-sum/description/
• Find number of ways to pick 8 balls from a box with 4 red and 4 blue balls one by one. During the entire process, the count of picked blue balls should always be greater than the count of picked red balls.
  I couldn't compute the logic for this question. Then I later realized that this question is nothing but, the equivalent of finding number of ways to reach (4,4) from (1,1) in a 4 x 4 matrix with the condition that you can never go below the primary diagonal.

Verdict - Negative as I could solve only 1/2 questions.
Overall - Rejected as each round was eliminatory.