Open
Conversation
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++
Binary search
Linear search
A implementation of finding minimum time required to produce m items using brute force and binary search in cpp
Practise questions
This file has implementation of finding the floor of a sorted array, the file contains linear and binary implementations in cpp.
Floor in a Sorted Array
Add files via upload
Practise questions
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.
Create Binary_Search.cpp
Practise questions
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
No description provided.