Ollivander's Inventory is another HackerRank problem from Basic Join Category. Here is the SQL solution in MySQL environment.

Problem Description

Harry Potter and his friends are at Ollivander's with Ron, finally replacing Charlie's old broken wand.

Hermione decides the best way to choose is by determining the minimum number of gold galleons needed to buy each non-evil wand of high power and age. Write a query to print the id, age, coins_needed, and power of the wands that Ron's interested in, sorted in order of descending power. If more than one wand has same power, sort the result in order of descending age.

Sample Output 

9 45 1647 10
12 17 9897 10
1 20 3688 8
15 40 6018 7
19 20 7651 6
11 40 7587 5
10 20 504 5
18 40 3312 3
20 17 5689 3
5 45 6020 2
14 40 5408 1

To know the details about the problem visit : Ollivander's Inventory

Solution

Please check the snippet for the sql implementation. If you have different approach in mind feel free to share in the comment below.

Originally posted at: github.com by @Thomas-George-T