# Placements SQL Hacker Rank Solution

Hello coders, In this post, you will learn how to solve the Placements SQL Hacker Rank Solution. This problem is a part of the SQL Hacker Rank series.

## Placements SQL Hacker Rank Solution

### Problem

You are given three tables: Students, Friends and Packages. Students contains two columns: ID and NameFriends contains two columns: ID and Friend_ID (ID of the ONLY best friend). Packages contains two columns: ID and Salary (offered salary in \$ thousands per month).

Write a query to output the names of those students whose best friends got offered a higher salary than them. Names must be ordered by the salary amount offered to the best friends. It is guaranteed that no two students got same salary offer.

Sample Input

Sample Output

``````Samantha
Julia
Scarlet
``````

Explanation

See the following table:

Now,

• Samantha’s best friend got offered a higher salary than her at 11.55
• Julia’s best friend got offered a higher salary than her at 12.12
• Scarlet’s best friend got offered a higher salary than her at 15.2
• Ashley’s best friend did NOT get offered a higher salary than her

The name output, when ordered by the salary offered to their friends, will be:

• Samantha
• Julia
• Scarlet

### Placements SQL Hacker Rank Solution

```select temp1.sn
from (select S.ID si,S.Name sn,P.Salary ps from Students S join Packages P on S.ID=P.ID) temp1 join (select FF.ID fi,FF.Friend_ID fd,PP.Salary
pps from Friends FF join Packages PP on FF.Friend_ID=pp.ID) temp2 on temp1.si=temp2.fi and temp1.ps<temp2.pps
order by temp2.pps asc;```

Disclaimer: The above Problem (Placements) generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes.

Sharing Is Caring