Solving Hacker Rank problems in a structured, reproducible way, with Haskell and Nix.
- Mini Max Sum
- Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers.
- Plus Minus
- Given an array of integers, calculate the ratios of its elements that are positive, negative, and zero.
- Time Conversion
- Given a time in 12-hour AM/PM format, convert it to military (24-hour) time.