Giving back to the community!
Part 1 - ML Fundamentals about NN, Activation functions , Evals, metrics, Loss functions etc. - Answered everything
Part 2 - Coding ~ 20-25 min
Given an array eg arr = [1,2,3]
Get the max element for all contigious pairs in this array and return sum
so here max ([1],[2],[3],[1,2],[1,2,3],[2,3])
output = 14
I got the bruteforce working because of time constraints

Got rejected after 2 hours.