To have the full interactive experience, please view this video on itempool:
https://itempool.com/NOC21CS99/c/Jw5L4d5PXds
This lecture is based on the Reversort Engineering (Google Code Jam 2021 Qualifiers, Problem C) problem, and you can find a link to it here:
https://bit.ly/NPTEL-cs99-W01-Mod2-problem
This problem builds up on the problem discussed in the previous module and is a little more involved, and the solution is based on a recursive approach that relies on some simple observations.
The code discussed in the video can be found here:
https://bit.ly/NPTEL-cs99-W01-Mod2-solution-py
Timestamps:
0:34 Problem Statement
1:16 Discovering a range of legal values for C
11:57 Creating the array for all feasible values of C
16:32 Recap and Implementation
