Solutions to HackerRank problems

This repository contains solutions to HackerRank problems, available at http://www.hackerrank.com. 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 <problem_id> with the id of the problem you want to compile (see section "Problems Solved" for the list of possible ids):

$ make <problem_id>

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)