This is the second coding assessment after shortlisted from OA

1.)Given an integer array named yCoordinates where yCoordinates[i] represents the Y axis and each index represents the X axis. Find the strictly increasing contiguous slope of the give points of size exactly K.

Example:
Input:

[6,5,7,8,3,5,6] and k=3

The points are (0,6),(1,5),(2,7),(3,8),(4,3),(5,5),(6,6)

output : 2

Possible increasing slopes are:
(1,5),(2,7),(3,8)
(4,3)(5,5),(6,6)

constraints:
1<=yCoordinates.size()<=10^5;
yCoorinates[i]>=1

2.) This is a framework based questions we are allowed to pick the framework such as Node.js,Spring boot or Django.The code repository is given to us where we need to resolve the bugs in that and total test cases of 8 was given to us. No AI tool is incorporated.