.

Author: hqztrue

0701-0800/750. Number Of Corner Rectangles.pdf

@@ -0,0 +1,3 @@
+The string is a nested parentheses instance, and can be transformed into a tree. The question is to find the minimal representation.
+O(n) using bit packing. see my article https://www.zhihu.com/question/55484468/answer/991551284.
+

0701-0800/761. Special Binary String.txt

@@ -0,0 +1,2 @@
+monotone stack. O(n).
+

2301-2400/2355. Maximum Number of Books You Can Take.txt

@@ -0,0 +1,2 @@
+O(sort(n)).
+

2301-2400/2363. Merge Similar Items.txt

@@ -0,0 +1,2 @@
+O(n).
+

2301-2400/2364. Count Number of Bad Pairs.txt

@@ -0,0 +1,2 @@
+greedy/simulation. O(n).
+

2301-2400/2365. Task Scheduler II.txt

@@ -0,0 +1,2 @@
+greedy backwards. O(n).
+

2301-2400/2366. Minimum Replacements to Sort the Array.txt

@@ -0,0 +1,2 @@
+hashing. O(n).
+

2301-2400/2367. Number of Arithmetic Triplets.txt

@@ -0,0 +1,2 @@
+dfs. O(n).
+

2301-2400/2368. Reachable Nodes With Restrictions.txt

@@ -0,0 +1,2 @@
+DP. O(n).
+

2301-2400/2369. Check if There is a Valid Partition For The Array.txt

@@ -0,0 +1,2 @@
+DP, range tree. O(n log k).
+

2301-2400/2370. Longest Ideal Subsequence.txt

@@ -0,0 +1,2 @@
+O(n^2).
+

2301-2400/2373. Largest Local Values in a Matrix.txt

@@ -0,0 +1,2 @@
+O(n+m).
+

2301-2400/2374. Node With Highest Edge Score.txt

@@ -0,0 +1,3 @@
+divide into "II...DD..." type of groups, use greedy on each group. O(n).
+see 484. Find Permutation.
+

2301-2400/2375. Construct Smallest Number From DI String.txt

@@ -0,0 +1,3 @@
+DP on digits. O(log n).
+see 1012. Numbers With Repeated Digits.
+