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.
HI, I am a newbie here, I read somewhere that contains() method internally uses loop, if this is the case then how could the time complexity be O(n)? Just curious
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Equal
You are viewing a single comment's thread. Return to all comments →
HI, I am a newbie here, I read somewhere that contains() method internally uses loop, if this is the case then how could the time complexity be O(n)? Just curious