Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/vividvilla/hackerrank
Solutions to HackerRank problems.
https://github.com/vividvilla/hackerrank
Last synced: 11 days ago
JSON representation
Solutions to HackerRank problems.
- Host: GitHub
- URL: https://github.com/vividvilla/hackerrank
- Owner: vividvilla
- Created: 2013-03-07T14:14:13.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2017-10-28T07:38:46.000Z (about 7 years ago)
- Last Synced: 2023-03-24T18:35:40.858Z (over 1 year ago)
- Language: C++
- Homepage: http://www.hackerrank.com
- Size: 23.4 KB
- Stars: 7
- Watchers: 2
- Forks: 13
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Solutions to [HackerRank][1] problems
This repository contains solutions to [HackerRank][1] problems, available at
[http://www.hackerrank.com][1]. These solutions are provided "as is". I give no
guarantees that they will work as expected. Please refrain from using my
solutions in the site.## Instructions
You can compile all the problems by issuing the following command:
$ make
If you want to compile only a specific problem, issue the following command,
replacing `` with the id of the problem you want to compile (see
section "Problems Solved" for the list of possible ids):$ make
Running a compiled problem is just a matter of executing a command similar to
the next one, replacing `candies` with the id of the desired problem:$ ./candies
## Problems solved
The following is a possibly innacurate list of the problems solved:
### Algorithmic Challenges
#### Algorithmic Tutorials
* Insertion Sort - Part 1 (`insertionsort1`)
* Insertion Sort - Part 2 (`insertionsort2`)
* Running Time of Algorithms (`runningtime`)
* QuickSort1 - Partition (`quicksort1`)
* QuickSort (`quicksort2`)#### Search
* Pairs (`pairs`)
* Median (`median`)
* Flowers (`flowers`)### Dynamic Programming
* Candies (`candies`)
#### Graph Theory
* Grid Walking (`grid-walking`)
### Weekly Contests
* Oobleck Boxes (`oobleck-boxes`)
* Largest Sum Less Than M (`largest-sum-m`)[1]: http://www.hackerrank.com