{"id":101806,"date":"2025-03-16T17:31:41","date_gmt":"2025-03-16T14:01:41","guid":{"rendered":"https:\/\/nabfollower.com\/blog\/%d8%ad%d8%af%d8%a7%d9%82%d9%84-%d8%b2%d9%85%d8%a7%d9%86-%d8%a8%d8%b1%d8%a7%db%8c-%d8%aa%d8%b9%d9%85%db%8c%d8%b1-%d8%a7%d8%aa%d9%88%d9%85%d8%a8%db%8c%d9%84\/"},"modified":"2025-03-16T17:31:41","modified_gmt":"2025-03-16T14:01:41","slug":"%d8%ad%d8%af%d8%a7%d9%82%d9%84-%d8%b2%d9%85%d8%a7%d9%86-%d8%a8%d8%b1%d8%a7%db%8c-%d8%aa%d8%b9%d9%85%db%8c%d8%b1-%d8%a7%d8%aa%d9%88%d9%85%d8%a8%db%8c%d9%84","status":"publish","type":"post","link":"https:\/\/nabfollower.com\/blog\/%d8%ad%d8%af%d8%a7%d9%82%d9%84-%d8%b2%d9%85%d8%a7%d9%86-%d8%a8%d8%b1%d8%a7%db%8c-%d8%aa%d8%b9%d9%85%db%8c%d8%b1-%d8%a7%d8%aa%d9%88%d9%85%d8%a8%db%8c%d9%84\/","title":{"rendered":"\u062d\u062f\u0627\u0642\u0644 \u0632\u0645\u0627\u0646 \u0628\u0631\u0627\u06cc \u062a\u0639\u0645\u06cc\u0631 \u0627\u062a\u0648\u0645\u0628\u06cc\u0644"},"content":{"rendered":"
\n

\u0645\u0634\u06a9\u0644
TC: o (nlog (k)) \u060c \u062c\u0627\u06cc\u06cc \u06a9\u0647 k \u062d\u062f\u0627\u06a9\u062b\u0631 \u0632\u0645\u0627\u0646 \u062f\u0631 \u0645\u062d\u062f\u0648\u062f\u0647 \u0628\u06cc\u0646 1 \u062a\u0627 r*n^2 \u0627\u0633\u062a<\/p>\n

\n
class<\/span> Solution<\/span> {<\/span>\n    public<\/span> long<\/span> repairCars<\/span>(<\/span>int<\/span>[]<\/span> ranks<\/span>,<\/span> int<\/span> cars<\/span>)<\/span> {<\/span>\n        long<\/span> low<\/span> =<\/span> 1<\/span>;<\/span>\/\/ atleat one lowute will be needed <\/span>\n        long<\/span> high<\/span> =<\/span> 0<\/span>;<\/span>\n        for<\/span>(<\/span>int<\/span> i<\/span> :<\/span> ranks<\/span>){<\/span>\n            high<\/span> =<\/span> Math<\/span>.<\/span>max<\/span>(<\/span>i<\/span>,<\/span>high<\/span>);<\/span>\/\/mechanic with the largest rank will take greatest time to process all the cars<\/span>\n        }<\/span>\n        high<\/span> =<\/span> high<\/span> *<\/span>cars<\/span> *<\/span> cars<\/span>;<\/span>\n        long<\/span> val<\/span> =<\/span> 0<\/span>;<\/span>\n        while<\/span>(<\/span>low<\/span><=<\/span>high<\/span>){<\/span>\n            long<\/span> mid<\/span> =<\/span> (<\/span>long<\/span>)(<\/span>low<\/span>+<\/span>high<\/span>)\/<\/span>2<\/span>l<\/span>;<\/span>\n\n            if<\/span>(<\/span>check<\/span>(<\/span>mid<\/span>,<\/span>ranks<\/span>,<\/span>cars<\/span>)){<\/span>\n                val<\/span> =<\/span> mid<\/span>;<\/span>\n                high<\/span> =<\/span> mid<\/span>-<\/span>1<\/span>;<\/span>\n            }<\/span>\n            else<\/span> low<\/span> =<\/span> mid<\/span>+<\/span>1<\/span>;<\/span>\n        }<\/span>\n        return<\/span> val<\/span>;<\/span>\n    }<\/span>\n\n    public<\/span> boolean<\/span> check<\/span>(<\/span>long<\/span> time<\/span>,<\/span> int<\/span> ranks<\/span>[],<\/span> int<\/span> cars<\/span>){<\/span>\n        \/\/now we have to find out how much cars a mechanic can fix in given time 'time'<\/span>\n        \/\/we know r*n^2 = time i.e rankOfMechanic*Math.pow(noOfCars,2) will give the time each mechanic will take to process n cars<\/span>\n        \/\/we have to find out no. of cars for each mechanic for the give time<\/span>\n        \/\/if total car processed in time 'time' is greater than or equal to 'cars' then the time is good enough time <\/span>\n        \/\/and we can look for time smaller that the time 'time'<\/span>\n        \/\/n = Math.sqrt((time\/r))<\/span>\n\n        int<\/span> totalCar<\/span>=<\/span> 0<\/span>;<\/span>\n        for<\/span>(<\/span>int<\/span> rank<\/span> :<\/span> ranks<\/span>){<\/span>\n            totalCar<\/span>+=<\/span> Math<\/span>.<\/span>sqrt<\/span>(<\/span>time<\/span>\/<\/span>rank<\/span>);<\/span>\n        }<\/span>\n        return<\/span> totalCar<\/span>>=<\/span>cars<\/span>;<\/span>\n    }<\/span>\n}<\/span>\n<\/code><\/pre>\n
\n
\n    \u062d\u0627\u0644\u062a \u062a\u0645\u0627\u0645 \u0635\u0641\u062d\u0647 \u0631\u0627 \u0648\u0627\u0631\u062f \u06a9\u0646\u06cc\u062f<\/title>\n    \n<\/svg><\/p>\n
    \u0627\u0632 \u062d\u0627\u0644\u062a \u062a\u0645\u0627\u0645 \u0635\u0641\u062d\u0647 \u062e\u0627\u0631\u062c \u0634\u0648\u06cc\u062f<\/title>\n    \n<\/svg><\/p>\n<\/div>\n<\/div>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
\u0645\u0634\u06a9\u0644TC: o (nlog (k)) \u060c \u062c\u0627\u06cc\u06cc \u06a9\u0647 k \u062d\u062f\u0627\u06a9\u062b\u0631 \u0632\u0645\u0627\u0646 \u062f\u0631 \u0645\u062d\u062f\u0648\u062f\u0647 \u0628\u06cc\u0646 1 \u062a\u0627 r*n^2 \u0627\u0633\u062a class Solution { public long repairCars(int[] ranks, int cars) { long low = 1;\/\/ atleat one lowute will be needed long high = 0; for(int i : ranks){ high = Math.max(i,high);\/\/mechanic with the largest rank will take greatest …<\/p>\n","protected":false},"author":2,"featured_media":101807,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"fifu_image_url":"https:\/\/media2.dev.to\/dynamic\/image\/width=1000,height=500,fit=cover,gravity=auto,format=auto\/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frdc6uoclb4c34blizwr3.png","fifu_image_alt":"","footnotes":""},"categories":[339],"tags":[],"class_list":["post-101806","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-dev"],"_links":{"self":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/posts\/101806","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/comments?post=101806"}],"version-history":[{"count":0,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/posts\/101806\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/media\/101807"}],"wp:attachment":[{"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/media?parent=101806"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/categories?post=101806"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/nabfollower.com\/blog\/wp-json\/wp\/v2\/tags?post=101806"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}