## HackerRank : Moody’s Analytics University Hackathon – Learning From the Past

Your company can make of the available trades on any given day. They have a list of potential profits for the three trades available for each of the past days, and want to know what the maximum possible profit for any of these days would’ve been so they can make better trade decisions in the future. For each… Read More »

## 25 horses 5 tracks 3 fastest puzzle

Let’s say that you have 25 horses, and you want to pick the fastest 3 horses out of those 25. In each race, only 5 horses can run at the same time because there are only 5 tracks. What is the minimum number of races required to find the 3 fastest horses without using a stopwatch? This question is… Read More »

## HackerRank : World CodeSprint 7- Two Characters

String always consists of two distinct alternating characters. For example, if string ‘s two distinct characters are xand y, then t could be xyxyx or yxyxy but not xxyy or xyyx. You can convert some string to string by deleting characters from . When you delete a character from , you must delete all occurrences of it in… Read More »

## HackerRank : World CodeSprint 7- Sock Merchant

John’s clothing store has a pile of loose socks where each sock is labeled with an integer, , denoting its color. He wants to sell as many socks as possible, but his customers will only buy them in matching pairs. Two socks, and , are a single matching pair if . Given and the color of each sock,… Read More »

## HackerRank : 101 Hack 41- Lecture Notes

Alex has a habit of falling asleep during lectures! In order to complete the day’s homework, he must determine if he has any friends that stayed awake so he can borrow their notes. There are other students in Alex’s class, and each student has a distinct ID number from to . You are given a string, , of… Read More »