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.
The code with time complexity of O(n) and space complexity O(1)
publicstaticintmarsExploration(Strings){// Write your code hereStringpattern="SOS";intcount=0;for(inti=0;i<s.length();i++){if(s.charAt(i)!=pattern.charAt(i%3)){count++;}}returncount;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mars Exploration
You are viewing a single comment's thread. Return to all comments →
The code with time complexity of O(n) and space complexity O(1)