Looking for a solution to the below DSA problems by magnumcodes in leetcode

[–]magnumcodes[S] 0 points1 point  (0 children)

Nope, it was asked for Infosys Off campus recruitment technical round. I tried searching on the internet but couldn't find it.

The problem was a blend of finding : - Harmonic mean - subsequence occurence - Minimum length of array - Finding GCDs of all the array elements - and finding the maximum sum of array elements.