Divide and Conquer

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: Sorting

Complexity Range

Time Complexity

O(n log n) (1 problem)

Space Complexity

O(n) (1 problem)

Problems Using Divide and Conquer

Merge Sort

Sort an array using Merge Sort algorithm.

Medium LeetCode
Time: O(n log n)
Space: O(n)
Example: [5,2,3,1] → [1,2,3,5]
Divide and Conquer Sorting
View Solution →
← Back to All Patterns
View All Categories