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.
publicstaticlongtaumBday(intb,intw,intbc,intwc,intz){// Write your code herelongoptimalBC=Math.min(bc,wc+z);longoptimalWC=Math.min(wc,bc+z);returnb*optimalBC+w*optimalWC;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Taum and B'day
You are viewing a single comment's thread. Return to all comments →
My solution in Java, time complexity: O(1).