Time Complexity = O(n) Space Complexity = O(1) Space Complexity can be reduced by thinking that we really don't need to store all the values of f[i] we need to track arr[i] and f[i-1] only
source not stored for this graph (policy: none)
no test coverage detected