I was working with problem NEU004 Problem - CodeChef and I’m feeling stuck. The DP approach O(n) will be giving TLE. The question demands a O(log(n)) or O(1) approach.
1 Like
I was working with problem NEU004 Problem - CodeChef and I’m feeling stuck. The DP approach O(n) will be giving TLE. The question demands a O(log(n)) or O(1) approach.