Awesome LeetCode resources to learn Data Structures and Algorithms and prepare for Coding Interviews.
20 matches across 3 categories. Click a row to expand file-level details.
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | patterns/java/TopKElements.java | 13 | // Step 1: Sort the array in descending order |
| LOW | patterns/java/TopKElements.java | 17 | // Step 2: Extract the first K elements |
| LOW | patterns/java/TopKElements.java | 72 | // Step 1: Build the frequency map |
| LOW | patterns/java/TopKElements.java | 78 | // Step 2: Sort the entries by frequency in descending order |
| LOW | patterns/java/TopKElements.java | 82 | // Step 3: Extract the top K elements |
| LOW | patterns/java/TopKElements.java | 92 | // Step 1: Build the frequency map |
| LOW | patterns/java/TopKElements.java | 98 | // Step 2: Use a min heap to keep track of the top K elements |
| LOW | patterns/java/TopKElements.java | 103 | // Step 3: Add each entry to the heap, and maintain size K |
| LOW | patterns/java/TopKElements.java | 111 | // Step 4: Extract the elements from the heap |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | patterns/python/top_k_elements.py | 7 | def k_largest_elements_sorting_approach(self, nums, k): |
| LOW | patterns/python/top_k_elements.py | 11 | def k_largest_elements_max_heap_approach(self, nums, k): |
| LOW | patterns/python/top_k_elements.py | 15 | def k_largest_elements_min_heap_approach(self, nums, k): |
| LOW | patterns/python/top_k_elements.py | 25 | def top_k_frequent_elements_sorting_approach(self, nums, k): |
| LOW | patterns/python/top_k_elements.py | 30 | def top_k_frequent_elements_min_heap_approach(self, nums, k): |
| LOW | patterns/python/top_k_elements.py | 43 | def k_closest_points_to_origin_max_heap_approach(self, points, k): |
| LOW | patterns/python/sliding_window.py | 2 | def find_max_average_brute_force(self, nums, k): |
| LOW | patterns/python/sliding_window.py | 10 | def find_max_average_sliding_window(self, nums, k): |
| LOW | patterns/python/sliding_window.py | 20 | def length_of_longest_substring_sliding_window(self, s): |
| LOW | patterns/python/sliding_window.py | 33 | def length_of_longest_substring_sliding_window_frequency_array(self, s): |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | patterns/go/level_order_traversal.go | 34 | // Example usage |