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.
Straight Forward Java Solution θ(1) Time Complexity
publicstaticintpageCount(intn,intp){// Write your code hereif(n%2==0)n++;intfromFront=(int)p/2;intfromBack=(int)(n-p)/2;if(fromBack<fromFront)returnfromBack;elsereturnfromFront;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Drawing Book
You are viewing a single comment's thread. Return to all comments →
Straight Forward Java Solution θ(1) Time Complexity