Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
Keeper. Your team should consists of one Wicket Keeper, at-least 2 Batsmen, at-least 2 Bowlers, and at-least one All-Rounder. Solution: The goal is to maximize the total “value” obeying all the constraints. If we try solving this problem using a dynamic programming approach similar to the Knapsack