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.
Pretty certain he's wrong no matter which way you look at it. This solution cannot be O(n). There are 16 hourglasses which need to be summed. It's not fate that (n-2)^2 = 16.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 11: 2D Arrays
You are viewing a single comment's thread. Return to all comments →
Pretty certain he's wrong no matter which way you look at it. This solution cannot be O(n). There are 16 hourglasses which need to be summed. It's not fate that (n-2)^2 = 16.