#binarysearch Development Tutorials & Tips | Roast Dev

100daysofcode 100daysofdevops 100pay 10mistakes 10yearworkanniversary 11 11labs 11tly 11ty 127001

Maximum Candies Allocated to K Children

Problem ⛶//same as coco eating bananas, //capacity to ship packages within d days //aggresive cows class Solution { public int maximumCandies(int[] candies, long k) { long sum = 0; ...

14.03.2025 0 Read More

House Robber IV

ProblemTC: O(nlog(Max(nums))) ⛶class Solution { public int minCapability(int[] nums, int k) { int index = 0; int low = Integer.MAX_VALUE; int high = 0; for(int i...

15.03.2025 0 Read More

Minimum Time to repair cars

Problem TC: O(nlog(k)), where k is the max time in the range between 1 to r*n^2 ⛶class Solution { public long repairCars(int[] ranks, int cars) { long low = 1;// atleat one lowute will b...

16.03.2025 0 Read More

Linear Search vs. Binary Search: A Practical Guide in Go

Hello, in this post I am going to talk about different types of search algorithms. In essence, I am going to focus on linear search and binary search, illustrating how these algorithms work and compar...

21.04.2025 0 Read More

Maximum Candies Allocated to K Children

House Robber IV

Minimum Time to repair cars

Linear Search vs. Binary Search: A Practical Guide in Go

#reading

#popular