Sync LeetCode submission Runtime - 489 ms (34.59%), Memory - 59.7 MB (100.00%)

Author: jimit105

0177-nth-highest-salary/README.md

@@ -0,0 +1,59 @@
+<p>Table: <code>Employee</code></p>
+
+<pre>
++-------------+------+
+| Column Name | Type |
++-------------+------+
+| id          | int  |
+| salary      | int  |
++-------------+------+
+id is the primary key (column with unique values) for this table.
+Each row of this table contains information about the salary of an employee.
+</pre>
+
+<p>&nbsp;</p>
+
+<p>Write a solution to find the <code>n<sup>th</sup></code> highest salary from the <code>Employee</code> table. If there is no <code>n<sup>th</sup></code> highest salary, return&nbsp;<code>null</code>.</p>
+
+<p>The result format is in the following example.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Employee table:
++----+--------+
+| id | salary |
++----+--------+
+| 1  | 100    |
+| 2  | 200    |
+| 3  | 300    |
++----+--------+
+n = 2
+<strong>Output:</strong> 
++------------------------+
+| getNthHighestSalary(2) |
++------------------------+
+| 200                    |
++------------------------+
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> 
+Employee table:
++----+--------+
+| id | salary |
++----+--------+
+| 1  | 100    |
++----+--------+
+n = 2
+<strong>Output:</strong> 
++------------------------+
+| getNthHighestSalary(2) |
++------------------------+
+| null                   |
++------------------------+
+</pre>

0177-nth-highest-salary/solution.py

@@ -0,0 +1,7 @@
+import pandas as pd
+
+def nth_highest_salary(employee: pd.DataFrame, N: int) -> pd.DataFrame:
+  df = employee[['salary']].drop_duplicates()
+  if len(df) < N:
+    return pd.DataFrame({f'getNthHighestSalary({N})' : [None]})
+  return df.sort_values('salary', ascending=False).head(N).tail(1)[['salary']]