- Notifications
You must be signed in to change notification settings - Fork360
Heap#99
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Merged
Merged
Heap#99
Uh oh!
There was an error while loading.Please reload this page.
Conversation
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
new javascript concept
new array concept
Tower of Hanoi using C
C program using Recursion
Hashing program using C
sql query for data science
quarprobing using C
Linearprobing using C
Adding ROCK_PAPER_SCISSORS.py file which is a simple game written in python.
Adding my details
Adding ROCK_PAPER_SCISSORS.py file which is a simple game written in python.
Add files via upload
"Added Amazon SDE Sheet"
Add files via upload
Add files via upload
Add files via upload
Add files via upload
Create RatInAMaze.java program
Create minimum_path_sum.py
Problem Statement -: You are given an array, You have to choose a contiguous subarray of length ‘k’, and find the minimum of that segment, return the maximum of those minimums.Sample input 0 1 → Length of segment x =15 → size of space n = 51 → space = [ 1,2,3,1,2]2 3 1 2 Sample output3ExplanationThe subarrays of size x = 1 are [1],[2],[3],[1], and [2],Because each subarray only contains 1 element, each value is minimal with respect to the subarray it is in. The maximum of these values is 3. Therefore, the answer is 3
Disk Space Analysis
Sirajmolla added a commit that referenced this pull requestOct 2, 2022
Merge pull request#99 from kashyap-singh/main
Sign up for freeto 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.