Algorithmic-Programming
Algorithmic Programming Exercises
Details about exercises can be found in Readme files within packages and are linked from this master Readme too.
- Facebook Hacker Cup
- Stanford (Coursera.org) Algorithms - Design and Analysis Part 1
- Data Structures
- Sorting
- Selection Sort
- Insertion Sort
- Merge Sort
- Heap Sort
- Exercises from the book - Cracking the Coding Interview
- Exercises from the book - Cracking the Coding Interview, 6th edition
- Exercises from the book - Programming Interviews Exposed
- Exercises from LeetCode Online Judge
- Basic FIFO/FILO and sorting Data Structures Exercice
- Miscellaneous Algorithms
- Counting Inversions in an array
- MaxSubarray Problem
- Max sum, non-consectuvive numbers in array
- String permutations
- All points from origin to a given point in a 2D matrix
- Merging K sorted arrays
Note: Refer to tests (where available) to see the implementation in action
License
The MIT License (MIT)
Copyright (c) 2015 Anurag Kapur
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.