Skip to content

Comments

Round Robin#25

Open
j2704 wants to merge 28 commits intoinfinixaco:ALGORITHMSfrom
j2704:master
Open

Round Robin#25
j2704 wants to merge 28 commits intoinfinixaco:ALGORITHMSfrom
j2704:master

Conversation

@j2704
Copy link
Contributor

@j2704 j2704 commented Oct 29, 2020

No description provided.

SharmaRithik and others added 28 commits September 30, 2020 14:01
This is the implementation for finding frugal numbers in c++.
This includes deatils about binary search and it's recursive and iterative implementation in c++
A implementation of finding minimum time required to produce m items using brute force and binary search in cpp
This file has implementation of finding the floor of a sorted array, the file contains linear and binary implementations in cpp.
Array Structure
Given a set of n segments {[a0 , b0 ], [a1 , b1 ], . . . , [an−1 , bn−1 ]} with integer coordinates on a line, find the minimum number m of points such that each segment contains at least one point. That is, find a set of integers X of the minimum size such that for any segment [ai , bi ] there is a point x ∈ X such that ai ≤ x ≤ bi .
Covering segments in py
Circular queue implementation in cpp
Maximize the number of days for which P chocolates can be distributed consecutively to N people
Given an integer, P denoting the number of chocolates and an array a[] where ai denotes the type of ith chocolate. There are N people who want to eat chocolate every day. Find the maximum number of consecutive days for which N people can eat chocolates considering the following conditions:

Each of the N people must eat exactly one chocolate on a particular day.
A single person can eat chocolate of the same type only for all days.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

7 participants