Tag: divide-and-conquer
- Balance a Binary Search Tree
- Beautiful Array
- Beautiful Pairs
- Construct Binary Tree from Inorder and Postorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Postorder Traversal
- Construct Quad Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Count Good Triplets in an Array
- Count Nodes That Are Great Enough
- Count of Range Sum
- Count of Smaller Numbers After Self
- Count Subarrays With More Ones Than Zeros
- Count the Number of K-Big Indices
- Create Sorted Array through Instructions
- Find Array Given Subset Sums
- Find Kth Largest XOR Coordinate Value
- Find the Index of Permutation
- Find the Kth Largest Integer in the Array
- K Closest Points to Origin
- Kth Largest Element in an Array
- Logical OR of Two Binary Grids Represented as Quad-Trees
- Longest Increasing Subsequence II
- Longest Nice Substring
- Longest Substring with At Least K Repeating Characters
- Majority Element
- Maximum Binary Tree
- Maximum Subarray
- Maximum Sum Circular Subarray
- Maximum Sum of Subsequence With Non-adjacent Elements
- Median of Two Sorted Arrays
- Merge k Sorted Lists
- Number of 1 Bits
- Number of Pairs Satisfying Inequality
- Number of Ships in a Rectangle
- Number of Ways to Reorder Array to Get Same BST
- Query Kth Smallest Trimmed Number
- Reverse Bits
- Reverse Pairs
- Search a 2D Matrix II
- Sort an Array
- Sort List
- Super Pow
- The Skyline Problem
- Top K Frequent Elements
- Wiggle Sort II