CaffeCode
題庫
學習清單
登入
Divide & Conquer — CaffeCode
← 所有清單
Divide & Conquer
Divide and conquer algorithm problems.
17 道題目
#
題目
難度
Rating
1
109. Convert Sorted List to Binary Search Tree
Medium
—
2
307. Range Sum Query - Mutable
Medium
—
3
315. Count of Smaller Numbers After Self
Hard
2215
4
327. Count of Range Sum
Hard
—
5
493. Reverse Pairs
Hard
—
6
654. Maximum Binary Tree
Medium
—
7
1382. Balance a Binary Search Tree
Medium
1541
8
1569. Number of Ways to Reorder Array to Get Same BST
Hard
2288
9
1649. Create Sorted Array through Instructions
Hard
2208
10
2179. Count Good Triplets in an Array
Hard
2272
11
2407. Longest Increasing Subsequence II
Hard
2280
12
2426. Number of Pairs Satisfying Inequality
Hard
2030
13
3624. Number of Integers With Popcount-Depth Equal to K II
Hard
2086
14
3653. XOR After Range Multiplication Queries I
Medium
1556
15
3719. Longest Balanced Subarray I
Medium
1467
16
3737. Count Subarrays With Majority Element I
Medium
1423
17
3826. Minimum Partition Score
Hard
2345