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 hate writing O(n) algorithms where n is an input value (rather than the memory size of the input); those are just exponential algorithms making a poor effort to pretend otherwise. But apparently it's good enough here.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tastes Like Winning
You are viewing a single comment's thread. Return to all comments →
I hate writing O(n) algorithms where n is an input value (rather than the memory size of the input); those are just exponential algorithms making a poor effort to pretend otherwise. But apparently it's good enough here.