Sorting

3 problems using this pattern

About this pattern:

Arrange elements in order using various sorting algorithms and techniques.

Often used with: Hash Map Divide and Conquer Heap String

Complexity Range

Time Complexity


                  O(n * k log k)

(1 problem)


                  O(n log n)

(2 problems)

Space Complexity


                  O(n * k)

(1 problem)


                  O(n)

(2 problems)

Problems Using Sorting

Group Anagrams

Groups words that are anagrams of each other.

Medium LeetCode

Time: O(n * k log k)

Space: O(n * k)

Example: ["eat","tea","tan","ate","nat","bat"] → [["eat","tea","ate"],["tan","nat"],["bat"]]

Hash Map String Sorting

View Solution →

Top K Frequent Elements

Returns the k most frequent elements in the array.

Medium LeetCode

Time: O(n log n)

Example: [1,1,1,2,2,3], k=2 → [1,2]

Hash Map Sorting Heap

View Solution →

Merge Sort

Sort an array using Merge Sort algorithm.

Medium LeetCode

Time: O(n log n)

Example: [5,2,3,1] → [1,2,3,5]

Divide and Conquer Sorting

View Solution →

← Back to All Patterns

View All Categories