Skip to content

Update kth_largest_element.data structures #12508

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

Update kth_largest_element.data structures #12508

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0188f81
Update kth_largest_element.data structures
TejashwiC Jan 7, 2025
c7da493
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Jan 7, 2025
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
7 changes: 0 additions & 7 deletions data_structures/arrays/kth_largest_element.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,10 +1,3 @@
"""
Given an array of integers and an integer k, find the kth largest element in the array.

https://stackoverflow.com/questions/251781
"""


def partition(arr: list[int], low: int, high: int) -> int:
"""
Partitions list based on the pivot element.
Expand Down
Loading