Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions NthHighestSalary.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
'''
Pandas4

1 Problem 1 : Nth Highest Salary (https://leetcode.com/problems/nth-highest-salary/solution/)
'''

import pandas as pd

def nth_highest_salary(employee: pd.DataFrame, N: int) -> pd.DataFrame:
employee = employee.drop_duplicates(subset = 'salary')
employee['rnk'] = employee['salary'].rank(method='dense', ascending=False)
ans = employee[employee.rnk==N][['salary']]
if not len(ans):
return pd.DataFrame({f'getNthHighestSalary({N})':[None]})
ans = ans.rename(columns={'salary':f'getNthHighestSalary({N})'})
return ans
16 changes: 16 additions & 0 deletions SecondHighestSalary.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
'''
2 Problem 2 : Second Highest Salary ( https://leetcode.com/problems/second-highest-salary/ )
'''

import numpy as np
import pandas as pd

def second_highest_salary(employee: pd.DataFrame) -> pd.DataFrame:
employee = employee.drop_duplicates(subset = 'salary')
if len(employee['salary'].unique())<2:
return pd.DataFrame({'SecondHighestSalary':[np.NaN]})

employee['rnk'] = employee['salary'].rank(method='dense', ascending=False)
ans = employee[employee.rnk==2][['salary']]
ans = ans.rename(columns={'salary':'SecondHighestSalary'})
return ans