Competitive programming #7
Merged
Conversation
This file contains 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
Python : How to overcome from EOF Error in Compititve programming.... #7806
…Mishra-07/winter-of-contributing into Competitive_Programming
Python : How to overcome from EOL Error in Compititve programming... #8008
…7958) * added readme.md * added output image * highlighted keywords, created and added image link, removed references * deleted external image * added img tag and changed complexity representation * created activity_selection.md * deleting the blank default file * Create README.md * updated activity_selection.md * Delete README.md * created bucket_sort.md
…ization Approach (#8104) * added readme.md * added output image * highlighted keywords, created and added image link, removed references * deleted external image * added img tag and changed complexity representation * created activity_selection.md * deleting the blank default file * Create README.md * updated activity_selection.md * Delete README.md * created bucket_sort.md * created binomial_coefficient.md * removed typo and modified the size of images
Python : Attribute Error in Competitive programming... #8116
Interpolation Sort in Java
…ing/NQueens.md Co-authored-by: Abhinav Anand <[email protected]>
…ing/NQueens.md Co-authored-by: Abhinav Anand <[email protected]>
Create TopKthFrequentElement.md
* Create Binary Search Applications Added Documentation regarding the Simple Applications of Binary Search * Rename Binary Search Applications to Binary Search Application.mds * Rename Binary Search Application.mds to Binary Search Application.md * Update Binary Search Application.md All the suggested changes are done . * Rename Binary Search Application.md to BinarySearchApplication.md renamed * Update Competitive_Programming/C++/Searching & Sorting/Binary Search/BinarySearchApplication.md Co-authored-by: Ravi Kanth Gojur <[email protected]> * Update Competitive_Programming/C++/Searching & Sorting/Binary Search/BinarySearchApplication.md Co-authored-by: Ravi Kanth Gojur <[email protected]> * Create BinarySearchApplication.md Done all the required changes suggested. * Update BinarySearchApplication.md done changes * Create EuclidAlgorithm.md This include the brute force and Euclid way to find GCD * Create heap.md * Delete heap.md * Create heap.md * Delete EuclidAlgorithm.md * Create Heap_sort.md * Delete heap.md * Create FindingKthLargestElement.md * Delete Heap_sort.md * Update FindingKthLargestElement.md * Update and rename FindingKthLargestElement.md to FindingKthLargestElement_&_TopKfrequentElements.md * Update and rename Competitive_Programming/C++/Heap/FindingKthLargestElement_&_TopKfrequentElements.md to Competitive_Programming/C++/Heap/Finding Kth Largest Element/FindingKthLargestElement.md * Delete Competitive_Programming/C++/Heap/Finding Kth Largest Element directory * Create FindingKthLargestElement.md Co-authored-by: Ravi Kanth Gojur <[email protected]>
* Added Spiral Matrix Program * Changes in spiral matrix * Made changes in code format and input/output * Update Spiral_Matrix.md * Update Spiral_Matrix.md
Competitive programming
* Create CarSell.md * updated carsell problem * added snippet for i/o * Update Competitive_Programming/C++/Greedy/CarSell_Problem/CarSell.md Co-authored-by: Abhinav Anand <[email protected]> * Update Competitive_Programming/C++/Greedy/CarSell_Problem/CarSell.md Co-authored-by: Abhinav Anand <[email protected]> * updated code with proper indent * Update CarSell.md * Update Competitive_Programming/C++/Greedy/CarSell_Problem/CarSell.md Co-authored-by: Abhinav Anand <[email protected]> Co-authored-by: Abhinav Anand <[email protected]>
Create ReverseWordInAString.md
…er/NthMagicNumber.md to Competitive_Programming/Python/Maths & Number Theory/NthMagicNumber/NthMagicNumber.md
Merge two arrays according to constraints given.
Competitve Programming: Find nth Magic Number
Euclid Algorithm
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.
Description 📜
Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context.
Fixes #issue_number_here
Type of change 📝
Domain of Contribution 📊
Checklist ✅
Screenshots / Gif (Optional) 📸