We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I think this problems requires using FFT to calculate convolutions in O(n*log(n)) time. Taking the kth-order difference is equivalent to a convolution of a[n] and b[n] with the combinatorial numbers.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Minimal Cyclic Shift
You are viewing a single comment's thread. Return to all comments →
I think this problems requires using FFT to calculate convolutions in O(n*log(n)) time. Taking the kth-order difference is equivalent to a convolution of a[n] and b[n] with the combinatorial numbers.