diff --git a/Acwing/fundamental/dp/A3.cpp b/Acwing/fundamental/dp/A3.cpp
new file mode 100644
index 0000000..59015d8
--- /dev/null
+++ b/Acwing/fundamental/dp/A3.cpp
@@ -0,0 +1,55 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int CompletePack(int n, int v, vector<pii > data) {
+        vector<int> dp(v + 1);
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j <= v; j++) {
+                if(j>=data[i].first){
+                    dp[j]=max(dp[j],dp[j-data[i].first]+data[i].second);
+                }
+            }
+        }
+        return dp[v];
+    }
+};
+
+int main() {
+    int n, v;
+    cin >> n >> v;
+    vector <pii> data;
+    for (int i = 0; i < n; i++) {
+        int vi, wi;
+        cin >> vi >> wi;
+        data.EB(make_pair(vi, wi));
+    }
+    Solution INSTANCE;
+    int ans = INSTANCE.CompletePack(n, v, data);
+    cout << ans << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/A4.cpp b/Acwing/fundamental/dp/A4.cpp
new file mode 100644
index 0000000..1f6e451
--- /dev/null
+++ b/Acwing/fundamental/dp/A4.cpp
@@ -0,0 +1,84 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// 多重背包
+class Solution {
+public:
+    int MultiPack(int n, int v, vector<vector<int>> data) {
+        vector<int> dp(v + 1);
+        for (int i = 0; i < data.size(); i++) {
+            int vi = data[i][0], wi = data[i][1], si = data[i][2];
+            MultiplePack(vi, wi, si, dp, v);
+        }
+        return dp[v];
+    }
+
+    int MultiplePack(int vi, int wi, int si, vector<int> &dp, int V) {
+        if (vi * si >= V) {
+            CompletePack(vi, wi, dp, V);
+            return dp[V];
+        }
+        int s = 1;
+        while (s < si) {//条件：amount-s>0
+            ZeroOnePack(s * vi, s * wi, dp, V);
+            si -= s;
+            s *= 2;
+        }
+        ZeroOnePack(si * vi, si * wi, dp, V);
+        return dp[V];
+    }
+
+    // 抽象化: 抽取01背包问题为处理一件物品
+    int ZeroOnePack(int vi, int wi, vector<int> &dp, int V) {
+        for (int j = V; j >= vi; j--) {
+            dp[j] = max(dp[j], dp[j - vi] + wi);
+        }
+        return dp[V];// 返回的是容量为V时候,处理一件物品获取的最大值
+    }
+
+    // 抽象化: 对一种物品的处理过程
+    int CompletePack(int vi, int wi, vector<int> &dp, int V) {
+        for (int j = 0; j <= V; j++) {
+            if (j >= vi) dp[j] = max(dp[j], dp[j - vi] + wi);
+        }
+        return dp[V];
+    }
+};
+
+int main() {
+    int n, v;
+    cin >> n >> v;
+    vector <vector<int>> data;
+    int vi, wi, si;
+    for (int i = 0; i < n; ++i) {
+        cin >> vi >> wi >> si;
+        data.EB(vector < int > {vi, wi, si});
+    }
+    Solution INSTANCE;
+    int ans = INSTANCE.MultiPack(n, v, data);
+    cout << ans << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/A9.cpp b/Acwing/fundamental/dp/A9.cpp
new file mode 100644
index 0000000..8cacb81
--- /dev/null
+++ b/Acwing/fundamental/dp/A9.cpp
@@ -0,0 +1,63 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int GroupPacK(int N, int V, vector<vector<pii>> &groups) {
+        vector<int> dp(V + 1);
+        for (int i = 0; i < N; i++) {
+            for (int v = V; v >= 0; v--) {
+                for (int j = 0; j < groups[i].size(); j++) {
+                    if (v >= groups[i][j].first)dp[v] = max(dp[v], dp[v - groups[i][j].first] + groups[i][j].second);
+                }
+            }
+        }
+        return dp[V];
+    }
+};
+
+
+// 分组背包
+int main() {
+    int N, V;
+    cin >> N >> V;
+    int si, vij, wij;
+    vector <vector<pii>> groups;
+    for (int i = 0; i < N; i++) {
+        cin >> si;
+        vector <pii> group;
+        for (int i = 0; i < si; ++i) {
+            cin >> vij >> wij;
+            group.EB(make_pair(vij, wij));
+        }
+        groups.EB(group);
+        group.clear();
+    }
+    Solution INSTANCE;
+    int ans = INSTANCE.GroupPacK(N, V, groups);
+    cout << ans << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC282.cpp b/Acwing/fundamental/dp/AC282.cpp
new file mode 100644
index 0000000..7318a5d
--- /dev/null
+++ b/Acwing/fundamental/dp/AC282.cpp
@@ -0,0 +1,46 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// dp(i,j)=dp(i,k)+sum(k+1,m)+dp(m+1,j)
+class Solution {
+public:
+    int mergeStone(vector<int> arr) {
+
+    }
+};
+
+int main() {
+    int N;
+    vector<int> arr;
+    int val;
+    while (N--) {
+        cin >> val;
+        arr.EB(val);
+    }
+    Solution INSTANCE;
+    int ans = INSTANCE.mergeStone(arr);
+    cout << ans << endl;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC285.cpp b/Acwing/fundamental/dp/AC285.cpp
new file mode 100644
index 0000000..f1d271a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC285.cpp
@@ -0,0 +1,25 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC291.cpp b/Acwing/fundamental/dp/AC291.cpp
new file mode 100644
index 0000000..f1d271a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC291.cpp
@@ -0,0 +1,25 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC338.cpp b/Acwing/fundamental/dp/AC338.cpp
new file mode 100644
index 0000000..f1d271a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC338.cpp
@@ -0,0 +1,25 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC895.cpp b/Acwing/fundamental/dp/AC895.cpp
new file mode 100644
index 0000000..65e76e4
--- /dev/null
+++ b/Acwing/fundamental/dp/AC895.cpp
@@ -0,0 +1,51 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: 线性dp
+int main() {
+    fastio
+    int N;
+    cin >> N;
+    vector<int> arr;
+    int val;
+    for (int i = 0; i < N; i++) {
+        cin >> val;
+        arr.EB(val);
+    }
+    vector<int> dp(N, 1);
+
+    int ans = MIN_VALUE;
+    for (int i = 0; i < N; ++i) {
+        for (int j = 0; j < i; ++j) {
+            if (arr[i] > arr[j]) {
+                dp[i] = max(dp[i], dp[j] + 1);
+            }
+        }
+        ans = max(ans, dp[i]);
+    }
+    cout << ans << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC896.cpp b/Acwing/fundamental/dp/AC896.cpp
new file mode 100644
index 0000000..e30a00a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC896.cpp
@@ -0,0 +1,49 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: 线性dp https://youtu.be/Q6KyDl_xiIg?t=666
+int main() {
+    fastio
+    int N;
+    cin >> N;
+    vector<int> arr;
+    int val;
+    for (int i = 0; i < N; i++) {
+        cin >> val;
+        arr.EB(val);
+    }
+    vector<int> q;
+    for (int ele:arr) {
+        auto pos = lower_bound(q.begin(), q.end(), ele);
+        if (pos == q.end()) {
+            q.PB(ele);
+        } else {
+            *pos = ele;
+        }
+    }
+    cout << q.size() << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC897.cpp b/Acwing/fundamental/dp/AC897.cpp
new file mode 100644
index 0000000..3ed1675
--- /dev/null
+++ b/Acwing/fundamental/dp/AC897.cpp
@@ -0,0 +1,45 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// dp(i,j) = dp(i-1,j-1) // s[i]==t[j]
+// dp(i,j) = max(dp(i-1,j),dp(i,j-1))
+int main() {
+    fastio
+    int N, M;
+    cin >> N >> M;
+    string s, t;
+    cin >> s >> t;
+    cout << N << M << s << t;
+    vector <vector<int>> dp(N + 1, vector<int>(M + 1, 0));
+    for (int i = 0; i < N; ++i) {
+        for (int j = 0; j < M; ++j) {
+            if (s[i] != t[j]) dp[i + 1][j + 1] = max(dp[i + 1][j], dp[i][j + 1]);
+            else dp[i + 1][j + 1] = dp[i][j] + 1;
+        }
+    }
+    cout << dp[N][M] << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC898.cpp b/Acwing/fundamental/dp/AC898.cpp
new file mode 100644
index 0000000..3c1c4af
--- /dev/null
+++ b/Acwing/fundamental/dp/AC898.cpp
@@ -0,0 +1,51 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: 线性dp
+int main() {
+    fastio
+    int n;
+    cin >> n;
+    vector <vector<int>> w(n + 1, vector<int>(n + 1));
+    vector <vector<int>> f(n + 1, vector<int>(n + 1));
+    FOR(i, 1, n + 1) {
+        FOR(j, 1, i + 1) {
+            cin >> w[i][j];
+        }
+    }
+    // INIT
+    for (int i = 1; i <= n; i++) {
+        f[n][i] = w[n][i];
+    }
+    // 从底到最上层
+    for (int i = n - 1; i >= 1; i--) {
+        for (int j = 1; j <= i; j++) {
+            f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + w[i][j];
+        }
+    }
+    cout << f[1][1] << endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC900.cpp b/Acwing/fundamental/dp/AC900.cpp
new file mode 100644
index 0000000..f1d271a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC900.cpp
@@ -0,0 +1,25 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC901.cpp b/Acwing/fundamental/dp/AC901.cpp
new file mode 100644
index 0000000..f1d271a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC901.cpp
@@ -0,0 +1,25 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Acwing/fundamental/dp/AC902.cpp b/Acwing/fundamental/dp/AC902.cpp
new file mode 100644
index 0000000..5ebd154
--- /dev/null
+++ b/Acwing/fundamental/dp/AC902.cpp
@@ -0,0 +1,86 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int ans;
+
+    int minDistance_(string s, string t) {
+        int m = s.size(), n = t.size();
+        vector <vector<int>> cache(m, vector<int>(n, -1));
+        return dfs(s, 0, t, 0, cache);
+    }
+
+    int dfs(string s, int i, string t, int j, vector<vector<int>> cache) {
+        if (j == t.size()) return s.size() - i;//删除操作次数
+        if (i == s.size()) return t.size() - j;// 添加操作次数
+        if (cache[i][j] > 0) return cache[i][j];
+        if (s[i] == t[j]) {
+            return dfs(s, i + 1, t, j + 1, cache);
+        } else {
+            int insCnt = dfs(s, i, t, j + 1, cache);
+            int delCnt = dfs(s, i + 1, t, j, cache);
+            int repCnt = dfs(s, i + 1, t, j + 1, cache);
+            cache[i][j] = min(insCnt, min(delCnt, repCnt)) + 1;
+        }
+        return cache[i][j];
+    }
+
+    int minDistance(string s, string t) {
+        int m = s.size(), n = t.size();
+        if (n * m == 0) return n + m;
+        vector <vector<int>> dp(m + 1, vector<int>(n + 1, 0));
+        for (int i = 0; i <= m; ++i) {
+            dp[i][0] = i;
+        }
+        for (int j = 0; j <= n; ++j) {
+            dp[0][j] = j;
+        }
+        for (int i = 1; i <= m; i++) {
+            for (int j = 1; j <= n; j++) {
+                if (s[i - 1] == t[j - 1])dp[i][j] = dp[i - 1][j - 1];
+                else {
+                    dp[i][j] = min(dp[i - 1][j], min(dp[i - 1][j - 1], dp[i][j - 1])) + 1;
+                }
+
+            }
+        }
+        return dp[m][n];
+    }
+};
+
+int main() {
+    fastio
+    int N, M;
+    string s, t;
+    cin >> N >> s;
+    cin >> M >> t;
+    Solution INSTANCE;
+    int ans = INSTANCE.minDistance(s, t);
+    cout << ans << endl;
+    return 0;
+}
+
diff --git a/Acwing/fundamental/dp/AC91.cpp b/Acwing/fundamental/dp/AC91.cpp
new file mode 100644
index 0000000..f1d271a
--- /dev/null
+++ b/Acwing/fundamental/dp/AC91.cpp
@@ -0,0 +1,25 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int INF = 0x3F3F3F3F, MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define FORD(i, a, b) for (int i = a; i >= b; i--)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Atcoder/ABC196_D.cpp b/Atcoder/ABC196_D.cpp
new file mode 100644
index 0000000..4c20bd1
--- /dev/null
+++ b/Atcoder/ABC196_D.cpp
@@ -0,0 +1,19 @@
+#include <algorithm>
+#include <functional>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <vector>
+
+using namespace std;
+const int INF = 0x3F3F3F3F;
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define ll long long
+#define pii pair<int, int>
+#define ll long long
+#define ld
+#define ioinit          \
+  ios_base::sync_with); \
+  cout.tie
+}
diff --git a/Leetcode/L1019.cpp b/Leetcode/L1019.cpp
new file mode 100644
index 0000000..f33b582
--- /dev/null
+++ b/Leetcode/L1019.cpp
@@ -0,0 +1,14 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode(int x) : val(x), next(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    vector<int> nextLargerNodes(ListNode* head) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L1057_.cpp b/Leetcode/L1057_.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1057_.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1066_.cpp b/Leetcode/L1066_.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1066_.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1157.cpp b/Leetcode/L1157.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1157.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1235.cpp b/Leetcode/L1235.cpp
new file mode 100644
index 0000000..201a97a
--- /dev/null
+++ b/Leetcode/L1235.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int jobScheduling(vector<int>& st, vector<int>& et, vector<int>& p) {
+        // dp[i]=max(dp[j]+prof[i])
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L1255.cpp b/Leetcode/L1255.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1255.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1278.cpp b/Leetcode/L1278.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1278.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1284.cpp b/Leetcode/L1284.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1284.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1335.cpp b/Leetcode/L1335.cpp
new file mode 100644
index 0000000..fd66854
--- /dev/null
+++ b/Leetcode/L1335.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int minDifficulty(vector<int>& jobDifficulty, int d) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L1425.cpp b/Leetcode/L1425.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1425.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1449.cpp b/Leetcode/L1449.cpp
new file mode 100644
index 0000000..19385bf
--- /dev/null
+++ b/Leetcode/L1449.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    string largestNumber(vector<int>& cost, int target) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L146.cpp b/Leetcode/L146.cpp
new file mode 100644
index 0000000..6fe1123
--- /dev/null
+++ b/Leetcode/L146.cpp
@@ -0,0 +1,120 @@
+// 146. LRU 缓存机制
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+
+struct DLinkedNode {
+    int key;
+    int value;
+    DLinkedNode *prev;
+    DLinkedNode *next;
+
+    DLinkedNode() : key(0), value(0) {}
+
+    DLinkedNode(int _key, int _value) {
+        this->key = _key;
+        this->value = _value;
+    }
+};
+// GET PUT操作都是O(1)
+class LRUCache {
+private:
+    unordered_map<int, DLinkedNode *> cache;
+    DLinkedNode *head;// 维护head tail 两个虚拟节点
+    DLinkedNode *tail;
+    int size;
+    int cap;
+
+public:
+    LRUCache(int capacity) {
+        this->cap = capacity;
+        size = 0;
+        head = new DLinkedNode();
+        tail = new DLinkedNode();
+        head->next = tail;
+        tail->prev = head;
+    }
+
+    int get(int key) {
+        if (!cache.count(key))return -1;
+        DLinkedNode *node = cache[key];
+        moveToHead(node);
+        return node->value;
+    }
+
+    void put(int key, int value) {
+        if (!cache.count(key)) {
+            DLinkedNode *newNode = new DLinkedNode(key, value);
+            cache[key] = newNode;
+            addToHead(newNode);
+            size++;
+            if (size > cap) {
+                DLinkedNode* removed = removeTail();
+                cache.erase(removed->key);
+                delete removed;
+                size--;
+            }
+        } else {
+            DLinkedNode *node = cache[key];
+            node->value = value;
+            moveToHead(node);
+        }
+    }
+
+    void moveToHead(DLinkedNode *node) {
+        removeNode(node);
+        addToHead(node);
+    }
+
+
+    DLinkedNode *removeTail() {
+        DLinkedNode *node = tail->prev;
+        removeNode(node);
+        return node;
+    }
+
+    void removeNode(DLinkedNode *target) {
+        DLinkedNode *prev = target->prev;
+        DLinkedNode *next = target->next;
+        prev->next = next;
+        next->prev = prev;
+    }
+
+    void addToHead(DLinkedNode *node) {//
+        DLinkedNode *nxt = head->next;
+        head->next = node;
+        node->prev = head;
+        nxt->prev = node;
+        node->next = nxt;
+    }
+
+};
+
+/**
+ * Your LRUCache object will be instantiated and called as such:
+ * LRUCache* obj = new LRUCache(capacity);
+ * int param_1 = obj->get(key);
+ * obj->put(key,value);
+ */
\ No newline at end of file
diff --git a/Leetcode/L1467.cpp b/Leetcode/L1467.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1467.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1508.cpp b/Leetcode/L1508.cpp
new file mode 100644
index 0000000..48eb9a1
--- /dev/null
+++ b/Leetcode/L1508.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int rangeSum(vector<int>& nums, int n, int left, int right) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L1526.cpp b/Leetcode/L1526.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1526.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1542.cpp b/Leetcode/L1542.cpp
new file mode 100644
index 0000000..1a813ca
--- /dev/null
+++ b/Leetcode/L1542.cpp
@@ -0,0 +1,49 @@
+#include <algorithm>
+#include <climits>
+#include <cmath>
+#include <functional>
+#include <iostream>
+#include <map>
+#include <queue>
+#include <set>
+#include <stack>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: bitmask hashTable
+class Solution {
+public:
+  int longestAwesome(string s) {
+    // 2的10次（0-9 奇偶状态位表示）
+    vector<int> idx(1024, INF);
+    idx[0] = -1; // 初始mask idx[0] = -1 设置为-1,覆盖 cornercase 输入的 s
+    // 本身就是回文串
+    int mask = 0, ans = 0;
+    for (int i = 0; i < s.size(); i++) {
+      mask ^= (1 << (s[i] - '0'));
+      ans = max(ans, i - idx[mask]);
+      // 只允许一位奇数位数字, 尝试更新 获取
+      for (int j = 0; j < 10; j++) {
+        ans = max(ans, i - idx[mask ^ (1 << j)]);
+      }
+      // 更新  mask,idx 出现的位次，取最小！
+      idx[mask] = min(idx[mask], i);
+    }
+    return ans;
+  }
+};
diff --git a/Leetcode/L1610.cpp b/Leetcode/L1610.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1610.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1611.cpp b/Leetcode/L1611.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/Leetcode/L1649.cpp b/Leetcode/L1649.cpp
new file mode 100644
index 0000000..466e1d1
--- /dev/null
+++ b/Leetcode/L1649.cpp
@@ -0,0 +1,35 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define ready ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+
+class Solution {
+public:
+    int createSortedArray(vector<int> &instructions) {
+
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
\ No newline at end of file
diff --git a/Leetcode/L1655.cpp b/Leetcode/L1655.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1655.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1686.cpp b/Leetcode/L1686.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1686.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1697.cpp b/Leetcode/L1697.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1697.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1739.cpp b/Leetcode/L1739.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1739.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1766.cpp b/Leetcode/L1766.cpp
new file mode 100644
index 0000000..a91e832
--- /dev/null
+++ b/Leetcode/L1766.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    vector<int> getCoprimes(vector<int> &nums, vector<vector<int>> &edges) {
+
+    }
+};
+
+int main() {
+
+}
\ No newline at end of file
diff --git a/Leetcode/L1770.cpp b/Leetcode/L1770.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1770.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1799.cpp b/Leetcode/L1799.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1799.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1802.cpp b/Leetcode/L1802.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1802.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1803.cpp b/Leetcode/L1803.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1803.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1824.cpp b/Leetcode/L1824.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1824.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1825.cpp b/Leetcode/L1825.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1825.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1830.cpp b/Leetcode/L1830.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1830.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1834.cpp b/Leetcode/L1834.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1834.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1835.cpp b/Leetcode/L1835.cpp
new file mode 100644
index 0000000..3ec2f9c
--- /dev/null
+++ b/Leetcode/L1835.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
\ No newline at end of file
diff --git a/Leetcode/L1840.cpp b/Leetcode/L1840.cpp
new file mode 100644
index 0000000..e50357f
--- /dev/null
+++ b/Leetcode/L1840.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
diff --git a/Leetcode/L1850.cpp b/Leetcode/L1850.cpp
new file mode 100644
index 0000000..f7118f6
--- /dev/null
+++ b/Leetcode/L1850.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
diff --git a/Leetcode/L1857.cpp b/Leetcode/L1857.cpp
new file mode 100644
index 0000000..bc4dff7
--- /dev/null
+++ b/Leetcode/L1857.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
diff --git a/Leetcode/L1866.cpp b/Leetcode/L1866.cpp
new file mode 100644
index 0000000..d2430b8
--- /dev/null
+++ b/Leetcode/L1866.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// https://bit.ly/3ona4UF
+// 组合数学
+class Solution {
+public:
+    int rearrangeSticks(int n, int k) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L1872.cpp b/Leetcode/L1872.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/Leetcode/L1921.cpp b/Leetcode/L1921.cpp
new file mode 100644
index 0000000..7320ba6
--- /dev/null
+++ b/Leetcode/L1921.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
diff --git a/Leetcode/L1923.cpp b/Leetcode/L1923.cpp
new file mode 100644
index 0000000..0f432ef
--- /dev/null
+++ b/Leetcode/L1923.cpp
@@ -0,0 +1,45 @@
+
+
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag:后缀数组 / rolling hash
+// 类似 1062会员题
+class Solution {
+public:
+  // rolling hash
+  int longestCommonSubpath_01(int n, vector<vector<int>>& paths) {
+
+  }
+
+  int longestCommonSubpath_02(int n, vector<vector<int>>& paths) {
+
+  }
+
+
+
+};
\ No newline at end of file
diff --git a/Leetcode/L204.cpp b/Leetcode/L204.cpp
new file mode 100644
index 0000000..7706a89
--- /dev/null
+++ b/Leetcode/L204.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// https://zhuanlan.zhihu.com/p/113815619
+// https://blog.csdn.net/afei__/article/details/80638460
+class Solution {
+public:
+    int countPrimes(int n) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L218.cpp b/Leetcode/L218.cpp
new file mode 100644
index 0000000..f5f45cc
--- /dev/null
+++ b/Leetcode/L218.cpp
@@ -0,0 +1,104 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag:SegmentTree/线段树
+class Solution {
+    class SegTree {
+    public:
+        int st, ed, status;
+        SegTree *left;
+        SegTree *right;
+
+        SegTree(int start, int end, int status) : st(start), ed(end), status(status), left(nullptr), right(nullptr) {};
+
+        void remove(SegTree *node) {
+            if (node == nullptr) return;
+            remove(node->left);
+            remove(node->right);
+            delete node;
+            node = nullptr;
+            return;
+        }
+
+        void setStatus(int a, int b, int s) {
+            if (a >= ed || b < st) return;
+            if (a <= st && b >= ed && s > status) {
+                remove(left);
+                remove(right);
+                status = s;
+                return;
+            }
+            if (a <= st && b >= ed && s < status && left == nullptr) {
+                return;
+            }
+            if (left == nullptr) {
+                int mid = (ed - st) >> 1 + st;
+                left = new SegTree(st, mid, status);
+                right = new SegTree(mid, ed, status);
+            }
+            left->setStatus(a, b, s);
+            right->setStatus(a, b, s);
+            status = max(left->status, right->status);
+        }
+    };
+
+
+public:
+    vector<vector<int>> results;
+
+    vector<vector<int>> getSkyline(vector<vector<int>> &buildings) {
+        if (buildings.size() == 0) return {};
+        SegTree *root = new SegTree(0, MAX_VALUE, 0);
+        for (auto p:buildings) {
+            root->setStatus(p[0], p[1], p[2]);
+        }
+        DFS(root);
+        if (results.back()[1] != 0) {
+            results.PB({MAX_VALUE, 0});
+        }
+        vector <vector<int>> filters;
+        for (auto p:results) {
+            if (filters.size() != 0 && p[1] == filters.back()[1]) continue;
+            filters.PB({p[0], p[1]});
+        }
+        if (filters.size() != 0 && filters[0][1] == 0) filters.erase(filters.begin());
+        return filters;
+    }
+
+    void DFS(SegTree *root) {
+        if (root->left == nullptr) {
+            results.PB({root->st, root->st});
+        } else {
+            DFS(root->left);
+            DFS(root->right);
+        }
+    }
+};
+
+int main() {
+
+    return 0;
+}
\ No newline at end of file
diff --git a/Leetcode/L239.cpp b/Leetcode/L239.cpp
new file mode 100644
index 0000000..dbd6a68
--- /dev/null
+++ b/Leetcode/L239.cpp
@@ -0,0 +1,33 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <numeric>
+#include <set>
+#include <unordered_set>
+
+using namespace std;
+
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("⚡️⚡️ bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
+
+    }
+};
+
diff --git a/Leetcode/L264.cpp b/Leetcode/L264.cpp
new file mode 100644
index 0000000..4079b4c
--- /dev/null
+++ b/Leetcode/L264.cpp
@@ -0,0 +1,41 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <cmath>
+
+using namespace std;
+
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, MOD = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// 丑数Ⅱ
+class Solution {
+public:
+    int nthUglyNumber(int n) {
+        vector<int> q({1});
+        int a = 0, b = 0, c = 0;
+        for (int i = 0; i < n - 1; ++i) {
+            int num = min(min(q[a] * 2, q[b] * 3), q[c] * 5);
+            if (q[a] * 2 == num) a++;
+            if (q[b] * 3 == num) b++;
+            if (q[c] * 5 == num) c++;
+            q.EB(num);
+        }
+        return q[n - 1];
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L313.cpp b/Leetcode/L313.cpp
new file mode 100644
index 0000000..f57c8a7
--- /dev/null
+++ b/Leetcode/L313.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+// 2 7 13 19
+//1，   2 7 13 19
+// 2,  2 7 13 19
+// 4,  7 13 19 4 14 26 38
+// 2 *   [7 13 29 ,4 14, 26 58]
+
+class Solution {
+public:
+    int nthSuperUglyNumber(int n, vector<int> &primes) {
+      return 0;
+    }
+};
diff --git a/Leetcode/L327.cpp b/Leetcode/L327.cpp
new file mode 100644
index 0000000..cb6371b
--- /dev/null
+++ b/Leetcode/L327.cpp
@@ -0,0 +1,120 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class SegTreeNode {
+public:
+    SegTreeNode *left;
+    SegTreeNode *right;
+    int start, end;
+    int info;
+
+    SegTreeNode(int l, int r) : start(l), end(r), info(0), left(NULL), right(NULL) {}
+};
+
+class SegTree {
+public:
+    vector<int> nums;
+    SegTreeNode *root;
+public:
+    void updateSingle(SegTreeNode *node, int id, int val) {
+        if (id < node->start || id > node->end) return;
+        if (node->start == node->end) {
+            node->info = val;
+            return;
+        }
+        updateSingle(node->left, id, val);
+        updateSingle(node->right, id, val);
+        node->info = node->left->info + node->right->info;  // write your own logic
+    }
+
+    int queryRange(SegTreeNode *node, int l, int r) {
+        if (r < node->start || l > node->end) {
+            return 0;  // write your own logic
+        }
+        if (l <= node->start && r >= node->end) {
+            return node->info;  // write your own logic
+        }
+        return queryRange(node->left, l, r) + queryRange(node->right, l, r);  // write your own logic
+    };
+
+    void init(SegTreeNode *node, int l, int r)  // init for range [a,b]
+    {
+        if (l == r) {
+            node->info = nums[l];
+            return;
+        }
+        int mid = (r - l) / 2 + l;
+        if (node->left == NULL) {
+            node->left = new SegTreeNode(l, mid);
+            node->right = new SegTreeNode(mid + 1, r);
+        }
+        init(node->left, l, mid);
+        init(node->right, mid + 1, r);
+        node->info = node->left->info + node->right->info;  // write your own logic
+    }
+};
+
+
+// https://bit.ly/3ww9h7D
+class Solution {
+public:
+    SegTree *tree;
+    vector<LL> vals;
+
+    int countRangeSum(vector<int> &nums, int lower, int upper) {
+        int n = nums.size();
+        vector<LL> preSum(n + 1, 0);
+        for (int i = 1; i <= nums.size(); i++) preSum[i] = preSum[i - 1] + nums[i - 1];
+        for (LL x:preSum) {
+            vals.PB(x);
+            vals.PB(x - lower);
+            vals.PB(x - upper);
+        }
+        map<LL, int> values;
+        int idx = 0;
+        for (LL x:vals) {
+            values[x] = idx;
+            idx++;
+        }
+        int ans = 0;
+        int l = 0, r = vals.size() - 1;
+        tree = new SegTree();
+        SegTreeNode *root = new SegTreeNode(l, r);
+        tree->init(root, l, r);
+        for (LL x:preSum) {
+            int l = values[x - lower], r = values[x - upper];
+            ans += tree->queryRange(root, l, r);
+            tree->updateSingle(root, values[x], values[x]);
+        }
+        return ans;
+    }
+
+    // tag:divide conquer
+    int _countRangeSum01(vector<int> &nums, int lower, int upper) {
+
+    }
+};
+
diff --git a/Leetcode/L480.cpp b/Leetcode/L480.cpp
new file mode 100644
index 0000000..42a1cb8
--- /dev/null
+++ b/Leetcode/L480.cpp
@@ -0,0 +1,32 @@
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <map>
+#include <algorithm>
+#include <functional>
+#include <stack>
+#include <numeric>
+#include <set>
+#include <unordered_set>
+
+using namespace std;
+
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("⚡️⚡️ bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+// 滑动窗口中位数
+class Solution {
+public:
+    vector<double> medianSlidingWindow(vector<int>& nums, int k) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L699.cpp b/Leetcode/L699.cpp
new file mode 100644
index 0000000..1a014f6
--- /dev/null
+++ b/Leetcode/L699.cpp
@@ -0,0 +1,100 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: segment tree 线段树+离散化
+
+class Solution {
+public:
+    // https://youtu.be/d7kSgkC32uY
+    vector<int> fallingSquares(vector<vector<int>> &positions) {
+
+    }
+
+
+    // https://youtu.be/UeuV-6Ygxs4 花花酱  01 02 答案
+    vector<int> _fallingSquares01(vector<vector<int>> &positions) {
+        vector<int> ans;
+        map<pii, int> map;
+        int max_height = MIN_VALUE;
+        for (vector<int> ele:positions) {
+            int st = ele[0], ed = ele[0] + ele[1];
+            auto it = map.upper_bound({st, ed});
+            // 这里还是没看懂 https://youtu.be/UeuV-6Ygxs4?t=887
+            if (it != map.begin()) {
+                auto it2 = it;
+                if ((--it2)->FI.SE > st)it = it2;
+            }
+            int base = 0;
+            vector <vector<int>> ranges;// shrink的区间
+            while (it != map.end() && it->FI.FI < ed) {
+                int s = it->FI.FI;
+                int e = it->FI.SE;
+                int h = it->SE;
+                // shrink的区间
+                if (s < st)ranges.EB(vector < int > {s, st, h});
+                if (e > ed)ranges.EB(vector < int > {ed, e, h});
+                base = max(base, h);
+                it = map.erase(it);// update iterator  ⭐
+            }
+            // UPDATE
+            int newH = base + ele[1];
+            map[{st, ed}] = newH;
+            for (vector<int> range:ranges) {
+                map[{range[0], range[1]}] = range[2];
+            }
+            max_height = max(max_height, newH);
+            ans.EB(max_height);
+        }
+        return ans;
+    }
+
+    // brute force O(n²)
+    vector<int> _fallingSquares02(vector<vector<int>> &positions) {
+        vector<int> ans;
+        vector <Range> intervals;
+        int maxHeight = MIN_VALUE;
+        for (vector<int> ele:positions) {
+            int st = ele[0], ed = ele[0] + ele[1];
+            int baseHeight = 0;
+            for (Range range:intervals) {
+                if (range.ed <= st || range.st >= ed)continue;
+                baseHeight = max(baseHeight, range.height);
+            }
+            int height = baseHeight + ele[1];
+            intervals.EB(Range(st, ed, height));
+            maxHeight = max(maxHeight, height);
+            ans.EB(maxHeight);
+        }
+        return ans;
+    }
+
+private:
+    struct Range {
+        int st, ed, height;
+
+        Range(int start, int end, int height) : st(start), ed(end), height(height) {}
+    };
+};
\ No newline at end of file
diff --git a/Leetcode/L715.cpp b/Leetcode/L715.cpp
new file mode 100644
index 0000000..db1c917
--- /dev/null
+++ b/Leetcode/L715.cpp
@@ -0,0 +1,110 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// ref:699 218 涉及节点动态开辟
+class RangeModule {
+private:
+  vector<pair<int, int>> ranges_;
+
+public:
+  RangeModule() {}
+
+  void addRange(int left, int right) {
+    vector<pair<int, int>> _ranges_;
+    bool inserted = false;
+    for (const auto &kv : ranges_) {
+      if (kv.first > right && !inserted) {
+        // 补上 之前 overlap 更新后的区间
+        _ranges_.emplace_back(left, right);
+        inserted = true;
+      }
+      if (kv.second < left || kv.first >right){
+        // not-overlap range
+        _ranges_.push_back(kv);
+      } else{
+        // update overlap 区间
+        left = min(left, kv.first);
+        right = max(right, kv.second);
+      }
+    }
+    if (!inserted) {
+      _ranges_.emplace_back(left, right);
+    }
+    ranges_.swap(_ranges_);
+  }
+
+// void addRange(int left, int right) {
+//         vector<pair<int, int>> new_ranges;
+//         bool inserted = false;
+//         for (const auto& kv : ranges_) {            
+//             if (kv.first > right && !inserted) {
+//                 new_ranges.emplace_back(left, right);
+//                 inserted = true;
+//             }
+//             if (kv.second < left || kv.first > right) { 
+//                 new_ranges.push_back(kv);
+//             } else {
+//                 left = min(left, kv.first);
+//                 right = max(right, kv.second);
+//             }
+//         }       
+//         if (!inserted) new_ranges.emplace_back(left, right);       
+//         ranges_.swap(new_ranges);
+//     }
+
+
+  bool queryRange(int left, int right) {
+    const int n = ranges_.size();
+    int l = 0, r = n;
+    while (l < r) {
+      int mid = l + (r - l) / 2;
+      if (ranges_[mid].second < left) {
+        l = mid + 1;
+      } else if (ranges_[mid].first > right) {
+        r = mid;
+      } else {
+        return ranges_[mid].first <= left && right <= ranges_[mid].second;
+      }
+    }
+    return false;
+  }
+
+  void removeRange(int left, int right) {
+    vector<pair<int, int>> _ranges_;
+    for (const auto &kv : ranges_) {
+      if (kv.second <= left || kv.first >= right) {
+        _ranges_.push_back(kv);
+      } else {
+        if (kv.first < left)
+          _ranges_.emplace_back(kv.first, left);
+        if (kv.second > right)
+          _ranges_.emplace_back(right, kv.second);
+      }
+    }
+    ranges_.swap(_ranges_);
+  }
+};
+
diff --git a/Leetcode/L739.cpp b/Leetcode/L739.cpp
new file mode 100644
index 0000000..0bf08c4
--- /dev/null
+++ b/Leetcode/L739.cpp
@@ -0,0 +1,43 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+
+class Solution {
+public:
+    vector<int> dailyTemperatures(vector<int>& temperatures) {
+        stack<int> s;
+        int len = temperatures.size();
+        vector<int> ans(len);
+        for (int i = 0; i < len; ++i) {
+            while (!s.empty()&&temperatures[s.top()]<temperatures[i]){
+                int idx = s.top();s.pop();
+                ans[idx]= i-idx;
+            }
+            s.push(i);
+        }
+        return ans;
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L752.cpp b/Leetcode/L752.cpp
new file mode 100644
index 0000000..7d0418e
--- /dev/null
+++ b/Leetcode/L752.cpp
@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int openLock(vector<string> &deadends, string target) {
+        set <string> seen(deadends.begin(), deadends.end());
+        queue <string> q;
+        string start = "0000";
+        if (seen.count(start)) return -1;
+        if (start == target) return 0;
+        q.push(start);
+        int level = 0;
+        while (!q.empty()) {
+            level++;
+            int len = q.size();
+            for (int i = 0; i < len; i++) {
+                const string cur = q.front();
+                q.pop();
+                for (int j = 0; j < 4; j++) {
+                    for (int k = -1; k <= 1; k += 2) {// iteration 2 times
+                        string nextRet = cur;
+                        nextRet[j] = ((cur[j] - '0' + k + 10) % 10) + '0'; //  k [-1,1] 代表上下旋转
+                        if (nextRet == target) return level;
+                        if (seen.count(nextRet)) continue;
+                        q.push(nextRet);
+                        seen.insert(nextRet);
+                    }
+                }
+            }
+        }
+        return -1;
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L765.cpp b/Leetcode/L765.cpp
new file mode 100644
index 0000000..2d392f7
--- /dev/null
+++ b/Leetcode/L765.cpp
@@ -0,0 +1,74 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: union-find  相似题目1202
+class Solution {
+public:
+    int minSwapsCouples(vector<int> &row) {
+        int N = row.size();
+        parent.resize(N);
+        for (int i = 0; i < N; i = i + 2) {
+            parent[i] = i;
+            parent[i + 1] = i;
+        }
+        for (int i = 0; i < N; i += 2) {
+            int a = row[i];
+            int b = row[i + 1];
+            if (Find(a) != Find(b)) {
+                Union(a, b);
+            }
+        }
+        unordered_map<int, int> count;
+        for (int i = 0; i < N; ++i) {
+            count[Find(i)]++;
+        }
+        int ans = 0;
+        for (auto x : count) {
+            ans += x.second / 2 - 1;
+        }
+        return ans;
+    }
+
+    int Find(int u) {
+        if (u != parent[u]) {
+            parent[u] = Find(parent[u]);
+        }
+        return parent[u];
+    }
+
+    void Union(int u, int v) {
+        int pu = parent[u], pv = parent[v];
+
+        if (pu < pv) {
+            parent[pv] = pu;
+        } else {
+            parent[pu] = pv;
+        }
+    }
+
+private:
+    vector<int> parent;
+};
\ No newline at end of file
diff --git a/Leetcode/L787.cpp b/Leetcode/L787.cpp
new file mode 100644
index 0000000..fde8637
--- /dev/null
+++ b/Leetcode/L787.cpp
@@ -0,0 +1,86 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int findCheapestPrice(int n, vector<vector<int>> &flights, int src, int dst, int K) {
+        vector < vector < vector < int>>>G(n);
+        int u, v, w;
+        for (vector<int> flight: flights) {
+            u = flight[0], v = flight[1], w = flight[2];
+            G[u].PB({v, w});
+        }
+        vector <vector<int>> seen(n, vector<int>(K + 2, INF));
+        seen[src][0] = 0;
+        multiset <vector<int>> q;
+        q.insert({0, 0, src});
+        while (!q.empty()) {
+            vector<int> flight = *q.begin();
+            int cost = flight[0], step = flight[1], cur = flight[2];
+            q.erase(q.begin());
+            if (cur == dst) return cost;
+            if (step > K) continue;
+            for (vector<int> flight:G[cur]) {
+                int v = flight[0], w = flight[1];
+                if (cost + w < seen[v][step + 1]) {
+                    seen[v][step + 1] = cost + w;
+                    q.insert({cost + w, step + 1, v});
+                }
+            }
+        }
+        return -1;
+    }
+
+    // dp 最多做K+1次飞机
+    int findCheapestPrice_(int n, vector<vector<int>> &flights, int src, int dst, int K) {
+        vector <vector<int>> dp(K + 2, vector<int>(n, INF));
+        dp[0][src] = 0;
+        for (int k = 1; k <= K + 1; ++k) {
+            dp[k][src] = 0;
+            for (auto flight:flights) {
+                int u = flight[0], v = flight[1], w = flight[2];
+                dp[k][v] = min(dp[k][v], dp[k - 1][u] + w);
+            }
+        }
+        int ret = dp[K + 1][dst];
+        return ret >= INF ? -1 : ret;
+    }
+    // dp 最多k次
+    int findCheapestPrice__(int n, vector<vector<int>> &flights, int src, int dst, int K) {
+        vector <vector<int>> dp(K + 2, vector<int>(n, INF));
+        dp[0][src] = 0;
+        for (int k = 1; k <= K + 1; ++k) {
+            for (auto flight:flights) {
+                int u = flight[0], v = flight[1], w = flight[2];
+                dp[k][v] = min(dp[k][v], dp[k - 1][v]);
+                dp[k][v] = min(dp[k][v], dp[k - 1][u] + w);
+            }
+        }
+        int ret = dp[K + 1][dst];
+        return ret >= INF ? -1 : ret;
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L803.cpp b/Leetcode/L803.cpp
new file mode 100644
index 0000000..f6e1873
--- /dev/null
+++ b/Leetcode/L803.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+// tag: union-find
+class Solution {
+public:
+    vector<int> hitBricks(vector<vector<int>>& grid, vector<vector<int>>& hits) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L871.cpp b/Leetcode/L871.cpp
new file mode 100644
index 0000000..5be9b64
--- /dev/null
+++ b/Leetcode/L871.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int minRefuelStops(int target, int startFuel, vector<vector<int>>& stations) {
+
+    }
+};
diff --git a/Leetcode/L907.cpp b/Leetcode/L907.cpp
new file mode 100644
index 0000000..e67d045
--- /dev/null
+++ b/Leetcode/L907.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int sumSubarrayMins(vector<int>& arr) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L927.cpp b/Leetcode/L927.cpp
new file mode 100644
index 0000000..ac1ea8b
--- /dev/null
+++ b/Leetcode/L927.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    vector<int> threeEqualParts(vector<int> &arr) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L968.cpp b/Leetcode/L968.cpp
new file mode 100644
index 0000000..9690ffe
--- /dev/null
+++ b/Leetcode/L968.cpp
@@ -0,0 +1,43 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    int minCameraCover(TreeNode* root) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L980.cpp b/Leetcode/L980.cpp
new file mode 100644
index 0000000..b2098e9
--- /dev/null
+++ b/Leetcode/L980.cpp
@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int uniquePathsIII(vector<vector<int>>& grid) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/L995.cpp b/Leetcode/L995.cpp
new file mode 100644
index 0000000..5158ba3
--- /dev/null
+++ b/Leetcode/L995.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <stack>
+#include <set>
+#include <unordered_set>
+#include <map>
+#include <unordered_map>
+#include <algorithm>
+#include <functional>
+#include <cmath>
+#include <climits>
+
+using namespace std;
+const int MAX_VALUE = 0x7FFFFFFF, MIN_VALUE = 0x80000000, INF = 0x3F3F3F3F, kMod = 1E9 + 7;
+#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
+#define debug puts("pigtoria bling bling ⚡️⚡️");
+#define FOR(i, a, b) for (int i = a; i < b; i++)
+#define pii pair<int, int>
+#define LL long long
+#define LD long double
+#define PB push_back
+#define EB emplace_back
+#define MP make_pair
+#define FI first
+#define SE second
+
+class Solution {
+public:
+    int minKBitFlips(vector<int>& nums, int k) {
+
+    }
+};
\ No newline at end of file
diff --git a/Leetcode/Solution.cpp b/Leetcode/Solution.cpp
new file mode 100644
index 0000000..40e9116
--- /dev/null
+++ b/Leetcode/Solution.cpp
@@ -0,0 +1,4 @@
+class Solution {
+public:
+  int eliminateMaximum(vector<int> &dist, vector<int> &speed) {}
+};
diff --git a/Leetcode/doc/all.json b/Leetcode/doc/all.json
new file mode 100644
index 0000000..14e5067
--- /dev/null
+++ b/Leetcode/doc/all.json
@@ -0,0 +1 @@
+[{"acceptance":0.7006954398258746,"acs":65995,"articleLive":2,"columnArticles":792,"formTitle":"[451]Sort Characters By Frequency","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"","submitted":94185,"title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5146598049781812,"acs":2203342,"articleLive":2,"columnArticles":13056,"formTitle":"[1]Two Sum","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"","submitted":4281162,"title":"Two Sum","titleSlug":"two-sum"},{"acceptance":0.4043082232327303,"acs":889920,"articleLive":2,"columnArticles":6355,"formTitle":"[2]Add Two Numbers","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"","submitted":2201093,"title":"Add Two Numbers","titleSlug":"add-two-numbers"},{"acceptance":0.37404775167524273,"acs":1062979,"articleLive":2,"columnArticles":6400,"formTitle":"[3]Longest Substring Without Repeating Characters","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"","submitted":2841827,"title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4040308016684237,"acs":440737,"articleLive":2,"columnArticles":3238,"formTitle":"[4]Median of Two Sorted Arrays","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"","submitted":1090850,"title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3456163377165829,"acs":628035,"articleLive":2,"columnArticles":3428,"formTitle":"[5]Longest Palindromic Substring","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"","submitted":1817145,"title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5039270921501322,"acs":268511,"articleLive":2,"columnArticles":2127,"formTitle":"[6]ZigZag Conversion","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"","submitted":532837,"title":"ZigZag Conversion","titleSlug":"zigzag-conversion"},{"acceptance":0.3544366312781153,"acs":747095,"articleLive":2,"columnArticles":4716,"formTitle":"[7]Reverse Integer","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"","submitted":2107838,"title":"Reverse Integer","titleSlug":"reverse-integer"},{"acceptance":0.2159096881707846,"acs":308096,"articleLive":2,"columnArticles":2419,"formTitle":"[8]String to Integer (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1426967,"title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5862511560221956,"acs":689694,"articleLive":2,"columnArticles":4356,"formTitle":"[9]Palindrome Number","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1176448,"title":"Palindrome Number","titleSlug":"palindrome-number"},{"acceptance":0.3140630334956902,"acs":180286,"articleLive":2,"columnArticles":1110,"formTitle":"[10]Regular Expression Matching","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","submitted":574044,"title":"Regular Expression Matching","titleSlug":"regular-expression-matching"},{"acceptance":0.6367326285549504,"acs":468108,"articleLive":2,"columnArticles":2587,"formTitle":"[11]Container With Most Water","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"","submitted":735172,"title":"Container With Most Water","titleSlug":"container-with-most-water"},{"acceptance":0.6661353322047965,"acs":202264,"articleLive":2,"columnArticles":1569,"formTitle":"[12]Integer to Roman","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","submitted":303638,"title":"Integer to Roman","titleSlug":"integer-to-roman"},{"acceptance":0.63334647818965,"acs":417578,"articleLive":2,"columnArticles":3486,"formTitle":"[13]Roman to Integer","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","submitted":659320,"title":"Roman to Integer","titleSlug":"roman-to-integer"},{"acceptance":0.40119650841581067,"acs":552182,"articleLive":2,"columnArticles":3402,"formTitle":"[14]Longest Common Prefix","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1376338,"title":"Longest Common Prefix","titleSlug":"longest-common-prefix"},{"acceptance":0.3253453699419267,"acs":550540,"articleLive":2,"columnArticles":2571,"formTitle":"[15]3Sum","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","submitted":1692171,"title":"3Sum","titleSlug":"3sum"},{"acceptance":0.45969283474974876,"acs":229184,"articleLive":2,"columnArticles":1234,"formTitle":"[16]3Sum Closest","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":498559,"title":"3Sum Closest","titleSlug":"3sum-closest"},{"acceptance":0.5689810375530812,"acs":290755,"articleLive":2,"columnArticles":2652,"formTitle":"[17]Letter Combinations of a Phone Number","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","submitted":511010,"title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4056599392974887,"acs":192196,"articleLive":2,"columnArticles":1305,"formTitle":"[18]4Sum","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":473786,"title":"4Sum","titleSlug":"4sum"},{"acceptance":0.4220251500188835,"acs":422394,"articleLive":2,"columnArticles":3217,"formTitle":"[19]Remove Nth Node From End of List","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"","submitted":1000874,"title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4426702783851702,"acs":678193,"articleLive":2,"columnArticles":4899,"formTitle":"[20]Valid Parentheses","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"","submitted":1532050,"title":"Valid Parentheses","titleSlug":"valid-parentheses"},{"acceptance":0.662341321821323,"acs":608795,"articleLive":2,"columnArticles":2971,"formTitle":"[21]Merge Two Sorted Lists","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"","submitted":919156,"title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7723328906595839,"acs":296599,"articleLive":2,"columnArticles":2279,"formTitle":"[22]Generate Parentheses","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","submitted":384030,"title":"Generate Parentheses","titleSlug":"generate-parentheses"},{"acceptance":0.5544401544401545,"acs":277148,"articleLive":2,"columnArticles":1813,"formTitle":"[23]Merge k Sorted Lists","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"","submitted":499870,"title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.6991081263546886,"acs":275450,"articleLive":2,"columnArticles":2247,"formTitle":"[24]Swap Nodes in Pairs","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"","submitted":394002,"title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.651358038323907,"acs":188759,"articleLive":2,"columnArticles":1866,"formTitle":"[25]Reverse Nodes in k-Group","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"","submitted":289793,"title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5401268487445419,"acs":715095,"articleLive":2,"columnArticles":4018,"formTitle":"[26]Remove Duplicates from Sorted Array","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"","submitted":1323939,"title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5983070504892769,"acs":419923,"articleLive":2,"columnArticles":3579,"formTitle":"[27]Remove Element","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"","submitted":701852,"title":"Remove Element","titleSlug":"remove-element"},{"acceptance":0.40710658892648205,"acs":410911,"articleLive":2,"columnArticles":2927,"formTitle":"[28]Implement strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"","submitted":1009345,"title":"Implement strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2060714194791198,"acs":97133,"articleLive":2,"columnArticles":790,"formTitle":"[29]Divide Two Integers","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":471356,"title":"Divide Two Integers","titleSlug":"divide-two-integers"},{"acceptance":0.35078854460663816,"acs":69353,"articleLive":2,"columnArticles":504,"formTitle":"[30]Substring with Concatenation of All Words","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"","submitted":197706,"title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37140728476821194,"acs":179464,"articleLive":2,"columnArticles":1499,"formTitle":"[31]Next Permutation","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","submitted":483200,"title":"Next Permutation","titleSlug":"next-permutation"},{"acceptance":0.3518009870742347,"acs":162023,"articleLive":2,"columnArticles":1137,"formTitle":"[32]Longest Valid Parentheses","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":460553,"title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42047986480796207,"acs":301569,"articleLive":2,"columnArticles":2023,"formTitle":"[33]Search in Rotated Sorted Array","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"","submitted":717202,"title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42522276100574746,"acs":276405,"articleLive":2,"columnArticles":2673,"formTitle":"[34]Find First and Last Position of Element in Sorted Array","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"","submitted":650024,"title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.47052974459652175,"acs":406485,"articleLive":2,"columnArticles":3209,"formTitle":"[35]Search Insert Position","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","submitted":863888,"title":"Search Insert Position","titleSlug":"search-insert-position"},{"acceptance":0.6259909482596504,"acs":149794,"articleLive":2,"columnArticles":950,"formTitle":"[36]Valid Sudoku","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"","submitted":239291,"title":"Valid Sudoku","titleSlug":"valid-sudoku"},{"acceptance":0.6710502115137024,"acs":87564,"articleLive":2,"columnArticles":763,"formTitle":"[37]Sudoku Solver","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":130488,"title":"Sudoku Solver","titleSlug":"sudoku-solver"},{"acceptance":0.5773333101336303,"acs":199083,"articleLive":2,"columnArticles":2088,"formTitle":"[38]Count and Say","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":344832,"title":"Count and Say","titleSlug":"count-and-say"},{"acceptance":0.7251646290186946,"acs":280258,"articleLive":2,"columnArticles":1656,"formTitle":"[39]Combination Sum","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","submitted":386475,"title":"Combination Sum","titleSlug":"combination-sum"},{"acceptance":0.634626347381246,"acs":170328,"articleLive":2,"columnArticles":1186,"formTitle":"[40]Combination Sum II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","submitted":268391,"title":"Combination Sum II","titleSlug":"combination-sum-ii"},{"acceptance":0.4140869196672965,"acs":140691,"articleLive":2,"columnArticles":1298,"formTitle":"[41]First Missing Positive","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"","submitted":339762,"title":"First Missing Positive","titleSlug":"first-missing-positive"},{"acceptance":0.562941299617461,"acs":266211,"articleLive":2,"columnArticles":2129,"formTitle":"[42]Trapping Rain Water","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","submitted":472893,"title":"Trapping Rain Water","titleSlug":"trapping-rain-water"},{"acceptance":0.44790385757388534,"acs":149341,"articleLive":2,"columnArticles":1000,"formTitle":"[43]Multiply Strings","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"","submitted":333422,"title":"Multiply Strings","titleSlug":"multiply-strings"},{"acceptance":0.3253659544073733,"acs":75617,"articleLive":2,"columnArticles":494,"formTitle":"[44]Wildcard Matching","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":232406,"title":"Wildcard Matching","titleSlug":"wildcard-matching"},{"acceptance":0.40946121267949664,"acs":148019,"articleLive":2,"columnArticles":1283,"formTitle":"[45]Jump Game II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"","submitted":361497,"title":"Jump Game II","titleSlug":"jump-game-ii"},{"acceptance":0.7804008720036021,"acs":350105,"articleLive":2,"columnArticles":2288,"formTitle":"[46]Permutations","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","submitted":448622,"title":"Permutations","titleSlug":"permutations"},{"acceptance":0.6333382469588168,"acs":180452,"articleLive":2,"columnArticles":1271,"formTitle":"[47]Permutations II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"","submitted":284922,"title":"Permutations II","titleSlug":"permutations-ii"},{"acceptance":0.7310374348198303,"acs":187862,"articleLive":2,"columnArticles":1655,"formTitle":"[48]Rotate Image","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","submitted":256980,"title":"Rotate Image","titleSlug":"rotate-image"},{"acceptance":0.6607050066252695,"acs":203439,"articleLive":2,"columnArticles":1151,"formTitle":"[49]Group Anagrams","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":307912,"title":"Group Anagrams","titleSlug":"group-anagrams"},{"acceptance":0.3756406478975894,"acs":193787,"articleLive":2,"columnArticles":1162,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","submitted":515884,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7376758030784212,"acs":133329,"articleLive":2,"columnArticles":1346,"formTitle":"[51]N-Queens","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","submitted":180742,"title":"N-Queens","titleSlug":"n-queens"},{"acceptance":0.8234979388839574,"acs":67722,"articleLive":2,"columnArticles":550,"formTitle":"[52]N-Queens II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":82237,"title":"N-Queens II","titleSlug":"n-queens-ii"},{"acceptance":0.5447898598538877,"acs":551530,"articleLive":2,"columnArticles":3118,"formTitle":"[53]Maximum Subarray","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","submitted":1012372,"title":"Maximum Subarray","titleSlug":"maximum-subarray"},{"acceptance":0.47331926352633186,"acs":164167,"articleLive":2,"columnArticles":1784,"formTitle":"[54]Spiral Matrix","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":346842,"title":"Spiral Matrix","titleSlug":"spiral-matrix"},{"acceptance":0.4260765829347206,"acs":259297,"articleLive":2,"columnArticles":2059,"formTitle":"[55]Jump Game","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","submitted":608569,"title":"Jump Game","titleSlug":"jump-game"},{"acceptance":0.46000272219953725,"acs":253473,"articleLive":2,"columnArticles":1988,"formTitle":"[56]Merge Intervals","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":551025,"title":"Merge Intervals","titleSlug":"merge-intervals"},{"acceptance":0.4089294322302098,"acs":78045,"articleLive":2,"columnArticles":856,"formTitle":"[57]Insert Interval","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":190852,"title":"Insert Interval","titleSlug":"insert-interval"},{"acceptance":0.3470283995896248,"acs":196526,"articleLive":2,"columnArticles":2084,"formTitle":"[58]Length of Last Word","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":566311,"title":"Length of Last Word","titleSlug":"length-of-last-word"},{"acceptance":0.7963333406607901,"acs":108678,"articleLive":2,"columnArticles":1389,"formTitle":"[59]Spiral Matrix II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":136473,"title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5221201899050475,"acs":83581,"articleLive":2,"columnArticles":865,"formTitle":"[60]Permutation Sequence","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":160080,"title":"Permutation Sequence","titleSlug":"permutation-sequence"},{"acceptance":0.41807078457157454,"acs":176762,"articleLive":2,"columnArticles":1805,"formTitle":"[61]Rotate List","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"","submitted":422804,"title":"Rotate List","titleSlug":"rotate-list"},{"acceptance":0.6547187043055414,"acs":269549,"articleLive":2,"columnArticles":2116,"formTitle":"[62]Unique Paths","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","submitted":411702,"title":"Unique Paths","titleSlug":"unique-paths"},{"acceptance":0.3854568264255449,"acs":155469,"articleLive":2,"columnArticles":1484,"formTitle":"[63]Unique Paths II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":403337,"title":"Unique Paths II","titleSlug":"unique-paths-ii"},{"acceptance":0.6864011534670217,"acs":233270,"articleLive":2,"columnArticles":1837,"formTitle":"[64]Minimum Path Sum","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","submitted":339845,"title":"Minimum Path Sum","titleSlug":"minimum-path-sum"},{"acceptance":0.2672846015799893,"acs":43341,"articleLive":2,"columnArticles":596,"formTitle":"[65]Valid Number","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","submitted":162153,"title":"Valid Number","titleSlug":"valid-number"},{"acceptance":0.4585851840141366,"acs":310381,"articleLive":2,"columnArticles":2797,"formTitle":"[66]Plus One","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"","submitted":676823,"title":"Plus One","titleSlug":"plus-one"},{"acceptance":0.5448033006921906,"acs":175753,"articleLive":2,"columnArticles":1601,"formTitle":"[67]Add Binary","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":322599,"title":"Add Binary","titleSlug":"add-binary"},{"acceptance":0.46609169790547095,"acs":17780,"articleLive":2,"columnArticles":270,"formTitle":"[68]Text Justification","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":38147,"title":"Text Justification","titleSlug":"text-justification"},{"acceptance":0.39290071683616035,"acs":333302,"articleLive":2,"columnArticles":1672,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":848311,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5219473655533156,"acs":478965,"articleLive":2,"columnArticles":3046,"formTitle":"[70]Climbing Stairs","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","submitted":917650,"title":"Climbing Stairs","titleSlug":"climbing-stairs"},{"acceptance":0.419932899542587,"acs":84737,"articleLive":2,"columnArticles":740,"formTitle":"[71]Simplify Path","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"","submitted":201787,"title":"Simplify Path","titleSlug":"simplify-path"},{"acceptance":0.6094009617758953,"acs":145606,"articleLive":2,"columnArticles":1060,"formTitle":"[72]Edit Distance","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","submitted":238933,"title":"Edit Distance","titleSlug":"edit-distance"},{"acceptance":0.5952507849397114,"acs":112803,"articleLive":2,"columnArticles":808,"formTitle":"[73]Set Matrix Zeroes","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","submitted":189505,"title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4516846630673865,"acs":144568,"articleLive":2,"columnArticles":1465,"formTitle":"[74]Search a 2D Matrix","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","submitted":320064,"title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5892347600518807,"acs":227150,"articleLive":2,"columnArticles":1630,"formTitle":"[75]Sort Colors","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":385500,"title":"Sort Colors","titleSlug":"sort-colors"},{"acceptance":0.4172546344060971,"acs":150447,"articleLive":2,"columnArticles":1058,"formTitle":"[76]Minimum Window Substring","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":360564,"title":"Minimum Window Substring","titleSlug":"minimum-window-substring"},{"acceptance":0.7688262724476634,"acs":178227,"articleLive":2,"columnArticles":1037,"formTitle":"[77]Combinations","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","submitted":231817,"title":"Combinations","titleSlug":"combinations"},{"acceptance":0.7991436997559843,"acs":266910,"articleLive":2,"columnArticles":1777,"formTitle":"[78]Subsets","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","submitted":333995,"title":"Subsets","titleSlug":"subsets"},{"acceptance":0.45254540308162755,"acs":187061,"articleLive":2,"columnArticles":1220,"formTitle":"[79]Word Search","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","submitted":413353,"title":"Word Search","titleSlug":"word-search"},{"acceptance":0.61405833744171,"acs":135764,"articleLive":2,"columnArticles":1220,"formTitle":"[80]Remove Duplicates from Sorted Array II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"","submitted":221093,"title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4161431691046696,"acs":111290,"articleLive":2,"columnArticles":894,"formTitle":"[81]Search in Rotated Sorted Array II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"","submitted":267432,"title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5249785046236993,"acs":149590,"articleLive":2,"columnArticles":1495,"formTitle":"[82]Remove Duplicates from Sorted List II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"","submitted":284945,"title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5375905734695766,"acs":273103,"articleLive":2,"columnArticles":1687,"formTitle":"[83]Remove Duplicates from Sorted List","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"","submitted":508013,"title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4300511540117581,"acs":158808,"articleLive":2,"columnArticles":1020,"formTitle":"[84]Largest Rectangle in Histogram","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","submitted":369277,"title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5169494099139319,"acs":85109,"articleLive":2,"columnArticles":608,"formTitle":"[85]Maximal Rectangle","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","submitted":164637,"title":"Maximal Rectangle","titleSlug":"maximal-rectangle"},{"acceptance":0.6296987423223165,"acs":107647,"articleLive":2,"columnArticles":992,"formTitle":"[86]Partition List","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"","submitted":170950,"title":"Partition List","titleSlug":"partition-list"},{"acceptance":0.49119625840982417,"acs":39279,"articleLive":2,"columnArticles":291,"formTitle":"[87]Scramble String","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"","submitted":79966,"title":"Scramble String","titleSlug":"scramble-string"},{"acceptance":0.5105509460723543,"acs":385879,"articleLive":2,"columnArticles":2751,"formTitle":"[88]Merge Sorted Array","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"","submitted":755809,"title":"Merge Sorted Array","titleSlug":"merge-sorted-array"},{"acceptance":0.7075260956094391,"acs":52260,"articleLive":2,"columnArticles":416,"formTitle":"[89]Gray Code","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","submitted":73863,"title":"Gray Code","titleSlug":"gray-code"},{"acceptance":0.6341558866259589,"acs":118291,"articleLive":2,"columnArticles":1080,"formTitle":"[90]Subsets II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","submitted":186533,"title":"Subsets II","titleSlug":"subsets-ii"},{"acceptance":0.298282903266058,"acs":141038,"articleLive":2,"columnArticles":1359,"formTitle":"[91]Decode Ways","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"","submitted":472833,"title":"Decode Ways","titleSlug":"decode-ways"},{"acceptance":0.5433238440910356,"acs":177687,"articleLive":2,"columnArticles":1815,"formTitle":"[92]Reverse Linked List II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"","submitted":327037,"title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5317098743088233,"acs":127797,"articleLive":2,"columnArticles":1153,"formTitle":"[93]Restore IP Addresses","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","submitted":240351,"title":"Restore IP Addresses","titleSlug":"restore-ip-addresses"},{"acceptance":0.7547672842295526,"acs":467684,"articleLive":2,"columnArticles":1962,"formTitle":"[94]Binary Tree Inorder Traversal","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"","submitted":619640,"title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6926574486441113,"acs":89118,"articleLive":2,"columnArticles":550,"formTitle":"[95]Unique Binary Search Trees II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":128661,"title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6972310322102315,"acs":135419,"articleLive":2,"columnArticles":1108,"formTitle":"[96]Unique Binary Search Trees","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":194224,"title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4577057901319382,"acs":51967,"articleLive":2,"columnArticles":481,"formTitle":"[97]Interleaving String","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":113538,"title":"Interleaving String","titleSlug":"interleaving-string"},{"acceptance":0.34480236495212335,"acs":293693,"articleLive":2,"columnArticles":1675,"formTitle":"[98]Validate Binary Search Tree","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","submitted":851772,"title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6183647436424986,"acs":60110,"articleLive":2,"columnArticles":493,"formTitle":"[99]Recover Binary Search Tree","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":97208,"title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6046757239464968,"acs":218710,"articleLive":2,"columnArticles":1666,"formTitle":"[100]Same Tree","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":361698,"title":"Same Tree","titleSlug":"same-tree"},{"acceptance":0.5542091018650636,"acs":349957,"articleLive":2,"columnArticles":1987,"formTitle":"[101]Symmetric Tree","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":631453,"title":"Symmetric Tree","titleSlug":"symmetric-tree"},{"acceptance":0.6416259483645321,"acs":334982,"articleLive":2,"columnArticles":2171,"formTitle":"[102]Binary Tree Level Order Traversal","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","submitted":522083,"title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5712838393222387,"acs":149429,"articleLive":2,"columnArticles":1422,"formTitle":"[103]Binary Tree Zigzag Level Order Traversal","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"","submitted":261567,"title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7630994341064988,"acs":446214,"articleLive":2,"columnArticles":2242,"formTitle":"[104]Maximum Depth of Binary Tree","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":584739,"title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.6997936486311361,"acs":210598,"articleLive":2,"columnArticles":1240,"formTitle":"[105]Construct Binary Tree from Preorder and Inorder Traversal","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":300943,"title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7196013953662836,"acs":115106,"articleLive":2,"columnArticles":764,"formTitle":"[106]Construct Binary Tree from Inorder and Postorder Traversal","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":159958,"title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.691651562996319,"acs":148066,"articleLive":2,"columnArticles":1199,"formTitle":"[107]Binary Tree Level Order Traversal II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":214076,"title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7554012449115469,"acs":169052,"articleLive":2,"columnArticles":1070,"formTitle":"[108]Convert Sorted Array to Binary Search Tree","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","submitted":223791,"title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7640365687190172,"acs":85077,"articleLive":2,"columnArticles":650,"formTitle":"[109]Convert Sorted List to Binary Search Tree","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"","submitted":111352,"title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5594097786670001,"acs":223680,"articleLive":2,"columnArticles":1291,"formTitle":"[110]Balanced Binary Tree","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","submitted":399850,"title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree"},{"acceptance":0.48063063431553804,"acs":235013,"articleLive":2,"columnArticles":1567,"formTitle":"[111]Minimum Depth of Binary Tree","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":488968,"title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5237415075536387,"acs":224407,"articleLive":2,"columnArticles":1434,"formTitle":"[112]Path Sum","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":428469,"title":"Path Sum","titleSlug":"path-sum"},{"acceptance":0.6241377154408854,"acs":149740,"articleLive":2,"columnArticles":1081,"formTitle":"[113]Path Sum II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":239915,"title":"Path Sum II","titleSlug":"path-sum-ii"},{"acceptance":0.724228368828772,"acs":149115,"articleLive":2,"columnArticles":1128,"formTitle":"[114]Flatten Binary Tree to Linked List","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":205895,"title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5330416967705539,"acs":53858,"articleLive":2,"columnArticles":612,"formTitle":"[115]Distinct Subsequences","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":101039,"title":"Distinct Subsequences","titleSlug":"distinct-subsequences"},{"acceptance":0.6978958769745053,"acs":126934,"articleLive":2,"columnArticles":930,"formTitle":"[116]Populating Next Right Pointers in Each Node","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","submitted":181881,"title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6021483032560221,"acs":75342,"articleLive":2,"columnArticles":640,"formTitle":"[117]Populating Next Right Pointers in Each Node II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"","submitted":125122,"title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7145506901002879,"acs":179906,"articleLive":2,"columnArticles":1460,"formTitle":"[118]Pascal's Triangle","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","submitted":251775,"title":"Pascal's Triangle","titleSlug":"pascals-triangle"},{"acceptance":0.655200008651361,"acs":121174,"articleLive":2,"columnArticles":1036,"formTitle":"[119]Pascal's Triangle II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"","submitted":184942,"title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6756708400064586,"acs":154832,"articleLive":2,"columnArticles":1362,"formTitle":"[120]Triangle","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","submitted":229153,"title":"Triangle","titleSlug":"triangle"},{"acceptance":0.5696578456203452,"acs":477048,"articleLive":2,"columnArticles":2919,"formTitle":"[121]Best Time to Buy and Sell Stock","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"","submitted":837429,"title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6802424046319181,"acs":395229,"articleLive":2,"columnArticles":2312,"formTitle":"[122]Best Time to Buy and Sell Stock II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","submitted":581012,"title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5261944062356717,"acs":114763,"articleLive":2,"columnArticles":730,"formTitle":"[123]Best Time to Buy and Sell Stock III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":218100,"title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4391260801714299,"acs":131971,"articleLive":2,"columnArticles":941,"formTitle":"[124]Binary Tree Maximum Path Sum","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","submitted":300531,"title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47315927582583533,"acs":247212,"articleLive":2,"columnArticles":1669,"formTitle":"[125]Valid Palindrome","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":522471,"title":"Valid Palindrome","titleSlug":"valid-palindrome"},{"acceptance":0.389481733810699,"acs":33615,"articleLive":2,"columnArticles":300,"formTitle":"[126]Word Ladder II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":86307,"title":"Word Ladder II","titleSlug":"word-ladder-ii"},{"acceptance":0.4649012431193977,"acs":113428,"articleLive":2,"columnArticles":600,"formTitle":"[127]Word Ladder","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":243983,"title":"Word Ladder","titleSlug":"word-ladder"},{"acceptance":0.5391414091304157,"acs":135848,"articleLive":2,"columnArticles":924,"formTitle":"[128]Longest Consecutive Sequence","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":251971,"title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6752415593982886,"acs":102659,"articleLive":2,"columnArticles":991,"formTitle":"[129]Sum Root to Leaf Numbers","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":152033,"title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4365205261060183,"acs":109523,"articleLive":2,"columnArticles":1001,"formTitle":"[130]Surrounded Regions","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","submitted":250900,"title":"Surrounded Regions","titleSlug":"surrounded-regions"},{"acceptance":0.7244926728107712,"acs":115637,"articleLive":2,"columnArticles":751,"formTitle":"[131]Palindrome Partitioning","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":159611,"title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"},{"acceptance":0.49246101636668244,"acs":45856,"articleLive":2,"columnArticles":415,"formTitle":"[132]Palindrome Partitioning II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":93116,"title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6735932517230737,"acs":65480,"articleLive":2,"columnArticles":474,"formTitle":"[133]Clone Graph","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","submitted":97210,"title":"Clone Graph","titleSlug":"clone-graph"},{"acceptance":0.5729107499257422,"acs":109941,"articleLive":2,"columnArticles":857,"formTitle":"[134]Gas Station","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","submitted":191899,"title":"Gas Station","titleSlug":"gas-station"},{"acceptance":0.4826068321614327,"acs":83324,"articleLive":2,"columnArticles":674,"formTitle":"[135]Candy","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":172654,"title":"Candy","titleSlug":"candy"},{"acceptance":0.7162868447279915,"acs":429785,"articleLive":2,"columnArticles":1944,"formTitle":"[136]Single Number","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","submitted":600018,"title":"Single Number","titleSlug":"single-number"},{"acceptance":0.7190316020025032,"acs":91921,"articleLive":2,"columnArticles":701,"formTitle":"[137]Single Number II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","submitted":127840,"title":"Single Number II","titleSlug":"single-number-ii"},{"acceptance":0.6205778348635491,"acs":78271,"articleLive":2,"columnArticles":565,"formTitle":"[138]Copy List with Random Pointer","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"","submitted":126126,"title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.505712922062738,"acs":157877,"articleLive":2,"columnArticles":1018,"formTitle":"[139]Word Break","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","submitted":312187,"title":"Word Break","titleSlug":"word-break"},{"acceptance":0.47004789582903056,"acs":47794,"articleLive":2,"columnArticles":456,"formTitle":"[140]Word Break II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":101679,"title":"Word Break II","titleSlug":"word-break-ii"},{"acceptance":0.511033805409415,"acs":446433,"articleLive":2,"columnArticles":2356,"formTitle":"[141]Linked List Cycle","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"","submitted":873588,"title":"Linked List Cycle","titleSlug":"linked-list-cycle"},{"acceptance":0.5483776854389533,"acs":248108,"articleLive":2,"columnArticles":1484,"formTitle":"[142]Linked List Cycle II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"","submitted":452440,"title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6084529972592471,"acs":103897,"articleLive":2,"columnArticles":937,"formTitle":"[143]Reorder List","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"","submitted":170756,"title":"Reorder List","titleSlug":"reorder-list"},{"acceptance":0.6993175561664037,"acs":345230,"articleLive":2,"columnArticles":1578,"formTitle":"[144]Binary Tree Preorder Traversal","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"","submitted":493667,"title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7465786113994584,"acs":250286,"articleLive":2,"columnArticles":1333,"formTitle":"[145]Binary Tree Postorder Traversal","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"","submitted":335244,"title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5252852805841473,"acs":187904,"articleLive":2,"columnArticles":1204,"formTitle":"[146]LRU Cache","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":357718,"title":"LRU Cache","titleSlug":"lru-cache"},{"acceptance":0.6775266992270008,"acs":91418,"articleLive":2,"columnArticles":726,"formTitle":"[147]Insertion Sort List","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"","submitted":134929,"title":"Insertion Sort List","titleSlug":"insertion-sort-list"},{"acceptance":0.6680114081364248,"acs":180820,"articleLive":2,"columnArticles":1081,"formTitle":"[148]Sort List","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"","submitted":270684,"title":"Sort List","titleSlug":"sort-list"},{"acceptance":0.3278561915344666,"acs":41602,"articleLive":2,"columnArticles":464,"formTitle":"[149]Max Points on a Line","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","submitted":126891,"title":"Max Points on a Line","titleSlug":"max-points-on-a-line"},{"acceptance":0.5379442886859004,"acs":118961,"articleLive":2,"columnArticles":950,"formTitle":"[150]Evaluate Reverse Polish Notation","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"","submitted":221140,"title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.47403817240632307,"acs":146611,"articleLive":2,"columnArticles":1266,"formTitle":"[151]Reverse Words in a String","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":309281,"title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.41670335439801587,"acs":152388,"articleLive":2,"columnArticles":1025,"formTitle":"[152]Maximum Product Subarray","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":365699,"title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray"},{"acceptance":0.562228016264705,"acs":181133,"articleLive":2,"columnArticles":1290,"formTitle":"[153]Find Minimum in Rotated Sorted Array","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"","submitted":322170,"title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5315195683769174,"acs":101668,"articleLive":2,"columnArticles":807,"formTitle":"[154]Find Minimum in Rotated Sorted Array II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"","submitted":191278,"title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5697382695197303,"acs":253664,"articleLive":2,"columnArticles":1423,"formTitle":"[155]Min Stack","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"","submitted":445229,"title":"Min Stack","titleSlug":"min-stack"},{"acceptance":0.7282023681377826,"acs":5412,"articleLive":2,"columnArticles":96,"formTitle":"[156]Binary Tree Upside Down","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":7432,"title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5271282110355949,"acs":4576,"articleLive":2,"columnArticles":69,"formTitle":"[157]Read N Characters Given Read4","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":8681,"title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5723504591710101,"acs":2306,"articleLive":2,"columnArticles":56,"formTitle":"[158]Read N Characters Given Read4 II - Call multiple times","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4029,"title":"Read N Characters Given Read4 II - Call multiple times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5330107300652219,"acs":12667,"articleLive":2,"columnArticles":161,"formTitle":"[159]Longest Substring with At Most Two Distinct Characters","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":23765,"title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6058778196045884,"acs":286167,"articleLive":2,"columnArticles":1705,"formTitle":"[160]Intersection of Two Linked Lists","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"","submitted":472318,"title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33438775510204083,"acs":6554,"articleLive":2,"columnArticles":89,"formTitle":"[161]One Edit Distance","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":19600,"title":"One Edit Distance","titleSlug":"one-edit-distance"},{"acceptance":0.4907985891817837,"acs":101025,"articleLive":2,"columnArticles":583,"formTitle":"[162]Find Peak Element","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","submitted":205838,"title":"Find Peak Element","titleSlug":"find-peak-element"},{"acceptance":0.31311753276282606,"acs":7574,"articleLive":2,"columnArticles":114,"formTitle":"[163]Missing Ranges","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":24189,"title":"Missing Ranges","titleSlug":"missing-ranges"},{"acceptance":0.6110601757642166,"acs":54652,"articleLive":2,"columnArticles":461,"formTitle":"[164]Maximum Gap","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":89438,"title":"Maximum Gap","titleSlug":"maximum-gap"},{"acceptance":0.47522968644639246,"acs":45105,"articleLive":2,"columnArticles":460,"formTitle":"[165]Compare Version Numbers","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":94912,"title":"Compare Version Numbers","titleSlug":"compare-version-numbers"},{"acceptance":0.29558072949085024,"acs":23744,"articleLive":2,"columnArticles":186,"formTitle":"[166]Fraction to Recurring Decimal","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":80330,"title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5807958299573814,"acs":231536,"articleLive":2,"columnArticles":1497,"formTitle":"[167]Two Sum II - Input array is sorted","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"","submitted":398653,"title":"Two Sum II - Input array is sorted","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4302839224047496,"acs":75881,"articleLive":2,"columnArticles":692,"formTitle":"[168]Excel Sheet Column Title","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","submitted":176351,"title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6620353423730557,"acs":334592,"articleLive":2,"columnArticles":1915,"formTitle":"[169]Majority Element","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":505399,"title":"Majority Element","titleSlug":"majority-element"},{"acceptance":0.41589380941340137,"acs":7175,"articleLive":2,"columnArticles":68,"formTitle":"[170]Two Sum III - Data structure design","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":17252,"title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.6952161351261251,"acs":75075,"articleLive":2,"columnArticles":581,"formTitle":"[171]Excel Sheet Column Number","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","submitted":107988,"title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43279004224795925,"acs":80006,"articleLive":2,"columnArticles":512,"formTitle":"[172]Factorial Trailing Zeroes","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":184861,"title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8020388864543211,"acs":69548,"articleLive":2,"columnArticles":582,"formTitle":"[173]Binary Search Tree Iterator","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"","submitted":86714,"title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4817808642843085,"acs":34271,"articleLive":2,"columnArticles":377,"formTitle":"[174]Dungeon Game","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":71134,"title":"Dungeon Game","titleSlug":"dungeon-game"},{"acceptance":0.7388438507725956,"acs":270589,"articleLive":2,"columnArticles":1345,"formTitle":"[175]Combine Two Tables","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":366233,"title":"Combine Two Tables","titleSlug":"combine-two-tables"},{"acceptance":0.3556096985767007,"acs":223165,"articleLive":2,"columnArticles":910,"formTitle":"[176]Second Highest Salary","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","submitted":627556,"title":"Second Highest Salary","titleSlug":"second-highest-salary"},{"acceptance":0.4607291330903441,"acs":111490,"articleLive":2,"columnArticles":431,"formTitle":"[177]Nth Highest Salary","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":241986,"title":"Nth Highest Salary","titleSlug":"nth-highest-salary"},{"acceptance":0.5990501216097334,"acs":104185,"articleLive":2,"columnArticles":612,"formTitle":"[178]Rank Scores","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":173917,"title":"Rank Scores","titleSlug":"rank-scores"},{"acceptance":0.408610742591481,"acs":106875,"articleLive":2,"columnArticles":886,"formTitle":"[179]Largest Number","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"","submitted":261557,"title":"Largest Number","titleSlug":"largest-number"},{"acceptance":0.4881659655094897,"acs":76005,"articleLive":2,"columnArticles":444,"formTitle":"[180]Consecutive Numbers","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":155695,"title":"Consecutive Numbers","titleSlug":"consecutive-numbers"},{"acceptance":0.7031881959965375,"acs":143783,"articleLive":2,"columnArticles":595,"formTitle":"[181]Employees Earning More Than Their Managers","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":204473,"title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7968206091772152,"acs":161149,"articleLive":2,"columnArticles":508,"formTitle":"[182]Duplicate Emails","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":202240,"title":"Duplicate Emails","titleSlug":"duplicate-emails"},{"acceptance":0.6776402396089517,"acs":132808,"articleLive":2,"columnArticles":478,"formTitle":"[183]Customers Who Never Order","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":195986,"title":"Customers Who Never Order","titleSlug":"customers-who-never-order"},{"acceptance":0.472626259953967,"acs":89324,"articleLive":2,"columnArticles":593,"formTitle":"[184]Department Highest Salary","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":188995,"title":"Department Highest Salary","titleSlug":"department-highest-salary"},{"acceptance":0.48529353922640633,"acs":61691,"articleLive":2,"columnArticles":552,"formTitle":"[185]Department Top Three Salaries","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":127121,"title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries"},{"acceptance":0.748509728939377,"acs":6655,"articleLive":2,"columnArticles":97,"formTitle":"[186]Reverse Words in a String II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":8891,"title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.47647403491081525,"acs":34967,"articleLive":2,"columnArticles":228,"formTitle":"[187]Repeated DNA Sequences","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":73387,"title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38114845480356163,"acs":76923,"articleLive":2,"columnArticles":607,"formTitle":"[188]Best Time to Buy and Sell Stock IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":201819,"title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4545692619684007,"acs":277725,"articleLive":2,"columnArticles":1352,"formTitle":"[189]Rotate Array","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","submitted":610963,"title":"Rotate Array","titleSlug":"rotate-array"},{"acceptance":0.6903572687742391,"acs":117485,"articleLive":2,"columnArticles":731,"formTitle":"[190]Reverse Bits","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","submitted":170180,"title":"Reverse Bits","titleSlug":"reverse-bits"},{"acceptance":0.7427243260199013,"acs":170479,"articleLive":2,"columnArticles":1065,"formTitle":"[191]Number of 1 Bits","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","submitted":229532,"title":"Number of 1 Bits","titleSlug":"number-of-1-bits"},{"acceptance":0.35362754572461436,"acs":19760,"articleLive":2,"columnArticles":159,"formTitle":"[192]Word Frequency","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":55878,"title":"Word Frequency","titleSlug":"word-frequency"},{"acceptance":0.32085496758225496,"acs":23853,"articleLive":2,"columnArticles":128,"formTitle":"[193]Valid Phone Numbers","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":74342,"title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers"},{"acceptance":0.3439839869523315,"acs":9280,"articleLive":2,"columnArticles":63,"formTitle":"[194]Transpose File","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":26978,"title":"Transpose File","titleSlug":"transpose-file"},{"acceptance":0.4345492416150395,"acs":32546,"articleLive":2,"columnArticles":130,"formTitle":"[195]Tenth Line","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":74896,"title":"Tenth Line","titleSlug":"tenth-line"},{"acceptance":0.6623307671887444,"acs":89820,"articleLive":2,"columnArticles":330,"formTitle":"[196]Delete Duplicate Emails","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":135612,"title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5326636376997744,"acs":83356,"articleLive":2,"columnArticles":452,"formTitle":"[197]Rising Temperature","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":156489,"title":"Rising Temperature","titleSlug":"rising-temperature"},{"acceptance":0.5012830264117586,"acs":320963,"articleLive":2,"columnArticles":2267,"formTitle":"[198]House Robber","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","submitted":640283,"title":"House Robber","titleSlug":"house-robber"},{"acceptance":0.6490642939470036,"acs":116570,"articleLive":2,"columnArticles":1397,"formTitle":"[199]Binary Tree Right Side View","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","submitted":179597,"title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5432652702129872,"acs":271700,"articleLive":2,"columnArticles":1834,"formTitle":"[200]Number of Islands","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","submitted":500124,"title":"Number of Islands","titleSlug":"number-of-islands"},{"acceptance":0.5189524071274793,"acs":45317,"articleLive":2,"columnArticles":291,"formTitle":"[201]Bitwise AND of Numbers Range","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","submitted":87324,"title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.615211456091728,"acs":148947,"articleLive":2,"columnArticles":1216,"formTitle":"[202]Happy Number","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"","submitted":242107,"title":"Happy Number","titleSlug":"happy-number"},{"acceptance":0.5064893351868173,"acs":197114,"articleLive":2,"columnArticles":1425,"formTitle":"[203]Remove Linked List Elements","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"","submitted":389177,"title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3809908848514913,"acs":153606,"articleLive":2,"columnArticles":665,"formTitle":"[204]Count Primes","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","submitted":403175,"title":"Count Primes","titleSlug":"count-primes"},{"acceptance":0.5005446993940219,"acs":102921,"articleLive":2,"columnArticles":789,"formTitle":"[205]Isomorphic Strings","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","submitted":205618,"title":"Isomorphic Strings","titleSlug":"isomorphic-strings"},{"acceptance":0.7185453855703396,"acs":590954,"articleLive":2,"columnArticles":6874,"formTitle":"[206]Reverse Linked List","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"","submitted":822431,"title":"Reverse Linked List","titleSlug":"reverse-linked-list"},{"acceptance":0.5454900642394396,"acs":120070,"articleLive":2,"columnArticles":799,"formTitle":"[207]Course Schedule","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":220114,"title":"Course Schedule","titleSlug":"course-schedule"},{"acceptance":0.7161085518711271,"acs":127004,"articleLive":2,"columnArticles":860,"formTitle":"[208]Implement Trie (Prefix Tree)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"","submitted":177353,"title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.46273657411855124,"acs":154132,"articleLive":2,"columnArticles":1112,"formTitle":"[209]Minimum Size Subarray Sum","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"","submitted":333088,"title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5367220034561886,"acs":75783,"articleLive":2,"columnArticles":585,"formTitle":"[210]Course Schedule II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":141196,"title":"Course Schedule II","titleSlug":"course-schedule-ii"},{"acceptance":0.48160604238689314,"acs":25633,"articleLive":2,"columnArticles":276,"formTitle":"[211]Design Add and Search Words Data Structure","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":53224,"title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45358324947563683,"acs":37412,"articleLive":2,"columnArticles":353,"formTitle":"[212]Word Search II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":82481,"title":"Word Search II","titleSlug":"word-search-ii"},{"acceptance":0.4280649792119666,"acs":132097,"articleLive":2,"columnArticles":1251,"formTitle":"[213]House Robber II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"","submitted":308591,"title":"House Robber II","titleSlug":"house-robber-ii"},{"acceptance":0.36959582256124096,"acs":28878,"articleLive":2,"columnArticles":286,"formTitle":"[214]Shortest Palindrome","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":78134,"title":"Shortest Palindrome","titleSlug":"shortest-palindrome"},{"acceptance":0.6465365036636126,"acs":363627,"articleLive":2,"columnArticles":1958,"formTitle":"[215]Kth Largest Element in an Array","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","submitted":562423,"title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.739884699255754,"acs":83806,"articleLive":2,"columnArticles":907,"formTitle":"[216]Combination Sum III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":113269,"title":"Combination Sum III","titleSlug":"combination-sum-iii"},{"acceptance":0.5608312320734764,"acs":291146,"articleLive":2,"columnArticles":1266,"formTitle":"[217]Contains Duplicate","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","submitted":519133,"title":"Contains Duplicate","titleSlug":"contains-duplicate"},{"acceptance":0.47218539228685075,"acs":16382,"articleLive":2,"columnArticles":157,"formTitle":"[218]The Skyline Problem","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","submitted":34694,"title":"The Skyline Problem","titleSlug":"the-skyline-problem"},{"acceptance":0.4230112577673395,"acs":97620,"articleLive":2,"columnArticles":785,"formTitle":"[219]Contains Duplicate II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":230774,"title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28702195738810543,"acs":59921,"articleLive":2,"columnArticles":393,"formTitle":"[220]Contains Duplicate III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"","submitted":208768,"title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.46364434862458576,"acs":116129,"articleLive":2,"columnArticles":856,"formTitle":"[221]Maximal Square","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":250470,"title":"Maximal Square","titleSlug":"maximal-square"},{"acceptance":0.7763336521551325,"acs":100647,"articleLive":2,"columnArticles":783,"formTitle":"[222]Count Complete Tree Nodes","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":129644,"title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4517820484281863,"acs":18266,"articleLive":2,"columnArticles":223,"formTitle":"[223]Rectangle Area","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":40431,"title":"Rectangle Area","titleSlug":"rectangle-area"},{"acceptance":0.416285270824213,"acs":62760,"articleLive":2,"columnArticles":608,"formTitle":"[224]Basic Calculator","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","submitted":150762,"title":"Basic Calculator","titleSlug":"basic-calculator"},{"acceptance":0.6736591794636718,"acs":117567,"articleLive":2,"columnArticles":4645,"formTitle":"[225]Implement Stack using Queues","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"","submitted":174520,"title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7854289945373323,"acs":255643,"articleLive":2,"columnArticles":1625,"formTitle":"[226]Invert Binary Tree","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","submitted":325482,"title":"Invert Binary Tree","titleSlug":"invert-binary-tree"},{"acceptance":0.43509736408090044,"acs":75187,"articleLive":2,"columnArticles":649,"formTitle":"[227]Basic Calculator II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","submitted":172805,"title":"Basic Calculator II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5823077438520471,"acs":52141,"articleLive":2,"columnArticles":588,"formTitle":"[228]Summary Ranges","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":89542,"title":"Summary Ranges","titleSlug":"summary-ranges"},{"acceptance":0.45998708103064667,"acs":32045,"articleLive":2,"columnArticles":265,"formTitle":"[229]Majority Element II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":69665,"title":"Majority Element II","titleSlug":"majority-element-ii"},{"acceptance":0.736394972755538,"acs":117712,"articleLive":2,"columnArticles":719,"formTitle":"[230]Kth Smallest Element in a BST","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"","submitted":159849,"title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5014653714928493,"acs":148006,"articleLive":2,"columnArticles":1064,"formTitle":"[231]Power of Two","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","submitted":295147,"title":"Power of Two","titleSlug":"power-of-two"},{"acceptance":0.6885685620098692,"acs":134516,"articleLive":2,"columnArticles":1115,"formTitle":"[232]Implement Queue using Stacks","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"","submitted":195356,"title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4056348335162825,"acs":16629,"articleLive":2,"columnArticles":218,"formTitle":"[233]Number of Digit One","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","submitted":40995,"title":"Number of Digit One","titleSlug":"number-of-digit-one"},{"acceptance":0.4841154515147123,"acs":267193,"articleLive":2,"columnArticles":1733,"formTitle":"[234]Palindrome Linked List","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"","submitted":551920,"title":"Palindrome Linked List","titleSlug":"palindrome-linked-list"},{"acceptance":0.664734208964283,"acs":148945,"articleLive":2,"columnArticles":862,"formTitle":"[235]Lowest Common Ancestor of a Binary Search Tree","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":224067,"title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6746579641019205,"acs":215000,"articleLive":2,"columnArticles":1186,"formTitle":"[236]Lowest Common Ancestor of a Binary Tree","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":318680,"title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8463613175113675,"acs":190791,"articleLive":2,"columnArticles":942,"formTitle":"[237]Delete Node in a Linked List","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"","submitted":225425,"title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7199199737227149,"acs":120547,"articleLive":2,"columnArticles":768,"formTitle":"[238]Product of Array Except Self","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":167445,"title":"Product of Array Except Self","titleSlug":"product-of-array-except-self"},{"acceptance":0.49529662004133046,"acs":163699,"articleLive":2,"columnArticles":1165,"formTitle":"[239]Sliding Window Maximum","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","submitted":330507,"title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum"},{"acceptance":0.4652750084863905,"acs":141177,"articleLive":2,"columnArticles":627,"formTitle":"[240]Search a 2D Matrix II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":303427,"title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.736501373663738,"acs":27076,"articleLive":2,"columnArticles":240,"formTitle":"[241]Different Ways to Add Parentheses","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":36763,"title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6404377585942688,"acs":250757,"articleLive":2,"columnArticles":1423,"formTitle":"[242]Valid Anagram","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","submitted":391540,"title":"Valid Anagram","titleSlug":"valid-anagram"},{"acceptance":0.65646492434663,"acs":7636,"articleLive":2,"columnArticles":82,"formTitle":"[243]Shortest Word Distance","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":11632,"title":"Shortest Word Distance","titleSlug":"shortest-word-distance"},{"acceptance":0.5414078674948241,"acs":4184,"articleLive":2,"columnArticles":49,"formTitle":"[244]Shortest Word Distance II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":7728,"title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6199087375359135,"acs":3668,"articleLive":2,"columnArticles":47,"formTitle":"[245]Shortest Word Distance III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":5917,"title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4738675958188153,"acs":4896,"articleLive":2,"columnArticles":85,"formTitle":"[246]Strobogrammatic Number","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":10332,"title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"},{"acceptance":0.5182167911292147,"acs":4580,"articleLive":2,"columnArticles":82,"formTitle":"[247]Strobogrammatic Number II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":8838,"title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46442021803766104,"acs":2343,"articleLive":2,"columnArticles":42,"formTitle":"[248]Strobogrammatic Number III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5045,"title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6322149376526546,"acs":4918,"articleLive":2,"columnArticles":83,"formTitle":"[249]Group Shifted Strings","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":7779,"title":"Group Shifted Strings","titleSlug":"group-shifted-strings"},{"acceptance":0.6314087012776969,"acs":3904,"articleLive":2,"columnArticles":64,"formTitle":"[250]Count Univalue Subtrees","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":6183,"title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5362968273884209,"acs":2992,"articleLive":2,"columnArticles":59,"formTitle":"[251]Flatten 2D Vector","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":5579,"title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector"},{"acceptance":0.5568560927339553,"acs":9848,"articleLive":2,"columnArticles":133,"formTitle":"[252]Meeting Rooms","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":17685,"title":"Meeting Rooms","titleSlug":"meeting-rooms"},{"acceptance":0.49149070867314637,"acs":26396,"articleLive":2,"columnArticles":287,"formTitle":"[253]Meeting Rooms II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":53706,"title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5683385156144383,"acs":4204,"articleLive":2,"columnArticles":62,"formTitle":"[254]Factor Combinations","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":7397,"title":"Factor Combinations","titleSlug":"factor-combinations"},{"acceptance":0.47085714285714286,"acs":4532,"articleLive":2,"columnArticles":48,"formTitle":"[255]Verify Preorder Sequence in Binary Search Tree","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":9625,"title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6166546076432283,"acs":9375,"articleLive":2,"columnArticles":146,"formTitle":"[256]Paint House","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":15203,"title":"Paint House","titleSlug":"paint-house"},{"acceptance":0.6766450590449358,"acs":122964,"articleLive":2,"columnArticles":916,"formTitle":"[257]Binary Tree Paths","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","submitted":181726,"title":"Binary Tree Paths","titleSlug":"binary-tree-paths"},{"acceptance":0.6901108554296245,"acs":72276,"articleLive":2,"columnArticles":587,"formTitle":"[258]Add Digits","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":104731,"title":"Add Digits","titleSlug":"add-digits"},{"acceptance":0.5721285216244228,"acs":6072,"articleLive":2,"columnArticles":74,"formTitle":"[259]3Sum Smaller","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":10613,"title":"3Sum Smaller","titleSlug":"3sum-smaller"},{"acceptance":0.7263373512959899,"acs":46097,"articleLive":2,"columnArticles":394,"formTitle":"[260]Single Number III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","submitted":63465,"title":"Single Number III","titleSlug":"single-number-iii"},{"acceptance":0.4986778009742519,"acs":7166,"articleLive":2,"columnArticles":101,"formTitle":"[261]Graph Valid Tree","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":14370,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"},{"acceptance":0.4439559296018315,"acs":34130,"articleLive":2,"columnArticles":328,"formTitle":"[262]Trips and Users","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":76877,"title":"Trips and Users","titleSlug":"trips-and-users"},{"acceptance":0.5148136532329727,"acs":98489,"articleLive":2,"columnArticles":776,"formTitle":"[263]Ugly Number","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"","submitted":191310,"title":"Ugly Number","titleSlug":"ugly-number"},{"acceptance":0.5723420310576274,"acs":86466,"articleLive":2,"columnArticles":537,"formTitle":"[264]Ugly Number II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":151074,"title":"Ugly Number II","titleSlug":"ugly-number-ii"},{"acceptance":0.5636180679785331,"acs":5041,"articleLive":2,"columnArticles":102,"formTitle":"[265]Paint House II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":8944,"title":"Paint House II","titleSlug":"paint-house-ii"},{"acceptance":0.6681140711184134,"acs":5693,"articleLive":2,"columnArticles":84,"formTitle":"[266]Palindrome Permutation","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":8521,"title":"Palindrome Permutation","titleSlug":"palindrome-permutation"},{"acceptance":0.4352604637157483,"acs":2891,"articleLive":2,"columnArticles":67,"formTitle":"[267]Palindrome Permutation II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":6642,"title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.616786027242656,"acs":134439,"articleLive":2,"columnArticles":939,"formTitle":"[268]Missing Number","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","submitted":217967,"title":"Missing Number","titleSlug":"missing-number"},{"acceptance":0.340162158816612,"acs":5496,"articleLive":2,"columnArticles":86,"formTitle":"[269]Alien Dictionary","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":16157,"title":"Alien Dictionary","titleSlug":"alien-dictionary"},{"acceptance":0.5438689568273758,"acs":8201,"articleLive":2,"columnArticles":118,"formTitle":"[270]Closest Binary Search Tree Value","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":15079,"title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5411377527033381,"acs":2302,"articleLive":2,"columnArticles":39,"formTitle":"[271]Encode and Decode Strings","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4254,"title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6398873971416198,"acs":2955,"articleLive":2,"columnArticles":63,"formTitle":"[272]Closest Binary Search Tree Value II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":4618,"title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3064672751990678,"acs":11046,"articleLive":2,"columnArticles":143,"formTitle":"[273]Integer to English Words","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":36043,"title":"Integer to English Words","titleSlug":"integer-to-english-words"},{"acceptance":0.39671286784918547,"acs":27420,"articleLive":2,"columnArticles":268,"formTitle":"[274]H-Index","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","submitted":69118,"title":"H-Index","titleSlug":"h-index"},{"acceptance":0.41270139685285107,"acs":21952,"articleLive":2,"columnArticles":164,"formTitle":"[275]H-Index II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","submitted":53191,"title":"H-Index II","titleSlug":"h-index-ii"},{"acceptance":0.4755744939887384,"acs":6250,"articleLive":2,"columnArticles":113,"formTitle":"[276]Paint Fence","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":13142,"title":"Paint Fence","titleSlug":"paint-fence"},{"acceptance":0.569703523474813,"acs":6322,"articleLive":2,"columnArticles":73,"formTitle":"[277]Find the Celebrity","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":11097,"title":"Find the Celebrity","titleSlug":"find-the-celebrity"},{"acceptance":0.4522212439563063,"acs":121217,"articleLive":2,"columnArticles":698,"formTitle":"[278]First Bad Version","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","submitted":268048,"title":"First Bad Version","titleSlug":"first-bad-version"},{"acceptance":0.6250960827254137,"acs":172404,"articleLive":2,"columnArticles":1061,"formTitle":"[279]Perfect Squares","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","submitted":275804,"title":"Perfect Squares","titleSlug":"perfect-squares"},{"acceptance":0.6860545630799059,"acs":4954,"articleLive":2,"columnArticles":59,"formTitle":"[280]Wiggle Sort","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":7221,"title":"Wiggle Sort","titleSlug":"wiggle-sort"},{"acceptance":0.7521603871413758,"acs":2176,"articleLive":2,"columnArticles":51,"formTitle":"[281]Zigzag Iterator","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":2893,"title":"Zigzag Iterator","titleSlug":"zigzag-iterator"},{"acceptance":0.38538906287641533,"acs":6399,"articleLive":2,"columnArticles":60,"formTitle":"[282]Expression Add Operators","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":16604,"title":"Expression Add Operators","titleSlug":"expression-add-operators"},{"acceptance":0.6381525305118805,"acs":397592,"articleLive":2,"columnArticles":2777,"formTitle":"[283]Move Zeroes","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","submitted":623036,"title":"Move Zeroes","titleSlug":"move-zeroes"},{"acceptance":0.734043405141347,"acs":9166,"articleLive":2,"columnArticles":89,"formTitle":"[284]Peeking Iterator","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":12487,"title":"Peeking Iterator","titleSlug":"peeking-iterator"},{"acceptance":0.6362281028699217,"acs":6828,"articleLive":2,"columnArticles":84,"formTitle":"[285]Inorder Successor in BST","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":10732,"title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5044142446185894,"acs":10170,"articleLive":2,"columnArticles":125,"formTitle":"[286]Walls and Gates","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":20162,"title":"Walls and Gates","titleSlug":"walls-and-gates"},{"acceptance":0.6663086090306647,"acs":157556,"articleLive":2,"columnArticles":1096,"formTitle":"[287]Find the Duplicate Number","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":236461,"title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4091799608172404,"acs":2924,"articleLive":2,"columnArticles":46,"formTitle":"[288]Unique Word Abbreviation","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":7146,"title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7515342536329611,"acs":49596,"articleLive":2,"columnArticles":771,"formTitle":"[289]Game of Life","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":65993,"title":"Game of Life","titleSlug":"game-of-life"},{"acceptance":0.4574175824175824,"acs":74592,"articleLive":2,"columnArticles":984,"formTitle":"[290]Word Pattern","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":163072,"title":"Word Pattern","titleSlug":"word-pattern"},{"acceptance":0.5343696866650474,"acs":2200,"articleLive":2,"columnArticles":45,"formTitle":"[291]Word Pattern II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4117,"title":"Word Pattern II","titleSlug":"word-pattern-ii"},{"acceptance":0.6955962489462112,"acs":80036,"articleLive":2,"columnArticles":514,"formTitle":"[292]Nim Game","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":115061,"title":"Nim Game","titleSlug":"nim-game"},{"acceptance":0.7066709739945082,"acs":4375,"articleLive":2,"columnArticles":72,"formTitle":"[293]Flip Game","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6191,"title":"Flip Game","titleSlug":"flip-game"},{"acceptance":0.5874296435272045,"acs":3131,"articleLive":2,"columnArticles":44,"formTitle":"[294]Flip Game II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":5330,"title":"Flip Game II","titleSlug":"flip-game-ii"},{"acceptance":0.5219398326645159,"acs":39800,"articleLive":2,"columnArticles":323,"formTitle":"[295]Find Median from Data Stream","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","submitted":76254,"title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6113383985973115,"acs":2092,"articleLive":2,"columnArticles":40,"formTitle":"[296]Best Meeting Point","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":3422,"title":"Best Meeting Point","titleSlug":"best-meeting-point"},{"acceptance":0.5520866596251627,"acs":89904,"articleLive":2,"columnArticles":663,"formTitle":"[297]Serialize and Deserialize Binary Tree","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","submitted":162844,"title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5708356391809629,"acs":4126,"articleLive":2,"columnArticles":72,"formTitle":"[298]Binary Tree Longest Consecutive Sequence","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":7228,"title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5024122170632618,"acs":27701,"articleLive":2,"columnArticles":310,"formTitle":"[299]Bulls and Cows","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":55136,"title":"Bulls and Cows","titleSlug":"bulls-and-cows"},{"acceptance":0.5011333640627779,"acs":290281,"articleLive":2,"columnArticles":1678,"formTitle":"[300]Longest Increasing Subsequence","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","submitted":579249,"title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5154990111060399,"acs":27107,"articleLive":2,"columnArticles":200,"formTitle":"[301]Remove Invalid Parentheses","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":52584,"title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.672676282051282,"acs":1679,"articleLive":2,"columnArticles":26,"formTitle":"[302]Smallest Rectangle Enclosing Black Pixels","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":2496,"title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7201018864356296,"acs":121847,"articleLive":2,"columnArticles":743,"formTitle":"[303]Range Sum Query - Immutable","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":169208,"title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable"},{"acceptance":0.535192309528128,"acs":56063,"articleLive":2,"columnArticles":512,"formTitle":"[304]Range Sum Query 2D - Immutable","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":104753,"title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3667909674746219,"acs":3541,"articleLive":2,"columnArticles":54,"formTitle":"[305]Number of Islands II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":9654,"title":"Number of Islands II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3355439156531709,"acs":14926,"articleLive":2,"columnArticles":223,"formTitle":"[306]Additive Number","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":44483,"title":"Additive Number","titleSlug":"additive-number"},{"acceptance":0.5503699342054735,"acs":21498,"articleLive":2,"columnArticles":200,"formTitle":"[307]Range Sum Query - Mutable","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"","submitted":39061,"title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable"},{"acceptance":0.5996304280874654,"acs":1947,"articleLive":2,"columnArticles":36,"formTitle":"[308]Range Sum Query 2D - Mutable","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3247,"title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.5952693905005214,"acs":96464,"articleLive":2,"columnArticles":772,"formTitle":"[309]Best Time to Buy and Sell Stock with Cooldown","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":162051,"title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.375577302598116,"acs":18460,"articleLive":2,"columnArticles":184,"formTitle":"[310]Minimum Height Trees","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":49151,"title":"Minimum Height Trees","titleSlug":"minimum-height-trees"},{"acceptance":0.7620855479625411,"acs":3011,"articleLive":2,"columnArticles":38,"formTitle":"[311]Sparse Matrix Multiplication","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":3951,"title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6783612058532292,"acs":49325,"articleLive":2,"columnArticles":340,"formTitle":"[312]Burst Balloons","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":72712,"title":"Burst Balloons","titleSlug":"burst-balloons"},{"acceptance":0.6472136277961521,"acs":18199,"articleLive":2,"columnArticles":181,"formTitle":"[313]Super Ugly Number","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","submitted":28119,"title":"Super Ugly Number","titleSlug":"super-ugly-number"},{"acceptance":0.5480005774505557,"acs":3796,"articleLive":2,"columnArticles":75,"formTitle":"[314]Binary Tree Vertical Order Traversal","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":6927,"title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41892146737910285,"acs":46649,"articleLive":2,"columnArticles":453,"formTitle":"[315]Count of Smaller Numbers After Self","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","submitted":111355,"title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.476266768693656,"acs":59751,"articleLive":2,"columnArticles":467,"formTitle":"[316]Remove Duplicate Letters","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"","submitted":125457,"title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4801670146137787,"acs":3680,"articleLive":2,"columnArticles":58,"formTitle":"[317]Shortest Distance from All Buildings","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":7664,"title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6760792724095477,"acs":17023,"articleLive":2,"columnArticles":137,"formTitle":"[318]Maximum Product of Word Lengths","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":25179,"title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.51043948021609,"acs":20976,"articleLive":2,"columnArticles":195,"formTitle":"[319]Bulb Switcher","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","submitted":41094,"title":"Bulb Switcher","titleSlug":"bulb-switcher"},{"acceptance":0.6697732997481108,"acs":2659,"articleLive":2,"columnArticles":40,"formTitle":"[320]Generalized Abbreviation","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":3970,"title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"},{"acceptance":0.4268021485510965,"acs":24950,"articleLive":2,"columnArticles":208,"formTitle":"[321]Create Maximum Number","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":58458,"title":"Create Maximum Number","titleSlug":"create-maximum-number"},{"acceptance":0.43821780254401366,"acs":252594,"articleLive":2,"columnArticles":1592,"formTitle":"[322]Coin Change","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","submitted":576412,"title":"Coin Change","titleSlug":"coin-change"},{"acceptance":0.632761590892068,"acs":8448,"articleLive":2,"columnArticles":119,"formTitle":"[323]Number of Connected Components in an Undirected Graph","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":13351,"title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37557441384630863,"acs":22394,"articleLive":2,"columnArticles":148,"formTitle":"[324]Wiggle Sort II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":59626,"title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5328026351907769,"acs":7764,"articleLive":2,"columnArticles":91,"formTitle":"[325]Maximum Size Subarray Sum Equals k","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":14572,"title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4868280446789125,"acs":86559,"articleLive":2,"columnArticles":334,"formTitle":"[326]Power of Three","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":177802,"title":"Power of Three","titleSlug":"power-of-three"},{"acceptance":0.4262289020760542,"acs":23056,"articleLive":2,"columnArticles":197,"formTitle":"[327]Count of Range Sum","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":54093,"title":"Count of Range Sum","titleSlug":"count-of-range-sum"},{"acceptance":0.6565171244992754,"acs":115052,"articleLive":2,"columnArticles":957,"formTitle":"[328]Odd Even Linked List","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"","submitted":175246,"title":"Odd Even Linked List","titleSlug":"odd-even-linked-list"},{"acceptance":0.47658339441725933,"acs":48113,"articleLive":2,"columnArticles":419,"formTitle":"[329]Longest Increasing Path in a Matrix","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":100954,"title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5343066552850794,"acs":18152,"articleLive":2,"columnArticles":144,"formTitle":"[330]Patching Array","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":33973,"title":"Patching Array","titleSlug":"patching-array"},{"acceptance":0.4791723232871753,"acs":42355,"articleLive":2,"columnArticles":479,"formTitle":"[331]Verify Preorder Serialization of a Binary Tree","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"","submitted":88392,"title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.445592446405077,"acs":34545,"articleLive":2,"columnArticles":297,"formTitle":"[332]Reconstruct Itinerary","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":77526,"title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"},{"acceptance":0.45555167190958873,"acs":3910,"articleLive":2,"columnArticles":69,"formTitle":"[333]Largest BST Subtree","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":8583,"title":"Largest BST Subtree","titleSlug":"largest-bst-subtree"},{"acceptance":0.414445072627642,"acs":38119,"articleLive":2,"columnArticles":247,"formTitle":"[334]Increasing Triplet Subsequence","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":91976,"title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3688663282571912,"acs":2616,"articleLive":2,"columnArticles":33,"formTitle":"[335]Self Crossing","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7092,"title":"Self Crossing","titleSlug":"self-crossing"},{"acceptance":0.40221821973646793,"acs":21215,"articleLive":2,"columnArticles":183,"formTitle":"[336]Palindrome Pairs","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":52745,"title":"Palindrome Pairs","titleSlug":"palindrome-pairs"},{"acceptance":0.610405046589354,"acs":111955,"articleLive":2,"columnArticles":828,"formTitle":"[337]House Robber III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":183411,"title":"House Robber III","titleSlug":"house-robber-iii"},{"acceptance":0.7880128833496709,"acs":140680,"articleLive":2,"columnArticles":1259,"formTitle":"[338]Counting Bits","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":178525,"title":"Counting Bits","titleSlug":"counting-bits"},{"acceptance":0.8054054054054054,"acs":3427,"articleLive":2,"columnArticles":53,"formTitle":"[339]Nested List Weight Sum","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4255,"title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4935586501851562,"acs":9463,"articleLive":2,"columnArticles":146,"formTitle":"[340]Longest Substring with At Most K Distinct Characters","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":19173,"title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273931663431618,"acs":47218,"articleLive":2,"columnArticles":465,"formTitle":"[341]Flatten Nested List Iterator","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"","submitted":64914,"title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5138493530206107,"acs":81051,"articleLive":2,"columnArticles":704,"formTitle":"[342]Power of Four","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","submitted":157733,"title":"Power of Four","titleSlug":"power-of-four"},{"acceptance":0.6002823943935646,"acs":92680,"articleLive":2,"columnArticles":911,"formTitle":"[343]Integer Break","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","submitted":154394,"title":"Integer Break","titleSlug":"integer-break"},{"acceptance":0.7555596706294828,"acs":306013,"articleLive":2,"columnArticles":1591,"formTitle":"[344]Reverse String","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","submitted":405015,"title":"Reverse String","titleSlug":"reverse-string"},{"acceptance":0.518061518969522,"acs":73601,"articleLive":2,"columnArticles":687,"formTitle":"[345]Reverse Vowels of a String","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"","submitted":142070,"title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.701810575854631,"acs":10737,"articleLive":2,"columnArticles":121,"formTitle":"[346]Moving Average from Data Stream","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":15299,"title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6213986455463728,"acs":173236,"articleLive":2,"columnArticles":1310,"formTitle":"[347]Top K Frequent Elements","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":278784,"title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements"},{"acceptance":0.597478176527643,"acs":4312,"articleLive":2,"columnArticles":72,"formTitle":"[348]Design Tic-Tac-Toe","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":7217,"title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7373234321392143,"acs":190837,"articleLive":2,"columnArticles":1327,"formTitle":"[349]Intersection of Two Arrays","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"","submitted":258824,"title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5452005504333226,"acs":208796,"articleLive":2,"columnArticles":1132,"formTitle":"[350]Intersection of Two Arrays II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"","submitted":382971,"title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5844485463774803,"acs":5066,"articleLive":2,"columnArticles":91,"formTitle":"[351]Android Unlock Patterns","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":8668,"title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns"},{"acceptance":0.5903740128147817,"acs":3962,"articleLive":2,"columnArticles":73,"formTitle":"[352]Data Stream as Disjoint Intervals","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":6711,"title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4194350282485876,"acs":1856,"articleLive":2,"columnArticles":44,"formTitle":"[353]Design Snake Game","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":4425,"title":"Design Snake Game","titleSlug":"design-snake-game"},{"acceptance":0.4448219782772841,"acs":61268,"articleLive":2,"columnArticles":479,"formTitle":"[354]Russian Doll Envelopes","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":137736,"title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4067201341930073,"acs":23277,"articleLive":2,"columnArticles":393,"formTitle":"[355]Design Twitter","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":57231,"title":"Design Twitter","titleSlug":"design-twitter"},{"acceptance":0.3465248577788771,"acs":1401,"articleLive":2,"columnArticles":37,"formTitle":"[356]Line Reflection","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4043,"title":"Line Reflection","titleSlug":"line-reflection"},{"acceptance":0.5176489162550466,"acs":22951,"articleLive":2,"columnArticles":343,"formTitle":"[357]Count Numbers with Unique Digits","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":44337,"title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35051103667439665,"acs":4081,"articleLive":2,"columnArticles":55,"formTitle":"[358]Rearrange String k Distance Apart","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":11643,"title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7208901155770226,"acs":4179,"articleLive":2,"columnArticles":51,"formTitle":"[359]Logger Rate Limiter","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":5797,"title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter"},{"acceptance":0.6008542952064547,"acs":2532,"articleLive":2,"columnArticles":54,"formTitle":"[360]Sort Transformed Array","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4214,"title":"Sort Transformed Array","titleSlug":"sort-transformed-array"},{"acceptance":0.5540243658877572,"acs":2774,"articleLive":2,"columnArticles":58,"formTitle":"[361]Bomb Enemy","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5007,"title":"Bomb Enemy","titleSlug":"bomb-enemy"},{"acceptance":0.6971633018144646,"acs":2728,"articleLive":2,"columnArticles":51,"formTitle":"[362]Design Hit Counter","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":3913,"title":"Design Hit Counter","titleSlug":"design-hit-counter"},{"acceptance":0.49146119083485296,"acs":30994,"articleLive":2,"columnArticles":209,"formTitle":"[363]Max Sum of Rectangle No Larger Than K","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"","submitted":63065,"title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.714413208389112,"acs":1601,"articleLive":2,"columnArticles":44,"formTitle":"[364]Nested List Weight Sum II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2241,"title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.35912769010043044,"acs":31289,"articleLive":2,"columnArticles":462,"formTitle":"[365]Water and Jug Problem","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":87125,"title":"Water and Jug Problem","titleSlug":"water-and-jug-problem"},{"acceptance":0.7634301631516116,"acs":3837,"articleLive":2,"columnArticles":110,"formTitle":"[366]Find Leaves of Binary Tree","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5026,"title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4383261482609964,"acs":67614,"articleLive":2,"columnArticles":516,"formTitle":"[367]Valid Perfect Square","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":154255,"title":"Valid Perfect Square","titleSlug":"valid-perfect-square"},{"acceptance":0.4579057370312096,"acs":38998,"articleLive":2,"columnArticles":425,"formTitle":"[368]Largest Divisible Subset","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"","submitted":85166,"title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset"},{"acceptance":0.6154312566318023,"acs":4060,"articleLive":2,"columnArticles":108,"formTitle":"[369]Plus One Linked List","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":6597,"title":"Plus One Linked List","titleSlug":"plus-one-linked-list"},{"acceptance":0.7041763341067285,"acs":2428,"articleLive":2,"columnArticles":40,"formTitle":"[370]Range Addition","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":3448,"title":"Range Addition","titleSlug":"range-addition"},{"acceptance":0.5785402595645359,"acs":51309,"articleLive":2,"columnArticles":293,"formTitle":"[371]Sum of Two Integers","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"","submitted":88687,"title":"Sum of Two Integers","titleSlug":"sum-of-two-integers"},{"acceptance":0.4984428715874621,"acs":12324,"articleLive":2,"columnArticles":120,"formTitle":"[372]Super Pow","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":24725,"title":"Super Pow","titleSlug":"super-pow"},{"acceptance":0.4463712092339522,"acs":16397,"articleLive":2,"columnArticles":166,"formTitle":"[373]Find K Pairs with Smallest Sums","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","submitted":36734,"title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5114636287540066,"acs":75156,"articleLive":2,"columnArticles":525,"formTitle":"[374]Guess Number Higher or Lower","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","submitted":146943,"title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.460668345001207,"acs":13358,"articleLive":2,"columnArticles":111,"formTitle":"[375]Guess Number Higher or Lower II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":28997,"title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4566763347298313,"acs":63768,"articleLive":2,"columnArticles":712,"formTitle":"[376]Wiggle Subsequence","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":139635,"title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"},{"acceptance":0.5031814687549204,"acs":54328,"articleLive":2,"columnArticles":474,"formTitle":"[377]Combination Sum IV","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"","submitted":107969,"title":"Combination Sum IV","titleSlug":"combination-sum-iv"},{"acceptance":0.6368533441127622,"acs":72472,"articleLive":2,"columnArticles":524,"formTitle":"[378]Kth Smallest Element in a Sorted Matrix","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","submitted":113797,"title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6458078709362014,"acs":2642,"articleLive":2,"columnArticles":61,"formTitle":"[379]Design Phone Directory","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":4091,"title":"Design Phone Directory","titleSlug":"design-phone-directory"},{"acceptance":0.49966613590836717,"acs":29184,"articleLive":2,"columnArticles":183,"formTitle":"[380]Insert Delete GetRandom O(1)","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","submitted":58407,"title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44489061505716104,"acs":20275,"articleLive":2,"columnArticles":173,"formTitle":"[381]Insert Delete GetRandom O(1) - Duplicates allowed","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":45573,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6190784005910056,"acs":13408,"articleLive":2,"columnArticles":107,"formTitle":"[382]Linked List Random Node","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":21658,"title":"Linked List Random Node","titleSlug":"linked-list-random-node"},{"acceptance":0.5797233850637186,"acs":50131,"articleLive":2,"columnArticles":527,"formTitle":"[383]Ransom Note","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","submitted":86474,"title":"Ransom Note","titleSlug":"ransom-note"},{"acceptance":0.5682820536310217,"acs":43423,"articleLive":2,"columnArticles":162,"formTitle":"[384]Shuffle an Array","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","submitted":76411,"title":"Shuffle an Array","titleSlug":"shuffle-an-array"},{"acceptance":0.4130408213150819,"acs":6759,"articleLive":2,"columnArticles":78,"formTitle":"[385]Mini Parser","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"","submitted":16364,"title":"Mini Parser","titleSlug":"mini-parser"},{"acceptance":0.7391572773576169,"acs":19156,"articleLive":2,"columnArticles":197,"formTitle":"[386]Lexicographical Numbers","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":25916,"title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"},{"acceptance":0.5239337291465176,"acs":191229,"articleLive":2,"columnArticles":1025,"formTitle":"[387]First Unique Character in a String","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","submitted":364987,"title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5163398692810458,"acs":5056,"articleLive":2,"columnArticles":92,"formTitle":"[388]Longest Absolute File Path","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":9792,"title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6938715996949258,"acs":92797,"articleLive":2,"columnArticles":902,"formTitle":"[389]Find the Difference","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":133738,"title":"Find the Difference","titleSlug":"find-the-difference"},{"acceptance":0.4646309314586995,"acs":6345,"articleLive":2,"columnArticles":88,"formTitle":"[390]Elimination Game","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":13656,"title":"Elimination Game","titleSlug":"elimination-game"},{"acceptance":0.3456277056277056,"acs":3992,"articleLive":2,"columnArticles":59,"formTitle":"[391]Perfect Rectangle","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":11550,"title":"Perfect Rectangle","titleSlug":"perfect-rectangle"},{"acceptance":0.512055249446835,"acs":129827,"articleLive":2,"columnArticles":1433,"formTitle":"[392]Is Subsequence","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":253541,"title":"Is Subsequence","titleSlug":"is-subsequence"},{"acceptance":0.3929846344870402,"acs":10128,"articleLive":2,"columnArticles":116,"formTitle":"[393]UTF-8 Validation","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":25772,"title":"UTF-8 Validation","titleSlug":"utf-8-validation"},{"acceptance":0.5481718962443326,"acs":103616,"articleLive":2,"columnArticles":1161,"formTitle":"[394]Decode String","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"","submitted":189021,"title":"Decode String","titleSlug":"decode-string"},{"acceptance":0.5190107671601615,"acs":46275,"articleLive":2,"columnArticles":398,"formTitle":"[395]Longest Substring with At Least K Repeating Characters","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":89160,"title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4127857747671465,"acs":7800,"articleLive":2,"columnArticles":123,"formTitle":"[396]Rotate Function","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":18896,"title":"Rotate Function","titleSlug":"rotate-function"},{"acceptance":0.37541921483527324,"acs":13321,"articleLive":2,"columnArticles":148,"formTitle":"[397]Integer Replacement","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":35483,"title":"Integer Replacement","titleSlug":"integer-replacement"},{"acceptance":0.647287814372791,"acs":12637,"articleLive":2,"columnArticles":108,"formTitle":"[398]Random Pick Index","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":19523,"title":"Random Pick Index","titleSlug":"random-pick-index"},{"acceptance":0.5910256611966834,"acs":37565,"articleLive":2,"columnArticles":486,"formTitle":"[399]Evaluate Division","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":63559,"title":"Evaluate Division","titleSlug":"evaluate-division"},{"acceptance":0.407596132335761,"acs":16398,"articleLive":2,"columnArticles":166,"formTitle":"[400]Nth Digit","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","submitted":40231,"title":"Nth Digit","titleSlug":"nth-digit"},{"acceptance":0.6115684575389948,"acs":50814,"articleLive":2,"columnArticles":640,"formTitle":"[401]Binary Watch","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":83088,"title":"Binary Watch","titleSlug":"binary-watch"},{"acceptance":0.32782582267289256,"acs":71190,"articleLive":2,"columnArticles":534,"formTitle":"[402]Remove K Digits","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"","submitted":217158,"title":"Remove K Digits","titleSlug":"remove-k-digits"},{"acceptance":0.45609655040530345,"acs":42931,"articleLive":2,"columnArticles":435,"formTitle":"[403]Frog Jump","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"","submitted":94127,"title":"Frog Jump","titleSlug":"frog-jump"},{"acceptance":0.5765886510635461,"acs":86471,"articleLive":2,"columnArticles":985,"formTitle":"[404]Sum of Left Leaves","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","submitted":149970,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5232979577663477,"acs":24112,"articleLive":2,"columnArticles":244,"formTitle":"[405]Convert a Number to Hexadecimal","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":46077,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7321591531301332,"acs":104299,"articleLive":2,"columnArticles":714,"formTitle":"[406]Queue Reconstruction by Height","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":142454,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4784092756135883,"acs":8830,"articleLive":2,"columnArticles":119,"formTitle":"[407]Trapping Rain Water II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":18457,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3193162751677852,"acs":3045,"articleLive":2,"columnArticles":69,"formTitle":"[408]Valid Word Abbreviation","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":9536,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5548475686059646,"acs":82027,"articleLive":2,"columnArticles":1192,"formTitle":"[409]Longest Palindrome","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":147837,"title":"Longest Palindrome","titleSlug":"longest-palindrome"},{"acceptance":0.5552914928703075,"acs":34347,"articleLive":2,"columnArticles":279,"formTitle":"[410]Split Array Largest Sum","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":61854,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"},{"acceptance":0.49363250454821106,"acs":814,"articleLive":2,"columnArticles":18,"formTitle":"[411]Minimum Unique Word Abbreviation","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1649,"title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6675016599263597,"acs":66351,"articleLive":2,"columnArticles":328,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":99402,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6572581427379774,"acs":33881,"articleLive":2,"columnArticles":352,"formTitle":"[413]Arithmetic Slices","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","submitted":51549,"title":"Arithmetic Slices","titleSlug":"arithmetic-slices"},{"acceptance":0.3622443247529987,"acs":54813,"articleLive":2,"columnArticles":728,"formTitle":"[414]Third Maximum Number","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","submitted":151315,"title":"Third Maximum Number","titleSlug":"third-maximum-number"},{"acceptance":0.5304184209069972,"acs":124599,"articleLive":2,"columnArticles":958,"formTitle":"[415]Add Strings","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":234907,"title":"Add Strings","titleSlug":"add-strings"},{"acceptance":0.5028250395576653,"acs":141412,"articleLive":2,"columnArticles":828,"formTitle":"[416]Partition Equal Subset Sum","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","submitted":281235,"title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4676319746246215,"acs":22704,"articleLive":2,"columnArticles":258,"formTitle":"[417]Pacific Atlantic Water Flow","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","submitted":48551,"title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3550393268703128,"acs":1941,"articleLive":2,"columnArticles":30,"formTitle":"[418]Sentence Screen Fitting","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":5467,"title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7524434615110224,"acs":10547,"articleLive":2,"columnArticles":133,"formTitle":"[419]Battleships in a Board","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":14017,"title":"Battleships in a Board","titleSlug":"battleships-in-a-board"},{"acceptance":0.20394474167531743,"acs":2554,"articleLive":2,"columnArticles":45,"formTitle":"[420]Strong Password Checker","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":12523,"title":"Strong Password Checker","titleSlug":"strong-password-checker"},{"acceptance":0.6230806238223149,"acs":31083,"articleLive":2,"columnArticles":282,"formTitle":"[421]Maximum XOR of Two Numbers in an Array","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"","submitted":49886,"title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4249256689791873,"acs":1715,"articleLive":2,"columnArticles":43,"formTitle":"[422]Valid Word Square","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4036,"title":"Valid Word Square","titleSlug":"valid-word-square"},{"acceptance":0.5670972644376899,"acs":7463,"articleLive":2,"columnArticles":122,"formTitle":"[423]Reconstruct Original Digits from English","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":13160,"title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5285321493768452,"acs":46903,"articleLive":2,"columnArticles":428,"formTitle":"[424]Longest Repeating Character Replacement","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":88742,"title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6093044263775971,"acs":1349,"articleLive":2,"columnArticles":29,"formTitle":"[425]Word Squares","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2214,"title":"Word Squares","titleSlug":"word-squares"},{"acceptance":0.6697183914706223,"acs":5779,"articleLive":2,"columnArticles":102,"formTitle":"[426]Convert Binary Search Tree to Sorted Doubly Linked List","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":8629,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6108019639934533,"acs":3732,"articleLive":2,"columnArticles":54,"formTitle":"[427]Construct Quad Tree","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6110,"title":"Construct Quad Tree","titleSlug":"construct-quad-tree"},{"acceptance":0.6488443330548593,"acs":2330,"articleLive":2,"columnArticles":49,"formTitle":"[428]Serialize and Deserialize N-ary Tree","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":3591,"title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6928366526208874,"acs":50478,"articleLive":2,"columnArticles":407,"formTitle":"[429]N-ary Tree Level Order Traversal","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"","submitted":72857,"title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5373239627710091,"acs":19802,"articleLive":2,"columnArticles":288,"formTitle":"[430]Flatten a Multilevel Doubly Linked List","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"","submitted":36853,"title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7245508982035929,"acs":726,"articleLive":2,"columnArticles":23,"formTitle":"[431]Encode N-ary Tree to Binary Tree","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1002,"title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37780408773678964,"acs":6063,"articleLive":2,"columnArticles":73,"formTitle":"[432]All O`one Data Structure","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":16048,"title":"All O`one Data Structure","titleSlug":"all-oone-data-structure"},{"acceptance":0.5343820396319346,"acs":13996,"articleLive":2,"columnArticles":188,"formTitle":"[433]Minimum Genetic Mutation","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":26191,"title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37268933246211244,"acs":35363,"articleLive":2,"columnArticles":469,"formTitle":"[434]Number of Segments in a String","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":94886,"title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5064975247524752,"acs":76939,"articleLive":2,"columnArticles":718,"formTitle":"[435]Non-overlapping Intervals","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":151904,"title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4879952768302283,"acs":7439,"articleLive":2,"columnArticles":125,"formTitle":"[436]Find Right Interval","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","submitted":15244,"title":"Find Right Interval","titleSlug":"find-right-interval"},{"acceptance":0.5668471276078604,"acs":85124,"articleLive":2,"columnArticles":724,"formTitle":"[437]Path Sum III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":150171,"title":"Path Sum III","titleSlug":"path-sum-iii"},{"acceptance":0.5098629151623301,"acs":73717,"articleLive":2,"columnArticles":613,"formTitle":"[438]Find All Anagrams in a String","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"","submitted":144582,"title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5844240837696335,"acs":2679,"articleLive":2,"columnArticles":62,"formTitle":"[439]Ternary Expression Parser","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4584,"title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser"},{"acceptance":0.3753958720104838,"acs":13750,"articleLive":2,"columnArticles":107,"formTitle":"[440]K-th Smallest in Lexicographical Order","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":36628,"title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4243261168691038,"acs":42865,"articleLive":2,"columnArticles":410,"formTitle":"[441]Arranging Coins","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","submitted":101019,"title":"Arranging Coins","titleSlug":"arranging-coins"},{"acceptance":0.6915882729016348,"acs":37861,"articleLive":2,"columnArticles":362,"formTitle":"[442]Find All Duplicates in an Array","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":54745,"title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.425641520089255,"acs":30902,"articleLive":2,"columnArticles":381,"formTitle":"[443]String Compression","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":72601,"title":"String Compression","titleSlug":"string-compression"},{"acceptance":0.24095139607032057,"acs":2796,"articleLive":2,"columnArticles":45,"formTitle":"[444]Sequence Reconstruction","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":11604,"title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"},{"acceptance":0.5851818009956519,"acs":74290,"articleLive":2,"columnArticles":854,"formTitle":"[445]Add Two Numbers II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"","submitted":126952,"title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.37636761487964987,"acs":3784,"articleLive":2,"columnArticles":46,"formTitle":"[446]Arithmetic Slices II - Subsequence","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","submitted":10054,"title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6014460412389538,"acs":20214,"articleLive":2,"columnArticles":154,"formTitle":"[447]Number of Boomerangs","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":33609,"title":"Number of Boomerangs","titleSlug":"number-of-boomerangs"},{"acceptance":0.6429134555049636,"acs":119877,"articleLive":2,"columnArticles":960,"formTitle":"[448]Find All Numbers Disappeared in an Array","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":186459,"title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5536527296269997,"acs":13255,"articleLive":2,"columnArticles":121,"formTitle":"[449]Serialize and Deserialize BST","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":23941,"title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4773241042671095,"acs":47720,"articleLive":2,"columnArticles":508,"formTitle":"[450]Delete Node in a BST","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":99974,"title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.5074419685443827,"acs":82983,"articleLive":2,"columnArticles":728,"formTitle":"[452]Minimum Number of Arrows to Burst Balloons","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","submitted":163532,"title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5517655863742544,"acs":24329,"articleLive":2,"columnArticles":259,"formTitle":"[453]Minimum Moves to Equal Array Elements","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":44093,"title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5955633993109505,"acs":70529,"articleLive":2,"columnArticles":440,"formTitle":"[454]4Sum II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":118424,"title":"4Sum II","titleSlug":"4sum-ii"},{"acceptance":0.5778508628257708,"acs":132303,"articleLive":2,"columnArticles":1070,"formTitle":"[455]Assign Cookies","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":228957,"title":"Assign Cookies","titleSlug":"assign-cookies"},{"acceptance":0.36039734639297005,"acs":51881,"articleLive":2,"columnArticles":423,"formTitle":"[456]132 Pattern","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"","submitted":143955,"title":"132 Pattern","titleSlug":"132-pattern"},{"acceptance":0.36962004382519537,"acs":8940,"articleLive":2,"columnArticles":126,"formTitle":"[457]Circular Array Loop","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","submitted":24187,"title":"Circular Array Loop","titleSlug":"circular-array-loop"},{"acceptance":0.6000597669090547,"acs":6024,"articleLive":2,"columnArticles":52,"formTitle":"[458]Poor Pigs","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10039,"title":"Poor Pigs","titleSlug":"poor-pigs"},{"acceptance":0.5114016483281852,"acs":71855,"articleLive":2,"columnArticles":590,"formTitle":"[459]Repeated Substring Pattern","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":140506,"title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern"},{"acceptance":0.44119381673702507,"acs":28427,"articleLive":2,"columnArticles":365,"formTitle":"[460]LFU Cache","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":64432,"title":"LFU Cache","titleSlug":"lfu-cache"},{"acceptance":0.8097215885551867,"acs":154405,"articleLive":2,"columnArticles":1264,"formTitle":"[461]Hamming Distance","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","submitted":190689,"title":"Hamming Distance","titleSlug":"hamming-distance"},{"acceptance":0.5999612647073065,"acs":12391,"articleLive":2,"columnArticles":114,"formTitle":"[462]Minimum Moves to Equal Array Elements II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":20653,"title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7152309778452943,"acs":70152,"articleLive":2,"columnArticles":831,"formTitle":"[463]Island Perimeter","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":98083,"title":"Island Perimeter","titleSlug":"island-perimeter"},{"acceptance":0.3532738423120708,"acs":9620,"articleLive":2,"columnArticles":98,"formTitle":"[464]Can I Win","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":27231,"title":"Can I Win","titleSlug":"can-i-win"},{"acceptance":0.5265291083271924,"acs":1429,"articleLive":2,"columnArticles":25,"formTitle":"[465]Optimal Account Balancing","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":2714,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing"},{"acceptance":0.37400311062576524,"acs":11302,"articleLive":2,"columnArticles":176,"formTitle":"[466]Count The Repetitions","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30219,"title":"Count The Repetitions","titleSlug":"count-the-repetitions"},{"acceptance":0.4367476593847526,"acs":7837,"articleLive":2,"columnArticles":99,"formTitle":"[467]Unique Substrings in Wraparound String","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":17944,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.243549953801322,"acs":20560,"articleLive":2,"columnArticles":268,"formTitle":"[468]Validate IP Address","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":84418,"title":"Validate IP Address","titleSlug":"validate-ip-address"},{"acceptance":0.43785204656402554,"acs":1166,"articleLive":2,"columnArticles":20,"formTitle":"[469]Convex Polygon","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":2663,"title":"Convex Polygon","titleSlug":"convex-polygon"},{"acceptance":0.547449202420814,"acs":26323,"articleLive":2,"columnArticles":136,"formTitle":"[470]Implement Rand10() Using Rand7()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":48083,"title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6175824175824176,"acs":1124,"articleLive":2,"columnArticles":22,"formTitle":"[471]Encode String with Shortest Length","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":1820,"title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4124262018554962,"acs":5868,"articleLive":2,"columnArticles":70,"formTitle":"[472]Concatenated Words","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":14228,"title":"Concatenated Words","titleSlug":"concatenated-words"},{"acceptance":0.41621209319526625,"acs":18007,"articleLive":2,"columnArticles":155,"formTitle":"[473]Matchsticks to Square","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":43264,"title":"Matchsticks to Square","titleSlug":"matchsticks-to-square"},{"acceptance":0.6045326452935149,"acs":66073,"articleLive":2,"columnArticles":547,"formTitle":"[474]Ones and Zeroes","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","submitted":109296,"title":"Ones and Zeroes","titleSlug":"ones-and-zeroes"},{"acceptance":0.3260287661943681,"acs":18270,"articleLive":2,"columnArticles":209,"formTitle":"[475]Heaters","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":56038,"title":"Heaters","titleSlug":"heaters"},{"acceptance":0.6995244443560101,"acs":35156,"articleLive":2,"columnArticles":431,"formTitle":"[476]Number Complement","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":50257,"title":"Number Complement","titleSlug":"number-complement"},{"acceptance":0.6027493493845097,"acs":37752,"articleLive":2,"columnArticles":323,"formTitle":"[477]Total Hamming Distance","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","submitted":62633,"title":"Total Hamming Distance","titleSlug":"total-hamming-distance"},{"acceptance":0.43102792360952596,"acs":5665,"articleLive":2,"columnArticles":42,"formTitle":"[478]Generate Random Point in a Circle","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":13143,"title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.40691062837148273,"acs":2791,"articleLive":2,"columnArticles":19,"formTitle":"[479]Largest Palindrome Product","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":6859,"title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product"},{"acceptance":0.4477517209953293,"acs":27513,"articleLive":2,"columnArticles":390,"formTitle":"[480]Sliding Window Median","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","submitted":61447,"title":"Sliding Window Median","titleSlug":"sliding-window-median"},{"acceptance":0.5292547512278454,"acs":4957,"articleLive":2,"columnArticles":86,"formTitle":"[481]Magical String","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":9366,"title":"Magical String","titleSlug":"magical-string"},{"acceptance":0.42276543576788767,"acs":17070,"articleLive":2,"columnArticles":199,"formTitle":"[482]License Key Formatting","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":40377,"title":"License Key Formatting","titleSlug":"license-key-formatting"},{"acceptance":0.5855852189483965,"acs":14389,"articleLive":2,"columnArticles":112,"formTitle":"[483]Smallest Good Base","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","submitted":24572,"title":"Smallest Good Base","titleSlug":"smallest-good-base"},{"acceptance":0.6487016168544831,"acs":1324,"articleLive":2,"columnArticles":30,"formTitle":"[484]Find Permutation","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2041,"title":"Find Permutation","titleSlug":"find-permutation"},{"acceptance":0.6041838104725193,"acs":111600,"articleLive":2,"columnArticles":881,"formTitle":"[485]Max Consecutive Ones","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":184712,"title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones"},{"acceptance":0.5889126501069255,"acs":42960,"articleLive":2,"columnArticles":381,"formTitle":"[486]Predict the Winner","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","submitted":72948,"title":"Predict the Winner","titleSlug":"predict-the-winner"},{"acceptance":0.5799530148786217,"acs":3703,"articleLive":2,"columnArticles":79,"formTitle":"[487]Max Consecutive Ones II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":6385,"title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.39251632345555,"acs":3126,"articleLive":2,"columnArticles":65,"formTitle":"[488]Zuma Game","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":7964,"title":"Zuma Game","titleSlug":"zuma-game"},{"acceptance":0.7127016129032258,"acs":1414,"articleLive":2,"columnArticles":20,"formTitle":"[489]Robot Room Cleaner","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":1984,"title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner"},{"acceptance":0.4780063555778558,"acs":5716,"articleLive":2,"columnArticles":66,"formTitle":"[490]The Maze","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":11958,"title":"The Maze","titleSlug":"the-maze"},{"acceptance":0.5496173750275269,"acs":39933,"articleLive":2,"columnArticles":348,"formTitle":"[491]Increasing Subsequences","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","submitted":72656,"title":"Increasing Subsequences","titleSlug":"increasing-subsequences"},{"acceptance":0.5469856518258513,"acs":17765,"articleLive":2,"columnArticles":157,"formTitle":"[492]Construct the Rectangle","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":32478,"title":"Construct the Rectangle","titleSlug":"construct-the-rectangle"},{"acceptance":0.34267505515156466,"acs":25164,"articleLive":2,"columnArticles":252,"formTitle":"[493]Reverse Pairs","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":73434,"title":"Reverse Pairs","titleSlug":"reverse-pairs"},{"acceptance":0.4977124039866686,"acs":124994,"articleLive":2,"columnArticles":916,"formTitle":"[494]Target Sum","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","submitted":251137,"title":"Target Sum","titleSlug":"target-sum"},{"acceptance":0.5338891936368623,"acs":24332,"articleLive":2,"columnArticles":347,"formTitle":"[495]Teemo Attacking","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":45575,"title":"Teemo Attacking","titleSlug":"teemo-attacking"},{"acceptance":0.6830343569474004,"acs":85367,"articleLive":2,"columnArticles":875,"formTitle":"[496]Next Greater Element I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"","submitted":124982,"title":"Next Greater Element I","titleSlug":"next-greater-element-i"},{"acceptance":0.4016406373244991,"acs":2546,"articleLive":2,"columnArticles":32,"formTitle":"[497]Random Point in Non-overlapping Rectangles","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":6339,"title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.44793456428623285,"acs":37020,"articleLive":2,"columnArticles":375,"formTitle":"[498]Diagonal Traverse","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":82646,"title":"Diagonal Traverse","titleSlug":"diagonal-traverse"},{"acceptance":0.364477335800185,"acs":2364,"articleLive":2,"columnArticles":44,"formTitle":"[499]The Maze III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":6486,"title":"The Maze III","titleSlug":"the-maze-iii"},{"acceptance":0.7059244858283025,"acs":27596,"articleLive":2,"columnArticles":402,"formTitle":"[500]Keyboard Row","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":39092,"title":"Keyboard Row","titleSlug":"keyboard-row"},{"acceptance":0.509206805145527,"acs":57437,"articleLive":2,"columnArticles":485,"formTitle":"[501]Find Mode in Binary Search Tree","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":112797,"title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4158415841584158,"acs":6090,"articleLive":2,"columnArticles":83,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":14645,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6286089877793466,"acs":90377,"articleLive":2,"columnArticles":894,"formTitle":"[503]Next Greater Element II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"","submitted":143773,"title":"Next Greater Element II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5038109327890036,"acs":26903,"articleLive":2,"columnArticles":284,"formTitle":"[504]Base 7","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":53399,"title":"Base 7","titleSlug":"base-7"},{"acceptance":0.4818586258032625,"acs":4874,"articleLive":2,"columnArticles":61,"formTitle":"[505]The Maze II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":10115,"title":"The Maze II","titleSlug":"the-maze-ii"},{"acceptance":0.5602781098596866,"acs":17809,"articleLive":2,"columnArticles":226,"formTitle":"[506]Relative Ranks","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":31786,"title":"Relative Ranks","titleSlug":"relative-ranks"},{"acceptance":0.40332188554235177,"acs":26541,"articleLive":2,"columnArticles":207,"formTitle":"[507]Perfect Number","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":65806,"title":"Perfect Number","titleSlug":"perfect-number"},{"acceptance":0.6721194879089616,"acs":13230,"articleLive":2,"columnArticles":182,"formTitle":"[508]Most Frequent Subtree Sum","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":19684,"title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6812008630923494,"acs":182476,"articleLive":2,"columnArticles":1201,"formTitle":"[509]Fibonacci Number","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":267874,"title":"Fibonacci Number","titleSlug":"fibonacci-number"},{"acceptance":0.6091177712114816,"acs":2886,"articleLive":2,"columnArticles":48,"formTitle":"[510]Inorder Successor in BST II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":4738,"title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7335390458105863,"acs":15452,"articleLive":2,"columnArticles":94,"formTitle":"[511]Game Play Analysis I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":21065,"title":"Game Play Analysis I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5339718106252259,"acs":14775,"articleLive":2,"columnArticles":130,"formTitle":"[512]Game Play Analysis II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":27670,"title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7305687498888118,"acs":41066,"articleLive":2,"columnArticles":474,"formTitle":"[513]Find Bottom Left Tree Value","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":56211,"title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.501222361058293,"acs":18452,"articleLive":2,"columnArticles":225,"formTitle":"[514]Freedom Trail","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":36814,"title":"Freedom Trail","titleSlug":"freedom-trail"},{"acceptance":0.6398458976262617,"acs":31888,"articleLive":2,"columnArticles":352,"formTitle":"[515]Find Largest Value in Each Tree Row","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":49837,"title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6191573556797021,"acs":53198,"articleLive":2,"columnArticles":377,"formTitle":"[516]Longest Palindromic Subsequence","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","submitted":85920,"title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4342173686947478,"acs":3340,"articleLive":2,"columnArticles":42,"formTitle":"[517]Super Washing Machines","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":7692,"title":"Super Washing Machines","titleSlug":"super-washing-machines"},{"acceptance":0.639053605313093,"acs":86216,"articleLive":2,"columnArticles":585,"formTitle":"[518]Coin Change 2","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","submitted":134912,"title":"Coin Change 2","titleSlug":"coin-change-2"},{"acceptance":0.39422756089422756,"acs":2363,"articleLive":2,"columnArticles":32,"formTitle":"[519]Random Flip Matrix","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":5994,"title":"Random Flip Matrix","titleSlug":"random-flip-matrix"},{"acceptance":0.5616993404316898,"acs":36875,"articleLive":2,"columnArticles":575,"formTitle":"[520]Detect Capital","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":65649,"title":"Detect Capital","titleSlug":"detect-capital"},{"acceptance":0.7093210724308832,"acs":23758,"articleLive":2,"columnArticles":231,"formTitle":"[521]Longest Uncommon Subsequence I","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":33494,"title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35598365440747226,"acs":6098,"articleLive":2,"columnArticles":98,"formTitle":"[522]Longest Uncommon Subsequence II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":17130,"title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27297053904541363,"acs":63654,"articleLive":2,"columnArticles":571,"formTitle":"[523]Continuous Subarray Sum","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","submitted":233190,"title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4732135631625799,"acs":35085,"articleLive":2,"columnArticles":330,"formTitle":"[524]Longest Word in Dictionary through Deleting","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":74142,"title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5363702491362066,"acs":41293,"articleLive":2,"columnArticles":478,"formTitle":"[525]Contiguous Array","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","submitted":76986,"title":"Contiguous Array","titleSlug":"contiguous-array"},{"acceptance":0.6541941930827736,"acs":11784,"articleLive":2,"columnArticles":148,"formTitle":"[526]Beautiful Arrangement","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","submitted":18013,"title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"},{"acceptance":0.5707950585999366,"acs":1802,"articleLive":2,"columnArticles":29,"formTitle":"[527]Word Abbreviation","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3157,"title":"Word Abbreviation","titleSlug":"word-abbreviation"},{"acceptance":0.46603502727533735,"acs":8116,"articleLive":2,"columnArticles":78,"formTitle":"[528]Random Pick with Weight","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":17415,"title":"Random Pick with Weight","titleSlug":"random-pick-with-weight"},{"acceptance":0.649845009299442,"acs":36687,"articleLive":2,"columnArticles":441,"formTitle":"[529]Minesweeper","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":56455,"title":"Minesweeper","titleSlug":"minesweeper"},{"acceptance":0.6191134375473734,"acs":69428,"articleLive":2,"columnArticles":577,"formTitle":"[530]Minimum Absolute Difference in BST","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","submitted":112141,"title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6669327479545001,"acs":3342,"articleLive":2,"columnArticles":72,"formTitle":"[531]Lonely Pixel I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5011,"title":"Lonely Pixel I","titleSlug":"lonely-pixel-i"},{"acceptance":0.36929905111723293,"acs":24130,"articleLive":2,"columnArticles":255,"formTitle":"[532]K-diff Pairs in an Array","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":65340,"title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5252161383285303,"acs":1458,"articleLive":2,"columnArticles":31,"formTitle":"[533]Lonely Pixel II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":2776,"title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6756178019561317,"acs":11674,"articleLive":2,"columnArticles":123,"formTitle":"[534]Game Play Analysis III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":17279,"title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8402861230329042,"acs":14684,"articleLive":2,"columnArticles":91,"formTitle":"[535]Encode and Decode TinyURL","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":17475,"title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5362261146496815,"acs":2694,"articleLive":2,"columnArticles":41,"formTitle":"[536]Construct Binary Tree from String","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5024,"title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7092693853350023,"acs":10766,"articleLive":2,"columnArticles":154,"formTitle":"[537]Complex Number Multiplication","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":15179,"title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication"},{"acceptance":0.6852290849532348,"acs":95388,"articleLive":2,"columnArticles":731,"formTitle":"[538]Convert BST to Greater Tree","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":139206,"title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.589519235341671,"acs":12397,"articleLive":2,"columnArticles":156,"formTitle":"[539]Minimum Time Difference","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":21029,"title":"Minimum Time Difference","titleSlug":"minimum-time-difference"},{"acceptance":0.5810893955845096,"acs":32111,"articleLive":2,"columnArticles":338,"formTitle":"[540]Single Element in a Sorted Array","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","submitted":55260,"title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.57772291051247,"acs":39310,"articleLive":2,"columnArticles":437,"formTitle":"[541]Reverse String II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","submitted":68043,"title":"Reverse String II","titleSlug":"reverse-string-ii"},{"acceptance":0.4574524070067578,"acs":54763,"articleLive":2,"columnArticles":526,"formTitle":"[542]01 Matrix","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","submitted":119713,"title":"01 Matrix","titleSlug":"01-matrix"},{"acceptance":0.5410016155088853,"acs":125580,"articleLive":2,"columnArticles":1108,"formTitle":"[543]Diameter of Binary Tree","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":232125,"title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7061183550651956,"acs":2112,"articleLive":2,"columnArticles":47,"formTitle":"[544]Output Contest Matches","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":2991,"title":"Output Contest Matches","titleSlug":"output-contest-matches"},{"acceptance":0.4131186801490154,"acs":3105,"articleLive":2,"columnArticles":72,"formTitle":"[545]Boundary of Binary Tree","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":7516,"title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6325005431240496,"acs":14557,"articleLive":2,"columnArticles":118,"formTitle":"[546]Remove Boxes","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23015,"title":"Remove Boxes","titleSlug":"remove-boxes"},{"acceptance":0.616421438904767,"acs":139760,"articleLive":2,"columnArticles":975,"formTitle":"[547]Number of Provinces","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","submitted":226728,"title":"Number of Provinces","titleSlug":"number-of-provinces"},{"acceptance":0.3519282076158137,"acs":1451,"articleLive":2,"columnArticles":38,"formTitle":"[548]Split Array with Equal Sum","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":2,"nodeType":"def","questionId":"548","status":"lock","submitted":4123,"title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48474855729596045,"acs":1764,"articleLive":2,"columnArticles":43,"formTitle":"[549]Binary Tree Longest Consecutive Sequence II","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":3639,"title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4421238480751012,"acs":10267,"articleLive":2,"columnArticles":151,"formTitle":"[550]Game Play Analysis IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":23222,"title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5289598440984129,"acs":28229,"articleLive":2,"columnArticles":363,"formTitle":"[551]Student Attendance Record I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","submitted":53367,"title":"Student Attendance Record I","titleSlug":"student-attendance-record-i"},{"acceptance":0.4365503777268483,"acs":5143,"articleLive":2,"columnArticles":71,"formTitle":"[552]Student Attendance Record II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","submitted":11781,"title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6022017932130291,"acs":5306,"articleLive":2,"columnArticles":75,"formTitle":"[553]Optimal Division","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":8811,"title":"Optimal Division","titleSlug":"optimal-division"},{"acceptance":0.4991628543130689,"acs":42335,"articleLive":2,"columnArticles":466,"formTitle":"[554]Brick Wall","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","submitted":84812,"title":"Brick Wall","titleSlug":"brick-wall"},{"acceptance":0.3393089960886571,"acs":1041,"articleLive":2,"columnArticles":21,"formTitle":"[555]Split Concatenated Strings","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3068,"title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings"},{"acceptance":0.3212840991598382,"acs":12390,"articleLive":2,"columnArticles":193,"formTitle":"[556]Next Greater Element III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":38564,"title":"Next Greater Element III","titleSlug":"next-greater-element-iii"},{"acceptance":0.742160237598975,"acs":125693,"articleLive":2,"columnArticles":1001,"formTitle":"[557]Reverse Words in a String III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","submitted":169361,"title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.49732126362460743,"acs":2692,"articleLive":2,"columnArticles":28,"formTitle":"[558]Logical OR of Two Binary Grids Represented as Quad-Trees","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5413,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7233826999213512,"acs":54266,"articleLive":2,"columnArticles":500,"formTitle":"[559]Maximum Depth of N-ary Tree","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":75017,"title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4471121194167883,"acs":123766,"articleLive":2,"columnArticles":788,"formTitle":"[560]Subarray Sum Equals K","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":276812,"title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7719149952683272,"acs":84016,"articleLive":2,"columnArticles":677,"formTitle":"[561]Array Partition I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":108841,"title":"Array Partition I","titleSlug":"array-partition-i"},{"acceptance":0.45286885245901637,"acs":3315,"articleLive":2,"columnArticles":49,"formTitle":"[562]Longest Line of Consecutive One in Matrix","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":7320,"title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.599587687785761,"acs":29375,"articleLive":2,"columnArticles":288,"formTitle":"[563]Binary Tree Tilt","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":48992,"title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt"},{"acceptance":0.17745990463805808,"acs":4094,"articleLive":2,"columnArticles":71,"formTitle":"[564]Find the Closest Palindrome","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","submitted":23070,"title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6067405048248324,"acs":12764,"articleLive":2,"columnArticles":122,"formTitle":"[565]Array Nesting","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":21037,"title":"Array Nesting","titleSlug":"array-nesting"},{"acceptance":0.7025145819831498,"acs":54199,"articleLive":2,"columnArticles":494,"formTitle":"[566]Reshape the Matrix","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","submitted":77150,"title":"Reshape the Matrix","titleSlug":"reshape-the-matrix"},{"acceptance":0.42456800071626827,"acs":90098,"articleLive":2,"columnArticles":839,"formTitle":"[567]Permutation in String","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"","submitted":212211,"title":"Permutation in String","titleSlug":"permutation-in-string"},{"acceptance":0.49414634146341463,"acs":1013,"articleLive":2,"columnArticles":22,"formTitle":"[568]Maximum Vacation Days","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2050,"title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days"},{"acceptance":0.5639567936327459,"acs":7936,"articleLive":2,"columnArticles":136,"formTitle":"[569]Median Employee Salary","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":14072,"title":"Median Employee Salary","titleSlug":"median-employee-salary"},{"acceptance":0.6662149954832882,"acs":10325,"articleLive":2,"columnArticles":97,"formTitle":"[570]Managers with at Least 5 Direct Reports","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":15498,"title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4909530634181297,"acs":5481,"articleLive":2,"columnArticles":82,"formTitle":"[571]Find Median Given Frequency of Numbers","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":11164,"title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4726621530759655,"acs":71000,"articleLive":2,"columnArticles":634,"formTitle":"[572]Subtree of Another Tree","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","submitted":150213,"title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6574420344053852,"acs":879,"articleLive":2,"columnArticles":24,"formTitle":"[573]Squirrel Simulation","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1337,"title":"Squirrel Simulation","titleSlug":"squirrel-simulation"},{"acceptance":0.6418823817391837,"acs":10489,"articleLive":2,"columnArticles":99,"formTitle":"[574]Winning Candidate","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":16341,"title":"Winning Candidate","titleSlug":"winning-candidate"},{"acceptance":0.6843942911649838,"acs":38027,"articleLive":2,"columnArticles":357,"formTitle":"[575]Distribute Candies","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":55563,"title":"Distribute Candies","titleSlug":"distribute-candies"},{"acceptance":0.3907526187070278,"acs":8468,"articleLive":2,"columnArticles":129,"formTitle":"[576]Out of Boundary Paths","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","submitted":21671,"title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7068631480068103,"acs":12040,"articleLive":2,"columnArticles":72,"formTitle":"[577]Employee Bonus","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":17033,"title":"Employee Bonus","titleSlug":"employee-bonus"},{"acceptance":0.5011105626850938,"acs":8122,"articleLive":2,"columnArticles":99,"formTitle":"[578]Get Highest Answer Rate Question","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":16208,"title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.43401896620809405,"acs":6499,"articleLive":2,"columnArticles":110,"formTitle":"[579]Find Cumulative Salary of an Employee","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":14974,"title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5260872383174542,"acs":8117,"articleLive":2,"columnArticles":67,"formTitle":"[580]Count Student Number in Departments","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":15429,"title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments"},{"acceptance":0.37167893360001464,"acs":60952,"articleLive":2,"columnArticles":491,"formTitle":"[581]Shortest Unsorted Continuous Subarray","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"","submitted":163991,"title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.3986469681142118,"acs":8014,"articleLive":2,"columnArticles":122,"formTitle":"[582]Kill Process","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":20103,"title":"Kill Process","titleSlug":"kill-process"},{"acceptance":0.5651609890252446,"acs":21783,"articleLive":2,"columnArticles":197,"formTitle":"[583]Delete Operation for Two Strings","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","submitted":38543,"title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7734401753304568,"acs":11293,"articleLive":2,"columnArticles":51,"formTitle":"[584]Find Customer Referee","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":14601,"title":"Find Customer Referee","titleSlug":"find-customer-referee"},{"acceptance":0.5979829594853069,"acs":6878,"articleLive":2,"columnArticles":84,"formTitle":"[585]Investments in 2016","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":11502,"title":"Investments in 2016","titleSlug":"investments-in-2016"},{"acceptance":0.7498238195912614,"acs":11704,"articleLive":2,"columnArticles":78,"formTitle":"[586]Customer Placing the Largest Number of Orders","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":15609,"title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.37535239629480466,"acs":1864,"articleLive":2,"columnArticles":34,"formTitle":"[587]Erect the Fence","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":4966,"title":"Erect the Fence","titleSlug":"erect-the-fence"},{"acceptance":0.43116701607267643,"acs":1234,"articleLive":2,"columnArticles":27,"formTitle":"[588]Design In-Memory File System","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":2862,"title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7434854619065145,"acs":80802,"articleLive":2,"columnArticles":517,"formTitle":"[589]N-ary Tree Preorder Traversal","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":108680,"title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7578649231705864,"acs":57262,"articleLive":2,"columnArticles":410,"formTitle":"[590]N-ary Tree Postorder Traversal","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":75557,"title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3377731529656608,"acs":1623,"articleLive":2,"columnArticles":39,"formTitle":"[591]Tag Validator","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","submitted":4805,"title":"Tag Validator","titleSlug":"tag-validator"},{"acceptance":0.5160235448005233,"acs":3945,"articleLive":2,"columnArticles":94,"formTitle":"[592]Fraction Addition and Subtraction","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":7645,"title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44135356454720615,"acs":7330,"articleLive":2,"columnArticles":112,"formTitle":"[593]Valid Square","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":16608,"title":"Valid Square","titleSlug":"valid-square"},{"acceptance":0.5123160718640761,"acs":25208,"articleLive":2,"columnArticles":232,"formTitle":"[594]Longest Harmonious Subsequence","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":49204,"title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7954219951016535,"acs":93859,"articleLive":2,"columnArticles":212,"formTitle":"[595]Big Countries","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":117999,"title":"Big Countries","titleSlug":"big-countries"},{"acceptance":0.4191718333014941,"acs":72409,"articleLive":2,"columnArticles":247,"formTitle":"[596]Classes More Than 5 Students","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":172743,"title":"Classes More Than 5 Students","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4409019402202412,"acs":8408,"articleLive":2,"columnArticles":73,"formTitle":"[597]Friend Requests I: Overall Acceptance Rate","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":19070,"title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5157550427039796,"acs":14191,"articleLive":2,"columnArticles":163,"formTitle":"[598]Range Addition II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":27515,"title":"Range Addition II","titleSlug":"range-addition-ii"},{"acceptance":0.5231461681024826,"acs":25687,"articleLive":2,"columnArticles":231,"formTitle":"[599]Minimum Index Sum of Two Lists","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","submitted":49101,"title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.33876251989141626,"acs":3619,"articleLive":2,"columnArticles":63,"formTitle":"[600]Non-negative Integers without Consecutive Ones","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":10683,"title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49277231921962256,"acs":27885,"articleLive":2,"columnArticles":340,"formTitle":"[601]Human Traffic of Stadium","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":56588,"title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6298763082778306,"acs":6620,"articleLive":2,"columnArticles":78,"formTitle":"[602]Friend Requests II: Who Has the Most Friends","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":10510,"title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6745958123509144,"acs":10181,"articleLive":2,"columnArticles":96,"formTitle":"[603]Consecutive Available Seats","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":15092,"title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats"},{"acceptance":0.36228510028653294,"acs":2023,"articleLive":2,"columnArticles":45,"formTitle":"[604]Design Compressed String Iterator","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":5584,"title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33576802921635057,"acs":99203,"articleLive":2,"columnArticles":1145,"formTitle":"[605]Can Place Flowers","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":295451,"title":"Can Place Flowers","titleSlug":"can-place-flowers"},{"acceptance":0.5652571329082243,"acs":25973,"articleLive":2,"columnArticles":280,"formTitle":"[606]Construct String from Binary Tree","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":45949,"title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6661572197488205,"acs":10025,"articleLive":2,"columnArticles":79,"formTitle":"[607]Sales Person","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":15049,"title":"Sales Person","titleSlug":"sales-person"},{"acceptance":0.6623147860325355,"acs":6392,"articleLive":2,"columnArticles":84,"formTitle":"[608]Tree Node","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":9651,"title":"Tree Node","titleSlug":"tree-node"},{"acceptance":0.47850162866449514,"acs":5876,"articleLive":2,"columnArticles":88,"formTitle":"[609]Find Duplicate File in System","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":12280,"title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6701995977100418,"acs":8663,"articleLive":2,"columnArticles":65,"formTitle":"[610]Triangle Judgement","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":12926,"title":"Triangle Judgement","titleSlug":"triangle-judgement"},{"acceptance":0.48774900398406373,"acs":14691,"articleLive":2,"columnArticles":129,"formTitle":"[611]Valid Triangle Number","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","submitted":30120,"title":"Valid Triangle Number","titleSlug":"valid-triangle-number"},{"acceptance":0.6706883550576322,"acs":6226,"articleLive":2,"columnArticles":55,"formTitle":"[612]Shortest Distance in a Plane","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":9283,"title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8201379081166403,"acs":9872,"articleLive":2,"columnArticles":75,"formTitle":"[613]Shortest Distance in a Line","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":12037,"title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3480012395413697,"acs":6738,"articleLive":2,"columnArticles":54,"formTitle":"[614]Second Degree Follower","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":19362,"title":"Second Degree Follower","titleSlug":"second-degree-follower"},{"acceptance":0.4255884960110312,"acs":4321,"articleLive":2,"columnArticles":75,"formTitle":"[615]Average Salary: Departments VS Company","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":10153,"title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4590608577725038,"acs":2708,"articleLive":2,"columnArticles":49,"formTitle":"[616]Add Bold Tag in String","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":5899,"title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7882449792666071,"acs":155114,"articleLive":2,"columnArticles":1031,"formTitle":"[617]Merge Two Binary Trees","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","submitted":196784,"title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6191748789042927,"acs":3707,"articleLive":2,"columnArticles":37,"formTitle":"[618]Students Report By Geography","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":5987,"title":"Students Report By Geography","titleSlug":"students-report-by-geography"},{"acceptance":0.4656061275592871,"acs":9483,"articleLive":2,"columnArticles":72,"formTitle":"[619]Biggest Single Number","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":20367,"title":"Biggest Single Number","titleSlug":"biggest-single-number"},{"acceptance":0.7709953627633549,"acs":84461,"articleLive":2,"columnArticles":282,"formTitle":"[620]Not Boring Movies","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":109548,"title":"Not Boring Movies","titleSlug":"not-boring-movies"},{"acceptance":0.5651545068213766,"acs":69553,"articleLive":2,"columnArticles":448,"formTitle":"[621]Task Scheduler","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":123069,"title":"Task Scheduler","titleSlug":"task-scheduler"},{"acceptance":0.4334368835173806,"acs":57345,"articleLive":2,"columnArticles":366,"formTitle":"[622]Design Circular Queue","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","submitted":132303,"title":"Design Circular Queue","titleSlug":"design-circular-queue"},{"acceptance":0.542923938454847,"acs":9986,"articleLive":2,"columnArticles":169,"formTitle":"[623]Add One Row to Tree","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":18393,"title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4153250458528633,"acs":2038,"articleLive":2,"columnArticles":44,"formTitle":"[624]Maximum Distance in Arrays","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":4907,"title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.33710965867828613,"acs":2321,"articleLive":2,"columnArticles":50,"formTitle":"[625]Minimum Factorization","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":6885,"title":"Minimum Factorization","titleSlug":"minimum-factorization"},{"acceptance":0.6834885690093141,"acs":40360,"articleLive":2,"columnArticles":309,"formTitle":"[626]Exchange Seats","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":59050,"title":"Exchange Seats","titleSlug":"exchange-seats"},{"acceptance":0.8052464807023012,"acs":77509,"articleLive":2,"columnArticles":293,"formTitle":"[627]Swap Salary","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":96255,"title":"Swap Salary","titleSlug":"swap-salary"},{"acceptance":0.5235560715634573,"acs":74857,"articleLive":2,"columnArticles":706,"formTitle":"[628]Maximum Product of Three Numbers","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"","submitted":142978,"title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.39730279353526704,"acs":3712,"articleLive":2,"columnArticles":46,"formTitle":"[629]K Inverse Pairs Array","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":9343,"title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3608761230244606,"acs":5503,"articleLive":2,"columnArticles":60,"formTitle":"[630]Course Schedule III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":15249,"title":"Course Schedule III","titleSlug":"course-schedule-iii"},{"acceptance":0.27640193566752064,"acs":971,"articleLive":2,"columnArticles":25,"formTitle":"[631]Design Excel Sum Formula","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3513,"title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5967725902117367,"acs":18010,"articleLive":2,"columnArticles":227,"formTitle":"[632]Smallest Range Covering Elements from K Lists","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":30179,"title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39977948270317454,"acs":87020,"articleLive":2,"columnArticles":694,"formTitle":"[633]Sum of Square Numbers","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"","submitted":217670,"title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4329896907216495,"acs":1260,"articleLive":2,"columnArticles":18,"formTitle":"[634]Find the Derangement of An Array","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":2910,"title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5553769490435622,"acs":3455,"articleLive":2,"columnArticles":56,"formTitle":"[635]Design Log Storage System","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":6221,"title":"Design Log Storage System","titleSlug":"design-log-storage-system"},{"acceptance":0.5402647204354281,"acs":8735,"articleLive":2,"columnArticles":102,"formTitle":"[636]Exclusive Time of Functions","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"","submitted":16168,"title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6885976300019733,"acs":66303,"articleLive":2,"columnArticles":581,"formTitle":"[637]Average of Levels in Binary Tree","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":96287,"title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5944985673352435,"acs":10374,"articleLive":2,"columnArticles":107,"formTitle":"[638]Shopping Offers","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":17450,"title":"Shopping Offers","titleSlug":"shopping-offers"},{"acceptance":0.3045458176879444,"acs":3812,"articleLive":2,"columnArticles":72,"formTitle":"[639]Decode Ways II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":12517,"title":"Decode Ways II","titleSlug":"decode-ways-ii"},{"acceptance":0.4216914473969396,"acs":9728,"articleLive":2,"columnArticles":183,"formTitle":"[640]Solve the Equation","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":23069,"title":"Solve the Equation","titleSlug":"solve-the-equation"},{"acceptance":0.5350708120338556,"acs":19155,"articleLive":2,"columnArticles":212,"formTitle":"[641]Design Circular Deque","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":35799,"title":"Design Circular Deque","titleSlug":"design-circular-deque"},{"acceptance":0.4902097902097902,"acs":2103,"articleLive":2,"columnArticles":45,"formTitle":"[642]Design Search Autocomplete System","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":4290,"title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4537652075265031,"acs":57998,"articleLive":2,"columnArticles":535,"formTitle":"[643]Maximum Average Subarray I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":127815,"title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3936006168080185,"acs":1021,"articleLive":2,"columnArticles":20,"formTitle":"[644]Maximum Average Subarray II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2594,"title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4164710549806592,"acs":37791,"articleLive":2,"columnArticles":405,"formTitle":"[645]Set Mismatch","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","submitted":90741,"title":"Set Mismatch","titleSlug":"set-mismatch"},{"acceptance":0.5729402646953619,"acs":19221,"articleLive":2,"columnArticles":160,"formTitle":"[646]Maximum Length of Pair Chain","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":33548,"title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.654163597559824,"acs":103908,"articleLive":2,"columnArticles":807,"formTitle":"[647]Palindromic Substrings","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":158841,"title":"Palindromic Substrings","titleSlug":"palindromic-substrings"},{"acceptance":0.5782374380860409,"acs":18562,"articleLive":2,"columnArticles":239,"formTitle":"[648]Replace Words","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":32101,"title":"Replace Words","titleSlug":"replace-words"},{"acceptance":0.48072318007662834,"acs":28105,"articleLive":2,"columnArticles":298,"formTitle":"[649]Dota2 Senate","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":58464,"title":"Dota2 Senate","titleSlug":"dota2-senate"},{"acceptance":0.5300444027935828,"acs":23755,"articleLive":2,"columnArticles":283,"formTitle":"[650]2 Keys Keyboard","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":44817,"title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard"},{"acceptance":0.5808798060270177,"acs":3354,"articleLive":2,"columnArticles":58,"formTitle":"[651]4 Keys Keyboard","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":5774,"title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard"},{"acceptance":0.5680509956082378,"acs":26645,"articleLive":2,"columnArticles":193,"formTitle":"[652]Find Duplicate Subtrees","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":46906,"title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5870509621927177,"acs":33648,"articleLive":2,"columnArticles":317,"formTitle":"[653]Two Sum IV - Input is a BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":57317,"title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8096409165683521,"acs":48725,"articleLive":2,"columnArticles":515,"formTitle":"[654]Maximum Binary Tree","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":60181,"title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree"},{"acceptance":0.5934283182221011,"acs":8705,"articleLive":2,"columnArticles":127,"formTitle":"[655]Print Binary Tree","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":14669,"title":"Print Binary Tree","titleSlug":"print-binary-tree"},{"acceptance":0.30282258064516127,"acs":751,"articleLive":2,"columnArticles":22,"formTitle":"[656]Coin Path","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2480,"title":"Coin Path","titleSlug":"coin-path"},{"acceptance":0.7823442283005826,"acs":79228,"articleLive":2,"columnArticles":589,"formTitle":"[657]Robot Return to Origin","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":101270,"title":"Robot Return to Origin","titleSlug":"robot-return-to-origin"},{"acceptance":0.4516947105708075,"acs":22442,"articleLive":2,"columnArticles":198,"formTitle":"[658]Find K Closest Elements","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":49684,"title":"Find K Closest Elements","titleSlug":"find-k-closest-elements"},{"acceptance":0.5434223739706768,"acs":27057,"articleLive":2,"columnArticles":252,"formTitle":"[659]Split Array into Consecutive Subsequences","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":49790,"title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.638095238095238,"acs":603,"articleLive":2,"columnArticles":17,"formTitle":"[660]Remove 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":945,"title":"Remove 9","titleSlug":"remove-9"},{"acceptance":0.5593295266163197,"acs":15183,"articleLive":2,"columnArticles":182,"formTitle":"[661]Image Smoother","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":27145,"title":"Image Smoother","titleSlug":"image-smoother"},{"acceptance":0.402337436279995,"acs":22652,"articleLive":2,"columnArticles":229,"formTitle":"[662]Maximum Width of Binary Tree","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":56301,"title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46498111014240046,"acs":1600,"articleLive":2,"columnArticles":30,"formTitle":"[663]Equal Tree Partition","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3441,"title":"Equal Tree Partition","titleSlug":"equal-tree-partition"},{"acceptance":0.6570230090679169,"acs":21302,"articleLive":2,"columnArticles":184,"formTitle":"[664]Strange Printer","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","submitted":32422,"title":"Strange Printer","titleSlug":"strange-printer"},{"acceptance":0.2684333205961024,"acs":70249,"articleLive":2,"columnArticles":880,"formTitle":"[665]Non-decreasing Array","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":261700,"title":"Non-decreasing Array","titleSlug":"non-decreasing-array"},{"acceptance":0.6215017064846416,"acs":1821,"articleLive":2,"columnArticles":69,"formTitle":"[666]Path Sum IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":2930,"title":"Path Sum IV","titleSlug":"path-sum-iv"},{"acceptance":0.620994001713796,"acs":7247,"articleLive":2,"columnArticles":109,"formTitle":"[667]Beautiful Arrangement II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":11670,"title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5031311799604482,"acs":6106,"articleLive":2,"columnArticles":60,"formTitle":"[668]Kth Smallest Number in Multiplication Table","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":12136,"title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6667100779232055,"acs":30716,"articleLive":2,"columnArticles":263,"formTitle":"[669]Trim a Binary Search Tree","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":46071,"title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44159033777341156,"acs":15283,"articleLive":2,"columnArticles":239,"formTitle":"[670]Maximum Swap","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":34609,"title":"Maximum Swap","titleSlug":"maximum-swap"},{"acceptance":0.4622280933509467,"acs":26243,"articleLive":2,"columnArticles":368,"formTitle":"[671]Second Minimum Node In a Binary Tree","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"","submitted":56775,"title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5557665745856354,"acs":3219,"articleLive":2,"columnArticles":33,"formTitle":"[672]Bulb Switcher II","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":5792,"title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii"},{"acceptance":0.38108502024291496,"acs":23532,"articleLive":2,"columnArticles":227,"formTitle":"[673]Number of Longest Increasing Subsequence","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","submitted":61750,"title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4813701561804913,"acs":80074,"articleLive":2,"columnArticles":691,"formTitle":"[674]Longest Continuous Increasing Subsequence","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":166346,"title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3991468616697136,"acs":2620,"articleLive":2,"columnArticles":44,"formTitle":"[675]Cut Off Trees for Golf Event","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":6564,"title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5832747716092762,"acs":5810,"articleLive":2,"columnArticles":100,"formTitle":"[676]Implement Magic Dictionary","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":9961,"title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6119507416736636,"acs":13119,"articleLive":2,"columnArticles":210,"formTitle":"[677]Map Sum Pairs","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":21438,"title":"Map Sum Pairs","titleSlug":"map-sum-pairs"},{"acceptance":0.34645548545390814,"acs":15815,"articleLive":2,"columnArticles":188,"formTitle":"[678]Valid Parenthesis String","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":45648,"title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5421781910092074,"acs":24025,"articleLive":2,"columnArticles":248,"formTitle":"[679]24 Game","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":44312,"title":"24 Game","titleSlug":"24-game"},{"acceptance":0.4014859673045714,"acs":77435,"articleLive":2,"columnArticles":742,"formTitle":"[680]Valid Palindrome II","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":192871,"title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5003240440699935,"acs":2316,"articleLive":2,"columnArticles":57,"formTitle":"[681]Next Closest Time","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":4629,"title":"Next Closest Time","titleSlug":"next-closest-time"},{"acceptance":0.6941840165524376,"acs":42945,"articleLive":2,"columnArticles":470,"formTitle":"[682]Baseball Game","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"","submitted":61864,"title":"Baseball Game","titleSlug":"baseball-game"},{"acceptance":0.42096069868995634,"acs":1928,"articleLive":2,"columnArticles":43,"formTitle":"[683]K Empty Slots","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":4580,"title":"K Empty Slots","titleSlug":"k-empty-slots"},{"acceptance":0.6651470625172682,"acs":52963,"articleLive":2,"columnArticles":551,"formTitle":"[684]Redundant Connection","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":79626,"title":"Redundant Connection","titleSlug":"redundant-connection"},{"acceptance":0.43626416931315054,"acs":18820,"articleLive":2,"columnArticles":246,"formTitle":"[685]Redundant Connection II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":43139,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35327722968073655,"acs":16078,"articleLive":2,"columnArticles":175,"formTitle":"[686]Repeated String Match","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":45511,"title":"Repeated String Match","titleSlug":"repeated-string-match"},{"acceptance":0.43600627127069713,"acs":34206,"articleLive":2,"columnArticles":242,"formTitle":"[687]Longest Univalue Path","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":78453,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path"},{"acceptance":0.5095298602287166,"acs":7218,"articleLive":2,"columnArticles":96,"formTitle":"[688]Knight Probability in Chessboard","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":14166,"title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48107364074328973,"acs":2796,"articleLive":2,"columnArticles":59,"formTitle":"[689]Maximum Sum of 3 Non-Overlapping Subarrays","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":5812,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6453980733299362,"acs":53195,"articleLive":2,"columnArticles":538,"formTitle":"[690]Employee Importance","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"","submitted":82422,"title":"Employee Importance","titleSlug":"employee-importance"},{"acceptance":0.48377907896819117,"acs":3057,"articleLive":2,"columnArticles":37,"formTitle":"[691]Stickers to Spell Word","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":6319,"title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5840427149046136,"acs":61474,"articleLive":2,"columnArticles":687,"formTitle":"[692]Top K Frequent Words","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","submitted":105256,"title":"Top K Frequent Words","titleSlug":"top-k-frequent-words"},{"acceptance":0.6095431988802646,"acs":23952,"articleLive":2,"columnArticles":255,"formTitle":"[693]Binary Number with Alternating Bits","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":39295,"title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5301204819277109,"acs":3388,"articleLive":2,"columnArticles":64,"formTitle":"[694]Number of Distinct Islands","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":6391,"title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6555533769210485,"acs":96957,"articleLive":2,"columnArticles":994,"formTitle":"[695]Max Area of Island","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","submitted":147901,"title":"Max Area of Island","titleSlug":"max-area-of-island"},{"acceptance":0.6290559900875087,"acs":48738,"articleLive":2,"columnArticles":446,"formTitle":"[696]Count Binary Substrings","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":77478,"title":"Count Binary Substrings","titleSlug":"count-binary-substrings"},{"acceptance":0.6064668465690054,"acs":62927,"articleLive":2,"columnArticles":799,"formTitle":"[697]Degree of an Array","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":103760,"title":"Degree of an Array","titleSlug":"degree-of-an-array"},{"acceptance":0.4350663555490739,"acs":23866,"articleLive":2,"columnArticles":181,"formTitle":"[698]Partition to K Equal Sum Subsets","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":54856,"title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47141444114737885,"acs":2383,"articleLive":2,"columnArticles":33,"formTitle":"[699]Falling Squares","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5055,"title":"Falling Squares","titleSlug":"falling-squares"},{"acceptance":0.7574267187880616,"acs":65297,"articleLive":2,"columnArticles":413,"formTitle":"[700]Search in a Binary Search Tree","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":86209,"title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7243341390357014,"acs":62631,"articleLive":2,"columnArticles":470,"formTitle":"[701]Insert into a Binary Search Tree","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":86467,"title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7281690140845071,"acs":3619,"articleLive":2,"columnArticles":67,"formTitle":"[702]Search in a Sorted Array of Unknown Size","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":4970,"title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5111704576848697,"acs":55508,"articleLive":2,"columnArticles":514,"formTitle":"[703]Kth Largest Element in a Stream","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":108590,"title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5659362140332351,"acs":140415,"articleLive":2,"columnArticles":713,"formTitle":"[704]Binary Search","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","submitted":248111,"title":"Binary Search","titleSlug":"binary-search"},{"acceptance":0.6500705018199306,"acs":59473,"articleLive":2,"columnArticles":401,"formTitle":"[705]Design HashSet","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"","submitted":91487,"title":"Design HashSet","titleSlug":"design-hashset"},{"acceptance":0.6459844491989772,"acs":49516,"articleLive":2,"columnArticles":350,"formTitle":"[706]Design HashMap","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","submitted":76652,"title":"Design HashMap","titleSlug":"design-hashmap"},{"acceptance":0.31289431567499426,"acs":50636,"articleLive":2,"columnArticles":352,"formTitle":"[707]Design Linked List","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"","submitted":161831,"title":"Design Linked List","titleSlug":"design-linked-list"},{"acceptance":0.32831541218637994,"acs":1832,"articleLive":2,"columnArticles":43,"formTitle":"[708]Insert into a Sorted Circular Linked List","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":5580,"title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7608065277496797,"acs":67692,"articleLive":2,"columnArticles":470,"formTitle":"[709]To Lower Case","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":88974,"title":"To Lower Case","titleSlug":"to-lower-case"},{"acceptance":0.34324499030381384,"acs":4248,"articleLive":2,"columnArticles":48,"formTitle":"[710]Random Pick with Blacklist","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":12376,"title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5701438848920863,"acs":634,"articleLive":2,"columnArticles":22,"formTitle":"[711]Number of Distinct Islands II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1112,"title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6661335892105122,"acs":12496,"articleLive":2,"columnArticles":136,"formTitle":"[712]Minimum ASCII Delete Sum for Two Strings","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":18759,"title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.3839614834875498,"acs":15312,"articleLive":2,"columnArticles":128,"formTitle":"[713]Subarray Product Less Than K","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","submitted":39879,"title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7091923336091233,"acs":83145,"articleLive":2,"columnArticles":563,"formTitle":"[714]Best Time to Buy and Sell Stock with Transaction Fee","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":117239,"title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.3980897459001622,"acs":2209,"articleLive":2,"columnArticles":36,"formTitle":"[715]Range Module","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":5549,"title":"Range Module","titleSlug":"range-module"},{"acceptance":0.45971089165593243,"acs":3212,"articleLive":2,"columnArticles":60,"formTitle":"[716]Max Stack","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":6987,"title":"Max Stack","titleSlug":"max-stack"},{"acceptance":0.5083238967667788,"acs":30076,"articleLive":2,"columnArticles":355,"formTitle":"[717]1-bit and 2-bit Characters","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":59167,"title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5621093137133467,"acs":68072,"articleLive":2,"columnArticles":504,"formTitle":"[718]Maximum Length of Repeated Subarray","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":121101,"title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3611214087117702,"acs":7793,"articleLive":2,"columnArticles":70,"formTitle":"[719]Find K-th Smallest Pair Distance","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":21580,"title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48543577981651376,"acs":16932,"articleLive":2,"columnArticles":220,"formTitle":"[720]Longest Word in Dictionary","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":34880,"title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46937435188385757,"acs":27158,"articleLive":2,"columnArticles":321,"formTitle":"[721]Accounts Merge","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":57860,"title":"Accounts Merge","titleSlug":"accounts-merge"},{"acceptance":0.31657930638328424,"acs":4409,"articleLive":2,"columnArticles":67,"formTitle":"[722]Remove Comments","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":13927,"title":"Remove Comments","titleSlug":"remove-comments"},{"acceptance":0.7236762020693853,"acs":1189,"articleLive":2,"columnArticles":35,"formTitle":"[723]Candy Crush","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1643,"title":"Candy Crush","titleSlug":"candy-crush"},{"acceptance":0.44898252122737864,"acs":121989,"articleLive":2,"columnArticles":779,"formTitle":"[724]Find Pivot Index","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":271701,"title":"Find Pivot Index","titleSlug":"find-pivot-index"},{"acceptance":0.5619998980683961,"acs":22054,"articleLive":2,"columnArticles":292,"formTitle":"[725]Split Linked List in Parts","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"","submitted":39242,"title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.4611938141349906,"acs":6382,"articleLive":2,"columnArticles":142,"formTitle":"[726]Number of Atoms","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","submitted":13838,"title":"Number of Atoms","titleSlug":"number-of-atoms"},{"acceptance":0.4128926223520818,"acs":2261,"articleLive":2,"columnArticles":39,"formTitle":"[727]Minimum Window Subsequence","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":5476,"title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7583231735909218,"acs":32344,"articleLive":2,"columnArticles":283,"formTitle":"[728]Self Dividing Numbers","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":42652,"title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers"},{"acceptance":0.5060108430894947,"acs":6440,"articleLive":2,"columnArticles":73,"formTitle":"[729]My Calendar I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":12727,"title":"My Calendar I","titleSlug":"my-calendar-i"},{"acceptance":0.4846322722283205,"acs":3532,"articleLive":2,"columnArticles":43,"formTitle":"[730]Count Different Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7288,"title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5137350129002883,"acs":3385,"articleLive":2,"columnArticles":32,"formTitle":"[731]My Calendar II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":6589,"title":"My Calendar II","titleSlug":"my-calendar-ii"},{"acceptance":0.6079619212462137,"acs":2810,"articleLive":2,"columnArticles":44,"formTitle":"[732]My Calendar III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":4622,"title":"My Calendar III","titleSlug":"my-calendar-iii"},{"acceptance":0.5780895603782705,"acs":46642,"articleLive":2,"columnArticles":385,"formTitle":"[733]Flood Fill","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","submitted":80683,"title":"Flood Fill","titleSlug":"flood-fill"},{"acceptance":0.47681586705976947,"acs":1779,"articleLive":2,"columnArticles":31,"formTitle":"[734]Sentence Similarity","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":3731,"title":"Sentence Similarity","titleSlug":"sentence-similarity"},{"acceptance":0.40643206102881624,"acs":15557,"articleLive":2,"columnArticles":192,"formTitle":"[735]Asteroid Collision","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"","submitted":38277,"title":"Asteroid Collision","titleSlug":"asteroid-collision"},{"acceptance":0.45608220086178325,"acs":1376,"articleLive":2,"columnArticles":39,"formTitle":"[736]Parse Lisp Expression","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3017,"title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression"},{"acceptance":0.46237148732008226,"acs":3373,"articleLive":2,"columnArticles":55,"formTitle":"[737]Sentence Similarity II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":7295,"title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5012982146203057,"acs":37456,"articleLive":2,"columnArticles":550,"formTitle":"[738]Monotone Increasing Digits","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":74718,"title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6736001271407706,"acs":178015,"articleLive":2,"columnArticles":1332,"formTitle":"[739]Daily Temperatures","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"","submitted":264274,"title":"Daily Temperatures","titleSlug":"daily-temperatures"},{"acceptance":0.6263085161513214,"acs":36257,"articleLive":2,"columnArticles":431,"formTitle":"[740]Delete and Earn","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":57890,"title":"Delete and Earn","titleSlug":"delete-and-earn"},{"acceptance":0.3593765813176804,"acs":3551,"articleLive":2,"columnArticles":41,"formTitle":"[741]Cherry Pickup","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":9881,"title":"Cherry Pickup","titleSlug":"cherry-pickup"},{"acceptance":0.4921259842519685,"acs":1375,"articleLive":2,"columnArticles":41,"formTitle":"[742]Closest Leaf in a Binary Tree","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":2794,"title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.4813856227074835,"acs":28085,"articleLive":2,"columnArticles":258,"formTitle":"[743]Network Delay Time","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","submitted":58342,"title":"Network Delay Time","titleSlug":"network-delay-time"},{"acceptance":0.4570504057291209,"acs":36442,"articleLive":2,"columnArticles":321,"formTitle":"[744]Find Smallest Letter Greater Than Target","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":79733,"title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.386966640806827,"acs":2494,"articleLive":2,"columnArticles":46,"formTitle":"[745]Prefix and Suffix Search","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":6445,"title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5616293296901662,"acs":102362,"articleLive":2,"columnArticles":1044,"formTitle":"[746]Min Cost Climbing Stairs","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":182259,"title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41239704168020336,"acs":43159,"articleLive":2,"columnArticles":373,"formTitle":"[747]Largest Number At Least Twice of Others","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":104654,"title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5976515191406455,"acs":11350,"articleLive":2,"columnArticles":154,"formTitle":"[748]Shortest Completing Word","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":18991,"title":"Shortest Completing Word","titleSlug":"shortest-completing-word"},{"acceptance":0.502615518744551,"acs":1153,"articleLive":2,"columnArticles":30,"formTitle":"[749]Contain Virus","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2294,"title":"Contain Virus","titleSlug":"contain-virus"},{"acceptance":0.7306906416019616,"acs":1788,"articleLive":2,"columnArticles":40,"formTitle":"[750]Number Of Corner Rectangles","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2447,"title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5144397381594147,"acs":1336,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP to CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2597,"title":"IP to CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5333182506395642,"acs":61290,"articleLive":2,"columnArticles":534,"formTitle":"[752]Open the Lock","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","submitted":114922,"title":"Open the Lock","titleSlug":"open-the-lock"},{"acceptance":0.5827922077922078,"acs":2872,"articleLive":2,"columnArticles":37,"formTitle":"[753]Cracking the Safe","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":4928,"title":"Cracking the Safe","titleSlug":"cracking-the-safe"},{"acceptance":0.42512493537825263,"acs":7401,"articleLive":2,"columnArticles":85,"formTitle":"[754]Reach a Number","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":17409,"title":"Reach a Number","titleSlug":"reach-a-number"},{"acceptance":0.4985374007521939,"acs":1193,"articleLive":2,"columnArticles":29,"formTitle":"[755]Pour Water","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2393,"title":"Pour Water","titleSlug":"pour-water"},{"acceptance":0.5694975423265974,"acs":4171,"articleLive":2,"columnArticles":62,"formTitle":"[756]Pyramid Transition Matrix","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":7324,"title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4090995260663507,"acs":2158,"articleLive":2,"columnArticles":31,"formTitle":"[757]Set Intersection Size At Least Two","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5275,"title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45608292416803053,"acs":3344,"articleLive":2,"columnArticles":64,"formTitle":"[758]Bold Words in String","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7332,"title":"Bold Words in String","titleSlug":"bold-words-in-string"},{"acceptance":0.6540496540496541,"acs":1607,"articleLive":2,"columnArticles":42,"formTitle":"[759]Employee Free Time","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2457,"title":"Employee Free Time","titleSlug":"employee-free-time"},{"acceptance":0.8352941176470589,"acs":3692,"articleLive":2,"columnArticles":84,"formTitle":"[760]Find Anagram Mappings","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4420,"title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings"},{"acceptance":0.588163514338011,"acs":1928,"articleLive":2,"columnArticles":30,"formTitle":"[761]Special Binary String","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3278,"title":"Special Binary String","titleSlug":"special-binary-string"},{"acceptance":0.6957227937195453,"acs":16705,"articleLive":2,"columnArticles":129,"formTitle":"[762]Prime Number of Set Bits in Binary Representation","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":24011,"title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7612999869740784,"acs":70134,"articleLive":2,"columnArticles":862,"formTitle":"[763]Partition Labels","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":92124,"title":"Partition Labels","titleSlug":"partition-labels"},{"acceptance":0.4872854008003098,"acs":3775,"articleLive":2,"columnArticles":48,"formTitle":"[764]Largest Plus Sign","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":7747,"title":"Largest Plus Sign","titleSlug":"largest-plus-sign"},{"acceptance":0.6653600215596442,"acs":27158,"articleLive":2,"columnArticles":413,"formTitle":"[765]Couples Holding Hands","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":40817,"title":"Couples Holding Hands","titleSlug":"couples-holding-hands"},{"acceptance":0.7080402813299232,"acs":53154,"articleLive":2,"columnArticles":614,"formTitle":"[766]Toeplitz Matrix","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":75072,"title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"},{"acceptance":0.47675049527438834,"acs":37782,"articleLive":2,"columnArticles":473,"formTitle":"[767]Reorganize String","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":79249,"title":"Reorganize String","titleSlug":"reorganize-string"},{"acceptance":0.49554829257297417,"acs":4397,"articleLive":2,"columnArticles":70,"formTitle":"[768]Max Chunks To Make Sorted II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":8873,"title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5898138631951582,"acs":10330,"articleLive":2,"columnArticles":123,"formTitle":"[769]Max Chunks To Make Sorted","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":17514,"title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5436793422404933,"acs":1058,"articleLive":2,"columnArticles":22,"formTitle":"[770]Basic Calculator IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":1946,"title":"Basic Calculator IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8509690200694823,"acs":148192,"articleLive":2,"columnArticles":1063,"formTitle":"[771]Jewels and Stones","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":174145,"title":"Jewels and Stones","titleSlug":"jewels-and-stones"},{"acceptance":0.476859585339491,"acs":4853,"articleLive":2,"columnArticles":105,"formTitle":"[772]Basic Calculator III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":10177,"title":"Basic Calculator III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7167768293087986,"acs":21580,"articleLive":2,"columnArticles":307,"formTitle":"[773]Sliding Puzzle","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":30107,"title":"Sliding Puzzle","titleSlug":"sliding-puzzle"},{"acceptance":0.5875238701464036,"acs":923,"articleLive":2,"columnArticles":18,"formTitle":"[774]Minimize Max Distance to Gas Station","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1571,"title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4591455010828903,"acs":4664,"articleLive":2,"columnArticles":69,"formTitle":"[775]Global and Local Inversions","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10158,"title":"Global and Local Inversions","titleSlug":"global-and-local-inversions"},{"acceptance":0.5679096818337325,"acs":1660,"articleLive":2,"columnArticles":36,"formTitle":"[776]Split BST","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":2923,"title":"Split BST","titleSlug":"split-bst"},{"acceptance":0.3238611578488191,"acs":5197,"articleLive":2,"columnArticles":54,"formTitle":"[777]Swap Adjacent in LR String","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":16047,"title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5990566037735849,"acs":22098,"articleLive":2,"columnArticles":337,"formTitle":"[778]Swim in Rising Water","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":36888,"title":"Swim in Rising Water","titleSlug":"swim-in-rising-water"},{"acceptance":0.4345813544203091,"acs":18026,"articleLive":2,"columnArticles":222,"formTitle":"[779]K-th Symbol in Grammar","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":41479,"title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28329484218629714,"acs":2944,"articleLive":2,"columnArticles":47,"formTitle":"[780]Reaching Points","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":10392,"title":"Reaching Points","titleSlug":"reaching-points"},{"acceptance":0.6300258207303578,"acs":39284,"articleLive":2,"columnArticles":611,"formTitle":"[781]Rabbits in Forest","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":62353,"title":"Rabbits in Forest","titleSlug":"rabbits-in-forest"},{"acceptance":0.4188547927870927,"acs":1324,"articleLive":2,"columnArticles":27,"formTitle":"[782]Transform to Chessboard","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3161,"title":"Transform to Chessboard","titleSlug":"transform-to-chessboard"},{"acceptance":0.5949562028201111,"acs":66835,"articleLive":2,"columnArticles":644,"formTitle":"[783]Minimum Distance Between BST Nodes","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"","submitted":112336,"title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6753191241329732,"acs":34758,"articleLive":2,"columnArticles":378,"formTitle":"[784]Letter Case Permutation","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":51469,"title":"Letter Case Permutation","titleSlug":"letter-case-permutation"},{"acceptance":0.5083878743710846,"acs":36275,"articleLive":2,"columnArticles":377,"formTitle":"[785]Is Graph Bipartite?","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","submitted":71353,"title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite"},{"acceptance":0.45274183610597657,"acs":3674,"articleLive":2,"columnArticles":43,"formTitle":"[786]K-th Smallest Prime Fraction","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8115,"title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.36241444710150905,"acs":17580,"articleLive":2,"columnArticles":179,"formTitle":"[787]Cheapest Flights Within K Stops","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":48508,"title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6059081038226879,"acs":17578,"articleLive":2,"columnArticles":176,"formTitle":"[788]Rotated Digits","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":1,"nodeType":"def","questionId":"804","status":"","submitted":29011,"title":"Rotated Digits","titleSlug":"rotated-digits"},{"acceptance":0.6255060728744939,"acs":4017,"articleLive":2,"columnArticles":37,"formTitle":"[789]Escape The Ghosts","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","submitted":6422,"title":"Escape The Ghosts","titleSlug":"escape-the-ghosts"},{"acceptance":0.44427383237364043,"acs":3472,"articleLive":2,"columnArticles":54,"formTitle":"[790]Domino and Tromino Tiling","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":7815,"title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.692121375227074,"acs":10287,"articleLive":2,"columnArticles":181,"formTitle":"[791]Custom Sort String","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":14863,"title":"Custom Sort String","titleSlug":"custom-sort-string"},{"acceptance":0.44555484951764773,"acs":7713,"articleLive":2,"columnArticles":82,"formTitle":"[792]Number of Matching Subsequences","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":17311,"title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3914027149321267,"acs":4325,"articleLive":2,"columnArticles":61,"formTitle":"[793]Preimage Size of Factorial Zeroes Function","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":11050,"title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3397830108494575,"acs":6796,"articleLive":2,"columnArticles":90,"formTitle":"[794]Valid Tic-Tac-Toe State","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":20001,"title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5352199323285143,"acs":6960,"articleLive":2,"columnArticles":77,"formTitle":"[795]Number of Subarrays with Bounded Maximum","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":13004,"title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5175333757151939,"acs":20352,"articleLive":2,"columnArticles":224,"formTitle":"[796]Rotate String","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":39325,"title":"Rotate String","titleSlug":"rotate-string"},{"acceptance":0.7275399066443843,"acs":12625,"articleLive":2,"columnArticles":194,"formTitle":"[797]All Paths From Source to Target","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","submitted":17353,"title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4551333872271625,"acs":1126,"articleLive":2,"columnArticles":28,"formTitle":"[798]Smallest Rotation with Highest Score","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2474,"title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40238751147842056,"acs":4382,"articleLive":2,"columnArticles":61,"formTitle":"[799]Champagne Tower","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":10890,"title":"Champagne Tower","titleSlug":"champagne-tower"},{"acceptance":0.7037239868565169,"acs":1285,"articleLive":2,"columnArticles":33,"formTitle":"[800]Similar RGB Color","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":1826,"title":"Similar RGB Color","titleSlug":"similar-rgb-color"},{"acceptance":0.41165581514106986,"acs":6449,"articleLive":2,"columnArticles":80,"formTitle":"[801]Minimum Swaps To Make Sequences Increasing","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":15666,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.4883684127235322,"acs":9258,"articleLive":2,"columnArticles":125,"formTitle":"[802]Find Eventual Safe States","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","submitted":18957,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4850267598153368,"acs":11872,"articleLive":2,"columnArticles":121,"formTitle":"[803]Bricks Falling When Hit","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":24477,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7676184322119463,"acs":38014,"articleLive":2,"columnArticles":370,"formTitle":"[804]Unique Morse Code Words","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":49522,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"},{"acceptance":0.2887515451174289,"acs":2336,"articleLive":2,"columnArticles":37,"formTitle":"[805]Split Array With Same Average","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8090,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"},{"acceptance":0.657642715745546,"acs":12292,"articleLive":2,"columnArticles":135,"formTitle":"[806]Number of Lines To Write String","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":18691,"title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8403173538942899,"acs":15040,"articleLive":2,"columnArticles":189,"formTitle":"[807]Max Increase to Keep City Skyline","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":17898,"title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4771813667533696,"acs":4036,"articleLive":2,"columnArticles":39,"formTitle":"[808]Soup Servings","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":8458,"title":"Soup Servings","titleSlug":"soup-servings"},{"acceptance":0.4163854518185227,"acs":4442,"articleLive":2,"columnArticles":80,"formTitle":"[809]Expressive Words","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":10668,"title":"Expressive Words","titleSlug":"expressive-words"},{"acceptance":0.7380146386093321,"acs":16133,"articleLive":2,"columnArticles":130,"formTitle":"[810]Chalkboard XOR Game","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","submitted":21860,"title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7017527148028195,"acs":14734,"articleLive":2,"columnArticles":178,"formTitle":"[811]Subdomain Visit Count","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":1,"nodeType":"def","questionId":"829","status":"","submitted":20996,"title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"},{"acceptance":0.6280588309877013,"acs":9907,"articleLive":2,"columnArticles":84,"formTitle":"[812]Largest Triangle Area","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":15774,"title":"Largest Triangle Area","titleSlug":"largest-triangle-area"},{"acceptance":0.5430475344291426,"acs":6112,"articleLive":2,"columnArticles":75,"formTitle":"[813]Largest Sum of Averages","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":11255,"title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7014554852751139,"acs":20627,"articleLive":2,"columnArticles":311,"formTitle":"[814]Binary Tree Pruning","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":29406,"title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning"},{"acceptance":0.43404163906840193,"acs":24246,"articleLive":2,"columnArticles":297,"formTitle":"[815]Bus Routes","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","submitted":55861,"title":"Bus Routes","titleSlug":"bus-routes"},{"acceptance":0.5116719242902208,"acs":3244,"articleLive":2,"columnArticles":54,"formTitle":"[816]Ambiguous Coordinates","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6340,"title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"},{"acceptance":0.591083637725953,"acs":12622,"articleLive":2,"columnArticles":157,"formTitle":"[817]Linked List Components","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"","submitted":21354,"title":"Linked List Components","titleSlug":"linked-list-components"},{"acceptance":0.42613636363636365,"acs":3300,"articleLive":2,"columnArticles":40,"formTitle":"[818]Race Car","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":7744,"title":"Race Car","titleSlug":"race-car"},{"acceptance":0.42011025169864535,"acs":19662,"articleLive":2,"columnArticles":226,"formTitle":"[819]Most Common Word","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":46802,"title":"Most Common Word","titleSlug":"most-common-word"},{"acceptance":0.503862180117143,"acs":51271,"articleLive":2,"columnArticles":578,"formTitle":"[820]Short Encoding of Words","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":101756,"title":"Short Encoding of Words","titleSlug":"short-encoding-of-words"},{"acceptance":0.6895194050371852,"acs":22066,"articleLive":2,"columnArticles":295,"formTitle":"[821]Shortest Distance to a Character","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":32002,"title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.4963461538461538,"acs":2581,"articleLive":2,"columnArticles":31,"formTitle":"[822]Card Flipping Game","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5200,"title":"Card Flipping Game","titleSlug":"card-flipping-game"},{"acceptance":0.4262432795698925,"acs":2537,"articleLive":2,"columnArticles":41,"formTitle":"[823]Binary Trees With Factors","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":5952,"title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6129749551377077,"acs":15713,"articleLive":2,"columnArticles":223,"formTitle":"[824]Goat Latin","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":25634,"title":"Goat Latin","titleSlug":"goat-latin"},{"acceptance":0.38637725547639656,"acs":5803,"articleLive":2,"columnArticles":83,"formTitle":"[825]Friends Of Appropriate Ages","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":15019,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.371326004038591,"acs":6620,"articleLive":2,"columnArticles":96,"formTitle":"[826]Most Profit Assigning Work","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":17828,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3950740004417937,"acs":7154,"articleLive":2,"columnArticles":153,"formTitle":"[827]Making A Large Island","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":18108,"title":"Making A Large Island","titleSlug":"making-a-large-island"},{"acceptance":0.4797979797979798,"acs":2755,"articleLive":2,"columnArticles":46,"formTitle":"[828]Count Unique Characters of All Substrings of a Given String","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":5742,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3603481353235693,"acs":7701,"articleLive":2,"columnArticles":91,"formTitle":"[829]Consecutive Numbers Sum","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":21371,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5429822687459944,"acs":50834,"articleLive":2,"columnArticles":565,"formTitle":"[830]Positions of Large Groups","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":93620,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"},{"acceptance":0.40033695462731655,"acs":6891,"articleLive":2,"columnArticles":66,"formTitle":"[831]Masking Personal Information","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":17213,"title":"Masking Personal Information","titleSlug":"masking-personal-information"},{"acceptance":0.795365951054403,"acs":83655,"articleLive":2,"columnArticles":896,"formTitle":"[832]Flipping an Image","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":105178,"title":"Flipping an Image","titleSlug":"flipping-an-image"},{"acceptance":0.42401915638239085,"acs":4604,"articleLive":2,"columnArticles":67,"formTitle":"[833]Find And Replace in String","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":10858,"title":"Find And Replace in String","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5302476317101545,"acs":12762,"articleLive":2,"columnArticles":124,"formTitle":"[834]Sum of Distances in Tree","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":24068,"title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5741640468705345,"acs":4018,"articleLive":2,"columnArticles":43,"formTitle":"[835]Image Overlap","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":6998,"title":"Image Overlap","titleSlug":"image-overlap"},{"acceptance":0.4752799127682774,"acs":35742,"articleLive":2,"columnArticles":633,"formTitle":"[836]Rectangle Overlap","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":75202,"title":"Rectangle Overlap","titleSlug":"rectangle-overlap"},{"acceptance":0.3972634217672864,"acs":19017,"articleLive":2,"columnArticles":237,"formTitle":"[837]New 21 Game","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":47870,"title":"New 21 Game","titleSlug":"new-21-game"},{"acceptance":0.5,"acs":6369,"articleLive":2,"columnArticles":107,"formTitle":"[838]Push Dominoes","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":12738,"title":"Push Dominoes","titleSlug":"push-dominoes"},{"acceptance":0.5732896992364033,"acs":18394,"articleLive":2,"columnArticles":262,"formTitle":"[839]Similar String Groups","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":32085,"title":"Similar String Groups","titleSlug":"similar-string-groups"},{"acceptance":0.35737556187884034,"acs":8666,"articleLive":2,"columnArticles":106,"formTitle":"[840]Magic Squares In Grid","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24249,"title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6551046201376212,"acs":51315,"articleLive":2,"columnArticles":504,"formTitle":"[841]Keys and Rooms","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","submitted":78331,"title":"Keys and Rooms","titleSlug":"keys-and-rooms"},{"acceptance":0.49012729639809055,"acs":27106,"articleLive":2,"columnArticles":313,"formTitle":"[842]Split Array into Fibonacci Sequence","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":55304,"title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37836185819070906,"acs":2476,"articleLive":2,"columnArticles":31,"formTitle":"[843]Guess the Word","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":6544,"title":"Guess the Word","titleSlug":"guess-the-word"},{"acceptance":0.519314760339159,"acs":75028,"articleLive":2,"columnArticles":843,"formTitle":"[844]Backspace String Compare","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"","submitted":144475,"title":"Backspace String Compare","titleSlug":"backspace-string-compare"},{"acceptance":0.4195547744581137,"acs":35809,"articleLive":2,"columnArticles":524,"formTitle":"[845]Longest Mountain in Array","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":85350,"title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5099683850571004,"acs":7904,"articleLive":2,"columnArticles":106,"formTitle":"[846]Hand of Straights","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":15499,"title":"Hand of Straights","titleSlug":"hand-of-straights"},{"acceptance":0.5720231213872833,"acs":4948,"articleLive":2,"columnArticles":57,"formTitle":"[847]Shortest Path Visiting All Nodes","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","submitted":8650,"title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44317117514186544,"acs":8044,"articleLive":2,"columnArticles":89,"formTitle":"[848]Shifting Letters","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":18151,"title":"Shifting Letters","titleSlug":"shifting-letters"},{"acceptance":0.4234817813765182,"acs":15167,"articleLive":2,"columnArticles":166,"formTitle":"[849]Maximize Distance to Closest Person","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":35815,"title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.43787721123829343,"acs":2104,"articleLive":2,"columnArticles":36,"formTitle":"[850]Rectangle Area II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":4805,"title":"Rectangle Area II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4747766684182869,"acs":3614,"articleLive":2,"columnArticles":61,"formTitle":"[851]Loud and Rich","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":7612,"title":"Loud and Rich","titleSlug":"loud-and-rich"},{"acceptance":0.7161719763129019,"acs":78973,"articleLive":2,"columnArticles":676,"formTitle":"[852]Peak Index in a Mountain Array","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","submitted":110271,"title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3777369979563749,"acs":9057,"articleLive":2,"columnArticles":108,"formTitle":"[853]Car Fleet","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":23977,"title":"Car Fleet","titleSlug":"car-fleet"},{"acceptance":0.35981431199089076,"acs":4108,"articleLive":2,"columnArticles":61,"formTitle":"[854]K-Similar Strings","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":11417,"title":"K-Similar Strings","titleSlug":"k-similar-strings"},{"acceptance":0.41048082117774176,"acs":3799,"articleLive":2,"columnArticles":43,"formTitle":"[855]Exam Room","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":9255,"title":"Exam Room","titleSlug":"exam-room"},{"acceptance":0.6223224827120931,"acs":14759,"articleLive":2,"columnArticles":200,"formTitle":"[856]Score of Parentheses","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"","submitted":23716,"title":"Score of Parentheses","titleSlug":"score-of-parentheses"},{"acceptance":0.47088740792704314,"acs":2685,"articleLive":2,"columnArticles":43,"formTitle":"[857]Minimum Cost to Hire K Workers","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":5702,"title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5549182069258551,"acs":2612,"articleLive":2,"columnArticles":41,"formTitle":"[858]Mirror Reflection","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":4707,"title":"Mirror Reflection","titleSlug":"mirror-reflection"},{"acceptance":0.29942451497294875,"acs":26067,"articleLive":2,"columnArticles":334,"formTitle":"[859]Buddy Strings","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":87057,"title":"Buddy Strings","titleSlug":"buddy-strings"},{"acceptance":0.584115310440114,"acs":81171,"articleLive":2,"columnArticles":706,"formTitle":"[860]Lemonade Change","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":138964,"title":"Lemonade Change","titleSlug":"lemonade-change"},{"acceptance":0.8089712824028902,"acs":30677,"articleLive":2,"columnArticles":422,"formTitle":"[861]Score After Flipping Matrix","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":37921,"title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18067588207359492,"acs":14077,"articleLive":2,"columnArticles":117,"formTitle":"[862]Shortest Subarray with Sum at Least K","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":77913,"title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.5474173594421023,"acs":13894,"articleLive":2,"columnArticles":219,"formTitle":"[863]All Nodes Distance K in Binary Tree","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","submitted":25381,"title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4491899852724595,"acs":2745,"articleLive":2,"columnArticles":37,"formTitle":"[864]Shortest Path to Get All Keys","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6111,"title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6521209166260361,"acs":8025,"articleLive":2,"columnArticles":114,"formTitle":"[865]Smallest Subtree with all the Deepest Nodes","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":12306,"title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22106801359636583,"acs":6959,"articleLive":2,"columnArticles":79,"formTitle":"[866]Prime Palindrome","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":31479,"title":"Prime Palindrome","titleSlug":"prime-palindrome"},{"acceptance":0.6710506786285602,"acs":81381,"articleLive":2,"columnArticles":726,"formTitle":"[867]Transpose Matrix","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":121274,"title":"Transpose Matrix","titleSlug":"transpose-matrix"},{"acceptance":0.6227753679004338,"acs":15362,"articleLive":2,"columnArticles":210,"formTitle":"[868]Binary Gap","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":24667,"title":"Binary Gap","titleSlug":"binary-gap"},{"acceptance":0.5445826607159814,"acs":5735,"articleLive":2,"columnArticles":81,"formTitle":"[869]Reordered Power of 2","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":10531,"title":"Reordered Power of 2","titleSlug":"reordered-power-of-2"},{"acceptance":0.4179757139493424,"acs":12426,"articleLive":2,"columnArticles":163,"formTitle":"[870]Advantage Shuffle","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","submitted":29729,"title":"Advantage Shuffle","titleSlug":"advantage-shuffle"},{"acceptance":0.3350634371395617,"acs":8134,"articleLive":2,"columnArticles":108,"formTitle":"[871]Minimum Number of Refueling Stops","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":24276,"title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521210498722797,"acs":58462,"articleLive":2,"columnArticles":689,"formTitle":"[872]Leaf-Similar Trees","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","submitted":89649,"title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees"},{"acceptance":0.5067516310119861,"acs":13360,"articleLive":2,"columnArticles":92,"formTitle":"[873]Length of Longest Fibonacci Subsequence","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":26364,"title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41220189302030735,"acs":18857,"articleLive":2,"columnArticles":199,"formTitle":"[874]Walking Robot Simulation","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":45747,"title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation"},{"acceptance":0.47444657371307736,"acs":35899,"articleLive":2,"columnArticles":274,"formTitle":"[875]Koko Eating Bananas","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":75665,"title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas"},{"acceptance":0.7018786533712607,"acs":112269,"articleLive":2,"columnArticles":1351,"formTitle":"[876]Middle of the Linked List","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"","submitted":159955,"title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7554513426014092,"acs":63470,"articleLive":2,"columnArticles":462,"formTitle":"[877]Stone Game","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","submitted":84016,"title":"Stone Game","titleSlug":"stone-game"},{"acceptance":0.27553966726247764,"acs":4008,"articleLive":2,"columnArticles":57,"formTitle":"[878]Nth Magical Number","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":14546,"title":"Nth Magical Number","titleSlug":"nth-magical-number"},{"acceptance":0.5567375886524822,"acs":20096,"articleLive":2,"columnArticles":175,"formTitle":"[879]Profitable Schemes","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","submitted":36096,"title":"Profitable Schemes","titleSlug":"profitable-schemes"},{"acceptance":0.2519228174335447,"acs":5601,"articleLive":2,"columnArticles":69,"formTitle":"[880]Decoded String at Index","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"","submitted":22233,"title":"Decoded String at Index","titleSlug":"decoded-string-at-index"},{"acceptance":0.47512342292923754,"acs":17323,"articleLive":2,"columnArticles":164,"formTitle":"[881]Boats to Save People","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":36460,"title":"Boats to Save People","titleSlug":"boats-to-save-people"},{"acceptance":0.47698882314266927,"acs":1451,"articleLive":2,"columnArticles":26,"formTitle":"[882]Reachable Nodes In Subdivided Graph","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3042,"title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6826480930484177,"acs":10095,"articleLive":2,"columnArticles":94,"formTitle":"[883]Projection Area of 3D Shapes","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":14788,"title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6574496249448448,"acs":17880,"articleLive":2,"columnArticles":221,"formTitle":"[884]Uncommon Words from Two Sentences","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":27196,"title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6904004020773999,"acs":4121,"articleLive":2,"columnArticles":63,"formTitle":"[885]Spiral Matrix III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":5969,"title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.41706507677597165,"acs":7415,"articleLive":2,"columnArticles":98,"formTitle":"[886]Possible Bipartition","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":17779,"title":"Possible Bipartition","titleSlug":"possible-bipartition"},{"acceptance":0.28986504664243307,"acs":46330,"articleLive":2,"columnArticles":299,"formTitle":"[887]Super Egg Drop","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":159833,"title":"Super Egg Drop","titleSlug":"super-egg-drop"},{"acceptance":0.6392801059966631,"acs":52109,"articleLive":2,"columnArticles":432,"formTitle":"[888]Fair Candy Swap","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":81512,"title":"Fair Candy Swap","titleSlug":"fair-candy-swap"},{"acceptance":0.6812625715611945,"acs":13209,"articleLive":2,"columnArticles":132,"formTitle":"[889]Construct Binary Tree from Preorder and Postorder Traversal","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":19389,"title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.72285989660913,"acs":8250,"articleLive":2,"columnArticles":114,"formTitle":"[890]Find and Replace Pattern","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11413,"title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern"},{"acceptance":0.32137948269398975,"acs":2572,"articleLive":2,"columnArticles":33,"formTitle":"[891]Sum of Subsequence Widths","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8003,"title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387285506734205,"acs":32533,"articleLive":2,"columnArticles":663,"formTitle":"[892]Surface Area of 3D Shapes","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":50934,"title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7226926037366175,"acs":10328,"articleLive":2,"columnArticles":95,"formTitle":"[893]Groups of Special-Equivalent Strings","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":1,"nodeType":"def","questionId":"929","status":"","submitted":14291,"title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7747394157766053,"acs":12041,"articleLive":2,"columnArticles":110,"formTitle":"[894]All Possible Full Binary Trees","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":15542,"title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5269267364414844,"acs":5538,"articleLive":2,"columnArticles":65,"formTitle":"[895]Maximum Frequency Stack","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":10510,"title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5872968463550786,"acs":57023,"articleLive":2,"columnArticles":693,"formTitle":"[896]Monotonic Array","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":97094,"title":"Monotonic Array","titleSlug":"monotonic-array"},{"acceptance":0.7466392335559118,"acs":59151,"articleLive":2,"columnArticles":679,"formTitle":"[897]Increasing Order Search Tree","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"","submitted":79223,"title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3277076411960133,"acs":4932,"articleLive":2,"columnArticles":33,"formTitle":"[898]Bitwise ORs of Subarrays","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15050,"title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5340522133938707,"acs":3764,"articleLive":2,"columnArticles":37,"formTitle":"[899]Orderly Queue","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7048,"title":"Orderly Queue","titleSlug":"orderly-queue"},{"acceptance":0.4865314266711008,"acs":2926,"articleLive":2,"columnArticles":36,"formTitle":"[900]RLE Iterator","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6014,"title":"RLE Iterator","titleSlug":"rle-iterator"},{"acceptance":0.5335692653214006,"acs":15680,"articleLive":2,"columnArticles":198,"formTitle":"[901]Online Stock Span","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"","submitted":29387,"title":"Online Stock Span","titleSlug":"online-stock-span"},{"acceptance":0.3222830168436863,"acs":3004,"articleLive":2,"columnArticles":69,"formTitle":"[902]Numbers At Most N Given Digit Set","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9321,"title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.52832347892428,"acs":2770,"articleLive":2,"columnArticles":38,"formTitle":"[903]Valid Permutations for DI Sequence","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5243,"title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4489487675205413,"acs":14862,"articleLive":2,"columnArticles":216,"formTitle":"[904]Fruit Into Baskets","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":33104,"title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets"},{"acceptance":0.7012479596951431,"acs":54562,"articleLive":2,"columnArticles":547,"formTitle":"[905]Sort Array By Parity","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":77807,"title":"Sort Array By Parity","titleSlug":"sort-array-by-parity"},{"acceptance":0.2704067704067704,"acs":1981,"articleLive":2,"columnArticles":34,"formTitle":"[906]Super Palindromes","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7326,"title":"Super Palindromes","titleSlug":"super-palindromes"},{"acceptance":0.3111531554643407,"acs":9703,"articleLive":2,"columnArticles":108,"formTitle":"[907]Sum of Subarray Minimums","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"","submitted":31184,"title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6958840914005623,"acs":19308,"articleLive":2,"columnArticles":172,"formTitle":"[908]Smallest Range I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":27746,"title":"Smallest Range I","titleSlug":"smallest-range-i"},{"acceptance":0.46223502167329733,"acs":15569,"articleLive":2,"columnArticles":186,"formTitle":"[909]Snakes and Ladders","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","submitted":33682,"title":"Snakes and Ladders","titleSlug":"snakes-and-ladders"},{"acceptance":0.31489801187709787,"acs":6098,"articleLive":2,"columnArticles":63,"formTitle":"[910]Smallest Range II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":19365,"title":"Smallest Range II","titleSlug":"smallest-range-ii"},{"acceptance":0.4396896896896897,"acs":3514,"articleLive":2,"columnArticles":57,"formTitle":"[911]Online Election","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":7992,"title":"Online Election","titleSlug":"online-election"},{"acceptance":0.5764548188612015,"acs":171165,"articleLive":2,"columnArticles":881,"formTitle":"[912]Sort an Array","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","submitted":296927,"title":"Sort an Array","titleSlug":"sort-an-array"},{"acceptance":0.386743084973835,"acs":1552,"articleLive":2,"columnArticles":32,"formTitle":"[913]Cat and Mouse","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4013,"title":"Cat and Mouse","titleSlug":"cat-and-mouse"},{"acceptance":0.3885983177845912,"acs":47402,"articleLive":2,"columnArticles":595,"formTitle":"[914]X of a Kind in a Deck of Cards","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"","submitted":121982,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46296192765695754,"acs":8281,"articleLive":2,"columnArticles":100,"formTitle":"[915]Partition Array into Disjoint Intervals","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":17887,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4381865093991891,"acs":5944,"articleLive":2,"columnArticles":64,"formTitle":"[916]Word Subsets","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":13565,"title":"Word Subsets","titleSlug":"word-subsets"},{"acceptance":0.5683605186114596,"acs":27179,"articleLive":2,"columnArticles":404,"formTitle":"[917]Reverse Only Letters","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":47820,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters"},{"acceptance":0.352450793870421,"acs":10189,"articleLive":2,"columnArticles":114,"formTitle":"[918]Maximum Sum Circular Subarray","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":28909,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6239647341704515,"acs":4671,"articleLive":2,"columnArticles":86,"formTitle":"[919]Complete Binary Tree Inserter","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":7486,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4733829421866056,"acs":1654,"articleLive":2,"columnArticles":17,"formTitle":"[920]Number of Music Playlists","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3494,"title":"Number of Music Playlists","titleSlug":"number-of-music-playlists"},{"acceptance":0.7343333204469015,"acs":18995,"articleLive":2,"columnArticles":278,"formTitle":"[921]Minimum Add to Make Parentheses Valid","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"","submitted":25867,"title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7144532082711575,"acs":87139,"articleLive":2,"columnArticles":793,"formTitle":"[922]Sort Array By Parity II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"","submitted":121966,"title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3344098649442161,"acs":5695,"articleLive":2,"columnArticles":71,"formTitle":"[923]3Sum With Multiplicity","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":17030,"title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3645649184835985,"acs":5568,"articleLive":2,"columnArticles":86,"formTitle":"[924]Minimize Malware Spread","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":15273,"title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread"},{"acceptance":0.3892362554770205,"acs":48681,"articleLive":2,"columnArticles":655,"formTitle":"[925]Long Pressed Name","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":125068,"title":"Long Pressed Name","titleSlug":"long-pressed-name"},{"acceptance":0.505522361035669,"acs":5584,"articleLive":2,"columnArticles":98,"formTitle":"[926]Flip String to Monotone Increasing","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":11046,"title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33085896076352067,"acs":3120,"articleLive":2,"columnArticles":59,"formTitle":"[927]Three Equal Parts","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":9430,"title":"Three Equal Parts","titleSlug":"three-equal-parts"},{"acceptance":0.41927512355848434,"acs":2036,"articleLive":2,"columnArticles":38,"formTitle":"[928]Minimize Malware Spread II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":4856,"title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6415264822344469,"acs":24140,"articleLive":2,"columnArticles":212,"formTitle":"[929]Unique Email Addresses","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":37629,"title":"Unique Email Addresses","titleSlug":"unique-email-addresses"},{"acceptance":0.4132231404958678,"acs":7150,"articleLive":2,"columnArticles":105,"formTitle":"[930]Binary Subarrays With Sum","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","submitted":17303,"title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6456238911886458,"acs":13101,"articleLive":2,"columnArticles":169,"formTitle":"[931]Minimum Falling Path Sum","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":20292,"title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6172317578422254,"acs":7300,"articleLive":2,"columnArticles":67,"formTitle":"[932]Beautiful Array","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":11827,"title":"Beautiful Array","titleSlug":"beautiful-array"},{"acceptance":0.7204973194935553,"acs":31583,"articleLive":2,"columnArticles":273,"formTitle":"[933]Number of Recent Calls","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":43835,"title":"Number of Recent Calls","titleSlug":"number-of-recent-calls"},{"acceptance":0.47409378451651774,"acs":18886,"articleLive":2,"columnArticles":213,"formTitle":"[934]Shortest Bridge","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":39836,"title":"Shortest Bridge","titleSlug":"shortest-bridge"},{"acceptance":0.47079182846530476,"acs":5577,"articleLive":2,"columnArticles":75,"formTitle":"[935]Knight Dialer","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":11846,"title":"Knight Dialer","titleSlug":"knight-dialer"},{"acceptance":0.376984126984127,"acs":1425,"articleLive":2,"columnArticles":21,"formTitle":"[936]Stamping The Sequence","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":3780,"title":"Stamping The Sequence","titleSlug":"stamping-the-sequence"},{"acceptance":0.5884644934694325,"acs":10723,"articleLive":2,"columnArticles":109,"formTitle":"[937]Reorder Data in Log Files","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":18222,"title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8177344680100533,"acs":92727,"articleLive":2,"columnArticles":764,"formTitle":"[938]Range Sum of BST","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"","submitted":113395,"title":"Range Sum of BST","titleSlug":"range-sum-of-bst"},{"acceptance":0.4472750432171777,"acs":4916,"articleLive":2,"columnArticles":50,"formTitle":"[939]Minimum Area Rectangle","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":10991,"title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4122228879568604,"acs":4128,"articleLive":2,"columnArticles":50,"formTitle":"[940]Distinct Subsequences II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":10014,"title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39247477294009026,"acs":59936,"articleLive":2,"columnArticles":593,"formTitle":"[941]Valid Mountain Array","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":152713,"title":"Valid Mountain Array","titleSlug":"valid-mountain-array"},{"acceptance":0.726902783046522,"acs":21078,"articleLive":2,"columnArticles":185,"formTitle":"[942]DI String Match","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":28997,"title":"DI String Match","titleSlug":"di-string-match"},{"acceptance":0.47196128664958725,"acs":1658,"articleLive":2,"columnArticles":40,"formTitle":"[943]Find the Shortest Superstring","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3513,"title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6914053148192483,"acs":20216,"articleLive":2,"columnArticles":161,"formTitle":"[944]Delete Columns to Make Sorted","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":29239,"title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4870768316663602,"acs":34430,"articleLive":2,"columnArticles":526,"formTitle":"[945]Minimum Increment to Make Array Unique","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":70687,"title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6181636111539054,"acs":24075,"articleLive":2,"columnArticles":272,"formTitle":"[946]Validate Stack Sequences","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"","submitted":38946,"title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125070755297418,"acs":24888,"articleLive":2,"columnArticles":325,"formTitle":"[947]Most Stones Removed with Same Row or Column","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":40633,"title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.38950021515952543,"acs":6336,"articleLive":2,"columnArticles":90,"formTitle":"[948]Bag of Tokens","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":16267,"title":"Bag of Tokens","titleSlug":"bag-of-tokens"},{"acceptance":0.36883957906766346,"acs":7746,"articleLive":2,"columnArticles":112,"formTitle":"[949]Largest Time for Given Digits","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":21001,"title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.775532727735801,"acs":9135,"articleLive":2,"columnArticles":128,"formTitle":"[950]Reveal Cards In Increasing Order","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":11779,"title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6584570325500899,"acs":9892,"articleLive":2,"columnArticles":155,"formTitle":"[951]Flip Equivalent Binary Trees","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":15023,"title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3456140350877193,"acs":2758,"articleLive":2,"columnArticles":49,"formTitle":"[952]Largest Component Size by Common Factor","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":7980,"title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5521847407742811,"acs":12195,"articleLive":2,"columnArticles":142,"formTitle":"[953]Verifying an Alien Dictionary","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":22085,"title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2960138806447194,"acs":6483,"articleLive":2,"columnArticles":96,"formTitle":"[954]Array of Doubled Pairs","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":21901,"title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32453855735477294,"acs":2866,"articleLive":2,"columnArticles":44,"formTitle":"[955]Delete Columns to Make Sorted II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":8831,"title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4299681941335846,"acs":3650,"articleLive":2,"columnArticles":46,"formTitle":"[956]Tallest Billboard","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":8489,"title":"Tallest Billboard","titleSlug":"tallest-billboard"},{"acceptance":0.3575757575757576,"acs":13157,"articleLive":2,"columnArticles":127,"formTitle":"[957]Prison Cells After N Days","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":36795,"title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.529866439329355,"acs":18646,"articleLive":2,"columnArticles":190,"formTitle":"[958]Check Completeness of a Binary Tree","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":35190,"title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.743478430912433,"acs":19010,"articleLive":2,"columnArticles":296,"formTitle":"[959]Regions Cut By Slashes","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":25569,"title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5490254872563718,"acs":1831,"articleLive":2,"columnArticles":26,"formTitle":"[960]Delete Columns to Make Sorted III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3335,"title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6762857761931964,"acs":34333,"articleLive":2,"columnArticles":267,"formTitle":"[961]N-Repeated Element in Size 2N Array","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":50767,"title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.43698835466389946,"acs":11370,"articleLive":2,"columnArticles":110,"formTitle":"[962]Maximum Width Ramp","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":26019,"title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp"},{"acceptance":0.5012760527435134,"acs":2357,"articleLive":2,"columnArticles":29,"formTitle":"[963]Minimum Area Rectangle II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4702,"title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4231012658227848,"acs":1337,"articleLive":2,"columnArticles":24,"formTitle":"[964]Least Operators to Express Number","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3160,"title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6815505065318923,"acs":30207,"articleLive":2,"columnArticles":356,"formTitle":"[965]Univalued Binary Tree","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":44321,"title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree"},{"acceptance":0.4005305039787798,"acs":2869,"articleLive":2,"columnArticles":45,"formTitle":"[966]Vowel Spellchecker","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7163,"title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"},{"acceptance":0.4507839437902544,"acs":6929,"articleLive":2,"columnArticles":133,"formTitle":"[967]Numbers With Same Consecutive Differences","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":15371,"title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4927860696517413,"acs":21791,"articleLive":2,"columnArticles":299,"formTitle":"[968]Binary Tree Cameras","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":44220,"title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras"},{"acceptance":0.6522303403191694,"acs":13569,"articleLive":2,"columnArticles":175,"formTitle":"[969]Pancake Sorting","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":20804,"title":"Pancake Sorting","titleSlug":"pancake-sorting"},{"acceptance":0.41294117647058826,"acs":10530,"articleLive":2,"columnArticles":118,"formTitle":"[970]Powerful Integers","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":25500,"title":"Powerful Integers","titleSlug":"powerful-integers"},{"acceptance":0.4403584229390681,"acs":6143,"articleLive":2,"columnArticles":91,"formTitle":"[971]Flip Binary Tree To Match Preorder Traversal","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":13950,"title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40233436319945076,"acs":1172,"articleLive":2,"columnArticles":25,"formTitle":"[972]Equal Rational Numbers","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":2913,"title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers"},{"acceptance":0.6366250227792739,"acs":62882,"articleLive":2,"columnArticles":599,"formTitle":"[973]K Closest Points to Origin","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","submitted":98774,"title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4640096417587898,"acs":33495,"articleLive":2,"columnArticles":359,"formTitle":"[974]Subarray Sums Divisible by K","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":72186,"title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4411670407181789,"acs":2752,"articleLive":2,"columnArticles":40,"formTitle":"[975]Odd Even Jump","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6238,"title":"Odd Even Jump","titleSlug":"odd-even-jump"},{"acceptance":0.5966698039762494,"acs":51350,"articleLive":2,"columnArticles":464,"formTitle":"[976]Largest Perimeter Triangle","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":86061,"title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7301033703097131,"acs":110112,"articleLive":2,"columnArticles":867,"formTitle":"[977]Squares of a Sorted Array","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","submitted":150817,"title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47303965954364363,"acs":41794,"articleLive":2,"columnArticles":580,"formTitle":"[978]Longest Turbulent Subarray","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":88352,"title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7098046409245162,"acs":7739,"articleLive":2,"columnArticles":123,"formTitle":"[979]Distribute Coins in Binary Tree","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":10903,"title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7312319259687681,"acs":12643,"articleLive":2,"columnArticles":188,"formTitle":"[980]Unique Paths III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":17290,"title":"Unique Paths III","titleSlug":"unique-paths-iii"},{"acceptance":0.43343108504398825,"acs":3695,"articleLive":2,"columnArticles":52,"formTitle":"[981]Time Based Key-Value Store","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","submitted":8525,"title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store"},{"acceptance":0.5322161907009677,"acs":2255,"articleLive":2,"columnArticles":23,"formTitle":"[982]Triples with Bitwise AND Equal To Zero","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4237,"title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6326049655799723,"acs":30601,"articleLive":2,"columnArticles":437,"formTitle":"[983]Minimum Cost For Tickets","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":48373,"title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41353156863729973,"acs":8233,"articleLive":2,"columnArticles":132,"formTitle":"[984]String Without AAA or BBB","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":19909,"title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5975043194471108,"acs":15562,"articleLive":2,"columnArticles":173,"formTitle":"[985]Sum of Even Numbers After Queries","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":1,"nodeType":"def","questionId":"1027","status":"","submitted":26045,"title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6675080855091898,"acs":16924,"articleLive":2,"columnArticles":156,"formTitle":"[986]Interval List Intersections","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","submitted":25354,"title":"Interval List Intersections","titleSlug":"interval-list-intersections"},{"acceptance":0.4377550449997205,"acs":7831,"articleLive":2,"columnArticles":157,"formTitle":"[987]Vertical Order Traversal of a Binary Tree","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"","submitted":17889,"title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.48932594759444825,"acs":7862,"articleLive":2,"columnArticles":95,"formTitle":"[988]Smallest String Starting From Leaf","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":16067,"title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47435356807421747,"acs":49495,"articleLive":2,"columnArticles":555,"formTitle":"[989]Add to Array-Form of Integer","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":104342,"title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.49411669236387246,"acs":30445,"articleLive":2,"columnArticles":464,"formTitle":"[990]Satisfiability of Equality Equations","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":61615,"title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.516139362110926,"acs":8059,"articleLive":2,"columnArticles":103,"formTitle":"[991]Broken Calculator","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":15614,"title":"Broken Calculator","titleSlug":"broken-calculator"},{"acceptance":0.44982165043485234,"acs":22447,"articleLive":2,"columnArticles":261,"formTitle":"[992]Subarrays with K Different Integers","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":49902,"title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5574991380301115,"acs":48508,"articleLive":2,"columnArticles":766,"formTitle":"[993]Cousins in Binary Tree","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","submitted":87010,"title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.506382477626001,"acs":43002,"articleLive":2,"columnArticles":1232,"formTitle":"[994]Rotting Oranges","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","submitted":84920,"title":"Rotting Oranges","titleSlug":"rotting-oranges"},{"acceptance":0.541090739348046,"acs":20865,"articleLive":2,"columnArticles":251,"formTitle":"[995]Minimum Number of K Consecutive Bit Flips","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":38561,"title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49150343754053705,"acs":3789,"articleLive":2,"columnArticles":77,"formTitle":"[996]Number of Squareful Arrays","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":7709,"title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5131776616590463,"acs":31427,"articleLive":2,"columnArticles":320,"formTitle":"[997]Find the Town Judge","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":61240,"title":"Find the Town Judge","titleSlug":"find-the-town-judge"},{"acceptance":0.6114160263446762,"acs":7241,"articleLive":2,"columnArticles":104,"formTitle":"[998]Maximum Binary Tree II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":11843,"title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6915724850006977,"acs":29739,"articleLive":2,"columnArticles":561,"formTitle":"[999]Available Captures for Rook","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43002,"title":"Available Captures for Rook","titleSlug":"available-captures-for-rook"},{"acceptance":0.3983268983268983,"acs":3095,"articleLive":2,"columnArticles":34,"formTitle":"[1000]Minimum Cost to Merge Stones","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":7770,"title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.291549086588445,"acs":1963,"articleLive":2,"columnArticles":49,"formTitle":"[1001]Grid Illumination","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":6733,"title":"Grid Illumination","titleSlug":"grid-illumination"},{"acceptance":0.7394795205075657,"acs":52682,"articleLive":2,"columnArticles":561,"formTitle":"[1002]Find Common Characters","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":71242,"title":"Find Common Characters","titleSlug":"find-common-characters"},{"acceptance":0.5754878294105814,"acs":11443,"articleLive":2,"columnArticles":174,"formTitle":"[1003]Check If Word Is Valid After Substitutions","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"","submitted":19884,"title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5993946020368908,"acs":59207,"articleLive":2,"columnArticles":652,"formTitle":"[1004]Max Consecutive Ones III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":98778,"title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5405845434731231,"acs":20586,"articleLive":2,"columnArticles":348,"formTitle":"[1005]Maximize Sum Of Array After K Negations","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":38081,"title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6275463229370468,"acs":43622,"articleLive":2,"columnArticles":585,"formTitle":"[1006]Clumsy Factorial","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"","submitted":69512,"title":"Clumsy Factorial","titleSlug":"clumsy-factorial"},{"acceptance":0.4619590688954851,"acs":5914,"articleLive":2,"columnArticles":75,"formTitle":"[1007]Minimum Domino Rotations For Equal Row","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":12802,"title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7289540816326531,"acs":14859,"articleLive":2,"columnArticles":193,"formTitle":"[1008]Construct Binary Search Tree from Preorder Traversal","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":20384,"title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928538822260032,"acs":14286,"articleLive":2,"columnArticles":195,"formTitle":"[1009]Complement of Base 10 Integer","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":24097,"title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.44732770210283335,"acs":17635,"articleLive":2,"columnArticles":227,"formTitle":"[1010]Pairs of Songs With Total Durations Divisible by 60","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":39423,"title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6277687240342461,"acs":54700,"articleLive":2,"columnArticles":530,"formTitle":"[1011]Capacity To Ship Packages Within D Days","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"","submitted":87134,"title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3263473053892216,"acs":2834,"articleLive":2,"columnArticles":62,"formTitle":"[1012]Numbers With Repeated Digits","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":8684,"title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3999607146364765,"acs":44796,"articleLive":2,"columnArticles":893,"formTitle":"[1013]Partition Array Into Three Parts With Equal Sum","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":112001,"title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5362068965517242,"acs":30478,"articleLive":2,"columnArticles":354,"formTitle":"[1014]Best Sightseeing Pair","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":56840,"title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35170867481057677,"acs":4549,"articleLive":2,"columnArticles":40,"formTitle":"[1015]Smallest Integer Divisible by K","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":12934,"title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5843922320786382,"acs":4875,"articleLive":2,"columnArticles":74,"formTitle":"[1016]Binary String With Substrings Representing 1 To N","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8342,"title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5611535199321459,"acs":3308,"articleLive":2,"columnArticles":51,"formTitle":"[1017]Convert to Base -2","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":5895,"title":"Convert to Base -2","titleSlug":"convert-to-base-2"},{"acceptance":0.5170250357567817,"acs":43017,"articleLive":2,"columnArticles":365,"formTitle":"[1018]Binary Prefix Divisible By 5","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":83201,"title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5946835362152145,"acs":18613,"articleLive":2,"columnArticles":237,"formTitle":"[1019]Next Greater Node In Linked List","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"","submitted":31299,"title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5328182734296272,"acs":7931,"articleLive":2,"columnArticles":114,"formTitle":"[1020]Number of Enclaves","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":14885,"title":"Number of Enclaves","titleSlug":"number-of-enclaves"},{"acceptance":0.7833641404805914,"acs":55094,"articleLive":2,"columnArticles":626,"formTitle":"[1021]Remove Outermost Parentheses","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"","submitted":70330,"title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.6993798449612403,"acs":18044,"articleLive":2,"columnArticles":239,"formTitle":"[1022]Sum of Root To Leaf Binary Numbers","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":25800,"title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5613199223575084,"acs":6362,"articleLive":2,"columnArticles":134,"formTitle":"[1023]Camelcase Matching","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":11334,"title":"Camelcase Matching","titleSlug":"camelcase-matching"},{"acceptance":0.563679925061248,"acs":31291,"articleLive":2,"columnArticles":360,"formTitle":"[1024]Video Stitching","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":55512,"title":"Video Stitching","titleSlug":"video-stitching"},{"acceptance":0.7091809225037988,"acs":72340,"articleLive":2,"columnArticles":613,"formTitle":"[1025]Divisor Game","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":102005,"title":"Divisor Game","titleSlug":"divisor-game"},{"acceptance":0.6643741403026134,"acs":9177,"articleLive":2,"columnArticles":157,"formTitle":"[1026]Maximum Difference Between Node and Ancestor","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":13813,"title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43226913322392957,"acs":11590,"articleLive":2,"columnArticles":110,"formTitle":"[1027]Longest Arithmetic Subsequence","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","submitted":26812,"title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7330557743520498,"acs":19544,"articleLive":2,"columnArticles":413,"formTitle":"[1028]Recover a Tree From Preorder Traversal","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":26661,"title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6492759619362847,"acs":15693,"articleLive":2,"columnArticles":167,"formTitle":"[1029]Two City Scheduling","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":24170,"title":"Two City Scheduling","titleSlug":"two-city-scheduling"},{"acceptance":0.7124907878417486,"acs":39638,"articleLive":2,"columnArticles":436,"formTitle":"[1030]Matrix Cells in Distance Order","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":55633,"title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5620456905503635,"acs":4330,"articleLive":2,"columnArticles":63,"formTitle":"[1031]Maximum Sum of Two Non-Overlapping Subarrays","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":7704,"title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3888794132696572,"acs":2280,"articleLive":2,"columnArticles":34,"formTitle":"[1032]Stream of Characters","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":5863,"title":"Stream of Characters","titleSlug":"stream-of-characters"},{"acceptance":0.38826285841794045,"acs":10440,"articleLive":2,"columnArticles":158,"formTitle":"[1033]Moving Stones Until Consecutive","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":1,"nodeType":"def","questionId":"1103","status":"","submitted":26889,"title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4298848028356225,"acs":3881,"articleLive":2,"columnArticles":83,"formTitle":"[1034]Coloring A Border","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":9028,"title":"Coloring A Border","titleSlug":"coloring-a-border"},{"acceptance":0.6210855741822313,"acs":31158,"articleLive":2,"columnArticles":355,"formTitle":"[1035]Uncrossed Lines","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","submitted":50167,"title":"Uncrossed Lines","titleSlug":"uncrossed-lines"},{"acceptance":0.2984287987271281,"acs":3001,"articleLive":2,"columnArticles":49,"formTitle":"[1036]Escape a Large Maze","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10056,"title":"Escape a Large Maze","titleSlug":"escape-a-large-maze"},{"acceptance":0.441186788954042,"acs":8803,"articleLive":2,"columnArticles":101,"formTitle":"[1037]Valid Boomerang","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":19953,"title":"Valid Boomerang","titleSlug":"valid-boomerang"},{"acceptance":0.7917954481595953,"acs":22544,"articleLive":2,"columnArticles":291,"formTitle":"[1038]Binary Search Tree to Greater Sum Tree","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":28472,"title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5514745308310992,"acs":4114,"articleLive":2,"columnArticles":57,"formTitle":"[1039]Minimum Score Triangulation of Polygon","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7460,"title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5212608419716522,"acs":2464,"articleLive":2,"columnArticles":28,"formTitle":"[1040]Moving Stones Until Consecutive II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":4727,"title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4770487863494352,"acs":5955,"articleLive":2,"columnArticles":99,"formTitle":"[1041]Robot Bounded In Circle","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":12483,"title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5206793924466339,"acs":10147,"articleLive":2,"columnArticles":142,"formTitle":"[1042]Flower Planting With No Adjacent","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":19488,"title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6870500049314529,"acs":6966,"articleLive":2,"columnArticles":96,"formTitle":"[1043]Partition Array for Maximum Sum","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":10139,"title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20931340697422568,"acs":4832,"articleLive":2,"columnArticles":58,"formTitle":"[1044]Longest Duplicate Substring","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":23085,"title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6457013574660634,"acs":7135,"articleLive":2,"columnArticles":90,"formTitle":"[1045]Customers Who Bought All Products","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":11050,"title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596631102557866,"acs":62385,"articleLive":2,"columnArticles":872,"formTitle":"[1046]Last Stone Weight","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":94571,"title":"Last Stone Weight","titleSlug":"last-stone-weight"},{"acceptance":0.7275240868676229,"acs":93935,"articleLive":2,"columnArticles":917,"formTitle":"[1047]Remove All Adjacent Duplicates In String","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"","submitted":129116,"title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.44794566306647365,"acs":8046,"articleLive":2,"columnArticles":110,"formTitle":"[1048]Longest String Chain","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":17962,"title":"Longest String Chain","titleSlug":"longest-string-chain"},{"acceptance":0.6341701811863087,"acs":35036,"articleLive":2,"columnArticles":358,"formTitle":"[1049]Last Stone Weight II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","submitted":55247,"title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7546855146124524,"acs":9503,"articleLive":2,"columnArticles":46,"formTitle":"[1050]Actors and Directors Who Cooperated At Least Three Times","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":12592,"title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7494621206368491,"acs":29609,"articleLive":2,"columnArticles":339,"formTitle":"[1051]Height Checker","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":39507,"title":"Height Checker","titleSlug":"height-checker"},{"acceptance":0.5800949330451897,"acs":45096,"articleLive":2,"columnArticles":716,"formTitle":"[1052]Grumpy Bookstore Owner","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":77739,"title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45795538122088747,"acs":5604,"articleLive":2,"columnArticles":91,"formTitle":"[1053]Previous Permutation With One Swap","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12237,"title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3720811924505265,"acs":7314,"articleLive":2,"columnArticles":97,"formTitle":"[1054]Distant Barcodes","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":19657,"title":"Distant Barcodes","titleSlug":"distant-barcodes"},{"acceptance":0.5809891808346214,"acs":3759,"articleLive":2,"columnArticles":65,"formTitle":"[1055]Shortest Way to Form String","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":6470,"title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4004689942678478,"acs":3074,"articleLive":2,"columnArticles":56,"formTitle":"[1056]Confusing Number","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":7676,"title":"Confusing Number","titleSlug":"confusing-number"},{"acceptance":0.45401174168297453,"acs":2784,"articleLive":2,"columnArticles":34,"formTitle":"[1057]Campus Bikes","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6132,"title":"Campus Bikes","titleSlug":"campus-bikes"},{"acceptance":0.3345997286295794,"acs":1233,"articleLive":2,"columnArticles":27,"formTitle":"[1058]Minimize Rounding Error to Meet Target","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3685,"title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3520726859738785,"acs":1860,"articleLive":2,"columnArticles":30,"formTitle":"[1059]All Paths from Source Lead to Destination","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":5283,"title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5257731958762887,"acs":3723,"articleLive":2,"columnArticles":57,"formTitle":"[1060]Missing Element in Sorted Array","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":7081,"title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5914313068453806,"acs":2471,"articleLive":2,"columnArticles":51,"formTitle":"[1061]Lexicographically Smallest Equivalent String","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4178,"title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.524212852145093,"acs":2847,"articleLive":2,"columnArticles":34,"formTitle":"[1062]Longest Repeating Substring","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":5431,"title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring"},{"acceptance":0.6948936170212766,"acs":1633,"articleLive":2,"columnArticles":31,"formTitle":"[1063]Number of Valid Subarrays","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2350,"title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6504854368932039,"acs":4489,"articleLive":2,"columnArticles":64,"formTitle":"[1064]Fixed Point","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":6901,"title":"Fixed Point","titleSlug":"fixed-point"},{"acceptance":0.5347222222222222,"acs":2233,"articleLive":2,"columnArticles":62,"formTitle":"[1065]Index Pairs of a String","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4176,"title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.46774193548387094,"acs":1827,"articleLive":2,"columnArticles":37,"formTitle":"[1066]Campus Bikes II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":3906,"title":"Campus Bikes II","titleSlug":"campus-bikes-ii"},{"acceptance":0.41002277904328016,"acs":720,"articleLive":2,"columnArticles":21,"formTitle":"[1067]Digit Count in Range","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1756,"title":"Digit Count in Range","titleSlug":"digit-count-in-range"},{"acceptance":0.8649824454281789,"acs":11333,"articleLive":2,"columnArticles":53,"formTitle":"[1068]Product Sales Analysis I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":13102,"title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8215821152192605,"acs":9555,"articleLive":2,"columnArticles":49,"formTitle":"[1069]Product Sales Analysis II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":11630,"title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4835798816568047,"acs":6538,"articleLive":2,"columnArticles":59,"formTitle":"[1070]Product Sales Analysis III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":13520,"title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865204693702674,"acs":33539,"articleLive":2,"columnArticles":652,"formTitle":"[1071]Greatest Common Divisor of Strings","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","submitted":57183,"title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5784609581290079,"acs":3067,"articleLive":2,"columnArticles":48,"formTitle":"[1072]Flip Columns For Maximum Number of Equal Rows","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5302,"title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3376042908224076,"acs":2266,"articleLive":2,"columnArticles":46,"formTitle":"[1073]Adding Two Negabinary Numbers","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":6712,"title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6705475850672276,"acs":17854,"articleLive":2,"columnArticles":183,"formTitle":"[1074]Number of Submatrices That Sum to Target","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","submitted":26626,"title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.694805761676124,"acs":7959,"articleLive":2,"columnArticles":65,"formTitle":"[1075]Project Employees I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":11455,"title":"Project Employees I","titleSlug":"project-employees-i"},{"acceptance":0.5003508771929824,"acs":8556,"articleLive":2,"columnArticles":77,"formTitle":"[1076]Project Employees II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":17100,"title":"Project Employees II","titleSlug":"project-employees-ii"},{"acceptance":0.7193141819007608,"acs":6335,"articleLive":2,"columnArticles":78,"formTitle":"[1077]Project Employees III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":8807,"title":"Project Employees III","titleSlug":"project-employees-iii"},{"acceptance":0.6238652583499857,"acs":10927,"articleLive":2,"columnArticles":162,"formTitle":"[1078]Occurrences After Bigram","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":17515,"title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7343144292893037,"acs":10229,"articleLive":2,"columnArticles":168,"formTitle":"[1079]Letter Tile Possibilities","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":13930,"title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4861325115562404,"acs":3786,"articleLive":2,"columnArticles":72,"formTitle":"[1080]Insufficient Nodes in Root to Leaf Paths","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":7788,"title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5714926243106309,"acs":12746,"articleLive":2,"columnArticles":126,"formTitle":"[1081]Smallest Subsequence of Distinct Characters","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"","submitted":22303,"title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7593708427889506,"acs":9704,"articleLive":2,"columnArticles":83,"formTitle":"[1082]Sales Analysis I","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":12779,"title":"Sales Analysis I","titleSlug":"sales-analysis-i"},{"acceptance":0.5265172225259704,"acs":8667,"articleLive":2,"columnArticles":87,"formTitle":"[1083]Sales Analysis II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":16461,"title":"Sales Analysis II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5380281690140845,"acs":8786,"articleLive":2,"columnArticles":89,"formTitle":"[1084]Sales Analysis III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":16330,"title":"Sales Analysis III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7743777118063485,"acs":3391,"articleLive":2,"columnArticles":66,"formTitle":"[1085]Sum of Digits in the Minimum Number","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4379,"title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6914924506387921,"acs":4763,"articleLive":2,"columnArticles":73,"formTitle":"[1086]High Five","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":6888,"title":"High Five","titleSlug":"high-five"},{"acceptance":0.528525641025641,"acs":1649,"articleLive":2,"columnArticles":48,"formTitle":"[1087]Brace Expansion","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3120,"title":"Brace Expansion","titleSlug":"brace-expansion"},{"acceptance":0.4401650618982118,"acs":960,"articleLive":2,"columnArticles":30,"formTitle":"[1088]Confusing Number II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2181,"title":"Confusing Number II","titleSlug":"confusing-number-ii"},{"acceptance":0.5835220745117348,"acs":17777,"articleLive":2,"columnArticles":262,"formTitle":"[1089]Duplicate Zeros","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":30465,"title":"Duplicate Zeros","titleSlug":"duplicate-zeros"},{"acceptance":0.5359351988217967,"acs":3639,"articleLive":2,"columnArticles":70,"formTitle":"[1090]Largest Values From Labels","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":6790,"title":"Largest Values From Labels","titleSlug":"largest-values-from-labels"},{"acceptance":0.3739593260568572,"acs":20797,"articleLive":2,"columnArticles":198,"formTitle":"[1091]Shortest Path in Binary Matrix","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","submitted":55613,"title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48260149130074564,"acs":2330,"articleLive":2,"columnArticles":44,"formTitle":"[1092]Shortest Common Supersequence ","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":4828,"title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3930994824611846,"acs":3418,"articleLive":2,"columnArticles":50,"formTitle":"[1093]Statistics from a Large Sample","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":8695,"title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6186080372743157,"acs":21243,"articleLive":2,"columnArticles":308,"formTitle":"[1094]Car Pooling","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":34340,"title":"Car Pooling","titleSlug":"car-pooling"},{"acceptance":0.37238262718796006,"acs":18211,"articleLive":2,"columnArticles":367,"formTitle":"[1095]Find in Mountain Array","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":48904,"title":"Find in Mountain Array","titleSlug":"find-in-mountain-array"},{"acceptance":0.5615164520743919,"acs":1570,"articleLive":2,"columnArticles":43,"formTitle":"[1096]Brace Expansion II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":2796,"title":"Brace Expansion II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5180954414433651,"acs":4853,"articleLive":2,"columnArticles":88,"formTitle":"[1097]Game Play Analysis V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":9367,"title":"Game Play Analysis V","titleSlug":"game-play-analysis-v"},{"acceptance":0.476558837318331,"acs":6099,"articleLive":2,"columnArticles":89,"formTitle":"[1098]Unpopular Books","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":12798,"title":"Unpopular Books","titleSlug":"unpopular-books"},{"acceptance":0.5741393331526159,"acs":4236,"articleLive":2,"columnArticles":79,"formTitle":"[1099]Two Sum Less Than K","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":7378,"title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6970216747232184,"acs":4470,"articleLive":2,"columnArticles":91,"formTitle":"[1100]Find K-Length Substrings With No Repeated Characters","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":6413,"title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6671659676452966,"acs":2227,"articleLive":2,"columnArticles":48,"formTitle":"[1101]The Earliest Moment When Everyone Become Friends","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3338,"title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36165629487793205,"acs":4533,"articleLive":2,"columnArticles":60,"formTitle":"[1102]Path With Maximum Minimum Value","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":12534,"title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6351534757469277,"acs":34163,"articleLive":2,"columnArticles":1078,"formTitle":"[1103]Distribute Candies to People","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":53787,"title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7136778654374613,"acs":8051,"articleLive":2,"columnArticles":174,"formTitle":"[1104]Path In Zigzag Labelled Binary Tree","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","submitted":11281,"title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5530764807360552,"acs":4809,"articleLive":2,"columnArticles":60,"formTitle":"[1105]Filling Bookcase Shelves","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":8695,"title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5684678016284234,"acs":3840,"articleLive":2,"columnArticles":111,"formTitle":"[1106]Parsing A Boolean Expression","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":6755,"title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4127547169811321,"acs":5469,"articleLive":2,"columnArticles":77,"formTitle":"[1107]New Users Daily Count","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":13250,"title":"New Users Daily Count","titleSlug":"new-users-daily-count"},{"acceptance":0.8390183190074287,"acs":64716,"articleLive":2,"columnArticles":651,"formTitle":"[1108]Defanging an IP Address","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":77133,"title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address"},{"acceptance":0.4975798097749317,"acs":26419,"articleLive":2,"columnArticles":243,"formTitle":"[1109]Corporate Flight Bookings","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":53095,"title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6249269717624149,"acs":9627,"articleLive":2,"columnArticles":182,"formTitle":"[1110]Delete Nodes And Return Forest","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":15405,"title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7728910138852502,"acs":23601,"articleLive":2,"columnArticles":393,"formTitle":"[1111]Maximum Nesting Depth of Two Valid Parentheses Strings","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":30536,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6419403739262254,"acs":6352,"articleLive":2,"columnArticles":73,"formTitle":"[1112]Highest Grade For Each Student","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":9895,"title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5452290076335878,"acs":5714,"articleLive":2,"columnArticles":41,"formTitle":"[1113]Reported Posts","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":10480,"title":"Reported Posts","titleSlug":"reported-posts"},{"acceptance":0.6505716839975533,"acs":69133,"articleLive":2,"columnArticles":514,"formTitle":"[1114]Print in Order","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":106265,"title":"Print in Order","titleSlug":"print-in-order"},{"acceptance":0.559598605123376,"acs":38032,"articleLive":2,"columnArticles":434,"formTitle":"[1115]Print FooBar Alternately","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":67963,"title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately"},{"acceptance":0.5101892474234833,"acs":19653,"articleLive":2,"columnArticles":330,"formTitle":"[1116]Print Zero Even Odd","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":38521,"title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd"},{"acceptance":0.5181576914032318,"acs":15424,"articleLive":2,"columnArticles":230,"formTitle":"[1117]Building H2O","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":29767,"title":"Building H2O","titleSlug":"building-h2o"},{"acceptance":0.6369966696942174,"acs":2104,"articleLive":2,"columnArticles":30,"formTitle":"[1118]Number of Days in a Month","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3303,"title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8652883569096844,"acs":7952,"articleLive":2,"columnArticles":135,"formTitle":"[1119]Remove Vowels from a String","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9190,"title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.5975327679259831,"acs":2325,"articleLive":2,"columnArticles":43,"formTitle":"[1120]Maximum Average Subtree","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":3891,"title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree"},{"acceptance":0.5615598885793872,"acs":1008,"articleLive":2,"columnArticles":14,"formTitle":"[1121]Divide Array Into Increasing Sequences","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1795,"title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069112333433063,"acs":61432,"articleLive":2,"columnArticles":817,"formTitle":"[1122]Relative Sort Array","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":86902,"title":"Relative Sort Array","titleSlug":"relative-sort-array"},{"acceptance":0.7017307692307693,"acs":7298,"articleLive":2,"columnArticles":96,"formTitle":"[1123]Lowest Common Ancestor of Deepest Leaves","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":10400,"title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3096580027359781,"acs":11318,"articleLive":2,"columnArticles":112,"formTitle":"[1124]Longest Well-Performing Interval","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","submitted":36550,"title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4815869062444405,"acs":2707,"articleLive":2,"columnArticles":42,"formTitle":"[1125]Smallest Sufficient Team","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":5621,"title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team"},{"acceptance":0.695609482395848,"acs":4959,"articleLive":2,"columnArticles":79,"formTitle":"[1126]Active Businesses","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":7129,"title":"Active Businesses","titleSlug":"active-businesses"},{"acceptance":0.4270900842514582,"acs":3295,"articleLive":2,"columnArticles":57,"formTitle":"[1127]User Purchase Platform","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":7715,"title":"User Purchase Platform","titleSlug":"user-purchase-platform"},{"acceptance":0.5443681629573746,"acs":36078,"articleLive":2,"columnArticles":464,"formTitle":"[1128]Number of Equivalent Domino Pairs","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":66275,"title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37657894736842107,"acs":5724,"articleLive":2,"columnArticles":103,"formTitle":"[1129]Shortest Path with Alternating Colors","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":15200,"title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6260342617410558,"acs":5372,"articleLive":2,"columnArticles":93,"formTitle":"[1130]Minimum Cost Tree From Leaf Values","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","submitted":8581,"title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4520265991133629,"acs":2855,"articleLive":2,"columnArticles":43,"formTitle":"[1131]Maximum of Absolute Value Expression","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6316,"title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3962841760793835,"acs":3754,"articleLive":2,"columnArticles":41,"formTitle":"[1132]Reported Posts II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":9473,"title":"Reported Posts II","titleSlug":"reported-posts-ii"},{"acceptance":0.6409331409331409,"acs":2665,"articleLive":2,"columnArticles":53,"formTitle":"[1133]Largest Unique Number","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4158,"title":"Largest Unique Number","titleSlug":"largest-unique-number"},{"acceptance":0.7719160104986876,"acs":2941,"articleLive":2,"columnArticles":48,"formTitle":"[1134]Armstrong Number","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":3810,"title":"Armstrong Number","titleSlug":"armstrong-number"},{"acceptance":0.5268142048378796,"acs":5118,"articleLive":2,"columnArticles":58,"formTitle":"[1135]Connecting Cities With Minimum Cost","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":9715,"title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5564412445358704,"acs":2164,"articleLive":2,"columnArticles":40,"formTitle":"[1136]Parallel Courses","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":3889,"title":"Parallel Courses","titleSlug":"parallel-courses"},{"acceptance":0.5470170769571967,"acs":29598,"articleLive":2,"columnArticles":450,"formTitle":"[1137]N-th Tribonacci Number","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","submitted":54108,"title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4310999696140991,"acs":5675,"articleLive":2,"columnArticles":130,"formTitle":"[1138]Alphabet Board Path","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":13164,"title":"Alphabet Board Path","titleSlug":"alphabet-board-path"},{"acceptance":0.4733776132404181,"acs":8695,"articleLive":2,"columnArticles":140,"formTitle":"[1139]Largest 1-Bordered Square","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":18368,"title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6542614529824929,"acs":6241,"articleLive":2,"columnArticles":90,"formTitle":"[1140]Stone Game II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":9539,"title":"Stone Game II","titleSlug":"stone-game-ii"},{"acceptance":0.5146051208077894,"acs":8562,"articleLive":2,"columnArticles":58,"formTitle":"[1141]User Activity for the Past 30 Days I","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":16638,"title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37127388535031847,"acs":5829,"articleLive":2,"columnArticles":46,"formTitle":"[1142]User Activity for the Past 30 Days II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":15700,"title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6273230704765895,"acs":131746,"articleLive":2,"columnArticles":935,"formTitle":"[1143]Longest Common Subsequence","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","submitted":210013,"title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence"},{"acceptance":0.4401115459002384,"acs":9785,"articleLive":2,"columnArticles":141,"formTitle":"[1144]Decrease Elements To Make Array Zigzag","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","submitted":22233,"title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46764217830743704,"acs":6200,"articleLive":2,"columnArticles":97,"formTitle":"[1145]Binary Tree Coloring Game","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13258,"title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28436637005216325,"acs":3707,"articleLive":2,"columnArticles":56,"formTitle":"[1146]Snapshot Array","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":13036,"title":"Snapshot Array","titleSlug":"snapshot-array"},{"acceptance":0.5507838014369693,"acs":3373,"articleLive":2,"columnArticles":68,"formTitle":"[1147]Longest Chunked Palindrome Decomposition","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":6124,"title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7197473042152271,"acs":6608,"articleLive":2,"columnArticles":31,"formTitle":"[1148]Article Views I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":9181,"title":"Article Views I","titleSlug":"article-views-i"},{"acceptance":0.44503203498423677,"acs":4376,"articleLive":2,"columnArticles":39,"formTitle":"[1149]Article Views II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":9833,"title":"Article Views II","titleSlug":"article-views-ii"},{"acceptance":0.6048738033072236,"acs":4170,"articleLive":2,"columnArticles":71,"formTitle":"[1150]Check If a Number Is Majority Element in a Sorted Array","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":6894,"title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4831062670299727,"acs":3546,"articleLive":2,"columnArticles":50,"formTitle":"[1151]Minimum Swaps to Group All 1's Together","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":7340,"title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3796122576610381,"acs":1214,"articleLive":2,"columnArticles":29,"formTitle":"[1152]Analyze User Website Visit Pattern","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3198,"title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3694237918215613,"acs":1590,"articleLive":2,"columnArticles":20,"formTitle":"[1153]String Transforms Into Another String","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4304,"title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.561042944785276,"acs":12803,"articleLive":2,"columnArticles":204,"formTitle":"[1154]Day of the Year","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":22820,"title":"Day of the Year","titleSlug":"day-of-the-year"},{"acceptance":0.47951723337588487,"acs":8264,"articleLive":2,"columnArticles":114,"formTitle":"[1155]Number of Dice Rolls With Target Sum","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":17234,"title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4333269744372377,"acs":4543,"articleLive":2,"columnArticles":71,"formTitle":"[1156]Swap For Longest Repeated Character Substring","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":10484,"title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.30807679200272636,"acs":2712,"articleLive":2,"columnArticles":40,"formTitle":"[1157]Online Majority Element In Subarray","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":8803,"title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5527774356447839,"acs":4488,"articleLive":2,"columnArticles":54,"formTitle":"[1158]Market Analysis I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":8119,"title":"Market Analysis I","titleSlug":"market-analysis-i"},{"acceptance":0.4979625101874491,"acs":3055,"articleLive":2,"columnArticles":65,"formTitle":"[1159]Market Analysis II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":6135,"title":"Market Analysis II","titleSlug":"market-analysis-ii"},{"acceptance":0.6881882364280378,"acs":57121,"articleLive":2,"columnArticles":880,"formTitle":"[1160]Find Words That Can Be Formed by Characters","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":83002,"title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6405995438253502,"acs":9830,"articleLive":2,"columnArticles":153,"formTitle":"[1161]Maximum Level Sum of a Binary Tree","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":15345,"title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4681902087720667,"acs":36016,"articleLive":2,"columnArticles":477,"formTitle":"[1162]As Far from Land as Possible","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":76926,"title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2679658952496955,"acs":5500,"articleLive":2,"columnArticles":92,"formTitle":"[1163]Last Substring in Lexicographical Order","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":20525,"title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6255364806866953,"acs":4664,"articleLive":2,"columnArticles":69,"formTitle":"[1164]Product Price at a Given Date","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":7456,"title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8376237623762376,"acs":7191,"articleLive":2,"columnArticles":107,"formTitle":"[1165]Single-Row Keyboard","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":8585,"title":"Single-Row Keyboard","titleSlug":"single-row-keyboard"},{"acceptance":0.4827586206896552,"acs":2240,"articleLive":2,"columnArticles":40,"formTitle":"[1166]Design File System","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":4640,"title":"Design File System","titleSlug":"design-file-system"},{"acceptance":0.4106425702811245,"acs":2045,"articleLive":2,"columnArticles":31,"formTitle":"[1167]Minimum Cost to Connect Sticks","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":4980,"title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5623257666268419,"acs":1412,"articleLive":2,"columnArticles":19,"formTitle":"[1168]Optimize Water Distribution in a Village","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2511,"title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32164790174002045,"acs":6285,"articleLive":2,"columnArticles":72,"formTitle":"[1169]Invalid Transactions","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":19540,"title":"Invalid Transactions","titleSlug":"invalid-transactions"},{"acceptance":0.6159597479544814,"acs":13099,"articleLive":2,"columnArticles":205,"formTitle":"[1170]Compare Strings by Frequency of the Smallest Character","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":21266,"title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4693152199668273,"acs":11884,"articleLive":2,"columnArticles":142,"formTitle":"[1171]Remove Zero Sum Consecutive Nodes from Linked List","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"","submitted":25322,"title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2741800834824091,"acs":2299,"articleLive":2,"columnArticles":47,"formTitle":"[1172]Dinner Plate Stacks","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":8385,"title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7557726465364121,"acs":6808,"articleLive":2,"columnArticles":69,"formTitle":"[1173]Immediate Food Delivery I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":9008,"title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6147304479878511,"acs":4048,"articleLive":2,"columnArticles":52,"formTitle":"[1174]Immediate Food Delivery II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":6585,"title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48736381827614317,"acs":6576,"articleLive":2,"columnArticles":100,"formTitle":"[1175]Prime Arrangements","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":13493,"title":"Prime Arrangements","titleSlug":"prime-arrangements"},{"acceptance":0.43867403314917125,"acs":3970,"articleLive":2,"columnArticles":53,"formTitle":"[1176]Diet Plan Performance","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9050,"title":"Diet Plan Performance","titleSlug":"diet-plan-performance"},{"acceptance":0.2615949585165707,"acs":5770,"articleLive":2,"columnArticles":83,"formTitle":"[1177]Can Make Palindrome from Substring","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":22057,"title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4622677189178286,"acs":18334,"articleLive":2,"columnArticles":180,"formTitle":"[1178]Number of Valid Words for Each Puzzle","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":39661,"title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6328565648873129,"acs":26592,"articleLive":2,"columnArticles":161,"formTitle":"[1179]Reformat Department Table","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":42019,"title":"Reformat Department Table","titleSlug":"reformat-department-table"},{"acceptance":0.7714362272240086,"acs":2879,"articleLive":2,"columnArticles":61,"formTitle":"[1180]Count Substrings with Only One Distinct Letter","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":3732,"title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.36655449132798346,"acs":1416,"articleLive":2,"columnArticles":25,"formTitle":"[1181]Before and After Puzzle","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":3863,"title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle"},{"acceptance":0.37165101900618275,"acs":1623,"articleLive":2,"columnArticles":33,"formTitle":"[1182]Shortest Distance to Target Color","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":4367,"title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.591937069813176,"acs":602,"articleLive":2,"columnArticles":16,"formTitle":"[1183]Maximum Number of Ones","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1017,"title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5842639121533594,"acs":12557,"articleLive":2,"columnArticles":243,"formTitle":"[1184]Distance Between Bus Stops","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":21492,"title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6112987769365171,"acs":10496,"articleLive":2,"columnArticles":189,"formTitle":"[1185]Day of the Week","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":17170,"title":"Day of the Week","titleSlug":"day-of-the-week"},{"acceptance":0.3851170373820892,"acs":6614,"articleLive":2,"columnArticles":102,"formTitle":"[1186]Maximum Subarray Sum with One Deletion","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":17174,"title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.43710855949895616,"acs":1675,"articleLive":2,"columnArticles":29,"formTitle":"[1187]Make Array Strictly Increasing","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":3832,"title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6916071868077776,"acs":2810,"articleLive":2,"columnArticles":61,"formTitle":"[1188]Design Bounded Blocking Queue","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4063,"title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6432847173992129,"acs":19451,"articleLive":2,"columnArticles":295,"formTitle":"[1189]Maximum Number of Balloons","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":30237,"title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6504639931431209,"acs":39463,"articleLive":2,"columnArticles":569,"formTitle":"[1190]Reverse Substrings Between Each Pair of Parentheses","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","submitted":60669,"title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26746402363480415,"acs":5613,"articleLive":2,"columnArticles":88,"formTitle":"[1191]K-Concatenation Maximum Sum","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":20986,"title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.504066161268091,"acs":3657,"articleLive":2,"columnArticles":39,"formTitle":"[1192]Critical Connections in a Network","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":7255,"title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6162126245847176,"acs":4637,"articleLive":2,"columnArticles":59,"formTitle":"[1193]Monthly Transactions I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":7525,"title":"Monthly Transactions I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5251605995717344,"acs":2943,"articleLive":2,"columnArticles":55,"formTitle":"[1194]Tournament Winners","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":5604,"title":"Tournament Winners","titleSlug":"tournament-winners"},{"acceptance":0.6322381176963789,"acs":12065,"articleLive":2,"columnArticles":242,"formTitle":"[1195]Fizz Buzz Multithreaded","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":19083,"title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6887832288740005,"acs":3187,"articleLive":2,"columnArticles":49,"formTitle":"[1196]How Many Apples Can You Put into the Basket","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4627,"title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.35873965851082557,"acs":4076,"articleLive":2,"columnArticles":54,"formTitle":"[1197]Minimum Knight Moves","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":11362,"title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves"},{"acceptance":0.7456851736327719,"acs":3586,"articleLive":2,"columnArticles":53,"formTitle":"[1198]Find Smallest Common Element in All Rows","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":4809,"title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4283927454659162,"acs":685,"articleLive":2,"columnArticles":13,"formTitle":"[1199]Minimum Time to Build Blocks","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1599,"title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6844736407205421,"acs":16567,"articleLive":2,"columnArticles":223,"formTitle":"[1200]Minimum Absolute Difference","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":24204,"title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24631463648395782,"acs":5397,"articleLive":2,"columnArticles":77,"formTitle":"[1201]Ugly Number III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":21911,"title":"Ugly Number III","titleSlug":"ugly-number-iii"},{"acceptance":0.5017595022844367,"acs":25808,"articleLive":2,"columnArticles":285,"formTitle":"[1202]Smallest String With Swaps","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":51435,"title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.627447875428873,"acs":11887,"articleLive":2,"columnArticles":140,"formTitle":"[1203]Sort Items by Groups Respecting Dependencies","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":18945,"title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7249570245350836,"acs":4639,"articleLive":2,"columnArticles":71,"formTitle":"[1204]Last Person to Fit in the Bus","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":6399,"title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.477543437875642,"acs":4370,"articleLive":2,"columnArticles":67,"formTitle":"[1205]Monthly Transactions II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":9151,"title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6166424011647441,"acs":5506,"articleLive":2,"columnArticles":76,"formTitle":"[1206]Design Skiplist","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":8929,"title":"Design Skiplist","titleSlug":"design-skiplist"},{"acceptance":0.7304090623033355,"acs":58031,"articleLive":2,"columnArticles":799,"formTitle":"[1207]Unique Number of Occurrences","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":79450,"title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49731634652168366,"acs":42900,"articleLive":2,"columnArticles":586,"formTitle":"[1208]Get Equal Substrings Within Budget","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":86263,"title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5373656709060436,"acs":10901,"articleLive":2,"columnArticles":148,"formTitle":"[1209]Remove All Adjacent Duplicates in String II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","submitted":20286,"title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44739696312364424,"acs":2475,"articleLive":2,"columnArticles":45,"formTitle":"[1210]Minimum Moves to Reach Target with Rotations","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5532,"title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6573560767590618,"acs":6166,"articleLive":2,"columnArticles":56,"formTitle":"[1211]Queries Quality and Percentage","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":9380,"title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5163636363636364,"acs":4260,"articleLive":2,"columnArticles":88,"formTitle":"[1212]Team Scores in Football Tournament","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":8250,"title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7703205495134516,"acs":5383,"articleLive":2,"columnArticles":108,"formTitle":"[1213]Intersection of Three Sorted Arrays","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":6988,"title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6281788351107465,"acs":3063,"articleLive":2,"columnArticles":64,"formTitle":"[1214]Two Sum BSTs","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":4876,"title":"Two Sum BSTs","titleSlug":"two-sum-bsts"},{"acceptance":0.4073137074517019,"acs":1771,"articleLive":2,"columnArticles":38,"formTitle":"[1215]Stepping Numbers","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4348,"title":"Stepping Numbers","titleSlug":"stepping-numbers"},{"acceptance":0.5297642828605673,"acs":1326,"articleLive":2,"columnArticles":32,"formTitle":"[1216]Valid Palindrome III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2503,"title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6943450250536864,"acs":20370,"articleLive":2,"columnArticles":323,"formTitle":"[1217]Minimum Cost to Move Chips to The Same Position","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","submitted":29337,"title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4192257073919719,"acs":7645,"articleLive":2,"columnArticles":103,"formTitle":"[1218]Longest Arithmetic Subsequence of Given Difference","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":18236,"title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6270665351818551,"acs":10810,"articleLive":2,"columnArticles":154,"formTitle":"[1219]Path with Maximum Gold","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":17239,"title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5227918098938873,"acs":3498,"articleLive":2,"columnArticles":65,"formTitle":"[1220]Count Vowels Permutation","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":6691,"title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation"},{"acceptance":0.8022991307173613,"acs":39502,"articleLive":2,"columnArticles":627,"formTitle":"[1221]Split a String in Balanced Strings","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":49236,"title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6708718461154134,"acs":5371,"articleLive":2,"columnArticles":115,"formTitle":"[1222]Queens That Can Attack the King","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8006,"title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47269190483315876,"acs":3159,"articleLive":2,"columnArticles":54,"formTitle":"[1223]Dice Roll Simulation","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":6683,"title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation"},{"acceptance":0.32225007372456504,"acs":4371,"articleLive":2,"columnArticles":62,"formTitle":"[1224]Maximum Equal Frequency","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":13564,"title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5618244703847817,"acs":2599,"articleLive":2,"columnArticles":64,"formTitle":"[1225]Report Contiguous Dates","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":4626,"title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"},{"acceptance":0.6056533827618165,"acs":10456,"articleLive":2,"columnArticles":121,"formTitle":"[1226]The Dining Philosophers","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":17264,"title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"},{"acceptance":0.6603303431581945,"acs":9275,"articleLive":2,"columnArticles":145,"formTitle":"[1227]Airplane Seat Assignment Probability","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14046,"title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5407894736842105,"acs":2877,"articleLive":2,"columnArticles":46,"formTitle":"[1228]Missing Number In Arithmetic Progression","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5320,"title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.40503652441368704,"acs":2107,"articleLive":2,"columnArticles":35,"formTitle":"[1229]Meeting Scheduler","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5202,"title":"Meeting Scheduler","titleSlug":"meeting-scheduler"},{"acceptance":0.4720910261914985,"acs":2199,"articleLive":2,"columnArticles":44,"formTitle":"[1230]Toss Strange Coins","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":4658,"title":"Toss Strange Coins","titleSlug":"toss-strange-coins"},{"acceptance":0.5578394926743931,"acs":2551,"articleLive":2,"columnArticles":36,"formTitle":"[1231]Divide Chocolate","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":4573,"title":"Divide Chocolate","titleSlug":"divide-chocolate"},{"acceptance":0.46923759626671246,"acs":32780,"articleLive":2,"columnArticles":404,"formTitle":"[1232]Check If It Is a Straight Line","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":69858,"title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4808602999210734,"acs":7311,"articleLive":2,"columnArticles":102,"formTitle":"[1233]Remove Sub-Folders from the Filesystem","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":15204,"title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.33942963422194666,"acs":5475,"articleLive":2,"columnArticles":78,"formTitle":"[1234]Replace the Substring for Balanced String","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16130,"title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.44745264250497363,"acs":5173,"articleLive":2,"columnArticles":98,"formTitle":"[1235]Maximum Profit in Job Scheduling","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":11561,"title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5577540106951872,"acs":1043,"articleLive":2,"columnArticles":31,"formTitle":"[1236]Web Crawler","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":1870,"title":"Web Crawler","titleSlug":"web-crawler"},{"acceptance":0.7104749512036435,"acs":9828,"articleLive":2,"columnArticles":121,"formTitle":"[1237]Find Positive Integer Solution for a Given Equation","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":13833,"title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6529384544192504,"acs":2822,"articleLive":2,"columnArticles":66,"formTitle":"[1238]Circular Permutation in Binary Representation","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4322,"title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.48981039502268464,"acs":33144,"articleLive":2,"columnArticles":377,"formTitle":"[1239]Maximum Length of a Concatenated String with Unique Characters","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":67667,"title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4955067920585162,"acs":2371,"articleLive":2,"columnArticles":35,"formTitle":"[1240]Tiling a Rectangle with the Fewest Squares","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":4785,"title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5961772179869628,"acs":5396,"articleLive":2,"columnArticles":59,"formTitle":"[1241]Number of Comments per Post","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":9051,"title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4538236523192645,"acs":1086,"articleLive":2,"columnArticles":18,"formTitle":"[1242]Web Crawler Multithreaded","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2393,"title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5353356890459364,"acs":2424,"articleLive":2,"columnArticles":48,"formTitle":"[1243]Array Transformation","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4528,"title":"Array Transformation","titleSlug":"array-transformation"},{"acceptance":0.6215909090909091,"acs":2188,"articleLive":2,"columnArticles":35,"formTitle":"[1244]Design A Leaderboard","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3520,"title":"Design A Leaderboard","titleSlug":"design-a-leaderboard"},{"acceptance":0.5038436899423446,"acs":3146,"articleLive":2,"columnArticles":55,"formTitle":"[1245]Tree Diameter","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6244,"title":"Tree Diameter","titleSlug":"tree-diameter"},{"acceptance":0.48149441340782123,"acs":2758,"articleLive":2,"columnArticles":34,"formTitle":"[1246]Palindrome Removal","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":5728,"title":"Palindrome Removal","titleSlug":"palindrome-removal"},{"acceptance":0.6125520333013128,"acs":7652,"articleLive":2,"columnArticles":145,"formTitle":"[1247]Minimum Swaps to Make Strings Equal","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":12492,"title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5559908357963588,"acs":31791,"articleLive":2,"columnArticles":447,"formTitle":"[1248]Count Number of Nice Subarrays","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":57179,"title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5694786104277915,"acs":18983,"articleLive":2,"columnArticles":275,"formTitle":"[1249]Minimum Remove to Make Valid Parentheses","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"","submitted":33334,"title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5582513160906386,"acs":2439,"articleLive":2,"columnArticles":33,"formTitle":"[1250]Check If It Is a Good Array","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4369,"title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7730156963152621,"acs":6944,"articleLive":2,"columnArticles":84,"formTitle":"[1251]Average Selling Price","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":8983,"title":"Average Selling Price","titleSlug":"average-selling-price"},{"acceptance":0.750130298818624,"acs":17271,"articleLive":2,"columnArticles":292,"formTitle":"[1252]Cells with Odd Values in a Matrix","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23024,"title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39304749025534963,"acs":4941,"articleLive":2,"columnArticles":72,"formTitle":"[1253]Reconstruct a 2-Row Binary Matrix","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":12571,"title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5951690361846798,"acs":12517,"articleLive":2,"columnArticles":194,"formTitle":"[1254]Number of Closed Islands","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"","submitted":21031,"title":"Number of Closed Islands","titleSlug":"number-of-closed-islands"},{"acceptance":0.6725280326197758,"acs":2639,"articleLive":2,"columnArticles":53,"formTitle":"[1255]Maximum Score Words Formed by Letters","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":3924,"title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6593159315931593,"acs":1465,"articleLive":2,"columnArticles":34,"formTitle":"[1256]Encode Number","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2222,"title":"Encode Number","titleSlug":"encode-number"},{"acceptance":0.5625832223701731,"acs":1690,"articleLive":2,"columnArticles":35,"formTitle":"[1257]Smallest Common Region","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3004,"title":"Smallest Common Region","titleSlug":"smallest-common-region"},{"acceptance":0.5628042843232717,"acs":1156,"articleLive":2,"columnArticles":41,"formTitle":"[1258]Synonymous Sentences","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2054,"title":"Synonymous Sentences","titleSlug":"synonymous-sentences"},{"acceptance":0.4714139867279224,"acs":1847,"articleLive":2,"columnArticles":40,"formTitle":"[1259]Handshakes That Don't Cross","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":3918,"title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6035304593787648,"acs":11522,"articleLive":2,"columnArticles":237,"formTitle":"[1260]Shift 2D Grid","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":19091,"title":"Shift 2D Grid","titleSlug":"shift-2d-grid"},{"acceptance":0.7288969185988157,"acs":7262,"articleLive":2,"columnArticles":94,"formTitle":"[1261]Find Elements in a Contaminated Binary Tree","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":9963,"title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5218788741448184,"acs":11366,"articleLive":2,"columnArticles":173,"formTitle":"[1262]Greatest Sum Divisible by Three","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":21779,"title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4201201201201201,"acs":2798,"articleLive":2,"columnArticles":54,"formTitle":"[1263]Minimum Moves to Move a Box to Their Target Location","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":6660,"title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5804988662131519,"acs":4096,"articleLive":2,"columnArticles":77,"formTitle":"[1264]Page Recommendations","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":7056,"title":"Page Recommendations","titleSlug":"page-recommendations"},{"acceptance":0.917738791423002,"acs":2354,"articleLive":2,"columnArticles":60,"formTitle":"[1265]Print Immutable Linked List in Reverse","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2565,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8237487900700335,"acs":28935,"articleLive":2,"columnArticles":442,"formTitle":"[1266]Minimum Time Visiting All Points","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":35126,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6079434015130288,"acs":8679,"articleLive":2,"columnArticles":139,"formTitle":"[1267]Count Servers that Communicate","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":14276,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5753019472516638,"acs":7002,"articleLive":2,"columnArticles":128,"formTitle":"[1268]Search Suggestions System","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":12171,"title":"Search Suggestions System","titleSlug":"search-suggestions-system"},{"acceptance":0.4926721143348662,"acs":29784,"articleLive":2,"columnArticles":318,"formTitle":"[1269]Number of Ways to Stay in the Same Place After Some Steps","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"","submitted":60454,"title":"Number of Ways to Stay in the Same Place After Some Steps","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8134483309375499,"acs":5093,"articleLive":2,"columnArticles":73,"formTitle":"[1270]All People Report to the Given Manager","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":6261,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5016307893020222,"acs":2307,"articleLive":2,"columnArticles":37,"formTitle":"[1271]Hexspeak","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4599,"title":"Hexspeak","titleSlug":"hexspeak"},{"acceptance":0.5152044739601538,"acs":1474,"articleLive":2,"columnArticles":28,"formTitle":"[1272]Remove Interval","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":2861,"title":"Remove Interval","titleSlug":"remove-interval"},{"acceptance":0.5376423062798384,"acs":1464,"articleLive":2,"columnArticles":46,"formTitle":"[1273]Delete Tree Nodes","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2723,"title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes"},{"acceptance":0.5886618325642716,"acs":893,"articleLive":2,"columnArticles":20,"formTitle":"[1274]Number of Ships in a Rectangle","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1517,"title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5379724478982691,"acs":7615,"articleLive":2,"columnArticles":158,"formTitle":"[1275]Find Winner on a Tic Tac Toe Game","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14155,"title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.4990223236108848,"acs":6125,"articleLive":2,"columnArticles":91,"formTitle":"[1276]Number of Burgers with No Waste of Ingredients","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12274,"title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7222102588397433,"acs":16769,"articleLive":2,"columnArticles":217,"formTitle":"[1277]Count Square Submatrices with All Ones","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":23219,"title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5901639344262295,"acs":3096,"articleLive":2,"columnArticles":53,"formTitle":"[1278]Palindrome Partitioning III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5246,"title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6193633952254642,"acs":1401,"articleLive":2,"columnArticles":20,"formTitle":"[1279]Traffic Light Controlled Intersection","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2262,"title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5100757995932704,"acs":5518,"articleLive":2,"columnArticles":58,"formTitle":"[1280]Students and Examinations","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":10818,"title":"Students and Examinations","titleSlug":"students-and-examinations"},{"acceptance":0.8305956183959322,"acs":43941,"articleLive":2,"columnArticles":600,"formTitle":"[1281]Subtract the Product and Sum of Digits of an Integer","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":52903,"title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8104422778013283,"acs":11471,"articleLive":2,"columnArticles":210,"formTitle":"[1282]Group the People Given the Group Size They Belong To","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14154,"title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41351875808538163,"acs":6393,"articleLive":2,"columnArticles":88,"formTitle":"[1283]Find the Smallest Divisor Given a Threshold","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":15460,"title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6634251755807672,"acs":2456,"articleLive":2,"columnArticles":57,"formTitle":"[1284]Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3702,"title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8137777777777778,"acs":3662,"articleLive":2,"columnArticles":53,"formTitle":"[1285]Find the Start and End Number of Continuous Ranges","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":4500,"title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6441644164416441,"acs":4294,"articleLive":2,"columnArticles":81,"formTitle":"[1286]Iterator for Combination","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":6666,"title":"Iterator for Combination","titleSlug":"iterator-for-combination"},{"acceptance":0.6066168623265742,"acs":14210,"articleLive":2,"columnArticles":200,"formTitle":"[1287]Element Appearing More Than 25% In Sorted Array","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":23425,"title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5606015485407981,"acs":11295,"articleLive":2,"columnArticles":148,"formTitle":"[1288]Remove Covered Intervals","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":20148,"title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals"},{"acceptance":0.633003925815622,"acs":4676,"articleLive":2,"columnArticles":70,"formTitle":"[1289]Minimum Falling Path Sum II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":7387,"title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8089154574233878,"acs":50338,"articleLive":2,"columnArticles":661,"formTitle":"[1290]Convert Binary Number in a Linked List to Integer","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"","submitted":62229,"title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5156676843965933,"acs":6418,"articleLive":2,"columnArticles":141,"formTitle":"[1291]Sequential Digits","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":12446,"title":"Sequential Digits","titleSlug":"sequential-digits"},{"acceptance":0.4655052868781418,"acs":5371,"articleLive":2,"columnArticles":88,"formTitle":"[1292]Maximum Side Length of a Square with Sum Less than or Equal to Threshold","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":11538,"title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35484692253834893,"acs":11150,"articleLive":2,"columnArticles":111,"formTitle":"[1293]Shortest Path in a Grid with Obstacles Elimination","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":31422,"title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6644370122630993,"acs":5960,"articleLive":2,"columnArticles":67,"formTitle":"[1294]Weather Type in Each Country","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":8970,"title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8096345514950166,"acs":46303,"articleLive":2,"columnArticles":612,"formTitle":"[1295]Find Numbers with Even Number of Digits","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":57190,"title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.44872357774571914,"acs":7154,"articleLive":2,"columnArticles":115,"formTitle":"[1296]Divide Array in Sets of K Consecutive Numbers","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":15943,"title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45646949375920615,"acs":5888,"articleLive":2,"columnArticles":85,"formTitle":"[1297]Maximum Number of Occurrences of a Substring","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":12899,"title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5968599033816425,"acs":2471,"articleLive":2,"columnArticles":85,"formTitle":"[1298]Maximum Candies You Can Get from Boxes","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4140,"title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7842169491525424,"acs":28918,"articleLive":2,"columnArticles":410,"formTitle":"[1299]Replace Elements with Greatest Element on Right Side","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":36875,"title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46904946376870693,"acs":23005,"articleLive":2,"columnArticles":353,"formTitle":"[1300]Sum of Mutated Array Closest to Target","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":49046,"title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3500143389733295,"acs":2441,"articleLive":2,"columnArticles":60,"formTitle":"[1301]Number of Paths with Max Score","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":6974,"title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8157091439245524,"acs":17904,"articleLive":2,"columnArticles":268,"formTitle":"[1302]Deepest Leaves Sum","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":21949,"title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8191217224472394,"acs":7685,"articleLive":2,"columnArticles":76,"formTitle":"[1303]Find the Team Size","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":9382,"title":"Find the Team Size","titleSlug":"find-the-team-size"},{"acceptance":0.7277318806594755,"acs":20172,"articleLive":2,"columnArticles":358,"formTitle":"[1304]Find N Unique Integers Sum up to Zero","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":27719,"title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7459537417872977,"acs":13965,"articleLive":2,"columnArticles":210,"formTitle":"[1305]All Elements in Two Binary Search Trees","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":18721,"title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5767959579075334,"acs":15183,"articleLive":2,"columnArticles":241,"formTitle":"[1306]Jump Game III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":26323,"title":"Jump Game III","titleSlug":"jump-game-iii"},{"acceptance":0.3321265243902439,"acs":1743,"articleLive":2,"columnArticles":52,"formTitle":"[1307]Verbal Arithmetic Puzzle","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5248,"title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7557046979865771,"acs":4504,"articleLive":2,"columnArticles":55,"formTitle":"[1308]Running Total for Different Genders","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":5960,"title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7549602223713218,"acs":15753,"articleLive":2,"columnArticles":267,"formTitle":"[1309]Decrypt String from Alphabet to Integer Mapping","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":20866,"title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7117596432204053,"acs":36388,"articleLive":2,"columnArticles":497,"formTitle":"[1310]XOR Queries of a Subarray","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"","submitted":51124,"title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3725971961266079,"acs":5156,"articleLive":2,"columnArticles":81,"formTitle":"[1311]Get Watched Videos by Your Friends","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":13838,"title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6561160053013175,"acs":8416,"articleLive":2,"columnArticles":133,"formTitle":"[1312]Minimum Insertion Steps to Make a String Palindrome","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":12827,"title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8302400942701429,"acs":33819,"articleLive":2,"columnArticles":519,"formTitle":"[1313]Decompress Run-Length Encoded List","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":40734,"title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7273812569284557,"acs":8530,"articleLive":2,"columnArticles":139,"formTitle":"[1314]Matrix Block Sum","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":11727,"title":"Matrix Block Sum","titleSlug":"matrix-block-sum"},{"acceptance":0.8093638745213945,"acs":12049,"articleLive":2,"columnArticles":242,"formTitle":"[1315]Sum of Nodes with Even-Valued Grandparent","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":14887,"title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43227913372292887,"acs":2515,"articleLive":2,"columnArticles":52,"formTitle":"[1316]Distinct Echo Substrings","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":5818,"title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6137439222042139,"acs":9467,"articleLive":2,"columnArticles":174,"formTitle":"[1317]Convert Integer to the Sum of Two No-Zero Integers","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"","submitted":15425,"title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6463582226294091,"acs":5644,"articleLive":2,"columnArticles":97,"formTitle":"[1318]Minimum Flips to Make a OR b Equal to c","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":8732,"title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6182703444725666,"acs":28825,"articleLive":2,"columnArticles":491,"formTitle":"[1319]Number of Operations to Make Network Connected","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":46622,"title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5868638756580596,"acs":2341,"articleLive":2,"columnArticles":54,"formTitle":"[1320]Minimum Distance to Type a Word Using Two Fingers","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":3989,"title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6222633883462445,"acs":3695,"articleLive":2,"columnArticles":70,"formTitle":"[1321]Restaurant Growth","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":5938,"title":"Restaurant Growth","titleSlug":"restaurant-growth"},{"acceptance":0.5918127125294271,"acs":4525,"articleLive":2,"columnArticles":55,"formTitle":"[1322]Ads Performance","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":7646,"title":"Ads Performance","titleSlug":"ads-performance"},{"acceptance":0.7542578267653797,"acs":22719,"articleLive":2,"columnArticles":449,"formTitle":"[1323]Maximum 69 Number","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":30121,"title":"Maximum 69 Number","titleSlug":"maximum-69-number"},{"acceptance":0.5902680589945096,"acs":5483,"articleLive":2,"columnArticles":107,"formTitle":"[1324]Print Words Vertically","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9289,"title":"Print Words Vertically","titleSlug":"print-words-vertically"},{"acceptance":0.7253174603174604,"acs":9139,"articleLive":2,"columnArticles":163,"formTitle":"[1325]Delete Leaves With a Given Value","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":12600,"title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4718103606077247,"acs":5155,"articleLive":2,"columnArticles":90,"formTitle":"[1326]Minimum Number of Taps to Open to Water a Garden","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":10926,"title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6955104459919988,"acs":4694,"articleLive":2,"columnArticles":50,"formTitle":"[1327]List the Products Ordered in a Period","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":6749,"title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45103005741303615,"acs":5342,"articleLive":2,"columnArticles":108,"formTitle":"[1328]Break a Palindrome","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":11844,"title":"Break a Palindrome","titleSlug":"break-a-palindrome"},{"acceptance":0.7765789792702146,"acs":6406,"articleLive":2,"columnArticles":148,"formTitle":"[1329]Sort the Matrix Diagonally","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8249,"title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37218045112781956,"acs":1089,"articleLive":2,"columnArticles":26,"formTitle":"[1330]Reverse Subarray To Maximize Array Value","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":2926,"title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5342465753424658,"acs":10491,"articleLive":2,"columnArticles":182,"formTitle":"[1331]Rank Transform of an Array","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":19637,"title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6782754223780683,"acs":8511,"articleLive":2,"columnArticles":127,"formTitle":"[1332]Remove Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"","submitted":12548,"title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5413197335553706,"acs":5201,"articleLive":2,"columnArticles":113,"formTitle":"[1333]Filter Restaurants by Vegan-Friendly, Price and Distance","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":9608,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.47727975270479134,"acs":4632,"articleLive":2,"columnArticles":77,"formTitle":"[1334]Find the City With the Smallest Number of Neighbors at a Threshold Distance","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":9705,"title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5802981694659369,"acs":3075,"articleLive":2,"columnArticles":52,"formTitle":"[1335]Minimum Difficulty of a Job Schedule","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5299,"title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.43636363636363634,"acs":1512,"articleLive":2,"columnArticles":43,"formTitle":"[1336]Number of Transactions per Visit","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":3465,"title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.6578041602234749,"acs":13187,"articleLive":2,"columnArticles":267,"formTitle":"[1337]The K Weakest Rows in a Matrix","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"","submitted":20047,"title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6378100140383716,"acs":8178,"articleLive":2,"columnArticles":111,"formTitle":"[1338]Reduce Array Size to The Half","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"","submitted":12822,"title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3920650959953199,"acs":7372,"articleLive":2,"columnArticles":120,"formTitle":"[1339]Maximum Product of Splitted Binary Tree","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":18803,"title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5696686491079015,"acs":4023,"articleLive":2,"columnArticles":89,"formTitle":"[1340]Jump Game V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7062,"title":"Jump Game V","titleSlug":"jump-game-v"},{"acceptance":0.4937150837988827,"acs":2828,"articleLive":2,"columnArticles":43,"formTitle":"[1341]Movie Rating","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":5728,"title":"Movie Rating","titleSlug":"movie-rating"},{"acceptance":0.8201729457616109,"acs":40405,"articleLive":2,"columnArticles":618,"formTitle":"[1342]Number of Steps to Reduce a Number to Zero","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":49264,"title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5385813456746174,"acs":12103,"articleLive":2,"columnArticles":205,"formTitle":"[1343]Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":22472,"title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5904208680403332,"acs":5387,"articleLive":2,"columnArticles":113,"formTitle":"[1344]Angle Between Hands of a Clock","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9124,"title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36539811824181995,"acs":5204,"articleLive":2,"columnArticles":101,"formTitle":"[1345]Jump Game IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":14242,"title":"Jump Game IV","titleSlug":"jump-game-iv"},{"acceptance":0.437919618823675,"acs":14154,"articleLive":2,"columnArticles":237,"formTitle":"[1346]Check If N and Its Double Exist","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":32321,"title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7339338123671694,"acs":7252,"articleLive":2,"columnArticles":104,"formTitle":"[1347]Minimum Number of Steps to Make Two Strings Anagram","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"","submitted":9881,"title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.29829032600615907,"acs":2809,"articleLive":2,"columnArticles":46,"formTitle":"[1348]Tweet Counts Per Frequency","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":9417,"title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.4947033898305085,"acs":2802,"articleLive":2,"columnArticles":92,"formTitle":"[1349]Maximum Students Taking Exam","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":5664,"title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8453176310723587,"acs":7465,"articleLive":2,"columnArticles":79,"formTitle":"[1350]Students With Invalid Departments","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":8831,"title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7544071156834378,"acs":28159,"articleLive":2,"columnArticles":515,"formTitle":"[1351]Count Negative Numbers in a Sorted Matrix","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":37326,"title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44039808330261704,"acs":5974,"articleLive":2,"columnArticles":67,"formTitle":"[1352]Product of the Last K Numbers","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":13565,"title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.27944869307156717,"acs":9793,"articleLive":2,"columnArticles":138,"formTitle":"[1353]Maximum Number of Events That Can Be Attended","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":35044,"title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28521720792914385,"acs":2705,"articleLive":2,"columnArticles":65,"formTitle":"[1354]Construct Target Array With Multiple Sums","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":9484,"title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6636550308008213,"acs":3232,"articleLive":2,"columnArticles":51,"formTitle":"[1355]Activity Participants","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":4870,"title":"Activity Participants","titleSlug":"activity-participants"},{"acceptance":0.7320998647801854,"acs":44396,"articleLive":2,"columnArticles":486,"formTitle":"[1356]Sort Integers by The Number of 1 Bits","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":60642,"title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5251850776600377,"acs":3618,"articleLive":2,"columnArticles":39,"formTitle":"[1357]Apply Discount Every n Orders","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":6889,"title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.47891625615763544,"acs":4861,"articleLive":2,"columnArticles":97,"formTitle":"[1358]Number of Substrings Containing All Three Characters","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":10150,"title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5458627325208467,"acs":2553,"articleLive":2,"columnArticles":64,"formTitle":"[1359]Count All Valid Pickup and Delivery Options","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":4677,"title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5004817883985354,"acs":7791,"articleLive":2,"columnArticles":130,"formTitle":"[1360]Number of Days Between Two Dates","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":15567,"title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4046246246246246,"acs":6737,"articleLive":2,"columnArticles":180,"formTitle":"[1361]Validate Binary Tree Nodes","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":16650,"title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5204092395316949,"acs":4934,"articleLive":2,"columnArticles":66,"formTitle":"[1362]Closest Divisors","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9481,"title":"Closest Divisors","titleSlug":"closest-divisors"},{"acceptance":0.3574196673663814,"acs":4427,"articleLive":2,"columnArticles":94,"formTitle":"[1363]Largest Multiple of Three","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":12386,"title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6794075489727663,"acs":2844,"articleLive":2,"columnArticles":59,"formTitle":"[1364]Number of Trusted Contacts of a Customer","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4186,"title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8253674808347315,"acs":82148,"articleLive":2,"columnArticles":1040,"formTitle":"[1365]How Many Numbers Are Smaller Than the Current Number","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":99529,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5340027757367949,"acs":6541,"articleLive":2,"columnArticles":134,"formTitle":"[1366]Rank Teams by Votes","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12249,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4127987709398174,"acs":13972,"articleLive":2,"columnArticles":210,"formTitle":"[1367]Linked List in Binary Tree","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"","submitted":33847,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5143388621919083,"acs":3318,"articleLive":2,"columnArticles":81,"formTitle":"[1368]Minimum Cost to Make at Least One Valid Path in a Grid","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6451,"title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.610800223838836,"acs":2183,"articleLive":2,"columnArticles":37,"formTitle":"[1369]Get the Second Most Recent Activity","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":3574,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905718701700154,"acs":47058,"articleLive":2,"columnArticles":565,"formTitle":"[1370]Increasing Decreasing String","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":59524,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5791834519013742,"acs":20272,"articleLive":2,"columnArticles":258,"formTitle":"[1371]Find the Longest Substring Containing Vowels in Even Counts","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":35001,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5097518350227194,"acs":7292,"articleLive":2,"columnArticles":144,"formTitle":"[1372]Longest ZigZag Path in a Binary Tree","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":14305,"title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.389892488846632,"acs":5331,"articleLive":2,"columnArticles":128,"formTitle":"[1373]Maximum Sum BST in Binary Tree","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":13673,"title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7385455881002663,"acs":16087,"articleLive":2,"columnArticles":215,"formTitle":"[1374]Generate a String With Characters That Have Odd Counts","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":21782,"title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5665284318549237,"acs":8060,"articleLive":2,"columnArticles":164,"formTitle":"[1375]Bulb Switcher III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14227,"title":"Bulb Switcher III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5024541267084498,"acs":6654,"articleLive":2,"columnArticles":141,"formTitle":"[1376]Time Needed to Inform All Employees","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":13243,"title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3245628642797669,"acs":3898,"articleLive":2,"columnArticles":123,"formTitle":"[1377]Frog Position After T Seconds","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12010,"title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8598231037255427,"acs":6416,"articleLive":2,"columnArticles":56,"formTitle":"[1378]Replace Employee ID With The Unique Identifier","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":7462,"title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.834510074048562,"acs":9692,"articleLive":2,"columnArticles":152,"formTitle":"[1379]Find a Corresponding Node of a Binary Tree in a Clone of That Tree","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":11614,"title":"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7258438427299704,"acs":15655,"articleLive":2,"columnArticles":232,"formTitle":"[1380]Lucky Numbers in a Matrix","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":21568,"title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7325723603750509,"acs":10782,"articleLive":2,"columnArticles":138,"formTitle":"[1381]Design a Stack With Increment Operation","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"","submitted":14718,"title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6875842975793285,"acs":9686,"articleLive":2,"columnArticles":153,"formTitle":"[1382]Balance a Binary Search Tree","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":14087,"title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3216072895660617,"acs":4306,"articleLive":2,"columnArticles":84,"formTitle":"[1383]Maximum Performance of a Team","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13389,"title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5568801089918256,"acs":1635,"articleLive":2,"columnArticles":39,"formTitle":"[1384]Total Sales Amount by Year","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":2936,"title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7047459777406148,"acs":12221,"articleLive":2,"columnArticles":183,"formTitle":"[1385]Find the Distance Value Between Two Arrays","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":17341,"title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.30883760501967455,"acs":5808,"articleLive":2,"columnArticles":121,"formTitle":"[1386]Cinema Seat Allocation","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":18806,"title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6951945080091533,"acs":9114,"articleLive":2,"columnArticles":154,"formTitle":"[1387]Sort Integers by The Power Value","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13110,"title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5315749811605124,"acs":3527,"articleLive":2,"columnArticles":50,"formTitle":"[1388]Pizza With 3n Slices","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":6635,"title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8296109952141367,"acs":27042,"articleLive":2,"columnArticles":464,"formTitle":"[1389]Create Target Array in the Given Order","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":32596,"title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.34809384164222873,"acs":5935,"articleLive":2,"columnArticles":111,"formTitle":"[1390]Four Divisors","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17050,"title":"Four Divisors","titleSlug":"four-divisors"},{"acceptance":0.3980835131361848,"acs":6273,"articleLive":2,"columnArticles":192,"formTitle":"[1391]Check if There is a Valid Path in a Grid","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":15758,"title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.38702474351237176,"acs":6413,"articleLive":2,"columnArticles":121,"formTitle":"[1392]Longest Happy Prefix","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":16570,"title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix"},{"acceptance":0.8600249066002491,"acs":3453,"articleLive":2,"columnArticles":54,"formTitle":"[1393]Capital Gain/Loss","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4015,"title":"Capital Gain/Loss","titleSlug":"capital-gainloss"},{"acceptance":0.6631250527025887,"acs":15728,"articleLive":2,"columnArticles":247,"formTitle":"[1394]Find Lucky Integer in an Array","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":23718,"title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7621720701111239,"acs":13306,"articleLive":2,"columnArticles":198,"formTitle":"[1395]Count Number of Teams","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":17458,"title":"Count Number of Teams","titleSlug":"count-number-of-teams"},{"acceptance":0.42726119058606365,"acs":7407,"articleLive":2,"columnArticles":119,"formTitle":"[1396]Design Underground System","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":17336,"title":"Design Underground System","titleSlug":"design-underground-system"},{"acceptance":0.36283185840707965,"acs":943,"articleLive":2,"columnArticles":35,"formTitle":"[1397]Find All Good Strings","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2599,"title":"Find All Good Strings","titleSlug":"find-all-good-strings"},{"acceptance":0.7912824811399832,"acs":3776,"articleLive":2,"columnArticles":59,"formTitle":"[1398]Customers Who Bought Products A and B but Not C","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":4772,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6647648419429453,"acs":8622,"articleLive":2,"columnArticles":141,"formTitle":"[1399]Count Largest Group","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":12970,"title":"Count Largest Group","titleSlug":"count-largest-group"},{"acceptance":0.603916386352715,"acs":5027,"articleLive":2,"columnArticles":84,"formTitle":"[1400]Construct K Palindrome Strings","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":8324,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4121317157712305,"acs":3567,"articleLive":2,"columnArticles":85,"formTitle":"[1401]Circle and Rectangle Overlapping","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":8655,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7484001347254968,"acs":8888,"articleLive":2,"columnArticles":157,"formTitle":"[1402]Reducing Dishes","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":11876,"title":"Reducing Dishes","titleSlug":"reducing-dishes"},{"acceptance":0.6904868707083952,"acs":20011,"articleLive":2,"columnArticles":343,"formTitle":"[1403]Minimum Subsequence in Non-Increasing Order","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":28981,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4901315789473684,"acs":6854,"articleLive":2,"columnArticles":142,"formTitle":"[1404]Number of Steps to Reduce a Number in Binary Representation to One","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":13984,"title":"Number of Steps to Reduce a Number in Binary Representation to One","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5034354142127994,"acs":5129,"articleLive":2,"columnArticles":128,"formTitle":"[1405]Longest Happy String","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10188,"title":"Longest Happy String","titleSlug":"longest-happy-string"},{"acceptance":0.5648776738824132,"acs":4410,"articleLive":2,"columnArticles":78,"formTitle":"[1406]Stone Game III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":7807,"title":"Stone Game III","titleSlug":"stone-game-iii"},{"acceptance":0.6638688524590164,"acs":5062,"articleLive":2,"columnArticles":59,"formTitle":"[1407]Top Travellers","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":7625,"title":"Top Travellers","titleSlug":"top-travellers"},{"acceptance":0.6119759287810216,"acs":12305,"articleLive":2,"columnArticles":187,"formTitle":"[1408]String Matching in an Array","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":20107,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8042127435492364,"acs":7636,"articleLive":2,"columnArticles":123,"formTitle":"[1409]Queries on a Permutation With Key","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9495,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47892849895149836,"acs":7080,"articleLive":2,"columnArticles":114,"formTitle":"[1410]HTML Entity Parser","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"","submitted":14783,"title":"HTML Entity Parser","titleSlug":"html-entity-parser"},{"acceptance":0.5409654736509442,"acs":6847,"articleLive":2,"columnArticles":129,"formTitle":"[1411]Number of Ways to Paint N × 3 Grid","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":12657,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5641966250917094,"acs":2307,"articleLive":2,"columnArticles":55,"formTitle":"[1412]Find the Quiet Students in All Exams","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":4089,"title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6890429369738983,"acs":9741,"articleLive":2,"columnArticles":198,"formTitle":"[1413]Minimum Value to Get Positive Step by Step Sum","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":14137,"title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.5963278802645319,"acs":6853,"articleLive":2,"columnArticles":138,"formTitle":"[1414]Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":11492,"title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.684146069917613,"acs":6145,"articleLive":2,"columnArticles":162,"formTitle":"[1415]The k-th Lexicographical String of All Happy Strings of Length n","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":8982,"title":"The k-th Lexicographical String of All Happy Strings of Length n","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40765313994753893,"acs":2642,"articleLive":2,"columnArticles":46,"formTitle":"[1416]Restore The Array","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6481,"title":"Restore The Array","titleSlug":"restore-the-array"},{"acceptance":0.5168534501266693,"acs":12037,"articleLive":2,"columnArticles":174,"formTitle":"[1417]Reformat The String","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":23289,"title":"Reformat The String","titleSlug":"reformat-the-string"},{"acceptance":0.5886346217015219,"acs":5376,"articleLive":2,"columnArticles":97,"formTitle":"[1418]Display Table of Food Orders in a Restaurant","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"","submitted":9133,"title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41409021794221995,"acs":7353,"articleLive":2,"columnArticles":145,"formTitle":"[1419]Minimum Number of Frogs Croaking","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":17757,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5871821484172288,"acs":2263,"articleLive":2,"columnArticles":42,"formTitle":"[1420]Build Array Where You Can Find The Maximum Exactly K Comparisons","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":3854,"title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7470967741935484,"acs":2316,"articleLive":2,"columnArticles":32,"formTitle":"[1421]NPV Queries","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3100,"title":"NPV Queries","titleSlug":"npv-queries"},{"acceptance":0.5405767940979208,"acs":9672,"articleLive":2,"columnArticles":177,"formTitle":"[1422]Maximum Score After Splitting a String","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":17892,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5536887744732741,"acs":32692,"articleLive":2,"columnArticles":490,"formTitle":"[1423]Maximum Points You Can Obtain from Cards","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"","submitted":59044,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3932693554662171,"acs":6065,"articleLive":2,"columnArticles":124,"formTitle":"[1424]Diagonal Traverse II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":15422,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4318454164170162,"acs":2883,"articleLive":2,"columnArticles":66,"formTitle":"[1425]Constrained Subsequence Sum","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":6676,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6993795826283136,"acs":1240,"articleLive":2,"columnArticles":41,"formTitle":"[1426]Counting Elements","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":1773,"title":"Counting Elements","titleSlug":"counting-elements"},{"acceptance":0.66190833959429,"acs":881,"articleLive":2,"columnArticles":41,"formTitle":"[1427]Perform String Shifts","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1331,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"},{"acceptance":0.592737978410206,"acs":604,"articleLive":2,"columnArticles":19,"formTitle":"[1428]Leftmost Column with at Least a One","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1019,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5002733734281027,"acs":915,"articleLive":2,"columnArticles":30,"formTitle":"[1429]First Unique Number","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":1829,"title":"First Unique Number","titleSlug":"first-unique-number"},{"acceptance":0.5765765765765766,"acs":576,"articleLive":2,"columnArticles":24,"formTitle":"[1430]Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":999,"title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8455909902364842,"acs":76734,"articleLive":2,"columnArticles":1014,"formTitle":"[1431]Kids With the Greatest Number of Candies","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":90746,"title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39230486008836524,"acs":4262,"articleLive":2,"columnArticles":93,"formTitle":"[1432]Max Difference You Can Get From Changing an Integer","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":10864,"title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6388793202434263,"acs":5564,"articleLive":2,"columnArticles":92,"formTitle":"[1433]Check If a String Can Break Another String","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":8709,"title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.44111736334405144,"acs":2195,"articleLive":2,"columnArticles":44,"formTitle":"[1434]Number of Ways to Wear Different Hats to Each Other","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":4976,"title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6259445843828715,"acs":3479,"articleLive":2,"columnArticles":43,"formTitle":"[1435]Create a Session Bar Chart","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":5558,"title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7825115562403698,"acs":20314,"articleLive":2,"columnArticles":348,"formTitle":"[1436]Destination City","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":25960,"title":"Destination City","titleSlug":"destination-city"},{"acceptance":0.5914713744016908,"acs":9515,"articleLive":2,"columnArticles":156,"formTitle":"[1437]Check If All 1's Are at Least Length K Places Away","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":16087,"title":"Check If All 1's Are at Least Length K Places Away","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4812719530011501,"acs":30966,"articleLive":2,"columnArticles":450,"formTitle":"[1438]Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":64342,"title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.561143818334735,"acs":3336,"articleLive":2,"columnArticles":52,"formTitle":"[1439]Find the Kth Smallest Sum of a Matrix With Sorted Rows","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":5945,"title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6993808049535604,"acs":2259,"articleLive":2,"columnArticles":32,"formTitle":"[1440]Evaluate Boolean Expression","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3230,"title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6463026254466366,"acs":16641,"articleLive":2,"columnArticles":339,"formTitle":"[1441]Build an Array With Stack Operations","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"","submitted":25748,"title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7924194449618178,"acs":34036,"articleLive":2,"columnArticles":369,"formTitle":"[1442]Count Triplets That Can Form Two Arrays of Equal XOR","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"","submitted":42952,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4102943466749727,"acs":5269,"articleLive":2,"columnArticles":133,"formTitle":"[1443]Minimum Time to Collect All Apples in a Tree","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":12842,"title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5195220823554513,"acs":2435,"articleLive":2,"columnArticles":60,"formTitle":"[1444]Number of Ways of Cutting a Pizza","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4687,"title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8589776521962497,"acs":3344,"articleLive":2,"columnArticles":45,"formTitle":"[1445]Apples & Oranges","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":3893,"title":"Apples & Oranges","titleSlug":"apples-oranges"},{"acceptance":0.5727010350318471,"acs":11509,"articleLive":2,"columnArticles":197,"formTitle":"[1446]Consecutive Characters","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":20096,"title":"Consecutive Characters","titleSlug":"consecutive-characters"},{"acceptance":0.6175383581588084,"acs":5514,"articleLive":2,"columnArticles":67,"formTitle":"[1447]Simplified Fractions","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":8929,"title":"Simplified Fractions","titleSlug":"simplified-fractions"},{"acceptance":0.712143411186762,"acs":8263,"articleLive":2,"columnArticles":126,"formTitle":"[1448]Count Good Nodes in Binary Tree","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":11603,"title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6286492030929461,"acs":15935,"articleLive":2,"columnArticles":202,"formTitle":"[1449]Form Largest Integer With Digits That Add up to Target","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"","submitted":25348,"title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8019808861859253,"acs":23077,"articleLive":2,"columnArticles":328,"formTitle":"[1450]Number of Students Doing Homework at a Given Time","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":28775,"title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5187230752236828,"acs":9392,"articleLive":2,"columnArticles":146,"formTitle":"[1451]Rearrange Words in a Sentence","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":18106,"title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4968829572394416,"acs":5659,"articleLive":2,"columnArticles":84,"formTitle":"[1452]People Whose List of Favorite Companies Is Not a Subset of Another List","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11389,"title":"People Whose List of Favorite Companies Is Not a Subset of Another List","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.35896840148698883,"acs":1545,"articleLive":2,"columnArticles":30,"formTitle":"[1453]Maximum Number of Darts Inside of a Circular Dartboard","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4304,"title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4079238388306568,"acs":4242,"articleLive":2,"columnArticles":68,"formTitle":"[1454]Active Users","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":10399,"title":"Active Users","titleSlug":"active-users"},{"acceptance":0.6333486080879825,"acs":11057,"articleLive":2,"columnArticles":178,"formTitle":"[1455]Check If a Word Occurs As a Prefix of Any Word in a Sentence","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":17458,"title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5131566756230891,"acs":11077,"articleLive":2,"columnArticles":176,"formTitle":"[1456]Maximum Number of Vowels in a Substring of Given Length","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":21586,"title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6391168259876491,"acs":7555,"articleLive":2,"columnArticles":132,"formTitle":"[1457]Pseudo-Palindromic Paths in a Binary Tree","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":11821,"title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4392638036809816,"acs":5370,"articleLive":2,"columnArticles":85,"formTitle":"[1458]Max Dot Product of Two Subsequences","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12225,"title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5906143871565298,"acs":1913,"articleLive":2,"columnArticles":42,"formTitle":"[1459]Rectangles Area","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3239,"title":"Rectangles Area","titleSlug":"rectangles-area"},{"acceptance":0.7428451839062419,"acs":14198,"articleLive":2,"columnArticles":290,"formTitle":"[1460]Make Two Arrays Equal by Reversing Sub-arrays","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"","submitted":19113,"title":"Make Two Arrays Equal by Reversing Sub-arrays","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.4959820594281443,"acs":5308,"articleLive":2,"columnArticles":77,"formTitle":"[1461]Check If a String Contains All Binary Codes of Size K","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":10702,"title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4219385265896894,"acs":5189,"articleLive":2,"columnArticles":108,"formTitle":"[1462]Course Schedule IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":12298,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5866013071895425,"acs":2513,"articleLive":2,"columnArticles":60,"formTitle":"[1463]Cherry Pickup II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4284,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.767840272091705,"acs":24382,"articleLive":2,"columnArticles":333,"formTitle":"[1464]Maximum Product of Two Elements in an Array","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":31754,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3053248910110027,"acs":5883,"articleLive":2,"columnArticles":70,"formTitle":"[1465]Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":19268,"title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48244440728975085,"acs":5771,"articleLive":2,"columnArticles":119,"formTitle":"[1466]Reorder Routes to Make All Paths Lead to the City Zero","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":11962,"title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6056,"acs":1514,"articleLive":2,"columnArticles":44,"formTitle":"[1467]Probability of a Two Boxes Having The Same Number of Distinct Balls","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2500,"title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7194202898550724,"acs":2482,"articleLive":2,"columnArticles":44,"formTitle":"[1468]Calculate Salaries","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":3450,"title":"Calculate Salaries","titleSlug":"calculate-salaries"},{"acceptance":0.8029045643153527,"acs":1935,"articleLive":2,"columnArticles":70,"formTitle":"[1469]Find All The Lonely Nodes","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2410,"title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434446753841873,"acs":51537,"articleLive":2,"columnArticles":706,"formTitle":"[1470]Shuffle the Array","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":61103,"title":"Shuffle the Array","titleSlug":"shuffle-the-array"},{"acceptance":0.5387629658086823,"acs":7012,"articleLive":2,"columnArticles":95,"formTitle":"[1471]The k Strongest Values in an Array","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13015,"title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6134975273926113,"acs":6327,"articleLive":2,"columnArticles":109,"formTitle":"[1472]Design Browser History","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":10313,"title":"Design Browser History","titleSlug":"design-browser-history"},{"acceptance":0.6765112647780505,"acs":15164,"articleLive":2,"columnArticles":161,"formTitle":"[1473]Paint House III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22415,"title":"Paint House III","titleSlug":"paint-house-iii"},{"acceptance":0.7157848710100568,"acs":1637,"articleLive":2,"columnArticles":56,"formTitle":"[1474]Delete N Nodes After M Nodes of a Linked List","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2287,"title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7245209184554295,"acs":12590,"articleLive":2,"columnArticles":195,"formTitle":"[1475]Final Prices With a Special Discount in a Shop","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":17377,"title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652102520168488,"acs":12119,"articleLive":2,"columnArticles":107,"formTitle":"[1476]Subrectangle Queries","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14007,"title":"Subrectangle Queries","titleSlug":"subrectangle-queries"},{"acceptance":0.2850517542680468,"acs":4241,"articleLive":2,"columnArticles":89,"formTitle":"[1477]Find Two Non-overlapping Sub-arrays Each With Target Sum","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":14878,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5672299779573843,"acs":2316,"articleLive":2,"columnArticles":52,"formTitle":"[1478]Allocate Mailboxes","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4083,"title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"},{"acceptance":0.5958509412216673,"acs":1551,"articleLive":2,"columnArticles":36,"formTitle":"[1479]Sales by Day of the Week","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":2603,"title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8533852193090764,"acs":100219,"articleLive":2,"columnArticles":1052,"formTitle":"[1480]Running Sum of 1d Array","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":117437,"title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5104782075576859,"acs":9159,"articleLive":2,"columnArticles":132,"formTitle":"[1481]Least Number of Unique Integers after K Removals","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":17942,"title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5897819538372534,"acs":29564,"articleLive":2,"columnArticles":388,"formTitle":"[1482]Minimum Number of Days to Make m Bouquets","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"","submitted":50127,"title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.29795959191838367,"acs":2979,"articleLive":2,"columnArticles":64,"formTitle":"[1483]Kth Ancestor of a Tree Node","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":9998,"title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8018327605956472,"acs":700,"articleLive":2,"columnArticles":24,"formTitle":"[1484]Clone Binary Tree With Random Pointer","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":873,"title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6563624814736396,"acs":3100,"articleLive":2,"columnArticles":38,"formTitle":"[1485]Group Sold Products By The Date","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":4723,"title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8582473908478973,"acs":69488,"articleLive":2,"columnArticles":661,"formTitle":"[1486]XOR Operation in an Array","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"","submitted":80965,"title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3048796079266993,"acs":7154,"articleLive":2,"columnArticles":92,"formTitle":"[1487]Making File Names Unique","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":23465,"title":"Making File Names Unique","titleSlug":"making-file-names-unique"},{"acceptance":0.2223305894745055,"acs":5699,"articleLive":2,"columnArticles":95,"formTitle":"[1488]Avoid Flood in The City","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":25633,"title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.695065607096655,"acs":11283,"articleLive":2,"columnArticles":122,"formTitle":"[1489]Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16233,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8560411311053985,"acs":999,"articleLive":2,"columnArticles":24,"formTitle":"[1490]Clone N-ary Tree","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1167,"title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6712461092626382,"acs":18762,"articleLive":2,"columnArticles":282,"formTitle":"[1491]Average Salary Excluding the Minimum and Maximum Salary","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":27951,"title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.668135593220339,"acs":5913,"articleLive":2,"columnArticles":69,"formTitle":"[1492]The kth Factor of n","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":8850,"title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5587260034904014,"acs":6403,"articleLive":2,"columnArticles":125,"formTitle":"[1493]Longest Subarray of 1's After Deleting One Element","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":11460,"title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.35638297872340424,"acs":1876,"articleLive":2,"columnArticles":29,"formTitle":"[1494]Parallel Courses II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5264,"title":"Parallel Courses II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5425726141078838,"acs":3269,"articleLive":2,"columnArticles":36,"formTitle":"[1495]Friendly Movies Streamed Last Month","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":6025,"title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5426360903929645,"acs":9749,"articleLive":2,"columnArticles":149,"formTitle":"[1496]Path Crossing","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":17966,"title":"Path Crossing","titleSlug":"path-crossing"},{"acceptance":0.39211848717270564,"acs":7413,"articleLive":2,"columnArticles":102,"formTitle":"[1497]Check If Array Pairs Are Divisible by k","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":18905,"title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3323104819025037,"acs":4765,"articleLive":2,"columnArticles":60,"formTitle":"[1498]Number of Subsequences That Satisfy the Given Sum Condition","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":14339,"title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3717969912382212,"acs":2249,"articleLive":2,"columnArticles":50,"formTitle":"[1499]Max Value of Equation","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":6049,"title":"Max Value of Equation","titleSlug":"max-value-of-equation"},{"acceptance":0.29374605180037905,"acs":465,"articleLive":2,"columnArticles":20,"formTitle":"[1500]Design a File Sharing System","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":1583,"title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5992516037063436,"acs":3363,"articleLive":2,"columnArticles":51,"formTitle":"[1501]Countries You Can Safely Invest In","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":5612,"title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7190072602448434,"acs":23669,"articleLive":2,"columnArticles":276,"formTitle":"[1502]Can Make Arithmetic Progression From Sequence","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":32919,"title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5087517567394915,"acs":7964,"articleLive":2,"columnArticles":74,"formTitle":"[1503]Last Moment Before All Ants Fall Out of a Plank","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":15654,"title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5906040268456376,"acs":6688,"articleLive":2,"columnArticles":124,"formTitle":"[1504]Count Submatrices With All Ones","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":11324,"title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.35428770625145245,"acs":3049,"articleLive":2,"columnArticles":69,"formTitle":"[1505]Minimum Possible Integer After at Most K Adjacent Swaps On Digits","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":8606,"title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8277227722772277,"acs":418,"articleLive":2,"columnArticles":13,"formTitle":"[1506]Find Root of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":505,"title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5914044408118785,"acs":8683,"articleLive":2,"columnArticles":118,"formTitle":"[1507]Reformat Date","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":14682,"title":"Reformat Date","titleSlug":"reformat-date"},{"acceptance":0.5514784815067825,"acs":5651,"articleLive":2,"columnArticles":46,"formTitle":"[1508]Range Sum of Sorted Subarray Sums","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10247,"title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.541804382421349,"acs":4426,"articleLive":2,"columnArticles":67,"formTitle":"[1509]Minimum Difference Between Largest and Smallest Value in Three Moves","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":8169,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5743069815195072,"acs":4475,"articleLive":2,"columnArticles":61,"formTitle":"[1510]Stone Game IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":7792,"title":"Stone Game IV","titleSlug":"stone-game-iv"},{"acceptance":0.6798139158576052,"acs":3361,"articleLive":2,"columnArticles":51,"formTitle":"[1511]Customer Order Frequency","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":4944,"title":"Customer Order Frequency","titleSlug":"customer-order-frequency"},{"acceptance":0.8487146180104522,"acs":56190,"articleLive":2,"columnArticles":720,"formTitle":"[1512]Number of Good Pairs","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":66206,"title":"Number of Good Pairs","titleSlug":"number-of-good-pairs"},{"acceptance":0.37610810810810813,"acs":10437,"articleLive":2,"columnArticles":142,"formTitle":"[1513]Number of Substrings With Only 1s","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":27750,"title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3085214655810511,"acs":6669,"articleLive":2,"columnArticles":122,"formTitle":"[1514]Path with Maximum Probability","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":21616,"title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34108615948670945,"acs":2977,"articleLive":2,"columnArticles":57,"formTitle":"[1515]Best Position for a Service Centre","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":8728,"title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5297619047619048,"acs":178,"articleLive":2,"columnArticles":11,"formTitle":"[1516]Move Sub-Tree of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":336,"title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7295039164490862,"acs":2794,"articleLive":2,"columnArticles":31,"formTitle":"[1517]Find Users With Valid E-Mails","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":3830,"title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6754606610119918,"acs":23094,"articleLive":2,"columnArticles":370,"formTitle":"[1518]Water Bottles","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":34190,"title":"Water Bottles","titleSlug":"water-bottles"},{"acceptance":0.29254626747410717,"acs":5169,"articleLive":2,"columnArticles":117,"formTitle":"[1519]Number of Nodes in the Sub-Tree With the Same Label","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":17669,"title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3284245623784385,"acs":2364,"articleLive":2,"columnArticles":68,"formTitle":"[1520]Maximum Number of Non-Overlapping Substrings","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7198,"title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3949355143126769,"acs":2511,"articleLive":2,"columnArticles":49,"formTitle":"[1521]Find a Value of a Mysterious Function Closest to Target","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6358,"title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.718475073313783,"acs":490,"articleLive":2,"columnArticles":20,"formTitle":"[1522]Diameter of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":682,"title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.574298735477245,"acs":8947,"articleLive":2,"columnArticles":150,"formTitle":"[1523]Count Odd Numbers in an Interval Range","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":15579,"title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4191651969429747,"acs":4278,"articleLive":2,"columnArticles":86,"formTitle":"[1524]Number of Sub-arrays With Odd Sum","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":10206,"title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6586032526991936,"acs":4819,"articleLive":2,"columnArticles":100,"formTitle":"[1525]Number of Good Ways to Split a String","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7317,"title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6108213820078227,"acs":2811,"articleLive":2,"columnArticles":45,"formTitle":"[1526]Minimum Number of Increments on Subarrays to Form a Target Array","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":4602,"title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5223325062034739,"acs":2947,"articleLive":2,"columnArticles":31,"formTitle":"[1527]Patients With a Condition","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":5642,"title":"Patients With a Condition","titleSlug":"patients-with-a-condition"},{"acceptance":0.7836726811234344,"acs":28405,"articleLive":2,"columnArticles":333,"formTitle":"[1528]Shuffle String","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":36246,"title":"Shuffle String","titleSlug":"shuffle-string"},{"acceptance":0.6869501466275659,"acs":8433,"articleLive":2,"columnArticles":126,"formTitle":"[1529]Bulb Switcher IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12276,"title":"Bulb Switcher IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5611505780749408,"acs":8057,"articleLive":2,"columnArticles":141,"formTitle":"[1530]Number of Good Leaf Nodes Pairs","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":14358,"title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3157199471598415,"acs":1673,"articleLive":2,"columnArticles":30,"formTitle":"[1531]String Compression II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5299,"title":"String Compression II","titleSlug":"string-compression-ii"},{"acceptance":0.6229602061265388,"acs":2176,"articleLive":2,"columnArticles":44,"formTitle":"[1532]The Most Recent Three Orders","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":3493,"title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.639686684073107,"acs":245,"articleLive":2,"columnArticles":17,"formTitle":"[1533]Find the Index of the Large Integer","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":383,"title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.788100107118512,"acs":16186,"articleLive":2,"columnArticles":152,"formTitle":"[1534]Count Good Triplets","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":20538,"title":"Count Good Triplets","titleSlug":"count-good-triplets"},{"acceptance":0.45209358298233815,"acs":12773,"articleLive":2,"columnArticles":172,"formTitle":"[1535]Find the Winner of an Array Game","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":28253,"title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43673012318029114,"acs":3900,"articleLive":2,"columnArticles":75,"formTitle":"[1536]Minimum Swaps to Arrange a Binary Grid","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":8930,"title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.362241785060577,"acs":4156,"articleLive":2,"columnArticles":84,"formTitle":"[1537]Get the Maximum Score","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":11473,"title":"Get the Maximum Score","titleSlug":"get-the-maximum-score"},{"acceptance":0.5795454545454546,"acs":102,"articleLive":2,"columnArticles":6,"formTitle":"[1538]Guess the Majority in a Hidden Array","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":176,"title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5381121792445689,"acs":14218,"articleLive":2,"columnArticles":212,"formTitle":"[1539]Kth Missing Positive Number","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":26422,"title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3131557150745444,"acs":4537,"articleLive":2,"columnArticles":82,"formTitle":"[1540]Can Convert String in K Moves","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":14488,"title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4551327433628319,"acs":5143,"articleLive":2,"columnArticles":84,"formTitle":"[1541]Minimum Insertions to Balance a Parentheses String","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"","submitted":11300,"title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.37288702928870293,"acs":2228,"articleLive":2,"columnArticles":44,"formTitle":"[1542]Find Longest Awesome Substring","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":5975,"title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5433927331636196,"acs":2348,"articleLive":2,"columnArticles":38,"formTitle":"[1543]Fix Product Name Format","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":4321,"title":"Fix Product Name Format","titleSlug":"fix-product-name-format"},{"acceptance":0.5387086996059411,"acs":17772,"articleLive":2,"columnArticles":285,"formTitle":"[1544]Make The String Great","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"","submitted":32990,"title":"Make The String Great","titleSlug":"make-the-string-great"},{"acceptance":0.5500669660442764,"acs":6982,"articleLive":2,"columnArticles":95,"formTitle":"[1545]Find Kth Bit in Nth Binary String","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":12693,"title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4052108330476517,"acs":4728,"articleLive":2,"columnArticles":70,"formTitle":"[1546]Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":11668,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5303820668264486,"acs":3762,"articleLive":2,"columnArticles":66,"formTitle":"[1547]Minimum Cost to Cut a Stick","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7093,"title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.6989795918367347,"acs":274,"articleLive":2,"columnArticles":11,"formTitle":"[1548]The Most Similar Path in a Graph","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":392,"title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6704851752021563,"acs":1990,"articleLive":2,"columnArticles":43,"formTitle":"[1549]The Most Recent Orders for Each Product","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":2968,"title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6596105841238142,"acs":19818,"articleLive":2,"columnArticles":271,"formTitle":"[1550]Three Consecutive Odds","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":30045,"title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds"},{"acceptance":0.8162293033427054,"acs":10451,"articleLive":2,"columnArticles":134,"formTitle":"[1551]Minimum Operations to Make Array Equal","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":12804,"title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5055194406966761,"acs":8243,"articleLive":2,"columnArticles":108,"formTitle":"[1552]Magnetic Force Between Two Balls","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":16306,"title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2902766476810415,"acs":7135,"articleLive":2,"columnArticles":113,"formTitle":"[1553]Minimum Number of Days to Eat N Oranges","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":24580,"title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7037671232876712,"acs":411,"articleLive":2,"columnArticles":17,"formTitle":"[1554]Strings Differ by One Character","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":584,"title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4382943143812709,"acs":2621,"articleLive":2,"columnArticles":51,"formTitle":"[1555]Bank Account Summary","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":5980,"title":"Bank Account Summary","titleSlug":"bank-account-summary"},{"acceptance":0.5837837837837838,"acs":9396,"articleLive":2,"columnArticles":142,"formTitle":"[1556]Thousand Separator","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":16095,"title":"Thousand Separator","titleSlug":"thousand-separator"},{"acceptance":0.7538425710293433,"acs":6474,"articleLive":2,"columnArticles":82,"formTitle":"[1557]Minimum Number of Vertices to Reach All Nodes","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":8588,"title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6191813211171864,"acs":4190,"articleLive":2,"columnArticles":67,"formTitle":"[1558]Minimum Numbers of Function Calls to Make Target Array","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":6767,"title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.35966831740181965,"acs":3123,"articleLive":2,"columnArticles":57,"formTitle":"[1559]Detect Cycles in 2D Grid","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","submitted":8683,"title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5725789362152999,"acs":8106,"articleLive":2,"columnArticles":82,"formTitle":"[1560]Most Visited Sector in  a Circular Track","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14157,"title":"Most Visited Sector in  a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7781304096941719,"acs":10788,"articleLive":2,"columnArticles":140,"formTitle":"[1561]Maximum Number of Coins You Can Get","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":13864,"title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30822484761833097,"acs":4096,"articleLive":2,"columnArticles":81,"formTitle":"[1562]Find Latest Group of Size M","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13289,"title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3760262725779967,"acs":3664,"articleLive":2,"columnArticles":62,"formTitle":"[1563]Stone Game V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":9744,"title":"Stone Game V","titleSlug":"stone-game-v"},{"acceptance":0.574331550802139,"acs":537,"articleLive":2,"columnArticles":17,"formTitle":"[1564]Put Boxes Into the Warehouse I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":935,"title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7251693002257337,"acs":2570,"articleLive":2,"columnArticles":37,"formTitle":"[1565]Unique Orders and Customers Per Month","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":3544,"title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4433165157133305,"acs":7293,"articleLive":2,"columnArticles":112,"formTitle":"[1566]Detect Pattern of Length M Repeated K or More Times","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":16451,"title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.34976783968719455,"acs":5725,"articleLive":2,"columnArticles":107,"formTitle":"[1567]Maximum Length of Subarray With Positive Product","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":16368,"title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4603297769156159,"acs":2373,"articleLive":2,"columnArticles":43,"formTitle":"[1568]Minimum Number of Days to Disconnect Island","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5155,"title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4665030674846626,"acs":1901,"articleLive":2,"columnArticles":40,"formTitle":"[1569]Number of Ways to Reorder Array to Get Same BST","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4075,"title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.899075500770416,"acs":1167,"articleLive":2,"columnArticles":31,"formTitle":"[1570]Dot Product of Two Sparse Vectors","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1298,"title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7573333333333333,"acs":2840,"articleLive":2,"columnArticles":39,"formTitle":"[1571]Warehouse Manager","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":3750,"title":"Warehouse Manager","titleSlug":"warehouse-manager"},{"acceptance":0.8062054240675964,"acs":17747,"articleLive":2,"columnArticles":302,"formTitle":"[1572]Matrix Diagonal Sum","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":22013,"title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2938276896699529,"acs":4113,"articleLive":2,"columnArticles":57,"formTitle":"[1573]Number of Ways to Split a String","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":13998,"title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3235383910853305,"acs":4239,"articleLive":2,"columnArticles":71,"formTitle":"[1574]Shortest Subarray to be Removed to Make Array Sorted","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":13102,"title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5919223129551975,"acs":2682,"articleLive":2,"columnArticles":53,"formTitle":"[1575]Count All Possible Routes","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":4531,"title":"Count All Possible Routes","titleSlug":"count-all-possible-routes"},{"acceptance":0.47411537148708616,"acs":16668,"articleLive":2,"columnArticles":235,"formTitle":"[1576]Replace All ?'s to Avoid Consecutive Repeating Characters","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":35156,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3202597058433815,"acs":4834,"articleLive":2,"columnArticles":75,"formTitle":"[1577]Number of Ways Where Square of Number Is Equal to Product of Two Numbers","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15094,"title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5778359610677899,"acs":10152,"articleLive":2,"columnArticles":193,"formTitle":"[1578]Minimum Deletion Cost to Avoid Repeating Letters","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":17569,"title":"Minimum Deletion Cost to Avoid Repeating Letters","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6196141353265762,"acs":15833,"articleLive":2,"columnArticles":291,"formTitle":"[1579]Remove Max Number of Edges to Keep Graph Fully Traversable","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25553,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6377245508982036,"acs":213,"articleLive":2,"columnArticles":14,"formTitle":"[1580]Put Boxes Into the Warehouse II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":334,"title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8120407009609949,"acs":2873,"articleLive":2,"columnArticles":41,"formTitle":"[1581]Customer Who Visited but Did Not Make Any Transactions","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":3538,"title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.672561669829222,"acs":8861,"articleLive":2,"columnArticles":103,"formTitle":"[1582]Special Positions in a Binary Matrix","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":13175,"title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.5496350364963504,"acs":3765,"articleLive":2,"columnArticles":55,"formTitle":"[1583]Count Unhappy Friends","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":6850,"title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends"},{"acceptance":0.6659406556727859,"acs":23543,"articleLive":2,"columnArticles":297,"formTitle":"[1584]Min Cost to Connect All Points","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":35353,"title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42601319509896324,"acs":2260,"articleLive":2,"columnArticles":41,"formTitle":"[1585]Check If String Is Transformable With Substring Sort Operations","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5305,"title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6457023060796646,"acs":308,"articleLive":2,"columnArticles":19,"formTitle":"[1586]Binary Search Tree Iterator II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":477,"title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.826188393117527,"acs":2833,"articleLive":2,"columnArticles":39,"formTitle":"[1587]Bank Account Summary II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":3429,"title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8024297707458831,"acs":19881,"articleLive":2,"columnArticles":372,"formTitle":"[1588]Sum of All Odd Length Subarrays","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":24776,"title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29419925431370847,"acs":3393,"articleLive":2,"columnArticles":49,"formTitle":"[1589]Maximum Sum Obtained of Any Permutation","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":11533,"title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.25949679329057723,"acs":3156,"articleLive":2,"columnArticles":47,"formTitle":"[1590]Make Sum Divisible by P","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":12162,"title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5730791450028885,"acs":992,"articleLive":2,"columnArticles":28,"formTitle":"[1591]Strange Printer II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1731,"title":"Strange Printer II","titleSlug":"strange-printer-ii"},{"acceptance":0.44534928107901767,"acs":7000,"articleLive":2,"columnArticles":110,"formTitle":"[1592]Rearrange Spaces Between Words","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":15718,"title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.52,"acs":4797,"articleLive":2,"columnArticles":82,"formTitle":"[1593]Split a String Into the Max Number of Unique Substrings","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9225,"title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3095295536791315,"acs":3849,"articleLive":2,"columnArticles":91,"formTitle":"[1594]Maximum Non Negative Product in a Matrix","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":12435,"title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4592207792207792,"acs":1768,"articleLive":2,"columnArticles":37,"formTitle":"[1595]Minimum Cost to Connect Two Groups of Points","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":3850,"title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.768562401263823,"acs":1946,"articleLive":2,"columnArticles":36,"formTitle":"[1596]The Most Frequently Ordered Products for Each Customer","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":2532,"title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.667590027700831,"acs":241,"articleLive":2,"columnArticles":17,"formTitle":"[1597]Build Binary Expression Tree From Infix Expression","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":361,"title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.67035149268551,"acs":10127,"articleLive":2,"columnArticles":142,"formTitle":"[1598]Crawler Log Folder","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"","submitted":15107,"title":"Crawler Log Folder","titleSlug":"crawler-log-folder"},{"acceptance":0.41676181776661336,"acs":3650,"articleLive":2,"columnArticles":64,"formTitle":"[1599]Maximum Profit of Operating a Centennial Wheel","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":8758,"title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6883923291374504,"acs":16297,"articleLive":2,"columnArticles":202,"formTitle":"[1600]Throne Inheritance","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":23674,"title":"Throne Inheritance","titleSlug":"throne-inheritance"},{"acceptance":0.47724507179362374,"acs":1961,"articleLive":2,"columnArticles":39,"formTitle":"[1601]Maximum Number of Achievable Transfer Requests","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4109,"title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7744565217391305,"acs":570,"articleLive":2,"columnArticles":25,"formTitle":"[1602]Find Nearest Right Node in Binary Tree","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":736,"title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8459078785231864,"acs":54232,"articleLive":2,"columnArticles":437,"formTitle":"[1603]Design Parking System","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"","submitted":64111,"title":"Design Parking System","titleSlug":"design-parking-system"},{"acceptance":0.41550330639235855,"acs":3393,"articleLive":2,"columnArticles":56,"formTitle":"[1604]Alert Using Same Key-Card Three or More Times in a One Hour Period","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8166,"title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7303509639149778,"acs":2955,"articleLive":2,"columnArticles":57,"formTitle":"[1605]Find Valid Matrix Given Row and Column Sums","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","submitted":4046,"title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3397407241841752,"acs":1520,"articleLive":2,"columnArticles":32,"formTitle":"[1606]Find Servers That Handled Most Number of Requests","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4474,"title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5529210461989733,"acs":2262,"articleLive":2,"columnArticles":35,"formTitle":"[1607]Sellers With No Sales","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":4091,"title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales"},{"acceptance":0.637434082207614,"acs":8824,"articleLive":2,"columnArticles":137,"formTitle":"[1608]Special Array With X Elements Greater Than or Equal X","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":13843,"title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5121492396927418,"acs":6534,"articleLive":2,"columnArticles":108,"formTitle":"[1609]Even Odd Tree","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":12758,"title":"Even Odd Tree","titleSlug":"even-odd-tree"},{"acceptance":0.2646239554317549,"acs":2185,"articleLive":2,"columnArticles":36,"formTitle":"[1610]Maximum Number of Visible Points","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8257,"title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6054735547355473,"acs":1969,"articleLive":2,"columnArticles":53,"formTitle":"[1611]Minimum One Bit Operations to Make Integers Zero","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3252,"title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7584830339321357,"acs":380,"articleLive":2,"columnArticles":19,"formTitle":"[1612]Check If Two Expression Trees are Equivalent","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":501,"title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.734065934065934,"acs":1336,"articleLive":2,"columnArticles":34,"formTitle":"[1613]Find the Missing IDs","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":1820,"title":"Find the Missing IDs","titleSlug":"find-the-missing-ids"},{"acceptance":0.8194294940796556,"acs":15225,"articleLive":2,"columnArticles":251,"formTitle":"[1614]Maximum Nesting Depth of the Parentheses","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":18580,"title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4944012912337335,"acs":4901,"articleLive":2,"columnArticles":61,"formTitle":"[1615]Maximal Network Rank","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":9913,"title":"Maximal Network Rank","titleSlug":"maximal-network-rank"},{"acceptance":0.27481847226256173,"acs":4731,"articleLive":2,"columnArticles":90,"formTitle":"[1616]Split Two Strings to Make Palindrome","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17215,"title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.61521168977145,"acs":1642,"articleLive":2,"columnArticles":31,"formTitle":"[1617]Count Subtrees With Max Distance Between Cities","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2669,"title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5789473684210527,"acs":264,"articleLive":2,"columnArticles":16,"formTitle":"[1618]Maximum Font to Fit a Sentence in a Screen","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":456,"title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6832430134948465,"acs":6430,"articleLive":2,"columnArticles":110,"formTitle":"[1619]Mean of Array After Removing Some Elements","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":9411,"title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3672316384180791,"acs":2210,"articleLive":2,"columnArticles":39,"formTitle":"[1620]Coordinate With Maximum Network Quality","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6018,"title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4334231805929919,"acs":1608,"articleLive":2,"columnArticles":34,"formTitle":"[1621]Number of Sets of K Non-Overlapping Line Segments","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3710,"title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14509297149831288,"acs":2021,"articleLive":2,"columnArticles":43,"formTitle":"[1622]Fancy Sequence","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":13929,"title":"Fancy Sequence","titleSlug":"fancy-sequence"},{"acceptance":0.7812587412587413,"acs":2793,"articleLive":2,"columnArticles":37,"formTitle":"[1623]All Valid Triplets That Can Represent a Country","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":3575,"title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6264495435479891,"acs":10156,"articleLive":2,"columnArticles":169,"formTitle":"[1624]Largest Substring Between Two Equal Characters","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":16212,"title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5405511811023622,"acs":2746,"articleLive":2,"columnArticles":61,"formTitle":"[1625]Lexicographically Smallest String After Applying Operations","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5080,"title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3798548868971404,"acs":3560,"articleLive":2,"columnArticles":76,"formTitle":"[1626]Best Team With No Conflicts","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9372,"title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3804420629604823,"acs":2272,"articleLive":2,"columnArticles":34,"formTitle":"[1627]Graph Connectivity With Threshold","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":5972,"title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8408488063660478,"acs":317,"articleLive":2,"columnArticles":15,"formTitle":"[1628]Design an Expression Tree With Evaluate Function","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":377,"title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.522568833180762,"acs":7421,"articleLive":2,"columnArticles":75,"formTitle":"[1629]Slowest Key","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":14201,"title":"Slowest Key","titleSlug":"slowest-key"},{"acceptance":0.77045203969129,"acs":6988,"articleLive":2,"columnArticles":104,"formTitle":"[1630]Arithmetic Subarrays","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9070,"title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49135358238967086,"acs":23214,"articleLive":2,"columnArticles":290,"formTitle":"[1631]Path With Minimum Effort","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":47245,"title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31217183770883056,"acs":1308,"articleLive":2,"columnArticles":25,"formTitle":"[1632]Rank Transform of a Matrix","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4190,"title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6589341692789968,"acs":2102,"articleLive":2,"columnArticles":21,"formTitle":"[1633]Percentage of Users Attended a Contest","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":3190,"title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5224550898203593,"acs":349,"articleLive":2,"columnArticles":22,"formTitle":"[1634]Add Two Polynomials Represented as Linked Lists","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":668,"title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5827143821742066,"acs":863,"articleLive":2,"columnArticles":22,"formTitle":"[1635]Hopper Company Queries I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":1481,"title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7058046331366159,"acs":8013,"articleLive":2,"columnArticles":156,"formTitle":"[1636]Sort Array by Increasing Frequency","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":11353,"title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8057625434674615,"acs":4866,"articleLive":2,"columnArticles":56,"formTitle":"[1637]Widest Vertical Area Between Two Points Containing No Points","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6039,"title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7092572062084257,"acs":2559,"articleLive":2,"columnArticles":43,"formTitle":"[1638]Count Substrings That Differ by One Character","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3608,"title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4012956017729287,"acs":1177,"articleLive":2,"columnArticles":27,"formTitle":"[1639]Number of Ways to Form a Target String Given a Dictionary","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":2933,"title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6658134876474516,"acs":11966,"articleLive":2,"columnArticles":203,"formTitle":"[1640]Check Array Formation Through Concatenation","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":17972,"title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7684365781710915,"acs":11462,"articleLive":2,"columnArticles":257,"formTitle":"[1641]Count Sorted Vowel Strings","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":14916,"title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4570571518787496,"acs":5790,"articleLive":2,"columnArticles":94,"formTitle":"[1642]Furthest Building You Can Reach","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":12668,"title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4490017361111111,"acs":2069,"articleLive":2,"columnArticles":42,"formTitle":"[1643]Kth Smallest Instructions","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4608,"title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5487627365356623,"acs":754,"articleLive":2,"columnArticles":13,"formTitle":"[1644]Lowest Common Ancestor of a Binary Tree II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":1374,"title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4283755997258396,"acs":625,"articleLive":2,"columnArticles":20,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1459,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5042929478241726,"acs":6872,"articleLive":2,"columnArticles":75,"formTitle":"[1646]Get Maximum in Generated Array","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","submitted":13627,"title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5081807081807082,"acs":6243,"articleLive":2,"columnArticles":95,"formTitle":"[1647]Minimum Deletions to Make Character Frequencies Unique","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":12285,"title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2773554887749691,"acs":3138,"articleLive":2,"columnArticles":81,"formTitle":"[1648]Sell Diminishing-Valued Colored Balls","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":11314,"title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47309870550161814,"acs":2339,"articleLive":2,"columnArticles":58,"formTitle":"[1649]Create Sorted Array through Instructions","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":4944,"title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7898686679174484,"acs":842,"articleLive":2,"columnArticles":21,"formTitle":"[1650]Lowest Common Ancestor of a Binary Tree III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1066,"title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.7077681874229347,"acs":574,"articleLive":2,"columnArticles":19,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":811,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6599849930324794,"acs":6157,"articleLive":2,"columnArticles":152,"formTitle":"[1652]Defuse the Bomb","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":9329,"title":"Defuse the Bomb","titleSlug":"defuse-the-bomb"},{"acceptance":0.4947418738049713,"acs":3105,"articleLive":2,"columnArticles":74,"formTitle":"[1653]Minimum Deletions to Make String Balanced","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":6276,"title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2784519827998089,"acs":2914,"articleLive":2,"columnArticles":42,"formTitle":"[1654]Minimum Jumps to Reach Home","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":10465,"title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.380352644836272,"acs":1661,"articleLive":2,"columnArticles":27,"formTitle":"[1655]Distribute Repeating Integers","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":4367,"title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7818478260869566,"acs":7193,"articleLive":2,"columnArticles":78,"formTitle":"[1656]Design an Ordered Stream","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9200,"title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream"},{"acceptance":0.463023679417122,"acs":5084,"articleLive":2,"columnArticles":66,"formTitle":"[1657]Determine if Two Strings Are Close","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":10980,"title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2907649035080866,"acs":7443,"articleLive":2,"columnArticles":138,"formTitle":"[1658]Minimum Operations to Reduce X to Zero","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":25598,"title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.39603305785123966,"acs":1198,"articleLive":2,"columnArticles":24,"formTitle":"[1659]Maximize Grid Happiness","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3025,"title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7367256637168141,"acs":333,"articleLive":2,"columnArticles":22,"formTitle":"[1660]Correct a Binary Tree","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":452,"title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7164906580016247,"acs":1764,"articleLive":2,"columnArticles":45,"formTitle":"[1661]Average Time of Process per Machine","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":2462,"title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8130937540300047,"acs":18915,"articleLive":2,"columnArticles":252,"formTitle":"[1662]Check If Two String Arrays are Equivalent","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":23263,"title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.570230607966457,"acs":7072,"articleLive":2,"columnArticles":121,"formTitle":"[1663]Smallest String With A Given Numeric Value","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":12402,"title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5428327280495621,"acs":5082,"articleLive":2,"columnArticles":97,"formTitle":"[1664]Ways to Make a Fair Array","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9362,"title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6675447109385831,"acs":4815,"articleLive":2,"columnArticles":72,"formTitle":"[1665]Minimum Initial Energy to Finish Tasks","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7213,"title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.668918918918919,"acs":198,"articleLive":2,"columnArticles":13,"formTitle":"[1666]Change the Root of a Binary Tree","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":296,"title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6084994358781497,"acs":1618,"articleLive":2,"columnArticles":27,"formTitle":"[1667]Fix Names in a Table","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":2659,"title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table"},{"acceptance":0.43530513500858437,"acs":5578,"articleLive":2,"columnArticles":108,"formTitle":"[1668]Maximum Repeating Substring","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":12814,"title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7678402215904949,"acs":10534,"articleLive":2,"columnArticles":188,"formTitle":"[1669]Merge In Between Linked Lists","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"","submitted":13719,"title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.527262180974478,"acs":3636,"articleLive":2,"columnArticles":70,"formTitle":"[1670]Design Front Middle Back Queue","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"","submitted":6896,"title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4674300254452926,"acs":1837,"articleLive":2,"columnArticles":33,"formTitle":"[1671]Minimum Number of Removals to Make Mountain Array","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":3930,"title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8491087467182534,"acs":36870,"articleLive":2,"columnArticles":420,"formTitle":"[1672]Richest Customer Wealth","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":43422,"title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth"},{"acceptance":0.34447222080506096,"acs":6752,"articleLive":2,"columnArticles":154,"formTitle":"[1673]Find the Most Competitive Subsequence","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"","submitted":19601,"title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3532772575781622,"acs":2226,"articleLive":2,"columnArticles":49,"formTitle":"[1674]Minimum Moves to Make Array Complementary","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6301,"title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.44002252675051623,"acs":2344,"articleLive":2,"columnArticles":41,"formTitle":"[1675]Minimize Deviation in Array","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5327,"title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7622377622377622,"acs":545,"articleLive":2,"columnArticles":17,"formTitle":"[1676]Lowest Common Ancestor of a Binary Tree IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":715,"title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.43568840579710144,"acs":1443,"articleLive":2,"columnArticles":25,"formTitle":"[1677]Product's Worth Over Invoices","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":3312,"title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8276918364221167,"acs":16212,"articleLive":2,"columnArticles":256,"formTitle":"[1678]Goal Parser Interpretation","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":19587,"title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49095847885137756,"acs":6326,"articleLive":2,"columnArticles":98,"formTitle":"[1679]Max Number of K-Sum Pairs","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":12885,"title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.45725518880863125,"acs":5001,"articleLive":2,"columnArticles":68,"formTitle":"[1680]Concatenation of Consecutive Binary Numbers","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":10937,"title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3782654127481714,"acs":2172,"articleLive":2,"columnArticles":45,"formTitle":"[1681]Minimum Incompatibility","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":5742,"title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"},{"acceptance":0.5274725274725275,"acs":240,"articleLive":2,"columnArticles":13,"formTitle":"[1682]Longest Palindromic Subsequence II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":455,"title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8923027166882277,"acs":2759,"articleLive":2,"columnArticles":30,"formTitle":"[1683]Invalid Tweets","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3092,"title":"Invalid Tweets","titleSlug":"invalid-tweets"},{"acceptance":0.8274609116934596,"acs":15030,"articleLive":2,"columnArticles":313,"formTitle":"[1684]Count the Number of Consistent Strings","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":18164,"title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5901824337032161,"acs":3138,"articleLive":2,"columnArticles":74,"formTitle":"[1685]Sum of Absolute Differences in a Sorted Array","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":5317,"title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4658093488467034,"acs":2282,"articleLive":2,"columnArticles":45,"formTitle":"[1686]Stone Game VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":4899,"title":"Stone Game VI","titleSlug":"stone-game-vi"},{"acceptance":0.39981051634296544,"acs":844,"articleLive":2,"columnArticles":19,"formTitle":"[1687]Delivering Boxes from Storage to Ports","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2111,"title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8038394415357766,"acs":18424,"articleLive":2,"columnArticles":235,"formTitle":"[1688]Count of Matches in Tournament","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":22920,"title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8690747864641064,"acs":13329,"articleLive":2,"columnArticles":168,"formTitle":"[1689]Partitioning Into Minimum Number Of Deci-Binary Numbers","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":15337,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5028998582291533,"acs":3902,"articleLive":2,"columnArticles":100,"formTitle":"[1690]Stone Game VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":7759,"title":"Stone Game VII","titleSlug":"stone-game-vii"},{"acceptance":0.4808111644134322,"acs":2205,"articleLive":2,"columnArticles":59,"formTitle":"[1691]Maximum Height by Stacking Cuboids ","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4586,"title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6326530612244898,"acs":124,"articleLive":2,"columnArticles":11,"formTitle":"[1692]Count Ways to Distribute Candies","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":196,"title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8016022620169652,"acs":1701,"articleLive":2,"columnArticles":29,"formTitle":"[1693]Daily Leads and Partners","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2122,"title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6341485925242271,"acs":6871,"articleLive":2,"columnArticles":123,"formTitle":"[1694]Reformat Phone Number","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":10835,"title":"Reformat Phone Number","titleSlug":"reformat-phone-number"},{"acceptance":0.4452241031488466,"acs":5076,"articleLive":2,"columnArticles":112,"formTitle":"[1695]Maximum Erasure Value","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":11401,"title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value"},{"acceptance":0.40615099296808593,"acs":5256,"articleLive":2,"columnArticles":100,"formTitle":"[1696]Jump Game VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":12941,"title":"Jump Game VI","titleSlug":"jump-game-vi"},{"acceptance":0.5191914022517912,"acs":2029,"articleLive":2,"columnArticles":40,"formTitle":"[1697]Checking Existence of Edge Length Limited Paths","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":3908,"title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5297619047619048,"acs":356,"articleLive":2,"columnArticles":13,"formTitle":"[1698]Number of Distinct Substrings in a String","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":672,"title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7987381703470031,"acs":1266,"articleLive":2,"columnArticles":36,"formTitle":"[1699]Number of Calls Between Two Persons","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":1585,"title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7216668673973262,"acs":5992,"articleLive":2,"columnArticles":146,"formTitle":"[1700]Number of Students Unable to Eat Lunch","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":8303,"title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6092572658772875,"acs":3396,"articleLive":2,"columnArticles":66,"formTitle":"[1701]Average Waiting Time","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":5574,"title":"Average Waiting Time","titleSlug":"average-waiting-time"},{"acceptance":0.470902394106814,"acs":2557,"articleLive":2,"columnArticles":61,"formTitle":"[1702]Maximum Binary String After Change","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":5430,"title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.389556853315012,"acs":1134,"articleLive":2,"columnArticles":21,"formTitle":"[1703]Minimum Adjacent Swaps for K Consecutive Ones","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":2911,"title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7826763852522822,"acs":11060,"articleLive":2,"columnArticles":161,"formTitle":"[1704]Determine if String Halves Are Alike","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":14131,"title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3413738856843209,"acs":5208,"articleLive":2,"columnArticles":106,"formTitle":"[1705]Maximum Number of Eaten Apples","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":15256,"title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5806402899426155,"acs":3845,"articleLive":2,"columnArticles":97,"formTitle":"[1706]Where Will the Ball Fall","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":6622,"title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5050319547491369,"acs":13750,"articleLive":2,"columnArticles":142,"formTitle":"[1707]Maximum XOR With an Element From Array","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":27226,"title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6721504112808461,"acs":572,"articleLive":2,"columnArticles":19,"formTitle":"[1708]Largest Subarray Length K","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":851,"title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7233009708737864,"acs":1043,"articleLive":2,"columnArticles":31,"formTitle":"[1709]Biggest Window Between Visits","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":1442,"title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6928490990990991,"acs":9844,"articleLive":2,"columnArticles":164,"formTitle":"[1710]Maximum Units on a Truck","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":14208,"title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.25506420690902515,"acs":5641,"articleLive":2,"columnArticles":100,"formTitle":"[1711]Count Good Meals","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"","submitted":22116,"title":"Count Good Meals","titleSlug":"count-good-meals"},{"acceptance":0.26678052062309165,"acs":5155,"articleLive":2,"columnArticles":90,"formTitle":"[1712]Ways to Split Array Into Three Subarrays","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":19323,"title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.45876024590163933,"acs":1791,"articleLive":2,"columnArticles":48,"formTitle":"[1713]Minimum Operations to Make a Subsequence","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"","submitted":3904,"title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6476510067114094,"acs":193,"articleLive":2,"columnArticles":7,"formTitle":"[1714]Sum Of Special Evenly-Spaced Elements In Array","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","submitted":298,"title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7468099395567495,"acs":1112,"articleLive":2,"columnArticles":28,"formTitle":"[1715]Count Apples and Oranges","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":1489,"title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6745861004583295,"acs":7212,"articleLive":2,"columnArticles":166,"formTitle":"[1716]Calculate Money in Leetcode Bank","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":10691,"title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.42895086321381143,"acs":1938,"articleLive":2,"columnArticles":47,"formTitle":"[1717]Maximum Score From Removing Substrings","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4518,"title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4880382775119617,"acs":1734,"articleLive":2,"columnArticles":46,"formTitle":"[1718]Construct the Lexicographically Largest Valid Sequence","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3553,"title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.35833333333333334,"acs":559,"articleLive":2,"columnArticles":18,"formTitle":"[1719]Number Of Ways To Reconstruct A Tree","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1560,"title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8689817403543952,"acs":45068,"articleLive":2,"columnArticles":470,"formTitle":"[1720]Decode XORed Array","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"","submitted":51863,"title":"Decode XORed Array","titleSlug":"decode-xored-array"},{"acceptance":0.6484098939929329,"acs":9175,"articleLive":2,"columnArticles":138,"formTitle":"[1721]Swapping Nodes in a Linked List","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"","submitted":14150,"title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5162479834063148,"acs":4480,"articleLive":2,"columnArticles":107,"formTitle":"[1722]Minimize Hamming Distance After Swap Operations","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":8678,"title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5085682697622996,"acs":22080,"articleLive":2,"columnArticles":173,"formTitle":"[1723]Find Minimum Time to Finish All Jobs","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"","submitted":43416,"title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5440900562851783,"acs":290,"articleLive":2,"columnArticles":8,"formTitle":"[1724]Checking Existence of Edge Length Limited Paths II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":533,"title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7876352641629535,"acs":9899,"articleLive":2,"columnArticles":124,"formTitle":"[1725]Number Of Rectangles That Can Form The Largest Square","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":12568,"title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4715111478117259,"acs":5139,"articleLive":2,"columnArticles":105,"formTitle":"[1726]Tuple with Same Product","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":10899,"title":"Tuple with Same Product","titleSlug":"tuple-with-same-product"},{"acceptance":0.5722782984859409,"acs":3175,"articleLive":2,"columnArticles":82,"formTitle":"[1727]Largest Submatrix With Rearrangements","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5548,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3451969592259848,"acs":999,"articleLive":2,"columnArticles":24,"formTitle":"[1728]Cat and Mouse II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":2894,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6232848232848233,"acs":1499,"articleLive":2,"columnArticles":18,"formTitle":"[1729]Find Followers Count","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":2405,"title":"Find Followers Count","titleSlug":"find-followers-count"},{"acceptance":0.5359897172236504,"acs":417,"articleLive":2,"columnArticles":20,"formTitle":"[1730]Shortest Path to Get Food","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":778,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.48532818532818534,"acs":1257,"articleLive":2,"columnArticles":22,"formTitle":"[1731]The Number of Employees Which Report to Each Employee","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":2590,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7939426717144402,"acs":10276,"articleLive":2,"columnArticles":178,"formTitle":"[1732]Find the Highest Altitude","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":12943,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4534441805225653,"acs":1909,"articleLive":2,"columnArticles":52,"formTitle":"[1733]Minimum Number of People to Teach","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4210,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7230386378519974,"acs":27602,"articleLive":2,"columnArticles":365,"formTitle":"[1734]Decode XORed Permutation","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"","submitted":38175,"title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation"},{"acceptance":0.4849762783342119,"acs":920,"articleLive":2,"columnArticles":24,"formTitle":"[1735]Count Ways to Make Array With Product","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":1897,"title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4044125698018176,"acs":7387,"articleLive":2,"columnArticles":139,"formTitle":"[1736]Latest Time by Replacing Hidden Digits","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"","submitted":18266,"title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30436370275698377,"acs":3334,"articleLive":2,"columnArticles":99,"formTitle":"[1737]Change Minimum Characters to Satisfy One of Three Conditions","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":10954,"title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6548332311176109,"acs":27761,"articleLive":2,"columnArticles":376,"formTitle":"[1738]Find Kth Largest XOR Coordinate Value","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"","submitted":42394,"title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4697948328267477,"acs":2473,"articleLive":2,"columnArticles":53,"formTitle":"[1739]Building Boxes","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5264,"title":"Building Boxes","titleSlug":"building-boxes"},{"acceptance":0.689119170984456,"acs":399,"articleLive":2,"columnArticles":14,"formTitle":"[1740]Find Distance in a Binary Tree","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":579,"title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8449292452830188,"acs":1433,"articleLive":2,"columnArticles":27,"formTitle":"[1741]Find Total Time Spent by Each Employee","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":1696,"title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.706920575940548,"acs":7610,"articleLive":2,"columnArticles":114,"formTitle":"[1742]Maximum Number of Balls in a Box","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":10765,"title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.5741220495106506,"acs":3989,"articleLive":2,"columnArticles":95,"formTitle":"[1743]Restore the Array From Adjacent Pairs","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"","submitted":6948,"title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36369220314174444,"acs":27829,"articleLive":2,"columnArticles":361,"formTitle":"[1744]Can You Eat Your Favorite Candy on Your Favorite Day?","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"","submitted":76518,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48468410976388004,"acs":3038,"articleLive":2,"columnArticles":69,"formTitle":"[1745]Palindrome Partitioning IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6268,"title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5985915492957746,"acs":170,"articleLive":2,"columnArticles":11,"formTitle":"[1746]Maximum Subarray Sum After One Operation","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":284,"title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7105263157894737,"acs":891,"articleLive":2,"columnArticles":28,"formTitle":"[1747]Leetflex Banned Accounts","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1254,"title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7508513502811436,"acs":9481,"articleLive":2,"columnArticles":187,"formTitle":"[1748]Sum of Unique Elements","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":12627,"title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5308705318966992,"acs":3104,"articleLive":2,"columnArticles":76,"formTitle":"[1749]Maximum Absolute Sum of Any Subarray","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":5847,"title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4590009425070688,"acs":2922,"articleLive":2,"columnArticles":74,"formTitle":"[1750]Minimum Length of String After Deleting Similar Ends","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6366,"title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4663746457098686,"acs":1810,"articleLive":2,"columnArticles":32,"formTitle":"[1751]Maximum Number of Events That Can Be Attended II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":3881,"title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.693912906528073,"acs":8812,"articleLive":2,"columnArticles":100,"formTitle":"[1752]Check if Array Is Sorted and Rotated","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":12699,"title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6294844381088145,"acs":5299,"articleLive":2,"columnArticles":114,"formTitle":"[1753]Maximum Score From Removing Stones","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":8418,"title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.41602681950903,"acs":3847,"articleLive":2,"columnArticles":80,"formTitle":"[1754]Largest Merge Of Two Strings","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9247,"title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.3900124455507156,"acs":2507,"articleLive":2,"columnArticles":48,"formTitle":"[1755]Closest Subsequence Sum","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6428,"title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8023255813953488,"acs":207,"articleLive":2,"columnArticles":8,"formTitle":"[1756]Design Most Recently Used Queue","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":258,"title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9213938411669368,"acs":2274,"articleLive":2,"columnArticles":27,"formTitle":"[1757]Recyclable and Low Fat Products","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":2468,"title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6289170963903213,"acs":6342,"articleLive":2,"columnArticles":104,"formTitle":"[1758]Minimum Changes To Make Alternating Binary String","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":10084,"title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42684157416750756,"acs":4230,"articleLive":2,"columnArticles":90,"formTitle":"[1759]Count Number of Homogenous Substrings","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":9910,"title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.531585220500596,"acs":3568,"articleLive":2,"columnArticles":69,"formTitle":"[1760]Minimum Limit of Balls in a Bag","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":6712,"title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.42649405923036,"acs":2405,"articleLive":2,"columnArticles":39,"formTitle":"[1761]Minimum Degree of a Connected Trio in a Graph","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5639,"title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6269315673289183,"acs":284,"articleLive":2,"columnArticles":14,"formTitle":"[1762]Buildings With an Ocean View","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":453,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6142387308957246,"acs":3175,"articleLive":2,"columnArticles":69,"formTitle":"[1763]Longest Nice Substring","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":5169,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring"},{"acceptance":0.4769835762202174,"acs":2062,"articleLive":2,"columnArticles":45,"formTitle":"[1764]Form Array by Concatenating Subarrays of Another Array","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4323,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5713520271477049,"acs":3199,"articleLive":2,"columnArticles":74,"formTitle":"[1765]Map of Highest Peak","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":5599,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"},{"acceptance":0.3735319392724148,"acs":1304,"articleLive":2,"columnArticles":25,"formTitle":"[1766]Tree of Coprimes","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3491,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"},{"acceptance":0.8275862068965517,"acs":528,"articleLive":2,"columnArticles":16,"formTitle":"[1767]Find the Subtasks That Did Not Execute","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":638,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7709649738669163,"acs":9883,"articleLive":2,"columnArticles":183,"formTitle":"[1768]Merge Strings Alternately","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":12819,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"},{"acceptance":0.8549554565701559,"acs":9213,"articleLive":2,"columnArticles":153,"formTitle":"[1769]Minimum Number of Operations to Move All Balls to Each Box","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":10776,"title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3693224829674489,"acs":3903,"articleLive":2,"columnArticles":95,"formTitle":"[1770]Maximum Score from Performing Multiplication Operations","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":10568,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3609674728940784,"acs":2164,"articleLive":2,"columnArticles":46,"formTitle":"[1771]Maximize Palindrome Length From Subsequences","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":5995,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5736434108527132,"acs":222,"articleLive":2,"columnArticles":10,"formTitle":"[1772]Sort Features by Popularity","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":387,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8398132862754027,"acs":14753,"articleLive":2,"columnArticles":179,"formTitle":"[1773]Count Items Matching a Rule","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":17567,"title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5590693926880854,"acs":5551,"articleLive":2,"columnArticles":84,"formTitle":"[1774]Closest Dessert Cost","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":9929,"title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost"},{"acceptance":0.4724731960004819,"acs":3922,"articleLive":2,"columnArticles":83,"formTitle":"[1775]Equal Sum Arrays With Minimum Number of Operations","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8301,"title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4616782793093002,"acs":1524,"articleLive":2,"columnArticles":42,"formTitle":"[1776]Car Fleet II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3301,"title":"Car Fleet II","titleSlug":"car-fleet-ii"},{"acceptance":0.7743513398553807,"acs":3641,"articleLive":2,"columnArticles":48,"formTitle":"[1777]Product's Price for Each Store","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":4702,"title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store"},{"acceptance":0.5357142857142857,"acs":120,"articleLive":2,"columnArticles":7,"formTitle":"[1778]Shortest Path in a Hidden Grid","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":224,"title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6441021483583299,"acs":4767,"articleLive":2,"columnArticles":61,"formTitle":"[1779]Find Nearest Point That Has the Same X or Y Coordinate","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":7401,"title":"Find Nearest Point That Has the Same X or Y Coordinate","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6598311218335344,"acs":4923,"articleLive":2,"columnArticles":103,"formTitle":"[1780]Check if Number is a Sum of Powers of Three","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":7461,"title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5081088510170423,"acs":3697,"articleLive":2,"columnArticles":55,"formTitle":"[1781]Sum of Beauty of All Substrings","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7276,"title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.28023828023828024,"acs":1082,"articleLive":2,"columnArticles":30,"formTitle":"[1782]Count Pairs Of Nodes","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":3861,"title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.8098818474758325,"acs":754,"articleLive":2,"columnArticles":22,"formTitle":"[1783]Grand Slam Titles","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":931,"title":"Grand Slam Titles","titleSlug":"grand-slam-titles"},{"acceptance":0.4163468519863085,"acs":8028,"articleLive":2,"columnArticles":88,"formTitle":"[1784]Check if Binary String Has at Most One Segment of Ones","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":19282,"title":"Check if Binary String Has at Most One Segment of Ones","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3448730440763455,"acs":6017,"articleLive":2,"columnArticles":57,"formTitle":"[1785]Minimum Elements to Add to Form a Given Sum","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":17447,"title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3381621143425854,"acs":3058,"articleLive":2,"columnArticles":83,"formTitle":"[1786]Number of Restricted Paths From First to Last Node","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9043,"title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6549057242858756,"acs":11601,"articleLive":2,"columnArticles":59,"formTitle":"[1787]Make the XOR of All Segments Equal to Zero","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"","submitted":17714,"title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6894409937888198,"acs":111,"articleLive":2,"columnArticles":10,"formTitle":"[1788]Maximize the Beauty of the Garden","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":161,"title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7098614506927465,"acs":871,"articleLive":2,"columnArticles":22,"formTitle":"[1789]Primary Department for Each Employee","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":1227,"title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6597706195467267,"acs":12023,"articleLive":2,"columnArticles":125,"formTitle":"[1790]Check if One String Swap Can Make Strings Equal","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":18223,"title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8100519584332534,"acs":8107,"articleLive":2,"columnArticles":97,"formTitle":"[1791]Find Center of Star Graph","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":10008,"title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5140447068747364,"acs":6094,"articleLive":2,"columnArticles":96,"formTitle":"[1792]Maximum Average Pass Ratio","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":11855,"title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4076012744651798,"acs":3582,"articleLive":2,"columnArticles":86,"formTitle":"[1793]Maximum Score of a Good Subarray","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":8788,"title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6809815950920245,"acs":111,"articleLive":2,"columnArticles":6,"formTitle":"[1794]Count Pairs of Equal Substrings With Minimum Difference","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":163,"title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7995090016366612,"acs":977,"articleLive":2,"columnArticles":17,"formTitle":"[1795]Rearrange Products Table","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":1222,"title":"Rearrange Products Table","titleSlug":"rearrange-products-table"},{"acceptance":0.4825576181508385,"acs":5381,"articleLive":2,"columnArticles":99,"formTitle":"[1796]Second Largest Digit in a String","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"","submitted":11151,"title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5638743455497383,"acs":3231,"articleLive":2,"columnArticles":52,"formTitle":"[1797]Design Authentication Manager","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"","submitted":5730,"title":"Design Authentication Manager","titleSlug":"design-authentication-manager"},{"acceptance":0.5135491155438464,"acs":2729,"articleLive":2,"columnArticles":45,"formTitle":"[1798]Maximum Number of Consecutive Values You Can Make","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5314,"title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5071174377224199,"acs":1995,"articleLive":2,"columnArticles":29,"formTitle":"[1799]Maximize Score After N Operations","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":3934,"title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6843991399219559,"acs":8594,"articleLive":2,"columnArticles":131,"formTitle":"[1800]Maximum Ascending Subarray Sum","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"","submitted":12557,"title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37543859649122807,"acs":3852,"articleLive":2,"columnArticles":102,"formTitle":"[1801]Number of Orders in the Backlog","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"","submitted":10260,"title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26058218720790494,"acs":3903,"articleLive":2,"columnArticles":101,"formTitle":"[1802]Maximum Value at a Given Index in a Bounded Array","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":14978,"title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.406875,"acs":1953,"articleLive":2,"columnArticles":50,"formTitle":"[1803]Count Pairs With XOR in a Range","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"","submitted":4800,"title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5905707196029777,"acs":238,"articleLive":2,"columnArticles":20,"formTitle":"[1804]Implement Trie II (Prefix Tree)","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":403,"title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.5049728087795796,"acs":10307,"articleLive":2,"columnArticles":128,"formTitle":"[1805]Number of Different Integers in a String","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":20411,"title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6596434359805511,"acs":4884,"articleLive":2,"columnArticles":78,"formTitle":"[1806]Minimum Number of Operations to Reinitialize a Permutation","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7404,"title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5860986547085202,"acs":5228,"articleLive":2,"columnArticles":80,"formTitle":"[1807]Evaluate the Bracket Pairs of a String","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":8920,"title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26262626262626265,"acs":2314,"articleLive":2,"columnArticles":44,"formTitle":"[1808]Maximize Number of Nice Divisors","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":8811,"title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6403695806680881,"acs":901,"articleLive":2,"columnArticles":20,"formTitle":"[1809]Ad-Free Sessions","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":1407,"title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"},{"acceptance":0.7028985507246377,"acs":97,"articleLive":2,"columnArticles":6,"formTitle":"[1810]Minimum Path Cost in a Hidden Grid","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":138,"title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6850393700787402,"acs":435,"articleLive":2,"columnArticles":16,"formTitle":"[1811]Find Interview Candidates","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":635,"title":"Find Interview Candidates","titleSlug":"find-interview-candidates"},{"acceptance":0.7972328798976863,"acs":6857,"articleLive":2,"columnArticles":149,"formTitle":"[1812]Determine Color of a Chessboard Square","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"","submitted":8601,"title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5338891294932872,"acs":4931,"articleLive":2,"columnArticles":61,"formTitle":"[1813]Sentence Similarity III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"","submitted":9236,"title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3370630861040068,"acs":3163,"articleLive":2,"columnArticles":74,"formTitle":"[1814]Count Nice Pairs in an Array","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"","submitted":9384,"title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2985014175779668,"acs":1474,"articleLive":2,"columnArticles":34,"formTitle":"[1815]Maximum Number of Groups Getting Fresh Donuts","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":4938,"title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7540765391014975,"acs":9064,"articleLive":2,"columnArticles":124,"formTitle":"[1816]Truncate Sentence","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"","submitted":12020,"title":"Truncate Sentence","titleSlug":"truncate-sentence"},{"acceptance":0.6915228618213881,"acs":5490,"articleLive":2,"columnArticles":84,"formTitle":"[1817]Finding the Users Active Minutes","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"","submitted":7939,"title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.38806278397356464,"acs":5637,"articleLive":2,"columnArticles":106,"formTitle":"[1818]Minimum Absolute Sum Difference","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"","submitted":14526,"title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.35716683450822423,"acs":2128,"articleLive":2,"columnArticles":30,"formTitle":"[1819]Number of Different Subsequences GCDs","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":5958,"title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.46788990825688076,"acs":51,"articleLive":2,"columnArticles":5,"formTitle":"[1820]Maximum Number of Accepted Invitations","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":109,"title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.8940949935815148,"acs":1393,"articleLive":2,"columnArticles":14,"formTitle":"[1821]Find Customers With Positive Revenue this Year","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":1558,"title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8182471264367817,"acs":18224,"articleLive":2,"columnArticles":168,"formTitle":"[1822]Sign of the Product of an Array","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":22272,"title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.6921789579381903,"acs":6204,"articleLive":2,"columnArticles":72,"formTitle":"[1823]Find the Winner of the Circular Game","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":8963,"title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6680858941132913,"acs":7218,"articleLive":2,"columnArticles":144,"formTitle":"[1824]Minimum Sideway Jumps","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":10804,"title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28249626479714973,"acs":2458,"articleLive":2,"columnArticles":51,"formTitle":"[1825]Finding MK Average","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":8701,"title":"Finding MK Average","titleSlug":"finding-mk-average"},{"acceptance":0.4909090909090909,"acs":135,"articleLive":2,"columnArticles":12,"formTitle":"[1826]Faulty Sensor","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":275,"title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"acceptance":0.7955784373107208,"acs":7881,"articleLive":2,"columnArticles":116,"formTitle":"[1827]Minimum Operations to Make the Array Increasing","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"","submitted":9906,"title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8775594338326234,"acs":6386,"articleLive":2,"columnArticles":78,"formTitle":"[1828]Queries on Number of Points Inside a Circle","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"","submitted":7277,"title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6719970249163257,"acs":3614,"articleLive":2,"columnArticles":77,"formTitle":"[1829]Maximum XOR for Each Query","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"","submitted":5378,"title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.46838551258440764,"acs":763,"articleLive":2,"columnArticles":19,"formTitle":"[1830]Minimum Number of Operations to Make String Sorted","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"","submitted":1629,"title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7783687943262412,"acs":439,"articleLive":2,"columnArticles":15,"formTitle":"[1831]Maximum Transaction Each Day","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":564,"title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8256874095513749,"acs":11411,"articleLive":2,"columnArticles":180,"formTitle":"[1832]Check if the Sentence Is Pangram","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"","submitted":13820,"title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.689538614642851,"acs":40187,"articleLive":2,"columnArticles":359,"formTitle":"[1833]Maximum Ice Cream Bars","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"","submitted":58281,"title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3510737009544008,"acs":5297,"articleLive":2,"columnArticles":112,"formTitle":"[1834]Single-Threaded CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":15088,"title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5045521292217328,"acs":3436,"articleLive":2,"columnArticles":57,"formTitle":"[1835]Find XOR Sum of All Pairs Bitwise AND","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":6810,"title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7216117216117216,"acs":197,"articleLive":2,"columnArticles":16,"formTitle":"[1836]Remove Duplicates From an Unsorted Linked List","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":273,"title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7941955684007708,"acs":6595,"articleLive":2,"columnArticles":73,"formTitle":"[1837]Sum of Digits in Base K","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"","submitted":8304,"title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.3828136655229002,"acs":5132,"articleLive":2,"columnArticles":82,"formTitle":"[1838]Frequency of the Most Frequent Element","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"","submitted":13406,"title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5917312661498708,"acs":5954,"articleLive":2,"columnArticles":117,"formTitle":"[1839]Longest Substring Of All Vowels in Order","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"","submitted":10062,"title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.39658233466489123,"acs":1787,"articleLive":2,"columnArticles":41,"formTitle":"[1840]Maximum Building Height","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"","submitted":4506,"title":"Maximum Building Height","titleSlug":"maximum-building-height"},{"acceptance":0.5716694772344013,"acs":339,"articleLive":2,"columnArticles":16,"formTitle":"[1841]League Statistics","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":593,"title":"League Statistics","titleSlug":"league-statistics"},{"acceptance":0.7261904761904762,"acs":61,"articleLive":2,"columnArticles":7,"formTitle":"[1842]Next Palindrome Using Same Digits","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":84,"title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5591572123176661,"acs":345,"articleLive":2,"columnArticles":14,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":617,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8024673851389676,"acs":5659,"articleLive":2,"columnArticles":87,"formTitle":"[1844]Replace All Digits with Characters","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":7052,"title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.6262425447316103,"acs":4725,"articleLive":2,"columnArticles":40,"formTitle":"[1845]Seat Reservation Manager","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":7545,"title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager"},{"acceptance":0.5425550976527505,"acs":3028,"articleLive":2,"columnArticles":40,"formTitle":"[1846]Maximum Element After Decreasing and Rearranging","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"","submitted":5581,"title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3580372250423012,"acs":2116,"articleLive":2,"columnArticles":41,"formTitle":"[1847]Closest Room","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":5910,"title":"Closest Room","titleSlug":"closest-room"},{"acceptance":0.6916684199452977,"acs":6575,"articleLive":2,"columnArticles":79,"formTitle":"[1848]Minimum Distance to the Target Element","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":9506,"title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32905327711766963,"acs":5151,"articleLive":2,"columnArticles":101,"formTitle":"[1849]Splitting a String Into Descending Consecutive Values","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":15654,"title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.60139470013947,"acs":2156,"articleLive":2,"columnArticles":46,"formTitle":"[1850]Minimum Adjacent Swaps to Reach the Kth Smallest Number","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3585,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.39345357381429524,"acs":1767,"articleLive":2,"columnArticles":43,"formTitle":"[1851]Minimum Interval to Include Each Query","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4491,"title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.8198198198198198,"acs":91,"articleLive":2,"columnArticles":7,"formTitle":"[1852]Distinct Numbers in Each Subarray","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":111,"title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6741573033707865,"acs":420,"articleLive":2,"columnArticles":13,"formTitle":"[1853]Convert Date Format","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":623,"title":"Convert Date Format","titleSlug":"convert-date-format"},{"acceptance":0.8062684709908229,"acs":10367,"articleLive":2,"columnArticles":95,"formTitle":"[1854]Maximum Population Year","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"","submitted":12858,"title":"Maximum Population Year","titleSlug":"maximum-population-year"},{"acceptance":0.7054843817475169,"acs":9802,"articleLive":2,"columnArticles":87,"formTitle":"[1855]Maximum Distance Between a Pair of Values","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"","submitted":13894,"title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.36,"acs":3753,"articleLive":2,"columnArticles":74,"formTitle":"[1856]Maximum Subarray Min-Product","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"","submitted":10425,"title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.443656980864635,"acs":1878,"articleLive":2,"columnArticles":28,"formTitle":"[1857]Largest Color Value in a Directed Graph","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4233,"title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.71875,"acs":138,"articleLive":2,"columnArticles":10,"formTitle":"[1858]Longest Word With All Prefixes","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":192,"title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.775583741712309,"acs":5381,"articleLive":2,"columnArticles":113,"formTitle":"[1859]Sorting the Sentence","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"","submitted":6938,"title":"Sorting the Sentence","titleSlug":"sorting-the-sentence"},{"acceptance":0.7760252365930599,"acs":3444,"articleLive":2,"columnArticles":50,"formTitle":"[1860]Incremental Memory Leak","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"","submitted":4438,"title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak"},{"acceptance":0.6122101680493512,"acs":2878,"articleLive":2,"columnArticles":58,"formTitle":"[1861]Rotating the Box","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"","submitted":4701,"title":"Rotating the Box","titleSlug":"rotating-the-box"},{"acceptance":0.30547818012999073,"acs":1974,"articleLive":2,"columnArticles":40,"formTitle":"[1862]Sum of Floored Pairs","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"","submitted":6462,"title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9453296945153623,"acs":10738,"articleLive":2,"columnArticles":118,"formTitle":"[1863]Sum of All Subset XOR Totals","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":11359,"title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3843771174136095,"acs":3971,"articleLive":2,"columnArticles":98,"formTitle":"[1864]Minimum Number of Swaps to Make the Binary String Alternating","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"","submitted":10331,"title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5182543013008812,"acs":4940,"articleLive":2,"columnArticles":58,"formTitle":"[1865]Finding Pairs With a Certain Sum","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"","submitted":9532,"title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5928634103539047,"acs":2027,"articleLive":2,"columnArticles":47,"formTitle":"[1866]Number of Ways to Rearrange Sticks With K Sticks Visible","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3419,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7788778877887789,"acs":236,"articleLive":2,"columnArticles":10,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":303,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5567010309278351,"acs":54,"articleLive":2,"columnArticles":5,"formTitle":"[1868]Product of Two Run-Length Encoded Arrays","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":97,"title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.8188168210976479,"acs":11488,"articleLive":2,"columnArticles":111,"formTitle":"[1869]Longer Contiguous Segments of Ones than Zeros","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"","submitted":14030,"title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4706910459801022,"acs":7002,"articleLive":2,"columnArticles":67,"formTitle":"[1870]Minimum Speed to Arrive on Time","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"","submitted":14876,"title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27475708083522843,"acs":5316,"articleLive":2,"columnArticles":119,"formTitle":"[1871]Jump Game VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"","submitted":19348,"title":"Jump Game VII","titleSlug":"jump-game-vii"},{"acceptance":0.6234546096785588,"acs":1765,"articleLive":2,"columnArticles":26,"formTitle":"[1872]Stone Game VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":2831,"title":"Stone Game VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7802197802197802,"acs":781,"articleLive":2,"columnArticles":23,"formTitle":"[1873]Calculate Special Bonus","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":1001,"title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus"},{"acceptance":0.7647058823529411,"acs":65,"articleLive":2,"columnArticles":6,"formTitle":"[1874]Minimize Product Sum of Two Arrays","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":85,"title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7312252964426877,"acs":185,"articleLive":2,"columnArticles":13,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":253,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7381951731374606,"acs":4221,"articleLive":2,"columnArticles":62,"formTitle":"[1876]Substrings of Size Three with Distinct Characters","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"","submitted":5718,"title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8120620089190911,"acs":3824,"articleLive":2,"columnArticles":49,"formTitle":"[1877]Minimize Maximum Pair Sum in Array","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"","submitted":4709,"title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4256216696269982,"acs":1917,"articleLive":2,"columnArticles":51,"formTitle":"[1878]Get Biggest Three Rhombus Sums in a Grid","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"","submitted":4504,"title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.3936352509179927,"acs":1608,"articleLive":2,"columnArticles":36,"formTitle":"[1879]Minimum XOR Sum of Two Arrays","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4085,"title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7738841755809664,"acs":6294,"articleLive":2,"columnArticles":74,"formTitle":"[1880]Check if Word Equals Summation of Two Words","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"","submitted":8133,"title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3486472356554699,"acs":5335,"articleLive":2,"columnArticles":58,"formTitle":"[1881]Maximum Value after Insertion","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"","submitted":15302,"title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2736045254138591,"acs":3289,"articleLive":2,"columnArticles":105,"formTitle":"[1882]Process Tasks Using Servers","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"","submitted":12021,"title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers"},{"acceptance":0.36797037722749365,"acs":1590,"articleLive":2,"columnArticles":25,"formTitle":"[1883]Minimum Skips to Arrive at Meeting On Time","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4321,"title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6994106090373281,"acs":712,"articleLive":2,"columnArticles":22,"formTitle":"[1884]Egg Drop With 2 Eggs and N Floors","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":1018,"title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5297619047619048,"acs":89,"articleLive":2,"columnArticles":5,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":168,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5661497455779017,"acs":4673,"articleLive":2,"columnArticles":67,"formTitle":"[1886]Determine Whether Matrix Can Be Obtained By Rotation","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":8254,"title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.636502641089797,"acs":4579,"articleLive":2,"columnArticles":56,"formTitle":"[1887]Reduction Operations to Make the Array Elements Equal","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7194,"title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31072477962781586,"acs":2538,"articleLive":2,"columnArticles":62,"formTitle":"[1888]Minimum Number of Flips to Make the Binary String Alternating","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8168,"title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27781926811053026,"acs":1860,"articleLive":2,"columnArticles":38,"formTitle":"[1889]Minimum Space Wasted From Packaging","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":6695,"title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.6997578692493946,"acs":289,"articleLive":2,"columnArticles":11,"formTitle":"[1890]The Latest Login in 2020","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":413,"title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.6463414634146342,"acs":53,"articleLive":2,"columnArticles":5,"formTitle":"[1891]Cutting Ribbons","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":82,"title":"Cutting Ribbons","titleSlug":"cutting-ribbons"},{"acceptance":0.38390092879256965,"acs":124,"articleLive":2,"columnArticles":7,"formTitle":"[1892]Page Recommendations II","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":323,"title":"Page Recommendations II","titleSlug":"page-recommendations-ii"},{"acceptance":0.5748613678373382,"acs":2799,"articleLive":2,"columnArticles":44,"formTitle":"[1893]Check if All the Integers in a Range Are Covered","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"","submitted":4869,"title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4253707285622179,"acs":2639,"articleLive":2,"columnArticles":32,"formTitle":"[1894]Find the Student that Will Replace the Chalk","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"","submitted":6204,"title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5269051321928461,"acs":1694,"articleLive":2,"columnArticles":33,"formTitle":"[1895]Largest Magic Square","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"","submitted":3215,"title":"Largest Magic Square","titleSlug":"largest-magic-square"},{"acceptance":0.4959731543624161,"acs":739,"articleLive":2,"columnArticles":28,"formTitle":"[1896]Minimum Cost to Change the Final Value of Expression","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1490,"title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5181206706154,"acs":5161,"articleLive":2,"columnArticles":58,"formTitle":"[1897]Redistribute Characters to Make All Strings Equal","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"","submitted":9961,"title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3013067515496733,"acs":3597,"articleLive":2,"columnArticles":60,"formTitle":"[1898]Maximum Number of Removable Characters","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"","submitted":11938,"title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6271058110921824,"acs":3313,"articleLive":2,"columnArticles":37,"formTitle":"[1899]Merge Triplets to Form Target Triplet","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5283,"title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.41770057899090157,"acs":1010,"articleLive":2,"columnArticles":31,"formTitle":"[1900]The Earliest and Latest Rounds Where Players Compete","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2418,"title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.5789473684210527,"acs":132,"articleLive":2,"columnArticles":11,"formTitle":"[1901]Find a Peak Element II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":228,"title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4246575342465753,"acs":31,"articleLive":2,"columnArticles":1,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":73,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6487035488110885,"acs":5429,"articleLive":2,"columnArticles":70,"formTitle":"[1903]Largest Odd Number in String","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":8369,"title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.26584408300616935,"acs":2844,"articleLive":2,"columnArticles":63,"formTitle":"[1904]The Number of Full Rounds You Have Played","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":10698,"title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5725401199546117,"acs":3532,"articleLive":2,"columnArticles":78,"formTitle":"[1905]Count Sub Islands","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":6169,"title":"Count Sub Islands","titleSlug":"count-sub-islands"},{"acceptance":0.42321951219512194,"acs":2169,"articleLive":2,"columnArticles":51,"formTitle":"[1906]Minimum Absolute Difference Queries","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5125,"title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6986301369863014,"acs":102,"articleLive":2,"columnArticles":6,"formTitle":"[1907]Count Salary Categories","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":146,"title":"Count Salary Categories","titleSlug":"count-salary-categories"},{"acceptance":0.7407407407407407,"acs":20,"articleLive":2,"columnArticles":2,"formTitle":"[1908]Game of Nim","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":27,"title":"Game of Nim","titleSlug":"game-of-nim"},{"acceptance":0.33389794622062247,"acs":3154,"articleLive":2,"columnArticles":48,"formTitle":"[1909]Remove One Element to Make the Array Strictly Increasing","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"","submitted":9446,"title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6819499341238472,"acs":2588,"articleLive":2,"columnArticles":42,"formTitle":"[1910]Remove All Occurrences of a Substring","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"","submitted":3795,"title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5531004989308624,"acs":2328,"articleLive":2,"columnArticles":56,"formTitle":"[1911]Maximum Alternating Subsequence Sum","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"","submitted":4209,"title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.33102081268582756,"acs":1002,"articleLive":2,"columnArticles":27,"formTitle":"[1912]Design Movie Rental System","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":3027,"title":"Design Movie Rental System","titleSlug":"design-movie-rental-system"},{"acceptance":0.8605276424130398,"acs":5121,"articleLive":2,"columnArticles":34,"formTitle":"[1913]Maximum Product Difference Between Two Pairs","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"","submitted":5951,"title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.42721276269366465,"acs":2785,"articleLive":2,"columnArticles":64,"formTitle":"[1914]Cyclically Rotating a Grid","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":6519,"title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.36632030348012534,"acs":2221,"articleLive":2,"columnArticles":47,"formTitle":"[1915]Number of Wonderful Substrings","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"","submitted":6063,"title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5541125541125541,"acs":896,"articleLive":2,"columnArticles":14,"formTitle":"[1916]Count Ways to Build Rooms in an Ant Colony","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":1617,"title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.3106796116504854,"acs":32,"articleLive":2,"columnArticles":4,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":103,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.625,"acs":15,"articleLive":2,"columnArticles":1,"formTitle":"[1918]Kth Smallest Subarray Sum","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":24,"title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.5428571428571428,"acs":19,"articleLive":2,"columnArticles":1,"formTitle":"[1919]Leetcodify Similar Friends","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":35,"title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.6666666666666666,"acs":34,"articleLive":2,"columnArticles":1,"formTitle":"[5817]Check If a String is Decomposble to Value-Equal Substrings","frequency":0.0,"frontendQuestionId":"5817","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":51,"title":"Check If a String is Decomposble to Value-Equal Substrings","titleSlug":"check-if-a-string-is-decomposble-to-value-equal-substrings"},{"acceptance":0.8,"acs":16,"articleLive":2,"columnArticles":1,"formTitle":"[5818]Longest Common Subsequence Between Sorted Arrays","frequency":0.0,"frontendQuestionId":"5818","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":20,"title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.75,"acs":18,"articleLive":2,"columnArticles":1,"formTitle":"[5819]Maximum of Minimum Values in All Subarrays","frequency":0.0,"frontendQuestionId":"5819","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":24,"title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.8333333333333334,"acs":5,"articleLive":2,"columnArticles":0,"formTitle":"[5820]Minimum Time For K Viruses to Spread","frequency":0.0,"frontendQuestionId":"5820","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":6,"title":"Minimum Time For K Viruses to Spread","titleSlug":"minimum-time-for-k-viruses-to-spread"},{"acceptance":0.8438474273796469,"acs":78493,"articleLive":2,"columnArticles":602,"formTitle":"[LCP 01]Guess Numbers","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":93018,"title":"Guess Numbers","titleSlug":"guess-numbers"},{"acceptance":0.6848077558664757,"acs":12432,"articleLive":2,"columnArticles":214,"formTitle":"[LCP 02]Deep Dark Fraction","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":18154,"title":"Deep Dark Fraction","titleSlug":"deep-dark-fraction"},{"acceptance":0.21471218937896816,"acs":10213,"articleLive":2,"columnArticles":166,"formTitle":"[LCP 03]Programmable Robot","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":47566,"title":"Programmable Robot","titleSlug":"programmable-robot"},{"acceptance":0.3658019252732909,"acs":2242,"articleLive":2,"columnArticles":49,"formTitle":"[LCP 04]Broken Board Dominoes","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6129,"title":"Broken Board Dominoes","titleSlug":"broken-board-dominoes"},{"acceptance":0.18925429409300376,"acs":1807,"articleLive":2,"columnArticles":43,"formTitle":"[LCP 05]Coin Bonus","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":9548,"title":"Coin Bonus","titleSlug":"coin-bonus"},{"acceptance":0.8381713817138171,"acs":40886,"articleLive":2,"columnArticles":619,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":48780,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7732707768692919,"acs":33952,"articleLive":2,"columnArticles":415,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"","submitted":43907,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2733900364520049,"acs":4500,"articleLive":2,"columnArticles":93,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":16460,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2574183281849668,"acs":5500,"articleLive":2,"columnArticles":99,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":21366,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5650842266462481,"acs":1476,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2612,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.677637314734089,"acs":6218,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9176,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.3972715688479124,"acs":5300,"articleLive":2,"columnArticles":89,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":13341,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6181586193002485,"acs":9205,"articleLive":2,"columnArticles":82,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":14891,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.19309473684210526,"acs":2293,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":11875,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5714285714285714,"acs":744,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1302,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2857142857142857,"acs":504,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1764,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7964359899420576,"acs":21855,"articleLive":2,"columnArticles":231,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":27441,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2785009861932939,"acs":15532,"articleLive":2,"columnArticles":193,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"","submitted":55770,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5150524267646741,"acs":19059,"articleLive":2,"columnArticles":198,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37004,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.28910968244691215,"acs":1484,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5133,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.30616025937934227,"acs":661,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2159,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33047210300429186,"acs":8393,"articleLive":2,"columnArticles":179,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"","submitted":25397,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.32565003513703444,"acs":2317,"articleLive":2,"columnArticles":54,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7115,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.26272912423625255,"acs":774,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":2946,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.30810469883317565,"acs":977,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3171,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3191790516631281,"acs":451,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1413,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.322688142182727,"acs":1162,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3601,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.249220742419949,"acs":7036,"articleLive":2,"columnArticles":128,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"","submitted":28232,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.15512756149879056,"acs":3399,"articleLive":2,"columnArticles":95,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"","submitted":21911,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3155777277116189,"acs":3922,"articleLive":2,"columnArticles":70,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"","submitted":12428,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.18864206377642423,"acs":1053,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":5582,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.31388745482705216,"acs":608,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":1937,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.1804685687775458,"acs":3112,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":17244,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4288404627387678,"acs":1594,"articleLive":2,"columnArticles":51,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":3717,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.33771929824561403,"acs":770,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2280,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.1896838602329451,"acs":456,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"","submitted":2404,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.16091603053435113,"acs":527,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3275,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.46567717996289426,"acs":251,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":539,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5309639203015617,"acs":1972,"articleLive":2,"columnArticles":40,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":3714,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7245796637309848,"acs":1810,"articleLive":2,"columnArticles":29,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":2498,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4044574351479722,"acs":1107,"articleLive":2,"columnArticles":37,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":2737,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6766859676513857,"acs":330262,"articleLive":2,"columnArticles":2461,"formTitle":"[剑指 Offer 03]数组中重复的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":488058,"title":"数组中重复的数字 LCOF","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031940277441345,"acs":211391,"articleLive":2,"columnArticles":1777,"formTitle":"[剑指 Offer 04]二维数组中的查找 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":524291,"title":"二维数组中的查找 LCOF","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7625835925743476,"acs":226013,"articleLive":2,"columnArticles":1671,"formTitle":"[剑指 Offer 05]替换空格 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":296378,"title":"替换空格 LCOF","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7519006739534957,"acs":240424,"articleLive":2,"columnArticles":1766,"formTitle":"[剑指 Offer 06]从尾到头打印链表 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"","submitted":319755,"title":"从尾到头打印链表 LCOF","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6943587843173586,"acs":157391,"articleLive":2,"columnArticles":1284,"formTitle":"[剑指 Offer 07]重建二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":226671,"title":"重建二叉树 LCOF","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7219652465635052,"acs":198848,"articleLive":2,"columnArticles":1339,"formTitle":"[剑指 Offer 09]用两个栈实现队列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"","submitted":275426,"title":"用两个栈实现队列 LCOF","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.34539190512598833,"acs":186570,"articleLive":2,"columnArticles":1443,"formTitle":"[剑指 Offer 10- I]斐波那契数列  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","submitted":540169,"title":"斐波那契数列  LCOF","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4365661512707695,"acs":154389,"articleLive":2,"columnArticles":1109,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":353644,"title":"青蛙跳台阶问题  LCOF","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4933892042852143,"acs":210057,"articleLive":2,"columnArticles":1391,"formTitle":"[剑指 Offer 11]旋转数组的最小数字  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":425743,"title":"旋转数组的最小数字  LCOF","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.454741488574258,"acs":134543,"articleLive":2,"columnArticles":924,"formTitle":"[剑指 Offer 12]矩阵中的路径  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":295867,"title":"矩阵中的路径  LCOF","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5230985102034772,"acs":141291,"articleLive":2,"columnArticles":1482,"formTitle":"[剑指 Offer 13]机器人的运动范围  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":270104,"title":"机器人的运动范围  LCOF","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5668984333744059,"acs":128822,"articleLive":2,"columnArticles":1136,"formTitle":"[剑指 Offer 14- I]剪绳子  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":227240,"title":"剪绳子  LCOF","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3087960665794578,"acs":68457,"articleLive":2,"columnArticles":426,"formTitle":"[剑指 Offer 14- II]剪绳子 II LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":221690,"title":"剪绳子 II LCOF","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7446283385130082,"acs":172272,"articleLive":2,"columnArticles":1137,"formTitle":"[剑指 Offer 15]二进制中1的个数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"","submitted":231353,"title":"二进制中1的个数 LCOF","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.335873873813906,"acs":100917,"articleLive":2,"columnArticles":648,"formTitle":"[剑指 Offer 16]数值的整数次方 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":300461,"title":"数值的整数次方 LCOF","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7796960903157869,"acs":127354,"articleLive":2,"columnArticles":1007,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":163338,"title":"打印从1到最大的n位数 LCOF","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5924032056059686,"acs":154199,"articleLive":2,"columnArticles":1260,"formTitle":"[剑指 Offer 18]删除链表的节点 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"","submitted":260294,"title":"删除链表的节点 LCOF","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3716607346719495,"acs":55344,"articleLive":2,"columnArticles":387,"formTitle":"[剑指 Offer 19]正则表达式匹配 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":148910,"title":"正则表达式匹配 LCOF","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.23470008561175978,"acs":64424,"articleLive":2,"columnArticles":719,"formTitle":"[剑指 Offer 20]表示数值的字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":274495,"title":"表示数值的字符串 LCOF","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6420295711803892,"acs":154107,"articleLive":2,"columnArticles":1351,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":240031,"title":"调整数组顺序使奇数位于偶数前面 LCOF","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7870475842056689,"acs":189318,"articleLive":2,"columnArticles":1915,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"","submitted":240542,"title":"链表中倒数第k个节点 LCOF","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7405867053309677,"acs":232916,"articleLive":2,"columnArticles":1585,"formTitle":"[剑指 Offer 24]反转链表 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"","submitted":314502,"title":"反转链表 LCOF","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7280748993354907,"acs":147366,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 25]合并两个排序的链表  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":202405,"title":"合并两个排序的链表  LCOF","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46439113245430647,"acs":112176,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 26]树的子结构  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":241555,"title":"树的子结构  LCOF","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7876291948121434,"acs":153097,"articleLive":2,"columnArticles":1185,"formTitle":"[剑指 Offer 27]二叉树的镜像  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":194377,"title":"二叉树的镜像  LCOF","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5792262198127156,"acs":117525,"articleLive":2,"columnArticles":911,"formTitle":"[剑指 Offer 28]对称的二叉树  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":202900,"title":"对称的二叉树  LCOF","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44050230591574174,"acs":121687,"articleLive":2,"columnArticles":1311,"formTitle":"[剑指 Offer 29]顺时针打印矩阵  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":276246,"title":"顺时针打印矩阵  LCOF","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5779887596271712,"acs":99962,"articleLive":2,"columnArticles":687,"formTitle":"[剑指 Offer 30]包含min函数的栈 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"","submitted":172948,"title":"包含min函数的栈 LCOF","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6107922392886015,"acs":90666,"articleLive":2,"columnArticles":769,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":148440,"title":"栈的压入、弹出序列 LCOF","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6467031803189397,"acs":106858,"articleLive":2,"columnArticles":783,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":165235,"title":"从上到下打印二叉树 LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6849650878475461,"acs":108693,"articleLive":2,"columnArticles":914,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":158684,"title":"从上到下打印二叉树 II LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887723658681951,"acs":92860,"articleLive":2,"columnArticles":915,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":157718,"title":"从上到下打印二叉树 III LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5450893998222958,"acs":89568,"articleLive":2,"columnArticles":793,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":164318,"title":"二叉搜索树的后序遍历序列 LCOF","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5780326234062255,"acs":105495,"articleLive":2,"columnArticles":722,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":182507,"title":"二叉树中和为某一值的路径 LCOF","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7214580984592258,"acs":86391,"articleLive":2,"columnArticles":647,"formTitle":"[剑指 Offer 35]复杂链表的复制  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"","submitted":119745,"title":"复杂链表的复制  LCOF","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6541729012845356,"acs":80006,"articleLive":2,"columnArticles":724,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":122301,"title":"二叉搜索树与双向链表  LCOF","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5572122902666836,"acs":65921,"articleLive":2,"columnArticles":495,"formTitle":"[剑指 Offer 37]序列化二叉树  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"","submitted":118305,"title":"序列化二叉树  LCOF","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.58086987860728,"acs":132163,"articleLive":2,"columnArticles":992,"formTitle":"[剑指 Offer 38]字符串的排列  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"","submitted":227526,"title":"字符串的排列  LCOF","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6882957309611456,"acs":137803,"articleLive":2,"columnArticles":895,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"","submitted":200209,"title":"数组中出现次数超过一半的数字  LCOF","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.568982857715978,"acs":204229,"articleLive":2,"columnArticles":1618,"formTitle":"[剑指 Offer 40]最小的k个数  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":358937,"title":"最小的k个数  LCOF","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.577660656063386,"acs":49431,"articleLive":2,"columnArticles":376,"formTitle":"[剑指 Offer 41]数据流中的中位数  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":85571,"title":"数据流中的中位数  LCOF","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6013013296032024,"acs":161631,"articleLive":2,"columnArticles":1188,"formTitle":"[剑指 Offer 42]连续子数组的最大和  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"","submitted":268802,"title":"连续子数组的最大和  LCOF","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.47610957740496923,"acs":40356,"articleLive":2,"columnArticles":449,"formTitle":"[剑指 Offer 43]1～n整数中1出现的次数  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":84762,"title":"1～n整数中1出现的次数  LCOF","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4087796280316522,"acs":44530,"articleLive":2,"columnArticles":391,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":108934,"title":"数字序列中某一位的数字  LCOF","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5608116719771927,"acs":83603,"articleLive":2,"columnArticles":660,"formTitle":"[剑指 Offer 45]把数组排成最小的数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":149075,"title":"把数组排成最小的数 LCOF","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5403576969438308,"acs":93691,"articleLive":2,"columnArticles":1237,"formTitle":"[剑指 Offer 46]把数字翻译成字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":173387,"title":"把数字翻译成字符串 LCOF","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6881991900316139,"acs":92953,"articleLive":2,"columnArticles":817,"formTitle":"[剑指 Offer 47]礼物的最大价值 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":135067,"title":"礼物的最大价值 LCOF","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4631597391219702,"acs":118951,"articleLive":2,"columnArticles":852,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":256825,"title":"最长不含重复字符的子字符串 LCOF","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.649368127056698,"acs":70448,"articleLive":2,"columnArticles":433,"formTitle":"[剑指 Offer 49]丑数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":108487,"title":"丑数 LCOF","titleSlug":"chou-shu-lcof"},{"acceptance":0.6120524577946611,"acs":118262,"articleLive":2,"columnArticles":864,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":193222,"title":"第一个只出现一次的字符  LCOF","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4783736478149838,"acs":83359,"articleLive":2,"columnArticles":746,"formTitle":"[剑指 Offer 51]数组中的逆序对  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":174255,"title":"数组中的逆序对  LCOF","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6373106917569402,"acs":119722,"articleLive":2,"columnArticles":747,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"","submitted":187855,"title":"两个链表的第一个公共节点  LCOF","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5295884480300449,"acs":121835,"articleLive":2,"columnArticles":1068,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"","submitted":230056,"title":"在排序数组中查找数字  LCOF","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44584580209138897,"acs":132599,"articleLive":2,"columnArticles":1244,"formTitle":"[剑指 Offer 53 - II]缺失的数字  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":297410,"title":"缺失的数字  LCOF","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.752357334245482,"acs":131971,"articleLive":2,"columnArticles":989,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":175410,"title":"二叉搜索树的第k大节点  LCOF","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7877294501674509,"acs":148654,"articleLive":2,"columnArticles":1130,"formTitle":"[剑指 Offer 55 - I]二叉树的深度 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":188712,"title":"二叉树的深度 LCOF","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.583432769229173,"acs":112459,"articleLive":2,"columnArticles":815,"formTitle":"[剑指 Offer 55 - II]平衡二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":192754,"title":"平衡二叉树 LCOF","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.702174264586978,"acs":95528,"articleLive":2,"columnArticles":905,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":136046,"title":"数组中数字出现的次数 LCOF","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.798625535864233,"acs":72282,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":90508,"title":"数组中数字出现的次数 II LCOF","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6608321359482978,"acs":106240,"articleLive":2,"columnArticles":682,"formTitle":"[剑指 Offer 57]和为s的两个数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":160767,"title":"和为s的两个数字 LCOF","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7050150524114084,"acs":116625,"articleLive":2,"columnArticles":1716,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":165422,"title":"和为s的连续正数序列 LCOF","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.440300419289002,"acs":103121,"articleLive":2,"columnArticles":809,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":234206,"title":"翻转单词顺序 LCOF","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8539038642007953,"acs":164695,"articleLive":2,"columnArticles":1557,"formTitle":"[剑指 Offer 58 - II]左旋转字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":192873,"title":"左旋转字符串 LCOF","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4437020085637055,"acs":111292,"articleLive":2,"columnArticles":1056,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":250826,"title":"滑动窗口的最大值 LCOF","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.475073749821573,"acs":79877,"articleLive":2,"columnArticles":985,"formTitle":"[剑指 Offer 59 - II]队列的最大值 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"","submitted":168136,"title":"队列的最大值 LCOF","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.553446637812731,"acs":52428,"articleLive":2,"columnArticles":493,"formTitle":"[剑指 Offer 60]n个骰子的点数  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":94730,"title":"n个骰子的点数  LCOF","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45900910010111223,"acs":79443,"articleLive":2,"columnArticles":807,"formTitle":"[剑指 Offer 61]扑克牌中的顺子  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":173075,"title":"扑克牌中的顺子  LCOF","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6542864921405952,"acs":91324,"articleLive":2,"columnArticles":685,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":139578,"title":"圆圈中最后剩下的数字 LCOF","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6336705473370932,"acs":101348,"articleLive":2,"columnArticles":792,"formTitle":"[剑指 Offer 63]股票的最大利润  LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":159938,"title":"股票的最大利润  LCOF","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8562276443999448,"acs":118013,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 64]求1+2+…+n LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":137829,"title":"求1+2+…+n LCOF","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5814163098920458,"acs":56766,"articleLive":2,"columnArticles":421,"formTitle":"[剑指 Offer 65]不用加减乘除做加法 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":97634,"title":"不用加减乘除做加法 LCOF","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5957800367220917,"acs":58082,"articleLive":2,"columnArticles":429,"formTitle":"[剑指 Offer 66]构建乘积数组 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":97489,"title":"构建乘积数组 LCOF","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2833126100922184,"acs":54685,"articleLive":2,"columnArticles":477,"formTitle":"[剑指 Offer 67]把字符串转换成整数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":193020,"title":"把字符串转换成整数 LCOF","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6933292627079836,"acs":95382,"articleLive":2,"columnArticles":590,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":137571,"title":"二叉搜索树的最近公共祖先 LCOF","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.69683413879335,"acs":95021,"articleLive":2,"columnArticles":582,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":136361,"title":"二叉树的最近公共祖先 LCOF","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7223594016645851,"acs":75769,"articleLive":2,"columnArticles":1382,"formTitle":"[面试题 01.01]Is Unique LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":104891,"title":"Is Unique LCCI","titleSlug":"is-unique-lcci"},{"acceptance":0.6505498927038627,"acs":48505,"articleLive":2,"columnArticles":976,"formTitle":"[面试题 01.02]Check Permutation LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":74560,"title":"Check Permutation LCCI","titleSlug":"check-permutation-lcci"},{"acceptance":0.5820164174636436,"acs":36940,"articleLive":2,"columnArticles":410,"formTitle":"[面试题 01.03]String to URL LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":63469,"title":"String to URL LCCI","titleSlug":"string-to-url-lcci"},{"acceptance":0.5508261211644374,"acs":35005,"articleLive":2,"columnArticles":715,"formTitle":"[面试题 01.04]Palindrome Permutation LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":63550,"title":"Palindrome Permutation LCCI","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.333541806985471,"acs":27732,"articleLive":2,"columnArticles":498,"formTitle":"[面试题 01.05]One Away LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":83144,"title":"One Away LCCI","titleSlug":"one-away-lcci"},{"acceptance":0.4740050643286837,"acs":64769,"articleLive":2,"columnArticles":1093,"formTitle":"[面试题 01.06]Compress String LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":136642,"title":"Compress String LCCI","titleSlug":"compress-string-lcci"},{"acceptance":0.7564510427712973,"acs":57780,"articleLive":2,"columnArticles":904,"formTitle":"[面试题 01.07]Rotate Matrix LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":76383,"title":"Rotate Matrix LCCI","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6228473506506728,"acs":36710,"articleLive":2,"columnArticles":442,"formTitle":"[面试题 01.08]Zero Matrix LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":58939,"title":"Zero Matrix LCCI","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5522623710928132,"acs":27633,"articleLive":2,"columnArticles":363,"formTitle":"[面试题 01.09]String Rotation LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":50036,"title":"String Rotation LCCI","titleSlug":"string-rotation-lcci"},{"acceptance":0.6864245206261309,"acs":56525,"articleLive":2,"columnArticles":638,"formTitle":"[面试题 02.01]Remove Duplicate Node LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"","submitted":82347,"title":"Remove Duplicate Node LCCI","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7791826773289022,"acs":60022,"articleLive":2,"columnArticles":884,"formTitle":"[面试题 02.02]Kth Node From End of List LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"","submitted":77032,"title":"Kth Node From End of List LCCI","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8534398081412407,"acs":66902,"articleLive":2,"columnArticles":644,"formTitle":"[面试题 02.03]Delete Middle Node LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"","submitted":78391,"title":"Delete Middle Node LCCI","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6583775090833284,"acs":22107,"articleLive":2,"columnArticles":325,"formTitle":"[面试题 02.04]Partition List LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"","submitted":33578,"title":"Partition List LCCI","titleSlug":"partition-list-lcci"},{"acceptance":0.46698544821275717,"acs":31642,"articleLive":2,"columnArticles":474,"formTitle":"[面试题 02.05]Sum Lists LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"","submitted":67758,"title":"Sum Lists LCCI","titleSlug":"sum-lists-lcci"},{"acceptance":0.48152727063626694,"acs":33496,"articleLive":2,"columnArticles":460,"formTitle":"[面试题 02.06]Palindrome Linked List LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"","submitted":69562,"title":"Palindrome Linked List LCCI","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6911368891921604,"acs":36463,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 02.07]Intersection of Two Linked Lists LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"","submitted":52758,"title":"Intersection of Two Linked Lists LCCI","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5290479244937231,"acs":23094,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 02.08]Linked List Cycle LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"","submitted":43652,"title":"Linked List Cycle LCCI","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5437971886317599,"acs":8859,"articleLive":2,"columnArticles":140,"formTitle":"[面试题 03.01]Three in One LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":16291,"title":"Three in One LCCI","titleSlug":"three-in-one-lcci"},{"acceptance":0.6095065370976911,"acs":22517,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 03.02]Min Stack LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"","submitted":36943,"title":"Min Stack LCCI","titleSlug":"min-stack-lcci"},{"acceptance":0.3856885426960414,"acs":6635,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 03.03]Stack of Plates LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":17203,"title":"Stack of Plates LCCI","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7095512556607657,"acs":20682,"articleLive":2,"columnArticles":312,"formTitle":"[面试题 03.04]Implement Queue using Stacks LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"","submitted":29148,"title":"Implement Queue using Stacks LCCI","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5474653946876169,"acs":11707,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 03.05]Sort of Stacks LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":21384,"title":"Sort of Stacks LCCI","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5933626287138454,"acs":9047,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 03.06]Animal Shelter LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":15247,"title":"Animal Shelter LCCI","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5341735871242743,"acs":14537,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 04.01]Route Between Nodes LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":27214,"title":"Route Between Nodes LCCI","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.789275039262374,"acs":31159,"articleLive":2,"columnArticles":380,"formTitle":"[面试题 04.02]Minimum Height Tree LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":39478,"title":"Minimum Height Tree LCCI","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8060344827586207,"acs":21505,"articleLive":2,"columnArticles":474,"formTitle":"[面试题 04.03]List of Depth LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":26680,"title":"List of Depth LCCI","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5806556810988126,"acs":30269,"articleLive":2,"columnArticles":354,"formTitle":"[面试题 04.04]Check Balance LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":52129,"title":"Check Balance LCCI","titleSlug":"check-balance-lcci"},{"acceptance":0.3498536739697857,"acs":22116,"articleLive":2,"columnArticles":286,"formTitle":"[面试题 04.05]Legal Binary Search Tree LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":63215,"title":"Legal Binary Search Tree LCCI","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.590586176727909,"acs":16876,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 04.06]Successor LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":28575,"title":"Successor LCCI","titleSlug":"successor-lcci"},{"acceptance":0.7184075600683624,"acs":14292,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 04.08]First Common Ancestor LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":19894,"title":"First Common Ancestor LCCI","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4737928188196451,"acs":5740,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 04.09]BST Sequences LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":12115,"title":"BST Sequences LCCI","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7188577804828565,"acs":14173,"articleLive":2,"columnArticles":225,"formTitle":"[面试题 04.10]Check SubTree LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":19716,"title":"Check SubTree LCCI","titleSlug":"check-subtree-lcci"},{"acceptance":0.48911960399858573,"acs":15217,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 04.12]Paths with Sum LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":31111,"title":"Paths with Sum LCCI","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5046800871906655,"acs":7872,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 05.01]Insert Into Bits LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":15598,"title":"Insert Into Bits LCCI","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6751447477253929,"acs":6530,"articleLive":2,"columnArticles":106,"formTitle":"[面试题 05.02]Bianry Number to String LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":9672,"title":"Bianry Number to String LCCI","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.39564345606999635,"acs":8682,"articleLive":2,"columnArticles":200,"formTitle":"[面试题 05.03]Reverse Bits LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":21944,"title":"Reverse Bits LCCI","titleSlug":"reverse-bits-lcci"},{"acceptance":0.40451248992747785,"acs":4518,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 05.04]Closed Number LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":11169,"title":"Closed Number LCCI","titleSlug":"closed-number-lcci"},{"acceptance":0.5244306527113028,"acs":9971,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 05.06]Convert Integer LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":19013,"title":"Convert Integer LCCI","titleSlug":"convert-integer-lcci"},{"acceptance":0.7010758737078968,"acs":9970,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 05.07]Exchange LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":14221,"title":"Exchange LCCI","titleSlug":"exchange-lcci"},{"acceptance":0.5540464063384267,"acs":2937,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 05.08]Draw Line LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":5301,"title":"Draw Line LCCI","titleSlug":"draw-line-lcci"},{"acceptance":0.36279420782038585,"acs":38458,"articleLive":2,"columnArticles":420,"formTitle":"[面试题 08.01]Three Steps Problem LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":106005,"title":"Three Steps Problem LCCI","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36006311863434226,"acs":10040,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 08.02]Robot in a Grid LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":27884,"title":"Robot in a Grid LCCI","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6770547479961961,"acs":49838,"articleLive":2,"columnArticles":413,"formTitle":"[面试题 08.03]Magic Index LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":73610,"title":"Magic Index LCCI","titleSlug":"magic-index-lcci"},{"acceptance":0.8239149689991142,"acs":18604,"articleLive":2,"columnArticles":299,"formTitle":"[面试题 08.04]Power Set LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":22580,"title":"Power Set LCCI","titleSlug":"power-set-lcci"},{"acceptance":0.6765708005129144,"acs":18467,"articleLive":2,"columnArticles":423,"formTitle":"[面试题 08.05]Recursive Mulitply LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":27295,"title":"Recursive Mulitply LCCI","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6523380029424934,"acs":20396,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 08.06]Hanota LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":31266,"title":"Hanota LCCI","titleSlug":"hanota-lcci"},{"acceptance":0.8116200169635284,"acs":19138,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 08.07]Permutation I LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":23580,"title":"Permutation I LCCI","titleSlug":"permutation-i-lcci"},{"acceptance":0.7171270718232045,"acs":14278,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 08.08]Permutation II LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"","submitted":19910,"title":"Permutation II LCCI","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8116097477261026,"acs":18917,"articleLive":2,"columnArticles":313,"formTitle":"[面试题 08.09]Bracket LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":23308,"title":"Bracket LCCI","titleSlug":"bracket-lcci"},{"acceptance":0.5545643053479288,"acs":11500,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 08.10]Color Fill LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":20737,"title":"Color Fill LCCI","titleSlug":"color-fill-lcci"},{"acceptance":0.4947282044930251,"acs":31954,"articleLive":2,"columnArticles":311,"formTitle":"[面试题 08.11]Coin LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":64589,"title":"Coin LCCI","titleSlug":"coin-lcci"},{"acceptance":0.7573992693386986,"acs":14305,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 08.12]Eight Queens LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":18887,"title":"Eight Queens LCCI","titleSlug":"eight-queens-lcci"},{"acceptance":0.5001743679163034,"acs":5737,"articleLive":2,"columnArticles":77,"formTitle":"[面试题 08.13]Pile Box LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":11470,"title":"Pile Box LCCI","titleSlug":"pile-box-lcci"},{"acceptance":0.5327430926576096,"acs":3490,"articleLive":2,"columnArticles":66,"formTitle":"[面试题 08.14]Boolean Evaluation LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"","submitted":6551,"title":"Boolean Evaluation LCCI","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5513041443281422,"acs":51827,"articleLive":2,"columnArticles":2336,"formTitle":"[面试题 10.01]Sorted Merge LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":94008,"title":"Sorted Merge LCCI","titleSlug":"sorted-merge-lcci"},{"acceptance":0.6640676150229153,"acs":11157,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 10.02]Group Anagrams LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"","submitted":16801,"title":"Group Anagrams LCCI","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39976111380687546,"acs":10710,"articleLive":2,"columnArticles":188,"formTitle":"[面试题 10.03]Search Rotate Array LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":26791,"title":"Search Rotate Array LCCI","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5495124874477665,"acs":16964,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 10.05]Sparse Array Search LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":30871,"title":"Sparse Array Search LCCI","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45764331210191084,"acs":11496,"articleLive":2,"columnArticles":145,"formTitle":"[面试题 10.09]Sorted Matrix Search LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":25120,"title":"Sorted Matrix Search LCCI","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6307919815971081,"acs":3839,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 10.10]Rank from Stream LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":6086,"title":"Rank from Stream LCCI","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6630890319942758,"acs":6487,"articleLive":2,"columnArticles":78,"formTitle":"[面试题 10.11]Peaks and Valleys LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":9783,"title":"Peaks and Valleys LCCI","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8322265695107506,"acs":23185,"articleLive":2,"columnArticles":372,"formTitle":"[面试题 16.01]Swap Numbers LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":27859,"title":"Swap Numbers LCCI","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7631765959966836,"acs":12887,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.02]Words Frequency LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":16886,"title":"Words Frequency LCCI","titleSlug":"words-frequency-lcci"},{"acceptance":0.4428401238980224,"acs":9293,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 16.03]Intersection LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":20985,"title":"Intersection LCCI","titleSlug":"intersection-lcci"},{"acceptance":0.45703773176538487,"acs":6335,"articleLive":2,"columnArticles":143,"formTitle":"[面试题 16.04]Tic-Tac-Toe LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":13861,"title":"Tic-Tac-Toe LCCI","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4642283153947304,"acs":9532,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 16.05]Factorial Zeros LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":20533,"title":"Factorial Zeros LCCI","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4223633183788305,"acs":11109,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.06]Smallest Difference LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":26302,"title":"Smallest Difference LCCI","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7350437995599286,"acs":17705,"articleLive":2,"columnArticles":260,"formTitle":"[面试题 16.07]Maximum LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":24087,"title":"Maximum LCCI","titleSlug":"maximum-lcci"},{"acceptance":0.37396849212303074,"acs":1994,"articleLive":2,"columnArticles":57,"formTitle":"[面试题 16.08]English Int LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5332,"title":"English Int LCCI","titleSlug":"english-int-lcci"},{"acceptance":0.5354783108302212,"acs":1864,"articleLive":2,"columnArticles":35,"formTitle":"[面试题 16.09]Operations LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3481,"title":"Operations LCCI","titleSlug":"operations-lcci"},{"acceptance":0.6833956219967966,"acs":8960,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.10]Living People LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":13111,"title":"Living People LCCI","titleSlug":"living-people-lcci"},{"acceptance":0.44046016733357585,"acs":48433,"articleLive":2,"columnArticles":557,"formTitle":"[面试题 16.11]Diving Board LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":109960,"title":"Diving Board LCCI","titleSlug":"diving-board-lcci"},{"acceptance":0.42868400315208827,"acs":1632,"articleLive":2,"columnArticles":43,"formTitle":"[面试题 16.13]Bisect Squares LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":3807,"title":"Bisect Squares LCCI","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5445372303409882,"acs":3130,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]Best Line LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":5748,"title":"Best Line LCCI","titleSlug":"best-line-lcci"},{"acceptance":0.5019883955929331,"acs":7700,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.15]Master Mind LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":15339,"title":"Master Mind LCCI","titleSlug":"master-mind-lcci"},{"acceptance":0.4476867831119478,"acs":12841,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 16.16]Sub Sort LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":28683,"title":"Sub Sort LCCI","titleSlug":"sub-sort-lcci"},{"acceptance":0.5991626142956384,"acs":31912,"articleLive":2,"columnArticles":345,"formTitle":"[面试题 16.17]Contiguous Sequence LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":53261,"title":"Contiguous Sequence LCCI","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3444262722510607,"acs":14531,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 16.18]Pattern Matching LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":42189,"title":"Pattern Matching LCCI","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6066314996232103,"acs":18515,"articleLive":2,"columnArticles":328,"formTitle":"[面试题 16.19]Pond Sizes LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":30521,"title":"Pond Sizes LCCI","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7207025889671577,"acs":7878,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 16.20]T9 LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":10931,"title":"T9 LCCI","titleSlug":"t9-lcci"},{"acceptance":0.4621308659759543,"acs":8341,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 16.21]Sum Swap LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":18049,"title":"Sum Swap LCCI","titleSlug":"sum-swap-lcci"},{"acceptance":0.5881067961165048,"acs":2423,"articleLive":2,"columnArticles":51,"formTitle":"[面试题 16.22]Langtons Ant LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4120,"title":"Langtons Ant LCCI","titleSlug":"langtons-ant-lcci"},{"acceptance":0.46734603890059284,"acs":9539,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 16.24]Pairs With Sum LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":20411,"title":"Pairs With Sum LCCI","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5411231962560125,"acs":24975,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 16.25]LRU Cache LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":46154,"title":"LRU Cache LCCI","titleSlug":"lru-cache-lcci"},{"acceptance":0.38447681461005684,"acs":12379,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.26]Calculator LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":32197,"title":"Calculator LCCI","titleSlug":"calculator-lcci"},{"acceptance":0.5980934640880952,"acs":10917,"articleLive":2,"columnArticles":157,"formTitle":"[面试题 17.01]Add Without Plus LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":18253,"title":"Add Without Plus LCCI","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6454624118310303,"acs":24616,"articleLive":2,"columnArticles":408,"formTitle":"[面试题 17.04]Missing Number LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":38137,"title":"Missing Number LCCI","titleSlug":"missing-number-lcci"},{"acceptance":0.3828590337524818,"acs":4628,"articleLive":2,"columnArticles":75,"formTitle":"[面试题 17.05]Find Longest Subarray LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":12088,"title":"Find Longest Subarray LCCI","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44153444903281897,"acs":4063,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.06]Number Of 2s In Range LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":9202,"title":"Number Of 2s In Range LCCI","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41135166764189585,"acs":7733,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 17.07]Baby Names LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":18799,"title":"Baby Names LCCI","titleSlug":"baby-names-lcci"},{"acceptance":0.26833508384339577,"acs":7409,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 17.08]Circus Tower LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":27611,"title":"Circus Tower LCCI","titleSlug":"circus-tower-lcci"},{"acceptance":0.5484549932825795,"acs":12247,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.09]Get Kth Magic Number LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":22330,"title":"Get Kth Magic Number LCCI","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5364984131124734,"acs":37020,"articleLive":2,"columnArticles":584,"formTitle":"[面试题 17.10]Find Majority Element LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"","submitted":69003,"title":"Find Majority Element LCCI","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6861783473079154,"acs":13012,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 17.11]Find Closest LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":18963,"title":"Find Closest LCCI","titleSlug":"find-closest-lcci"},{"acceptance":0.6299161831076725,"acs":18563,"articleLive":2,"columnArticles":271,"formTitle":"[面试题 17.12]BiNode LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":29469,"title":"BiNode LCCI","titleSlug":"binode-lcci"},{"acceptance":0.5521944600411753,"acs":23603,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 17.13]Re-Space LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":42744,"title":"Re-Space LCCI","titleSlug":"re-space-lcci"},{"acceptance":0.5437267260973998,"acs":33729,"articleLive":2,"columnArticles":383,"formTitle":"[面试题 17.14]Smallest K LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","submitted":62033,"title":"Smallest K LCCI","titleSlug":"smallest-k-lcci"},{"acceptance":0.40285996055226825,"acs":4902,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.15]Longest Word LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":12168,"title":"Longest Word LCCI","titleSlug":"longest-word-lcci"},{"acceptance":0.5198296705279492,"acs":57620,"articleLive":2,"columnArticles":1104,"formTitle":"[面试题 17.16]The Masseuse LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":110844,"title":"The Masseuse LCCI","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4435221462248489,"acs":6679,"articleLive":2,"columnArticles":156,"formTitle":"[面试题 17.17]Multi Search LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":15059,"title":"Multi Search LCCI","titleSlug":"multi-search-lcci"},{"acceptance":0.44355011040672415,"acs":6227,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 17.18]Shortest Supersequence LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":14039,"title":"Shortest Supersequence LCCI","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5857852502865877,"acs":7665,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 17.19]Missing Two LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":13085,"title":"Missing Two LCCI","titleSlug":"missing-two-lcci"},{"acceptance":0.5633289124668435,"acs":3398,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 17.20]Continuous Median LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6032,"title":"Continuous Median LCCI","titleSlug":"continuous-median-lcci"},{"acceptance":0.6346078578955291,"acs":42157,"articleLive":2,"columnArticles":515,"formTitle":"[面试题 17.21]Volume of Histogram LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":66430,"title":"Volume of Histogram LCCI","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.36680786254818903,"acs":7707,"articleLive":2,"columnArticles":139,"formTitle":"[面试题 17.22]Word Transformer LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":21011,"title":"Word Transformer LCCI","titleSlug":"word-transformer-lcci"},{"acceptance":0.3777932267355249,"acs":3804,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 17.23]Max Black Square LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":10069,"title":"Max Black Square LCCI","titleSlug":"max-black-square-lcci"},{"acceptance":0.5130215827338129,"acs":7131,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.24]Max Submatrix LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":13900,"title":"Max Submatrix LCCI","titleSlug":"max-submatrix-lcci"},{"acceptance":0.4956070287539936,"acs":1241,"articleLive":2,"columnArticles":34,"formTitle":"[面试题 17.25]Word Rectangle LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":2504,"title":"Word Rectangle LCCI","titleSlug":"word-rectangle-lcci"},{"acceptance":0.33733318380621286,"acs":3008,"articleLive":2,"columnArticles":46,"formTitle":"[面试题 17.26]Sparse Similarity LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":8917,"title":"Sparse Similarity LCCI","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/Leetcode/doc/translation.json b/Leetcode/doc/translation.json
new file mode 100644
index 0000000..16bfb0e
--- /dev/null
+++ b/Leetcode/doc/translation.json
@@ -0,0 +1 @@
+{"data":{"translations":[{"questionId":"1","title":"\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2","title":"\u4e24\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"3","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"4","title":"\u5bfb\u627e\u4e24\u4e2a\u6b63\u5e8f\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"5","title":"\u6700\u957f\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"6","title":"Z \u5b57\u5f62\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"7","title":"\u6574\u6570\u53cd\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"8","title":"\u5b57\u7b26\u4e32\u8f6c\u6362\u6574\u6570 (atoi)","__typename":"AppliedTranslationNode"},{"questionId":"9","title":"\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"10","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"11","title":"\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668","__typename":"AppliedTranslationNode"},{"questionId":"12","title":"\u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"13","title":"\u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"14","title":"\u6700\u957f\u516c\u5171\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"15","title":"\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"16","title":"\u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"17","title":"\u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"18","title":"\u56db\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"19","title":"\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"20","title":"\u6709\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"21","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"22","title":"\u62ec\u53f7\u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"23","title":"\u5408\u5e76K\u4e2a\u5347\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"24","title":"\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"25","title":"K \u4e2a\u4e00\u7ec4\u7ffb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"26","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"27","title":"\u79fb\u9664\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"28","title":"\u5b9e\u73b0 strStr()","__typename":"AppliedTranslationNode"},{"questionId":"29","title":"\u4e24\u6570\u76f8\u9664","__typename":"AppliedTranslationNode"},{"questionId":"30","title":"\u4e32\u8054\u6240\u6709\u5355\u8bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"31","title":"\u4e0b\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"32","title":"\u6700\u957f\u6709\u6548\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"33","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"34","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u5143\u7d20\u7684\u7b2c\u4e00\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"35","title":"\u641c\u7d22\u63d2\u5165\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"36","title":"\u6709\u6548\u7684\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"37","title":"\u89e3\u6570\u72ec","__typename":"AppliedTranslationNode"},{"questionId":"38","title":"\u5916\u89c2\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"39","title":"\u7ec4\u5408\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"40","title":"\u7ec4\u5408\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"41","title":"\u7f3a\u5931\u7684\u7b2c\u4e00\u4e2a\u6b63\u6570","__typename":"AppliedTranslationNode"},{"questionId":"42","title":"\u63a5\u96e8\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"43","title":"\u5b57\u7b26\u4e32\u76f8\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"44","title":"\u901a\u914d\u7b26\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"45","title":"\u8df3\u8dc3\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"46","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"47","title":"\u5168\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"48","title":"\u65cb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"49","title":"\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"50","title":"Pow(x, n)","__typename":"AppliedTranslationNode"},{"questionId":"51","title":"N \u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"52","title":"N\u7687\u540e II","__typename":"AppliedTranslationNode"},{"questionId":"53","title":"\u6700\u5927\u5b50\u5e8f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"54","title":"\u87ba\u65cb\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"55","title":"\u8df3\u8dc3\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"56","title":"\u5408\u5e76\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"57","title":"\u63d2\u5165\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"58","title":"\u6700\u540e\u4e00\u4e2a\u5355\u8bcd\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"59","title":"\u87ba\u65cb\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"60","title":"\u6392\u5217\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"61","title":"\u65cb\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"62","title":"\u4e0d\u540c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"63","title":"\u4e0d\u540c\u8def\u5f84 II","__typename":"AppliedTranslationNode"},{"questionId":"64","title":"\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"65","title":"\u6709\u6548\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"66","title":"\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"67","title":"\u4e8c\u8fdb\u5236\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"68","title":"\u6587\u672c\u5de6\u53f3\u5bf9\u9f50","__typename":"AppliedTranslationNode"},{"questionId":"69","title":"x \u7684\u5e73\u65b9\u6839","__typename":"AppliedTranslationNode"},{"questionId":"70","title":"\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"71","title":"\u7b80\u5316\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"72","title":"\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"73","title":"\u77e9\u9635\u7f6e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"74","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"75","title":"\u989c\u8272\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"76","title":"\u6700\u5c0f\u8986\u76d6\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"77","title":"\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"78","title":"\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"79","title":"\u5355\u8bcd\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"80","title":"\u5220\u9664\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"81","title":"\u641c\u7d22\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"82","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"83","title":"\u5220\u9664\u6392\u5e8f\u94fe\u8868\u4e2d\u7684\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"84","title":"\u67f1\u72b6\u56fe\u4e2d\u6700\u5927\u7684\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"85","title":"\u6700\u5927\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"86","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"87","title":"\u6270\u4e71\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"88","title":"\u5408\u5e76\u4e24\u4e2a\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"89","title":"\u683c\u96f7\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"90","title":"\u5b50\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"91","title":"\u89e3\u7801\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"92","title":"\u53cd\u8f6c\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"93","title":"\u590d\u539f IP \u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"94","title":"\u4e8c\u53c9\u6811\u7684\u4e2d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"95","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"96","title":"\u4e0d\u540c\u7684\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"97","title":"\u4ea4\u9519\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"98","title":"\u9a8c\u8bc1\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"99","title":"\u6062\u590d\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100","title":"\u76f8\u540c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"101","title":"\u5bf9\u79f0\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"102","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"103","title":"\u4e8c\u53c9\u6811\u7684\u952f\u9f7f\u5f62\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"104","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"105","title":"\u4ece\u524d\u5e8f\u4e0e\u4e2d\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"106","title":"\u4ece\u4e2d\u5e8f\u4e0e\u540e\u5e8f\u904d\u5386\u5e8f\u5217\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"107","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"108","title":"\u5c06\u6709\u5e8f\u6570\u7ec4\u8f6c\u6362\u4e3a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"109","title":"\u6709\u5e8f\u94fe\u8868\u8f6c\u6362\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"110","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"111","title":"\u4e8c\u53c9\u6811\u7684\u6700\u5c0f\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"112","title":"\u8def\u5f84\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"113","title":"\u8def\u5f84\u603b\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"114","title":"\u4e8c\u53c9\u6811\u5c55\u5f00\u4e3a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"115","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"116","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488","__typename":"AppliedTranslationNode"},{"questionId":"117","title":"\u586b\u5145\u6bcf\u4e2a\u8282\u70b9\u7684\u4e0b\u4e00\u4e2a\u53f3\u4fa7\u8282\u70b9\u6307\u9488 II","__typename":"AppliedTranslationNode"},{"questionId":"118","title":"\u6768\u8f89\u4e09\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"119","title":"\u6768\u8f89\u4e09\u89d2 II","__typename":"AppliedTranslationNode"},{"questionId":"120","title":"\u4e09\u89d2\u5f62\u6700\u5c0f\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"121","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a","__typename":"AppliedTranslationNode"},{"questionId":"122","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"123","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a III","__typename":"AppliedTranslationNode"},{"questionId":"124","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u5927\u8def\u5f84\u548c","__typename":"AppliedTranslationNode"},{"questionId":"125","title":"\u9a8c\u8bc1\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"126","title":"\u5355\u8bcd\u63a5\u9f99 II","__typename":"AppliedTranslationNode"},{"questionId":"127","title":"\u5355\u8bcd\u63a5\u9f99","__typename":"AppliedTranslationNode"},{"questionId":"128","title":"\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"129","title":"\u6c42\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u6570\u5b57\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"130","title":"\u88ab\u56f4\u7ed5\u7684\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"131","title":"\u5206\u5272\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"132","title":"\u5206\u5272\u56de\u6587\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"133","title":"\u514b\u9686\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"134","title":"\u52a0\u6cb9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"135","title":"\u5206\u53d1\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"136","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"137","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 II","__typename":"AppliedTranslationNode"},{"questionId":"138","title":"\u590d\u5236\u5e26\u968f\u673a\u6307\u9488\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"139","title":"\u5355\u8bcd\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"140","title":"\u5355\u8bcd\u62c6\u5206 II","__typename":"AppliedTranslationNode"},{"questionId":"141","title":"\u73af\u5f62\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"142","title":"\u73af\u5f62\u94fe\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"143","title":"\u91cd\u6392\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"144","title":"\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"145","title":"\u4e8c\u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"146","title":"LRU \u7f13\u5b58\u673a\u5236","__typename":"AppliedTranslationNode"},{"questionId":"147","title":"\u5bf9\u94fe\u8868\u8fdb\u884c\u63d2\u5165\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"148","title":"\u6392\u5e8f\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"149","title":"\u76f4\u7ebf\u4e0a\u6700\u591a\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"150","title":"\u9006\u6ce2\u5170\u8868\u8fbe\u5f0f\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"151","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"152","title":"\u4e58\u79ef\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"153","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"154","title":"\u5bfb\u627e\u65cb\u8f6c\u6392\u5e8f\u6570\u7ec4\u4e2d\u7684\u6700\u5c0f\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"155","title":"\u6700\u5c0f\u6808","__typename":"AppliedTranslationNode"},{"questionId":"156","title":"\u4e0a\u4e0b\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"157","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"158","title":"\u7528 Read4 \u8bfb\u53d6 N \u4e2a\u5b57\u7b26 II","__typename":"AppliedTranslationNode"},{"questionId":"159","title":"\u81f3\u591a\u5305\u542b\u4e24\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"160","title":"\u76f8\u4ea4\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"161","title":"\u76f8\u9694\u4e3a 1 \u7684\u7f16\u8f91\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"162","title":"\u5bfb\u627e\u5cf0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"163","title":"\u7f3a\u5931\u7684\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"164","title":"\u6700\u5927\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"165","title":"\u6bd4\u8f83\u7248\u672c\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"166","title":"\u5206\u6570\u5230\u5c0f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"167","title":"\u4e24\u6570\u4e4b\u548c II - \u8f93\u5165\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"168","title":"Excel\u8868\u5217\u540d\u79f0","__typename":"AppliedTranslationNode"},{"questionId":"169","title":"\u591a\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"170","title":"\u4e24\u6570\u4e4b\u548c III - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"171","title":"Excel\u8868\u5217\u5e8f\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"172","title":"\u9636\u4e58\u540e\u7684\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"173","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"174","title":"\u5730\u4e0b\u57ce\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"175","title":"\u7ec4\u5408\u4e24\u4e2a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"176","title":"\u7b2c\u4e8c\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"177","title":"\u7b2cN\u9ad8\u7684\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"178","title":"\u5206\u6570\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"179","title":"\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"180","title":"\u8fde\u7eed\u51fa\u73b0\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"181","title":"\u8d85\u8fc7\u7ecf\u7406\u6536\u5165\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"182","title":"\u67e5\u627e\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"183","title":"\u4ece\u4e0d\u8ba2\u8d2d\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"184","title":"\u90e8\u95e8\u5de5\u8d44\u6700\u9ad8\u7684\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"185","title":"\u90e8\u95e8\u5de5\u8d44\u524d\u4e09\u9ad8\u7684\u6240\u6709\u5458\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"186","title":"\u7ffb\u8f6c\u5b57\u7b26\u4e32\u91cc\u7684\u5355\u8bcd II","__typename":"AppliedTranslationNode"},{"questionId":"187","title":"\u91cd\u590d\u7684DNA\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"188","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a IV","__typename":"AppliedTranslationNode"},{"questionId":"189","title":"\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"190","title":"\u98a0\u5012\u4e8c\u8fdb\u5236\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"191","title":"\u4f4d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"192","title":"\u7edf\u8ba1\u8bcd\u9891","__typename":"AppliedTranslationNode"},{"questionId":"193","title":"\u6709\u6548\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"194","title":"\u8f6c\u7f6e\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"195","title":"\u7b2c\u5341\u884c","__typename":"AppliedTranslationNode"},{"questionId":"196","title":"\u5220\u9664\u91cd\u590d\u7684\u7535\u5b50\u90ae\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"197","title":"\u4e0a\u5347\u7684\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"198","title":"\u6253\u5bb6\u52ab\u820d","__typename":"AppliedTranslationNode"},{"questionId":"199","title":"\u4e8c\u53c9\u6811\u7684\u53f3\u89c6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"200","title":"\u5c9b\u5c7f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"201","title":"\u6570\u5b57\u8303\u56f4\u6309\u4f4d\u4e0e","__typename":"AppliedTranslationNode"},{"questionId":"202","title":"\u5feb\u4e50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"203","title":"\u79fb\u9664\u94fe\u8868\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"204","title":"\u8ba1\u6570\u8d28\u6570","__typename":"AppliedTranslationNode"},{"questionId":"205","title":"\u540c\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"206","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"207","title":"\u8bfe\u7a0b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"208","title":"\u5b9e\u73b0 Trie (\u524d\u7f00\u6811)","__typename":"AppliedTranslationNode"},{"questionId":"209","title":"\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"210","title":"\u8bfe\u7a0b\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"211","title":"\u6dfb\u52a0\u4e0e\u641c\u7d22\u5355\u8bcd - \u6570\u636e\u7ed3\u6784\u8bbe\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"212","title":"\u5355\u8bcd\u641c\u7d22 II","__typename":"AppliedTranslationNode"},{"questionId":"213","title":"\u6253\u5bb6\u52ab\u820d II","__typename":"AppliedTranslationNode"},{"questionId":"214","title":"\u6700\u77ed\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"215","title":"\u6570\u7ec4\u4e2d\u7684\u7b2cK\u4e2a\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"216","title":"\u7ec4\u5408\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"217","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"218","title":"\u5929\u9645\u7ebf\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"219","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"220","title":"\u5b58\u5728\u91cd\u590d\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"221","title":"\u6700\u5927\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"222","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u8282\u70b9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"223","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"224","title":"\u57fa\u672c\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"225","title":"\u7528\u961f\u5217\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"226","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"227","title":"\u57fa\u672c\u8ba1\u7b97\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"228","title":"\u6c47\u603b\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"229","title":"\u6c42\u4f17\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"230","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7b2cK\u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"231","title":"2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"232","title":"\u7528\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"233","title":"\u6570\u5b57 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"234","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"235","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"236","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"237","title":"\u5220\u9664\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"238","title":"\u9664\u81ea\u8eab\u4ee5\u5916\u6570\u7ec4\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"239","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"240","title":"\u641c\u7d22\u4e8c\u7ef4\u77e9\u9635 II","__typename":"AppliedTranslationNode"},{"questionId":"241","title":"\u4e3a\u8fd0\u7b97\u8868\u8fbe\u5f0f\u8bbe\u8ba1\u4f18\u5148\u7ea7","__typename":"AppliedTranslationNode"},{"questionId":"242","title":"\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"243","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"244","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"245","title":"\u6700\u77ed\u5355\u8bcd\u8ddd\u79bb III","__typename":"AppliedTranslationNode"},{"questionId":"246","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"247","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"248","title":"\u4e2d\u5fc3\u5bf9\u79f0\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"249","title":"\u79fb\u4f4d\u5b57\u7b26\u4e32\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"250","title":"\u7edf\u8ba1\u540c\u503c\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"251","title":"\u5c55\u5f00\u4e8c\u7ef4\u5411\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"252","title":"\u4f1a\u8bae\u5ba4","__typename":"AppliedTranslationNode"},{"questionId":"253","title":"\u4f1a\u8bae\u5ba4 II","__typename":"AppliedTranslationNode"},{"questionId":"254","title":"\u56e0\u5b50\u7684\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"255","title":"\u9a8c\u8bc1\u524d\u5e8f\u904d\u5386\u5e8f\u5217\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"256","title":"\u7c89\u5237\u623f\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"257","title":"\u4e8c\u53c9\u6811\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"258","title":"\u5404\u4f4d\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"259","title":"\u8f83\u5c0f\u7684\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"260","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6570\u5b57 III","__typename":"AppliedTranslationNode"},{"questionId":"261","title":"\u4ee5\u56fe\u5224\u6811","__typename":"AppliedTranslationNode"},{"questionId":"262","title":"\u884c\u7a0b\u548c\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"263","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"264","title":"\u4e11\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"265","title":"\u7c89\u5237\u623f\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"266","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"267","title":"\u56de\u6587\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"268","title":"\u4e22\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"269","title":"\u706b\u661f\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"270","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c","__typename":"AppliedTranslationNode"},{"questionId":"271","title":"\u5b57\u7b26\u4e32\u7684\u7f16\u7801\u4e0e\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"272","title":"\u6700\u63a5\u8fd1\u7684\u4e8c\u53c9\u641c\u7d22\u6811\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"273","title":"\u6574\u6570\u8f6c\u6362\u82f1\u6587\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"274","title":"H \u6307\u6570","__typename":"AppliedTranslationNode"},{"questionId":"275","title":"H \u6307\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"276","title":"\u6805\u680f\u6d82\u8272","__typename":"AppliedTranslationNode"},{"questionId":"277","title":"\u641c\u5bfb\u540d\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"278","title":"\u7b2c\u4e00\u4e2a\u9519\u8bef\u7684\u7248\u672c","__typename":"AppliedTranslationNode"},{"questionId":"279","title":"\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"280","title":"\u6446\u52a8\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"281","title":"\u952f\u9f7f\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"282","title":"\u7ed9\u8868\u8fbe\u5f0f\u6dfb\u52a0\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"283","title":"\u79fb\u52a8\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"284","title":"\u9876\u7aef\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"285","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7","__typename":"AppliedTranslationNode"},{"questionId":"286","title":"\u5899\u4e0e\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"287","title":"\u5bfb\u627e\u91cd\u590d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"288","title":"\u5355\u8bcd\u7684\u552f\u4e00\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"289","title":"\u751f\u547d\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"290","title":"\u5355\u8bcd\u89c4\u5f8b","__typename":"AppliedTranslationNode"},{"questionId":"291","title":"\u5355\u8bcd\u89c4\u5f8b II","__typename":"AppliedTranslationNode"},{"questionId":"292","title":"Nim \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"293","title":"\u7ffb\u8f6c\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"294","title":"\u7ffb\u8f6c\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"295","title":"\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"296","title":"\u6700\u4f73\u7684\u78b0\u5934\u5730\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"297","title":"\u4e8c\u53c9\u6811\u7684\u5e8f\u5217\u5316\u4e0e\u53cd\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"298","title":"\u4e8c\u53c9\u6811\u6700\u957f\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"299","title":"\u731c\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"300","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"301","title":"\u5220\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"302","title":"\u5305\u542b\u5168\u90e8\u9ed1\u8272\u50cf\u7d20\u7684\u6700\u5c0f\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"303","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"304","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u77e9\u9635\u4e0d\u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"305","title":"\u5c9b\u5c7f\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"306","title":"\u7d2f\u52a0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"307","title":"\u533a\u57df\u548c\u68c0\u7d22 - \u6570\u7ec4\u53ef\u4fee\u6539","__typename":"AppliedTranslationNode"},{"questionId":"308","title":"\u4e8c\u7ef4\u533a\u57df\u548c\u68c0\u7d22 - \u53ef\u53d8","__typename":"AppliedTranslationNode"},{"questionId":"309","title":"\u6700\u4f73\u4e70\u5356\u80a1\u7968\u65f6\u673a\u542b\u51b7\u51bb\u671f","__typename":"AppliedTranslationNode"},{"questionId":"310","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"311","title":"\u7a00\u758f\u77e9\u9635\u7684\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"312","title":"\u6233\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"313","title":"\u8d85\u7ea7\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"314","title":"\u4e8c\u53c9\u6811\u7684\u5782\u76f4\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"315","title":"\u8ba1\u7b97\u53f3\u4fa7\u5c0f\u4e8e\u5f53\u524d\u5143\u7d20\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"316","title":"\u53bb\u9664\u91cd\u590d\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"317","title":"\u79bb\u5efa\u7b51\u7269\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"318","title":"\u6700\u5927\u5355\u8bcd\u957f\u5ea6\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"319","title":"\u706f\u6ce1\u5f00\u5173","__typename":"AppliedTranslationNode"},{"questionId":"320","title":"\u5217\u4e3e\u5355\u8bcd\u7684\u5168\u90e8\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"321","title":"\u62fc\u63a5\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"322","title":"\u96f6\u94b1\u5151\u6362","__typename":"AppliedTranslationNode"},{"questionId":"323","title":"\u65e0\u5411\u56fe\u4e2d\u8fde\u901a\u5206\u91cf\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"324","title":"\u6446\u52a8\u6392\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"325","title":"\u548c\u7b49\u4e8e k \u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"326","title":"3\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"327","title":"\u533a\u95f4\u548c\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"328","title":"\u5947\u5076\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"329","title":"\u77e9\u9635\u4e2d\u7684\u6700\u957f\u9012\u589e\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"330","title":"\u6309\u8981\u6c42\u8865\u9f50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"331","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811\u7684\u524d\u5e8f\u5e8f\u5217\u5316","__typename":"AppliedTranslationNode"},{"questionId":"332","title":"\u91cd\u65b0\u5b89\u6392\u884c\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"333","title":"\u6700\u5927 BST \u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"334","title":"\u9012\u589e\u7684\u4e09\u5143\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"335","title":"\u8def\u5f84\u4ea4\u53c9","__typename":"AppliedTranslationNode"},{"questionId":"336","title":"\u56de\u6587\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"337","title":"\u6253\u5bb6\u52ab\u820d III","__typename":"AppliedTranslationNode"},{"questionId":"338","title":"\u6bd4\u7279\u4f4d\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"339","title":"\u5d4c\u5957\u5217\u8868\u6743\u91cd\u548c","__typename":"AppliedTranslationNode"},{"questionId":"340","title":"\u81f3\u591a\u5305\u542b K \u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"341","title":"\u6241\u5e73\u5316\u5d4c\u5957\u5217\u8868\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"342","title":"4\u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"343","title":"\u6574\u6570\u62c6\u5206","__typename":"AppliedTranslationNode"},{"questionId":"344","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"345","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"346","title":"\u6570\u636e\u6d41\u4e2d\u7684\u79fb\u52a8\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"347","title":"\u524d K \u4e2a\u9ad8\u9891\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"348","title":"\u8bbe\u8ba1\u4e95\u5b57\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"349","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"350","title":"\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 II","__typename":"AppliedTranslationNode"},{"questionId":"351","title":"\u5b89\u5353\u7cfb\u7edf\u624b\u52bf\u89e3\u9501","__typename":"AppliedTranslationNode"},{"questionId":"352","title":"\u5c06\u6570\u636e\u6d41\u53d8\u4e3a\u591a\u4e2a\u4e0d\u76f8\u4ea4\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"353","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"354","title":"\u4fc4\u7f57\u65af\u5957\u5a03\u4fe1\u5c01\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"355","title":"\u8bbe\u8ba1\u63a8\u7279","__typename":"AppliedTranslationNode"},{"questionId":"356","title":"\u76f4\u7ebf\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"357","title":"\u8ba1\u7b97\u5404\u4e2a\u4f4d\u6570\u4e0d\u540c\u7684\u6570\u5b57\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"358","title":"K \u8ddd\u79bb\u95f4\u9694\u91cd\u6392\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"359","title":"\u65e5\u5fd7\u901f\u7387\u9650\u5236\u5668","__typename":"AppliedTranslationNode"},{"questionId":"360","title":"\u6709\u5e8f\u8f6c\u5316\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"361","title":"\u8f70\u70b8\u654c\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"362","title":"\u6572\u51fb\u8ba1\u6570\u5668","__typename":"AppliedTranslationNode"},{"questionId":"363","title":"\u77e9\u5f62\u533a\u57df\u4e0d\u8d85\u8fc7 K \u7684\u6700\u5927\u6570\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"364","title":"\u52a0\u6743\u5d4c\u5957\u5e8f\u5217\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"365","title":"\u6c34\u58f6\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"366","title":"\u5bfb\u627e\u4e8c\u53c9\u6811\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"367","title":"\u6709\u6548\u7684\u5b8c\u5168\u5e73\u65b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"368","title":"\u6700\u5927\u6574\u9664\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"369","title":"\u7ed9\u5355\u94fe\u8868\u52a0\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"370","title":"\u533a\u95f4\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"371","title":"\u4e24\u6574\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"372","title":"\u8d85\u7ea7\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"373","title":"\u67e5\u627e\u548c\u6700\u5c0f\u7684K\u5bf9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"374","title":"\u731c\u6570\u5b57\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"375","title":"\u731c\u6570\u5b57\u5927\u5c0f II","__typename":"AppliedTranslationNode"},{"questionId":"376","title":"\u6446\u52a8\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"377","title":"\u7ec4\u5408\u603b\u548c \u2163","__typename":"AppliedTranslationNode"},{"questionId":"378","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"379","title":"\u7535\u8bdd\u76ee\u5f55\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"380","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"381","title":"O(1) \u65f6\u95f4\u63d2\u5165\u3001\u5220\u9664\u548c\u83b7\u53d6\u968f\u673a\u5143\u7d20 - \u5141\u8bb8\u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"382","title":"\u94fe\u8868\u968f\u673a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"383","title":"\u8d4e\u91d1\u4fe1","__typename":"AppliedTranslationNode"},{"questionId":"384","title":"\u6253\u4e71\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"385","title":"\u8ff7\u4f60\u8bed\u6cd5\u5206\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"386","title":"\u5b57\u5178\u5e8f\u6392\u6570","__typename":"AppliedTranslationNode"},{"questionId":"387","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c\u4e00\u4e2a\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"388","title":"\u6587\u4ef6\u7684\u6700\u957f\u7edd\u5bf9\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"389","title":"\u627e\u4e0d\u540c","__typename":"AppliedTranslationNode"},{"questionId":"390","title":"\u6d88\u9664\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"391","title":"\u5b8c\u7f8e\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"392","title":"\u5224\u65ad\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"393","title":"UTF-8 \u7f16\u7801\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"394","title":"\u5b57\u7b26\u4e32\u89e3\u7801","__typename":"AppliedTranslationNode"},{"questionId":"395","title":"\u81f3\u5c11\u6709 K \u4e2a\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"396","title":"\u65cb\u8f6c\u51fd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"397","title":"\u6574\u6570\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"398","title":"\u968f\u673a\u6570\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"399","title":"\u9664\u6cd5\u6c42\u503c","__typename":"AppliedTranslationNode"},{"questionId":"400","title":"\u7b2c N \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"401","title":"\u4e8c\u8fdb\u5236\u624b\u8868","__typename":"AppliedTranslationNode"},{"questionId":"402","title":"\u79fb\u6389 K \u4f4d\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"403","title":"\u9752\u86d9\u8fc7\u6cb3","__typename":"AppliedTranslationNode"},{"questionId":"404","title":"\u5de6\u53f6\u5b50\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"405","title":"\u6570\u5b57\u8f6c\u6362\u4e3a\u5341\u516d\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"406","title":"\u6839\u636e\u8eab\u9ad8\u91cd\u5efa\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"407","title":"\u63a5\u96e8\u6c34 II","__typename":"AppliedTranslationNode"},{"questionId":"408","title":"\u6709\u6548\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"409","title":"\u6700\u957f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"410","title":"\u5206\u5272\u6570\u7ec4\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"411","title":"\u6700\u77ed\u72ec\u5360\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"412","title":"Fizz Buzz","__typename":"AppliedTranslationNode"},{"questionId":"413","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"414","title":"\u7b2c\u4e09\u5927\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"415","title":"\u5b57\u7b26\u4e32\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"416","title":"\u5206\u5272\u7b49\u548c\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"417","title":"\u592a\u5e73\u6d0b\u5927\u897f\u6d0b\u6c34\u6d41\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"418","title":"\u5c4f\u5e55\u53ef\u663e\u793a\u53e5\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"419","title":"\u7532\u677f\u4e0a\u7684\u6218\u8230","__typename":"AppliedTranslationNode"},{"questionId":"420","title":"\u5f3a\u5bc6\u7801\u68c0\u9a8c\u5668","__typename":"AppliedTranslationNode"},{"questionId":"421","title":"\u6570\u7ec4\u4e2d\u4e24\u4e2a\u6570\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"422","title":"\u6709\u6548\u7684\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"423","title":"\u4ece\u82f1\u6587\u4e2d\u91cd\u5efa\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"424","title":"\u66ff\u6362\u540e\u7684\u6700\u957f\u91cd\u590d\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"425","title":"\u5355\u8bcd\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"432","title":"\u5168 O(1) \u7684\u6570\u636e\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"433","title":"\u6700\u5c0f\u57fa\u56e0\u53d8\u5316","__typename":"AppliedTranslationNode"},{"questionId":"434","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"435","title":"\u65e0\u91cd\u53e0\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"436","title":"\u5bfb\u627e\u53f3\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"437","title":"\u8def\u5f84\u603b\u548c III","__typename":"AppliedTranslationNode"},{"questionId":"438","title":"\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"439","title":"\u4e09\u5143\u8868\u8fbe\u5f0f\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"440","title":"\u5b57\u5178\u5e8f\u7684\u7b2cK\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"441","title":"\u6392\u5217\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"442","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u636e","__typename":"AppliedTranslationNode"},{"questionId":"443","title":"\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"444","title":"\u5e8f\u5217\u91cd\u5efa","__typename":"AppliedTranslationNode"},{"questionId":"445","title":"\u4e24\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"446","title":"\u7b49\u5dee\u6570\u5217\u5212\u5206 II - \u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"447","title":"\u56de\u65cb\u9556\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"448","title":"\u627e\u5230\u6240\u6709\u6570\u7ec4\u4e2d\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"449","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"450","title":"\u5220\u9664\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"451","title":"\u6839\u636e\u5b57\u7b26\u51fa\u73b0\u9891\u7387\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"452","title":"\u7528\u6700\u5c11\u6570\u91cf\u7684\u7bad\u5f15\u7206\u6c14\u7403","__typename":"AppliedTranslationNode"},{"questionId":"453","title":"\u6700\u5c0f\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"454","title":"\u56db\u6570\u76f8\u52a0 II","__typename":"AppliedTranslationNode"},{"questionId":"455","title":"\u5206\u53d1\u997c\u5e72","__typename":"AppliedTranslationNode"},{"questionId":"456","title":"132 \u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"457","title":"\u73af\u5f62\u6570\u7ec4\u662f\u5426\u5b58\u5728\u5faa\u73af","__typename":"AppliedTranslationNode"},{"questionId":"458","title":"\u53ef\u601c\u7684\u5c0f\u732a","__typename":"AppliedTranslationNode"},{"questionId":"459","title":"\u91cd\u590d\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"460","title":"LFU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"461","title":"\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"462","title":"\u6700\u5c11\u79fb\u52a8\u6b21\u6570\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49 II","__typename":"AppliedTranslationNode"},{"questionId":"463","title":"\u5c9b\u5c7f\u7684\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"464","title":"\u6211\u80fd\u8d62\u5417","__typename":"AppliedTranslationNode"},{"questionId":"465","title":"\u6700\u4f18\u8d26\u5355\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"466","title":"\u7edf\u8ba1\u91cd\u590d\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"467","title":"\u73af\u7ed5\u5b57\u7b26\u4e32\u4e2d\u552f\u4e00\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"468","title":"\u9a8c\u8bc1IP\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"469","title":"\u51f8\u591a\u8fb9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"471","title":"\u7f16\u7801\u6700\u77ed\u957f\u5ea6\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"472","title":"\u8fde\u63a5\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"473","title":"\u706b\u67f4\u62fc\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"474","title":"\u4e00\u548c\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"475","title":"\u4f9b\u6696\u5668","__typename":"AppliedTranslationNode"},{"questionId":"476","title":"\u6570\u5b57\u7684\u8865\u6570","__typename":"AppliedTranslationNode"},{"questionId":"477","title":"\u6c49\u660e\u8ddd\u79bb\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"479","title":"\u6700\u5927\u56de\u6587\u6570\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"480","title":"\u6ed1\u52a8\u7a97\u53e3\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"481","title":"\u795e\u5947\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"482","title":"\u5bc6\u94a5\u683c\u5f0f\u5316","__typename":"AppliedTranslationNode"},{"questionId":"483","title":"\u6700\u5c0f\u597d\u8fdb\u5236","__typename":"AppliedTranslationNode"},{"questionId":"484","title":"\u5bfb\u627e\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"485","title":"\u6700\u5927\u8fde\u7eed 1 \u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"486","title":"\u9884\u6d4b\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"487","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"488","title":"\u7956\u739b\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"489","title":"\u7b2c K \u6761\u6700\u5c0f\u6307\u4ee4","__typename":"AppliedTranslationNode"},{"questionId":"490","title":"\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"491","title":"\u9012\u589e\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"492","title":"\u6784\u9020\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"493","title":"\u7ffb\u8f6c\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"494","title":"\u76ee\u6807\u548c","__typename":"AppliedTranslationNode"},{"questionId":"495","title":"\u63d0\u83ab\u653b\u51fb","__typename":"AppliedTranslationNode"},{"questionId":"496","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"498","title":"\u5bf9\u89d2\u7ebf\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"499","title":"\u8ff7\u5bab III","__typename":"AppliedTranslationNode"},{"questionId":"500","title":"\u952e\u76d8\u884c","__typename":"AppliedTranslationNode"},{"questionId":"501","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4f17\u6570","__typename":"AppliedTranslationNode"},{"questionId":"502","title":"IPO","__typename":"AppliedTranslationNode"},{"questionId":"503","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"504","title":"\u4e03\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"505","title":"\u8ff7\u5bab II","__typename":"AppliedTranslationNode"},{"questionId":"506","title":"\u76f8\u5bf9\u540d\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"507","title":"\u5b8c\u7f8e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"508","title":"\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5b50\u6811\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"509","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u4e2d\u5e8f\u540e\u7ee7 II","__typename":"AppliedTranslationNode"},{"questionId":"511","title":"\u4ece\u59cb\u70b9\u5230\u7ec8\u70b9\u7684\u6240\u6709\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"513","title":"\u627e\u6811\u5de6\u4e0b\u89d2\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"514","title":"\u81ea\u7531\u4e4b\u8def","__typename":"AppliedTranslationNode"},{"questionId":"515","title":"\u5728\u6bcf\u4e2a\u6811\u884c\u4e2d\u627e\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"516","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"517","title":"\u8d85\u7ea7\u6d17\u8863\u673a","__typename":"AppliedTranslationNode"},{"questionId":"518","title":"\u96f6\u94b1\u5151\u6362 II","__typename":"AppliedTranslationNode"},{"questionId":"520","title":"\u68c0\u6d4b\u5927\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"521","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 \u2160","__typename":"AppliedTranslationNode"},{"questionId":"522","title":"\u6700\u957f\u7279\u6b8a\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"523","title":"\u8fde\u7eed\u7684\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"524","title":"\u901a\u8fc7\u5220\u9664\u5b57\u6bcd\u5339\u914d\u5230\u5b57\u5178\u91cc\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"525","title":"\u8fde\u7eed\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"526","title":"\u4f18\u7f8e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"527","title":"\u5355\u8bcd\u7f29\u5199","__typename":"AppliedTranslationNode"},{"questionId":"528","title":"\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"529","title":"\u626b\u96f7\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"530","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"531","title":"\u5b64\u72ec\u50cf\u7d20 I","__typename":"AppliedTranslationNode"},{"questionId":"532","title":"\u6570\u7ec4\u4e2d\u7684 k-diff \u6570\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"533","title":"\u5b64\u72ec\u50cf\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"535","title":"TinyURL \u7684\u52a0\u5bc6\u4e0e\u89e3\u5bc6","__typename":"AppliedTranslationNode"},{"questionId":"536","title":"\u4ece\u5b57\u7b26\u4e32\u751f\u6210\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"537","title":"\u590d\u6570\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"538","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"539","title":"\u6700\u5c0f\u65f6\u95f4\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"540","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u5355\u4e00\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"541","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"542","title":"01 \u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"543","title":"\u4e8c\u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"544","title":"\u8f93\u51fa\u6bd4\u8d5b\u5339\u914d\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"545","title":"\u4e8c\u53c9\u6811\u7684\u8fb9\u754c","__typename":"AppliedTranslationNode"},{"questionId":"546","title":"\u79fb\u9664\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"547","title":"\u7701\u4efd\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"548","title":"\u5c06\u6570\u7ec4\u5206\u5272\u6210\u548c\u76f8\u7b49\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"549","title":"\u4e8c\u53c9\u6811\u4e2d\u6700\u957f\u7684\u8fde\u7eed\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"550","title":"\u83b7\u53d6\u98df\u7269\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"551","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 I","__typename":"AppliedTranslationNode"},{"questionId":"552","title":"\u5b66\u751f\u51fa\u52e4\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"553","title":"\u6700\u4f18\u9664\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"554","title":"\u7816\u5899","__typename":"AppliedTranslationNode"},{"questionId":"555","title":"\u5206\u5272\u8fde\u63a5\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"556","title":"\u4e0b\u4e00\u4e2a\u66f4\u5927\u5143\u7d20 III","__typename":"AppliedTranslationNode"},{"questionId":"557","title":"\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u5355\u8bcd III","__typename":"AppliedTranslationNode"},{"questionId":"560","title":"\u548c\u4e3aK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"561","title":"\u6570\u7ec4\u62c6\u5206 I","__typename":"AppliedTranslationNode"},{"questionId":"562","title":"\u77e9\u9635\u4e2d\u6700\u957f\u7684\u8fde\u7eed1\u7ebf\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"563","title":"\u4e8c\u53c9\u6811\u7684\u5761\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"564","title":"\u5bfb\u627e\u6700\u8fd1\u7684\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"565","title":"\u6570\u7ec4\u5d4c\u5957","__typename":"AppliedTranslationNode"},{"questionId":"566","title":"\u91cd\u5851\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"567","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"568","title":"\u6700\u5927\u4f11\u5047\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"569","title":"\u5458\u5de5\u85aa\u6c34\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"570","title":"\u81f3\u5c11\u67095\u540d\u76f4\u63a5\u4e0b\u5c5e\u7684\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"571","title":"\u7ed9\u5b9a\u6570\u5b57\u7684\u9891\u7387\u67e5\u8be2\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"572","title":"\u53e6\u4e00\u4e2a\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"573","title":"\u677e\u9f20\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"574","title":"\u5f53\u9009\u8005","__typename":"AppliedTranslationNode"},{"questionId":"575","title":"\u5206\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"576","title":"\u51fa\u754c\u7684\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"577","title":"\u5458\u5de5\u5956\u91d1","__typename":"AppliedTranslationNode"},{"questionId":"578","title":"\u67e5\u8be2\u56de\u7b54\u7387\u6700\u9ad8\u7684\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"579","title":"\u67e5\u8be2\u5458\u5de5\u7684\u7d2f\u8ba1\u85aa\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"580","title":"\u7edf\u8ba1\u5404\u4e13\u4e1a\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"581","title":"\u6700\u77ed\u65e0\u5e8f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"582","title":"\u6740\u6389\u8fdb\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"583","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u5220\u9664\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"584","title":"\u5bfb\u627e\u7528\u6237\u63a8\u8350\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"585","title":"2016\u5e74\u7684\u6295\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"586","title":"\u8ba2\u5355\u6700\u591a\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"587","title":"\u5b89\u88c5\u6805\u680f","__typename":"AppliedTranslationNode"},{"questionId":"588","title":"\u8bbe\u8ba1\u5185\u5b58\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"591","title":"\u6807\u7b7e\u9a8c\u8bc1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"592","title":"\u5206\u6570\u52a0\u51cf\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"593","title":"\u6709\u6548\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"594","title":"\u6700\u957f\u548c\u8c10\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"595","title":"\u5927\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"596","title":"\u8d85\u8fc75\u540d\u5b66\u751f\u7684\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"597","title":"\u597d\u53cb\u7533\u8bf7 I\uff1a\u603b\u4f53\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"598","title":"\u8303\u56f4\u6c42\u548c II","__typename":"AppliedTranslationNode"},{"questionId":"599","title":"\u4e24\u4e2a\u5217\u8868\u7684\u6700\u5c0f\u7d22\u5f15\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"600","title":"\u4e0d\u542b\u8fde\u7eed1\u7684\u975e\u8d1f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"601","title":"\u4f53\u80b2\u9986\u7684\u4eba\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"602","title":"\u597d\u53cb\u7533\u8bf7 II \uff1a\u8c01\u6709\u6700\u591a\u7684\u597d\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"603","title":"\u8fde\u7eed\u7a7a\u4f59\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"604","title":"\u8fed\u4ee3\u538b\u7f29\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"605","title":"\u79cd\u82b1\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"606","title":"\u6839\u636e\u4e8c\u53c9\u6811\u521b\u5efa\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"607","title":"\u9500\u552e\u5458","__typename":"AppliedTranslationNode"},{"questionId":"608","title":"\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"609","title":"\u5728\u7cfb\u7edf\u4e2d\u67e5\u627e\u91cd\u590d\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"610","title":"\u5224\u65ad\u4e09\u89d2\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"611","title":"\u6709\u6548\u4e09\u89d2\u5f62\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"612","title":"\u5e73\u9762\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"613","title":"\u76f4\u7ebf\u4e0a\u7684\u6700\u8fd1\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"614","title":"\u4e8c\u7ea7\u5173\u6ce8\u8005","__typename":"AppliedTranslationNode"},{"questionId":"615","title":"\u5e73\u5747\u5de5\u8d44\uff1a\u90e8\u95e8\u4e0e\u516c\u53f8\u6bd4\u8f83","__typename":"AppliedTranslationNode"},{"questionId":"616","title":"\u7ed9\u5b57\u7b26\u4e32\u6dfb\u52a0\u52a0\u7c97\u6807\u7b7e","__typename":"AppliedTranslationNode"},{"questionId":"617","title":"\u5408\u5e76\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"618","title":"\u5b66\u751f\u5730\u7406\u4fe1\u606f\u62a5\u544a","__typename":"AppliedTranslationNode"},{"questionId":"619","title":"\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"620","title":"\u6709\u8da3\u7684\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"621","title":"\u4efb\u52a1\u8c03\u5ea6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"623","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u589e\u52a0\u4e00\u884c","__typename":"AppliedTranslationNode"},{"questionId":"624","title":"\u6570\u7ec4\u5217\u8868\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"625","title":"\u6700\u5c0f\u56e0\u5f0f\u5206\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"626","title":"\u6362\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"627","title":"\u53d8\u66f4\u6027\u522b","__typename":"AppliedTranslationNode"},{"questionId":"628","title":"\u4e09\u4e2a\u6570\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"629","title":"K\u4e2a\u9006\u5e8f\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"630","title":"\u8bfe\u7a0b\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"631","title":"\u8bbe\u8ba1 Excel \u6c42\u548c\u516c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"632","title":"\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"633","title":"\u5e73\u65b9\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"634","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u9519\u4f4d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"635","title":"\u8bbe\u8ba1\u65e5\u5fd7\u5b58\u50a8\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"636","title":"\u51fd\u6570\u7684\u72ec\u5360\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"637","title":"\u4e8c\u53c9\u6811\u7684\u5c42\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"638","title":"\u5927\u793c\u5305","__typename":"AppliedTranslationNode"},{"questionId":"639","title":"\u89e3\u7801\u65b9\u6cd5 II","__typename":"AppliedTranslationNode"},{"questionId":"640","title":"\u6c42\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"642","title":"\u8bbe\u8ba1\u641c\u7d22\u81ea\u52a8\u8865\u5168\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"643","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 I","__typename":"AppliedTranslationNode"},{"questionId":"644","title":"\u5b50\u6570\u7ec4\u6700\u5927\u5e73\u5747\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"645","title":"\u9519\u8bef\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"646","title":"\u6700\u957f\u6570\u5bf9\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"647","title":"\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"648","title":"\u5355\u8bcd\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"649","title":"Dota2 \u53c2\u8bae\u9662","__typename":"AppliedTranslationNode"},{"questionId":"650","title":"\u53ea\u6709\u4e24\u4e2a\u952e\u7684\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"651","title":"4\u952e\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"652","title":"\u5bfb\u627e\u91cd\u590d\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"653","title":"\u4e24\u6570\u4e4b\u548c IV - \u8f93\u5165 BST","__typename":"AppliedTranslationNode"},{"questionId":"654","title":"\u6700\u5927\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"655","title":"\u8f93\u51fa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"656","title":"\u91d1\u5e01\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"657","title":"\u673a\u5668\u4eba\u80fd\u5426\u8fd4\u56de\u539f\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"658","title":"\u627e\u5230 K \u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"659","title":"\u5206\u5272\u6570\u7ec4\u4e3a\u8fde\u7eed\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"660","title":"\u79fb\u9664 9","__typename":"AppliedTranslationNode"},{"questionId":"661","title":"\u56fe\u7247\u5e73\u6ed1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"662","title":"\u4e8c\u53c9\u6811\u6700\u5927\u5bbd\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"663","title":"\u5747\u5300\u6811\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"664","title":"\u5947\u602a\u7684\u6253\u5370\u673a","__typename":"AppliedTranslationNode"},{"questionId":"665","title":"\u975e\u9012\u51cf\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"666","title":"\u8def\u5f84\u603b\u548c IV","__typename":"AppliedTranslationNode"},{"questionId":"667","title":"\u4f18\u7f8e\u7684\u6392\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"668","title":"\u4e58\u6cd5\u8868\u4e2d\u7b2ck\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"669","title":"\u4fee\u526a\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"670","title":"\u6700\u5927\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"671","title":"\u4e8c\u53c9\u6811\u4e2d\u7b2c\u4e8c\u5c0f\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"672","title":"\u706f\u6ce1\u5f00\u5173 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"673","title":"\u6700\u957f\u9012\u589e\u5b50\u5e8f\u5217\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"674","title":"\u6700\u957f\u8fde\u7eed\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"675","title":"\u4e3a\u9ad8\u5c14\u592b\u6bd4\u8d5b\u780d\u6811","__typename":"AppliedTranslationNode"},{"questionId":"676","title":"\u5b9e\u73b0\u4e00\u4e2a\u9b54\u6cd5\u5b57\u5178","__typename":"AppliedTranslationNode"},{"questionId":"677","title":"\u952e\u503c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"678","title":"\u6709\u6548\u7684\u62ec\u53f7\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"679","title":"24 \u70b9\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"680","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 \u2161","__typename":"AppliedTranslationNode"},{"questionId":"681","title":"\u6700\u8fd1\u65f6\u523b","__typename":"AppliedTranslationNode"},{"questionId":"682","title":"\u68d2\u7403\u6bd4\u8d5b","__typename":"AppliedTranslationNode"},{"questionId":"683","title":"K \u4e2a\u5173\u95ed\u7684\u706f\u6ce1","__typename":"AppliedTranslationNode"},{"questionId":"684","title":"\u5197\u4f59\u8fde\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"685","title":"\u5197\u4f59\u8fde\u63a5 II","__typename":"AppliedTranslationNode"},{"questionId":"686","title":"\u91cd\u590d\u53e0\u52a0\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"687","title":"\u6700\u957f\u540c\u503c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"688","title":"\u201c\u9a6c\u201d\u5728\u68cb\u76d8\u4e0a\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"689","title":"\u4e09\u4e2a\u65e0\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"690","title":"\u5458\u5de5\u7684\u91cd\u8981\u6027","__typename":"AppliedTranslationNode"},{"questionId":"691","title":"\u8d34\u7eb8\u62fc\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"692","title":"\u524dK\u4e2a\u9ad8\u9891\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"693","title":"\u4ea4\u66ff\u4f4d\u4e8c\u8fdb\u5236\u6570","__typename":"AppliedTranslationNode"},{"questionId":"694","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"695","title":"\u5c9b\u5c7f\u7684\u6700\u5927\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"696","title":"\u8ba1\u6570\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"697","title":"\u6570\u7ec4\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"698","title":"\u5212\u5206\u4e3ak\u4e2a\u76f8\u7b49\u7684\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"699","title":"\u6389\u843d\u7684\u65b9\u5757","__typename":"AppliedTranslationNode"},{"questionId":"711","title":"\u4e0d\u540c\u5c9b\u5c7f\u7684\u6570\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"712","title":"\u4e24\u4e2a\u5b57\u7b26\u4e32\u7684\u6700\u5c0fASCII\u5220\u9664\u548c","__typename":"AppliedTranslationNode"},{"questionId":"713","title":"\u4e58\u79ef\u5c0f\u4e8eK\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"714","title":"\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a\u542b\u624b\u7eed\u8d39","__typename":"AppliedTranslationNode"},{"questionId":"715","title":"Range \u6a21\u5757","__typename":"AppliedTranslationNode"},{"questionId":"716","title":"\u6700\u5927\u6808","__typename":"AppliedTranslationNode"},{"questionId":"717","title":"1\u6bd4\u7279\u4e0e2\u6bd4\u7279\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"718","title":"\u6700\u957f\u91cd\u590d\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"719","title":"\u627e\u51fa\u7b2c k \u5c0f\u7684\u8ddd\u79bb\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"720","title":"\u8bcd\u5178\u4e2d\u6700\u957f\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"721","title":"\u8d26\u6237\u5408\u5e76","__typename":"AppliedTranslationNode"},{"questionId":"722","title":"\u5220\u9664\u6ce8\u91ca","__typename":"AppliedTranslationNode"},{"questionId":"723","title":"\u7c89\u788e\u7cd6\u679c","__typename":"AppliedTranslationNode"},{"questionId":"724","title":"\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u4e0b\u6807","__typename":"AppliedTranslationNode"},{"questionId":"725","title":"\u5206\u9694\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"726","title":"\u539f\u5b50\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"727","title":"\u6700\u5c0f\u7a97\u53e3\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"728","title":"\u81ea\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"729","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 I","__typename":"AppliedTranslationNode"},{"questionId":"730","title":"\u7edf\u8ba1\u4e0d\u540c\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"731","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 II","__typename":"AppliedTranslationNode"},{"questionId":"732","title":"\u6211\u7684\u65e5\u7a0b\u5b89\u6392\u8868 III","__typename":"AppliedTranslationNode"},{"questionId":"733","title":"\u56fe\u50cf\u6e32\u67d3","__typename":"AppliedTranslationNode"},{"questionId":"734","title":"\u53e5\u5b50\u76f8\u4f3c\u6027","__typename":"AppliedTranslationNode"},{"questionId":"735","title":"\u884c\u661f\u78b0\u649e","__typename":"AppliedTranslationNode"},{"questionId":"736","title":"Lisp \u8bed\u6cd5\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"737","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 II","__typename":"AppliedTranslationNode"},{"questionId":"738","title":"\u5355\u8c03\u9012\u589e\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"739","title":"\u6bcf\u65e5\u6e29\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"740","title":"\u5220\u9664\u5e76\u83b7\u5f97\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"741","title":"\u6458\u6a31\u6843","__typename":"AppliedTranslationNode"},{"questionId":"742","title":"\u8f6c\u6362\u6210\u5c0f\u5199\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"743","title":"\u4e8c\u53c9\u6811\u6700\u8fd1\u7684\u53f6\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"744","title":"\u7f51\u7edc\u5ef6\u8fdf\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"745","title":"\u5bfb\u627e\u6bd4\u76ee\u6807\u5b57\u6bcd\u5927\u7684\u6700\u5c0f\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"746","title":"\u524d\u7f00\u548c\u540e\u7f00\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"747","title":"\u4f7f\u7528\u6700\u5c0f\u82b1\u8d39\u722c\u697c\u68af","__typename":"AppliedTranslationNode"},{"questionId":"748","title":"\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"749","title":"\u6700\u77ed\u8865\u5168\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"750","title":"\u9694\u79bb\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"751","title":"\u89d2\u77e9\u5f62\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"752","title":"IP \u5230 CIDR","__typename":"AppliedTranslationNode"},{"questionId":"753","title":"\u6253\u5f00\u8f6c\u76d8\u9501","__typename":"AppliedTranslationNode"},{"questionId":"754","title":"\u7834\u89e3\u4fdd\u9669\u7bb1","__typename":"AppliedTranslationNode"},{"questionId":"755","title":"\u5230\u8fbe\u7ec8\u70b9\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"756","title":"\u5012\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"757","title":"\u91d1\u5b57\u5854\u8f6c\u6362\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"758","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u5316\u4e3a\u6392\u5e8f\u7684\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"759","title":"\u8bbe\u7f6e\u4ea4\u96c6\u5927\u5c0f\u81f3\u5c11\u4e3a2","__typename":"AppliedTranslationNode"},{"questionId":"760","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u52a0\u7c97\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"761","title":"\u5458\u5de5\u7a7a\u95f2\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"762","title":"\u627e\u51fa\u53d8\u4f4d\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"763","title":"\u7279\u6b8a\u7684\u4e8c\u8fdb\u5236\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"764","title":"N \u53c9\u6811\u7684\u5c42\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"765","title":"\u5e8f\u5217\u5316\u548c\u53cd\u5e8f\u5217\u5316 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"766","title":"\u6241\u5e73\u5316\u591a\u7ea7\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"767","title":"\u4e8c\u8fdb\u5236\u8868\u793a\u4e2d\u8d28\u6570\u4e2a\u8ba1\u7b97\u7f6e\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"768","title":"\u5212\u5206\u5b57\u6bcd\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"769","title":"\u6700\u5927\u52a0\u53f7\u6807\u5fd7","__typename":"AppliedTranslationNode"},{"questionId":"770","title":"\u60c5\u4fa3\u7275\u624b","__typename":"AppliedTranslationNode"},{"questionId":"771","title":"\u5c06 N \u53c9\u6811\u7f16\u7801\u4e3a\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"772","title":"\u5efa\u7acb\u56db\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"773","title":"\u56db\u53c9\u6811\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"774","title":"N \u53c9\u6811\u7684\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"775","title":"N \u53c9\u6811\u7684\u524d\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"776","title":"N \u53c9\u6811\u7684\u540e\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"777","title":"\u6258\u666e\u5229\u8328\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"778","title":"\u91cd\u6784\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"779","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757 II","__typename":"AppliedTranslationNode"},{"questionId":"780","title":"\u6700\u591a\u80fd\u5b8c\u6210\u6392\u5e8f\u7684\u5757","__typename":"AppliedTranslationNode"},{"questionId":"781","title":"\u57fa\u672c\u8ba1\u7b97\u5668 IV","__typename":"AppliedTranslationNode"},{"questionId":"782","title":"\u5b9d\u77f3\u4e0e\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"783","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"784","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u63d2\u5165\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"785","title":"\u57fa\u672c\u8ba1\u7b97\u5668 III","__typename":"AppliedTranslationNode"},{"questionId":"786","title":"\u641c\u7d22\u957f\u5ea6\u672a\u77e5\u7684\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"787","title":"\u6ed1\u52a8\u8c1c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"788","title":"\u6700\u5c0f\u5316\u53bb\u52a0\u6cb9\u7ad9\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"789","title":"\u6570\u636e\u6d41\u4e2d\u7684\u7b2c K \u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"790","title":"\u5168\u5c40\u5012\u7f6e\u4e0e\u5c40\u90e8\u5012\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"791","title":"\u62c6\u5206\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"792","title":"\u4e8c\u5206\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"793","title":"\u5728LR\u5b57\u7b26\u4e32\u4e2d\u4ea4\u6362\u76f8\u90bb\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"794","title":"\u6c34\u4f4d\u4e0a\u5347\u7684\u6cf3\u6c60\u4e2d\u6e38\u6cf3","__typename":"AppliedTranslationNode"},{"questionId":"795","title":"\u7b2cK\u4e2a\u8bed\u6cd5\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"796","title":"\u5230\u8fbe\u7ec8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"797","title":"\u68ee\u6797\u4e2d\u7684\u5154\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"798","title":"\u53d8\u4e3a\u68cb\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"799","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8282\u70b9\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"800","title":"\u5b57\u6bcd\u5927\u5c0f\u5199\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"801","title":"\u5224\u65ad\u4e8c\u5206\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"802","title":"\u7b2c K \u4e2a\u6700\u5c0f\u7684\u7d20\u6570\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"803","title":"K \u7ad9\u4e2d\u8f6c\u5185\u6700\u4fbf\u5b9c\u7684\u822a\u73ed","__typename":"AppliedTranslationNode"},{"questionId":"804","title":"\u65cb\u8f6c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"805","title":"\u9003\u8131\u963b\u788d\u8005","__typename":"AppliedTranslationNode"},{"questionId":"806","title":"\u591a\u7c73\u8bfa\u548c\u6258\u7c73\u8bfa\u5e73\u94fa","__typename":"AppliedTranslationNode"},{"questionId":"807","title":"\u81ea\u5b9a\u4e49\u5b57\u7b26\u4e32\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"808","title":"\u5339\u914d\u5b50\u5e8f\u5217\u7684\u5355\u8bcd\u6570","__typename":"AppliedTranslationNode"},{"questionId":"809","title":"\u9636\u4e58\u51fd\u6570\u540e K \u4e2a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"810","title":"\u6709\u6548\u7684\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"811","title":"\u533a\u95f4\u5b50\u6570\u7ec4\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"812","title":"\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"813","title":"\u6240\u6709\u53ef\u80fd\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"814","title":"\u5f97\u5206\u6700\u9ad8\u7684\u6700\u5c0f\u8f6e\u8c03","__typename":"AppliedTranslationNode"},{"questionId":"815","title":"\u9999\u69df\u5854","__typename":"AppliedTranslationNode"},{"questionId":"816","title":"\u8bbe\u8ba1\u54c8\u5e0c\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"817","title":"\u8bbe\u8ba1\u54c8\u5e0c\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"818","title":"\u76f8\u4f3c RGB \u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"819","title":"\u4f7f\u5e8f\u5217\u9012\u589e\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"820","title":"\u627e\u5230\u6700\u7ec8\u7684\u5b89\u5168\u72b6\u6001","__typename":"AppliedTranslationNode"},{"questionId":"821","title":"\u6253\u7816\u5757","__typename":"AppliedTranslationNode"},{"questionId":"822","title":"\u552f\u4e00\u6469\u5c14\u65af\u5bc6\u7801\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"823","title":"\u6570\u7ec4\u7684\u5747\u503c\u5206\u5272","__typename":"AppliedTranslationNode"},{"questionId":"824","title":"\u5199\u5b57\u7b26\u4e32\u9700\u8981\u7684\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"825","title":"\u4fdd\u6301\u57ce\u5e02\u5929\u9645\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"826","title":"\u5206\u6c64","__typename":"AppliedTranslationNode"},{"questionId":"827","title":"\u60c5\u611f\u4e30\u5bcc\u7684\u6587\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"828","title":"\u9ed1\u677f\u5f02\u6216\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"829","title":"\u5b50\u57df\u540d\u8bbf\u95ee\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"830","title":"\u6700\u5927\u4e09\u89d2\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"831","title":"\u6700\u5927\u5e73\u5747\u503c\u548c\u7684\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"832","title":"\u4e8c\u53c9\u6811\u526a\u679d","__typename":"AppliedTranslationNode"},{"questionId":"833","title":"\u516c\u4ea4\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"834","title":"\u6a21\u7cca\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"835","title":"\u94fe\u8868\u7ec4\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"836","title":"\u8d5b\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"837","title":"\u6700\u5e38\u89c1\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"838","title":"\u8bbe\u8ba1\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"839","title":"\u5355\u8bcd\u7684\u538b\u7f29\u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"841","title":"\u5b57\u7b26\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"842","title":"\u7ffb\u8f6c\u5361\u7247\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"843","title":"\u5e26\u56e0\u5b50\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"850","title":"\u5faa\u73af\u6709\u5e8f\u5217\u8868\u7684\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"851","title":"\u5c71\u7f8a\u62c9\u4e01\u6587","__typename":"AppliedTranslationNode"},{"questionId":"852","title":"\u9002\u9f84\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"853","title":"\u5b89\u6392\u5de5\u4f5c\u4ee5\u8fbe\u5230\u6700\u5927\u6536\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"854","title":"\u6700\u5927\u4eba\u5de5\u5c9b","__typename":"AppliedTranslationNode"},{"questionId":"855","title":"\u7edf\u8ba1\u5b50\u4e32\u4e2d\u7684\u552f\u4e00\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"856","title":"\u8fde\u7eed\u6574\u6570\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"857","title":"\u8f83\u5927\u5206\u7ec4\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"858","title":"\u9690\u85cf\u4e2a\u4eba\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"859","title":"\u8bbe\u8ba1\u5faa\u73af\u53cc\u7aef\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"860","title":"\u8bbe\u8ba1\u5faa\u73af\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"861","title":"\u7ffb\u8f6c\u56fe\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"862","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u67e5\u627e\u4e0e\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"863","title":"\u6811\u4e2d\u8ddd\u79bb\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"864","title":"\u56fe\u50cf\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"865","title":"\u626b\u5730\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"866","title":"\u77e9\u5f62\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"867","title":"\u65b021\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"868","title":"\u63a8\u591a\u7c73\u8bfa","__typename":"AppliedTranslationNode"},{"questionId":"869","title":"\u76f8\u4f3c\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"870","title":"\u77e9\u9635\u4e2d\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"871","title":"\u94a5\u5319\u548c\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"872","title":"\u5c06\u6570\u7ec4\u62c6\u5206\u6210\u6590\u6ce2\u90a3\u5951\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"873","title":"\u731c\u731c\u8fd9\u4e2a\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"874","title":"\u6bd4\u8f83\u542b\u9000\u683c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"875","title":"\u6570\u7ec4\u4e2d\u7684\u6700\u957f\u5c71\u8109","__typename":"AppliedTranslationNode"},{"questionId":"876","title":"\u4e00\u624b\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"877","title":"\u8bbf\u95ee\u6240\u6709\u8282\u70b9\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"878","title":"\u5b57\u6bcd\u79fb\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"879","title":"\u5230\u6700\u8fd1\u7684\u4eba\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"880","title":"\u77e9\u5f62\u9762\u79ef II","__typename":"AppliedTranslationNode"},{"questionId":"881","title":"\u55a7\u95f9\u548c\u5bcc\u6709","__typename":"AppliedTranslationNode"},{"questionId":"882","title":"\u5c71\u8109\u6570\u7ec4\u7684\u5cf0\u9876\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"883","title":"\u8f66\u961f","__typename":"AppliedTranslationNode"},{"questionId":"884","title":"\u76f8\u4f3c\u5ea6\u4e3a K \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"885","title":"\u8003\u573a\u5c31\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"886","title":"\u62ec\u53f7\u7684\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"887","title":"\u96c7\u4f63 K \u540d\u5de5\u4eba\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"888","title":"\u955c\u9762\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"889","title":"\u4eb2\u5bc6\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"890","title":"\u67e0\u6aac\u6c34\u627e\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"891","title":"\u7ffb\u8f6c\u77e9\u9635\u540e\u7684\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"892","title":"\u548c\u81f3\u5c11\u4e3a K \u7684\u6700\u77ed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"893","title":"\u4e8c\u53c9\u6811\u4e2d\u6240\u6709\u8ddd\u79bb\u4e3a K \u7684\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"894","title":"\u9ed1\u540d\u5355\u4e2d\u7684\u968f\u673a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"895","title":"\u83b7\u53d6\u6240\u6709\u94a5\u5319\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"896","title":"\u5177\u6709\u6240\u6709\u6700\u6df1\u8282\u70b9\u7684\u6700\u5c0f\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"897","title":"\u56de\u6587\u7d20\u6570","__typename":"AppliedTranslationNode"},{"questionId":"898","title":"\u8f6c\u7f6e\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"899","title":"\u4e8c\u8fdb\u5236\u95f4\u8ddd","__typename":"AppliedTranslationNode"},{"questionId":"900","title":"\u91cd\u65b0\u6392\u5e8f\u5f97\u5230 2 \u7684\u5e42","__typename":"AppliedTranslationNode"},{"questionId":"901","title":"\u4f18\u52bf\u6d17\u724c","__typename":"AppliedTranslationNode"},{"questionId":"902","title":"\u6700\u4f4e\u52a0\u6cb9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"903","title":"\u7528 Rand7() \u5b9e\u73b0 Rand10()","__typename":"AppliedTranslationNode"},{"questionId":"904","title":"\u53f6\u5b50\u76f8\u4f3c\u7684\u6811","__typename":"AppliedTranslationNode"},{"questionId":"905","title":"\u6700\u957f\u7684\u6590\u6ce2\u90a3\u5951\u5b50\u5e8f\u5217\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"906","title":"\u6a21\u62df\u884c\u8d70\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"907","title":"\u7231\u5403\u9999\u8549\u7684\u73c2\u73c2","__typename":"AppliedTranslationNode"},{"questionId":"908","title":"\u94fe\u8868\u7684\u4e2d\u95f4\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"909","title":"\u77f3\u5b50\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"910","title":"\u7b2c N \u4e2a\u795e\u5947\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"911","title":"\u76c8\u5229\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"912","title":"\u6309\u6743\u91cd\u968f\u673a\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"913","title":"\u968f\u673a\u7ffb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"914","title":"\u975e\u91cd\u53e0\u77e9\u5f62\u4e2d\u7684\u968f\u673a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"915","title":"\u5728\u5706\u5185\u968f\u673a\u751f\u6210\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"916","title":"\u7d22\u5f15\u5904\u7684\u89e3\u7801\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"917","title":"\u6551\u751f\u8247","__typename":"AppliedTranslationNode"},{"questionId":"918","title":"\u7ec6\u5206\u56fe\u4e2d\u7684\u53ef\u5230\u8fbe\u7ed3\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"919","title":"\u4e09\u7ef4\u5f62\u4f53\u6295\u5f71\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"920","title":"\u4e24\u53e5\u8bdd\u4e2d\u7684\u4e0d\u5e38\u89c1\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"921","title":"\u87ba\u65cb\u77e9\u9635 III","__typename":"AppliedTranslationNode"},{"questionId":"922","title":"\u53ef\u80fd\u7684\u4e8c\u5206\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"923","title":"\u9e21\u86cb\u6389\u843d","__typename":"AppliedTranslationNode"},{"questionId":"924","title":"\u516c\u5e73\u7684\u7cd6\u679c\u68d2\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"925","title":"\u6839\u636e\u524d\u5e8f\u548c\u540e\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"926","title":"\u67e5\u627e\u548c\u66ff\u6362\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"927","title":"\u5b50\u5e8f\u5217\u5bbd\u5ea6\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"928","title":"\u4e09\u7ef4\u5f62\u4f53\u7684\u8868\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"929","title":"\u7279\u6b8a\u7b49\u4ef7\u5b57\u7b26\u4e32\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"930","title":"\u6240\u6709\u53ef\u80fd\u7684\u6ee1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"931","title":"\u6700\u5927\u9891\u7387\u6808","__typename":"AppliedTranslationNode"},{"questionId":"932","title":"\u5355\u8c03\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"933","title":"\u9012\u589e\u987a\u5e8f\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"934","title":"\u5b50\u6570\u7ec4\u6309\u4f4d\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"935","title":"\u6709\u5e8f\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"936","title":"RLE \u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"937","title":"\u80a1\u7968\u4ef7\u683c\u8de8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"938","title":"\u6700\u5927\u4e3a N \u7684\u6570\u5b57\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"939","title":"DI \u5e8f\u5217\u7684\u6709\u6548\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"940","title":"\u6c34\u679c\u6210\u7bee","__typename":"AppliedTranslationNode"},{"questionId":"941","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"942","title":"\u8d85\u7ea7\u56de\u6587\u6570","__typename":"AppliedTranslationNode"},{"questionId":"943","title":"\u5b50\u6570\u7ec4\u7684\u6700\u5c0f\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"944","title":"\u6700\u5c0f\u5dee\u503c I","__typename":"AppliedTranslationNode"},{"questionId":"945","title":"\u86c7\u68af\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"946","title":"\u6700\u5c0f\u5dee\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"947","title":"\u5728\u7ebf\u9009\u4e3e","__typename":"AppliedTranslationNode"},{"questionId":"948","title":"\u6392\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"949","title":"\u732b\u548c\u8001\u9f20","__typename":"AppliedTranslationNode"},{"questionId":"950","title":"\u5361\u724c\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"951","title":"\u5206\u5272\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"952","title":"\u5355\u8bcd\u5b50\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"953","title":"\u4ec5\u4ec5\u53cd\u8f6c\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"954","title":"\u73af\u5f62\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"955","title":"\u5b8c\u5168\u4e8c\u53c9\u6811\u63d2\u5165\u5668","__typename":"AppliedTranslationNode"},{"questionId":"956","title":"\u64ad\u653e\u5217\u8868\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"957","title":"\u4f7f\u62ec\u53f7\u6709\u6548\u7684\u6700\u5c11\u6dfb\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"958","title":"\u6309\u5947\u5076\u6392\u5e8f\u6570\u7ec4 II","__typename":"AppliedTranslationNode"},{"questionId":"959","title":"\u4e09\u6570\u4e4b\u548c\u7684\u591a\u79cd\u53ef\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"960","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad","__typename":"AppliedTranslationNode"},{"questionId":"961","title":"\u957f\u6309\u952e\u5165","__typename":"AppliedTranslationNode"},{"questionId":"962","title":"\u5c06\u5b57\u7b26\u4e32\u7ffb\u8f6c\u5230\u5355\u8c03\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"963","title":"\u4e09\u7b49\u5206","__typename":"AppliedTranslationNode"},{"questionId":"964","title":"\u5c3d\u91cf\u51cf\u5c11\u6076\u610f\u8f6f\u4ef6\u7684\u4f20\u64ad II","__typename":"AppliedTranslationNode"},{"questionId":"965","title":"\u72ec\u7279\u7684\u7535\u5b50\u90ae\u4ef6\u5730\u5740","__typename":"AppliedTranslationNode"},{"questionId":"966","title":"\u548c\u76f8\u540c\u7684\u4e8c\u5143\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"967","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c","__typename":"AppliedTranslationNode"},{"questionId":"968","title":"\u6f02\u4eae\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"969","title":"\u6700\u8fd1\u7684\u8bf7\u6c42\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"971","title":"\u6700\u77ed\u7684\u6865","__typename":"AppliedTranslationNode"},{"questionId":"972","title":"\u9a91\u58eb\u62e8\u53f7\u5668","__typename":"AppliedTranslationNode"},{"questionId":"973","title":"\u6233\u5370\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"974","title":"\u91cd\u65b0\u6392\u5217\u65e5\u5fd7\u6587\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"975","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u8303\u56f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"976","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"977","title":"\u4e0d\u540c\u7684\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"978","title":"\u6709\u6548\u7684\u5c71\u8109\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"979","title":"\u589e\u51cf\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"980","title":"\u6700\u77ed\u8d85\u7ea7\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"981","title":"\u5220\u5217\u9020\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"982","title":"\u4f7f\u6570\u7ec4\u552f\u4e00\u7684\u6700\u5c0f\u589e\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"983","title":"\u9a8c\u8bc1\u6808\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"984","title":"\u79fb\u9664\u6700\u591a\u7684\u540c\u884c\u6216\u540c\u5217\u77f3\u5934","__typename":"AppliedTranslationNode"},{"questionId":"985","title":"\u4ee4\u724c\u653e\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"986","title":"\u7ed9\u5b9a\u6570\u5b57\u80fd\u7ec4\u6210\u7684\u6700\u5927\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"987","title":"\u6309\u9012\u589e\u987a\u5e8f\u663e\u793a\u5361\u724c","__typename":"AppliedTranslationNode"},{"questionId":"988","title":"\u7ffb\u8f6c\u7b49\u4ef7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"989","title":"\u6309\u516c\u56e0\u6570\u8ba1\u7b97\u6700\u5927\u7ec4\u4ef6\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"990","title":"\u9a8c\u8bc1\u5916\u661f\u8bed\u8bcd\u5178","__typename":"AppliedTranslationNode"},{"questionId":"991","title":"\u4e8c\u500d\u6570\u5bf9\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"992","title":"\u5220\u5217\u9020\u5e8f II","__typename":"AppliedTranslationNode"},{"questionId":"993","title":"\u6700\u9ad8\u7684\u5e7f\u544a\u724c","__typename":"AppliedTranslationNode"},{"questionId":"994","title":"N \u5929\u540e\u7684\u7262\u623f","__typename":"AppliedTranslationNode"},{"questionId":"998","title":"\u4e8c\u53c9\u6811\u7684\u5b8c\u5168\u6027\u68c0\u9a8c","__typename":"AppliedTranslationNode"},{"questionId":"999","title":"\u7531\u659c\u6760\u5212\u5206\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1000","title":"\u5220\u5217\u9020\u5e8f III","__typename":"AppliedTranslationNode"},{"questionId":"1001","title":"\u91cd\u590d N \u6b21\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1002","title":"\u6700\u5927\u5bbd\u5ea6\u5761","__typename":"AppliedTranslationNode"},{"questionId":"1003","title":"\u6700\u5c0f\u9762\u79ef\u77e9\u5f62 II","__typename":"AppliedTranslationNode"},{"questionId":"1004","title":"\u8868\u793a\u6570\u5b57\u7684\u6700\u5c11\u8fd0\u7b97\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1005","title":"\u5355\u503c\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1006","title":"\u5143\u97f3\u62fc\u5199\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1007","title":"\u8fde\u7eed\u5dee\u76f8\u540c\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1008","title":"\u76d1\u63a7\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1009","title":"\u714e\u997c\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1010","title":"\u5f3a\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1011","title":"\u7ffb\u8f6c\u4e8c\u53c9\u6811\u4ee5\u5339\u914d\u5148\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1012","title":"\u76f8\u7b49\u7684\u6709\u7406\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1013","title":"\u6590\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1014","title":"\u6700\u63a5\u8fd1\u539f\u70b9\u7684 K \u4e2a\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1016","title":"\u548c\u53ef\u88ab K \u6574\u9664\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1017","title":"\u5947\u5076\u8df3","__typename":"AppliedTranslationNode"},{"questionId":"1018","title":"\u4e09\u89d2\u5f62\u7684\u6700\u5927\u5468\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1019","title":"\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1020","title":"\u6700\u957f\u6e4d\u6d41\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1021","title":"\u5728\u4e8c\u53c9\u6811\u4e2d\u5206\u914d\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1022","title":"\u4e0d\u540c\u8def\u5f84 III","__typename":"AppliedTranslationNode"},{"questionId":"1023","title":"\u57fa\u4e8e\u65f6\u95f4\u7684\u952e\u503c\u5b58\u50a8","__typename":"AppliedTranslationNode"},{"questionId":"1024","title":"\u6309\u4f4d\u4e0e\u4e3a\u96f6\u7684\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1025","title":"\u6700\u4f4e\u7968\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1026","title":"\u4e0d\u542b AAA \u6216 BBB \u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1027","title":"\u67e5\u8be2\u540e\u7684\u5076\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1028","title":"\u533a\u95f4\u5217\u8868\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1029","title":"\u4e8c\u53c9\u6811\u7684\u5782\u5e8f\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1030","title":"\u4ece\u53f6\u7ed3\u70b9\u5f00\u59cb\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1031","title":"\u6570\u7ec4\u5f62\u5f0f\u7684\u6574\u6570\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1032","title":"\u7b49\u5f0f\u65b9\u7a0b\u7684\u53ef\u6ee1\u8db3\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1033","title":"\u574f\u4e86\u7684\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1034","title":"K \u4e2a\u4e0d\u540c\u6574\u6570\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1035","title":"\u4e8c\u53c9\u6811\u7684\u5802\u5144\u5f1f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1036","title":"\u8150\u70c2\u7684\u6a58\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1037","title":"K \u8fde\u7eed\u4f4d\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1038","title":"\u6b63\u65b9\u5f62\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1039","title":"\u627e\u5230\u5c0f\u9547\u7684\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1040","title":"\u6700\u5927\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"1041","title":"\u53ef\u4ee5\u88ab\u4e00\u6b65\u6355\u83b7\u7684\u68cb\u5b50\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1042","title":"\u5408\u5e76\u77f3\u5934\u7684\u6700\u4f4e\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1043","title":"\u7f51\u683c\u7167\u660e","__typename":"AppliedTranslationNode"},{"questionId":"1044","title":"\u67e5\u627e\u5e38\u7528\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1045","title":"\u68c0\u67e5\u66ff\u6362\u540e\u7684\u8bcd\u662f\u5426\u6709\u6548","__typename":"AppliedTranslationNode"},{"questionId":"1046","title":"\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1047","title":"K \u6b21\u53d6\u53cd\u540e\u6700\u5927\u5316\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1048","title":"\u7b28\u9636\u4e58","__typename":"AppliedTranslationNode"},{"questionId":"1049","title":"\u884c\u76f8\u7b49\u7684\u6700\u5c11\u591a\u7c73\u8bfa\u65cb\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"1050","title":"\u524d\u5e8f\u904d\u5386\u6784\u9020\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1051","title":"\u5f62\u6210\u5b57\u7b26\u4e32\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1052","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1053","title":"\u6700\u5c0f\u5316\u820d\u5165\u8bef\u5dee\u4ee5\u6ee1\u8db3\u76ee\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1054","title":"\u5341\u8fdb\u5236\u6574\u6570\u7684\u53cd\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1055","title":"\u603b\u6301\u7eed\u65f6\u95f4\u53ef\u88ab 60 \u6574\u9664\u7684\u6b4c\u66f2","__typename":"AppliedTranslationNode"},{"questionId":"1056","title":"\u5728 D \u5929\u5185\u9001\u8fbe\u5305\u88f9\u7684\u80fd\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1057","title":"\u81f3\u5c11\u6709 1 \u4f4d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1058","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5217\u6700\u5c0f\u7684\u7b49\u6548\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1059","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u7684\u7f3a\u5931\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1060","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1061","title":"\u6709\u6548\u5b50\u6570\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1062","title":"\u5c06\u6570\u7ec4\u5206\u6210\u548c\u76f8\u7b49\u7684\u4e09\u4e2a\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1063","title":"\u6700\u4f73\u89c2\u5149\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1064","title":"\u53ef\u88ab K \u6574\u9664\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1065","title":"\u5b50\u4e32\u80fd\u8868\u793a\u4ece 1 \u5230 N \u6570\u5b57\u7684\u4e8c\u8fdb\u5236\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1066","title":"\u4e0d\u52a8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1067","title":"\u6821\u56ed\u81ea\u884c\u8f66\u5206\u914d II","__typename":"AppliedTranslationNode"},{"questionId":"1068","title":"\u8303\u56f4\u5185\u7684\u6570\u5b57\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1069","title":"\u6613\u6df7\u6dc6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1070","title":"\u8d1f\u4e8c\u8fdb\u5236\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1071","title":"\u53ef\u88ab 5 \u6574\u9664\u7684\u4e8c\u8fdb\u5236\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1072","title":"\u94fe\u8868\u4e2d\u7684\u4e0b\u4e00\u4e2a\u66f4\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1073","title":"\u98de\u5730\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1074","title":"\u524d\u4e94\u79d1\u7684\u5747\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1075","title":"\u5b57\u7b26\u4e32\u7684\u7d22\u5f15\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1076","title":"\u82b1\u62ec\u53f7\u5c55\u5f00","__typename":"AppliedTranslationNode"},{"questionId":"1077","title":"\u6613\u6df7\u6dc6\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"1078","title":"\u5220\u9664\u6700\u5916\u5c42\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1079","title":"\u4ece\u6839\u5230\u53f6\u7684\u4e8c\u8fdb\u5236\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1080","title":"\u9a7c\u5cf0\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1081","title":"\u89c6\u9891\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1082","title":"\u6700\u5c0f\u5143\u7d20\u5404\u6570\u4f4d\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1083","title":"\u5c0f\u4e8e K \u7684\u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1084","title":"\u957f\u5ea6\u4e3a K \u7684\u65e0\u91cd\u590d\u5b57\u7b26\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1085","title":"\u5f7c\u6b64\u719f\u8bc6\u7684\u6700\u65e9\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1086","title":"\u9664\u6570\u535a\u5f08","__typename":"AppliedTranslationNode"},{"questionId":"1087","title":"\u6700\u957f\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1088","title":"\u4e00\u6708\u6709\u591a\u5c11\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1089","title":"\u5220\u53bb\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u97f3","__typename":"AppliedTranslationNode"},{"questionId":"1090","title":"\u963f\u59c6\u65af\u7279\u6717\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1091","title":"\u5b50\u6811\u7684\u6700\u5927\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1092","title":"\u8282\u70b9\u4e0e\u5176\u7956\u5148\u4e4b\u95f4\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1093","title":"\u4ece\u5148\u5e8f\u904d\u5386\u8fd8\u539f\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1094","title":"\u8ddd\u79bb\u987a\u5e8f\u6392\u5217\u77e9\u9635\u5355\u5143\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1095","title":"\u4e24\u5730\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1096","title":"\u4e24\u4e2a\u975e\u91cd\u53e0\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1097","title":"\u5b57\u7b26\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1098","title":"\u6700\u5927\u552f\u4e00\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1099","title":"\u5f97\u5206\u6700\u9ad8\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1100","title":"\u6700\u4f4e\u6210\u672c\u8054\u901a\u6240\u6709\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1101","title":"\u5e73\u884c\u8bfe\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1102","title":"\u68c0\u67e5\u4e00\u4e2a\u6570\u662f\u5426\u5728\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1103","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed","__typename":"AppliedTranslationNode"},{"questionId":"1104","title":"\u8fb9\u6846\u7740\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1105","title":"\u4e0d\u76f8\u4ea4\u7684\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1106","title":"\u9003\u79bb\u5927\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1107","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570\u6765\u7ec4\u5408\u6240\u6709\u7684 1","__typename":"AppliedTranslationNode"},{"questionId":"1108","title":"\u7528\u6237\u7f51\u7ad9\u8bbf\u95ee\u884c\u4e3a\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1110","title":"\u516c\u8def\u6d41\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1111","title":"\u591a\u8fb9\u5f62\u4e09\u89d2\u5256\u5206\u7684\u6700\u4f4e\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1112","title":"\u62fc\u5199\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1113","title":"\u79fb\u52a8\u77f3\u5b50\u76f4\u5230\u8fde\u7eed II","__typename":"AppliedTranslationNode"},{"questionId":"1114","title":"\u628a\u4e8c\u53c9\u641c\u7d22\u6811\u8f6c\u6362\u4e3a\u7d2f\u52a0\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1115","title":"\u6709\u6548\u7684\u56de\u65cb\u9556","__typename":"AppliedTranslationNode"},{"questionId":"1116","title":"\u6700\u5927\u5c42\u5185\u5143\u7d20\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1117","title":"\u5730\u56fe\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1118","title":"\u5c06\u6570\u7ec4\u5206\u6210\u51e0\u4e2a\u9012\u589e\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1119","title":"\u56f0\u4e8e\u73af\u4e2d\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1120","title":"\u4e0d\u90bb\u63a5\u690d\u82b1","__typename":"AppliedTranslationNode"},{"questionId":"1121","title":"\u5206\u9694\u6570\u7ec4\u4ee5\u5f97\u5230\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1122","title":"\u6700\u957f\u91cd\u590d\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1123","title":"\u5355\u884c\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1124","title":"\u5b57\u7b26\u4e32\u8f6c\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1125","title":"\u8bbe\u8ba1\u6587\u4ef6\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1126","title":"\u8fde\u63a5\u68d2\u6750\u7684\u6700\u4f4e\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1127","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1128","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879","__typename":"AppliedTranslationNode"},{"questionId":"1129","title":"\u6700\u957f\u5b57\u7b26\u4e32\u94fe","__typename":"AppliedTranslationNode"},{"questionId":"1130","title":"\u6700\u540e\u4e00\u5757\u77f3\u5934\u7684\u91cd\u91cf II","__typename":"AppliedTranslationNode"},{"questionId":"1131","title":"\u7edf\u8ba1\u53ea\u542b\u5355\u4e00\u5b57\u6bcd\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1132","title":"\u524d\u540e\u62fc\u63a5","__typename":"AppliedTranslationNode"},{"questionId":"1133","title":"\u6309\u5b57\u5178\u5e8f\u6392\u5728\u6700\u540e\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1134","title":"\u4e0e\u76ee\u6807\u989c\u8272\u95f4\u7684\u6700\u77ed\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1135","title":"\u4e70\u4e0b\u6240\u6709\u4ea7\u54c1\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1136","title":"\u5408\u4f5c\u8fc7\u81f3\u5c11\u4e09\u6b21\u7684\u6f14\u5458\u548c\u5bfc\u6f14","__typename":"AppliedTranslationNode"},{"questionId":"1137","title":"\u9ad8\u5ea6\u68c0\u67e5\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1138","title":"\u7231\u751f\u6c14\u7684\u4e66\u5e97\u8001\u677f","__typename":"AppliedTranslationNode"},{"questionId":"1139","title":"\u4ea4\u6362\u4e00\u6b21\u7684\u5148\u524d\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1140","title":"\u8ddd\u79bb\u76f8\u7b49\u7684\u6761\u5f62\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1141","title":"\u6700\u591a\u53ef\u4ee5\u4e70\u5230\u7684\u82f9\u679c\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1142","title":"\u8fdb\u51fb\u7684\u9a91\u58eb","__typename":"AppliedTranslationNode"},{"questionId":"1143","title":"\u627e\u51fa\u6240\u6709\u884c\u4e2d\u6700\u5c0f\u516c\u5171\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1144","title":"\u6c34\u8d44\u6e90\u5206\u914d\u4f18\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1145","title":"\u5143\u7d20\u548c\u4e3a\u76ee\u6807\u503c\u7684\u5b50\u77e9\u9635\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1146","title":"\u5b57\u7b26\u4e32\u7684\u6700\u5927\u516c\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1147","title":"\u6309\u5217\u7ffb\u8f6c\u5f97\u5230\u6700\u5927\u503c\u7b49\u884c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1148","title":"\u8d1f\u4e8c\u8fdb\u5236\u6570\u76f8\u52a0","__typename":"AppliedTranslationNode"},{"questionId":"1149","title":"\u4e09\u4e2a\u6709\u5e8f\u6570\u7ec4\u7684\u4ea4\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1150","title":"\u67e5\u627e\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1151","title":"\u6b65\u8fdb\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1152","title":"\u77e9\u9635\u4e2d 1 \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1153","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1154","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1155","title":"\u4ea7\u54c1\u9500\u552e\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1156","title":"Bigram \u5206\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1157","title":"\u6839\u5230\u53f6\u8def\u5f84\u4e0a\u7684\u4e0d\u8db3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1159","title":"\u4e0d\u540c\u5b57\u7b26\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1160","title":"\u6d3b\u5b57\u5370\u5237","__typename":"AppliedTranslationNode"},{"questionId":"1161","title":"\u9879\u76ee\u5458\u5de5 I","__typename":"AppliedTranslationNode"},{"questionId":"1162","title":"\u9879\u76ee\u5458\u5de5II","__typename":"AppliedTranslationNode"},{"questionId":"1163","title":"\u9879\u76ee\u5458\u5de5 III","__typename":"AppliedTranslationNode"},{"questionId":"1164","title":"\u7b49\u5dee\u6570\u5217\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1165","title":"\u5b89\u6392\u4f1a\u8bae\u65e5\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"1166","title":"\u629b\u63b7\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1167","title":"\u5efa\u9020\u8857\u533a\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1168","title":"\u590d\u5199\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1169","title":"\u53d7\u6807\u7b7e\u5f71\u54cd\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1170","title":"\u6700\u77ed\u516c\u5171\u8d85\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1171","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1172","title":"\u9500\u552e\u5206\u6790 I ","__typename":"AppliedTranslationNode"},{"questionId":"1173","title":"\u9500\u552e\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1174","title":"\u9500\u552e\u5206\u6790III","__typename":"AppliedTranslationNode"},{"questionId":"1175","title":"\u6570\u7ec4\u53d8\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1176","title":"\u529b\u6263\u6392\u884c\u699c","__typename":"AppliedTranslationNode"},{"questionId":"1177","title":"\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1178","title":"\u9a8c\u8bc1\u56de\u6587\u5b57\u7b26\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1179","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1180","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1181","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 III","__typename":"AppliedTranslationNode"},{"questionId":"1182","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 IV","__typename":"AppliedTranslationNode"},{"questionId":"1183","title":"\u5927\u6837\u672c\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1184","title":"\u62fc\u8f66","__typename":"AppliedTranslationNode"},{"questionId":"1185","title":"\u5c71\u8109\u6570\u7ec4\u4e2d\u67e5\u627e\u76ee\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1186","title":"H2O \u751f\u6210","__typename":"AppliedTranslationNode"},{"questionId":"1187","title":"\u4ea4\u66ff\u6253\u5370FooBar","__typename":"AppliedTranslationNode"},{"questionId":"1188","title":"\u82b1\u62ec\u53f7\u5c55\u5f00 II","__typename":"AppliedTranslationNode"},{"questionId":"1189","title":"\u52a0\u5bc6\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1190","title":"\u6700\u5c0f\u516c\u5171\u533a\u57df","__typename":"AppliedTranslationNode"},{"questionId":"1191","title":"\u8fd1\u4e49\u8bcd\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1192","title":"\u5206\u4eab\u5de7\u514b\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1193","title":"\u6e38\u620f\u73a9\u6cd5\u5206\u6790 V","__typename":"AppliedTranslationNode"},{"questionId":"1194","title":"\u4e8c\u53c9\u6811\u5bfb\u8def","__typename":"AppliedTranslationNode"},{"questionId":"1195","title":"\u5206\u7cd6\u679c II","__typename":"AppliedTranslationNode"},{"questionId":"1196","title":"\u586b\u5145\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1197","title":"\u89e3\u6790\u5e03\u5c14\u8868\u8fbe\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1198","title":"\u5c0f\u4f17\u4e66\u7c4d","__typename":"AppliedTranslationNode"},{"questionId":"1199","title":"\u5341\u516d\u8fdb\u5236\u9b54\u672f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1200","title":"\u5220\u9664\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1201","title":"\u5220\u9664\u6811\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1202","title":"\u5220\u9664\u56de\u6587\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1203","title":"\u6309\u5e8f\u6253\u5370","__typename":"AppliedTranslationNode"},{"questionId":"1204","title":"\u6bcf\u65e5\u65b0\u7528\u6237\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1205","title":"IP \u5730\u5740\u65e0\u6548\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1206","title":"\u822a\u73ed\u9884\u8ba2\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1207","title":"\u5220\u70b9\u6210\u6797","__typename":"AppliedTranslationNode"},{"questionId":"1208","title":"\u6709\u6548\u62ec\u53f7\u7684\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1209","title":"\u8bbe\u8ba1\u6709\u9650\u963b\u585e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1210","title":"\u5220\u9664\u67d0\u4e9b\u5143\u7d20\u540e\u7684\u6570\u7ec4\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1211","title":"\u5b57\u6bcd\u7ec4\u5408\u8fed\u4ee3\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1212","title":"\u987a\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1213","title":"\u4e0d\u76f8\u4ea4\u7684\u63e1\u624b","__typename":"AppliedTranslationNode"},{"questionId":"1214","title":"\u6bcf\u4f4d\u5b66\u751f\u7684\u6700\u9ad8\u6210\u7ee9","__typename":"AppliedTranslationNode"},{"questionId":"1215","title":"\u62a5\u544a\u7684\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1216","title":"\u6253\u5370\u96f6\u4e0e\u5947\u5076\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1217","title":"\u6570\u7ec4\u7684\u76f8\u5bf9\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1218","title":"\u6700\u6df1\u53f6\u8282\u70b9\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1219","title":"\u8868\u73b0\u826f\u597d\u7684\u6700\u957f\u65f6\u95f4\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1220","title":"\u6700\u5c0f\u7684\u5fc5\u8981\u56e2\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1221","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc725%\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1222","title":"\u5220\u9664\u88ab\u8986\u76d6\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1223","title":"\u5e26\u9608\u503c\u7684\u56fe\u8fde\u901a\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1224","title":"\u4e0b\u964d\u8def\u5f84\u6700\u5c0f\u548c  II","__typename":"AppliedTranslationNode"},{"questionId":"1225","title":"\u67e5\u8be2\u6d3b\u8dc3\u4e1a\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1226","title":"\u7528\u6237\u8d2d\u4e70\u5e73\u53f0","__typename":"AppliedTranslationNode"},{"questionId":"1227","title":"\u7b49\u4ef7\u591a\u7c73\u8bfa\u9aa8\u724c\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1228","title":"\u53f6\u503c\u7684\u6700\u5c0f\u4ee3\u4ef7\u751f\u6210\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1229","title":"\u989c\u8272\u4ea4\u66ff\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1230","title":"\u7edd\u5bf9\u503c\u8868\u8fbe\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1231","title":"\u5c06\u6bcf\u4e2a\u5143\u7d20\u66ff\u6362\u4e3a\u53f3\u4fa7\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1232","title":"\u8f6c\u53d8\u6570\u7ec4\u540e\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1233","title":"\u77e9\u5f62\u5185\u8239\u53ea\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1234","title":"\u6700\u5927\u5f97\u5206\u7684\u8def\u5f84\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1236","title":"\u7b2c N \u4e2a\u6cf0\u6ce2\u90a3\u5951\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1237","title":"\u62a5\u544a\u7684\u8bb0\u5f55 II","__typename":"AppliedTranslationNode"},{"questionId":"1238","title":"\u5b57\u6bcd\u677f\u4e0a\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1239","title":"\u6700\u5927\u7684\u4ee5 1 \u4e3a\u8fb9\u754c\u7684\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1240","title":"\u77f3\u5b50\u6e38\u620f II","__typename":"AppliedTranslationNode"},{"questionId":"1241","title":"\u89e3\u538b\u7f29\u7f16\u7801\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1242","title":"\u77e9\u9635\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1243","title":"\u7956\u7236\u8282\u70b9\u503c\u4e3a\u5076\u6570\u7684\u8282\u70b9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1244","title":"\u4e0d\u540c\u7684\u5faa\u73af\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1245","title":"\u67e5\u8be2\u8fd130\u5929\u6d3b\u8dc3\u7528\u6237\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1246","title":"\u8fc7\u53bb30\u5929\u7684\u7528\u6237\u6d3b\u52a8 II","__typename":"AppliedTranslationNode"},{"questionId":"1247","title":"\u9012\u51cf\u5143\u7d20\u4f7f\u6570\u7ec4\u5448\u952f\u9f7f\u72b6","__typename":"AppliedTranslationNode"},{"questionId":"1248","title":"\u4e8c\u53c9\u6811\u7740\u8272\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1249","title":"\u5feb\u7167\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1250","title":"\u6700\u957f\u516c\u5171\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1251","title":"\u6bb5\u5f0f\u56de\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1252","title":"\u7834\u574f\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1253","title":"\u5c06\u77e9\u9635\u6309\u5bf9\u89d2\u7ebf\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1254","title":"\u5c42\u6570\u6700\u6df1\u53f6\u5b50\u8282\u70b9\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1255","title":"\u7ffb\u8f6c\u5b50\u6570\u7ec4\u5f97\u5230\u6700\u5927\u7684\u6570\u7ec4\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1256","title":"\u6570\u7ec4\u5e8f\u53f7\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1257","title":"\u77e9\u9635\u8f6c\u6362\u540e\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1258","title":"\u6587\u7ae0\u6d4f\u89c8 I","__typename":"AppliedTranslationNode"},{"questionId":"1259","title":"\u6587\u7ae0\u6d4f\u89c8 II","__typename":"AppliedTranslationNode"},{"questionId":"1260","title":"\u4e00\u5e74\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1261","title":"\u5355\u5b57\u7b26\u91cd\u590d\u5b50\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1262","title":"\u5b50\u6570\u7ec4\u4e2d\u5360\u7edd\u5927\u591a\u6570\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1263","title":"\u63b7\u9ab0\u5b50\u7684N\u79cd\u65b9\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1267","title":"\u4ece\u94fe\u8868\u4e2d\u5220\u53bb\u603b\u548c\u503c\u4e3a\u96f6\u7684\u8fde\u7eed\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1268","title":"\u5e02\u573a\u5206\u6790 I","__typename":"AppliedTranslationNode"},{"questionId":"1269","title":"\u5e02\u573a\u5206\u6790 II","__typename":"AppliedTranslationNode"},{"questionId":"1270","title":"\u9910\u76d8\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1271","title":"\u7f51\u7edc\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1272","title":"\u67e5\u8be2\u65e0\u6548\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1273","title":"\u6bd4\u8f83\u5b57\u7b26\u4e32\u6700\u5c0f\u5b57\u6bcd\u51fa\u73b0\u9891\u6b21","__typename":"AppliedTranslationNode"},{"questionId":"1274","title":"\u65e5\u671f\u4e4b\u95f4\u9694\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1275","title":"\u9a8c\u8bc1\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1276","title":"\u6700\u63a5\u8fd1\u7684\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1277","title":"\u5f62\u6210\u4e09\u7684\u6700\u5927\u500d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1278","title":"\u6307\u5b9a\u65e5\u671f\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1279","title":"\u8d28\u6570\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1280","title":"\u5065\u8eab\u8ba1\u5212\u8bc4\u4f30","__typename":"AppliedTranslationNode"},{"questionId":"1281","title":"\u6784\u5efa\u56de\u6587\u4e32\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"1282","title":"\u731c\u5b57\u8c1c","__typename":"AppliedTranslationNode"},{"questionId":"1283","title":"\u8f6c\u53d8\u65e5\u671f\u683c\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1284","title":"\u56db\u56e0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1285","title":"\u5c06\u4e8c\u53c9\u641c\u7d22\u6811\u53d8\u5e73\u8861","__typename":"AppliedTranslationNode"},{"questionId":"1286","title":"\u5e26\u9650\u5236\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1287","title":"\u516c\u4ea4\u7ad9\u95f4\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1288","title":"\u5220\u9664\u4e00\u6b21\u5f97\u5230\u5b50\u6570\u7ec4\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1289","title":"\u4e00\u5468\u4e2d\u7684\u7b2c\u51e0\u5929","__typename":"AppliedTranslationNode"},{"questionId":"1290","title":"\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1291","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 I","__typename":"AppliedTranslationNode"},{"questionId":"1292","title":"\u5373\u65f6\u98df\u7269\u914d\u9001 II","__typename":"AppliedTranslationNode"},{"questionId":"1293","title":"\u5b58\u5728\u8fde\u7eed\u4e09\u4e2a\u5947\u6570\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1296","title":"\u6811\u8282\u70b9\u7684\u7b2c K \u4e2a\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1297","title":"\u201c\u6c14\u7403\u201d \u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1298","title":"\u53cd\u8f6c\u6bcf\u5bf9\u62ec\u53f7\u95f4\u7684\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1299","title":"K \u6b21\u4e32\u8054\u540e\u6700\u5927\u5b50\u6570\u7ec4\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1300","title":"\u67e5\u627e\u96c6\u7fa4\u5185\u7684\u300c\u5173\u952e\u8fde\u63a5\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1301","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u90e8\u95e8\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1304","title":"\u6700\u957f\u5feb\u4e50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1306","title":"\u6700\u5c0f\u7edd\u5bf9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1307","title":"\u4e11\u6570 III","__typename":"AppliedTranslationNode"},{"questionId":"1308","title":"\u4ea4\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1309","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1311","title":"\u6700\u5927\u7684\u5e7b\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"1313","title":"\u7edf\u8ba1\u4e3a\u8681\u7fa4\u6784\u7b51\u623f\u95f4\u7684\u4e0d\u540c\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1316","title":"\u4ea4\u66ff\u6253\u5370\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1317","title":"\u6bcf\u6708\u4ea4\u6613 I","__typename":"AppliedTranslationNode"},{"questionId":"1318","title":"\u9526\u6807\u8d5b\u4f18\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1319","title":"\u72ec\u4e00\u65e0\u4e8c\u7684\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1320","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u76f8\u90bb\u91cd\u590d\u9879 II","__typename":"AppliedTranslationNode"},{"questionId":"1321","title":"\u5c3d\u53ef\u80fd\u4f7f\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1322","title":"\u7a7f\u8fc7\u8ff7\u5bab\u7684\u6700\u5c11\u79fb\u52a8\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1324","title":"\u7403\u4f1a\u843d\u4f55\u5904","__typename":"AppliedTranslationNode"},{"questionId":"1325","title":"\u6982\u7387\u6700\u5927\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1326","title":"\u5411\u4e0b\u53d6\u6574\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1327","title":"\u6700\u540e\u4e00\u4e2a\u80fd\u8fdb\u5165\u7535\u68af\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1328","title":"\u6bcf\u6708\u4ea4\u6613II","__typename":"AppliedTranslationNode"},{"questionId":"1329","title":"\u73a9\u7b79\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1330","title":"\u6700\u957f\u5b9a\u5dee\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1331","title":"\u9ec4\u91d1\u77ff\u5de5","__typename":"AppliedTranslationNode"},{"questionId":"1332","title":"\u7edf\u8ba1\u5143\u97f3\u5b57\u6bcd\u5e8f\u5217\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1337","title":"\u8bbe\u8ba1\u8df3\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1338","title":"\u67e5\u8be2\u7ed3\u679c\u7684\u8d28\u91cf\u548c\u5360\u6bd4","__typename":"AppliedTranslationNode"},{"questionId":"1339","title":"\u67e5\u8be2\u7403\u961f\u79ef\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1340","title":"\u54f2\u5b66\u5bb6\u8fdb\u9910","__typename":"AppliedTranslationNode"},{"questionId":"1341","title":"\u5206\u5272\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1342","title":"\u53ef\u4ee5\u653b\u51fb\u56fd\u738b\u7684\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"1343","title":"\u63b7\u9ab0\u5b50\u6a21\u62df","__typename":"AppliedTranslationNode"},{"questionId":"1344","title":"\u6700\u5927\u76f8\u7b49\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1345","title":"\u5b57\u7b26\u4e32\u7684\u5de6\u53f3\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1349","title":"\u7f00\u70b9\u6210\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1350","title":"\u5220\u9664\u5b50\u6587\u4ef6\u5939","__typename":"AppliedTranslationNode"},{"questionId":"1351","title":"\u66ff\u6362\u5b50\u4e32\u5f97\u5230\u5e73\u8861\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1352","title":"\u89c4\u5212\u517c\u804c\u5de5\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1357","title":"\u62a5\u544a\u7cfb\u7edf\u72b6\u6001\u7684\u8fde\u7eed\u65e5\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1358","title":"\u627e\u51fa\u7ed9\u5b9a\u65b9\u7a0b\u7684\u6b63\u6574\u6570\u89e3","__typename":"AppliedTranslationNode"},{"questionId":"1359","title":"\u5faa\u73af\u7801\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1360","title":"\u4e32\u8054\u5b57\u7b26\u4e32\u7684\u6700\u5927\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1361","title":"\u94fa\u74f7\u7816","__typename":"AppliedTranslationNode"},{"questionId":"1362","title":"\u98de\u673a\u5ea7\u4f4d\u5206\u914d\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1364","title":"\u540c\u79ef\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1366","title":"\u7b2c\u4e00\u4e2a\u552f\u4e00\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1367","title":"\u5806\u53e0\u957f\u65b9\u4f53\u7684\u6700\u5927\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1368","title":"\u591a\u7ebf\u7a0b\u7f51\u9875\u722c\u866b","__typename":"AppliedTranslationNode"},{"questionId":"1369","title":"\u4ea4\u6362\u5b57\u7b26\u4f7f\u5f97\u5b57\u7b26\u4e32\u76f8\u540c","__typename":"AppliedTranslationNode"},{"questionId":"1370","title":"\u7edf\u8ba1\u300c\u4f18\u7f8e\u5b50\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1371","title":"\u79fb\u9664\u65e0\u6548\u7684\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1372","title":"\u68c0\u67e5\u300c\u597d\u6570\u7ec4\u300d","__typename":"AppliedTranslationNode"},{"questionId":"1374","title":"\u81f3\u5c11\u6709\u4e00\u4e2a 1 \u7684\u6700\u5de6\u7aef\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1377","title":"\u6bcf\u4e2a\u5e16\u5b50\u7684\u8bc4\u8bba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1378","title":"\u5947\u6570\u503c\u5355\u5143\u683c\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1379","title":"\u91cd\u6784 2 \u884c\u4e8c\u8fdb\u5236\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1380","title":"\u7edf\u8ba1\u5c01\u95ed\u5c9b\u5c7f\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1381","title":"\u5f97\u5206\u6700\u9ad8\u7684\u5355\u8bcd\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1384","title":"\u627e\u51fa\u9002\u5e94\u5c4f\u5e55\u7684\u6700\u5927\u5b57\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1386","title":"\u4e8c\u7ef4\u7f51\u683c\u8fc1\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1387","title":"\u5728\u53d7\u6c61\u67d3\u7684\u4e8c\u53c9\u6811\u4e2d\u67e5\u627e\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1388","title":"\u53ef\u88ab\u4e09\u6574\u9664\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1389","title":"\u63a8\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1390","title":"\u5e73\u5747\u552e\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1391","title":"\u6570\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1395","title":"\u8bbf\u95ee\u6240\u6709\u70b9\u7684\u6700\u5c0f\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1396","title":"\u7edf\u8ba1\u53c2\u4e0e\u901a\u4fe1\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1397","title":"\u641c\u7d22\u63a8\u8350\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1398","title":"\u505c\u5728\u539f\u5730\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1399","title":"\u9875\u9762\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1400","title":"\u627e\u51fa\u4e95\u5b57\u68cb\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1401","title":"\u4e0d\u6d6a\u8d39\u539f\u6599\u7684\u6c49\u5821\u5236\u4f5c\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1402","title":"\u7edf\u8ba1\u5168\u4e3a 1 \u7684\u6b63\u65b9\u5f62\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1403","title":"\u5206\u5272\u56de\u6587\u4e32 III","__typename":"AppliedTranslationNode"},{"questionId":"1404","title":"\u9006\u5e8f\u6253\u5370\u4e0d\u53ef\u53d8\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1405","title":"\u5411\u516c\u53f8CEO\u6c47\u62a5\u5de5\u4f5c\u7684\u6240\u6709\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1406","title":"\u6574\u6570\u7684\u5404\u4f4d\u79ef\u548c\u4e4b\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1407","title":"\u7528\u6237\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1408","title":"\u4f7f\u7ed3\u679c\u4e0d\u8d85\u8fc7\u9608\u503c\u7684\u6700\u5c0f\u9664\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1409","title":"\u8f6c\u5316\u4e3a\u5168\u96f6\u77e9\u9635\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1410","title":"\u7ea2\u7eff\u706f\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1411","title":"\u4e8c\u8fdb\u5236\u94fe\u8868\u8f6c\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1413","title":"\u5143\u7d20\u548c\u5c0f\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u6b63\u65b9\u5f62\u7684\u6700\u5927\u8fb9\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1414","title":"\u7f51\u683c\u4e2d\u7684\u6700\u77ed\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1415","title":"\u5b66\u751f\u4eec\u53c2\u52a0\u5404\u79d1\u6d4b\u8bd5\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1420","title":"\u627e\u5230\u8fde\u7eed\u533a\u95f4\u7684\u5f00\u59cb\u548c\u7ed3\u675f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1421","title":"\u7edf\u8ba1\u4f4d\u6570\u4e3a\u5076\u6570\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1422","title":"\u5212\u5206\u6570\u7ec4\u4e3a\u8fde\u7eed\u6570\u5b57\u7684\u96c6\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1423","title":"\u5b50\u4e32\u7684\u6700\u5927\u51fa\u73b0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1424","title":"\u4f60\u80fd\u4ece\u76d2\u5b50\u91cc\u83b7\u5f97\u7684\u6700\u5927\u7cd6\u679c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1425","title":"\u4e0d\u540c\u56fd\u5bb6\u7684\u5929\u6c14\u7c7b\u578b","__typename":"AppliedTranslationNode"},{"questionId":"1426","title":"\u548c\u4e3a\u96f6\u7684N\u4e2a\u552f\u4e00\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1427","title":"\u4e24\u68f5\u4e8c\u53c9\u641c\u7d22\u6811\u4e2d\u7684\u6240\u6709\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1428","title":"\u8df3\u8dc3\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1429","title":"\u53e3\u7b97\u96be\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1432","title":"\u5224\u65ad\u7ed9\u5b9a\u7684\u5e8f\u5217\u662f\u5426\u662f\u4e8c\u53c9\u6811\u4ece\u6839\u5230\u53f6\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1434","title":"\u89e3\u7801\u5b57\u6bcd\u5230\u6574\u6570\u6620\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1435","title":"\u5b50\u6570\u7ec4\u5f02\u6216\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1436","title":"\u83b7\u53d6\u4f60\u597d\u53cb\u5df2\u89c2\u770b\u7684\u89c6\u9891","__typename":"AppliedTranslationNode"},{"questionId":"1437","title":"\u8ba9\u5b57\u7b26\u4e32\u6210\u4e3a\u56de\u6587\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1438","title":"\u6c42\u56e2\u961f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1439","title":"\u4e0d\u540c\u6027\u522b\u6bcf\u65e5\u5206\u6570\u603b\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1440","title":"\u5c06\u6574\u6570\u8f6c\u6362\u4e3a\u4e24\u4e2a\u65e0\u96f6\u6574\u6570\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1441","title":"\u6216\u8fd0\u7b97\u7684\u6700\u5c0f\u7ffb\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1442","title":"\u8fde\u901a\u7f51\u7edc\u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1443","title":"\u4e8c\u6307\u8f93\u5165\u7684\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1444","title":"\u5c06\u6570\u5b57\u53d8\u6210 0 \u7684\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1445","title":"\u5927\u5c0f\u4e3a K \u4e14\u5e73\u5747\u503c\u5927\u4e8e\u7b49\u4e8e\u9608\u503c\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1446","title":"\u65f6\u949f\u6307\u9488\u7684\u5939\u89d2","__typename":"AppliedTranslationNode"},{"questionId":"1447","title":"\u8df3\u8dc3\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1448","title":"6 \u548c 9 \u7ec4\u6210\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1449","title":"\u7ad6\u76f4\u6253\u5370\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1450","title":"\u5220\u9664\u7ed9\u5b9a\u503c\u7684\u53f6\u5b50\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1451","title":"\u704c\u6e89\u82b1\u56ed\u7684\u6700\u5c11\u6c34\u9f99\u5934\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1452","title":"\u9910\u9986\u8425\u4e1a\u989d\u53d8\u5316\u589e\u957f","__typename":"AppliedTranslationNode"},{"questionId":"1453","title":"\u5e7f\u544a\u6548\u679c","__typename":"AppliedTranslationNode"},{"questionId":"1454","title":"\u5220\u9664\u56de\u6587\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1455","title":"\u9910\u5385\u8fc7\u6ee4\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1456","title":"\u9608\u503c\u8ddd\u79bb\u5185\u90bb\u5c45\u6700\u5c11\u7684\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1457","title":"\u5de5\u4f5c\u8ba1\u5212\u7684\u6700\u4f4e\u96be\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1458","title":"\u6839\u636e\u6570\u5b57\u4e8c\u8fdb\u5236\u4e0b 1 \u7684\u6570\u76ee\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1459","title":"\u6bcf\u9694 n \u4e2a\u987e\u5ba2\u6253\u6298","__typename":"AppliedTranslationNode"},{"questionId":"1460","title":"\u5305\u542b\u6240\u6709\u4e09\u79cd\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1461","title":"\u6709\u6548\u7684\u5feb\u9012\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1462","title":"\u5217\u51fa\u6307\u5b9a\u65f6\u95f4\u6bb5\u5185\u6240\u6709\u7684\u4e0b\u5355\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1463","title":"\u77e9\u9635\u4e2d\u6218\u6597\u529b\u6700\u5f31\u7684 K \u884c","__typename":"AppliedTranslationNode"},{"questionId":"1464","title":"\u6570\u7ec4\u5927\u5c0f\u51cf\u534a","__typename":"AppliedTranslationNode"},{"questionId":"1465","title":"\u5206\u88c2\u4e8c\u53c9\u6811\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1466","title":"\u8df3\u8dc3\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1467","title":"\u6bcf\u6b21\u8bbf\u95ee\u7684\u4ea4\u6613\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1468","title":"\u68c0\u67e5\u6574\u6570\u53ca\u5176\u4e24\u500d\u6570\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1469","title":"\u5236\u9020\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u7684\u6700\u5c0f\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1470","title":"\u63a8\u6587\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1471","title":"\u53c2\u52a0\u8003\u8bd5\u7684\u6700\u5927\u5b66\u751f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1472","title":"\u4e0a\u5347\u4e0b\u964d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1473","title":"\u6bcf\u4e2a\u5143\u97f3\u5305\u542b\u5076\u6570\u6b21\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1474","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u6700\u957f\u4ea4\u9519\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1475","title":"\u4e8c\u53c9\u641c\u7d22\u5b50\u6811\u7684\u6700\u5927\u952e\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1476","title":"\u7edf\u8ba1\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u8d1f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1477","title":"\u6700\u540e K \u4e2a\u6570\u7684\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1478","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1479","title":"\u591a\u6b21\u6c42\u548c\u6784\u9020\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1480","title":"\u7535\u5f71\u8bc4\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1481","title":"\u9662\u7cfb\u65e0\u6548\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1482","title":"\u6709\u591a\u5c11\u5c0f\u4e8e\u5f53\u524d\u6570\u5b57\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1483","title":"\u901a\u8fc7\u6295\u7968\u5bf9\u56e2\u961f\u6392\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1484","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u5217\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1485","title":"\u4f7f\u7f51\u683c\u56fe\u81f3\u5c11\u6709\u4e00\u6761\u6709\u6548\u8def\u5f84\u7684\u6700\u5c0f\u4ee3\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1486","title":"\u4e24\u4e2a\u6570\u7ec4\u95f4\u7684\u8ddd\u79bb\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1487","title":"\u5b89\u6392\u7535\u5f71\u9662\u5ea7\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1488","title":"\u5c06\u6574\u6570\u6309\u6743\u91cd\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1489","title":"3n \u5757\u62ab\u8428","__typename":"AppliedTranslationNode"},{"questionId":"1490","title":"\u751f\u6210\u6bcf\u79cd\u5b57\u7b26\u90fd\u662f\u5947\u6570\u4e2a\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1491","title":"\u706f\u6ce1\u5f00\u5173 III","__typename":"AppliedTranslationNode"},{"questionId":"1492","title":"\u901a\u77e5\u6240\u6709\u5458\u5de5\u6240\u9700\u7684\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1493","title":"T \u79d2\u540e\u9752\u86d9\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1494","title":"\u6d3b\u52a8\u53c2\u4e0e\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1495","title":"\u987e\u5ba2\u7684\u53ef\u4fe1\u8054\u7cfb\u4eba\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1496","title":"\u77e9\u9635\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1497","title":"\u8bbe\u8ba1\u4e00\u4e2a\u652f\u6301\u589e\u91cf\u64cd\u4f5c\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1498","title":"\u627e\u51fa\u514b\u9686\u4e8c\u53c9\u6811\u4e2d\u7684\u76f8\u540c\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1499","title":"\u6700\u5927\u7684\u56e2\u961f\u8868\u73b0\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1500","title":"\u7edf\u8ba1\u6700\u5927\u7ec4\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1501","title":"\u5706\u548c\u77e9\u5f62\u662f\u5426\u6709\u91cd\u53e0","__typename":"AppliedTranslationNode"},{"questionId":"1502","title":"\u6784\u9020 K \u4e2a\u56de\u6587\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1503","title":"\u505a\u83dc\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1504","title":"\u83b7\u53d6\u6700\u8fd1\u7b2c\u4e8c\u6b21\u7684\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1505","title":"\u6309\u65e2\u5b9a\u987a\u5e8f\u521b\u5efa\u76ee\u6807\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1507","title":"\u68c0\u67e5\u7f51\u683c\u4e2d\u662f\u5426\u5b58\u5728\u6709\u6548\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1508","title":"\u6700\u957f\u5feb\u4e50\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1509","title":"\u4f7f\u7528\u552f\u4e00\u6807\u8bc6\u7801\u66ff\u6362\u5458\u5de5ID","__typename":"AppliedTranslationNode"},{"questionId":"1510","title":"\u627e\u51fa\u6570\u7ec4\u4e2d\u7684\u5e78\u8fd0\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1511","title":"\u7edf\u8ba1\u4f5c\u6218\u5355\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1512","title":"\u8bbe\u8ba1\u5730\u94c1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1513","title":"\u627e\u5230\u6240\u6709\u597d\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1514","title":"\u9010\u6b65\u6c42\u548c\u5f97\u5230\u6b63\u6570\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1515","title":"\u548c\u4e3a K \u7684\u6700\u5c11\u6590\u6ce2\u90a3\u5951\u6570\u5b57\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1516","title":"\u957f\u5ea6\u4e3a n \u7684\u5f00\u5fc3\u5b57\u7b26\u4e32\u4e2d\u5b57\u5178\u5e8f\u7b2c k \u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1517","title":"\u6062\u590d\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1518","title":"\u6309\u5e74\u5ea6\u5217\u51fa\u9500\u552e\u603b\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1519","title":"\u975e\u9012\u589e\u987a\u5e8f\u7684\u6700\u5c0f\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1520","title":"\u5c06\u4e8c\u8fdb\u5236\u8868\u793a\u51cf\u5230 1 \u7684\u6b65\u9aa4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1522","title":"\u77f3\u5b50\u6e38\u620f III","__typename":"AppliedTranslationNode"},{"questionId":"1523","title":"\u80a1\u7968\u7684\u8d44\u672c\u635f\u76ca","__typename":"AppliedTranslationNode"},{"questionId":"1524","title":"\u6570\u7ec4\u4e2d\u7684\u5b57\u7b26\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1525","title":"\u67e5\u8be2\u5e26\u952e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1526","title":"HTML \u5b9e\u4f53\u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1527","title":"\u7ed9 N x 3 \u7f51\u683c\u56fe\u6d82\u8272\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1528","title":"\u62e5\u6709\u6700\u591a\u7cd6\u679c\u7684\u5b69\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1529","title":"\u6539\u53d8\u4e00\u4e2a\u6574\u6570\u80fd\u5f97\u5230\u7684\u6700\u5927\u5dee\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1530","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u6253\u7834\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1531","title":"\u6bcf\u4e2a\u4eba\u6234\u4e0d\u540c\u5e3d\u5b50\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1532","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1533","title":"\u70b9\u83dc\u5c55\u793a\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1534","title":"\u6570\u9752\u86d9","__typename":"AppliedTranslationNode"},{"questionId":"1535","title":"\u751f\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1536","title":"\u8d2d\u4e70\u4e86\u4ea7\u54c1 A \u548c\u4ea7\u54c1 B \u5374\u6ca1\u6709\u8d2d\u4e70\u4ea7\u54c1 C \u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1537","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1538","title":"\u53ef\u83b7\u5f97\u7684\u6700\u5927\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1539","title":"\u5bf9\u89d2\u7ebf\u904d\u5386 II","__typename":"AppliedTranslationNode"},{"questionId":"1541","title":"\u6392\u540d\u9760\u524d\u7684\u65c5\u884c\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1542","title":"\u8fde\u7eed\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"1543","title":"\u6700\u7b80\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1544","title":"\u7edf\u8ba1\u4e8c\u53c9\u6811\u4e2d\u597d\u8282\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1545","title":"\u6570\u4f4d\u6210\u672c\u548c\u4e3a\u76ee\u6807\u503c\u7684\u6700\u5927\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1546","title":"\u67e5\u627e\u6210\u7ee9\u5904\u4e8e\u4e2d\u6e38\u7684\u5b66\u751f","__typename":"AppliedTranslationNode"},{"questionId":"1547","title":"\u65c5\u884c\u7ec8\u70b9\u7ad9","__typename":"AppliedTranslationNode"},{"questionId":"1548","title":"\u662f\u5426\u6240\u6709 1 \u90fd\u81f3\u5c11\u76f8\u9694 k \u4e2a\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1549","title":"\u7edd\u5bf9\u5dee\u4e0d\u8d85\u8fc7\u9650\u5236\u7684\u6700\u957f\u8fde\u7eed\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1550","title":"\u6709\u5e8f\u77e9\u9635\u4e2d\u7684\u7b2c k \u4e2a\u6700\u5c0f\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1551","title":"\u51c0\u73b0\u503c\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1552","title":"\u7528\u6808\u64cd\u4f5c\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1553","title":"\u5f62\u6210\u4e24\u4e2a\u5f02\u6216\u76f8\u7b49\u6570\u7ec4\u7684\u4e09\u5143\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1554","title":"\u6536\u96c6\u6811\u4e0a\u6240\u6709\u82f9\u679c\u7684\u6700\u5c11\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1555","title":"\u5207\u62ab\u8428\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1556","title":"\u901a\u8fc7\u7ffb\u8f6c\u5b50\u6570\u7ec4\u4f7f\u4e24\u4e2a\u6570\u7ec4\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1557","title":"\u68c0\u67e5\u4e00\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u5305\u542b\u6240\u6709\u957f\u5ea6\u4e3a K \u7684\u4e8c\u8fdb\u5236\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1558","title":"\u8bfe\u7a0b\u8868 IV","__typename":"AppliedTranslationNode"},{"questionId":"1559","title":"\u6458\u6a31\u6843 II","__typename":"AppliedTranslationNode"},{"questionId":"1560","title":"\u5728\u65e2\u5b9a\u65f6\u95f4\u505a\u4f5c\u4e1a\u7684\u5b66\u751f\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1561","title":"\u91cd\u65b0\u6392\u5217\u53e5\u5b50\u4e2d\u7684\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1562","title":"\u6536\u85cf\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1563","title":"\u5706\u5f62\u9776\u5185\u7684\u6700\u5927\u98de\u9556\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1564","title":"\u5236\u4f5c\u4f1a\u8bdd\u67f1\u72b6\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1565","title":"\u8ba1\u7b97\u5e03\u5c14\u8868\u8fbe\u5f0f\u7684\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1566","title":"\u68c0\u67e5\u5355\u8bcd\u662f\u5426\u4e3a\u53e5\u4e2d\u5176\u4ed6\u5355\u8bcd\u7684\u524d\u7f00","__typename":"AppliedTranslationNode"},{"questionId":"1567","title":"\u5b9a\u957f\u5b50\u4e32\u4e2d\u5143\u97f3\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1568","title":"\u4e8c\u53c9\u6811\u4e2d\u7684\u4f2a\u56de\u6587\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1569","title":"\u4e24\u4e2a\u5b50\u5e8f\u5217\u7684\u6700\u5927\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1570","title":"\u5546\u54c1\u6298\u6263\u540e\u7684\u6700\u7ec8\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1571","title":"\u5b89\u6392\u90ae\u7b52","__typename":"AppliedTranslationNode"},{"questionId":"1572","title":"\u5b50\u77e9\u5f62\u67e5\u8be2","__typename":"AppliedTranslationNode"},{"questionId":"1573","title":"\u627e\u4e24\u4e2a\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1574","title":"\u6570\u7ec4\u4e2d\u4e24\u5143\u7d20\u7684\u6700\u5927\u4e58\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1575","title":"\u5207\u5272\u540e\u9762\u79ef\u6700\u5927\u7684\u86cb\u7cd5","__typename":"AppliedTranslationNode"},{"questionId":"1576","title":"\u91cd\u65b0\u89c4\u5212\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1577","title":"\u4e24\u4e2a\u76d2\u5b50\u4e2d\u7403\u7684\u989c\u8272\u6570\u76f8\u540c\u7684\u6982\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1578","title":"\u82f9\u679c\u548c\u6854\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1579","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1580","title":"\u91cd\u65b0\u6392\u5217\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1581","title":"\u6570\u7ec4\u4e2d\u7684 k \u4e2a\u6700\u5f3a\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1582","title":"\u8bbe\u8ba1\u6d4f\u89c8\u5668\u5386\u53f2\u8bb0\u5f55","__typename":"AppliedTranslationNode"},{"questionId":"1583","title":"\u7c89\u5237\u623f\u5b50 III","__typename":"AppliedTranslationNode"},{"questionId":"1584","title":"\u53bb\u6389\u6700\u4f4e\u5de5\u8d44\u548c\u6700\u9ad8\u5de5\u8d44\u540e\u7684\u5de5\u8d44\u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1585","title":"n \u7684\u7b2c k \u4e2a\u56e0\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1586","title":"\u5220\u6389\u4e00\u4e2a\u5143\u7d20\u4ee5\u540e\u5168\u4e3a 1 \u7684\u6700\u957f\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1587","title":"\u5e76\u884c\u8bfe\u7a0b II","__typename":"AppliedTranslationNode"},{"questionId":"1603","title":"\u4e00\u7ef4\u6570\u7ec4\u7684\u52a8\u6001\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1604","title":"\u4e0d\u540c\u6574\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1605","title":"\u5236\u4f5c m \u675f\u82b1\u6240\u9700\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1607","title":"\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1608","title":"\u8ba1\u7b97\u7a0e\u540e\u5de5\u8d44","__typename":"AppliedTranslationNode"},{"questionId":"1609","title":"\u5bfb\u627e\u6240\u6709\u7684\u72ec\u751f\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1610","title":"\u6570\u7ec4\u5f02\u6216\u64cd\u4f5c","__typename":"AppliedTranslationNode"},{"questionId":"1611","title":"\u4fdd\u8bc1\u6587\u4ef6\u540d\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"1612","title":"\u907f\u514d\u6d2a\u6c34\u6cdb\u6ee5","__typename":"AppliedTranslationNode"},{"questionId":"1613","title":"\u627e\u5230\u6700\u5c0f\u751f\u6210\u6811\u91cc\u7684\u5173\u952e\u8fb9\u548c\u4f2a\u5173\u952e\u8fb9","__typename":"AppliedTranslationNode"},{"questionId":"1615","title":"\u5b50\u6570\u7ec4\u548c\u6392\u5e8f\u540e\u7684\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1616","title":"\u4e09\u6b21\u64cd\u4f5c\u540e\u6700\u5927\u503c\u4e0e\u6700\u5c0f\u503c\u7684\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1617","title":"\u77f3\u5b50\u6e38\u620f IV","__typename":"AppliedTranslationNode"},{"questionId":"1618","title":"\u5220\u9664\u94fe\u8868 M \u4e2a\u8282\u70b9\u4e4b\u540e\u7684 N \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1619","title":"\u5224\u65ad\u8def\u5f84\u662f\u5426\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1620","title":"\u68c0\u67e5\u6570\u7ec4\u5bf9\u662f\u5426\u53ef\u4ee5\u88ab k \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1621","title":"\u6ee1\u8db3\u6761\u4ef6\u7684\u5b50\u5e8f\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1622","title":"\u6ee1\u8db3\u4e0d\u7b49\u5f0f\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1623","title":"\u5468\u5185\u6bcf\u5929\u7684\u9500\u552e\u60c5\u51b5","__typename":"AppliedTranslationNode"},{"questionId":"1624","title":"\u514b\u9686\u542b\u968f\u673a\u6307\u9488\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1625","title":"\u6309\u65e5\u671f\u5206\u7ec4\u9500\u552e\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1626","title":"\u5224\u65ad\u80fd\u5426\u5f62\u6210\u7b49\u5dee\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1627","title":"\u6240\u6709\u8682\u8681\u6389\u4e0b\u6765\u524d\u7684\u6700\u540e\u4e00\u523b","__typename":"AppliedTranslationNode"},{"questionId":"1628","title":"\u7edf\u8ba1\u5168 1 \u5b50\u77e9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"1629","title":"\u6700\u591a K \u6b21\u4ea4\u6362\u76f8\u90bb\u6570\u4f4d\u540e\u5f97\u5230\u7684\u6700\u5c0f\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1630","title":"\u5728\u533a\u95f4\u8303\u56f4\u5185\u7edf\u8ba1\u5947\u6570\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1631","title":"\u548c\u4e3a\u5947\u6570\u7684\u5b50\u6570\u7ec4\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1632","title":"\u5b57\u7b26\u4e32\u7684\u597d\u5206\u5272\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1633","title":"\u5f62\u6210\u76ee\u6807\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u6700\u5c11\u589e\u52a0\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1634","title":"\u514b\u9686 N \u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1635","title":"\u597d\u6570\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1636","title":"\u4ec5\u542b 1 \u7684\u5b50\u4e32\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1637","title":"\u538b\u7f29\u5b57\u7b26\u4e32 II","__typename":"AppliedTranslationNode"},{"questionId":"1638","title":"\u670d\u52a1\u4e2d\u5fc3\u7684\u6700\u4f73\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1639","title":"\u4e0a\u6708\u64ad\u653e\u7684\u513f\u7ae5\u9002\u5b9c\u7535\u5f71","__typename":"AppliedTranslationNode"},{"questionId":"1640","title":"\u8bbe\u8ba1\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1641","title":"\u53ef\u4ee5\u653e\u5fc3\u6295\u8d44\u7684\u56fd\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1642","title":"\u6362\u9152\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1643","title":"\u5b50\u6811\u4e2d\u6807\u7b7e\u76f8\u540c\u7684\u8282\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1644","title":"\u6700\u591a\u7684\u4e0d\u91cd\u53e0\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1645","title":"\u627e\u5230\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u51fd\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1646","title":"\u7b2c k \u4e2a\u7f3a\u5931\u7684\u6b63\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1647","title":"K \u6b21\u64cd\u4f5c\u8f6c\u53d8\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1648","title":"\u5e73\u8861\u62ec\u53f7\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u63d2\u5165\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1649","title":"\u548c\u4e3a\u76ee\u6807\u503c\u4e14\u4e0d\u91cd\u53e0\u7684\u975e\u7a7a\u5b50\u6570\u7ec4\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1650","title":"\u627e\u5230 N \u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1651","title":"\u91cd\u65b0\u6392\u5217\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1652","title":"\u706f\u6ce1\u5f00\u5173 IV","__typename":"AppliedTranslationNode"},{"questionId":"1653","title":"\u597d\u53f6\u5b50\u8282\u70b9\u5bf9\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1654","title":"\u6d88\u8d39\u8005\u4e0b\u5355\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1655","title":"\u79fb\u52a8 N \u53c9\u6811\u7684\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1656","title":"\u7edf\u8ba1\u597d\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1657","title":"\u627e\u51fa\u6570\u7ec4\u6e38\u620f\u7684\u8d62\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1658","title":"\u6392\u5e03\u4e8c\u8fdb\u5236\u7f51\u683c\u7684\u6700\u5c11\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1659","title":"\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1660","title":"\u5343\u4f4d\u5206\u9694\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1661","title":"\u53ef\u4ee5\u5230\u8fbe\u6240\u6709\u70b9\u7684\u6700\u5c11\u70b9\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1662","title":"\u5f97\u5230\u76ee\u6807\u6570\u7ec4\u7684\u6700\u5c11\u51fd\u6570\u8c03\u7528\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1663","title":"\u4e8c\u7ef4\u7f51\u683c\u56fe\u4e2d\u63a2\u6d4b\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1664","title":"\u67e5\u627e\u62e5\u6709\u6709\u6548\u90ae\u7bb1\u7684\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1665","title":"N \u53c9\u6811\u7684\u76f4\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1666","title":"\u6574\u7406\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1667","title":"\u627e\u51fa\u7b2c N \u4e2a\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u4e2d\u7684\u7b2c K \u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1668","title":"\u627e\u51fa\u6700\u957f\u7684\u8d85\u8d5e\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1669","title":"\u5207\u68cd\u5b50\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1670","title":"\u60a3\u67d0\u79cd\u75be\u75c5\u7684\u60a3\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1671","title":"\u6700\u8fd1\u7684\u4e09\u7b14\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1672","title":"\u627e\u5230\u6700\u5927\u6574\u6570\u7684\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"1674","title":"\u4f7f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u76f8\u7b49\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1675","title":"\u4e24\u7403\u4e4b\u95f4\u7684\u78c1\u529b","__typename":"AppliedTranslationNode"},{"questionId":"1676","title":"\u5403\u6389 N \u4e2a\u6a58\u5b50\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1677","title":"\u77e9\u9635\u5bf9\u89d2\u7ebf\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1678","title":"\u5206\u5272\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1679","title":"\u5220\u9664\u6700\u77ed\u7684\u5b50\u6570\u7ec4\u4f7f\u5269\u4f59\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1680","title":"\u7edf\u8ba1\u6240\u6709\u53ef\u884c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1681","title":"\u627e\u51fa\u9690\u85cf\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u6700\u591a\u7684\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1682","title":"\u5706\u5f62\u8d5b\u9053\u4e0a\u7ecf\u8fc7\u6b21\u6570\u6700\u591a\u7684\u6247\u533a","__typename":"AppliedTranslationNode"},{"questionId":"1683","title":"\u4f60\u53ef\u4ee5\u83b7\u5f97\u7684\u6700\u5927\u786c\u5e01\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1684","title":"\u67e5\u627e\u5927\u5c0f\u4e3a M \u7684\u6700\u65b0\u5206\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1685","title":"\u77f3\u5b50\u6e38\u620f V","__typename":"AppliedTranslationNode"},{"questionId":"1686","title":"\u4ea7\u54c1\u540d\u79f0\u683c\u5f0f\u4fee\u590d","__typename":"AppliedTranslationNode"},{"questionId":"1687","title":"\u56fe\u4e2d\u6700\u76f8\u4f3c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1688","title":"\u6bcf\u4ef6\u5546\u54c1\u7684\u6700\u65b0\u8ba2\u5355","__typename":"AppliedTranslationNode"},{"questionId":"1689","title":"\u91cd\u590d\u81f3\u5c11 K \u6b21\u4e14\u957f\u5ea6\u4e3a M \u7684\u6a21\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1690","title":"\u4e58\u79ef\u4e3a\u6b63\u6570\u7684\u6700\u957f\u5b50\u6570\u7ec4\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1691","title":"\u4f7f\u9646\u5730\u5206\u79bb\u7684\u6700\u5c11\u5929\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1692","title":"\u5c06\u5b50\u6570\u7ec4\u91cd\u65b0\u6392\u5e8f\u5f97\u5230\u540c\u4e00\u4e2a\u4e8c\u53c9\u67e5\u627e\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1693","title":"\u6240\u6709\u5947\u6570\u957f\u5ea6\u5b50\u6570\u7ec4\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1694","title":"\u4f7f\u6570\u7ec4\u548c\u80fd\u88ab P \u6574\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1695","title":"\u6240\u6709\u6392\u5217\u4e2d\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1696","title":"\u5947\u602a\u7684\u6253\u5370\u673a II","__typename":"AppliedTranslationNode"},{"questionId":"1697","title":"\u53ea\u6709\u4e00\u4e2a\u4e0d\u540c\u5b57\u7b26\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1698","title":"\u66ff\u6362\u6240\u6709\u7684\u95ee\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1699","title":"\u6570\u7684\u5e73\u65b9\u7b49\u4e8e\u4e24\u6570\u4e58\u79ef\u7684\u65b9\u6cd5\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1700","title":"\u907f\u514d\u91cd\u590d\u5b57\u6bcd\u7684\u6700\u5c0f\u5220\u9664\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1701","title":"\u4fdd\u8bc1\u56fe\u53ef\u5b8c\u5168\u904d\u5386","__typename":"AppliedTranslationNode"},{"questionId":"1702","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981","__typename":"AppliedTranslationNode"},{"questionId":"1703","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc I","__typename":"AppliedTranslationNode"},{"questionId":"1704","title":"\u4e8c\u8fdb\u5236\u77e9\u9635\u4e2d\u7684\u7279\u6b8a\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1705","title":"\u7edf\u8ba1\u4e0d\u5f00\u5fc3\u7684\u670b\u53cb","__typename":"AppliedTranslationNode"},{"questionId":"1706","title":"\u8fde\u63a5\u6240\u6709\u70b9\u7684\u6700\u5c0f\u8d39\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1707","title":"\u68c0\u67e5\u5b57\u7b26\u4e32\u662f\u5426\u53ef\u4ee5\u901a\u8fc7\u6392\u5e8f\u5b50\u5b57\u7b26\u4e32\u5f97\u5230\u53e6\u4e00\u4e2a\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1708","title":"\u8bbe\u8ba1\u505c\u8f66\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1709","title":"\u8b66\u544a\u4e00\u5c0f\u65f6\u5185\u4f7f\u7528\u76f8\u540c\u5458\u5de5\u5361\u5927\u4e8e\u7b49\u4e8e\u4e09\u6b21\u7684\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1710","title":"\u627e\u5230\u5904\u7406\u6700\u591a\u8bf7\u6c42\u7684\u670d\u52a1\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1711","title":"\u7ed9\u5b9a\u884c\u548c\u5217\u7684\u548c\u6c42\u53ef\u884c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1712","title":"\u6309\u6708\u7edf\u8ba1\u8ba2\u5355\u6570\u4e0e\u987e\u5ba2\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1713","title":"\u4e24\u4e2a\u7a00\u758f\u5411\u91cf\u7684\u70b9\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1714","title":"\u91cd\u65b0\u6392\u5217\u5355\u8bcd\u95f4\u7684\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1715","title":"\u62c6\u5206\u5b57\u7b26\u4e32\u4f7f\u552f\u4e00\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee\u6700\u5927","__typename":"AppliedTranslationNode"},{"questionId":"1716","title":"\u77e9\u9635\u7684\u6700\u5927\u975e\u8d1f\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1717","title":"\u8fde\u901a\u4e24\u7ec4\u70b9\u7684\u6700\u5c0f\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1718","title":"\u4ed3\u5e93\u7ecf\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1719","title":"\u628a\u7bb1\u5b50\u653e\u8fdb\u4ed3\u5e93\u91cc II","__typename":"AppliedTranslationNode"},{"questionId":"1720","title":"\u6587\u4ef6\u5939\u64cd\u4f5c\u65e5\u5fd7\u641c\u96c6\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1721","title":"\u7ecf\u8425\u6469\u5929\u8f6e\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"1722","title":"\u7687\u4f4d\u7ee7\u627f\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1723","title":"\u6700\u591a\u53ef\u8fbe\u6210\u7684\u6362\u697c\u8bf7\u6c42\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1724","title":"\u8fdb\u5e97\u5374\u672a\u8fdb\u884c\u8fc7\u4ea4\u6613\u7684\u987e\u5ba2","__typename":"AppliedTranslationNode"},{"questionId":"1725","title":"\u5927\u5c0f\u4e3a K \u7684\u4e0d\u91cd\u53e0\u7ebf\u6bb5\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1726","title":"\u7f51\u7edc\u4fe1\u53f7\u6700\u597d\u7684\u5750\u6807","__typename":"AppliedTranslationNode"},{"questionId":"1727","title":"\u732b\u548c\u8001\u9f20 II","__typename":"AppliedTranslationNode"},{"questionId":"1728","title":"\u5947\u5999\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1729","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u8fed\u4ee3\u5668 II","__typename":"AppliedTranslationNode"},{"questionId":"1730","title":"\u7279\u6b8a\u6570\u7ec4\u7684\u7279\u5f81\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1731","title":"\u5947\u5076\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1732","title":"\u4f7f\u6574\u6570\u53d8\u4e3a 0 \u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1733","title":"\u53ef\u89c1\u70b9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1734","title":"\u94f6\u884c\u8d26\u6237\u6982\u8981 II","__typename":"AppliedTranslationNode"},{"questionId":"1735","title":"\u6bcf\u4f4d\u987e\u5ba2\u6700\u7ecf\u5e38\u8ba2\u8d2d\u7684\u5546\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1736","title":"\u6839\u636e\u4e2d\u7f00\u8868\u8fbe\u5f0f\u6784\u9020\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1737","title":"\u62ec\u53f7\u7684\u6700\u5927\u5d4c\u5957\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1738","title":"\u6700\u5927\u7f51\u7edc\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1739","title":"\u5206\u5272\u4e24\u4e2a\u5b57\u7b26\u4e32\u5f97\u5230\u56de\u6587\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1740","title":"\u7edf\u8ba1\u5b50\u6811\u4e2d\u57ce\u5e02\u4e4b\u95f4\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1741","title":"\u6309\u7167\u9891\u7387\u5c06\u6570\u7ec4\u5347\u5e8f\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1742","title":"\u4e24\u70b9\u4e4b\u95f4\u4e0d\u5305\u542b\u4efb\u4f55\u70b9\u7684\u6700\u5bbd\u5782\u76f4\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1743","title":"\u7edf\u8ba1\u53ea\u5dee\u4e00\u4e2a\u5b57\u7b26\u7684\u5b50\u4e32\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1744","title":"\u901a\u8fc7\u7ed9\u5b9a\u8bcd\u5178\u6784\u9020\u76ee\u6807\u5b57\u7b26\u4e32\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1745","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u6700\u8fd1\u7684\u53f3\u4fa7\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1746","title":"\u4e24\u4e2a\u76f8\u540c\u5b57\u7b26\u4e4b\u95f4\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1747","title":"\u6267\u884c\u64cd\u4f5c\u540e\u5b57\u5178\u5e8f\u6700\u5c0f\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1748","title":"\u65e0\u77db\u76fe\u7684\u6700\u4f73\u7403\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1749","title":"\u6ca1\u6709\u5356\u51fa\u7684\u5356\u5bb6","__typename":"AppliedTranslationNode"},{"questionId":"1750","title":"\u68c0\u67e5\u4e24\u68f5\u4e8c\u53c9\u8868\u8fbe\u5f0f\u6811\u662f\u5426\u7b49\u4ef7","__typename":"AppliedTranslationNode"},{"questionId":"1751","title":"\u6309\u952e\u6301\u7eed\u65f6\u95f4\u6700\u957f\u7684\u952e","__typename":"AppliedTranslationNode"},{"questionId":"1752","title":"\u7b49\u5dee\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1753","title":"\u6700\u5c0f\u4f53\u529b\u6d88\u8017\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1755","title":"\u62c6\u70b8\u5f39","__typename":"AppliedTranslationNode"},{"questionId":"1756","title":"\u4f7f\u5b57\u7b26\u4e32\u5e73\u8861\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1757","title":"\u5230\u5bb6\u7684\u6700\u5c11\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1758","title":"\u5206\u914d\u91cd\u590d\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1759","title":"\u627e\u5230\u9057\u5931\u7684ID","__typename":"AppliedTranslationNode"},{"questionId":"1760","title":"\u80fd\u5426\u8fde\u63a5\u5f62\u6210\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1761","title":"\u7edf\u8ba1\u5b57\u5178\u5e8f\u5143\u97f3\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1762","title":"\u53ef\u4ee5\u5230\u8fbe\u7684\u6700\u8fdc\u5efa\u7b51","__typename":"AppliedTranslationNode"},{"questionId":"1763","title":"\u4e09\u4eba\u56fd\u5bb6\u4ee3\u8868\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1764","title":"\u6700\u5927\u91cd\u590d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1765","title":"\u5408\u5e76\u4e24\u4e2a\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1766","title":"\u5f97\u5230\u5c71\u5f62\u6570\u7ec4\u7684\u6700\u5c11\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1767","title":"\u8bbe\u8ba1\u524d\u4e2d\u540e\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1768","title":"\u8bbe\u8ba1\u5e26\u89e3\u6790\u51fd\u6570\u7684\u8868\u8fbe\u5f0f\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1769","title":"\u83b7\u53d6\u751f\u6210\u6570\u7ec4\u4e2d\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1770","title":"\u5b57\u7b26\u9891\u6b21\u552f\u4e00\u7684\u6700\u5c0f\u5220\u9664\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1771","title":"\u9500\u552e\u4ef7\u503c\u51cf\u5c11\u7684\u989c\u8272\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1772","title":"\u901a\u8fc7\u6307\u4ee4\u521b\u5efa\u6709\u5e8f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1773","title":"\u5404\u8d5b\u4e8b\u7684\u7528\u6237\u6ce8\u518c\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1774","title":"\u6c42\u4e24\u4e2a\u591a\u9879\u5f0f\u94fe\u8868\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1775","title":"\u8bbe\u8ba1\u6709\u5e8f\u6d41","__typename":"AppliedTranslationNode"},{"questionId":"1776","title":"\u5c06 x \u51cf\u5230 0 \u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1777","title":"\u786e\u5b9a\u4e24\u4e2a\u5b57\u7b26\u4e32\u662f\u5426\u63a5\u8fd1","__typename":"AppliedTranslationNode"},{"questionId":"1778","title":"\u6700\u5927\u5316\u7f51\u683c\u5e78\u798f\u611f","__typename":"AppliedTranslationNode"},{"questionId":"1779","title":"Hopper \u516c\u53f8\u67e5\u8be2 I","__typename":"AppliedTranslationNode"},{"questionId":"1780","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 II","__typename":"AppliedTranslationNode"},{"questionId":"1781","title":"\u68c0\u67e5\u4e24\u4e2a\u5b57\u7b26\u4e32\u6570\u7ec4\u662f\u5426\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1782","title":"\u5177\u6709\u7ed9\u5b9a\u6570\u503c\u7684\u6700\u5c0f\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1783","title":"\u751f\u6210\u5e73\u8861\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1784","title":"\u5b8c\u6210\u6240\u6709\u4efb\u52a1\u7684\u6700\u5c11\u521d\u59cb\u80fd\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1786","title":"\u7edf\u8ba1\u4e00\u81f4\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1787","title":"\u6709\u5e8f\u6570\u7ec4\u4e2d\u5dee\u7edd\u5bf9\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1788","title":"\u77f3\u5b50\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1789","title":"\u4ece\u4ed3\u5e93\u5230\u7801\u5934\u8fd0\u8f93\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1790","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 III","__typename":"AppliedTranslationNode"},{"questionId":"1791","title":"\u6700\u5bcc\u6709\u5ba2\u6237\u7684\u8d44\u4ea7\u603b\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1792","title":"\u627e\u51fa\u6700\u5177\u7ade\u4e89\u529b\u7684\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1793","title":"\u4f7f\u6570\u7ec4\u4e92\u8865\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1794","title":"\u6570\u7ec4\u7684\u6700\u5c0f\u504f\u79fb\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1796","title":"\u7ea0\u6b63\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1797","title":"\u8bbe\u8ba1 Goal \u89e3\u6790\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1798","title":"K \u548c\u6570\u5bf9\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1799","title":"\u6700\u5c0f\u4e0d\u517c\u5bb9\u6027","__typename":"AppliedTranslationNode"},{"questionId":"1800","title":"\u8fde\u63a5\u8fde\u7eed\u4e8c\u8fdb\u5236\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1801","title":"\u6bcf\u53f0\u673a\u5668\u7684\u8fdb\u7a0b\u5e73\u5747\u8fd0\u884c\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1802","title":"\u65e0\u6cd5\u5403\u5348\u9910\u7684\u5b66\u751f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1803","title":"\u5e73\u5747\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1804","title":"\u4fee\u6539\u540e\u7684\u6700\u5927\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1805","title":"\u5f97\u5230\u8fde\u7eed K \u4e2a 1 \u7684\u6700\u5c11\u76f8\u90bb\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1806","title":"\u6bd4\u8d5b\u4e2d\u7684\u914d\u5bf9\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1807","title":"\u5341-\u4e8c\u8fdb\u5236\u6570\u7684\u6700\u5c11\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1808","title":"\u77f3\u5b50\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"1809","title":"\u6570\u7ec4\u4e2d\u7279\u6b8a\u7b49\u95f4\u8ddd\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1810","title":"\u6539\u53d8\u4e8c\u53c9\u6811\u7684\u6839\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1811","title":"\u4fee\u590d\u8868\u4e2d\u7684\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1812","title":"\u91cd\u65b0\u683c\u5f0f\u5316\u7535\u8bdd\u53f7\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1813","title":"\u5220\u9664\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1814","title":"\u8df3\u8dc3\u6e38\u620f VI","__typename":"AppliedTranslationNode"},{"questionId":"1815","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728","__typename":"AppliedTranslationNode"},{"questionId":"1816","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148 IV","__typename":"AppliedTranslationNode"},{"questionId":"1817","title":"\u8ba1\u7b97\u529b\u6263\u94f6\u884c\u7684\u94b1","__typename":"AppliedTranslationNode"},{"questionId":"1818","title":"\u5220\u9664\u5b50\u5b57\u7b26\u4e32\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1819","title":"\u6784\u5efa\u5b57\u5178\u5e8f\u6700\u5927\u7684\u53ef\u884c\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1820","title":"\u91cd\u6784\u4e00\u68f5\u6811\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1821","title":"\u53d1\u7968\u4e2d\u7684\u4ea7\u54c1\u91d1\u989d","__typename":"AppliedTranslationNode"},{"questionId":"1822","title":"\u6700\u957f\u56de\u6587\u5b50\u5e8f\u5217 II","__typename":"AppliedTranslationNode"},{"questionId":"1823","title":"\u5224\u65ad\u5b57\u7b26\u4e32\u7684\u4e24\u534a\u662f\u5426\u76f8\u4f3c","__typename":"AppliedTranslationNode"},{"questionId":"1824","title":"\u5403\u82f9\u679c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1825","title":"\u5b8c\u6210\u6240\u6709\u5de5\u4f5c\u7684\u6700\u77ed\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1826","title":"\u4e0e\u6570\u7ec4\u4e2d\u5143\u7d20\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1827","title":"\u65e0\u6548\u7684\u63a8\u6587","__typename":"AppliedTranslationNode"},{"questionId":"1828","title":"\u8ba1\u7b97\u5206\u914d\u7cd6\u679c\u7684\u4e0d\u540c\u65b9\u5f0f","__typename":"AppliedTranslationNode"},{"questionId":"1829","title":"\u5361\u8f66\u4e0a\u7684\u6700\u5927\u5355\u5143\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1830","title":"\u5927\u9910\u8ba1\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1831","title":"\u5c06\u6570\u7ec4\u5206\u6210\u4e09\u4e2a\u5b50\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1832","title":"\u5f97\u5230\u5b50\u5e8f\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1833","title":"\u627e\u5230\u6700\u9ad8\u6d77\u62d4","__typename":"AppliedTranslationNode"},{"questionId":"1834","title":"\u9700\u8981\u6559\u8bed\u8a00\u7684\u6700\u5c11\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1835","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1836","title":"\u751f\u6210\u4e58\u79ef\u6570\u7ec4\u7684\u65b9\u6848\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1837","title":"\u6bcf\u5929\u7684\u9886\u5bfc\u548c\u5408\u4f19\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1838","title":"\u5b57\u7b26\u4e32\u7684\u4e0d\u540c\u5b50\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1839","title":"\u89e3\u7801\u5f02\u6216\u540e\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1840","title":"\u6267\u884c\u4ea4\u6362\u64cd\u4f5c\u540e\u7684\u6700\u5c0f\u6c49\u660e\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1842","title":"\u4e24\u4eba\u4e4b\u95f4\u7684\u901a\u8bdd\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1843","title":"\u53ef\u4ee5\u5f62\u6210\u6700\u5927\u6b63\u65b9\u5f62\u7684\u77e9\u5f62\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1844","title":"\u76d2\u5b50\u4e2d\u5c0f\u7403\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1845","title":"\u91cd\u65b0\u6392\u5217\u540e\u7684\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1847","title":"\u957f\u5ea6\u4e3a K \u7684\u6700\u5927\u5b50\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1848","title":"\u552f\u4e00\u5143\u7d20\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1849","title":"\u4efb\u610f\u5b50\u6570\u7ec4\u548c\u7684\u7edd\u5bf9\u503c\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1850","title":"\u5220\u9664\u5b57\u7b26\u4e32\u4e24\u7aef\u76f8\u540c\u5b57\u7b26\u540e\u7684\u6700\u77ed\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1851","title":"\u6700\u591a\u53ef\u4ee5\u53c2\u52a0\u7684\u4f1a\u8bae\u6570\u76ee II","__typename":"AppliedTranslationNode"},{"questionId":"1852","title":"\u8bbf\u95ee\u65e5\u671f\u4e4b\u95f4\u6700\u5927\u7684\u7a7a\u6863\u671f","__typename":"AppliedTranslationNode"},{"questionId":"1858","title":"\u66ff\u6362\u9690\u85cf\u6570\u5b57\u5f97\u5230\u7684\u6700\u665a\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1859","title":"\u6ee1\u8db3\u4e09\u6761\u4ef6\u4e4b\u4e00\u9700\u6539\u53d8\u7684\u6700\u5c11\u5b57\u7b26\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1860","title":"\u627e\u51fa\u7b2c K \u5927\u7684\u5f02\u6216\u5750\u6807\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1861","title":"\u653e\u7f6e\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1862","title":"\u82f9\u679c\u548c\u6a58\u5b50\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1865","title":"\u68c0\u67e5\u8fb9\u957f\u5ea6\u9650\u5236\u7684\u8def\u5f84\u662f\u5426\u5b58\u5728 II","__typename":"AppliedTranslationNode"},{"questionId":"1866","title":"\u4ece\u76f8\u90bb\u5143\u7d20\u5bf9\u8fd8\u539f\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1871","title":"\u56de\u6587\u4e32\u5206\u5272 IV","__typename":"AppliedTranslationNode"},{"questionId":"1872","title":"\u4f60\u80fd\u5728\u4f60\u6700\u559c\u6b22\u7684\u90a3\u5929\u5403\u5230\u4f60\u6700\u559c\u6b22\u7684\u7cd6\u679c\u5417\uff1f","__typename":"AppliedTranslationNode"},{"questionId":"1873","title":"\u6700\u957f\u7684\u7f8e\u597d\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1874","title":"\u901a\u8fc7\u8fde\u63a5\u53e6\u4e00\u4e2a\u6570\u7ec4\u7684\u5b50\u6570\u7ec4\u5f97\u5230\u4e00\u4e2a\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1875","title":"\u4e92\u8d28\u6811","__typename":"AppliedTranslationNode"},{"questionId":"1876","title":"\u5730\u56fe\u4e2d\u7684\u6700\u9ad8\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1877","title":"\u6c42\u5173\u6ce8\u8005\u7684\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1878","title":"\u68c0\u67e5\u6570\u7ec4\u662f\u5426\u7ecf\u6392\u5e8f\u548c\u8f6e\u8f6c\u5f97\u5230","__typename":"AppliedTranslationNode"},{"questionId":"1879","title":"\u79fb\u9664\u77f3\u5b50\u7684\u6700\u5927\u5f97\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1880","title":"\u6784\u9020\u5b57\u5178\u5e8f\u6700\u5927\u7684\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1881","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u503c\u7684\u5b50\u5e8f\u5217\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1882","title":"\u6bcf\u4f4d\u7ecf\u7406\u7684\u4e0b\u5c5e\u5458\u5de5\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1883","title":"\u627e\u5230\u4e8c\u53c9\u6811\u4e2d\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1884","title":"\u751f\u6210\u4ea4\u66ff\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u7684\u6700\u5c11\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1885","title":"\u7edf\u8ba1\u540c\u6784\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1886","title":"\u888b\u5b50\u91cc\u6700\u5c11\u6570\u76ee\u7684\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1887","title":"\u4e00\u4e2a\u56fe\u4e2d\u8fde\u901a\u4e09\u5143\u7ec4\u7684\u6700\u5c0f\u5ea6\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1888","title":"\u627e\u5230\u6700\u8fd1\u7684\u6709\u76f8\u540c X \u6216 Y \u5750\u6807\u7684\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1889","title":"\u5224\u65ad\u4e00\u4e2a\u6570\u5b57\u662f\u5426\u53ef\u4ee5\u8868\u793a\u6210\u4e09\u7684\u5e42\u7684\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1890","title":"\u6240\u6709\u5b50\u5b57\u7b26\u4e32\u7f8e\u4e3d\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1891","title":"\u7edf\u8ba1\u70b9\u5bf9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1892","title":"\u67e5\u627e\u6bcf\u4e2a\u5458\u5de5\u82b1\u8d39\u7684\u603b\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1893","title":"\u7ecf\u8fc7\u4e00\u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1894","title":"\u4ea4\u66ff\u5408\u5e76\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1895","title":"\u79fb\u52a8\u6240\u6709\u7403\u5230\u6bcf\u4e2a\u76d2\u5b50\u6240\u9700\u7684\u6700\u5c0f\u64cd\u4f5c\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1896","title":"\u6267\u884c\u4e58\u6cd5\u8fd0\u7b97\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1897","title":"\u7531\u5b50\u5e8f\u5217\u6784\u9020\u7684\u6700\u957f\u56de\u6587\u4e32\u7684\u957f\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1898","title":"\u5e94\u8be5\u88ab\u7981\u6b62\u7684Leetflex\u8d26\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1899","title":"\u7edf\u8ba1\u5339\u914d\u68c0\u7d22\u89c4\u5219\u7684\u7269\u54c1\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1900","title":"\u6700\u63a5\u8fd1\u76ee\u6807\u4ef7\u683c\u7684\u751c\u70b9\u6210\u672c","__typename":"AppliedTranslationNode"},{"questionId":"1901","title":"\u901a\u8fc7\u6700\u5c11\u64cd\u4f5c\u6b21\u6570\u4f7f\u6570\u7ec4\u7684\u548c\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1902","title":"\u8f66\u961f II","__typename":"AppliedTranslationNode"},{"questionId":"1903","title":"\u8bbe\u8ba1\u6700\u8fd1\u4f7f\u7528\uff08MRU\uff09\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1904","title":"\u5b57\u7b26\u4e32\u4e2d\u7b2c\u4e8c\u5927\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1905","title":"\u8bbe\u8ba1\u4e00\u4e2a\u9a8c\u8bc1\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1906","title":"N \u6b21\u64cd\u4f5c\u540e\u7684\u6700\u5927\u5206\u6570\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1907","title":"\u7edf\u8ba1\u5f02\u6216\u503c\u5728\u8303\u56f4\u5185\u7684\u6570\u5bf9\u6709\u591a\u5c11","__typename":"AppliedTranslationNode"},{"questionId":"1908","title":"\u53ef\u56de\u6536\u4e14\u4f4e\u8102\u7684\u4ea7\u54c1","__typename":"AppliedTranslationNode"},{"questionId":"1909","title":"\u80fd\u770b\u5230\u6d77\u666f\u7684\u5efa\u7b51\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1910","title":"\u68c0\u67e5\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u6bb5","__typename":"AppliedTranslationNode"},{"questionId":"1911","title":"\u6784\u6210\u7279\u5b9a\u548c\u9700\u8981\u6dfb\u52a0\u7684\u6700\u5c11\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1912","title":"\u4ece\u7b2c\u4e00\u4e2a\u8282\u70b9\u51fa\u53d1\u5230\u6700\u540e\u4e00\u4e2a\u8282\u70b9\u7684\u53d7\u9650\u8def\u5f84\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1913","title":"\u4f7f\u6240\u6709\u533a\u95f4\u7684\u5f02\u6216\u7ed3\u679c\u4e3a\u96f6","__typename":"AppliedTranslationNode"},{"questionId":"1914","title":"\u5bfb\u627e\u6ca1\u6709\u88ab\u6267\u884c\u7684\u4efb\u52a1\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1915","title":"\u4ec5\u6267\u884c\u4e00\u6b21\u5b57\u7b26\u4e32\u4ea4\u6362\u80fd\u5426\u4f7f\u4e24\u4e2a\u5b57\u7b26\u4e32\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"1916","title":"\u627e\u51fa\u661f\u578b\u56fe\u7684\u4e2d\u5fc3\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1917","title":"\u6700\u5927\u5e73\u5747\u901a\u8fc7\u7387","__typename":"AppliedTranslationNode"},{"questionId":"1918","title":"\u597d\u5b50\u6570\u7ec4\u7684\u6700\u5927\u5206\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1919","title":"\u6309\u53d7\u6b22\u8fce\u7a0b\u5ea6\u6392\u5217\u529f\u80fd","__typename":"AppliedTranslationNode"},{"questionId":"1920","title":"\u5224\u65ad\u56fd\u9645\u8c61\u68cb\u68cb\u76d8\u4e2d\u4e00\u4e2a\u683c\u5b50\u7684\u989c\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1923","title":"\u53e5\u5b50\u76f8\u4f3c\u6027 III","__typename":"AppliedTranslationNode"},{"questionId":"1924","title":"\u5f97\u5230\u65b0\u9c9c\u751c\u751c\u5708\u7684\u6700\u591a\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1925","title":"\u7edf\u8ba1\u4e00\u4e2a\u6570\u7ec4\u4e2d\u597d\u5bf9\u5b50\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1926","title":"\u6bcf\u5bb6\u5546\u5e97\u7684\u4ea7\u54c1\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1927","title":"\u6700\u5927\u5347\u5e8f\u5b50\u6570\u7ec4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1928","title":"\u79ef\u538b\u8ba2\u5355\u4e2d\u7684\u8ba2\u5355\u603b\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1929","title":"\u6709\u754c\u6570\u7ec4\u4e2d\u6307\u5b9a\u4e0b\u6807\u5904\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1930","title":"\u4f60\u80fd\u6784\u9020\u51fa\u8fde\u7eed\u503c\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1932","title":"\u5927\u6ee1\u8d2f\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1933","title":"\u5b57\u7b26\u4e32\u4e2d\u4e0d\u540c\u6574\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1934","title":"\u66ff\u6362\u5b57\u7b26\u4e32\u4e2d\u7684\u62ec\u53f7\u5185\u5bb9","__typename":"AppliedTranslationNode"},{"questionId":"1935","title":"\u8fd8\u539f\u6392\u5217\u7684\u6700\u5c11\u64cd\u4f5c\u6b65\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1936","title":"\u597d\u56e0\u5b50\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1937","title":"\u6700\u5927\u5316\u82b1\u56ed\u7684\u7f8e\u89c2\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1938","title":"\u6700\u5c11\u64cd\u4f5c\u4f7f\u6570\u7ec4\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"1939","title":"\u7edf\u8ba1\u4e00\u4e2a\u5706\u4e2d\u70b9\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1940","title":"\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5927\u5f02\u6216\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1941","title":"\u4f7f\u5b57\u7b26\u4e32\u6709\u5e8f\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1942","title":"\u5458\u5de5\u7684\u76f4\u5c5e\u90e8\u95e8","__typename":"AppliedTranslationNode"},{"questionId":"1943","title":"\u7edf\u8ba1\u8ddd\u79bb\u6700\u5c0f\u7684\u5b50\u4e32\u5bf9\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1944","title":"\u622a\u65ad\u53e5\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1945","title":"\u67e5\u627e\u7528\u6237\u6d3b\u8dc3\u5206\u949f\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1946","title":"\u7edd\u5bf9\u5dee\u503c\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1947","title":"\u5e8f\u5217\u4e2d\u4e0d\u540c\u6700\u5927\u516c\u7ea6\u6570\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1948","title":"\u6bcf\u4e2a\u4ea7\u54c1\u5728\u4e0d\u540c\u5546\u5e97\u7684\u4ef7\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1949","title":"\u5b9e\u73b0 Trie \uff08\u524d\u7f00\u6811\uff09 II","__typename":"AppliedTranslationNode"},{"questionId":"1950","title":"\u6570\u7ec4\u5143\u7d20\u79ef\u7684\u7b26\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1951","title":"\u627e\u51fa\u6e38\u620f\u7684\u83b7\u80dc\u8005","__typename":"AppliedTranslationNode"},{"questionId":"1952","title":"\u6700\u5c11\u4fa7\u8df3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1953","title":"\u6c42\u51fa MK \u5e73\u5747\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1954","title":"\u5c06\u6240\u6709\u6570\u5b57\u7528\u5b57\u7b26\u66ff\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1955","title":"\u5ea7\u4f4d\u9884\u7ea6\u7ba1\u7406\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"1956","title":"\u51cf\u5c0f\u548c\u91cd\u65b0\u6392\u5217\u6570\u7ec4\u540e\u7684\u6700\u5927\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1957","title":"\u6700\u8fd1\u7684\u623f\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1958","title":"\u6ca1\u6709\u5e7f\u544a\u7684\u5267\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1960","title":"\u5224\u65ad\u53e5\u5b50\u662f\u5426\u4e3a\u5168\u5b57\u6bcd\u53e5","__typename":"AppliedTranslationNode"},{"questionId":"1961","title":"\u96ea\u7cd5\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1962","title":"\u5355\u7ebf\u7a0b CPU","__typename":"AppliedTranslationNode"},{"questionId":"1963","title":"\u6240\u6709\u6570\u5bf9\u6309\u4f4d\u4e0e\u7ed3\u679c\u7684\u5f02\u6216\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1965","title":"K \u8fdb\u5236\u8868\u793a\u4e0b\u7684\u5404\u4f4d\u6570\u5b57\u603b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1966","title":"\u6700\u9ad8\u9891\u5143\u7d20\u7684\u9891\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1967","title":"\u6240\u6709\u5143\u97f3\u6309\u987a\u5e8f\u6392\u5e03\u7684\u6700\u957f\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1968","title":"\u6700\u9ad8\u5efa\u7b51\u9ad8\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1970","title":"\u5c06\u53e5\u5b50\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1971","title":"\u589e\u957f\u7684\u5185\u5b58\u6cc4\u9732","__typename":"AppliedTranslationNode"},{"questionId":"1972","title":"\u65cb\u8f6c\u76d2\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"1974","title":"\u5bfb\u627e\u4eca\u5e74\u5177\u6709\u6b63\u6536\u5165\u7684\u5ba2\u6237","__typename":"AppliedTranslationNode"},{"questionId":"1975","title":"\u5230\u76ee\u6807\u5143\u7d20\u7684\u6700\u5c0f\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1976","title":"\u5c06\u5b57\u7b26\u4e32\u62c6\u5206\u4e3a\u9012\u51cf\u7684\u8fde\u7eed\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1977","title":"\u5305\u542b\u6bcf\u4e2a\u67e5\u8be2\u7684\u6700\u5c0f\u533a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1978","title":"\u90bb\u4f4d\u4ea4\u6362\u7684\u6700\u5c0f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1980","title":"\u6709\u7f3a\u9677\u7684\u4f20\u611f\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1981","title":"\u6bcf\u5929\u7684\u6700\u5927\u4ea4\u6613","__typename":"AppliedTranslationNode"},{"questionId":"1983","title":"\u4eba\u53e3\u6700\u591a\u7684\u5e74\u4efd","__typename":"AppliedTranslationNode"},{"questionId":"1984","title":"\u4e0b\u6807\u5bf9\u4e2d\u7684\u6700\u5927\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1985","title":"\u5b50\u6570\u7ec4\u6700\u5c0f\u4e58\u79ef\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1986","title":"\u6709\u5411\u56fe\u4e2d\u6700\u5927\u989c\u8272\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1987","title":"\u957f\u5ea6\u4e3a\u4e09\u4e14\u5404\u5b57\u7b26\u4e0d\u540c\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1988","title":"\u6570\u7ec4\u4e2d\u6700\u5927\u6570\u5bf9\u548c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1989","title":"\u4e24\u4e2a\u6570\u7ec4\u6700\u5c0f\u7684\u5f02\u6216\u503c\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1990","title":"\u77e9\u9635\u4e2d\u6700\u5927\u7684\u4e09\u4e2a\u83f1\u5f62\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1993","title":"\u627e\u51fa\u6240\u6709\u5b50\u96c6\u7684\u5f02\u6216\u603b\u548c\u518d\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1994","title":"\u6784\u6210\u4ea4\u66ff\u5b57\u7b26\u4e32\u9700\u8981\u7684\u6700\u5c0f\u4ea4\u6362\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1995","title":"\u627e\u51fa\u548c\u4e3a\u6307\u5b9a\u503c\u7684\u4e0b\u6807\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"1996","title":"\u6070\u6709 K \u6839\u6728\u68cd\u53ef\u4ee5\u770b\u5230\u7684\u6392\u5217\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1999","title":"\u54ea\u79cd\u8fde\u7eed\u5b50\u5b57\u7b26\u4e32\u66f4\u957f","__typename":"AppliedTranslationNode"},{"questionId":"2000","title":"\u51c6\u65f6\u5230\u8fbe\u7684\u5217\u8f66\u6700\u5c0f\u65f6\u901f","__typename":"AppliedTranslationNode"},{"questionId":"2001","title":"\u8df3\u8dc3\u6e38\u620f VII","__typename":"AppliedTranslationNode"},{"questionId":"2002","title":"\u77f3\u5b50\u6e38\u620f VIII","__typename":"AppliedTranslationNode"},{"questionId":"2005","title":"\u68c0\u67e5\u662f\u5426\u533a\u57df\u5185\u6240\u6709\u6574\u6570\u90fd\u88ab\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"2006","title":"\u627e\u5230\u9700\u8981\u8865\u5145\u7c89\u7b14\u7684\u5b66\u751f\u7f16\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"2008","title":"\u53cd\u8f6c\u8868\u8fbe\u5f0f\u503c\u7684\u6700\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2010","title":"\u68c0\u67e5\u67d0\u5355\u8bcd\u662f\u5426\u7b49\u4e8e\u4e24\u5355\u8bcd\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2011","title":"\u63d2\u5165\u540e\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2012","title":"\u4f7f\u7528\u670d\u52a1\u5668\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"2013","title":"\u51c6\u65f6\u62b5\u8fbe\u4f1a\u8bae\u73b0\u573a\u7684\u6700\u5c0f\u8df3\u8fc7\u4f11\u606f\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2015","title":"\u5224\u65ad\u77e9\u9635\u7ecf\u8f6e\u8f6c\u540e\u662f\u5426\u4e00\u81f4","__typename":"AppliedTranslationNode"},{"questionId":"2016","title":"\u4f7f\u6570\u7ec4\u5143\u7d20\u76f8\u7b49\u7684\u51cf\u5c11\u64cd\u4f5c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2017","title":"\u4f7f\u4e8c\u8fdb\u5236\u5b57\u7b26\u4e32\u5b57\u7b26\u4ea4\u66ff\u7684\u6700\u5c11\u53cd\u8f6c\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2018","title":"\u88c5\u5305\u88f9\u7684\u6700\u5c0f\u6d6a\u8d39\u7a7a\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"2020","title":"\u5220\u9664\u4e00\u4e2a\u5143\u7d20\u4f7f\u6570\u7ec4\u4e25\u683c\u9012\u589e","__typename":"AppliedTranslationNode"},{"questionId":"2021","title":"\u5220\u9664\u4e00\u4e2a\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u51fa\u73b0\u7684\u7ed9\u5b9a\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"2022","title":"\u6700\u5927\u5b50\u5e8f\u5217\u4ea4\u66ff\u548c","__typename":"AppliedTranslationNode"},{"questionId":"2023","title":"\u8bbe\u8ba1\u7535\u5f71\u79df\u501f\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"2025","title":"\u91cd\u65b0\u5206\u914d\u5b57\u7b26\u4f7f\u6240\u6709\u5b57\u7b26\u4e32\u90fd\u76f8\u7b49","__typename":"AppliedTranslationNode"},{"questionId":"2026","title":"\u5408\u5e76\u82e5\u5e72\u4e09\u5143\u7ec4\u4ee5\u5f62\u6210\u76ee\u6807\u4e09\u5143\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2027","title":"\u53ef\u79fb\u9664\u5b57\u7b26\u7684\u6700\u5927\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2028","title":"\u6700\u4f73\u8fd0\u52a8\u5458\u7684\u6bd4\u62fc\u56de\u5408","__typename":"AppliedTranslationNode"},{"questionId":"2031","title":"\u9e21\u86cb\u6389\u843d-\u4e24\u679a\u9e21\u86cb","__typename":"AppliedTranslationNode"},{"questionId":"2032","title":"\u5b57\u7b26\u4e32\u4e2d\u7684\u6700\u5927\u5947\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2033","title":"\u4f60\u5b8c\u6210\u7684\u5b8c\u6574\u5bf9\u5c40\u6570","__typename":"AppliedTranslationNode"},{"questionId":"2034","title":"\u67e5\u8be2\u5dee\u7edd\u5bf9\u503c\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"2035","title":"\u7edf\u8ba1\u5b50\u5c9b\u5c7f","__typename":"AppliedTranslationNode"},{"questionId":"2042","title":"\u4e24\u4e2a\u6570\u5bf9\u4e4b\u95f4\u7684\u6700\u5927\u4e58\u79ef\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"2043","title":"\u5faa\u73af\u8f6e\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"2044","title":"\u6700\u7f8e\u5b50\u5b57\u7b26\u4e32\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2048","title":"\u57fa\u4e8e\u6392\u5217\u6784\u5efa\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"2049","title":"\u6d88\u706d\u602a\u7269\u7684\u6700\u5927\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"2050","title":"\u7edf\u8ba1\u597d\u6570\u5b57\u7684\u6570\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"2051","title":"\u6700\u957f\u516c\u5171\u5b50\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100002","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100003","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100004","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100005","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100006","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100007","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100008","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100009","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100010","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100011","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100012","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100013","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100014","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100015","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100016","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100017","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100018","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100019","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100020","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100021","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100022","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100023","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100024","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100025","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100026","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100027","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100028","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100029","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100030","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100031","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100032","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100033","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100034","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100035","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100036","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100037","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u9ad8\u4e2d\u7ec4 \u521d\u8d5b\u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100038","title":"\u78b0\u649e\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100039","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100040","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100041","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100042","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100043","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100044","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100045","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e00\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100046","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e8c\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100047","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e09\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100048","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u56db\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100049","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u4e94\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100050","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u7b2c\u516d\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100051","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u521d\u4e2d\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100052","title":"2019 \u5e74\u4e0a\u6d77\u5e02\u521b\u610f\u7f16\u7a0b\u4e0e\u667a\u80fd\u8bbe\u8ba1\u5927\u8d5b \u7b97\u6cd5\u7f16\u7a0b \u5c0f\u5b66\u7ec4\u73b0\u573a\u8d5b \u8eab\u4efd\u9a8c\u8bc1\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100065","title":"\u6700\u5c0f\u4ea4\u6362\u6b21\u6570\u4f7f\u5f97\u6570\u7ec4\u6709\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100091","title":"\u529b\u6263\u8c61\u68cb\u5b66\u5802","__typename":"AppliedTranslationNode"},{"questionId":"100092","title":"\u5206\u5f0f\u5316\u7b80","__typename":"AppliedTranslationNode"},{"questionId":"100093","title":"\u8986\u76d6","__typename":"AppliedTranslationNode"},{"questionId":"100094","title":"\u53d1 LeetCoin","__typename":"AppliedTranslationNode"},{"questionId":"100096","title":"\u673a\u5668\u4eba\u5927\u5192\u9669","__typename":"AppliedTranslationNode"},{"questionId":"100103","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100104","title":"\u5168\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100105","title":"\u56f4\u6210\u4e00\u5708","__typename":"AppliedTranslationNode"},{"questionId":"100106","title":"\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100107","title":"\u731c\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100125","title":"\u6700\u5c11\u4ea4\u6362\u6b21\u6570 - LC","__typename":"AppliedTranslationNode"},{"questionId":"100129","title":"\u5458\u5de5\u4e92\u8bc4","__typename":"AppliedTranslationNode"},{"questionId":"100130","title":"\u7535\u68af","__typename":"AppliedTranslationNode"},{"questionId":"100136","title":"\u5b57\u7b26\u4e32\u9a8c\u8bc1","__typename":"AppliedTranslationNode"},{"questionId":"100139","title":"\u6d4b\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100144","title":"\u6700\u5927\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100146","title":"\u75c5\u6bd2","__typename":"AppliedTranslationNode"},{"questionId":"100147","title":"\u6d88\u9664\u56de\u6587\u5b50\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100148","title":"PK","__typename":"AppliedTranslationNode"},{"questionId":"100149","title":"\u5408\u5e76\u4efb\u52a1\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100151","title":"\u56fd\u5bb6\u7ed3\u76df -- 952 \u91cd\u590d","__typename":"AppliedTranslationNode"},{"questionId":"100152","title":"\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100153","title":"\u5feb\u9012\u5458\u6d3e\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"100154","title":"\u8fde\u8fde\u770b","__typename":"AppliedTranslationNode"},{"questionId":"100157","title":"\u6d3b\u8dc3\u7528\u6237","__typename":"AppliedTranslationNode"},{"questionId":"100158","title":"\u5224\u5b9a\u5b57\u7b26\u662f\u5426\u552f\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100159","title":"\u5224\u5b9a\u662f\u5426\u4e92\u4e3a\u5b57\u7b26\u91cd\u6392","__typename":"AppliedTranslationNode"},{"questionId":"100160","title":"URL\u5316","__typename":"AppliedTranslationNode"},{"questionId":"100161","title":"\u5b57\u7b26\u4e32\u538b\u7f29","__typename":"AppliedTranslationNode"},{"questionId":"100162","title":"\u5b57\u7b26\u4e32\u8f6e\u8f6c","__typename":"AppliedTranslationNode"},{"questionId":"100163","title":"\u79fb\u9664\u91cd\u590d\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100164","title":"\u56de\u6587\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100167","title":"\u94fe\u8868\u76f8\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"100168","title":"\u73af\u8def\u68c0\u6d4b","__typename":"AppliedTranslationNode"},{"questionId":"100169","title":"\u6808\u7684\u6700\u5c0f\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100170","title":"\u5316\u6808\u4e3a\u961f","__typename":"AppliedTranslationNode"},{"questionId":"100171","title":"\u8282\u70b9\u95f4\u901a\u8def","__typename":"AppliedTranslationNode"},{"questionId":"100172","title":"\u4e09\u5408\u4e00","__typename":"AppliedTranslationNode"},{"questionId":"100173","title":"\u6808\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100174","title":"\u6700\u5c0f\u9ad8\u5ea6\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100175","title":"\u7279\u5b9a\u6df1\u5ea6\u8282\u70b9\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100176","title":"\u68c0\u67e5\u5e73\u8861\u6027","__typename":"AppliedTranslationNode"},{"questionId":"100177","title":"\u5408\u6cd5\u4e8c\u53c9\u641c\u7d22\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100178","title":"\u540e\u7ee7\u8005","__typename":"AppliedTranslationNode"},{"questionId":"100179","title":"\u9996\u4e2a\u5171\u540c\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100180","title":"\u63d2\u5165","__typename":"AppliedTranslationNode"},{"questionId":"100181","title":"\u6574\u6570\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100182","title":"\u914d\u5bf9\u4ea4\u6362","__typename":"AppliedTranslationNode"},{"questionId":"100183","title":"\u4e0b\u4e00\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100184","title":"\u56de\u6587\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100185","title":"\u65cb\u8f6c\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100186","title":"\u96f6\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100187","title":"\u5220\u9664\u4e2d\u95f4\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100188","title":"\u94fe\u8868\u6c42\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100189","title":"\u897f\u6e38\u8bb0","__typename":"AppliedTranslationNode"},{"questionId":"100191","title":"\u4f18\u5316\u53c2\u8d5b\u961f\u4f0d","__typename":"AppliedTranslationNode"},{"questionId":"100193","title":"\u9ed1\u767d\u68cb","__typename":"AppliedTranslationNode"},{"questionId":"100194","title":"2048 \u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100195","title":"\u5806\u76d8\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100196","title":"\u7ed8\u5236\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100197","title":"\u4e09\u6b65\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100198","title":"\u5e42\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"100199","title":"\u9012\u5f52\u4e58\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100200","title":"\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"100201","title":"\u989c\u8272\u586b\u5145","__typename":"AppliedTranslationNode"},{"questionId":"100202","title":"\u5806\u7bb1\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100203","title":"\u4e8c\u8fdb\u5236\u6570\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100206","title":"\u70b9\u4eae\u5723\u8bde\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100207","title":"\u8ff7\u5bab\u91cd\u529b\u7403","__typename":"AppliedTranslationNode"},{"questionId":"100208","title":"\u65e9\u9910\u9ad8\u5cf0","__typename":"AppliedTranslationNode"},{"questionId":"100209","title":"\u6768\u67f3\u7d6e\u6291\u5236\u5242","__typename":"AppliedTranslationNode"},{"questionId":"100210","title":"\u642c\u5bb6\u6253\u5305","__typename":"AppliedTranslationNode"},{"questionId":"100211","title":" \u671f\u4e2d\u8003\u8bd5","__typename":"AppliedTranslationNode"},{"questionId":"100212","title":"\u5468\u516d\u5bb5\u591c\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100213","title":"\u51fa\u6e38\u603b\u7ed3","__typename":"AppliedTranslationNode"},{"questionId":"100214","title":"\u9910\u5385\u4f18\u60e0\u5238","__typename":"AppliedTranslationNode"},{"questionId":"100215","title":"\u51fa\u5dee\u8def\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100216","title":"\u89e3\u65b9\u7a0b","__typename":"AppliedTranslationNode"},{"questionId":"100217","title":"\u6700\u62e5\u5835\u7684\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"100218","title":"\u5165\u5b66\u8003\u8bd5\u7b97\u6cd5\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100219","title":"\u5783\u573e\u90ae\u4ef6\u8fc7\u6ee4\u7cfb\u7edf","__typename":"AppliedTranslationNode"},{"questionId":"100220","title":"\u672c\u5468\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"100221","title":"\u4e34\u65f6\u70b9\u9910\u5458","__typename":"AppliedTranslationNode"},{"questionId":"100222","title":"\u5c0f\u7ec4\u8ba8\u8bba","__typename":"AppliedTranslationNode"},{"questionId":"100223","title":"\u91c7\u8d2d\u6e05\u5355","__typename":"AppliedTranslationNode"},{"questionId":"100226","title":"\u7b97\u6cd5\u8bfe","__typename":"AppliedTranslationNode"},{"questionId":"100228","title":"\u52a8\u7269\u6536\u5bb9\u6240","__typename":"AppliedTranslationNode"},{"questionId":"100229","title":"\u68c0\u67e5\u5b50\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100230","title":"\u7ffb\u8f6c\u6570\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"100231","title":"\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"100232","title":"\u641c\u7d22\u65cb\u8f6c\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100233","title":"\u516b\u7687\u540e","__typename":"AppliedTranslationNode"},{"questionId":"100234","title":"\u57fa\u7ad9\u5730\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"100235","title":"\u7f16\u7a0b\u8bed\u8a00\u504f\u597d\u8c03\u67e5","__typename":"AppliedTranslationNode"},{"questionId":"100236","title":"\u964d\u566a\u8033\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100237","title":"\u51fa\u5dee\u8def\u7ebf II","__typename":"AppliedTranslationNode"},{"questionId":"100238","title":"\u4e92\u4fe1\u534f\u5546\u673a\u5236 II","__typename":"AppliedTranslationNode"},{"questionId":"100239","title":"TLV \u7f16\u7801","__typename":"AppliedTranslationNode"},{"questionId":"100240","title":"\u9b54\u672f\u7d22\u5f15","__typename":"AppliedTranslationNode"},{"questionId":"100241","title":"\u65e0\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100242","title":"\u7a00\u758f\u6570\u7ec4\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"100246","title":"\u5458\u5de5\u8fd0\u52a8\u4f1a","__typename":"AppliedTranslationNode"},{"questionId":"100247","title":"\u65f6\u95f4\u7247\u8f6e\u8f6c\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100248","title":"\u6700\u77ed\u5269\u4f59\u65f6\u95f4\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100249","title":"\u6570\u636e\u590d\u539f","__typename":"AppliedTranslationNode"},{"questionId":"100250","title":"\u8eab\u9ad8\u4f18\u52bf","__typename":"AppliedTranslationNode"},{"questionId":"100251","title":"\u5b9a\u4ef7\u7b56\u7565","__typename":"AppliedTranslationNode"},{"questionId":"100252","title":"\u4e1a\u7ee9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"100253","title":"\u8bfb\u4e66\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"100254","title":"\u5956\u91d1\u8ba1\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100255","title":"\u529e\u516c\u5ba4\u996e\u6c34\u673a","__typename":"AppliedTranslationNode"},{"questionId":"100256","title":"\u9ad8\u94c1\u9009\u5ea7","__typename":"AppliedTranslationNode"},{"questionId":"100257","title":"\u5730\u94c1\u7968","__typename":"AppliedTranslationNode"},{"questionId":"100258","title":"\u4ea4\u6362\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100259","title":"\u5355\u8bcd\u9891\u7387","__typename":"AppliedTranslationNode"},{"questionId":"100260","title":"\u4ea4\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100261","title":"\u4e95\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"100262","title":"\u6700\u5c0f\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"100263","title":"SyM \u7684 \ud83d\udd11","__typename":"AppliedTranslationNode"},{"questionId":"100264","title":"\u5206\u82f9\u679c","__typename":"AppliedTranslationNode"},{"questionId":"100265","title":"qqqqqqqqqqqqqqqy \u7684\u70ed\u8eab\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100266","title":"\u5c0f\u80d6\u5b50\u7684\u65e5\u5e38","__typename":"AppliedTranslationNode"},{"questionId":"100267","title":"\u7406\u7425\u73c0\u73e0","__typename":"AppliedTranslationNode"},{"questionId":"100269","title":"\u72fc\u4eba\u6740\u6a21\u62df\u5668","__typename":"AppliedTranslationNode"},{"questionId":"100272","title":"\ud83d\udc2d\u5e74\u5feb\u4e50","__typename":"AppliedTranslationNode"},{"questionId":"100273","title":"\u7528\u4e24\u4e2a\u6808\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100274","title":"\u6590\u6ce2\u90a3\u5951\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100275","title":"\u6570\u7ec4\u4e2d\u91cd\u590d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100276","title":"\u4e8c\u7ef4\u6570\u7ec4\u4e2d\u7684\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"100277","title":"\u9752\u86d9\u8df3\u53f0\u9636\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"100278","title":"\u65cb\u8f6c\u6570\u7ec4\u7684\u6700\u5c0f\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100279","title":"\u77e9\u9635\u4e2d\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100280","title":"\u66ff\u6362\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"100281","title":"\u673a\u5668\u4eba\u7684\u8fd0\u52a8\u8303\u56f4","__typename":"AppliedTranslationNode"},{"questionId":"100282","title":"\u4ece\u5c3e\u5230\u5934\u6253\u5370\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100283","title":"\u91cd\u5efa\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100284","title":"\u526a\u7ef3\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100285","title":"\u526a\u7ef3\u5b50 II","__typename":"AppliedTranslationNode"},{"questionId":"100286","title":"\u5408\u5e76\u4e24\u4e2a\u6392\u5e8f\u7684\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100287","title":"\u6811\u7684\u5b50\u7ed3\u6784","__typename":"AppliedTranslationNode"},{"questionId":"100288","title":"\u4e8c\u53c9\u6811\u7684\u955c\u50cf","__typename":"AppliedTranslationNode"},{"questionId":"100289","title":"\u5bf9\u79f0\u7684\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100290","title":"\u8868\u793a\u6570\u503c\u7684\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100291","title":"\u8c03\u6574\u6570\u7ec4\u987a\u5e8f\u4f7f\u5947\u6570\u4f4d\u4e8e\u5076\u6570\u524d\u9762","__typename":"AppliedTranslationNode"},{"questionId":"100292","title":"\u4e8c\u8fdb\u5236\u4e2d1\u7684\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100293","title":"\u987a\u65f6\u9488\u6253\u5370\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"100294","title":"\u94fe\u8868\u4e2d\u5012\u6570\u7b2ck\u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100295","title":"\u6570\u503c\u7684\u6574\u6570\u6b21\u65b9","__typename":"AppliedTranslationNode"},{"questionId":"100296","title":"\u6253\u5370\u4ece1\u5230\u6700\u5927\u7684n\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100297","title":"\u6b63\u5219\u8868\u8fbe\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"100298","title":"\u53cd\u8f6c\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100299","title":"\u5220\u9664\u94fe\u8868\u7684\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100300","title":"\u590d\u6742\u94fe\u8868\u7684\u590d\u5236","__typename":"AppliedTranslationNode"},{"questionId":"100301","title":"\u6700\u5c0f\u7684k\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100302","title":"\u5305\u542bmin\u51fd\u6570\u7684\u6808","__typename":"AppliedTranslationNode"},{"questionId":"100303","title":"\u6570\u636e\u6d41\u4e2d\u7684\u4e2d\u4f4d\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100304","title":"\u8fde\u7eed\u5b50\u6570\u7ec4\u7684\u6700\u5927\u548c","__typename":"AppliedTranslationNode"},{"questionId":"100305","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u4e0e\u53cc\u5411\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"100306","title":"\u6808\u7684\u538b\u5165\u3001\u5f39\u51fa\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100307","title":"\u5e8f\u5217\u5316\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100308","title":"\u5b57\u7b26\u4e32\u7684\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100309","title":"1\uff5en \u6574\u6570\u4e2d 1 \u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100310","title":"\u6570\u7ec4\u4e2d\u51fa\u73b0\u6b21\u6570\u8d85\u8fc7\u4e00\u534a\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100311","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100312","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 II","__typename":"AppliedTranslationNode"},{"questionId":"100313","title":"\u6570\u5b57\u5e8f\u5217\u4e2d\u67d0\u4e00\u4f4d\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100314","title":"\u4ece\u4e0a\u5230\u4e0b\u6253\u5370\u4e8c\u53c9\u6811 III","__typename":"AppliedTranslationNode"},{"questionId":"100315","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u540e\u5e8f\u904d\u5386\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100316","title":"\u7b2c\u4e00\u4e2a\u53ea\u51fa\u73b0\u4e00\u6b21\u7684\u5b57\u7b26","__typename":"AppliedTranslationNode"},{"questionId":"100317","title":"\u4e8c\u53c9\u6811\u4e2d\u548c\u4e3a\u67d0\u4e00\u503c\u7684\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"100318","title":"\u6570\u7ec4\u4e2d\u7684\u9006\u5e8f\u5bf9","__typename":"AppliedTranslationNode"},{"questionId":"100319","title":"\u4e8c\u53c9\u6811\u7684\u6df1\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"100320","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100321","title":"\u6570\u7ec4\u4e2d\u6570\u5b57\u51fa\u73b0\u7684\u6b21\u6570 II","__typename":"AppliedTranslationNode"},{"questionId":"100322","title":"\u548c\u4e3as\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100323","title":"\u628a\u6570\u7ec4\u6392\u6210\u6700\u5c0f\u7684\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100324","title":"\u548c\u4e3as\u7684\u8fde\u7eed\u6b63\u6570\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"100325","title":"\u628a\u6570\u5b57\u7ffb\u8bd1\u6210\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100326","title":"\u4e24\u4e2a\u94fe\u8868\u7684\u7b2c\u4e00\u4e2a\u516c\u5171\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100327","title":"\u793c\u7269\u7684\u6700\u5927\u4ef7\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100328","title":"\u7ffb\u8f6c\u5355\u8bcd\u987a\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"100329","title":"\u5728\u6392\u5e8f\u6570\u7ec4\u4e2d\u67e5\u627e\u6570\u5b57 I","__typename":"AppliedTranslationNode"},{"questionId":"100330","title":"\u5de6\u65cb\u8f6c\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100331","title":"0\uff5en-1\u4e2d\u7f3a\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100332","title":"\u6700\u957f\u4e0d\u542b\u91cd\u590d\u5b57\u7b26\u7684\u5b50\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"100333","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u7b2ck\u5927\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"100334","title":"\u4e11\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100335","title":"\u4e0d\u7528\u52a0\u51cf\u4e58\u9664\u505a\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"100336","title":"\u6ed1\u52a8\u7a97\u53e3\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100337","title":"\u961f\u5217\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100338","title":"\u6784\u5efa\u4e58\u79ef\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"100339","title":"n\u4e2a\u9ab0\u5b50\u7684\u70b9\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100340","title":"\u628a\u5b57\u7b26\u4e32\u8f6c\u6362\u6210\u6574\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100341","title":"\u6251\u514b\u724c\u4e2d\u7684\u987a\u5b50","__typename":"AppliedTranslationNode"},{"questionId":"100342","title":"\u5e73\u8861\u4e8c\u53c9\u6811","__typename":"AppliedTranslationNode"},{"questionId":"100343","title":"\u5706\u5708\u4e2d\u6700\u540e\u5269\u4e0b\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"100344","title":"\u80a1\u7968\u7684\u6700\u5927\u5229\u6da6","__typename":"AppliedTranslationNode"},{"questionId":"100345","title":"\u6c421+2+\u2026+n","__typename":"AppliedTranslationNode"},{"questionId":"100346","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100347","title":"\u4e8c\u53c9\u6811\u7684\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"100348","title":"\u6709\u91cd\u590d\u5b57\u7b26\u4e32\u7684\u6392\u5217\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"100349","title":"\u6700\u5927\u6570\u503c","__typename":"AppliedTranslationNode"},{"questionId":"100350","title":"\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100351","title":"\u751f\u5b58\u4eba\u6570","__typename":"AppliedTranslationNode"},{"questionId":"100352","title":"\u8df3\u6c34\u677f","__typename":"AppliedTranslationNode"},{"questionId":"100353","title":"\u5e73\u5206\u6b63\u65b9\u5f62","__typename":"AppliedTranslationNode"},{"questionId":"100354","title":"\u6700\u4f73\u76f4\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"100355","title":"\u73e0\u7391\u5999\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"100356","title":"\u90e8\u5206\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000001","title":"test-1","__typename":"AppliedTranslationNode"},{"questionId":"1000002","title":"\u627e\u51fa\u9690\u85cf\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000003","title":"\u8fde\u7eed\u6570\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000004","title":"\u6a21\u5f0f\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000005","title":"\u6c34\u57df\u5927\u5c0f","__typename":"AppliedTranslationNode"},{"questionId":"1000006","title":"\u4e00\u6b21\u7f16\u8f91","__typename":"AppliedTranslationNode"},{"questionId":"1000007","title":"\u8fd4\u56de\u5012\u6570\u7b2c k \u4e2a\u8282\u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000008","title":"\u5206\u5272\u94fe\u8868","__typename":"AppliedTranslationNode"},{"questionId":"1000009","title":"\u6c42\u548c\u8def\u5f84","__typename":"AppliedTranslationNode"},{"questionId":"1000010","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000011","title":"\u8ff7\u8def\u7684\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000012","title":"\u5408\u5e76\u6392\u5e8f\u7684\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000013","title":"\u5cf0\u4e0e\u8c37","__typename":"AppliedTranslationNode"},{"questionId":"1000015","title":"\u6c49\u8bfa\u5854\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000016","title":"\u6392\u5e8f\u77e9\u9635\u67e5\u627e","__typename":"AppliedTranslationNode"},{"questionId":"1000017","title":"\u9636\u4e58\u5c3e\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000018","title":"\u6574\u6570\u7684\u82f1\u8bed\u8868\u793a","__typename":"AppliedTranslationNode"},{"questionId":"1000019","title":"BiNode","__typename":"AppliedTranslationNode"},{"questionId":"1000020","title":"\u6062\u590d\u7a7a\u683c","__typename":"AppliedTranslationNode"},{"questionId":"1000021","title":"\u6700\u5c0fK\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000022","title":"\u6700\u957f\u5355\u8bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000023","title":"\u6309\u6469\u5e08","__typename":"AppliedTranslationNode"},{"questionId":"1000024","title":"\u591a\u6b21\u641c\u7d22","__typename":"AppliedTranslationNode"},{"questionId":"1000025","title":"\u4e0d\u7528\u52a0\u53f7\u7684\u52a0\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000026","title":"LRU \u7f13\u5b58","__typename":"AppliedTranslationNode"},{"questionId":"1000027","title":"\u8ba1\u7b97\u5668","__typename":"AppliedTranslationNode"},{"questionId":"1000028","title":"\u8fde\u7eed\u4e2d\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000029","title":"\u76f4\u65b9\u56fe\u7684\u6c34\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000030","title":"\u5355\u8bcd\u8f6c\u6362","__typename":"AppliedTranslationNode"},{"questionId":"1000031","title":"\u5e03\u5c14\u8fd0\u7b97","__typename":"AppliedTranslationNode"},{"questionId":"1000032","title":"\u6d88\u5931\u7684\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000033","title":" \u5b57\u6bcd\u4e0e\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000034","title":"2\u51fa\u73b0\u7684\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000035","title":"\u5a74\u513f\u540d\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000036","title":"\u9a6c\u620f\u56e2\u4eba\u5854","__typename":"AppliedTranslationNode"},{"questionId":"1000037","title":"\u7b2c k \u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000038","title":"\u4e3b\u8981\u5143\u7d20","__typename":"AppliedTranslationNode"},{"questionId":"1000039","title":"\u5355\u8bcd\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000040","title":"\u53d8\u4f4d\u8bcd\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000041","title":"\u6570\u5b57\u6d41\u7684\u79e9","__typename":"AppliedTranslationNode"},{"questionId":"1000042","title":"\u6570\u5bf9\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000043","title":"\u6700\u77ed\u8d85\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000044","title":"\u6d88\u5931\u7684\u4e24\u4e2a\u6570\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000045","title":"\u6700\u5927\u9ed1\u65b9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000046","title":"\u6700\u5927\u5b50\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000047","title":"T9\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000048","title":"\u4ea4\u6362\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000049","title":"\u5355\u8bcd\u77e9\u9635","__typename":"AppliedTranslationNode"},{"questionId":"1000050","title":"\u5170\u987f\u8682\u8681","__typename":"AppliedTranslationNode"},{"questionId":"1000051","title":"\u7a00\u758f\u76f8\u4f3c\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000055","title":"\u4e24\u6570\u4e4b\u548c II 3","__typename":"AppliedTranslationNode"},{"questionId":"1000056","title":"\u62ff\u786c\u5e01","__typename":"AppliedTranslationNode"},{"questionId":"1000057","title":"\u5267\u60c5\u89e6\u53d1\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000058","title":"\u9b54\u672f\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000059","title":"\u5207\u5206\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000060","title":"\u5377\u79ef\u795e\u7ecf\u7f51\u7edc","__typename":"AppliedTranslationNode"},{"questionId":"1000061","title":"\u7b49\u5f85\u65f6\u95f4","__typename":"AppliedTranslationNode"},{"questionId":"1000062","title":"\u4e8c\u53c9\u6811\u4efb\u52a1\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000063","title":"\u4f20\u9012\u4fe1\u606f","__typename":"AppliedTranslationNode"},{"questionId":"1000085","title":"\u6e38\u4e50\u56ed\u7684\u6e38\u89c8\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000086","title":"\u671f\u671b\u4e2a\u6570\u7edf\u8ba1","__typename":"AppliedTranslationNode"},{"questionId":"1000087","title":"\u5c0f\u5f20\u5237\u9898\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000088","title":"\u6e38\u4e50\u56ed\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000089","title":"\u4e8c\u53c9\u6811\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000090","title":"\u6700\u5c0f\u8df3\u8dc3\u6b21\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000091","title":"\u6700\u5c0f\u77e9\u5f62\u9762\u79ef","__typename":"AppliedTranslationNode"},{"questionId":"1000092","title":"\u4f1a\u8bae\u9009\u5740","__typename":"AppliedTranslationNode"},{"questionId":"1000093","title":"\u5bfb\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000095","title":"\u6570\u5b66\u5174\u8da3\u601d\u8003\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000096","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u7b2c\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000097","title":"\u6c42\u6570\u7ec4\u4e2d\u6bcf\u4e2a\u6570\u524d\u4e00\u6b21\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000098","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000099","title":"\u3010\u6807\u7a0b\u6709\u95ee\u9898\u3011\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000100","title":"\u6c42\u4e8c\u7ef4\u6570\u7ec4\u533a\u57df\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000101","title":"\u6dfb\u52a0\u6700\u5c11\u62ec\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000102","title":"\u524d\u4e00\u4e2a\u6392\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000103","title":"\u5224\u65ad\u4e8c\u53c9\u6811\u662f\u5426\u662f\u4e00\u4e2a\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000104","title":"\u5c06\u5806\u8f6c\u6362\u4e3a\u4e00\u7ef4\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000105","title":"\u67e5\u627e\u4e8c\u53c9\u641c\u7d22\u6811\u7684\u6700\u5927\u503c","__typename":"AppliedTranslationNode"},{"questionId":"1000106","title":"\u6811\u4e0a\u6700\u8fd1\u516c\u5171\u7956\u5148","__typename":"AppliedTranslationNode"},{"questionId":"1000107","title":"\u4e8c\u53c9\u6811\u4e0a\u4e24\u70b9\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000108","title":"\u5224\u65ad\u8fde\u901a\u56fe","__typename":"AppliedTranslationNode"},{"questionId":"1000109","title":"\u6700\u5c11\u7684\u64cd\u4f5c\u4f7f\u5c0f\u9547\u5b58\u5728\u6cd5\u5b98","__typename":"AppliedTranslationNode"},{"questionId":"1000110","title":"\u6709\u5e8f\u6570\u7ec4\u4e09\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000111","title":"\u4e8c\u53c9\u67e5\u627e\u6811\u4e2d\u7b2c K \u5c0f\u7684\u5143\u7d20 II","__typename":"AppliedTranslationNode"},{"questionId":"1000112","title":"\u4e8c\u53c9\u641c\u7d22\u6811\u6700\u540e\u51fa\u73b0\u7684\u4f4d\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000114","title":"\u5b9e\u73b0\u52a8\u6001\u6570\u7ec4","__typename":"AppliedTranslationNode"},{"questionId":"1000115","title":"\u4e58\u79ef\u6700\u5927\u5b50\u5e8f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000116","title":"\u5b9e\u73b0\u6808","__typename":"AppliedTranslationNode"},{"questionId":"1000117","title":"\u6811\u4e0a\u6700\u63a5\u8fd1\u7684\u4e24\u90e8\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000118","title":"\u7ea6\u745f\u592b\u73af\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000119","title":"\u8ba1\u7b97\u8282\u70b9\u7684\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000120","title":"\u6c42\u6570\u7ec4\u533a\u95f4\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000121","title":"\u6ed1\u52a8\u7a97\u53e3\u65b9\u5dee","__typename":"AppliedTranslationNode"},{"questionId":"1000122","title":"\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c II","__typename":"AppliedTranslationNode"},{"questionId":"1000123","title":"\u5408\u5e76 K \u4e2a\u6700\u5c0f\u5806","__typename":"AppliedTranslationNode"},{"questionId":"1000124","title":"\u5b9e\u73b0\u961f\u5217","__typename":"AppliedTranslationNode"},{"questionId":"1000125","title":"\u7b80\u5355\u8ba1\u7b97\u5668 V","__typename":"AppliedTranslationNode"},{"questionId":"1000126","title":"\u627e\u6570\u636e\u6d41\u7684\u4e2d\u4f4d\u6570II","__typename":"AppliedTranslationNode"},{"questionId":"1000127","title":"\u8d2a\u5403\u86c7","__typename":"AppliedTranslationNode"},{"questionId":"1000128","title":"hanhan \u4e24\u6570\u4e4b\u548c","__typename":"AppliedTranslationNode"},{"questionId":"1000129","title":"\u5957\u5708\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000130","title":"\u79cb\u53f6\u6536\u85cf\u96c6","__typename":"AppliedTranslationNode"},{"questionId":"1000131","title":"\u6570\u5b57\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000132","title":"\u5bfc\u822a\u88c5\u7f6e","__typename":"AppliedTranslationNode"},{"questionId":"1000133","title":"\u5feb\u901f\u516c\u4ea4","__typename":"AppliedTranslationNode"},{"questionId":"1000134","title":"\u8ffd\u9010\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000135","title":"\u79ef\u5206\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000136","title":"\u62bd\u5956\u6d3b\u52a8","__typename":"AppliedTranslationNode"},{"questionId":"1000137","title":"\u5927\u6570\u6c42\u4f59","__typename":"AppliedTranslationNode"},{"questionId":"1000138","title":"\u53e4\u8463\u952e\u76d8","__typename":"AppliedTranslationNode"},{"questionId":"1000139","title":"\u901f\u7b97\u673a\u5668\u4eba","__typename":"AppliedTranslationNode"},{"questionId":"1000140","title":"\u9ed1\u767d\u65b9\u683c\u753b","__typename":"AppliedTranslationNode"},{"questionId":"1000141","title":"\u6392\u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000142","title":"\u7334\u5b50\u6253\u5b57","__typename":"AppliedTranslationNode"},{"questionId":"1000143","title":"\u5bb6\u65cf\u5173\u7cfb","__typename":"AppliedTranslationNode"},{"questionId":"1000144","title":"\u9879\u76ee\u7ba1\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000145","title":"OCR\u8bc6\u522b","__typename":"AppliedTranslationNode"},{"questionId":"1000146","title":"\u65e9\u9910\u7ec4\u5408","__typename":"AppliedTranslationNode"},{"questionId":"1000147","title":"\u9ed1\u76d2\u5149\u7ebf\u53cd\u5c04","__typename":"AppliedTranslationNode"},{"questionId":"1000148","title":"\u98de\u8239\u68cb\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000149","title":"\u5206\u5272\u73af","__typename":"AppliedTranslationNode"},{"questionId":"1000150","title":"\u53e4\u8001\u7684\u6e38\u620f\u673a","__typename":"AppliedTranslationNode"},{"questionId":"1000151","title":"01 \u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000152","title":"\u6392\u5217\u5c0f\u7403","__typename":"AppliedTranslationNode"},{"questionId":"1000153","title":"\u82f1\u6587\u5355\u8bcd\u62fc\u5199\u7ea0\u9519\u63a8\u8350","__typename":"AppliedTranslationNode"},{"questionId":"1000154","title":"\u9b54\u6cd5\u6743\u6756\u5f3a\u5316","__typename":"AppliedTranslationNode"},{"questionId":"1000155","title":"\u706b\u8f66\u7f16\u7ec4\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000156","title":"\u6700\u4fbf\u5b9c\u7684\u673a\u7968","__typename":"AppliedTranslationNode"},{"questionId":"1000157","title":"\u5b85\u7537\u7684\u751f\u6d3b","__typename":"AppliedTranslationNode"},{"questionId":"1000158","title":"\u4ea4\u901a\u8f68\u8ff9\u5206\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000159","title":"\u7834\u8bd1\u5bc6\u7801","__typename":"AppliedTranslationNode"},{"questionId":"1000160","title":"DIST","__typename":"AppliedTranslationNode"},{"questionId":"1000161","title":"Hilbert \u66f2\u7ebf","__typename":"AppliedTranslationNode"},{"questionId":"1000162","title":"\u9879\u76ee\u5206\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000163","title":"\u7b97\u5f0f\u8f6c\u79fb","__typename":"AppliedTranslationNode"},{"questionId":"1000164","title":"\u5730\u7816\u67d3\u8272","__typename":"AppliedTranslationNode"},{"questionId":"1000166","title":"\u7b80\u5355\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000167","title":"\u591a\u6e90 D \u70b9","__typename":"AppliedTranslationNode"},{"questionId":"1000168","title":"\u5de5\u4eba\u8c03\u5ea6","__typename":"AppliedTranslationNode"},{"questionId":"1000169","title":"\u4e00\u5143\u4e00\u6b21\u65b9\u7a0b\u6c42\u6839","__typename":"AppliedTranslationNode"},{"questionId":"1000170","title":"\u5783\u573e\u5206\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000171","title":"\u91cd\u590d\u5b57\u7b26\u4e32\u91cd\u547d\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000172","title":"\u5192\u6ce1\u6392\u5e8f","__typename":"AppliedTranslationNode"},{"questionId":"1000173","title":"\u627e\u51fa\u6700\u957f\u5b57\u7b26\u4e32\u5e76\u8f93\u51fa","__typename":"AppliedTranslationNode"},{"questionId":"1000174","title":"\u8ba1\u7b97\u5b57\u7b26\u4e32\u4e2a\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000175","title":"\u63a5\u9a7e\u6700\u77ed\u8ddd\u79bb\u7b97\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000176","title":"\u51e0\u4f55\u9009\u62e9","__typename":"AppliedTranslationNode"},{"questionId":"1000177","title":"\u5207\u5272\u5b57\u7b26\u4e32","__typename":"AppliedTranslationNode"},{"questionId":"1000178","title":"\u5e8f\u5217\u79fb\u9664","__typename":"AppliedTranslationNode"},{"questionId":"1000179","title":"\u8bf7\u5b9e\u73b0\u51fd\u6570 parseQueryString","__typename":"AppliedTranslationNode"},{"questionId":"1000181","title":"\u8bf7\u5b9e\u73b0\u4e0b\u9762\u7684\u94fe\u5f0f\u8c03\u7528\u51fd\u6570\uff0c\u4ee5\u4f7f\u5176\u80fd\u591f\u5b9e\u73b0\u94fe\u5f0f\u8c03\u7528","__typename":"AppliedTranslationNode"},{"questionId":"1000182","title":"7. \u5316\u5b66\u516c\u5f0f\u89e3\u6790","__typename":"AppliedTranslationNode"},{"questionId":"1000183","title":"3. \u53e4\u751f\u7269\u8840\u7f18\u8fdc\u8fd1\u5224\u5b9a","__typename":"AppliedTranslationNode"},{"questionId":"1000184","title":"10. \u6570\u7ec4\u7ec4\u6210\u6700\u5927\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000185","title":"16. \u6700\u77ed\u79fb\u52a8\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000186","title":"2. \u53d1\u4e0b\u5348\u8336","__typename":"AppliedTranslationNode"},{"questionId":"1000187","title":"4. \u673a\u5668\u4eba\u8df3\u8dc3\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000188","title":"6. \u590f\u5b63\u7279\u60e0","__typename":"AppliedTranslationNode"},{"questionId":"1000189","title":"\u5c0f\u7f8e\u7684\u7528\u6237\u540d","__typename":"AppliedTranslationNode"},{"questionId":"1000190","title":"\u5c0f\u7f8e\u7684\u4ed3\u5e93\u6574\u7406","__typename":"AppliedTranslationNode"},{"questionId":"1000191","title":"\u5c0f\u7f8e\u7684\u8dd1\u817f\u4ee3\u8d2d","__typename":"AppliedTranslationNode"},{"questionId":"1000192","title":"\u5c0f\u56e2\u7684\u590d\u5236\u7c98\u8d34","__typename":"AppliedTranslationNode"},{"questionId":"1000193","title":"\u5c0f\u7f8e\u7684\u533a\u57df\u4f1a\u8bae","__typename":"AppliedTranslationNode"},{"questionId":"1000194","title":"\u5c0f\u56e2\u7684\u795e\u79d8\u6697\u53f7","__typename":"AppliedTranslationNode"},{"questionId":"1000195","title":"\u5c0f\u56e2\u7684\u9009\u8c03\u8ba1\u5212","__typename":"AppliedTranslationNode"},{"questionId":"1000196","title":"\u5c0f\u56e2\u65e0\u8def\u53ef\u9003","__typename":"AppliedTranslationNode"},{"questionId":"1000197","title":"\u5c0f\u56e2\u7684\u88c5\u9970\u7269","__typename":"AppliedTranslationNode"},{"questionId":"1000198","title":"\u5c0f\u56e2\u7684\u9ed8\u5951\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000199","title":"\u642d\u914d\u51fa\u552e","__typename":"AppliedTranslationNode"},{"questionId":"1000200","title":"\u5c0f\u7f8e\u7684\u4e66\u67b6","__typename":"AppliedTranslationNode"},{"questionId":"1000201","title":"\u504f\u7231\u5b57\u6bcd","__typename":"AppliedTranslationNode"},{"questionId":"1000202","title":"\u5c0f\u56e2\u7684 AB \u961f","__typename":"AppliedTranslationNode"},{"questionId":"1000203","title":"\u5341\u5b57\u8def\u53e3","__typename":"AppliedTranslationNode"},{"questionId":"1000204","title":"\u5b8c\u5168\u80cc\u5305\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000205","title":"\u6700\u8fd1\u7684\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000206","title":"5-sum","__typename":"AppliedTranslationNode"},{"questionId":"1000207","title":"\u5e8f\u5217\u8ddd\u79bb","__typename":"AppliedTranslationNode"},{"questionId":"1000208","title":"\u7f16\u8f91\u8ddd\u79bb II","__typename":"AppliedTranslationNode"},{"questionId":"1000209","title":"\u6700\u591a\u7684\u786c\u5e01\u6570\u91cf","__typename":"AppliedTranslationNode"},{"questionId":"1000210","title":"\u6700\u5c11\u7684\u786c\u5e01\u79cd\u7c7b","__typename":"AppliedTranslationNode"},{"questionId":"1000211","title":"\u5b50\u4e32\u5339\u914d","__typename":"AppliedTranslationNode"},{"questionId":"1000212","title":"\u5b50\u4e32\u5305\u542b\u95ee\u9898","__typename":"AppliedTranslationNode"},{"questionId":"1000213","title":"\u53d6\u5b9d","__typename":"AppliedTranslationNode"},{"questionId":"1000214","title":"\u6811\u7684\u5212\u5206","__typename":"AppliedTranslationNode"},{"questionId":"1000215","title":"\u91c7\u8d2d\u65b9\u6848","__typename":"AppliedTranslationNode"},{"questionId":"1000216","title":"\u4e50\u56e2\u7ad9\u4f4d","__typename":"AppliedTranslationNode"},{"questionId":"1000217","title":"\u7279\u6b8a\u4e8c\u8fdb\u5236\u8868\u793a\u6cd5","__typename":"AppliedTranslationNode"},{"questionId":"1000218","title":"\u53d8\u6362\u7684\u8ff7\u5bab","__typename":"AppliedTranslationNode"},{"questionId":"1000219","title":"\u6279\u91cf\u5904\u7406\u4efb\u52a1","__typename":"AppliedTranslationNode"},{"questionId":"1000220","title":"\u7535\u52a8\u8f66\u6e38\u57ce\u5e02","__typename":"AppliedTranslationNode"},{"questionId":"1000221","title":"\u84c4\u6c34","__typename":"AppliedTranslationNode"},{"questionId":"1000222","title":"\u6700\u591a\u724c\u7ec4\u6570","__typename":"AppliedTranslationNode"},{"questionId":"1000223","title":"\u5b88\u536b\u57ce\u5821","__typename":"AppliedTranslationNode"},{"questionId":"1000224","title":"\u9b54\u5854\u6e38\u620f","__typename":"AppliedTranslationNode"},{"questionId":"1000225","title":"\u4e0b\u8f7d\u63d2\u4ef6","__typename":"AppliedTranslationNode"},{"questionId":"1000226","title":"\u5b8c\u6210\u4e00\u534a\u9898\u76ee","__typename":"AppliedTranslationNode"},{"questionId":"1000227","title":"\u4e3b\u9898\u7a7a\u95f4","__typename":"AppliedTranslationNode"}]}}
\ No newline at end of file
diff --git a/Leetcode/leetcode/editor/cn/all.json b/Leetcode/leetcode/editor/cn/all.json
new file mode 100644
index 0000000..213e09e
--- /dev/null
+++ b/Leetcode/leetcode/editor/cn/all.json
@@ -0,0 +1 @@
+[{"articleLive":2,"formTitle":"[551]Student Attendance Record I","frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","title":"Student Attendance Record I","titleSlug":"student-attendance-record-i"},{"articleLive":2,"formTitle":"[1]Two Sum","frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"","title":"Two Sum","titleSlug":"two-sum"},{"articleLive":2,"formTitle":"[2]Add Two Numbers","frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"","title":"Add Two Numbers","titleSlug":"add-two-numbers"},{"articleLive":2,"formTitle":"[3]Longest Substring Without Repeating Characters","frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"","title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters"},{"articleLive":2,"formTitle":"[4]Median of Two Sorted Arrays","frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"","title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays"},{"articleLive":2,"formTitle":"[5]Longest Palindromic Substring","frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"","title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring"},{"articleLive":2,"formTitle":"[6]ZigZag Conversion","frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"","title":"ZigZag Conversion","titleSlug":"zigzag-conversion"},{"articleLive":2,"formTitle":"[7]Reverse Integer","frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"","title":"Reverse Integer","titleSlug":"reverse-integer"},{"articleLive":2,"formTitle":"[8]String to Integer (atoi)","frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi"},{"articleLive":2,"formTitle":"[9]Palindrome Number","frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","title":"Palindrome Number","titleSlug":"palindrome-number"},{"articleLive":2,"formTitle":"[10]Regular Expression Matching","frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","title":"Regular Expression Matching","titleSlug":"regular-expression-matching"},{"articleLive":2,"formTitle":"[11]Container With Most Water","frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"","title":"Container With Most Water","titleSlug":"container-with-most-water"},{"articleLive":2,"formTitle":"[12]Integer to Roman","frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","title":"Integer to Roman","titleSlug":"integer-to-roman"},{"articleLive":2,"formTitle":"[13]Roman to Integer","frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","title":"Roman to Integer","titleSlug":"roman-to-integer"},{"articleLive":2,"formTitle":"[14]Longest Common Prefix","frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","title":"Longest Common Prefix","titleSlug":"longest-common-prefix"},{"articleLive":2,"formTitle":"[15]3Sum","frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","title":"3Sum","titleSlug":"3sum"},{"articleLive":2,"formTitle":"[16]3Sum Closest","frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","title":"3Sum Closest","titleSlug":"3sum-closest"},{"articleLive":2,"formTitle":"[17]Letter Combinations of a Phone Number","frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number"},{"articleLive":2,"formTitle":"[18]4Sum","frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","title":"4Sum","titleSlug":"4sum"},{"articleLive":2,"formTitle":"[19]Remove Nth Node From End of List","frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"","title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list"},{"articleLive":2,"formTitle":"[20]Valid Parentheses","frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"","title":"Valid Parentheses","titleSlug":"valid-parentheses"},{"articleLive":2,"formTitle":"[21]Merge Two Sorted Lists","frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"","title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists"},{"articleLive":2,"formTitle":"[22]Generate Parentheses","frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","title":"Generate Parentheses","titleSlug":"generate-parentheses"},{"articleLive":2,"formTitle":"[23]Merge k Sorted Lists","frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"","title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists"},{"articleLive":2,"formTitle":"[24]Swap Nodes in Pairs","frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"","title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs"},{"articleLive":2,"formTitle":"[25]Reverse Nodes in k-Group","frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"","title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group"},{"articleLive":2,"formTitle":"[26]Remove Duplicates from Sorted Array","frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"","title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array"},{"articleLive":2,"formTitle":"[27]Remove Element","frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"","title":"Remove Element","titleSlug":"remove-element"},{"articleLive":2,"formTitle":"[28]Implement strStr()","frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"","title":"Implement strStr()","titleSlug":"implement-strstr"},{"articleLive":2,"formTitle":"[29]Divide Two Integers","frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","title":"Divide Two Integers","titleSlug":"divide-two-integers"},{"articleLive":2,"formTitle":"[30]Substring with Concatenation of All Words","frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"","title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words"},{"articleLive":2,"formTitle":"[31]Next Permutation","frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","title":"Next Permutation","titleSlug":"next-permutation"},{"articleLive":2,"formTitle":"[32]Longest Valid Parentheses","frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses"},{"articleLive":2,"formTitle":"[33]Search in Rotated Sorted Array","frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"","title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array"},{"articleLive":2,"formTitle":"[34]Find First and Last Position of Element in Sorted Array","frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"","title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"articleLive":2,"formTitle":"[35]Search Insert Position","frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","title":"Search Insert Position","titleSlug":"search-insert-position"},{"articleLive":2,"formTitle":"[36]Valid Sudoku","frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"","title":"Valid Sudoku","titleSlug":"valid-sudoku"},{"articleLive":2,"formTitle":"[37]Sudoku Solver","frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","title":"Sudoku Solver","titleSlug":"sudoku-solver"},{"articleLive":2,"formTitle":"[38]Count and Say","frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","title":"Count and Say","titleSlug":"count-and-say"},{"articleLive":2,"formTitle":"[39]Combination Sum","frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","title":"Combination Sum","titleSlug":"combination-sum"},{"articleLive":2,"formTitle":"[40]Combination Sum II","frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","title":"Combination Sum II","titleSlug":"combination-sum-ii"},{"articleLive":2,"formTitle":"[41]First Missing Positive","frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"","title":"First Missing Positive","titleSlug":"first-missing-positive"},{"articleLive":2,"formTitle":"[42]Trapping Rain Water","frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","title":"Trapping Rain Water","titleSlug":"trapping-rain-water"},{"articleLive":2,"formTitle":"[43]Multiply Strings","frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"","title":"Multiply Strings","titleSlug":"multiply-strings"},{"articleLive":2,"formTitle":"[44]Wildcard Matching","frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","title":"Wildcard Matching","titleSlug":"wildcard-matching"},{"articleLive":2,"formTitle":"[45]Jump Game II","frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"","title":"Jump Game II","titleSlug":"jump-game-ii"},{"articleLive":2,"formTitle":"[46]Permutations","frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","title":"Permutations","titleSlug":"permutations"},{"articleLive":2,"formTitle":"[47]Permutations II","frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"","title":"Permutations II","titleSlug":"permutations-ii"},{"articleLive":2,"formTitle":"[48]Rotate Image","frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","title":"Rotate Image","titleSlug":"rotate-image"},{"articleLive":2,"formTitle":"[49]Group Anagrams","frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","title":"Group Anagrams","titleSlug":"group-anagrams"},{"articleLive":2,"formTitle":"[50]Pow(x, n)","frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","title":"Pow(x, n)","titleSlug":"powx-n"},{"articleLive":2,"formTitle":"[51]N-Queens","frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","title":"N-Queens","titleSlug":"n-queens"},{"articleLive":2,"formTitle":"[52]N-Queens II","frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","title":"N-Queens II","titleSlug":"n-queens-ii"},{"articleLive":2,"formTitle":"[53]Maximum Subarray","frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","title":"Maximum Subarray","titleSlug":"maximum-subarray"},{"articleLive":2,"formTitle":"[54]Spiral Matrix","frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","title":"Spiral Matrix","titleSlug":"spiral-matrix"},{"articleLive":2,"formTitle":"[55]Jump Game","frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","title":"Jump Game","titleSlug":"jump-game"},{"articleLive":2,"formTitle":"[56]Merge Intervals","frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","title":"Merge Intervals","titleSlug":"merge-intervals"},{"articleLive":2,"formTitle":"[57]Insert Interval","frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","title":"Insert Interval","titleSlug":"insert-interval"},{"articleLive":2,"formTitle":"[58]Length of Last Word","frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","title":"Length of Last Word","titleSlug":"length-of-last-word"},{"articleLive":2,"formTitle":"[59]Spiral Matrix II","frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii"},{"articleLive":2,"formTitle":"[60]Permutation Sequence","frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","title":"Permutation Sequence","titleSlug":"permutation-sequence"},{"articleLive":2,"formTitle":"[61]Rotate List","frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"","title":"Rotate List","titleSlug":"rotate-list"},{"articleLive":2,"formTitle":"[62]Unique Paths","frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","title":"Unique Paths","titleSlug":"unique-paths"},{"articleLive":2,"formTitle":"[63]Unique Paths II","frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","title":"Unique Paths II","titleSlug":"unique-paths-ii"},{"articleLive":2,"formTitle":"[64]Minimum Path Sum","frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","title":"Minimum Path Sum","titleSlug":"minimum-path-sum"},{"articleLive":2,"formTitle":"[65]Valid Number","frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","title":"Valid Number","titleSlug":"valid-number"},{"articleLive":2,"formTitle":"[66]Plus One","frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"","title":"Plus One","titleSlug":"plus-one"},{"articleLive":2,"formTitle":"[67]Add Binary","frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","title":"Add Binary","titleSlug":"add-binary"},{"articleLive":2,"formTitle":"[68]Text Justification","frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","title":"Text Justification","titleSlug":"text-justification"},{"articleLive":2,"formTitle":"[69]Sqrt(x)","frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","title":"Sqrt(x)","titleSlug":"sqrtx"},{"articleLive":2,"formTitle":"[70]Climbing Stairs","frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","title":"Climbing Stairs","titleSlug":"climbing-stairs"},{"articleLive":2,"formTitle":"[71]Simplify Path","frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"","title":"Simplify Path","titleSlug":"simplify-path"},{"articleLive":2,"formTitle":"[72]Edit Distance","frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","title":"Edit Distance","titleSlug":"edit-distance"},{"articleLive":2,"formTitle":"[73]Set Matrix Zeroes","frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes"},{"articleLive":2,"formTitle":"[74]Search a 2D Matrix","frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix"},{"articleLive":2,"formTitle":"[75]Sort Colors","frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","title":"Sort Colors","titleSlug":"sort-colors"},{"articleLive":2,"formTitle":"[76]Minimum Window Substring","frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","title":"Minimum Window Substring","titleSlug":"minimum-window-substring"},{"articleLive":2,"formTitle":"[77]Combinations","frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","title":"Combinations","titleSlug":"combinations"},{"articleLive":2,"formTitle":"[78]Subsets","frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","title":"Subsets","titleSlug":"subsets"},{"articleLive":2,"formTitle":"[79]Word Search","frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","title":"Word Search","titleSlug":"word-search"},{"articleLive":2,"formTitle":"[80]Remove Duplicates from Sorted Array II","frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"","title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"articleLive":2,"formTitle":"[81]Search in Rotated Sorted Array II","frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"","title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii"},{"articleLive":2,"formTitle":"[82]Remove Duplicates from Sorted List II","frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"","title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"articleLive":2,"formTitle":"[83]Remove Duplicates from Sorted List","frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"","title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list"},{"articleLive":2,"formTitle":"[84]Largest Rectangle in Histogram","frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram"},{"articleLive":2,"formTitle":"[85]Maximal Rectangle","frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","title":"Maximal Rectangle","titleSlug":"maximal-rectangle"},{"articleLive":2,"formTitle":"[86]Partition List","frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"","title":"Partition List","titleSlug":"partition-list"},{"articleLive":2,"formTitle":"[87]Scramble String","frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"","title":"Scramble String","titleSlug":"scramble-string"},{"articleLive":2,"formTitle":"[88]Merge Sorted Array","frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"","title":"Merge Sorted Array","titleSlug":"merge-sorted-array"},{"articleLive":2,"formTitle":"[89]Gray Code","frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","title":"Gray Code","titleSlug":"gray-code"},{"articleLive":2,"formTitle":"[90]Subsets II","frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","title":"Subsets II","titleSlug":"subsets-ii"},{"articleLive":2,"formTitle":"[91]Decode Ways","frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"","title":"Decode Ways","titleSlug":"decode-ways"},{"articleLive":2,"formTitle":"[92]Reverse Linked List II","frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"","title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii"},{"articleLive":2,"formTitle":"[93]Restore IP Addresses","frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","title":"Restore IP Addresses","titleSlug":"restore-ip-addresses"},{"articleLive":2,"formTitle":"[94]Binary Tree Inorder Traversal","frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"","title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal"},{"articleLive":2,"formTitle":"[95]Unique Binary Search Trees II","frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii"},{"articleLive":2,"formTitle":"[96]Unique Binary Search Trees","frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees"},{"articleLive":2,"formTitle":"[97]Interleaving String","frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","title":"Interleaving String","titleSlug":"interleaving-string"},{"articleLive":2,"formTitle":"[98]Validate Binary Search Tree","frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree"},{"articleLive":2,"formTitle":"[99]Recover Binary Search Tree","frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree"},{"articleLive":2,"formTitle":"[100]Same Tree","frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","title":"Same Tree","titleSlug":"same-tree"},{"articleLive":2,"formTitle":"[101]Symmetric Tree","frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","title":"Symmetric Tree","titleSlug":"symmetric-tree"},{"articleLive":2,"formTitle":"[102]Binary Tree Level Order Traversal","frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal"},{"articleLive":2,"formTitle":"[103]Binary Tree Zigzag Level Order Traversal","frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"","title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"articleLive":2,"formTitle":"[104]Maximum Depth of Binary Tree","frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree"},{"articleLive":2,"formTitle":"[105]Construct Binary Tree from Preorder and Inorder Traversal","frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"articleLive":2,"formTitle":"[106]Construct Binary Tree from Inorder and Postorder Traversal","frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"articleLive":2,"formTitle":"[107]Binary Tree Level Order Traversal II","frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii"},{"articleLive":2,"formTitle":"[108]Convert Sorted Array to Binary Search Tree","frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"articleLive":2,"formTitle":"[109]Convert Sorted List to Binary Search Tree","frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"","title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"articleLive":2,"formTitle":"[110]Balanced Binary Tree","frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree"},{"articleLive":2,"formTitle":"[111]Minimum Depth of Binary Tree","frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree"},{"articleLive":2,"formTitle":"[112]Path Sum","frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","title":"Path Sum","titleSlug":"path-sum"},{"articleLive":2,"formTitle":"[113]Path Sum II","frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","title":"Path Sum II","titleSlug":"path-sum-ii"},{"articleLive":2,"formTitle":"[114]Flatten Binary Tree to Linked List","frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list"},{"articleLive":2,"formTitle":"[115]Distinct Subsequences","frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","title":"Distinct Subsequences","titleSlug":"distinct-subsequences"},{"articleLive":2,"formTitle":"[116]Populating Next Right Pointers in Each Node","frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node"},{"articleLive":2,"formTitle":"[117]Populating Next Right Pointers in Each Node II","frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"","title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"articleLive":2,"formTitle":"[118]Pascal's Triangle","frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","title":"Pascal's Triangle","titleSlug":"pascals-triangle"},{"articleLive":2,"formTitle":"[119]Pascal's Triangle II","frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"","title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii"},{"articleLive":2,"formTitle":"[120]Triangle","frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","title":"Triangle","titleSlug":"triangle"},{"articleLive":2,"formTitle":"[121]Best Time to Buy and Sell Stock","frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"","title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock"},{"articleLive":2,"formTitle":"[122]Best Time to Buy and Sell Stock II","frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"articleLive":2,"formTitle":"[123]Best Time to Buy and Sell Stock III","frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"articleLive":2,"formTitle":"[124]Binary Tree Maximum Path Sum","frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum"},{"articleLive":2,"formTitle":"[125]Valid Palindrome","frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","title":"Valid Palindrome","titleSlug":"valid-palindrome"},{"articleLive":2,"formTitle":"[126]Word Ladder II","frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","title":"Word Ladder II","titleSlug":"word-ladder-ii"},{"articleLive":2,"formTitle":"[127]Word Ladder","frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","title":"Word Ladder","titleSlug":"word-ladder"},{"articleLive":2,"formTitle":"[128]Longest Consecutive Sequence","frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence"},{"articleLive":2,"formTitle":"[129]Sum Root to Leaf Numbers","frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers"},{"articleLive":2,"formTitle":"[130]Surrounded Regions","frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","title":"Surrounded Regions","titleSlug":"surrounded-regions"},{"articleLive":2,"formTitle":"[131]Palindrome Partitioning","frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"},{"articleLive":2,"formTitle":"[132]Palindrome Partitioning II","frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii"},{"articleLive":2,"formTitle":"[133]Clone Graph","frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","title":"Clone Graph","titleSlug":"clone-graph"},{"articleLive":2,"formTitle":"[134]Gas Station","frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","title":"Gas Station","titleSlug":"gas-station"},{"articleLive":2,"formTitle":"[135]Candy","frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","title":"Candy","titleSlug":"candy"},{"articleLive":2,"formTitle":"[136]Single Number","frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","title":"Single Number","titleSlug":"single-number"},{"articleLive":2,"formTitle":"[137]Single Number II","frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","title":"Single Number II","titleSlug":"single-number-ii"},{"articleLive":2,"formTitle":"[138]Copy List with Random Pointer","frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"","title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer"},{"articleLive":2,"formTitle":"[139]Word Break","frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","title":"Word Break","titleSlug":"word-break"},{"articleLive":2,"formTitle":"[140]Word Break II","frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","title":"Word Break II","titleSlug":"word-break-ii"},{"articleLive":2,"formTitle":"[141]Linked List Cycle","frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"","title":"Linked List Cycle","titleSlug":"linked-list-cycle"},{"articleLive":2,"formTitle":"[142]Linked List Cycle II","frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"","title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii"},{"articleLive":2,"formTitle":"[143]Reorder List","frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"","title":"Reorder List","titleSlug":"reorder-list"},{"articleLive":2,"formTitle":"[144]Binary Tree Preorder Traversal","frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"","title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal"},{"articleLive":2,"formTitle":"[145]Binary Tree Postorder Traversal","frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"","title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal"},{"articleLive":2,"formTitle":"[146]LRU Cache","frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","title":"LRU Cache","titleSlug":"lru-cache"},{"articleLive":2,"formTitle":"[147]Insertion Sort List","frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"","title":"Insertion Sort List","titleSlug":"insertion-sort-list"},{"articleLive":2,"formTitle":"[148]Sort List","frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"","title":"Sort List","titleSlug":"sort-list"},{"articleLive":2,"formTitle":"[149]Max Points on a Line","frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","title":"Max Points on a Line","titleSlug":"max-points-on-a-line"},{"articleLive":2,"formTitle":"[150]Evaluate Reverse Polish Notation","frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"","title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation"},{"articleLive":2,"formTitle":"[151]Reverse Words in a String","frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string"},{"articleLive":2,"formTitle":"[152]Maximum Product Subarray","frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray"},{"articleLive":2,"formTitle":"[153]Find Minimum in Rotated Sorted Array","frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"","title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array"},{"articleLive":2,"formTitle":"[154]Find Minimum in Rotated Sorted Array II","frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"","title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"articleLive":2,"formTitle":"[155]Min Stack","frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"","title":"Min Stack","titleSlug":"min-stack"},{"articleLive":2,"formTitle":"[156]Binary Tree Upside Down","frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down"},{"articleLive":2,"formTitle":"[157]Read N Characters Given Read4","frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4"},{"articleLive":2,"formTitle":"[158]Read N Characters Given Read4 II - Call multiple times","frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","title":"Read N Characters Given Read4 II - Call multiple times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"articleLive":2,"formTitle":"[159]Longest Substring with At Most Two Distinct Characters","frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"articleLive":2,"formTitle":"[160]Intersection of Two Linked Lists","frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"","title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists"},{"articleLive":2,"formTitle":"[161]One Edit Distance","frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","title":"One Edit Distance","titleSlug":"one-edit-distance"},{"articleLive":2,"formTitle":"[162]Find Peak Element","frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","title":"Find Peak Element","titleSlug":"find-peak-element"},{"articleLive":2,"formTitle":"[163]Missing Ranges","frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","title":"Missing Ranges","titleSlug":"missing-ranges"},{"articleLive":2,"formTitle":"[164]Maximum Gap","frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","title":"Maximum Gap","titleSlug":"maximum-gap"},{"articleLive":2,"formTitle":"[165]Compare Version Numbers","frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","title":"Compare Version Numbers","titleSlug":"compare-version-numbers"},{"articleLive":2,"formTitle":"[166]Fraction to Recurring Decimal","frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal"},{"articleLive":2,"formTitle":"[167]Two Sum II - Input array is sorted","frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"","title":"Two Sum II - Input array is sorted","titleSlug":"two-sum-ii-input-array-is-sorted"},{"articleLive":2,"formTitle":"[168]Excel Sheet Column Title","frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title"},{"articleLive":2,"formTitle":"[169]Majority Element","frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","title":"Majority Element","titleSlug":"majority-element"},{"articleLive":2,"formTitle":"[170]Two Sum III - Data structure design","frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design"},{"articleLive":2,"formTitle":"[171]Excel Sheet Column Number","frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number"},{"articleLive":2,"formTitle":"[172]Factorial Trailing Zeroes","frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes"},{"articleLive":2,"formTitle":"[173]Binary Search Tree Iterator","frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"","title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator"},{"articleLive":2,"formTitle":"[174]Dungeon Game","frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","title":"Dungeon Game","titleSlug":"dungeon-game"},{"articleLive":2,"formTitle":"[175]Combine Two Tables","frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","title":"Combine Two Tables","titleSlug":"combine-two-tables"},{"articleLive":2,"formTitle":"[176]Second Highest Salary","frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","title":"Second Highest Salary","titleSlug":"second-highest-salary"},{"articleLive":2,"formTitle":"[177]Nth Highest Salary","frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","title":"Nth Highest Salary","titleSlug":"nth-highest-salary"},{"articleLive":2,"formTitle":"[178]Rank Scores","frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","title":"Rank Scores","titleSlug":"rank-scores"},{"articleLive":2,"formTitle":"[179]Largest Number","frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"","title":"Largest Number","titleSlug":"largest-number"},{"articleLive":2,"formTitle":"[180]Consecutive Numbers","frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","title":"Consecutive Numbers","titleSlug":"consecutive-numbers"},{"articleLive":2,"formTitle":"[181]Employees Earning More Than Their Managers","frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers"},{"articleLive":2,"formTitle":"[182]Duplicate Emails","frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","title":"Duplicate Emails","titleSlug":"duplicate-emails"},{"articleLive":2,"formTitle":"[183]Customers Who Never Order","frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","title":"Customers Who Never Order","titleSlug":"customers-who-never-order"},{"articleLive":2,"formTitle":"[184]Department Highest Salary","frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","title":"Department Highest Salary","titleSlug":"department-highest-salary"},{"articleLive":2,"formTitle":"[185]Department Top Three Salaries","frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries"},{"articleLive":2,"formTitle":"[186]Reverse Words in a String II","frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii"},{"articleLive":2,"formTitle":"[187]Repeated DNA Sequences","frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences"},{"articleLive":2,"formTitle":"[188]Best Time to Buy and Sell Stock IV","frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"articleLive":2,"formTitle":"[189]Rotate Array","frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","title":"Rotate Array","titleSlug":"rotate-array"},{"articleLive":2,"formTitle":"[190]Reverse Bits","frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","title":"Reverse Bits","titleSlug":"reverse-bits"},{"articleLive":2,"formTitle":"[191]Number of 1 Bits","frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","title":"Number of 1 Bits","titleSlug":"number-of-1-bits"},{"articleLive":2,"formTitle":"[192]Word Frequency","frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","title":"Word Frequency","titleSlug":"word-frequency"},{"articleLive":2,"formTitle":"[193]Valid Phone Numbers","frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers"},{"articleLive":2,"formTitle":"[194]Transpose File","frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","title":"Transpose File","titleSlug":"transpose-file"},{"articleLive":2,"formTitle":"[195]Tenth Line","frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","title":"Tenth Line","titleSlug":"tenth-line"},{"articleLive":2,"formTitle":"[196]Delete Duplicate Emails","frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails"},{"articleLive":2,"formTitle":"[197]Rising Temperature","frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","title":"Rising Temperature","titleSlug":"rising-temperature"},{"articleLive":2,"formTitle":"[198]House Robber","frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","title":"House Robber","titleSlug":"house-robber"},{"articleLive":2,"formTitle":"[199]Binary Tree Right Side View","frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view"},{"articleLive":2,"formTitle":"[200]Number of Islands","frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","title":"Number of Islands","titleSlug":"number-of-islands"},{"articleLive":2,"formTitle":"[201]Bitwise AND of Numbers Range","frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range"},{"articleLive":2,"formTitle":"[202]Happy Number","frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"","title":"Happy Number","titleSlug":"happy-number"},{"articleLive":2,"formTitle":"[203]Remove Linked List Elements","frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"","title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements"},{"articleLive":2,"formTitle":"[204]Count Primes","frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","title":"Count Primes","titleSlug":"count-primes"},{"articleLive":2,"formTitle":"[205]Isomorphic Strings","frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","title":"Isomorphic Strings","titleSlug":"isomorphic-strings"},{"articleLive":2,"formTitle":"[206]Reverse Linked List","frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"","title":"Reverse Linked List","titleSlug":"reverse-linked-list"},{"articleLive":2,"formTitle":"[207]Course Schedule","frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","title":"Course Schedule","titleSlug":"course-schedule"},{"articleLive":2,"formTitle":"[208]Implement Trie (Prefix Tree)","frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"","title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree"},{"articleLive":2,"formTitle":"[209]Minimum Size Subarray Sum","frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"","title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum"},{"articleLive":2,"formTitle":"[210]Course Schedule II","frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","title":"Course Schedule II","titleSlug":"course-schedule-ii"},{"articleLive":2,"formTitle":"[211]Design Add and Search Words Data Structure","frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure"},{"articleLive":2,"formTitle":"[212]Word Search II","frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","title":"Word Search II","titleSlug":"word-search-ii"},{"articleLive":2,"formTitle":"[213]House Robber II","frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"","title":"House Robber II","titleSlug":"house-robber-ii"},{"articleLive":2,"formTitle":"[214]Shortest Palindrome","frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","title":"Shortest Palindrome","titleSlug":"shortest-palindrome"},{"articleLive":2,"formTitle":"[215]Kth Largest Element in an Array","frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array"},{"articleLive":2,"formTitle":"[216]Combination Sum III","frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","title":"Combination Sum III","titleSlug":"combination-sum-iii"},{"articleLive":2,"formTitle":"[217]Contains Duplicate","frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","title":"Contains Duplicate","titleSlug":"contains-duplicate"},{"articleLive":2,"formTitle":"[218]The Skyline Problem","frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","title":"The Skyline Problem","titleSlug":"the-skyline-problem"},{"articleLive":2,"formTitle":"[219]Contains Duplicate II","frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii"},{"articleLive":2,"formTitle":"[220]Contains Duplicate III","frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"","title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii"},{"articleLive":2,"formTitle":"[221]Maximal Square","frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","title":"Maximal Square","titleSlug":"maximal-square"},{"articleLive":2,"formTitle":"[222]Count Complete Tree Nodes","frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes"},{"articleLive":2,"formTitle":"[223]Rectangle Area","frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","title":"Rectangle Area","titleSlug":"rectangle-area"},{"articleLive":2,"formTitle":"[224]Basic Calculator","frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","title":"Basic Calculator","titleSlug":"basic-calculator"},{"articleLive":2,"formTitle":"[225]Implement Stack using Queues","frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"","title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues"},{"articleLive":2,"formTitle":"[226]Invert Binary Tree","frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","title":"Invert Binary Tree","titleSlug":"invert-binary-tree"},{"articleLive":2,"formTitle":"[227]Basic Calculator II","frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","title":"Basic Calculator II","titleSlug":"basic-calculator-ii"},{"articleLive":2,"formTitle":"[228]Summary Ranges","frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","title":"Summary Ranges","titleSlug":"summary-ranges"},{"articleLive":2,"formTitle":"[229]Majority Element II","frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","title":"Majority Element II","titleSlug":"majority-element-ii"},{"articleLive":2,"formTitle":"[230]Kth Smallest Element in a BST","frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"","title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst"},{"articleLive":2,"formTitle":"[231]Power of Two","frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","title":"Power of Two","titleSlug":"power-of-two"},{"articleLive":2,"formTitle":"[232]Implement Queue using Stacks","frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"","title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks"},{"articleLive":2,"formTitle":"[233]Number of Digit One","frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","title":"Number of Digit One","titleSlug":"number-of-digit-one"},{"articleLive":2,"formTitle":"[234]Palindrome Linked List","frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"","title":"Palindrome Linked List","titleSlug":"palindrome-linked-list"},{"articleLive":2,"formTitle":"[235]Lowest Common Ancestor of a Binary Search Tree","frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"articleLive":2,"formTitle":"[236]Lowest Common Ancestor of a Binary Tree","frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"articleLive":2,"formTitle":"[237]Delete Node in a Linked List","frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"","title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list"},{"articleLive":2,"formTitle":"[238]Product of Array Except Self","frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","title":"Product of Array Except Self","titleSlug":"product-of-array-except-self"},{"articleLive":2,"formTitle":"[239]Sliding Window Maximum","frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum"},{"articleLive":2,"formTitle":"[240]Search a 2D Matrix II","frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii"},{"articleLive":2,"formTitle":"[241]Different Ways to Add Parentheses","frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses"},{"articleLive":2,"formTitle":"[242]Valid Anagram","frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","title":"Valid Anagram","titleSlug":"valid-anagram"},{"articleLive":2,"formTitle":"[243]Shortest Word Distance","frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","title":"Shortest Word Distance","titleSlug":"shortest-word-distance"},{"articleLive":2,"formTitle":"[244]Shortest Word Distance II","frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii"},{"articleLive":2,"formTitle":"[245]Shortest Word Distance III","frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii"},{"articleLive":2,"formTitle":"[246]Strobogrammatic Number","frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"},{"articleLive":2,"formTitle":"[247]Strobogrammatic Number II","frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii"},{"articleLive":2,"formTitle":"[248]Strobogrammatic Number III","frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii"},{"articleLive":2,"formTitle":"[249]Group Shifted Strings","frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","title":"Group Shifted Strings","titleSlug":"group-shifted-strings"},{"articleLive":2,"formTitle":"[250]Count Univalue Subtrees","frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees"},{"articleLive":2,"formTitle":"[251]Flatten 2D Vector","frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector"},{"articleLive":2,"formTitle":"[252]Meeting Rooms","frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","title":"Meeting Rooms","titleSlug":"meeting-rooms"},{"articleLive":2,"formTitle":"[253]Meeting Rooms II","frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii"},{"articleLive":2,"formTitle":"[254]Factor Combinations","frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","title":"Factor Combinations","titleSlug":"factor-combinations"},{"articleLive":2,"formTitle":"[255]Verify Preorder Sequence in Binary Search Tree","frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"articleLive":2,"formTitle":"[256]Paint House","frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","title":"Paint House","titleSlug":"paint-house"},{"articleLive":2,"formTitle":"[257]Binary Tree Paths","frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","title":"Binary Tree Paths","titleSlug":"binary-tree-paths"},{"articleLive":2,"formTitle":"[258]Add Digits","frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","title":"Add Digits","titleSlug":"add-digits"},{"articleLive":2,"formTitle":"[259]3Sum Smaller","frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","title":"3Sum Smaller","titleSlug":"3sum-smaller"},{"articleLive":2,"formTitle":"[260]Single Number III","frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","title":"Single Number III","titleSlug":"single-number-iii"},{"articleLive":2,"formTitle":"[261]Graph Valid Tree","frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","title":"Graph Valid Tree","titleSlug":"graph-valid-tree"},{"articleLive":2,"formTitle":"[262]Trips and Users","frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","title":"Trips and Users","titleSlug":"trips-and-users"},{"articleLive":2,"formTitle":"[263]Ugly Number","frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"","title":"Ugly Number","titleSlug":"ugly-number"},{"articleLive":2,"formTitle":"[264]Ugly Number II","frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","title":"Ugly Number II","titleSlug":"ugly-number-ii"},{"articleLive":2,"formTitle":"[265]Paint House II","frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","title":"Paint House II","titleSlug":"paint-house-ii"},{"articleLive":2,"formTitle":"[266]Palindrome Permutation","frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","title":"Palindrome Permutation","titleSlug":"palindrome-permutation"},{"articleLive":2,"formTitle":"[267]Palindrome Permutation II","frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii"},{"articleLive":2,"formTitle":"[268]Missing Number","frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","title":"Missing Number","titleSlug":"missing-number"},{"articleLive":2,"formTitle":"[269]Alien Dictionary","frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","title":"Alien Dictionary","titleSlug":"alien-dictionary"},{"articleLive":2,"formTitle":"[270]Closest Binary Search Tree Value","frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value"},{"articleLive":2,"formTitle":"[271]Encode and Decode Strings","frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings"},{"articleLive":2,"formTitle":"[272]Closest Binary Search Tree Value II","frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii"},{"articleLive":2,"formTitle":"[273]Integer to English Words","frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","title":"Integer to English Words","titleSlug":"integer-to-english-words"},{"articleLive":2,"formTitle":"[274]H-Index","frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","title":"H-Index","titleSlug":"h-index"},{"articleLive":2,"formTitle":"[275]H-Index II","frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","title":"H-Index II","titleSlug":"h-index-ii"},{"articleLive":2,"formTitle":"[276]Paint Fence","frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","title":"Paint Fence","titleSlug":"paint-fence"},{"articleLive":2,"formTitle":"[277]Find the Celebrity","frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","title":"Find the Celebrity","titleSlug":"find-the-celebrity"},{"articleLive":2,"formTitle":"[278]First Bad Version","frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","title":"First Bad Version","titleSlug":"first-bad-version"},{"articleLive":2,"formTitle":"[279]Perfect Squares","frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","title":"Perfect Squares","titleSlug":"perfect-squares"},{"articleLive":2,"formTitle":"[280]Wiggle Sort","frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","title":"Wiggle Sort","titleSlug":"wiggle-sort"},{"articleLive":2,"formTitle":"[281]Zigzag Iterator","frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","title":"Zigzag Iterator","titleSlug":"zigzag-iterator"},{"articleLive":2,"formTitle":"[282]Expression Add Operators","frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","title":"Expression Add Operators","titleSlug":"expression-add-operators"},{"articleLive":2,"formTitle":"[283]Move Zeroes","frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","title":"Move Zeroes","titleSlug":"move-zeroes"},{"articleLive":2,"formTitle":"[284]Peeking Iterator","frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","title":"Peeking Iterator","titleSlug":"peeking-iterator"},{"articleLive":2,"formTitle":"[285]Inorder Successor in BST","frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst"},{"articleLive":2,"formTitle":"[286]Walls and Gates","frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","title":"Walls and Gates","titleSlug":"walls-and-gates"},{"articleLive":2,"formTitle":"[287]Find the Duplicate Number","frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number"},{"articleLive":2,"formTitle":"[288]Unique Word Abbreviation","frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation"},{"articleLive":2,"formTitle":"[289]Game of Life","frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","title":"Game of Life","titleSlug":"game-of-life"},{"articleLive":2,"formTitle":"[290]Word Pattern","frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","title":"Word Pattern","titleSlug":"word-pattern"},{"articleLive":2,"formTitle":"[291]Word Pattern II","frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","title":"Word Pattern II","titleSlug":"word-pattern-ii"},{"articleLive":2,"formTitle":"[292]Nim Game","frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","title":"Nim Game","titleSlug":"nim-game"},{"articleLive":2,"formTitle":"[293]Flip Game","frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","title":"Flip Game","titleSlug":"flip-game"},{"articleLive":2,"formTitle":"[294]Flip Game II","frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","title":"Flip Game II","titleSlug":"flip-game-ii"},{"articleLive":2,"formTitle":"[295]Find Median from Data Stream","frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream"},{"articleLive":2,"formTitle":"[296]Best Meeting Point","frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","title":"Best Meeting Point","titleSlug":"best-meeting-point"},{"articleLive":2,"formTitle":"[297]Serialize and Deserialize Binary Tree","frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree"},{"articleLive":2,"formTitle":"[298]Binary Tree Longest Consecutive Sequence","frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence"},{"articleLive":2,"formTitle":"[299]Bulls and Cows","frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","title":"Bulls and Cows","titleSlug":"bulls-and-cows"},{"articleLive":2,"formTitle":"[300]Longest Increasing Subsequence","frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence"},{"articleLive":2,"formTitle":"[301]Remove Invalid Parentheses","frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses"},{"articleLive":2,"formTitle":"[302]Smallest Rectangle Enclosing Black Pixels","frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"articleLive":2,"formTitle":"[303]Range Sum Query - Immutable","frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable"},{"articleLive":2,"formTitle":"[304]Range Sum Query 2D - Immutable","frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable"},{"articleLive":2,"formTitle":"[305]Number of Islands II","frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","title":"Number of Islands II","titleSlug":"number-of-islands-ii"},{"articleLive":2,"formTitle":"[306]Additive Number","frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","title":"Additive Number","titleSlug":"additive-number"},{"articleLive":2,"formTitle":"[307]Range Sum Query - Mutable","frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"","title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable"},{"articleLive":2,"formTitle":"[308]Range Sum Query 2D - Mutable","frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable"},{"articleLive":2,"formTitle":"[309]Best Time to Buy and Sell Stock with Cooldown","frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"articleLive":2,"formTitle":"[310]Minimum Height Trees","frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","title":"Minimum Height Trees","titleSlug":"minimum-height-trees"},{"articleLive":2,"formTitle":"[311]Sparse Matrix Multiplication","frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication"},{"articleLive":2,"formTitle":"[312]Burst Balloons","frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","title":"Burst Balloons","titleSlug":"burst-balloons"},{"articleLive":2,"formTitle":"[313]Super Ugly Number","frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","title":"Super Ugly Number","titleSlug":"super-ugly-number"},{"articleLive":2,"formTitle":"[314]Binary Tree Vertical Order Traversal","frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal"},{"articleLive":2,"formTitle":"[315]Count of Smaller Numbers After Self","frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self"},{"articleLive":2,"formTitle":"[316]Remove Duplicate Letters","frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"","title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters"},{"articleLive":2,"formTitle":"[317]Shortest Distance from All Buildings","frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings"},{"articleLive":2,"formTitle":"[318]Maximum Product of Word Lengths","frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths"},{"articleLive":2,"formTitle":"[319]Bulb Switcher","frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","title":"Bulb Switcher","titleSlug":"bulb-switcher"},{"articleLive":2,"formTitle":"[320]Generalized Abbreviation","frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"},{"articleLive":2,"formTitle":"[321]Create Maximum Number","frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","title":"Create Maximum Number","titleSlug":"create-maximum-number"},{"articleLive":2,"formTitle":"[322]Coin Change","frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","title":"Coin Change","titleSlug":"coin-change"},{"articleLive":2,"formTitle":"[323]Number of Connected Components in an Undirected Graph","frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"articleLive":2,"formTitle":"[324]Wiggle Sort II","frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii"},{"articleLive":2,"formTitle":"[325]Maximum Size Subarray Sum Equals k","frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k"},{"articleLive":2,"formTitle":"[326]Power of Three","frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","title":"Power of Three","titleSlug":"power-of-three"},{"articleLive":2,"formTitle":"[327]Count of Range Sum","frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","title":"Count of Range Sum","titleSlug":"count-of-range-sum"},{"articleLive":2,"formTitle":"[328]Odd Even Linked List","frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"","title":"Odd Even Linked List","titleSlug":"odd-even-linked-list"},{"articleLive":2,"formTitle":"[329]Longest Increasing Path in a Matrix","frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix"},{"articleLive":2,"formTitle":"[330]Patching Array","frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","title":"Patching Array","titleSlug":"patching-array"},{"articleLive":2,"formTitle":"[331]Verify Preorder Serialization of a Binary Tree","frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"","title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"articleLive":2,"formTitle":"[332]Reconstruct Itinerary","frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"},{"articleLive":2,"formTitle":"[333]Largest BST Subtree","frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","title":"Largest BST Subtree","titleSlug":"largest-bst-subtree"},{"articleLive":2,"formTitle":"[334]Increasing Triplet Subsequence","frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence"},{"articleLive":2,"formTitle":"[335]Self Crossing","frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","title":"Self Crossing","titleSlug":"self-crossing"},{"articleLive":2,"formTitle":"[336]Palindrome Pairs","frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","title":"Palindrome Pairs","titleSlug":"palindrome-pairs"},{"articleLive":2,"formTitle":"[337]House Robber III","frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","title":"House Robber III","titleSlug":"house-robber-iii"},{"articleLive":2,"formTitle":"[338]Counting Bits","frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","title":"Counting Bits","titleSlug":"counting-bits"},{"articleLive":2,"formTitle":"[339]Nested List Weight Sum","frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum"},{"articleLive":2,"formTitle":"[340]Longest Substring with At Most K Distinct Characters","frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"articleLive":2,"formTitle":"[341]Flatten Nested List Iterator","frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"","title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator"},{"articleLive":2,"formTitle":"[342]Power of Four","frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","title":"Power of Four","titleSlug":"power-of-four"},{"articleLive":2,"formTitle":"[343]Integer Break","frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","title":"Integer Break","titleSlug":"integer-break"},{"articleLive":2,"formTitle":"[344]Reverse String","frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","title":"Reverse String","titleSlug":"reverse-string"},{"articleLive":2,"formTitle":"[345]Reverse Vowels of a String","frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"","title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string"},{"articleLive":2,"formTitle":"[346]Moving Average from Data Stream","frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream"},{"articleLive":2,"formTitle":"[347]Top K Frequent Elements","frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements"},{"articleLive":2,"formTitle":"[348]Design Tic-Tac-Toe","frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe"},{"articleLive":2,"formTitle":"[349]Intersection of Two Arrays","frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"","title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays"},{"articleLive":2,"formTitle":"[350]Intersection of Two Arrays II","frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"","title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii"},{"articleLive":2,"formTitle":"[351]Android Unlock Patterns","frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns"},{"articleLive":2,"formTitle":"[352]Data Stream as Disjoint Intervals","frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals"},{"articleLive":2,"formTitle":"[353]Design Snake Game","frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","title":"Design Snake Game","titleSlug":"design-snake-game"},{"articleLive":2,"formTitle":"[354]Russian Doll Envelopes","frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes"},{"articleLive":2,"formTitle":"[355]Design Twitter","frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","title":"Design Twitter","titleSlug":"design-twitter"},{"articleLive":2,"formTitle":"[356]Line Reflection","frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","title":"Line Reflection","titleSlug":"line-reflection"},{"articleLive":2,"formTitle":"[357]Count Numbers with Unique Digits","frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits"},{"articleLive":2,"formTitle":"[358]Rearrange String k Distance Apart","frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart"},{"articleLive":2,"formTitle":"[359]Logger Rate Limiter","frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter"},{"articleLive":2,"formTitle":"[360]Sort Transformed Array","frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","title":"Sort Transformed Array","titleSlug":"sort-transformed-array"},{"articleLive":2,"formTitle":"[361]Bomb Enemy","frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","title":"Bomb Enemy","titleSlug":"bomb-enemy"},{"articleLive":2,"formTitle":"[362]Design Hit Counter","frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","title":"Design Hit Counter","titleSlug":"design-hit-counter"},{"articleLive":2,"formTitle":"[363]Max Sum of Rectangle No Larger Than K","frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"","title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"articleLive":2,"formTitle":"[364]Nested List Weight Sum II","frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii"},{"articleLive":2,"formTitle":"[365]Water and Jug Problem","frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","title":"Water and Jug Problem","titleSlug":"water-and-jug-problem"},{"articleLive":2,"formTitle":"[366]Find Leaves of Binary Tree","frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree"},{"articleLive":2,"formTitle":"[367]Valid Perfect Square","frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","title":"Valid Perfect Square","titleSlug":"valid-perfect-square"},{"articleLive":2,"formTitle":"[368]Largest Divisible Subset","frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"","title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset"},{"articleLive":2,"formTitle":"[369]Plus One Linked List","frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","title":"Plus One Linked List","titleSlug":"plus-one-linked-list"},{"articleLive":2,"formTitle":"[370]Range Addition","frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","title":"Range Addition","titleSlug":"range-addition"},{"articleLive":2,"formTitle":"[371]Sum of Two Integers","frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"","title":"Sum of Two Integers","titleSlug":"sum-of-two-integers"},{"articleLive":2,"formTitle":"[372]Super Pow","frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","title":"Super Pow","titleSlug":"super-pow"},{"articleLive":2,"formTitle":"[373]Find K Pairs with Smallest Sums","frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums"},{"articleLive":2,"formTitle":"[374]Guess Number Higher or Lower","frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower"},{"articleLive":2,"formTitle":"[375]Guess Number Higher or Lower II","frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii"},{"articleLive":2,"formTitle":"[376]Wiggle Subsequence","frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"},{"articleLive":2,"formTitle":"[377]Combination Sum IV","frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"","title":"Combination Sum IV","titleSlug":"combination-sum-iv"},{"articleLive":2,"formTitle":"[378]Kth Smallest Element in a Sorted Matrix","frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"articleLive":2,"formTitle":"[379]Design Phone Directory","frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","title":"Design Phone Directory","titleSlug":"design-phone-directory"},{"articleLive":2,"formTitle":"[380]Insert Delete GetRandom O(1)","frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1"},{"articleLive":2,"formTitle":"[381]Insert Delete GetRandom O(1) - Duplicates allowed","frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"articleLive":2,"formTitle":"[382]Linked List Random Node","frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","title":"Linked List Random Node","titleSlug":"linked-list-random-node"},{"articleLive":2,"formTitle":"[383]Ransom Note","frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","title":"Ransom Note","titleSlug":"ransom-note"},{"articleLive":2,"formTitle":"[384]Shuffle an Array","frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","title":"Shuffle an Array","titleSlug":"shuffle-an-array"},{"articleLive":2,"formTitle":"[385]Mini Parser","frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"","title":"Mini Parser","titleSlug":"mini-parser"},{"articleLive":2,"formTitle":"[386]Lexicographical Numbers","frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"},{"articleLive":2,"formTitle":"[387]First Unique Character in a String","frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string"},{"articleLive":2,"formTitle":"[388]Longest Absolute File Path","frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path"},{"articleLive":2,"formTitle":"[389]Find the Difference","frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","title":"Find the Difference","titleSlug":"find-the-difference"},{"articleLive":2,"formTitle":"[390]Elimination Game","frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","title":"Elimination Game","titleSlug":"elimination-game"},{"articleLive":2,"formTitle":"[391]Perfect Rectangle","frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","title":"Perfect Rectangle","titleSlug":"perfect-rectangle"},{"articleLive":2,"formTitle":"[392]Is Subsequence","frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","title":"Is Subsequence","titleSlug":"is-subsequence"},{"articleLive":2,"formTitle":"[393]UTF-8 Validation","frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","title":"UTF-8 Validation","titleSlug":"utf-8-validation"},{"articleLive":2,"formTitle":"[394]Decode String","frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"","title":"Decode String","titleSlug":"decode-string"},{"articleLive":2,"formTitle":"[395]Longest Substring with At Least K Repeating Characters","frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"articleLive":2,"formTitle":"[396]Rotate Function","frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","title":"Rotate Function","titleSlug":"rotate-function"},{"articleLive":2,"formTitle":"[397]Integer Replacement","frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","title":"Integer Replacement","titleSlug":"integer-replacement"},{"articleLive":2,"formTitle":"[398]Random Pick Index","frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","title":"Random Pick Index","titleSlug":"random-pick-index"},{"articleLive":2,"formTitle":"[399]Evaluate Division","frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","title":"Evaluate Division","titleSlug":"evaluate-division"},{"articleLive":2,"formTitle":"[400]Nth Digit","frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","title":"Nth Digit","titleSlug":"nth-digit"},{"articleLive":2,"formTitle":"[401]Binary Watch","frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","title":"Binary Watch","titleSlug":"binary-watch"},{"articleLive":2,"formTitle":"[402]Remove K Digits","frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"","title":"Remove K Digits","titleSlug":"remove-k-digits"},{"articleLive":2,"formTitle":"[403]Frog Jump","frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"","title":"Frog Jump","titleSlug":"frog-jump"},{"articleLive":2,"formTitle":"[404]Sum of Left Leaves","frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"},{"articleLive":2,"formTitle":"[405]Convert a Number to Hexadecimal","frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"},{"articleLive":2,"formTitle":"[406]Queue Reconstruction by Height","frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"},{"articleLive":2,"formTitle":"[407]Trapping Rain Water II","frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"},{"articleLive":2,"formTitle":"[408]Valid Word Abbreviation","frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"},{"articleLive":2,"formTitle":"[409]Longest Palindrome","frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","title":"Longest Palindrome","titleSlug":"longest-palindrome"},{"articleLive":2,"formTitle":"[410]Split Array Largest Sum","frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"},{"articleLive":2,"formTitle":"[411]Minimum Unique Word Abbreviation","frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation"},{"articleLive":2,"formTitle":"[412]Fizz Buzz","frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"articleLive":2,"formTitle":"[413]Arithmetic Slices","frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","title":"Arithmetic Slices","titleSlug":"arithmetic-slices"},{"articleLive":2,"formTitle":"[414]Third Maximum Number","frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","title":"Third Maximum Number","titleSlug":"third-maximum-number"},{"articleLive":2,"formTitle":"[415]Add Strings","frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","title":"Add Strings","titleSlug":"add-strings"},{"articleLive":2,"formTitle":"[416]Partition Equal Subset Sum","frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum"},{"articleLive":2,"formTitle":"[417]Pacific Atlantic Water Flow","frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow"},{"articleLive":2,"formTitle":"[418]Sentence Screen Fitting","frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting"},{"articleLive":2,"formTitle":"[419]Battleships in a Board","frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","title":"Battleships in a Board","titleSlug":"battleships-in-a-board"},{"articleLive":2,"formTitle":"[420]Strong Password Checker","frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","title":"Strong Password Checker","titleSlug":"strong-password-checker"},{"articleLive":2,"formTitle":"[421]Maximum XOR of Two Numbers in an Array","frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"","title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"articleLive":2,"formTitle":"[422]Valid Word Square","frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","title":"Valid Word Square","titleSlug":"valid-word-square"},{"articleLive":2,"formTitle":"[423]Reconstruct Original Digits from English","frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english"},{"articleLive":2,"formTitle":"[424]Longest Repeating Character Replacement","frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement"},{"articleLive":2,"formTitle":"[425]Word Squares","frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","title":"Word Squares","titleSlug":"word-squares"},{"articleLive":2,"formTitle":"[426]Convert Binary Search Tree to Sorted Doubly Linked List","frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"articleLive":2,"formTitle":"[427]Construct Quad Tree","frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","title":"Construct Quad Tree","titleSlug":"construct-quad-tree"},{"articleLive":2,"formTitle":"[428]Serialize and Deserialize N-ary Tree","frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"articleLive":2,"formTitle":"[429]N-ary Tree Level Order Traversal","frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"","title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal"},{"articleLive":2,"formTitle":"[430]Flatten a Multilevel Doubly Linked List","frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"","title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"articleLive":2,"formTitle":"[431]Encode N-ary Tree to Binary Tree","frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"articleLive":2,"formTitle":"[432]All O`one Data Structure","frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","title":"All O`one Data Structure","titleSlug":"all-oone-data-structure"},{"articleLive":2,"formTitle":"[433]Minimum Genetic Mutation","frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation"},{"articleLive":2,"formTitle":"[434]Number of Segments in a String","frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string"},{"articleLive":2,"formTitle":"[435]Non-overlapping Intervals","frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals"},{"articleLive":2,"formTitle":"[436]Find Right Interval","frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","title":"Find Right Interval","titleSlug":"find-right-interval"},{"articleLive":2,"formTitle":"[437]Path Sum III","frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","title":"Path Sum III","titleSlug":"path-sum-iii"},{"articleLive":2,"formTitle":"[438]Find All Anagrams in a String","frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"","title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string"},{"articleLive":2,"formTitle":"[439]Ternary Expression Parser","frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser"},{"articleLive":2,"formTitle":"[440]K-th Smallest in Lexicographical Order","frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order"},{"articleLive":2,"formTitle":"[441]Arranging Coins","frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","title":"Arranging Coins","titleSlug":"arranging-coins"},{"articleLive":2,"formTitle":"[442]Find All Duplicates in an Array","frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array"},{"articleLive":2,"formTitle":"[443]String Compression","frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","title":"String Compression","titleSlug":"string-compression"},{"articleLive":2,"formTitle":"[444]Sequence Reconstruction","frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"},{"articleLive":2,"formTitle":"[445]Add Two Numbers II","frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"","title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii"},{"articleLive":2,"formTitle":"[446]Arithmetic Slices II - Subsequence","frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence"},{"articleLive":2,"formTitle":"[447]Number of Boomerangs","frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","title":"Number of Boomerangs","titleSlug":"number-of-boomerangs"},{"articleLive":2,"formTitle":"[448]Find All Numbers Disappeared in an Array","frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"articleLive":2,"formTitle":"[449]Serialize and Deserialize BST","frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst"},{"articleLive":2,"formTitle":"[450]Delete Node in a BST","frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst"},{"articleLive":2,"formTitle":"[451]Sort Characters By Frequency","frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"","title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency"},{"articleLive":2,"formTitle":"[452]Minimum Number of Arrows to Burst Balloons","frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"articleLive":2,"formTitle":"[453]Minimum Moves to Equal Array Elements","frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements"},{"articleLive":2,"formTitle":"[454]4Sum II","frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","title":"4Sum II","titleSlug":"4sum-ii"},{"articleLive":2,"formTitle":"[455]Assign Cookies","frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","title":"Assign Cookies","titleSlug":"assign-cookies"},{"articleLive":2,"formTitle":"[456]132 Pattern","frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"","title":"132 Pattern","titleSlug":"132-pattern"},{"articleLive":2,"formTitle":"[457]Circular Array Loop","frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","title":"Circular Array Loop","titleSlug":"circular-array-loop"},{"articleLive":2,"formTitle":"[458]Poor Pigs","frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","title":"Poor Pigs","titleSlug":"poor-pigs"},{"articleLive":2,"formTitle":"[459]Repeated Substring Pattern","frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern"},{"articleLive":2,"formTitle":"[460]LFU Cache","frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","title":"LFU Cache","titleSlug":"lfu-cache"},{"articleLive":2,"formTitle":"[461]Hamming Distance","frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","title":"Hamming Distance","titleSlug":"hamming-distance"},{"articleLive":2,"formTitle":"[462]Minimum Moves to Equal Array Elements II","frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"articleLive":2,"formTitle":"[463]Island Perimeter","frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","title":"Island Perimeter","titleSlug":"island-perimeter"},{"articleLive":2,"formTitle":"[464]Can I Win","frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","title":"Can I Win","titleSlug":"can-i-win"},{"articleLive":2,"formTitle":"[465]Optimal Account Balancing","frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing"},{"articleLive":2,"formTitle":"[466]Count The Repetitions","frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","title":"Count The Repetitions","titleSlug":"count-the-repetitions"},{"articleLive":2,"formTitle":"[467]Unique Substrings in Wraparound String","frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string"},{"articleLive":2,"formTitle":"[468]Validate IP Address","frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","title":"Validate IP Address","titleSlug":"validate-ip-address"},{"articleLive":2,"formTitle":"[469]Convex Polygon","frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","title":"Convex Polygon","titleSlug":"convex-polygon"},{"articleLive":2,"formTitle":"[470]Implement Rand10() Using Rand7()","frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7"},{"articleLive":2,"formTitle":"[471]Encode String with Shortest Length","frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length"},{"articleLive":2,"formTitle":"[472]Concatenated Words","frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","title":"Concatenated Words","titleSlug":"concatenated-words"},{"articleLive":2,"formTitle":"[473]Matchsticks to Square","frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","title":"Matchsticks to Square","titleSlug":"matchsticks-to-square"},{"articleLive":2,"formTitle":"[474]Ones and Zeroes","frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","title":"Ones and Zeroes","titleSlug":"ones-and-zeroes"},{"articleLive":2,"formTitle":"[475]Heaters","frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","title":"Heaters","titleSlug":"heaters"},{"articleLive":2,"formTitle":"[476]Number Complement","frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","title":"Number Complement","titleSlug":"number-complement"},{"articleLive":2,"formTitle":"[477]Total Hamming Distance","frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","title":"Total Hamming Distance","titleSlug":"total-hamming-distance"},{"articleLive":2,"formTitle":"[478]Generate Random Point in a Circle","frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle"},{"articleLive":2,"formTitle":"[479]Largest Palindrome Product","frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product"},{"articleLive":2,"formTitle":"[480]Sliding Window Median","frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","title":"Sliding Window Median","titleSlug":"sliding-window-median"},{"articleLive":2,"formTitle":"[481]Magical String","frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","title":"Magical String","titleSlug":"magical-string"},{"articleLive":2,"formTitle":"[482]License Key Formatting","frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","title":"License Key Formatting","titleSlug":"license-key-formatting"},{"articleLive":2,"formTitle":"[483]Smallest Good Base","frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","title":"Smallest Good Base","titleSlug":"smallest-good-base"},{"articleLive":2,"formTitle":"[484]Find Permutation","frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","title":"Find Permutation","titleSlug":"find-permutation"},{"articleLive":2,"formTitle":"[485]Max Consecutive Ones","frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones"},{"articleLive":2,"formTitle":"[486]Predict the Winner","frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","title":"Predict the Winner","titleSlug":"predict-the-winner"},{"articleLive":2,"formTitle":"[487]Max Consecutive Ones II","frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii"},{"articleLive":2,"formTitle":"[488]Zuma Game","frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","title":"Zuma Game","titleSlug":"zuma-game"},{"articleLive":2,"formTitle":"[489]Robot Room Cleaner","frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner"},{"articleLive":2,"formTitle":"[490]The Maze","frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","title":"The Maze","titleSlug":"the-maze"},{"articleLive":2,"formTitle":"[491]Increasing Subsequences","frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","title":"Increasing Subsequences","titleSlug":"increasing-subsequences"},{"articleLive":2,"formTitle":"[492]Construct the Rectangle","frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","title":"Construct the Rectangle","titleSlug":"construct-the-rectangle"},{"articleLive":2,"formTitle":"[493]Reverse Pairs","frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","title":"Reverse Pairs","titleSlug":"reverse-pairs"},{"articleLive":2,"formTitle":"[494]Target Sum","frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","title":"Target Sum","titleSlug":"target-sum"},{"articleLive":2,"formTitle":"[495]Teemo Attacking","frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","title":"Teemo Attacking","titleSlug":"teemo-attacking"},{"articleLive":2,"formTitle":"[496]Next Greater Element I","frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"","title":"Next Greater Element I","titleSlug":"next-greater-element-i"},{"articleLive":2,"formTitle":"[497]Random Point in Non-overlapping Rectangles","frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles"},{"articleLive":2,"formTitle":"[498]Diagonal Traverse","frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","title":"Diagonal Traverse","titleSlug":"diagonal-traverse"},{"articleLive":2,"formTitle":"[499]The Maze III","frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","title":"The Maze III","titleSlug":"the-maze-iii"},{"articleLive":2,"formTitle":"[500]Keyboard Row","frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","title":"Keyboard Row","titleSlug":"keyboard-row"},{"articleLive":2,"formTitle":"[501]Find Mode in Binary Search Tree","frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree"},{"articleLive":2,"formTitle":"[502]IPO","frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","title":"IPO","titleSlug":"ipo"},{"articleLive":2,"formTitle":"[503]Next Greater Element II","frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"","title":"Next Greater Element II","titleSlug":"next-greater-element-ii"},{"articleLive":2,"formTitle":"[504]Base 7","frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","title":"Base 7","titleSlug":"base-7"},{"articleLive":2,"formTitle":"[505]The Maze II","frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","title":"The Maze II","titleSlug":"the-maze-ii"},{"articleLive":2,"formTitle":"[506]Relative Ranks","frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","title":"Relative Ranks","titleSlug":"relative-ranks"},{"articleLive":2,"formTitle":"[507]Perfect Number","frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","title":"Perfect Number","titleSlug":"perfect-number"},{"articleLive":2,"formTitle":"[508]Most Frequent Subtree Sum","frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum"},{"articleLive":2,"formTitle":"[509]Fibonacci Number","frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","title":"Fibonacci Number","titleSlug":"fibonacci-number"},{"articleLive":2,"formTitle":"[510]Inorder Successor in BST II","frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii"},{"articleLive":2,"formTitle":"[511]Game Play Analysis I","frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","title":"Game Play Analysis I","titleSlug":"game-play-analysis-i"},{"articleLive":2,"formTitle":"[512]Game Play Analysis II","frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii"},{"articleLive":2,"formTitle":"[513]Find Bottom Left Tree Value","frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value"},{"articleLive":2,"formTitle":"[514]Freedom Trail","frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","title":"Freedom Trail","titleSlug":"freedom-trail"},{"articleLive":2,"formTitle":"[515]Find Largest Value in Each Tree Row","frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row"},{"articleLive":2,"formTitle":"[516]Longest Palindromic Subsequence","frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence"},{"articleLive":2,"formTitle":"[517]Super Washing Machines","frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","title":"Super Washing Machines","titleSlug":"super-washing-machines"},{"articleLive":2,"formTitle":"[518]Coin Change 2","frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","title":"Coin Change 2","titleSlug":"coin-change-2"},{"articleLive":2,"formTitle":"[519]Random Flip Matrix","frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","title":"Random Flip Matrix","titleSlug":"random-flip-matrix"},{"articleLive":2,"formTitle":"[520]Detect Capital","frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","title":"Detect Capital","titleSlug":"detect-capital"},{"articleLive":2,"formTitle":"[521]Longest Uncommon Subsequence I","frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i"},{"articleLive":2,"formTitle":"[522]Longest Uncommon Subsequence II","frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii"},{"articleLive":2,"formTitle":"[523]Continuous Subarray Sum","frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum"},{"articleLive":2,"formTitle":"[524]Longest Word in Dictionary through Deleting","frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting"},{"articleLive":2,"formTitle":"[525]Contiguous Array","frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","title":"Contiguous Array","titleSlug":"contiguous-array"},{"articleLive":2,"formTitle":"[526]Beautiful Arrangement","frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"},{"articleLive":2,"formTitle":"[527]Word Abbreviation","frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","title":"Word Abbreviation","titleSlug":"word-abbreviation"},{"articleLive":2,"formTitle":"[528]Random Pick with Weight","frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","title":"Random Pick with Weight","titleSlug":"random-pick-with-weight"},{"articleLive":2,"formTitle":"[529]Minesweeper","frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","title":"Minesweeper","titleSlug":"minesweeper"},{"articleLive":2,"formTitle":"[530]Minimum Absolute Difference in BST","frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst"},{"articleLive":2,"formTitle":"[531]Lonely Pixel I","frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","title":"Lonely Pixel I","titleSlug":"lonely-pixel-i"},{"articleLive":2,"formTitle":"[532]K-diff Pairs in an Array","frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array"},{"articleLive":2,"formTitle":"[533]Lonely Pixel II","frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii"},{"articleLive":2,"formTitle":"[534]Game Play Analysis III","frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii"},{"articleLive":2,"formTitle":"[535]Encode and Decode TinyURL","frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl"},{"articleLive":2,"formTitle":"[536]Construct Binary Tree from String","frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string"},{"articleLive":2,"formTitle":"[537]Complex Number Multiplication","frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication"},{"articleLive":2,"formTitle":"[538]Convert BST to Greater Tree","frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree"},{"articleLive":2,"formTitle":"[539]Minimum Time Difference","frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","title":"Minimum Time Difference","titleSlug":"minimum-time-difference"},{"articleLive":2,"formTitle":"[540]Single Element in a Sorted Array","frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array"},{"articleLive":2,"formTitle":"[541]Reverse String II","frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","title":"Reverse String II","titleSlug":"reverse-string-ii"},{"articleLive":2,"formTitle":"[542]01 Matrix","frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","title":"01 Matrix","titleSlug":"01-matrix"},{"articleLive":2,"formTitle":"[543]Diameter of Binary Tree","frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree"},{"articleLive":2,"formTitle":"[544]Output Contest Matches","frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","title":"Output Contest Matches","titleSlug":"output-contest-matches"},{"articleLive":2,"formTitle":"[545]Boundary of Binary Tree","frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree"},{"articleLive":2,"formTitle":"[546]Remove Boxes","frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","title":"Remove Boxes","titleSlug":"remove-boxes"},{"articleLive":2,"formTitle":"[547]Number of Provinces","frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","title":"Number of Provinces","titleSlug":"number-of-provinces"},{"articleLive":2,"formTitle":"[548]Split Array with Equal Sum","frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum"},{"articleLive":2,"formTitle":"[549]Binary Tree Longest Consecutive Sequence II","frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"articleLive":2,"formTitle":"[550]Game Play Analysis IV","frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv"},{"articleLive":2,"formTitle":"[552]Student Attendance Record II","frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii"},{"articleLive":2,"formTitle":"[553]Optimal Division","frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","title":"Optimal Division","titleSlug":"optimal-division"},{"articleLive":2,"formTitle":"[554]Brick Wall","frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","title":"Brick Wall","titleSlug":"brick-wall"},{"articleLive":2,"formTitle":"[555]Split Concatenated Strings","frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings"},{"articleLive":2,"formTitle":"[556]Next Greater Element III","frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","title":"Next Greater Element III","titleSlug":"next-greater-element-iii"},{"articleLive":2,"formTitle":"[557]Reverse Words in a String III","frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii"},{"articleLive":2,"formTitle":"[558]Logical OR of Two Binary Grids Represented as Quad-Trees","frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"articleLive":2,"formTitle":"[559]Maximum Depth of N-ary Tree","frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree"},{"articleLive":2,"formTitle":"[560]Subarray Sum Equals K","frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k"},{"articleLive":2,"formTitle":"[561]Array Partition I","frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","title":"Array Partition I","titleSlug":"array-partition-i"},{"articleLive":2,"formTitle":"[562]Longest Line of Consecutive One in Matrix","frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"articleLive":2,"formTitle":"[563]Binary Tree Tilt","frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt"},{"articleLive":2,"formTitle":"[564]Find the Closest Palindrome","frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome"},{"articleLive":2,"formTitle":"[565]Array Nesting","frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","title":"Array Nesting","titleSlug":"array-nesting"},{"articleLive":2,"formTitle":"[566]Reshape the Matrix","frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","title":"Reshape the Matrix","titleSlug":"reshape-the-matrix"},{"articleLive":2,"formTitle":"[567]Permutation in String","frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"","title":"Permutation in String","titleSlug":"permutation-in-string"},{"articleLive":2,"formTitle":"[568]Maximum Vacation Days","frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days"},{"articleLive":2,"formTitle":"[569]Median Employee Salary","frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","title":"Median Employee Salary","titleSlug":"median-employee-salary"},{"articleLive":2,"formTitle":"[570]Managers with at Least 5 Direct Reports","frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports"},{"articleLive":2,"formTitle":"[571]Find Median Given Frequency of Numbers","frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers"},{"articleLive":2,"formTitle":"[572]Subtree of Another Tree","frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree"},{"articleLive":2,"formTitle":"[573]Squirrel Simulation","frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","title":"Squirrel Simulation","titleSlug":"squirrel-simulation"},{"articleLive":2,"formTitle":"[574]Winning Candidate","frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","title":"Winning Candidate","titleSlug":"winning-candidate"},{"articleLive":2,"formTitle":"[575]Distribute Candies","frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","title":"Distribute Candies","titleSlug":"distribute-candies"},{"articleLive":2,"formTitle":"[576]Out of Boundary Paths","frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths"},{"articleLive":2,"formTitle":"[577]Employee Bonus","frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","title":"Employee Bonus","titleSlug":"employee-bonus"},{"articleLive":2,"formTitle":"[578]Get Highest Answer Rate Question","frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question"},{"articleLive":2,"formTitle":"[579]Find Cumulative Salary of an Employee","frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee"},{"articleLive":2,"formTitle":"[580]Count Student Number in Departments","frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments"},{"articleLive":2,"formTitle":"[581]Shortest Unsorted Continuous Subarray","frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"","title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray"},{"articleLive":2,"formTitle":"[582]Kill Process","frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","title":"Kill Process","titleSlug":"kill-process"},{"articleLive":2,"formTitle":"[583]Delete Operation for Two Strings","frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings"},{"articleLive":2,"formTitle":"[584]Find Customer Referee","frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","title":"Find Customer Referee","titleSlug":"find-customer-referee"},{"articleLive":2,"formTitle":"[585]Investments in 2016","frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","title":"Investments in 2016","titleSlug":"investments-in-2016"},{"articleLive":2,"formTitle":"[586]Customer Placing the Largest Number of Orders","frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders"},{"articleLive":2,"formTitle":"[587]Erect the Fence","frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","title":"Erect the Fence","titleSlug":"erect-the-fence"},{"articleLive":2,"formTitle":"[588]Design In-Memory File System","frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system"},{"articleLive":2,"formTitle":"[589]N-ary Tree Preorder Traversal","frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal"},{"articleLive":2,"formTitle":"[590]N-ary Tree Postorder Traversal","frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal"},{"articleLive":2,"formTitle":"[591]Tag Validator","frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","title":"Tag Validator","titleSlug":"tag-validator"},{"articleLive":2,"formTitle":"[592]Fraction Addition and Subtraction","frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction"},{"articleLive":2,"formTitle":"[593]Valid Square","frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","title":"Valid Square","titleSlug":"valid-square"},{"articleLive":2,"formTitle":"[594]Longest Harmonious Subsequence","frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence"},{"articleLive":2,"formTitle":"[595]Big Countries","frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","title":"Big Countries","titleSlug":"big-countries"},{"articleLive":2,"formTitle":"[596]Classes More Than 5 Students","frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","title":"Classes More Than 5 Students","titleSlug":"classes-more-than-5-students"},{"articleLive":2,"formTitle":"[597]Friend Requests I: Overall Acceptance Rate","frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"articleLive":2,"formTitle":"[598]Range Addition II","frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","title":"Range Addition II","titleSlug":"range-addition-ii"},{"articleLive":2,"formTitle":"[599]Minimum Index Sum of Two Lists","frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists"},{"articleLive":2,"formTitle":"[600]Non-negative Integers without Consecutive Ones","frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones"},{"articleLive":2,"formTitle":"[601]Human Traffic of Stadium","frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium"},{"articleLive":2,"formTitle":"[602]Friend Requests II: Who Has the Most Friends","frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"articleLive":2,"formTitle":"[603]Consecutive Available Seats","frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats"},{"articleLive":2,"formTitle":"[604]Design Compressed String Iterator","frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator"},{"articleLive":2,"formTitle":"[605]Can Place Flowers","frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","title":"Can Place Flowers","titleSlug":"can-place-flowers"},{"articleLive":2,"formTitle":"[606]Construct String from Binary Tree","frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree"},{"articleLive":2,"formTitle":"[607]Sales Person","frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","title":"Sales Person","titleSlug":"sales-person"},{"articleLive":2,"formTitle":"[608]Tree Node","frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","title":"Tree Node","titleSlug":"tree-node"},{"articleLive":2,"formTitle":"[609]Find Duplicate File in System","frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system"},{"articleLive":2,"formTitle":"[610]Triangle Judgement","frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","title":"Triangle Judgement","titleSlug":"triangle-judgement"},{"articleLive":2,"formTitle":"[611]Valid Triangle Number","frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","title":"Valid Triangle Number","titleSlug":"valid-triangle-number"},{"articleLive":2,"formTitle":"[612]Shortest Distance in a Plane","frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane"},{"articleLive":2,"formTitle":"[613]Shortest Distance in a Line","frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line"},{"articleLive":2,"formTitle":"[614]Second Degree Follower","frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","title":"Second Degree Follower","titleSlug":"second-degree-follower"},{"articleLive":2,"formTitle":"[615]Average Salary: Departments VS Company","frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company"},{"articleLive":2,"formTitle":"[616]Add Bold Tag in String","frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string"},{"articleLive":2,"formTitle":"[617]Merge Two Binary Trees","frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees"},{"articleLive":2,"formTitle":"[618]Students Report By Geography","frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","title":"Students Report By Geography","titleSlug":"students-report-by-geography"},{"articleLive":2,"formTitle":"[619]Biggest Single Number","frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","title":"Biggest Single Number","titleSlug":"biggest-single-number"},{"articleLive":2,"formTitle":"[620]Not Boring Movies","frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","title":"Not Boring Movies","titleSlug":"not-boring-movies"},{"articleLive":2,"formTitle":"[621]Task Scheduler","frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","title":"Task Scheduler","titleSlug":"task-scheduler"},{"articleLive":2,"formTitle":"[622]Design Circular Queue","frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","title":"Design Circular Queue","titleSlug":"design-circular-queue"},{"articleLive":2,"formTitle":"[623]Add One Row to Tree","frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree"},{"articleLive":2,"formTitle":"[624]Maximum Distance in Arrays","frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays"},{"articleLive":2,"formTitle":"[625]Minimum Factorization","frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","title":"Minimum Factorization","titleSlug":"minimum-factorization"},{"articleLive":2,"formTitle":"[626]Exchange Seats","frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","title":"Exchange Seats","titleSlug":"exchange-seats"},{"articleLive":2,"formTitle":"[627]Swap Salary","frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","title":"Swap Salary","titleSlug":"swap-salary"},{"articleLive":2,"formTitle":"[628]Maximum Product of Three Numbers","frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"","title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers"},{"articleLive":2,"formTitle":"[629]K Inverse Pairs Array","frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array"},{"articleLive":2,"formTitle":"[630]Course Schedule III","frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","title":"Course Schedule III","titleSlug":"course-schedule-iii"},{"articleLive":2,"formTitle":"[631]Design Excel Sum Formula","frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula"},{"articleLive":2,"formTitle":"[632]Smallest Range Covering Elements from K Lists","frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"articleLive":2,"formTitle":"[633]Sum of Square Numbers","frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"","title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers"},{"articleLive":2,"formTitle":"[634]Find the Derangement of An Array","frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array"},{"articleLive":2,"formTitle":"[635]Design Log Storage System","frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","title":"Design Log Storage System","titleSlug":"design-log-storage-system"},{"articleLive":2,"formTitle":"[636]Exclusive Time of Functions","frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"","title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions"},{"articleLive":2,"formTitle":"[637]Average of Levels in Binary Tree","frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree"},{"articleLive":2,"formTitle":"[638]Shopping Offers","frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","title":"Shopping Offers","titleSlug":"shopping-offers"},{"articleLive":2,"formTitle":"[639]Decode Ways II","frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","title":"Decode Ways II","titleSlug":"decode-ways-ii"},{"articleLive":2,"formTitle":"[640]Solve the Equation","frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","title":"Solve the Equation","titleSlug":"solve-the-equation"},{"articleLive":2,"formTitle":"[641]Design Circular Deque","frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","title":"Design Circular Deque","titleSlug":"design-circular-deque"},{"articleLive":2,"formTitle":"[642]Design Search Autocomplete System","frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system"},{"articleLive":2,"formTitle":"[643]Maximum Average Subarray I","frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i"},{"articleLive":2,"formTitle":"[644]Maximum Average Subarray II","frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii"},{"articleLive":2,"formTitle":"[645]Set Mismatch","frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","title":"Set Mismatch","titleSlug":"set-mismatch"},{"articleLive":2,"formTitle":"[646]Maximum Length of Pair Chain","frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain"},{"articleLive":2,"formTitle":"[647]Palindromic Substrings","frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","title":"Palindromic Substrings","titleSlug":"palindromic-substrings"},{"articleLive":2,"formTitle":"[648]Replace Words","frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","title":"Replace Words","titleSlug":"replace-words"},{"articleLive":2,"formTitle":"[649]Dota2 Senate","frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","title":"Dota2 Senate","titleSlug":"dota2-senate"},{"articleLive":2,"formTitle":"[650]2 Keys Keyboard","frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard"},{"articleLive":2,"formTitle":"[651]4 Keys Keyboard","frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard"},{"articleLive":2,"formTitle":"[652]Find Duplicate Subtrees","frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees"},{"articleLive":2,"formTitle":"[653]Two Sum IV - Input is a BST","frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"articleLive":2,"formTitle":"[654]Maximum Binary Tree","frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree"},{"articleLive":2,"formTitle":"[655]Print Binary Tree","frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","title":"Print Binary Tree","titleSlug":"print-binary-tree"},{"articleLive":2,"formTitle":"[656]Coin Path","frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","title":"Coin Path","titleSlug":"coin-path"},{"articleLive":2,"formTitle":"[657]Robot Return to Origin","frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","title":"Robot Return to Origin","titleSlug":"robot-return-to-origin"},{"articleLive":2,"formTitle":"[658]Find K Closest Elements","frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","title":"Find K Closest Elements","titleSlug":"find-k-closest-elements"},{"articleLive":2,"formTitle":"[659]Split Array into Consecutive Subsequences","frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences"},{"articleLive":2,"formTitle":"[660]Remove 9","frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","title":"Remove 9","titleSlug":"remove-9"},{"articleLive":2,"formTitle":"[661]Image Smoother","frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","title":"Image Smoother","titleSlug":"image-smoother"},{"articleLive":2,"formTitle":"[662]Maximum Width of Binary Tree","frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree"},{"articleLive":2,"formTitle":"[663]Equal Tree Partition","frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","title":"Equal Tree Partition","titleSlug":"equal-tree-partition"},{"articleLive":2,"formTitle":"[664]Strange Printer","frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","title":"Strange Printer","titleSlug":"strange-printer"},{"articleLive":2,"formTitle":"[665]Non-decreasing Array","frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","title":"Non-decreasing Array","titleSlug":"non-decreasing-array"},{"articleLive":2,"formTitle":"[666]Path Sum IV","frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","title":"Path Sum IV","titleSlug":"path-sum-iv"},{"articleLive":2,"formTitle":"[667]Beautiful Arrangement II","frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii"},{"articleLive":2,"formTitle":"[668]Kth Smallest Number in Multiplication Table","frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table"},{"articleLive":2,"formTitle":"[669]Trim a Binary Search Tree","frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree"},{"articleLive":2,"formTitle":"[670]Maximum Swap","frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","title":"Maximum Swap","titleSlug":"maximum-swap"},{"articleLive":2,"formTitle":"[671]Second Minimum Node In a Binary Tree","frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"","title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree"},{"articleLive":2,"formTitle":"[672]Bulb Switcher II","frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii"},{"articleLive":2,"formTitle":"[673]Number of Longest Increasing Subsequence","frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence"},{"articleLive":2,"formTitle":"[674]Longest Continuous Increasing Subsequence","frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence"},{"articleLive":2,"formTitle":"[675]Cut Off Trees for Golf Event","frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event"},{"articleLive":2,"formTitle":"[676]Implement Magic Dictionary","frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary"},{"articleLive":2,"formTitle":"[677]Map Sum Pairs","frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","title":"Map Sum Pairs","titleSlug":"map-sum-pairs"},{"articleLive":2,"formTitle":"[678]Valid Parenthesis String","frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string"},{"articleLive":2,"formTitle":"[679]24 Game","frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","title":"24 Game","titleSlug":"24-game"},{"articleLive":2,"formTitle":"[680]Valid Palindrome II","frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii"},{"articleLive":2,"formTitle":"[681]Next Closest Time","frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","title":"Next Closest Time","titleSlug":"next-closest-time"},{"articleLive":2,"formTitle":"[682]Baseball Game","frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"","title":"Baseball Game","titleSlug":"baseball-game"},{"articleLive":2,"formTitle":"[683]K Empty Slots","frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","title":"K Empty Slots","titleSlug":"k-empty-slots"},{"articleLive":2,"formTitle":"[684]Redundant Connection","frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","title":"Redundant Connection","titleSlug":"redundant-connection"},{"articleLive":2,"formTitle":"[685]Redundant Connection II","frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","title":"Redundant Connection II","titleSlug":"redundant-connection-ii"},{"articleLive":2,"formTitle":"[686]Repeated String Match","frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","title":"Repeated String Match","titleSlug":"repeated-string-match"},{"articleLive":2,"formTitle":"[687]Longest Univalue Path","frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","title":"Longest Univalue Path","titleSlug":"longest-univalue-path"},{"articleLive":2,"formTitle":"[688]Knight Probability in Chessboard","frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard"},{"articleLive":2,"formTitle":"[689]Maximum Sum of 3 Non-Overlapping Subarrays","frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"articleLive":2,"formTitle":"[690]Employee Importance","frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"","title":"Employee Importance","titleSlug":"employee-importance"},{"articleLive":2,"formTitle":"[691]Stickers to Spell Word","frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word"},{"articleLive":2,"formTitle":"[692]Top K Frequent Words","frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","title":"Top K Frequent Words","titleSlug":"top-k-frequent-words"},{"articleLive":2,"formTitle":"[693]Binary Number with Alternating Bits","frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits"},{"articleLive":2,"formTitle":"[694]Number of Distinct Islands","frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands"},{"articleLive":2,"formTitle":"[695]Max Area of Island","frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","title":"Max Area of Island","titleSlug":"max-area-of-island"},{"articleLive":2,"formTitle":"[696]Count Binary Substrings","frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","title":"Count Binary Substrings","titleSlug":"count-binary-substrings"},{"articleLive":2,"formTitle":"[697]Degree of an Array","frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","title":"Degree of an Array","titleSlug":"degree-of-an-array"},{"articleLive":2,"formTitle":"[698]Partition to K Equal Sum Subsets","frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets"},{"articleLive":2,"formTitle":"[699]Falling Squares","frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","title":"Falling Squares","titleSlug":"falling-squares"},{"articleLive":2,"formTitle":"[700]Search in a Binary Search Tree","frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree"},{"articleLive":2,"formTitle":"[701]Insert into a Binary Search Tree","frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree"},{"articleLive":2,"formTitle":"[702]Search in a Sorted Array of Unknown Size","frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"articleLive":2,"formTitle":"[703]Kth Largest Element in a Stream","frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream"},{"articleLive":2,"formTitle":"[704]Binary Search","frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","title":"Binary Search","titleSlug":"binary-search"},{"articleLive":2,"formTitle":"[705]Design HashSet","frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"","title":"Design HashSet","titleSlug":"design-hashset"},{"articleLive":2,"formTitle":"[706]Design HashMap","frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","title":"Design HashMap","titleSlug":"design-hashmap"},{"articleLive":2,"formTitle":"[707]Design Linked List","frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"","title":"Design Linked List","titleSlug":"design-linked-list"},{"articleLive":2,"formTitle":"[708]Insert into a Sorted Circular Linked List","frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"articleLive":2,"formTitle":"[709]To Lower Case","frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","title":"To Lower Case","titleSlug":"to-lower-case"},{"articleLive":2,"formTitle":"[710]Random Pick with Blacklist","frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist"},{"articleLive":2,"formTitle":"[711]Number of Distinct Islands II","frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii"},{"articleLive":2,"formTitle":"[712]Minimum ASCII Delete Sum for Two Strings","frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"articleLive":2,"formTitle":"[713]Subarray Product Less Than K","frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k"},{"articleLive":2,"formTitle":"[714]Best Time to Buy and Sell Stock with Transaction Fee","frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"articleLive":2,"formTitle":"[715]Range Module","frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","title":"Range Module","titleSlug":"range-module"},{"articleLive":2,"formTitle":"[716]Max Stack","frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","title":"Max Stack","titleSlug":"max-stack"},{"articleLive":2,"formTitle":"[717]1-bit and 2-bit Characters","frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters"},{"articleLive":2,"formTitle":"[718]Maximum Length of Repeated Subarray","frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray"},{"articleLive":2,"formTitle":"[719]Find K-th Smallest Pair Distance","frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance"},{"articleLive":2,"formTitle":"[720]Longest Word in Dictionary","frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"},{"articleLive":2,"formTitle":"[721]Accounts Merge","frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","title":"Accounts Merge","titleSlug":"accounts-merge"},{"articleLive":2,"formTitle":"[722]Remove Comments","frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","title":"Remove Comments","titleSlug":"remove-comments"},{"articleLive":2,"formTitle":"[723]Candy Crush","frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","title":"Candy Crush","titleSlug":"candy-crush"},{"articleLive":2,"formTitle":"[724]Find Pivot Index","frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","title":"Find Pivot Index","titleSlug":"find-pivot-index"},{"articleLive":2,"formTitle":"[725]Split Linked List in Parts","frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"","title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts"},{"articleLive":2,"formTitle":"[726]Number of Atoms","frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","title":"Number of Atoms","titleSlug":"number-of-atoms"},{"articleLive":2,"formTitle":"[727]Minimum Window Subsequence","frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence"},{"articleLive":2,"formTitle":"[728]Self Dividing Numbers","frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers"},{"articleLive":2,"formTitle":"[729]My Calendar I","frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","title":"My Calendar I","titleSlug":"my-calendar-i"},{"articleLive":2,"formTitle":"[730]Count Different Palindromic Subsequences","frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences"},{"articleLive":2,"formTitle":"[731]My Calendar II","frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","title":"My Calendar II","titleSlug":"my-calendar-ii"},{"articleLive":2,"formTitle":"[732]My Calendar III","frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","title":"My Calendar III","titleSlug":"my-calendar-iii"},{"articleLive":2,"formTitle":"[733]Flood Fill","frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","title":"Flood Fill","titleSlug":"flood-fill"},{"articleLive":2,"formTitle":"[734]Sentence Similarity","frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","title":"Sentence Similarity","titleSlug":"sentence-similarity"},{"articleLive":2,"formTitle":"[735]Asteroid Collision","frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"","title":"Asteroid Collision","titleSlug":"asteroid-collision"},{"articleLive":2,"formTitle":"[736]Parse Lisp Expression","frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression"},{"articleLive":2,"formTitle":"[737]Sentence Similarity II","frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii"},{"articleLive":2,"formTitle":"[738]Monotone Increasing Digits","frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits"},{"articleLive":2,"formTitle":"[739]Daily Temperatures","frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"","title":"Daily Temperatures","titleSlug":"daily-temperatures"},{"articleLive":2,"formTitle":"[740]Delete and Earn","frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","title":"Delete and Earn","titleSlug":"delete-and-earn"},{"articleLive":2,"formTitle":"[741]Cherry Pickup","frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","title":"Cherry Pickup","titleSlug":"cherry-pickup"},{"articleLive":2,"formTitle":"[742]Closest Leaf in a Binary Tree","frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree"},{"articleLive":2,"formTitle":"[743]Network Delay Time","frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","title":"Network Delay Time","titleSlug":"network-delay-time"},{"articleLive":2,"formTitle":"[744]Find Smallest Letter Greater Than Target","frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target"},{"articleLive":2,"formTitle":"[745]Prefix and Suffix Search","frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search"},{"articleLive":2,"formTitle":"[746]Min Cost Climbing Stairs","frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs"},{"articleLive":2,"formTitle":"[747]Largest Number At Least Twice of Others","frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others"},{"articleLive":2,"formTitle":"[748]Shortest Completing Word","frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","title":"Shortest Completing Word","titleSlug":"shortest-completing-word"},{"articleLive":2,"formTitle":"[749]Contain Virus","frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","title":"Contain Virus","titleSlug":"contain-virus"},{"articleLive":2,"formTitle":"[750]Number Of Corner Rectangles","frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles"},{"articleLive":2,"formTitle":"[751]IP to CIDR","frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","title":"IP to CIDR","titleSlug":"ip-to-cidr"},{"articleLive":2,"formTitle":"[752]Open the Lock","frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","title":"Open the Lock","titleSlug":"open-the-lock"},{"articleLive":2,"formTitle":"[753]Cracking the Safe","frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","title":"Cracking the Safe","titleSlug":"cracking-the-safe"},{"articleLive":2,"formTitle":"[754]Reach a Number","frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","title":"Reach a Number","titleSlug":"reach-a-number"},{"articleLive":2,"formTitle":"[755]Pour Water","frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","title":"Pour Water","titleSlug":"pour-water"},{"articleLive":2,"formTitle":"[756]Pyramid Transition Matrix","frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix"},{"articleLive":2,"formTitle":"[757]Set Intersection Size At Least Two","frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two"},{"articleLive":2,"formTitle":"[758]Bold Words in String","frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","title":"Bold Words in String","titleSlug":"bold-words-in-string"},{"articleLive":2,"formTitle":"[759]Employee Free Time","frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","title":"Employee Free Time","titleSlug":"employee-free-time"},{"articleLive":2,"formTitle":"[760]Find Anagram Mappings","frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings"},{"articleLive":2,"formTitle":"[761]Special Binary String","frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","title":"Special Binary String","titleSlug":"special-binary-string"},{"articleLive":2,"formTitle":"[762]Prime Number of Set Bits in Binary Representation","frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"articleLive":2,"formTitle":"[763]Partition Labels","frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","title":"Partition Labels","titleSlug":"partition-labels"},{"articleLive":2,"formTitle":"[764]Largest Plus Sign","frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","title":"Largest Plus Sign","titleSlug":"largest-plus-sign"},{"articleLive":2,"formTitle":"[765]Couples Holding Hands","frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","title":"Couples Holding Hands","titleSlug":"couples-holding-hands"},{"articleLive":2,"formTitle":"[766]Toeplitz Matrix","frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"},{"articleLive":2,"formTitle":"[767]Reorganize String","frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","title":"Reorganize String","titleSlug":"reorganize-string"},{"articleLive":2,"formTitle":"[768]Max Chunks To Make Sorted II","frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii"},{"articleLive":2,"formTitle":"[769]Max Chunks To Make Sorted","frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted"},{"articleLive":2,"formTitle":"[770]Basic Calculator IV","frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","title":"Basic Calculator IV","titleSlug":"basic-calculator-iv"},{"articleLive":2,"formTitle":"[771]Jewels and Stones","frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","title":"Jewels and Stones","titleSlug":"jewels-and-stones"},{"articleLive":2,"formTitle":"[772]Basic Calculator III","frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","title":"Basic Calculator III","titleSlug":"basic-calculator-iii"},{"articleLive":2,"formTitle":"[773]Sliding Puzzle","frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","title":"Sliding Puzzle","titleSlug":"sliding-puzzle"},{"articleLive":2,"formTitle":"[774]Minimize Max Distance to Gas Station","frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station"},{"articleLive":2,"formTitle":"[775]Global and Local Inversions","frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","title":"Global and Local Inversions","titleSlug":"global-and-local-inversions"},{"articleLive":2,"formTitle":"[776]Split BST","frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","title":"Split BST","titleSlug":"split-bst"},{"articleLive":2,"formTitle":"[777]Swap Adjacent in LR String","frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string"},{"articleLive":2,"formTitle":"[778]Swim in Rising Water","frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","title":"Swim in Rising Water","titleSlug":"swim-in-rising-water"},{"articleLive":2,"formTitle":"[779]K-th Symbol in Grammar","frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar"},{"articleLive":2,"formTitle":"[780]Reaching Points","frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","title":"Reaching Points","titleSlug":"reaching-points"},{"articleLive":2,"formTitle":"[781]Rabbits in Forest","frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","title":"Rabbits in Forest","titleSlug":"rabbits-in-forest"},{"articleLive":2,"formTitle":"[782]Transform to Chessboard","frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","title":"Transform to Chessboard","titleSlug":"transform-to-chessboard"},{"articleLive":2,"formTitle":"[783]Minimum Distance Between BST Nodes","frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"","title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes"},{"articleLive":2,"formTitle":"[784]Letter Case Permutation","frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","title":"Letter Case Permutation","titleSlug":"letter-case-permutation"},{"articleLive":2,"formTitle":"[785]Is Graph Bipartite?","frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite"},{"articleLive":2,"formTitle":"[786]K-th Smallest Prime Fraction","frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction"},{"articleLive":2,"formTitle":"[787]Cheapest Flights Within K Stops","frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops"},{"articleLive":2,"formTitle":"[788]Rotated Digits","frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","title":"Rotated Digits","titleSlug":"rotated-digits"},{"articleLive":2,"formTitle":"[789]Escape The Ghosts","frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","title":"Escape The Ghosts","titleSlug":"escape-the-ghosts"},{"articleLive":2,"formTitle":"[790]Domino and Tromino Tiling","frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling"},{"articleLive":2,"formTitle":"[791]Custom Sort String","frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","title":"Custom Sort String","titleSlug":"custom-sort-string"},{"articleLive":2,"formTitle":"[792]Number of Matching Subsequences","frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences"},{"articleLive":2,"formTitle":"[793]Preimage Size of Factorial Zeroes Function","frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"articleLive":2,"formTitle":"[794]Valid Tic-Tac-Toe State","frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state"},{"articleLive":2,"formTitle":"[795]Number of Subarrays with Bounded Maximum","frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"articleLive":2,"formTitle":"[796]Rotate String","frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","title":"Rotate String","titleSlug":"rotate-string"},{"articleLive":2,"formTitle":"[797]All Paths From Source to Target","frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target"},{"articleLive":2,"formTitle":"[798]Smallest Rotation with Highest Score","frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score"},{"articleLive":2,"formTitle":"[799]Champagne Tower","frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","title":"Champagne Tower","titleSlug":"champagne-tower"},{"articleLive":2,"formTitle":"[800]Similar RGB Color","frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","title":"Similar RGB Color","titleSlug":"similar-rgb-color"},{"articleLive":2,"formTitle":"[801]Minimum Swaps To Make Sequences Increasing","frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"articleLive":2,"formTitle":"[802]Find Eventual Safe States","frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"},{"articleLive":2,"formTitle":"[803]Bricks Falling When Hit","frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"},{"articleLive":2,"formTitle":"[804]Unique Morse Code Words","frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"},{"articleLive":2,"formTitle":"[805]Split Array With Same Average","frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"},{"articleLive":2,"formTitle":"[806]Number of Lines To Write String","frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string"},{"articleLive":2,"formTitle":"[807]Max Increase to Keep City Skyline","frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline"},{"articleLive":2,"formTitle":"[808]Soup Servings","frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","title":"Soup Servings","titleSlug":"soup-servings"},{"articleLive":2,"formTitle":"[809]Expressive Words","frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","title":"Expressive Words","titleSlug":"expressive-words"},{"articleLive":2,"formTitle":"[810]Chalkboard XOR Game","frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game"},{"articleLive":2,"formTitle":"[811]Subdomain Visit Count","frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"},{"articleLive":2,"formTitle":"[812]Largest Triangle Area","frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","title":"Largest Triangle Area","titleSlug":"largest-triangle-area"},{"articleLive":2,"formTitle":"[813]Largest Sum of Averages","frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages"},{"articleLive":2,"formTitle":"[814]Binary Tree Pruning","frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning"},{"articleLive":2,"formTitle":"[815]Bus Routes","frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","title":"Bus Routes","titleSlug":"bus-routes"},{"articleLive":2,"formTitle":"[816]Ambiguous Coordinates","frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"},{"articleLive":2,"formTitle":"[817]Linked List Components","frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"","title":"Linked List Components","titleSlug":"linked-list-components"},{"articleLive":2,"formTitle":"[818]Race Car","frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","title":"Race Car","titleSlug":"race-car"},{"articleLive":2,"formTitle":"[819]Most Common Word","frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","title":"Most Common Word","titleSlug":"most-common-word"},{"articleLive":2,"formTitle":"[820]Short Encoding of Words","frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","title":"Short Encoding of Words","titleSlug":"short-encoding-of-words"},{"articleLive":2,"formTitle":"[821]Shortest Distance to a Character","frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character"},{"articleLive":2,"formTitle":"[822]Card Flipping Game","frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","title":"Card Flipping Game","titleSlug":"card-flipping-game"},{"articleLive":2,"formTitle":"[823]Binary Trees With Factors","frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors"},{"articleLive":2,"formTitle":"[824]Goat Latin","frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","title":"Goat Latin","titleSlug":"goat-latin"},{"articleLive":2,"formTitle":"[825]Friends Of Appropriate Ages","frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"},{"articleLive":2,"formTitle":"[826]Most Profit Assigning Work","frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"},{"articleLive":2,"formTitle":"[827]Making A Large Island","frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","title":"Making A Large Island","titleSlug":"making-a-large-island"},{"articleLive":2,"formTitle":"[828]Count Unique Characters of All Substrings of a Given String","frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"articleLive":2,"formTitle":"[829]Consecutive Numbers Sum","frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"},{"articleLive":2,"formTitle":"[830]Positions of Large Groups","frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"},{"articleLive":2,"formTitle":"[831]Masking Personal Information","frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","title":"Masking Personal Information","titleSlug":"masking-personal-information"},{"articleLive":2,"formTitle":"[832]Flipping an Image","frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","title":"Flipping an Image","titleSlug":"flipping-an-image"},{"articleLive":2,"formTitle":"[833]Find And Replace in String","frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","title":"Find And Replace in String","titleSlug":"find-and-replace-in-string"},{"articleLive":2,"formTitle":"[834]Sum of Distances in Tree","frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree"},{"articleLive":2,"formTitle":"[835]Image Overlap","frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","title":"Image Overlap","titleSlug":"image-overlap"},{"articleLive":2,"formTitle":"[836]Rectangle Overlap","frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","title":"Rectangle Overlap","titleSlug":"rectangle-overlap"},{"articleLive":2,"formTitle":"[837]New 21 Game","frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","title":"New 21 Game","titleSlug":"new-21-game"},{"articleLive":2,"formTitle":"[838]Push Dominoes","frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","title":"Push Dominoes","titleSlug":"push-dominoes"},{"articleLive":2,"formTitle":"[839]Similar String Groups","frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","title":"Similar String Groups","titleSlug":"similar-string-groups"},{"articleLive":2,"formTitle":"[840]Magic Squares In Grid","frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid"},{"articleLive":2,"formTitle":"[841]Keys and Rooms","frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","title":"Keys and Rooms","titleSlug":"keys-and-rooms"},{"articleLive":2,"formTitle":"[842]Split Array into Fibonacci Sequence","frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence"},{"articleLive":2,"formTitle":"[843]Guess the Word","frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","title":"Guess the Word","titleSlug":"guess-the-word"},{"articleLive":2,"formTitle":"[844]Backspace String Compare","frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"","title":"Backspace String Compare","titleSlug":"backspace-string-compare"},{"articleLive":2,"formTitle":"[845]Longest Mountain in Array","frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array"},{"articleLive":2,"formTitle":"[846]Hand of Straights","frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","title":"Hand of Straights","titleSlug":"hand-of-straights"},{"articleLive":2,"formTitle":"[847]Shortest Path Visiting All Nodes","frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes"},{"articleLive":2,"formTitle":"[848]Shifting Letters","frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","title":"Shifting Letters","titleSlug":"shifting-letters"},{"articleLive":2,"formTitle":"[849]Maximize Distance to Closest Person","frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person"},{"articleLive":2,"formTitle":"[850]Rectangle Area II","frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","title":"Rectangle Area II","titleSlug":"rectangle-area-ii"},{"articleLive":2,"formTitle":"[851]Loud and Rich","frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","title":"Loud and Rich","titleSlug":"loud-and-rich"},{"articleLive":2,"formTitle":"[852]Peak Index in a Mountain Array","frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array"},{"articleLive":2,"formTitle":"[853]Car Fleet","frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","title":"Car Fleet","titleSlug":"car-fleet"},{"articleLive":2,"formTitle":"[854]K-Similar Strings","frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","title":"K-Similar Strings","titleSlug":"k-similar-strings"},{"articleLive":2,"formTitle":"[855]Exam Room","frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","title":"Exam Room","titleSlug":"exam-room"},{"articleLive":2,"formTitle":"[856]Score of Parentheses","frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"","title":"Score of Parentheses","titleSlug":"score-of-parentheses"},{"articleLive":2,"formTitle":"[857]Minimum Cost to Hire K Workers","frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers"},{"articleLive":2,"formTitle":"[858]Mirror Reflection","frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","title":"Mirror Reflection","titleSlug":"mirror-reflection"},{"articleLive":2,"formTitle":"[859]Buddy Strings","frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","title":"Buddy Strings","titleSlug":"buddy-strings"},{"articleLive":2,"formTitle":"[860]Lemonade Change","frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","title":"Lemonade Change","titleSlug":"lemonade-change"},{"articleLive":2,"formTitle":"[861]Score After Flipping Matrix","frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix"},{"articleLive":2,"formTitle":"[862]Shortest Subarray with Sum at Least K","frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"articleLive":2,"formTitle":"[863]All Nodes Distance K in Binary Tree","frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"articleLive":2,"formTitle":"[864]Shortest Path to Get All Keys","frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys"},{"articleLive":2,"formTitle":"[865]Smallest Subtree with all the Deepest Nodes","frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"articleLive":2,"formTitle":"[866]Prime Palindrome","frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","title":"Prime Palindrome","titleSlug":"prime-palindrome"},{"articleLive":2,"formTitle":"[867]Transpose Matrix","frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","title":"Transpose Matrix","titleSlug":"transpose-matrix"},{"articleLive":2,"formTitle":"[868]Binary Gap","frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","title":"Binary Gap","titleSlug":"binary-gap"},{"articleLive":2,"formTitle":"[869]Reordered Power of 2","frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","title":"Reordered Power of 2","titleSlug":"reordered-power-of-2"},{"articleLive":2,"formTitle":"[870]Advantage Shuffle","frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","title":"Advantage Shuffle","titleSlug":"advantage-shuffle"},{"articleLive":2,"formTitle":"[871]Minimum Number of Refueling Stops","frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops"},{"articleLive":2,"formTitle":"[872]Leaf-Similar Trees","frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees"},{"articleLive":2,"formTitle":"[873]Length of Longest Fibonacci Subsequence","frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence"},{"articleLive":2,"formTitle":"[874]Walking Robot Simulation","frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation"},{"articleLive":2,"formTitle":"[875]Koko Eating Bananas","frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas"},{"articleLive":2,"formTitle":"[876]Middle of the Linked List","frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"","title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list"},{"articleLive":2,"formTitle":"[877]Stone Game","frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","title":"Stone Game","titleSlug":"stone-game"},{"articleLive":2,"formTitle":"[878]Nth Magical Number","frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","title":"Nth Magical Number","titleSlug":"nth-magical-number"},{"articleLive":2,"formTitle":"[879]Profitable Schemes","frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","title":"Profitable Schemes","titleSlug":"profitable-schemes"},{"articleLive":2,"formTitle":"[880]Decoded String at Index","frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"","title":"Decoded String at Index","titleSlug":"decoded-string-at-index"},{"articleLive":2,"formTitle":"[881]Boats to Save People","frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","title":"Boats to Save People","titleSlug":"boats-to-save-people"},{"articleLive":2,"formTitle":"[882]Reachable Nodes In Subdivided Graph","frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph"},{"articleLive":2,"formTitle":"[883]Projection Area of 3D Shapes","frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes"},{"articleLive":2,"formTitle":"[884]Uncommon Words from Two Sentences","frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences"},{"articleLive":2,"formTitle":"[885]Spiral Matrix III","frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii"},{"articleLive":2,"formTitle":"[886]Possible Bipartition","frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","title":"Possible Bipartition","titleSlug":"possible-bipartition"},{"articleLive":2,"formTitle":"[887]Super Egg Drop","frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","title":"Super Egg Drop","titleSlug":"super-egg-drop"},{"articleLive":2,"formTitle":"[888]Fair Candy Swap","frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","title":"Fair Candy Swap","titleSlug":"fair-candy-swap"},{"articleLive":2,"formTitle":"[889]Construct Binary Tree from Preorder and Postorder Traversal","frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"articleLive":2,"formTitle":"[890]Find and Replace Pattern","frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern"},{"articleLive":2,"formTitle":"[891]Sum of Subsequence Widths","frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths"},{"articleLive":2,"formTitle":"[892]Surface Area of 3D Shapes","frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes"},{"articleLive":2,"formTitle":"[893]Groups of Special-Equivalent Strings","frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings"},{"articleLive":2,"formTitle":"[894]All Possible Full Binary Trees","frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees"},{"articleLive":2,"formTitle":"[895]Maximum Frequency Stack","frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack"},{"articleLive":2,"formTitle":"[896]Monotonic Array","frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","title":"Monotonic Array","titleSlug":"monotonic-array"},{"articleLive":2,"formTitle":"[897]Increasing Order Search Tree","frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"","title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree"},{"articleLive":2,"formTitle":"[898]Bitwise ORs of Subarrays","frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays"},{"articleLive":2,"formTitle":"[899]Orderly Queue","frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","title":"Orderly Queue","titleSlug":"orderly-queue"},{"articleLive":2,"formTitle":"[900]RLE Iterator","frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","title":"RLE Iterator","titleSlug":"rle-iterator"},{"articleLive":2,"formTitle":"[901]Online Stock Span","frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"","title":"Online Stock Span","titleSlug":"online-stock-span"},{"articleLive":2,"formTitle":"[902]Numbers At Most N Given Digit Set","frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set"},{"articleLive":2,"formTitle":"[903]Valid Permutations for DI Sequence","frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence"},{"articleLive":2,"formTitle":"[904]Fruit Into Baskets","frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets"},{"articleLive":2,"formTitle":"[905]Sort Array By Parity","frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","title":"Sort Array By Parity","titleSlug":"sort-array-by-parity"},{"articleLive":2,"formTitle":"[906]Super Palindromes","frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","title":"Super Palindromes","titleSlug":"super-palindromes"},{"articleLive":2,"formTitle":"[907]Sum of Subarray Minimums","frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"","title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums"},{"articleLive":2,"formTitle":"[908]Smallest Range I","frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","title":"Smallest Range I","titleSlug":"smallest-range-i"},{"articleLive":2,"formTitle":"[909]Snakes and Ladders","frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","title":"Snakes and Ladders","titleSlug":"snakes-and-ladders"},{"articleLive":2,"formTitle":"[910]Smallest Range II","frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","title":"Smallest Range II","titleSlug":"smallest-range-ii"},{"articleLive":2,"formTitle":"[911]Online Election","frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","title":"Online Election","titleSlug":"online-election"},{"articleLive":2,"formTitle":"[912]Sort an Array","frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","title":"Sort an Array","titleSlug":"sort-an-array"},{"articleLive":2,"formTitle":"[913]Cat and Mouse","frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","title":"Cat and Mouse","titleSlug":"cat-and-mouse"},{"articleLive":2,"formTitle":"[914]X of a Kind in a Deck of Cards","frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"","title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"articleLive":2,"formTitle":"[915]Partition Array into Disjoint Intervals","frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"},{"articleLive":2,"formTitle":"[916]Word Subsets","frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","title":"Word Subsets","titleSlug":"word-subsets"},{"articleLive":2,"formTitle":"[917]Reverse Only Letters","frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","title":"Reverse Only Letters","titleSlug":"reverse-only-letters"},{"articleLive":2,"formTitle":"[918]Maximum Sum Circular Subarray","frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"},{"articleLive":2,"formTitle":"[919]Complete Binary Tree Inserter","frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"},{"articleLive":2,"formTitle":"[920]Number of Music Playlists","frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","title":"Number of Music Playlists","titleSlug":"number-of-music-playlists"},{"articleLive":2,"formTitle":"[921]Minimum Add to Make Parentheses Valid","frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"","title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid"},{"articleLive":2,"formTitle":"[922]Sort Array By Parity II","frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"","title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii"},{"articleLive":2,"formTitle":"[923]3Sum With Multiplicity","frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity"},{"articleLive":2,"formTitle":"[924]Minimize Malware Spread","frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread"},{"articleLive":2,"formTitle":"[925]Long Pressed Name","frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","title":"Long Pressed Name","titleSlug":"long-pressed-name"},{"articleLive":2,"formTitle":"[926]Flip String to Monotone Increasing","frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing"},{"articleLive":2,"formTitle":"[927]Three Equal Parts","frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","title":"Three Equal Parts","titleSlug":"three-equal-parts"},{"articleLive":2,"formTitle":"[928]Minimize Malware Spread II","frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii"},{"articleLive":2,"formTitle":"[929]Unique Email Addresses","frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","title":"Unique Email Addresses","titleSlug":"unique-email-addresses"},{"articleLive":2,"formTitle":"[930]Binary Subarrays With Sum","frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum"},{"articleLive":2,"formTitle":"[931]Minimum Falling Path Sum","frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum"},{"articleLive":2,"formTitle":"[932]Beautiful Array","frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","title":"Beautiful Array","titleSlug":"beautiful-array"},{"articleLive":2,"formTitle":"[933]Number of Recent Calls","frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","title":"Number of Recent Calls","titleSlug":"number-of-recent-calls"},{"articleLive":2,"formTitle":"[934]Shortest Bridge","frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","title":"Shortest Bridge","titleSlug":"shortest-bridge"},{"articleLive":2,"formTitle":"[935]Knight Dialer","frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","title":"Knight Dialer","titleSlug":"knight-dialer"},{"articleLive":2,"formTitle":"[936]Stamping The Sequence","frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","title":"Stamping The Sequence","titleSlug":"stamping-the-sequence"},{"articleLive":2,"formTitle":"[937]Reorder Data in Log Files","frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files"},{"articleLive":2,"formTitle":"[938]Range Sum of BST","frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"","title":"Range Sum of BST","titleSlug":"range-sum-of-bst"},{"articleLive":2,"formTitle":"[939]Minimum Area Rectangle","frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle"},{"articleLive":2,"formTitle":"[940]Distinct Subsequences II","frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii"},{"articleLive":2,"formTitle":"[941]Valid Mountain Array","frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","title":"Valid Mountain Array","titleSlug":"valid-mountain-array"},{"articleLive":2,"formTitle":"[942]DI String Match","frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","title":"DI String Match","titleSlug":"di-string-match"},{"articleLive":2,"formTitle":"[943]Find the Shortest Superstring","frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring"},{"articleLive":2,"formTitle":"[944]Delete Columns to Make Sorted","frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted"},{"articleLive":2,"formTitle":"[945]Minimum Increment to Make Array Unique","frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique"},{"articleLive":2,"formTitle":"[946]Validate Stack Sequences","frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"","title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences"},{"articleLive":2,"formTitle":"[947]Most Stones Removed with Same Row or Column","frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column"},{"articleLive":2,"formTitle":"[948]Bag of Tokens","frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","title":"Bag of Tokens","titleSlug":"bag-of-tokens"},{"articleLive":2,"formTitle":"[949]Largest Time for Given Digits","frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits"},{"articleLive":2,"formTitle":"[950]Reveal Cards In Increasing Order","frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order"},{"articleLive":2,"formTitle":"[951]Flip Equivalent Binary Trees","frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees"},{"articleLive":2,"formTitle":"[952]Largest Component Size by Common Factor","frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor"},{"articleLive":2,"formTitle":"[953]Verifying an Alien Dictionary","frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary"},{"articleLive":2,"formTitle":"[954]Array of Doubled Pairs","frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs"},{"articleLive":2,"formTitle":"[955]Delete Columns to Make Sorted II","frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii"},{"articleLive":2,"formTitle":"[956]Tallest Billboard","frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","title":"Tallest Billboard","titleSlug":"tallest-billboard"},{"articleLive":2,"formTitle":"[957]Prison Cells After N Days","frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days"},{"articleLive":2,"formTitle":"[958]Check Completeness of a Binary Tree","frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree"},{"articleLive":2,"formTitle":"[959]Regions Cut By Slashes","frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes"},{"articleLive":2,"formTitle":"[960]Delete Columns to Make Sorted III","frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii"},{"articleLive":2,"formTitle":"[961]N-Repeated Element in Size 2N Array","frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array"},{"articleLive":2,"formTitle":"[962]Maximum Width Ramp","frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp"},{"articleLive":2,"formTitle":"[963]Minimum Area Rectangle II","frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii"},{"articleLive":2,"formTitle":"[964]Least Operators to Express Number","frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number"},{"articleLive":2,"formTitle":"[965]Univalued Binary Tree","frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree"},{"articleLive":2,"formTitle":"[966]Vowel Spellchecker","frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"},{"articleLive":2,"formTitle":"[967]Numbers With Same Consecutive Differences","frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences"},{"articleLive":2,"formTitle":"[968]Binary Tree Cameras","frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras"},{"articleLive":2,"formTitle":"[969]Pancake Sorting","frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","title":"Pancake Sorting","titleSlug":"pancake-sorting"},{"articleLive":2,"formTitle":"[970]Powerful Integers","frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","title":"Powerful Integers","titleSlug":"powerful-integers"},{"articleLive":2,"formTitle":"[971]Flip Binary Tree To Match Preorder Traversal","frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"articleLive":2,"formTitle":"[972]Equal Rational Numbers","frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers"},{"articleLive":2,"formTitle":"[973]K Closest Points to Origin","frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin"},{"articleLive":2,"formTitle":"[974]Subarray Sums Divisible by K","frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k"},{"articleLive":2,"formTitle":"[975]Odd Even Jump","frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","title":"Odd Even Jump","titleSlug":"odd-even-jump"},{"articleLive":2,"formTitle":"[976]Largest Perimeter Triangle","frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle"},{"articleLive":2,"formTitle":"[977]Squares of a Sorted Array","frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array"},{"articleLive":2,"formTitle":"[978]Longest Turbulent Subarray","frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray"},{"articleLive":2,"formTitle":"[979]Distribute Coins in Binary Tree","frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree"},{"articleLive":2,"formTitle":"[980]Unique Paths III","frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","title":"Unique Paths III","titleSlug":"unique-paths-iii"},{"articleLive":2,"formTitle":"[981]Time Based Key-Value Store","frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store"},{"articleLive":2,"formTitle":"[982]Triples with Bitwise AND Equal To Zero","frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"articleLive":2,"formTitle":"[983]Minimum Cost For Tickets","frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets"},{"articleLive":2,"formTitle":"[984]String Without AAA or BBB","frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb"},{"articleLive":2,"formTitle":"[985]Sum of Even Numbers After Queries","frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"},{"articleLive":2,"formTitle":"[986]Interval List Intersections","frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","title":"Interval List Intersections","titleSlug":"interval-list-intersections"},{"articleLive":2,"formTitle":"[987]Vertical Order Traversal of a Binary Tree","frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"","title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"articleLive":2,"formTitle":"[988]Smallest String Starting From Leaf","frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf"},{"articleLive":2,"formTitle":"[989]Add to Array-Form of Integer","frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer"},{"articleLive":2,"formTitle":"[990]Satisfiability of Equality Equations","frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations"},{"articleLive":2,"formTitle":"[991]Broken Calculator","frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","title":"Broken Calculator","titleSlug":"broken-calculator"},{"articleLive":2,"formTitle":"[992]Subarrays with K Different Integers","frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers"},{"articleLive":2,"formTitle":"[993]Cousins in Binary Tree","frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree"},{"articleLive":2,"formTitle":"[994]Rotting Oranges","frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","title":"Rotting Oranges","titleSlug":"rotting-oranges"},{"articleLive":2,"formTitle":"[995]Minimum Number of K Consecutive Bit Flips","frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"articleLive":2,"formTitle":"[996]Number of Squareful Arrays","frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays"},{"articleLive":2,"formTitle":"[997]Find the Town Judge","frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","title":"Find the Town Judge","titleSlug":"find-the-town-judge"},{"articleLive":2,"formTitle":"[998]Maximum Binary Tree II","frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii"},{"articleLive":2,"formTitle":"[999]Available Captures for Rook","frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","title":"Available Captures for Rook","titleSlug":"available-captures-for-rook"},{"articleLive":2,"formTitle":"[1000]Minimum Cost to Merge Stones","frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones"},{"articleLive":2,"formTitle":"[1001]Grid Illumination","frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","title":"Grid Illumination","titleSlug":"grid-illumination"},{"articleLive":2,"formTitle":"[1002]Find Common Characters","frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","title":"Find Common Characters","titleSlug":"find-common-characters"},{"articleLive":2,"formTitle":"[1003]Check If Word Is Valid After Substitutions","frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"","title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions"},{"articleLive":2,"formTitle":"[1004]Max Consecutive Ones III","frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii"},{"articleLive":2,"formTitle":"[1005]Maximize Sum Of Array After K Negations","frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations"},{"articleLive":2,"formTitle":"[1006]Clumsy Factorial","frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"","title":"Clumsy Factorial","titleSlug":"clumsy-factorial"},{"articleLive":2,"formTitle":"[1007]Minimum Domino Rotations For Equal Row","frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row"},{"articleLive":2,"formTitle":"[1008]Construct Binary Search Tree from Preorder Traversal","frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"articleLive":2,"formTitle":"[1009]Complement of Base 10 Integer","frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer"},{"articleLive":2,"formTitle":"[1010]Pairs of Songs With Total Durations Divisible by 60","frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"articleLive":2,"formTitle":"[1011]Capacity To Ship Packages Within D Days","frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"","title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days"},{"articleLive":2,"formTitle":"[1012]Numbers With Repeated Digits","frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits"},{"articleLive":2,"formTitle":"[1013]Partition Array Into Three Parts With Equal Sum","frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"articleLive":2,"formTitle":"[1014]Best Sightseeing Pair","frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair"},{"articleLive":2,"formTitle":"[1015]Smallest Integer Divisible by K","frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k"},{"articleLive":2,"formTitle":"[1016]Binary String With Substrings Representing 1 To N","frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"articleLive":2,"formTitle":"[1017]Convert to Base -2","frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","title":"Convert to Base -2","titleSlug":"convert-to-base-2"},{"articleLive":2,"formTitle":"[1018]Binary Prefix Divisible By 5","frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5"},{"articleLive":2,"formTitle":"[1019]Next Greater Node In Linked List","frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"","title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list"},{"articleLive":2,"formTitle":"[1020]Number of Enclaves","frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","title":"Number of Enclaves","titleSlug":"number-of-enclaves"},{"articleLive":2,"formTitle":"[1021]Remove Outermost Parentheses","frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"","title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses"},{"articleLive":2,"formTitle":"[1022]Sum of Root To Leaf Binary Numbers","frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"articleLive":2,"formTitle":"[1023]Camelcase Matching","frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","title":"Camelcase Matching","titleSlug":"camelcase-matching"},{"articleLive":2,"formTitle":"[1024]Video Stitching","frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","title":"Video Stitching","titleSlug":"video-stitching"},{"articleLive":2,"formTitle":"[1025]Divisor Game","frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","title":"Divisor Game","titleSlug":"divisor-game"},{"articleLive":2,"formTitle":"[1026]Maximum Difference Between Node and Ancestor","frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor"},{"articleLive":2,"formTitle":"[1027]Longest Arithmetic Subsequence","frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence"},{"articleLive":2,"formTitle":"[1028]Recover a Tree From Preorder Traversal","frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal"},{"articleLive":2,"formTitle":"[1029]Two City Scheduling","frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","title":"Two City Scheduling","titleSlug":"two-city-scheduling"},{"articleLive":2,"formTitle":"[1030]Matrix Cells in Distance Order","frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order"},{"articleLive":2,"formTitle":"[1031]Maximum Sum of Two Non-Overlapping Subarrays","frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"articleLive":2,"formTitle":"[1032]Stream of Characters","frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","title":"Stream of Characters","titleSlug":"stream-of-characters"},{"articleLive":2,"formTitle":"[1033]Moving Stones Until Consecutive","frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"},{"articleLive":2,"formTitle":"[1034]Coloring A Border","frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","title":"Coloring A Border","titleSlug":"coloring-a-border"},{"articleLive":2,"formTitle":"[1035]Uncrossed Lines","frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","title":"Uncrossed Lines","titleSlug":"uncrossed-lines"},{"articleLive":2,"formTitle":"[1036]Escape a Large Maze","frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","title":"Escape a Large Maze","titleSlug":"escape-a-large-maze"},{"articleLive":2,"formTitle":"[1037]Valid Boomerang","frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","title":"Valid Boomerang","titleSlug":"valid-boomerang"},{"articleLive":2,"formTitle":"[1038]Binary Search Tree to Greater Sum Tree","frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"articleLive":2,"formTitle":"[1039]Minimum Score Triangulation of Polygon","frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon"},{"articleLive":2,"formTitle":"[1040]Moving Stones Until Consecutive II","frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii"},{"articleLive":2,"formTitle":"[1041]Robot Bounded In Circle","frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle"},{"articleLive":2,"formTitle":"[1042]Flower Planting With No Adjacent","frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent"},{"articleLive":2,"formTitle":"[1043]Partition Array for Maximum Sum","frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum"},{"articleLive":2,"formTitle":"[1044]Longest Duplicate Substring","frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring"},{"articleLive":2,"formTitle":"[1045]Customers Who Bought All Products","frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products"},{"articleLive":2,"formTitle":"[1046]Last Stone Weight","frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","title":"Last Stone Weight","titleSlug":"last-stone-weight"},{"articleLive":2,"formTitle":"[1047]Remove All Adjacent Duplicates In String","frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"","title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"articleLive":2,"formTitle":"[1048]Longest String Chain","frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","title":"Longest String Chain","titleSlug":"longest-string-chain"},{"articleLive":2,"formTitle":"[1049]Last Stone Weight II","frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii"},{"articleLive":2,"formTitle":"[1050]Actors and Directors Who Cooperated At Least Three Times","frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"articleLive":2,"formTitle":"[1051]Height Checker","frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","title":"Height Checker","titleSlug":"height-checker"},{"articleLive":2,"formTitle":"[1052]Grumpy Bookstore Owner","frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner"},{"articleLive":2,"formTitle":"[1053]Previous Permutation With One Swap","frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap"},{"articleLive":2,"formTitle":"[1054]Distant Barcodes","frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","title":"Distant Barcodes","titleSlug":"distant-barcodes"},{"articleLive":2,"formTitle":"[1055]Shortest Way to Form String","frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string"},{"articleLive":2,"formTitle":"[1056]Confusing Number","frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","title":"Confusing Number","titleSlug":"confusing-number"},{"articleLive":2,"formTitle":"[1057]Campus Bikes","frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","title":"Campus Bikes","titleSlug":"campus-bikes"},{"articleLive":2,"formTitle":"[1058]Minimize Rounding Error to Meet Target","frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target"},{"articleLive":2,"formTitle":"[1059]All Paths from Source Lead to Destination","frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination"},{"articleLive":2,"formTitle":"[1060]Missing Element in Sorted Array","frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array"},{"articleLive":2,"formTitle":"[1061]Lexicographically Smallest Equivalent String","frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string"},{"articleLive":2,"formTitle":"[1062]Longest Repeating Substring","frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring"},{"articleLive":2,"formTitle":"[1063]Number of Valid Subarrays","frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays"},{"articleLive":2,"formTitle":"[1064]Fixed Point","frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","title":"Fixed Point","titleSlug":"fixed-point"},{"articleLive":2,"formTitle":"[1065]Index Pairs of a String","frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string"},{"articleLive":2,"formTitle":"[1066]Campus Bikes II","frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","title":"Campus Bikes II","titleSlug":"campus-bikes-ii"},{"articleLive":2,"formTitle":"[1067]Digit Count in Range","frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","title":"Digit Count in Range","titleSlug":"digit-count-in-range"},{"articleLive":2,"formTitle":"[1068]Product Sales Analysis I","frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i"},{"articleLive":2,"formTitle":"[1069]Product Sales Analysis II","frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii"},{"articleLive":2,"formTitle":"[1070]Product Sales Analysis III","frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii"},{"articleLive":2,"formTitle":"[1071]Greatest Common Divisor of Strings","frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings"},{"articleLive":2,"formTitle":"[1072]Flip Columns For Maximum Number of Equal Rows","frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"articleLive":2,"formTitle":"[1073]Adding Two Negabinary Numbers","frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers"},{"articleLive":2,"formTitle":"[1074]Number of Submatrices That Sum to Target","frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target"},{"articleLive":2,"formTitle":"[1075]Project Employees I","frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","title":"Project Employees I","titleSlug":"project-employees-i"},{"articleLive":2,"formTitle":"[1076]Project Employees II","frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","title":"Project Employees II","titleSlug":"project-employees-ii"},{"articleLive":2,"formTitle":"[1077]Project Employees III","frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","title":"Project Employees III","titleSlug":"project-employees-iii"},{"articleLive":2,"formTitle":"[1078]Occurrences After Bigram","frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram"},{"articleLive":2,"formTitle":"[1079]Letter Tile Possibilities","frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities"},{"articleLive":2,"formTitle":"[1080]Insufficient Nodes in Root to Leaf Paths","frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"articleLive":2,"formTitle":"[1081]Smallest Subsequence of Distinct Characters","frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"","title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters"},{"articleLive":2,"formTitle":"[1082]Sales Analysis I","frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","title":"Sales Analysis I","titleSlug":"sales-analysis-i"},{"articleLive":2,"formTitle":"[1083]Sales Analysis II","frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","title":"Sales Analysis II","titleSlug":"sales-analysis-ii"},{"articleLive":2,"formTitle":"[1084]Sales Analysis III","frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","title":"Sales Analysis III","titleSlug":"sales-analysis-iii"},{"articleLive":2,"formTitle":"[1085]Sum of Digits in the Minimum Number","frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number"},{"articleLive":2,"formTitle":"[1086]High Five","frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","title":"High Five","titleSlug":"high-five"},{"articleLive":2,"formTitle":"[1087]Brace Expansion","frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","title":"Brace Expansion","titleSlug":"brace-expansion"},{"articleLive":2,"formTitle":"[1088]Confusing Number II","frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","title":"Confusing Number II","titleSlug":"confusing-number-ii"},{"articleLive":2,"formTitle":"[1089]Duplicate Zeros","frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","title":"Duplicate Zeros","titleSlug":"duplicate-zeros"},{"articleLive":2,"formTitle":"[1090]Largest Values From Labels","frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","title":"Largest Values From Labels","titleSlug":"largest-values-from-labels"},{"articleLive":2,"formTitle":"[1091]Shortest Path in Binary Matrix","frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix"},{"articleLive":2,"formTitle":"[1092]Shortest Common Supersequence ","frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence"},{"articleLive":2,"formTitle":"[1093]Statistics from a Large Sample","frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample"},{"articleLive":2,"formTitle":"[1094]Car Pooling","frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","title":"Car Pooling","titleSlug":"car-pooling"},{"articleLive":2,"formTitle":"[1095]Find in Mountain Array","frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","title":"Find in Mountain Array","titleSlug":"find-in-mountain-array"},{"articleLive":2,"formTitle":"[1096]Brace Expansion II","frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","title":"Brace Expansion II","titleSlug":"brace-expansion-ii"},{"articleLive":2,"formTitle":"[1097]Game Play Analysis V","frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","title":"Game Play Analysis V","titleSlug":"game-play-analysis-v"},{"articleLive":2,"formTitle":"[1098]Unpopular Books","frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","title":"Unpopular Books","titleSlug":"unpopular-books"},{"articleLive":2,"formTitle":"[1099]Two Sum Less Than K","frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k"},{"articleLive":2,"formTitle":"[1100]Find K-Length Substrings With No Repeated Characters","frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"articleLive":2,"formTitle":"[1101]The Earliest Moment When Everyone Become Friends","frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"articleLive":2,"formTitle":"[1102]Path With Maximum Minimum Value","frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value"},{"articleLive":2,"formTitle":"[1103]Distribute Candies to People","frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people"},{"articleLive":2,"formTitle":"[1104]Path In Zigzag Labelled Binary Tree","frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"articleLive":2,"formTitle":"[1105]Filling Bookcase Shelves","frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves"},{"articleLive":2,"formTitle":"[1106]Parsing A Boolean Expression","frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression"},{"articleLive":2,"formTitle":"[1107]New Users Daily Count","frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","title":"New Users Daily Count","titleSlug":"new-users-daily-count"},{"articleLive":2,"formTitle":"[1108]Defanging an IP Address","frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address"},{"articleLive":2,"formTitle":"[1109]Corporate Flight Bookings","frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings"},{"articleLive":2,"formTitle":"[1110]Delete Nodes And Return Forest","frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest"},{"articleLive":2,"formTitle":"[1111]Maximum Nesting Depth of Two Valid Parentheses Strings","frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"articleLive":2,"formTitle":"[1112]Highest Grade For Each Student","frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"},{"articleLive":2,"formTitle":"[1113]Reported Posts","frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","title":"Reported Posts","titleSlug":"reported-posts"},{"articleLive":2,"formTitle":"[1114]Print in Order","frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","title":"Print in Order","titleSlug":"print-in-order"},{"articleLive":2,"formTitle":"[1115]Print FooBar Alternately","frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately"},{"articleLive":2,"formTitle":"[1116]Print Zero Even Odd","frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd"},{"articleLive":2,"formTitle":"[1117]Building H2O","frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","title":"Building H2O","titleSlug":"building-h2o"},{"articleLive":2,"formTitle":"[1118]Number of Days in a Month","frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month"},{"articleLive":2,"formTitle":"[1119]Remove Vowels from a String","frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string"},{"articleLive":2,"formTitle":"[1120]Maximum Average Subtree","frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree"},{"articleLive":2,"formTitle":"[1121]Divide Array Into Increasing Sequences","frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences"},{"articleLive":2,"formTitle":"[1122]Relative Sort Array","frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","title":"Relative Sort Array","titleSlug":"relative-sort-array"},{"articleLive":2,"formTitle":"[1123]Lowest Common Ancestor of Deepest Leaves","frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"articleLive":2,"formTitle":"[1124]Longest Well-Performing Interval","frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval"},{"articleLive":2,"formTitle":"[1125]Smallest Sufficient Team","frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team"},{"articleLive":2,"formTitle":"[1126]Active Businesses","frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","title":"Active Businesses","titleSlug":"active-businesses"},{"articleLive":2,"formTitle":"[1127]User Purchase Platform","frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","title":"User Purchase Platform","titleSlug":"user-purchase-platform"},{"articleLive":2,"formTitle":"[1128]Number of Equivalent Domino Pairs","frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs"},{"articleLive":2,"formTitle":"[1129]Shortest Path with Alternating Colors","frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors"},{"articleLive":2,"formTitle":"[1130]Minimum Cost Tree From Leaf Values","frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values"},{"articleLive":2,"formTitle":"[1131]Maximum of Absolute Value Expression","frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression"},{"articleLive":2,"formTitle":"[1132]Reported Posts II","frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","title":"Reported Posts II","titleSlug":"reported-posts-ii"},{"articleLive":2,"formTitle":"[1133]Largest Unique Number","frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","title":"Largest Unique Number","titleSlug":"largest-unique-number"},{"articleLive":2,"formTitle":"[1134]Armstrong Number","frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","title":"Armstrong Number","titleSlug":"armstrong-number"},{"articleLive":2,"formTitle":"[1135]Connecting Cities With Minimum Cost","frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost"},{"articleLive":2,"formTitle":"[1136]Parallel Courses","frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","title":"Parallel Courses","titleSlug":"parallel-courses"},{"articleLive":2,"formTitle":"[1137]N-th Tribonacci Number","frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number"},{"articleLive":2,"formTitle":"[1138]Alphabet Board Path","frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","title":"Alphabet Board Path","titleSlug":"alphabet-board-path"},{"articleLive":2,"formTitle":"[1139]Largest 1-Bordered Square","frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square"},{"articleLive":2,"formTitle":"[1140]Stone Game II","frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","title":"Stone Game II","titleSlug":"stone-game-ii"},{"articleLive":2,"formTitle":"[1141]User Activity for the Past 30 Days I","frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"},{"articleLive":2,"formTitle":"[1142]User Activity for the Past 30 Days II","frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"articleLive":2,"formTitle":"[1143]Longest Common Subsequence","frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence"},{"articleLive":2,"formTitle":"[1144]Decrease Elements To Make Array Zigzag","frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag"},{"articleLive":2,"formTitle":"[1145]Binary Tree Coloring Game","frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game"},{"articleLive":2,"formTitle":"[1146]Snapshot Array","frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","title":"Snapshot Array","titleSlug":"snapshot-array"},{"articleLive":2,"formTitle":"[1147]Longest Chunked Palindrome Decomposition","frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition"},{"articleLive":2,"formTitle":"[1148]Article Views I","frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","title":"Article Views I","titleSlug":"article-views-i"},{"articleLive":2,"formTitle":"[1149]Article Views II","frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","title":"Article Views II","titleSlug":"article-views-ii"},{"articleLive":2,"formTitle":"[1150]Check If a Number Is Majority Element in a Sorted Array","frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","title":"Check If a Number Is Majority Element in a Sorted Array","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"articleLive":2,"formTitle":"[1151]Minimum Swaps to Group All 1's Together","frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"articleLive":2,"formTitle":"[1152]Analyze User Website Visit Pattern","frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern"},{"articleLive":2,"formTitle":"[1153]String Transforms Into Another String","frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string"},{"articleLive":2,"formTitle":"[1154]Day of the Year","frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","title":"Day of the Year","titleSlug":"day-of-the-year"},{"articleLive":2,"formTitle":"[1155]Number of Dice Rolls With Target Sum","frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum"},{"articleLive":2,"formTitle":"[1156]Swap For Longest Repeated Character Substring","frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring"},{"articleLive":2,"formTitle":"[1157]Online Majority Element In Subarray","frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray"},{"articleLive":2,"formTitle":"[1158]Market Analysis I","frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","title":"Market Analysis I","titleSlug":"market-analysis-i"},{"articleLive":2,"formTitle":"[1159]Market Analysis II","frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","title":"Market Analysis II","titleSlug":"market-analysis-ii"},{"articleLive":2,"formTitle":"[1160]Find Words That Can Be Formed by Characters","frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters"},{"articleLive":2,"formTitle":"[1161]Maximum Level Sum of a Binary Tree","frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"articleLive":2,"formTitle":"[1162]As Far from Land as Possible","frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible"},{"articleLive":2,"formTitle":"[1163]Last Substring in Lexicographical Order","frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order"},{"articleLive":2,"formTitle":"[1164]Product Price at a Given Date","frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"},{"articleLive":2,"formTitle":"[1165]Single-Row Keyboard","frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","title":"Single-Row Keyboard","titleSlug":"single-row-keyboard"},{"articleLive":2,"formTitle":"[1166]Design File System","frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","title":"Design File System","titleSlug":"design-file-system"},{"articleLive":2,"formTitle":"[1167]Minimum Cost to Connect Sticks","frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks"},{"articleLive":2,"formTitle":"[1168]Optimize Water Distribution in a Village","frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village"},{"articleLive":2,"formTitle":"[1169]Invalid Transactions","frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","title":"Invalid Transactions","titleSlug":"invalid-transactions"},{"articleLive":2,"formTitle":"[1170]Compare Strings by Frequency of the Smallest Character","frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"articleLive":2,"formTitle":"[1171]Remove Zero Sum Consecutive Nodes from Linked List","frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"","title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"articleLive":2,"formTitle":"[1172]Dinner Plate Stacks","frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks"},{"articleLive":2,"formTitle":"[1173]Immediate Food Delivery I","frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"},{"articleLive":2,"formTitle":"[1174]Immediate Food Delivery II","frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"},{"articleLive":2,"formTitle":"[1175]Prime Arrangements","frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","title":"Prime Arrangements","titleSlug":"prime-arrangements"},{"articleLive":2,"formTitle":"[1176]Diet Plan Performance","frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","title":"Diet Plan Performance","titleSlug":"diet-plan-performance"},{"articleLive":2,"formTitle":"[1177]Can Make Palindrome from Substring","frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring"},{"articleLive":2,"formTitle":"[1178]Number of Valid Words for Each Puzzle","frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle"},{"articleLive":2,"formTitle":"[1179]Reformat Department Table","frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","title":"Reformat Department Table","titleSlug":"reformat-department-table"},{"articleLive":2,"formTitle":"[1180]Count Substrings with Only One Distinct Letter","frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"articleLive":2,"formTitle":"[1181]Before and After Puzzle","frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle"},{"articleLive":2,"formTitle":"[1182]Shortest Distance to Target Color","frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color"},{"articleLive":2,"formTitle":"[1183]Maximum Number of Ones","frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones"},{"articleLive":2,"formTitle":"[1184]Distance Between Bus Stops","frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops"},{"articleLive":2,"formTitle":"[1185]Day of the Week","frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","title":"Day of the Week","titleSlug":"day-of-the-week"},{"articleLive":2,"formTitle":"[1186]Maximum Subarray Sum with One Deletion","frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"articleLive":2,"formTitle":"[1187]Make Array Strictly Increasing","frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing"},{"articleLive":2,"formTitle":"[1188]Design Bounded Blocking Queue","frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue"},{"articleLive":2,"formTitle":"[1189]Maximum Number of Balloons","frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons"},{"articleLive":2,"formTitle":"[1190]Reverse Substrings Between Each Pair of Parentheses","frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"articleLive":2,"formTitle":"[1191]K-Concatenation Maximum Sum","frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum"},{"articleLive":2,"formTitle":"[1192]Critical Connections in a Network","frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network"},{"articleLive":2,"formTitle":"[1193]Monthly Transactions I","frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","title":"Monthly Transactions I","titleSlug":"monthly-transactions-i"},{"articleLive":2,"formTitle":"[1194]Tournament Winners","frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","title":"Tournament Winners","titleSlug":"tournament-winners"},{"articleLive":2,"formTitle":"[1195]Fizz Buzz Multithreaded","frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded"},{"articleLive":2,"formTitle":"[1196]How Many Apples Can You Put into the Basket","frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"articleLive":2,"formTitle":"[1197]Minimum Knight Moves","frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves"},{"articleLive":2,"formTitle":"[1198]Find Smallest Common Element in All Rows","frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows"},{"articleLive":2,"formTitle":"[1199]Minimum Time to Build Blocks","frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks"},{"articleLive":2,"formTitle":"[1200]Minimum Absolute Difference","frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference"},{"articleLive":2,"formTitle":"[1201]Ugly Number III","frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","title":"Ugly Number III","titleSlug":"ugly-number-iii"},{"articleLive":2,"formTitle":"[1202]Smallest String With Swaps","frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps"},{"articleLive":2,"formTitle":"[1203]Sort Items by Groups Respecting Dependencies","frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"articleLive":2,"formTitle":"[1204]Last Person to Fit in the Bus","frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus"},{"articleLive":2,"formTitle":"[1205]Monthly Transactions II","frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii"},{"articleLive":2,"formTitle":"[1206]Design Skiplist","frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","title":"Design Skiplist","titleSlug":"design-skiplist"},{"articleLive":2,"formTitle":"[1207]Unique Number of Occurrences","frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences"},{"articleLive":2,"formTitle":"[1208]Get Equal Substrings Within Budget","frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget"},{"articleLive":2,"formTitle":"[1209]Remove All Adjacent Duplicates in String II","frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"articleLive":2,"formTitle":"[1210]Minimum Moves to Reach Target with Rotations","frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"articleLive":2,"formTitle":"[1211]Queries Quality and Percentage","frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"},{"articleLive":2,"formTitle":"[1212]Team Scores in Football Tournament","frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"},{"articleLive":2,"formTitle":"[1213]Intersection of Three Sorted Arrays","frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays"},{"articleLive":2,"formTitle":"[1214]Two Sum BSTs","frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","title":"Two Sum BSTs","titleSlug":"two-sum-bsts"},{"articleLive":2,"formTitle":"[1215]Stepping Numbers","frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","title":"Stepping Numbers","titleSlug":"stepping-numbers"},{"articleLive":2,"formTitle":"[1216]Valid Palindrome III","frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii"},{"articleLive":2,"formTitle":"[1217]Minimum Cost to Move Chips to The Same Position","frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"articleLive":2,"formTitle":"[1218]Longest Arithmetic Subsequence of Given Difference","frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"articleLive":2,"formTitle":"[1219]Path with Maximum Gold","frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold"},{"articleLive":2,"formTitle":"[1220]Count Vowels Permutation","frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation"},{"articleLive":2,"formTitle":"[1221]Split a String in Balanced Strings","frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings"},{"articleLive":2,"formTitle":"[1222]Queens That Can Attack the King","frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king"},{"articleLive":2,"formTitle":"[1223]Dice Roll Simulation","frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation"},{"articleLive":2,"formTitle":"[1224]Maximum Equal Frequency","frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency"},{"articleLive":2,"formTitle":"[1225]Report Contiguous Dates","frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"},{"articleLive":2,"formTitle":"[1226]The Dining Philosophers","frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"},{"articleLive":2,"formTitle":"[1227]Airplane Seat Assignment Probability","frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability"},{"articleLive":2,"formTitle":"[1228]Missing Number In Arithmetic Progression","frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression"},{"articleLive":2,"formTitle":"[1229]Meeting Scheduler","frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","title":"Meeting Scheduler","titleSlug":"meeting-scheduler"},{"articleLive":2,"formTitle":"[1230]Toss Strange Coins","frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","title":"Toss Strange Coins","titleSlug":"toss-strange-coins"},{"articleLive":2,"formTitle":"[1231]Divide Chocolate","frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","title":"Divide Chocolate","titleSlug":"divide-chocolate"},{"articleLive":2,"formTitle":"[1232]Check If It Is a Straight Line","frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line"},{"articleLive":2,"formTitle":"[1233]Remove Sub-Folders from the Filesystem","frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem"},{"articleLive":2,"formTitle":"[1234]Replace the Substring for Balanced String","frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string"},{"articleLive":2,"formTitle":"[1235]Maximum Profit in Job Scheduling","frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling"},{"articleLive":2,"formTitle":"[1236]Web Crawler","frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","title":"Web Crawler","titleSlug":"web-crawler"},{"articleLive":2,"formTitle":"[1237]Find Positive Integer Solution for a Given Equation","frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"articleLive":2,"formTitle":"[1238]Circular Permutation in Binary Representation","frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation"},{"articleLive":2,"formTitle":"[1239]Maximum Length of a Concatenated String with Unique Characters","frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"articleLive":2,"formTitle":"[1240]Tiling a Rectangle with the Fewest Squares","frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"articleLive":2,"formTitle":"[1241]Number of Comments per Post","frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post"},{"articleLive":2,"formTitle":"[1242]Web Crawler Multithreaded","frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded"},{"articleLive":2,"formTitle":"[1243]Array Transformation","frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","title":"Array Transformation","titleSlug":"array-transformation"},{"articleLive":2,"formTitle":"[1244]Design A Leaderboard","frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","title":"Design A Leaderboard","titleSlug":"design-a-leaderboard"},{"articleLive":2,"formTitle":"[1245]Tree Diameter","frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","title":"Tree Diameter","titleSlug":"tree-diameter"},{"articleLive":2,"formTitle":"[1246]Palindrome Removal","frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","title":"Palindrome Removal","titleSlug":"palindrome-removal"},{"articleLive":2,"formTitle":"[1247]Minimum Swaps to Make Strings Equal","frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal"},{"articleLive":2,"formTitle":"[1248]Count Number of Nice Subarrays","frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays"},{"articleLive":2,"formTitle":"[1249]Minimum Remove to Make Valid Parentheses","frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"","title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"articleLive":2,"formTitle":"[1250]Check If It Is a Good Array","frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array"},{"articleLive":2,"formTitle":"[1251]Average Selling Price","frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","title":"Average Selling Price","titleSlug":"average-selling-price"},{"articleLive":2,"formTitle":"[1252]Cells with Odd Values in a Matrix","frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix"},{"articleLive":2,"formTitle":"[1253]Reconstruct a 2-Row Binary Matrix","frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"articleLive":2,"formTitle":"[1254]Number of Closed Islands","frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"","title":"Number of Closed Islands","titleSlug":"number-of-closed-islands"},{"articleLive":2,"formTitle":"[1255]Maximum Score Words Formed by Letters","frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters"},{"articleLive":2,"formTitle":"[1256]Encode Number","frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","title":"Encode Number","titleSlug":"encode-number"},{"articleLive":2,"formTitle":"[1257]Smallest Common Region","frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","title":"Smallest Common Region","titleSlug":"smallest-common-region"},{"articleLive":2,"formTitle":"[1258]Synonymous Sentences","frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","title":"Synonymous Sentences","titleSlug":"synonymous-sentences"},{"articleLive":2,"formTitle":"[1259]Handshakes That Don't Cross","frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross"},{"articleLive":2,"formTitle":"[1260]Shift 2D Grid","frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","title":"Shift 2D Grid","titleSlug":"shift-2d-grid"},{"articleLive":2,"formTitle":"[1261]Find Elements in a Contaminated Binary Tree","frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"articleLive":2,"formTitle":"[1262]Greatest Sum Divisible by Three","frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three"},{"articleLive":2,"formTitle":"[1263]Minimum Moves to Move a Box to Their Target Location","frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"articleLive":2,"formTitle":"[1264]Page Recommendations","frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","title":"Page Recommendations","titleSlug":"page-recommendations"},{"articleLive":2,"formTitle":"[1265]Print Immutable Linked List in Reverse","frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"},{"articleLive":2,"formTitle":"[1266]Minimum Time Visiting All Points","frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"},{"articleLive":2,"formTitle":"[1267]Count Servers that Communicate","frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"},{"articleLive":2,"formTitle":"[1268]Search Suggestions System","frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","title":"Search Suggestions System","titleSlug":"search-suggestions-system"},{"articleLive":2,"formTitle":"[1269]Number of Ways to Stay in the Same Place After Some Steps","frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"","title":"Number of Ways to Stay in the Same Place After Some Steps","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"articleLive":2,"formTitle":"[1270]All People Report to the Given Manager","frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"},{"articleLive":2,"formTitle":"[1271]Hexspeak","frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","title":"Hexspeak","titleSlug":"hexspeak"},{"articleLive":2,"formTitle":"[1272]Remove Interval","frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","title":"Remove Interval","titleSlug":"remove-interval"},{"articleLive":2,"formTitle":"[1273]Delete Tree Nodes","frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes"},{"articleLive":2,"formTitle":"[1274]Number of Ships in a Rectangle","frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle"},{"articleLive":2,"formTitle":"[1275]Find Winner on a Tic Tac Toe Game","frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"articleLive":2,"formTitle":"[1276]Number of Burgers with No Waste of Ingredients","frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"articleLive":2,"formTitle":"[1277]Count Square Submatrices with All Ones","frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones"},{"articleLive":2,"formTitle":"[1278]Palindrome Partitioning III","frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii"},{"articleLive":2,"formTitle":"[1279]Traffic Light Controlled Intersection","frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection"},{"articleLive":2,"formTitle":"[1280]Students and Examinations","frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","title":"Students and Examinations","titleSlug":"students-and-examinations"},{"articleLive":2,"formTitle":"[1281]Subtract the Product and Sum of Digits of an Integer","frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"articleLive":2,"formTitle":"[1282]Group the People Given the Group Size They Belong To","frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"articleLive":2,"formTitle":"[1283]Find the Smallest Divisor Given a Threshold","frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"articleLive":2,"formTitle":"[1284]Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"articleLive":2,"formTitle":"[1285]Find the Start and End Number of Continuous Ranges","frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"articleLive":2,"formTitle":"[1286]Iterator for Combination","frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","title":"Iterator for Combination","titleSlug":"iterator-for-combination"},{"articleLive":2,"formTitle":"[1287]Element Appearing More Than 25% In Sorted Array","frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"articleLive":2,"formTitle":"[1288]Remove Covered Intervals","frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals"},{"articleLive":2,"formTitle":"[1289]Minimum Falling Path Sum II","frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii"},{"articleLive":2,"formTitle":"[1290]Convert Binary Number in a Linked List to Integer","frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"","title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"articleLive":2,"formTitle":"[1291]Sequential Digits","frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","title":"Sequential Digits","titleSlug":"sequential-digits"},{"articleLive":2,"formTitle":"[1292]Maximum Side Length of a Square with Sum Less than or Equal to Threshold","frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"articleLive":2,"formTitle":"[1293]Shortest Path in a Grid with Obstacles Elimination","frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"articleLive":2,"formTitle":"[1294]Weather Type in Each Country","frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country"},{"articleLive":2,"formTitle":"[1295]Find Numbers with Even Number of Digits","frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits"},{"articleLive":2,"formTitle":"[1296]Divide Array in Sets of K Consecutive Numbers","frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"articleLive":2,"formTitle":"[1297]Maximum Number of Occurrences of a Substring","frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"articleLive":2,"formTitle":"[1298]Maximum Candies You Can Get from Boxes","frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"articleLive":2,"formTitle":"[1299]Replace Elements with Greatest Element on Right Side","frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"articleLive":2,"formTitle":"[1300]Sum of Mutated Array Closest to Target","frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target"},{"articleLive":2,"formTitle":"[1301]Number of Paths with Max Score","frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score"},{"articleLive":2,"formTitle":"[1302]Deepest Leaves Sum","frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum"},{"articleLive":2,"formTitle":"[1303]Find the Team Size","frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","title":"Find the Team Size","titleSlug":"find-the-team-size"},{"articleLive":2,"formTitle":"[1304]Find N Unique Integers Sum up to Zero","frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"articleLive":2,"formTitle":"[1305]All Elements in Two Binary Search Trees","frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees"},{"articleLive":2,"formTitle":"[1306]Jump Game III","frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","title":"Jump Game III","titleSlug":"jump-game-iii"},{"articleLive":2,"formTitle":"[1307]Verbal Arithmetic Puzzle","frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle"},{"articleLive":2,"formTitle":"[1308]Running Total for Different Genders","frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders"},{"articleLive":2,"formTitle":"[1309]Decrypt String from Alphabet to Integer Mapping","frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"articleLive":2,"formTitle":"[1310]XOR Queries of a Subarray","frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"","title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray"},{"articleLive":2,"formTitle":"[1311]Get Watched Videos by Your Friends","frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends"},{"articleLive":2,"formTitle":"[1312]Minimum Insertion Steps to Make a String Palindrome","frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"articleLive":2,"formTitle":"[1313]Decompress Run-Length Encoded List","frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list"},{"articleLive":2,"formTitle":"[1314]Matrix Block Sum","frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","title":"Matrix Block Sum","titleSlug":"matrix-block-sum"},{"articleLive":2,"formTitle":"[1315]Sum of Nodes with Even-Valued Grandparent","frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"articleLive":2,"formTitle":"[1316]Distinct Echo Substrings","frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings"},{"articleLive":2,"formTitle":"[1317]Convert Integer to the Sum of Two No-Zero Integers","frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"","title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"articleLive":2,"formTitle":"[1318]Minimum Flips to Make a OR b Equal to c","frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"articleLive":2,"formTitle":"[1319]Number of Operations to Make Network Connected","frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected"},{"articleLive":2,"formTitle":"[1320]Minimum Distance to Type a Word Using Two Fingers","frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"articleLive":2,"formTitle":"[1321]Restaurant Growth","frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","title":"Restaurant Growth","titleSlug":"restaurant-growth"},{"articleLive":2,"formTitle":"[1322]Ads Performance","frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","title":"Ads Performance","titleSlug":"ads-performance"},{"articleLive":2,"formTitle":"[1323]Maximum 69 Number","frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","title":"Maximum 69 Number","titleSlug":"maximum-69-number"},{"articleLive":2,"formTitle":"[1324]Print Words Vertically","frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","title":"Print Words Vertically","titleSlug":"print-words-vertically"},{"articleLive":2,"formTitle":"[1325]Delete Leaves With a Given Value","frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value"},{"articleLive":2,"formTitle":"[1326]Minimum Number of Taps to Open to Water a Garden","frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"articleLive":2,"formTitle":"[1327]List the Products Ordered in a Period","frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period"},{"articleLive":2,"formTitle":"[1328]Break a Palindrome","frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","title":"Break a Palindrome","titleSlug":"break-a-palindrome"},{"articleLive":2,"formTitle":"[1329]Sort the Matrix Diagonally","frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally"},{"articleLive":2,"formTitle":"[1330]Reverse Subarray To Maximize Array Value","frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value"},{"articleLive":2,"formTitle":"[1331]Rank Transform of an Array","frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array"},{"articleLive":2,"formTitle":"[1332]Remove Palindromic Subsequences","frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"","title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences"},{"articleLive":2,"formTitle":"[1333]Filter Restaurants by Vegan-Friendly, Price and Distance","frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"articleLive":2,"formTitle":"[1334]Find the City With the Smallest Number of Neighbors at a Threshold Distance","frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"articleLive":2,"formTitle":"[1335]Minimum Difficulty of a Job Schedule","frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"articleLive":2,"formTitle":"[1336]Number of Transactions per Visit","frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit"},{"articleLive":2,"formTitle":"[1337]The K Weakest Rows in a Matrix","frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"","title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"articleLive":2,"formTitle":"[1338]Reduce Array Size to The Half","frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"","title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half"},{"articleLive":2,"formTitle":"[1339]Maximum Product of Splitted Binary Tree","frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree"},{"articleLive":2,"formTitle":"[1340]Jump Game V","frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","title":"Jump Game V","titleSlug":"jump-game-v"},{"articleLive":2,"formTitle":"[1341]Movie Rating","frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","title":"Movie Rating","titleSlug":"movie-rating"},{"articleLive":2,"formTitle":"[1342]Number of Steps to Reduce a Number to Zero","frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"articleLive":2,"formTitle":"[1343]Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"articleLive":2,"formTitle":"[1344]Angle Between Hands of a Clock","frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock"},{"articleLive":2,"formTitle":"[1345]Jump Game IV","frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","title":"Jump Game IV","titleSlug":"jump-game-iv"},{"articleLive":2,"formTitle":"[1346]Check If N and Its Double Exist","frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist"},{"articleLive":2,"formTitle":"[1347]Minimum Number of Steps to Make Two Strings Anagram","frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"","title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"articleLive":2,"formTitle":"[1348]Tweet Counts Per Frequency","frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency"},{"articleLive":2,"formTitle":"[1349]Maximum Students Taking Exam","frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam"},{"articleLive":2,"formTitle":"[1350]Students With Invalid Departments","frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments"},{"articleLive":2,"formTitle":"[1351]Count Negative Numbers in a Sorted Matrix","frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"articleLive":2,"formTitle":"[1352]Product of the Last K Numbers","frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers"},{"articleLive":2,"formTitle":"[1353]Maximum Number of Events That Can Be Attended","frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"articleLive":2,"formTitle":"[1354]Construct Target Array With Multiple Sums","frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums"},{"articleLive":2,"formTitle":"[1355]Activity Participants","frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","title":"Activity Participants","titleSlug":"activity-participants"},{"articleLive":2,"formTitle":"[1356]Sort Integers by The Number of 1 Bits","frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"articleLive":2,"formTitle":"[1357]Apply Discount Every n Orders","frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders"},{"articleLive":2,"formTitle":"[1358]Number of Substrings Containing All Three Characters","frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters"},{"articleLive":2,"formTitle":"[1359]Count All Valid Pickup and Delivery Options","frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"articleLive":2,"formTitle":"[1360]Number of Days Between Two Dates","frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates"},{"articleLive":2,"formTitle":"[1361]Validate Binary Tree Nodes","frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes"},{"articleLive":2,"formTitle":"[1362]Closest Divisors","frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","title":"Closest Divisors","titleSlug":"closest-divisors"},{"articleLive":2,"formTitle":"[1363]Largest Multiple of Three","frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three"},{"articleLive":2,"formTitle":"[1364]Number of Trusted Contacts of a Customer","frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"articleLive":2,"formTitle":"[1365]How Many Numbers Are Smaller Than the Current Number","frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"articleLive":2,"formTitle":"[1366]Rank Teams by Votes","frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"},{"articleLive":2,"formTitle":"[1367]Linked List in Binary Tree","frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"","title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"},{"articleLive":2,"formTitle":"[1368]Minimum Cost to Make at Least One Valid Path in a Grid","frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","title":"Minimum Cost to Make at Least One Valid Path in a Grid","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"articleLive":2,"formTitle":"[1369]Get the Second Most Recent Activity","frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"},{"articleLive":2,"formTitle":"[1370]Increasing Decreasing String","frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"},{"articleLive":2,"formTitle":"[1371]Find the Longest Substring Containing Vowels in Even Counts","frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"articleLive":2,"formTitle":"[1372]Longest ZigZag Path in a Binary Tree","frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1373]Maximum Sum BST in Binary Tree","frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree"},{"articleLive":2,"formTitle":"[1374]Generate a String With Characters That Have Odd Counts","frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"articleLive":2,"formTitle":"[1375]Bulb Switcher III","frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","title":"Bulb Switcher III","titleSlug":"bulb-switcher-iii"},{"articleLive":2,"formTitle":"[1376]Time Needed to Inform All Employees","frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees"},{"articleLive":2,"formTitle":"[1377]Frog Position After T Seconds","frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds"},{"articleLive":2,"formTitle":"[1378]Replace Employee ID With The Unique Identifier","frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"articleLive":2,"formTitle":"[1379]Find a Corresponding Node of a Binary Tree in a Clone of That Tree","frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","title":"Find a Corresponding Node of a Binary Tree in a Clone of That Tree","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"articleLive":2,"formTitle":"[1380]Lucky Numbers in a Matrix","frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix"},{"articleLive":2,"formTitle":"[1381]Design a Stack With Increment Operation","frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"","title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation"},{"articleLive":2,"formTitle":"[1382]Balance a Binary Search Tree","frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree"},{"articleLive":2,"formTitle":"[1383]Maximum Performance of a Team","frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team"},{"articleLive":2,"formTitle":"[1384]Total Sales Amount by Year","frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year"},{"articleLive":2,"formTitle":"[1385]Find the Distance Value Between Two Arrays","frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays"},{"articleLive":2,"formTitle":"[1386]Cinema Seat Allocation","frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation"},{"articleLive":2,"formTitle":"[1387]Sort Integers by The Power Value","frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value"},{"articleLive":2,"formTitle":"[1388]Pizza With 3n Slices","frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices"},{"articleLive":2,"formTitle":"[1389]Create Target Array in the Given Order","frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order"},{"articleLive":2,"formTitle":"[1390]Four Divisors","frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","title":"Four Divisors","titleSlug":"four-divisors"},{"articleLive":2,"formTitle":"[1391]Check if There is a Valid Path in a Grid","frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"articleLive":2,"formTitle":"[1392]Longest Happy Prefix","frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix"},{"articleLive":2,"formTitle":"[1393]Capital Gain/Loss","frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","title":"Capital Gain/Loss","titleSlug":"capital-gainloss"},{"articleLive":2,"formTitle":"[1394]Find Lucky Integer in an Array","frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array"},{"articleLive":2,"formTitle":"[1395]Count Number of Teams","frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","title":"Count Number of Teams","titleSlug":"count-number-of-teams"},{"articleLive":2,"formTitle":"[1396]Design Underground System","frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","title":"Design Underground System","titleSlug":"design-underground-system"},{"articleLive":2,"formTitle":"[1397]Find All Good Strings","frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","title":"Find All Good Strings","titleSlug":"find-all-good-strings"},{"articleLive":2,"formTitle":"[1398]Customers Who Bought Products A and B but Not C","frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"articleLive":2,"formTitle":"[1399]Count Largest Group","frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","title":"Count Largest Group","titleSlug":"count-largest-group"},{"articleLive":2,"formTitle":"[1400]Construct K Palindrome Strings","frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"},{"articleLive":2,"formTitle":"[1401]Circle and Rectangle Overlapping","frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"},{"articleLive":2,"formTitle":"[1402]Reducing Dishes","frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","title":"Reducing Dishes","titleSlug":"reducing-dishes"},{"articleLive":2,"formTitle":"[1403]Minimum Subsequence in Non-Increasing Order","frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"articleLive":2,"formTitle":"[1404]Number of Steps to Reduce a Number in Binary Representation to One","frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","title":"Number of Steps to Reduce a Number in Binary Representation to One","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"articleLive":2,"formTitle":"[1405]Longest Happy String","frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","title":"Longest Happy String","titleSlug":"longest-happy-string"},{"articleLive":2,"formTitle":"[1406]Stone Game III","frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","title":"Stone Game III","titleSlug":"stone-game-iii"},{"articleLive":2,"formTitle":"[1407]Top Travellers","frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","title":"Top Travellers","titleSlug":"top-travellers"},{"articleLive":2,"formTitle":"[1408]String Matching in an Array","frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"},{"articleLive":2,"formTitle":"[1409]Queries on a Permutation With Key","frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"},{"articleLive":2,"formTitle":"[1410]HTML Entity Parser","frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"","title":"HTML Entity Parser","titleSlug":"html-entity-parser"},{"articleLive":2,"formTitle":"[1411]Number of Ways to Paint N × 3 Grid","frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"articleLive":2,"formTitle":"[1412]Find the Quiet Students in All Exams","frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams"},{"articleLive":2,"formTitle":"[1413]Minimum Value to Get Positive Step by Step Sum","frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"articleLive":2,"formTitle":"[1414]Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"articleLive":2,"formTitle":"[1415]The k-th Lexicographical String of All Happy Strings of Length n","frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","title":"The k-th Lexicographical String of All Happy Strings of Length n","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"articleLive":2,"formTitle":"[1416]Restore The Array","frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","title":"Restore The Array","titleSlug":"restore-the-array"},{"articleLive":2,"formTitle":"[1417]Reformat The String","frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","title":"Reformat The String","titleSlug":"reformat-the-string"},{"articleLive":2,"formTitle":"[1418]Display Table of Food Orders in a Restaurant","frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"","title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"articleLive":2,"formTitle":"[1419]Minimum Number of Frogs Croaking","frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"},{"articleLive":2,"formTitle":"[1420]Build Array Where You Can Find The Maximum Exactly K Comparisons","frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"articleLive":2,"formTitle":"[1421]NPV Queries","frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","title":"NPV Queries","titleSlug":"npv-queries"},{"articleLive":2,"formTitle":"[1422]Maximum Score After Splitting a String","frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"},{"articleLive":2,"formTitle":"[1423]Maximum Points You Can Obtain from Cards","frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"","title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"articleLive":2,"formTitle":"[1424]Diagonal Traverse II","frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"},{"articleLive":2,"formTitle":"[1425]Constrained Subsequence Sum","frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"},{"articleLive":2,"formTitle":"[1426]Counting Elements","frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","title":"Counting Elements","titleSlug":"counting-elements"},{"articleLive":2,"formTitle":"[1427]Perform String Shifts","frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","title":"Perform String Shifts","titleSlug":"perform-string-shifts"},{"articleLive":2,"formTitle":"[1428]Leftmost Column with at Least a One","frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"},{"articleLive":2,"formTitle":"[1429]First Unique Number","frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","title":"First Unique Number","titleSlug":"first-unique-number"},{"articleLive":2,"formTitle":"[1430]Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","title":"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1431]Kids With the Greatest Number of Candies","frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies"},{"articleLive":2,"formTitle":"[1432]Max Difference You Can Get From Changing an Integer","frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"articleLive":2,"formTitle":"[1433]Check If a String Can Break Another String","frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string"},{"articleLive":2,"formTitle":"[1434]Number of Ways to Wear Different Hats to Each Other","frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"articleLive":2,"formTitle":"[1435]Create a Session Bar Chart","frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart"},{"articleLive":2,"formTitle":"[1436]Destination City","frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","title":"Destination City","titleSlug":"destination-city"},{"articleLive":2,"formTitle":"[1437]Check If All 1's Are at Least Length K Places Away","frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","title":"Check If All 1's Are at Least Length K Places Away","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"articleLive":2,"formTitle":"[1438]Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"articleLive":2,"formTitle":"[1439]Find the Kth Smallest Sum of a Matrix With Sorted Rows","frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"articleLive":2,"formTitle":"[1440]Evaluate Boolean Expression","frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression"},{"articleLive":2,"formTitle":"[1441]Build an Array With Stack Operations","frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"","title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations"},{"articleLive":2,"formTitle":"[1442]Count Triplets That Can Form Two Arrays of Equal XOR","frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"","title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"articleLive":2,"formTitle":"[1443]Minimum Time to Collect All Apples in a Tree","frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"articleLive":2,"formTitle":"[1444]Number of Ways of Cutting a Pizza","frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"articleLive":2,"formTitle":"[1445]Apples & Oranges","frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","title":"Apples & Oranges","titleSlug":"apples-oranges"},{"articleLive":2,"formTitle":"[1446]Consecutive Characters","frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","title":"Consecutive Characters","titleSlug":"consecutive-characters"},{"articleLive":2,"formTitle":"[1447]Simplified Fractions","frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","title":"Simplified Fractions","titleSlug":"simplified-fractions"},{"articleLive":2,"formTitle":"[1448]Count Good Nodes in Binary Tree","frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree"},{"articleLive":2,"formTitle":"[1449]Form Largest Integer With Digits That Add up to Target","frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"","title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"articleLive":2,"formTitle":"[1450]Number of Students Doing Homework at a Given Time","frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"articleLive":2,"formTitle":"[1451]Rearrange Words in a Sentence","frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence"},{"articleLive":2,"formTitle":"[1452]People Whose List of Favorite Companies Is Not a Subset of Another List","frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","title":"People Whose List of Favorite Companies Is Not a Subset of Another List","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"articleLive":2,"formTitle":"[1453]Maximum Number of Darts Inside of a Circular Dartboard","frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"articleLive":2,"formTitle":"[1454]Active Users","frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","title":"Active Users","titleSlug":"active-users"},{"articleLive":2,"formTitle":"[1455]Check If a Word Occurs As a Prefix of Any Word in a Sentence","frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"articleLive":2,"formTitle":"[1456]Maximum Number of Vowels in a Substring of Given Length","frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"articleLive":2,"formTitle":"[1457]Pseudo-Palindromic Paths in a Binary Tree","frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1458]Max Dot Product of Two Subsequences","frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences"},{"articleLive":2,"formTitle":"[1459]Rectangles Area","frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","title":"Rectangles Area","titleSlug":"rectangles-area"},{"articleLive":2,"formTitle":"[1460]Make Two Arrays Equal by Reversing Sub-arrays","frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"","title":"Make Two Arrays Equal by Reversing Sub-arrays","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"articleLive":2,"formTitle":"[1461]Check If a String Contains All Binary Codes of Size K","frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","title":"Check If a String Contains All Binary Codes of Size K","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"articleLive":2,"formTitle":"[1462]Course Schedule IV","frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","title":"Course Schedule IV","titleSlug":"course-schedule-iv"},{"articleLive":2,"formTitle":"[1463]Cherry Pickup II","frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"},{"articleLive":2,"formTitle":"[1464]Maximum Product of Two Elements in an Array","frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"articleLive":2,"formTitle":"[1465]Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"articleLive":2,"formTitle":"[1466]Reorder Routes to Make All Paths Lead to the City Zero","frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","title":"Reorder Routes to Make All Paths Lead to the City Zero","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"articleLive":2,"formTitle":"[1467]Probability of a Two Boxes Having The Same Number of Distinct Balls","frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"articleLive":2,"formTitle":"[1468]Calculate Salaries","frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","title":"Calculate Salaries","titleSlug":"calculate-salaries"},{"articleLive":2,"formTitle":"[1469]Find All The Lonely Nodes","frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes"},{"articleLive":2,"formTitle":"[1470]Shuffle the Array","frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","title":"Shuffle the Array","titleSlug":"shuffle-the-array"},{"articleLive":2,"formTitle":"[1471]The k Strongest Values in an Array","frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array"},{"articleLive":2,"formTitle":"[1472]Design Browser History","frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","title":"Design Browser History","titleSlug":"design-browser-history"},{"articleLive":2,"formTitle":"[1473]Paint House III","frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","title":"Paint House III","titleSlug":"paint-house-iii"},{"articleLive":2,"formTitle":"[1474]Delete N Nodes After M Nodes of a Linked List","frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"articleLive":2,"formTitle":"[1475]Final Prices With a Special Discount in a Shop","frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"articleLive":2,"formTitle":"[1476]Subrectangle Queries","frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","title":"Subrectangle Queries","titleSlug":"subrectangle-queries"},{"articleLive":2,"formTitle":"[1477]Find Two Non-overlapping Sub-arrays Each With Target Sum","frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"articleLive":2,"formTitle":"[1478]Allocate Mailboxes","frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"},{"articleLive":2,"formTitle":"[1479]Sales by Day of the Week","frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week"},{"articleLive":2,"formTitle":"[1480]Running Sum of 1d Array","frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array"},{"articleLive":2,"formTitle":"[1481]Least Number of Unique Integers after K Removals","frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"articleLive":2,"formTitle":"[1482]Minimum Number of Days to Make m Bouquets","frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"","title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"articleLive":2,"formTitle":"[1483]Kth Ancestor of a Tree Node","frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node"},{"articleLive":2,"formTitle":"[1484]Clone Binary Tree With Random Pointer","frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer"},{"articleLive":2,"formTitle":"[1485]Group Sold Products By The Date","frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date"},{"articleLive":2,"formTitle":"[1486]XOR Operation in an Array","frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"","title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array"},{"articleLive":2,"formTitle":"[1487]Making File Names Unique","frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","title":"Making File Names Unique","titleSlug":"making-file-names-unique"},{"articleLive":2,"formTitle":"[1488]Avoid Flood in The City","frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city"},{"articleLive":2,"formTitle":"[1489]Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"articleLive":2,"formTitle":"[1490]Clone N-ary Tree","frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree"},{"articleLive":2,"formTitle":"[1491]Average Salary Excluding the Minimum and Maximum Salary","frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"articleLive":2,"formTitle":"[1492]The kth Factor of n","frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n"},{"articleLive":2,"formTitle":"[1493]Longest Subarray of 1's After Deleting One Element","frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"articleLive":2,"formTitle":"[1494]Parallel Courses II","frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","title":"Parallel Courses II","titleSlug":"parallel-courses-ii"},{"articleLive":2,"formTitle":"[1495]Friendly Movies Streamed Last Month","frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month"},{"articleLive":2,"formTitle":"[1496]Path Crossing","frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","title":"Path Crossing","titleSlug":"path-crossing"},{"articleLive":2,"formTitle":"[1497]Check If Array Pairs Are Divisible by k","frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"articleLive":2,"formTitle":"[1498]Number of Subsequences That Satisfy the Given Sum Condition","frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"articleLive":2,"formTitle":"[1499]Max Value of Equation","frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","title":"Max Value of Equation","titleSlug":"max-value-of-equation"},{"articleLive":2,"formTitle":"[1500]Design a File Sharing System","frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system"},{"articleLive":2,"formTitle":"[1501]Countries You Can Safely Invest In","frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in"},{"articleLive":2,"formTitle":"[1502]Can Make Arithmetic Progression From Sequence","frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"articleLive":2,"formTitle":"[1503]Last Moment Before All Ants Fall Out of a Plank","frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"articleLive":2,"formTitle":"[1504]Count Submatrices With All Ones","frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones"},{"articleLive":2,"formTitle":"[1505]Minimum Possible Integer After at Most K Adjacent Swaps On Digits","frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"articleLive":2,"formTitle":"[1506]Find Root of N-Ary Tree","frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1507]Reformat Date","frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","title":"Reformat Date","titleSlug":"reformat-date"},{"articleLive":2,"formTitle":"[1508]Range Sum of Sorted Subarray Sums","frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums"},{"articleLive":2,"formTitle":"[1509]Minimum Difference Between Largest and Smallest Value in Three Moves","frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"articleLive":2,"formTitle":"[1510]Stone Game IV","frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","title":"Stone Game IV","titleSlug":"stone-game-iv"},{"articleLive":2,"formTitle":"[1511]Customer Order Frequency","frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","title":"Customer Order Frequency","titleSlug":"customer-order-frequency"},{"articleLive":2,"formTitle":"[1512]Number of Good Pairs","frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","title":"Number of Good Pairs","titleSlug":"number-of-good-pairs"},{"articleLive":2,"formTitle":"[1513]Number of Substrings With Only 1s","frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s"},{"articleLive":2,"formTitle":"[1514]Path with Maximum Probability","frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability"},{"articleLive":2,"formTitle":"[1515]Best Position for a Service Centre","frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre"},{"articleLive":2,"formTitle":"[1516]Move Sub-Tree of N-Ary Tree","frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1517]Find Users With Valid E-Mails","frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails"},{"articleLive":2,"formTitle":"[1518]Water Bottles","frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","title":"Water Bottles","titleSlug":"water-bottles"},{"articleLive":2,"formTitle":"[1519]Number of Nodes in the Sub-Tree With the Same Label","frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","title":"Number of Nodes in the Sub-Tree With the Same Label","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"articleLive":2,"formTitle":"[1520]Maximum Number of Non-Overlapping Substrings","frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"articleLive":2,"formTitle":"[1521]Find a Value of a Mysterious Function Closest to Target","frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"articleLive":2,"formTitle":"[1522]Diameter of N-Ary Tree","frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree"},{"articleLive":2,"formTitle":"[1523]Count Odd Numbers in an Interval Range","frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range"},{"articleLive":2,"formTitle":"[1524]Number of Sub-arrays With Odd Sum","frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"articleLive":2,"formTitle":"[1525]Number of Good Ways to Split a String","frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string"},{"articleLive":2,"formTitle":"[1526]Minimum Number of Increments on Subarrays to Form a Target Array","frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","title":"Minimum Number of Increments on Subarrays to Form a Target Array","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"articleLive":2,"formTitle":"[1527]Patients With a Condition","frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","title":"Patients With a Condition","titleSlug":"patients-with-a-condition"},{"articleLive":2,"formTitle":"[1528]Shuffle String","frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","title":"Shuffle String","titleSlug":"shuffle-string"},{"articleLive":2,"formTitle":"[1529]Bulb Switcher IV","frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","title":"Bulb Switcher IV","titleSlug":"bulb-switcher-iv"},{"articleLive":2,"formTitle":"[1530]Number of Good Leaf Nodes Pairs","frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs"},{"articleLive":2,"formTitle":"[1531]String Compression II","frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","title":"String Compression II","titleSlug":"string-compression-ii"},{"articleLive":2,"formTitle":"[1532]The Most Recent Three Orders","frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders"},{"articleLive":2,"formTitle":"[1533]Find the Index of the Large Integer","frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer"},{"articleLive":2,"formTitle":"[1534]Count Good Triplets","frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","title":"Count Good Triplets","titleSlug":"count-good-triplets"},{"articleLive":2,"formTitle":"[1535]Find the Winner of an Array Game","frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game"},{"articleLive":2,"formTitle":"[1536]Minimum Swaps to Arrange a Binary Grid","frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"articleLive":2,"formTitle":"[1537]Get the Maximum Score","frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","title":"Get the Maximum Score","titleSlug":"get-the-maximum-score"},{"articleLive":2,"formTitle":"[1538]Guess the Majority in a Hidden Array","frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array"},{"articleLive":2,"formTitle":"[1539]Kth Missing Positive Number","frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number"},{"articleLive":2,"formTitle":"[1540]Can Convert String in K Moves","frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves"},{"articleLive":2,"formTitle":"[1541]Minimum Insertions to Balance a Parentheses String","frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"","title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"articleLive":2,"formTitle":"[1542]Find Longest Awesome Substring","frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring"},{"articleLive":2,"formTitle":"[1543]Fix Product Name Format","frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","title":"Fix Product Name Format","titleSlug":"fix-product-name-format"},{"articleLive":2,"formTitle":"[1544]Make The String Great","frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"","title":"Make The String Great","titleSlug":"make-the-string-great"},{"articleLive":2,"formTitle":"[1545]Find Kth Bit in Nth Binary String","frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string"},{"articleLive":2,"formTitle":"[1546]Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"articleLive":2,"formTitle":"[1547]Minimum Cost to Cut a Stick","frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick"},{"articleLive":2,"formTitle":"[1548]The Most Similar Path in a Graph","frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph"},{"articleLive":2,"formTitle":"[1549]The Most Recent Orders for Each Product","frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product"},{"articleLive":2,"formTitle":"[1550]Three Consecutive Odds","frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds"},{"articleLive":2,"formTitle":"[1551]Minimum Operations to Make Array Equal","frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal"},{"articleLive":2,"formTitle":"[1552]Magnetic Force Between Two Balls","frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls"},{"articleLive":2,"formTitle":"[1553]Minimum Number of Days to Eat N Oranges","frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"articleLive":2,"formTitle":"[1554]Strings Differ by One Character","frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character"},{"articleLive":2,"formTitle":"[1555]Bank Account Summary","frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","title":"Bank Account Summary","titleSlug":"bank-account-summary"},{"articleLive":2,"formTitle":"[1556]Thousand Separator","frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","title":"Thousand Separator","titleSlug":"thousand-separator"},{"articleLive":2,"formTitle":"[1557]Minimum Number of Vertices to Reach All Nodes","frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"articleLive":2,"formTitle":"[1558]Minimum Numbers of Function Calls to Make Target Array","frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"articleLive":2,"formTitle":"[1559]Detect Cycles in 2D Grid","frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid"},{"articleLive":2,"formTitle":"[1560]Most Visited Sector in  a Circular Track","frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","title":"Most Visited Sector in  a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track"},{"articleLive":2,"formTitle":"[1561]Maximum Number of Coins You Can Get","frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get"},{"articleLive":2,"formTitle":"[1562]Find Latest Group of Size M","frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m"},{"articleLive":2,"formTitle":"[1563]Stone Game V","frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","title":"Stone Game V","titleSlug":"stone-game-v"},{"articleLive":2,"formTitle":"[1564]Put Boxes Into the Warehouse I","frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i"},{"articleLive":2,"formTitle":"[1565]Unique Orders and Customers Per Month","frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month"},{"articleLive":2,"formTitle":"[1566]Detect Pattern of Length M Repeated K or More Times","frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"articleLive":2,"formTitle":"[1567]Maximum Length of Subarray With Positive Product","frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"articleLive":2,"formTitle":"[1568]Minimum Number of Days to Disconnect Island","frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"articleLive":2,"formTitle":"[1569]Number of Ways to Reorder Array to Get Same BST","frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"articleLive":2,"formTitle":"[1570]Dot Product of Two Sparse Vectors","frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors"},{"articleLive":2,"formTitle":"[1571]Warehouse Manager","frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","title":"Warehouse Manager","titleSlug":"warehouse-manager"},{"articleLive":2,"formTitle":"[1572]Matrix Diagonal Sum","frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum"},{"articleLive":2,"formTitle":"[1573]Number of Ways to Split a String","frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string"},{"articleLive":2,"formTitle":"[1574]Shortest Subarray to be Removed to Make Array Sorted","frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"articleLive":2,"formTitle":"[1575]Count All Possible Routes","frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","title":"Count All Possible Routes","titleSlug":"count-all-possible-routes"},{"articleLive":2,"formTitle":"[1576]Replace All ?'s to Avoid Consecutive Repeating Characters","frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"articleLive":2,"formTitle":"[1577]Number of Ways Where Square of Number Is Equal to Product of Two Numbers","frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"articleLive":2,"formTitle":"[1578]Minimum Deletion Cost to Avoid Repeating Letters","frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","title":"Minimum Deletion Cost to Avoid Repeating Letters","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"articleLive":2,"formTitle":"[1579]Remove Max Number of Edges to Keep Graph Fully Traversable","frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"articleLive":2,"formTitle":"[1580]Put Boxes Into the Warehouse II","frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"articleLive":2,"formTitle":"[1581]Customer Who Visited but Did Not Make Any Transactions","frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"articleLive":2,"formTitle":"[1582]Special Positions in a Binary Matrix","frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix"},{"articleLive":2,"formTitle":"[1583]Count Unhappy Friends","frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends"},{"articleLive":2,"formTitle":"[1584]Min Cost to Connect All Points","frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points"},{"articleLive":2,"formTitle":"[1585]Check If String Is Transformable With Substring Sort Operations","frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"articleLive":2,"formTitle":"[1586]Binary Search Tree Iterator II","frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii"},{"articleLive":2,"formTitle":"[1587]Bank Account Summary II","frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii"},{"articleLive":2,"formTitle":"[1588]Sum of All Odd Length Subarrays","frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays"},{"articleLive":2,"formTitle":"[1589]Maximum Sum Obtained of Any Permutation","frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"articleLive":2,"formTitle":"[1590]Make Sum Divisible by P","frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p"},{"articleLive":2,"formTitle":"[1591]Strange Printer II","frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","title":"Strange Printer II","titleSlug":"strange-printer-ii"},{"articleLive":2,"formTitle":"[1592]Rearrange Spaces Between Words","frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words"},{"articleLive":2,"formTitle":"[1593]Split a String Into the Max Number of Unique Substrings","frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"articleLive":2,"formTitle":"[1594]Maximum Non Negative Product in a Matrix","frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"articleLive":2,"formTitle":"[1595]Minimum Cost to Connect Two Groups of Points","frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"articleLive":2,"formTitle":"[1596]The Most Frequently Ordered Products for Each Customer","frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"articleLive":2,"formTitle":"[1597]Build Binary Expression Tree From Infix Expression","frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"articleLive":2,"formTitle":"[1598]Crawler Log Folder","frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"","title":"Crawler Log Folder","titleSlug":"crawler-log-folder"},{"articleLive":2,"formTitle":"[1599]Maximum Profit of Operating a Centennial Wheel","frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"articleLive":2,"formTitle":"[1600]Throne Inheritance","frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","title":"Throne Inheritance","titleSlug":"throne-inheritance"},{"articleLive":2,"formTitle":"[1601]Maximum Number of Achievable Transfer Requests","frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"articleLive":2,"formTitle":"[1602]Find Nearest Right Node in Binary Tree","frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree"},{"articleLive":2,"formTitle":"[1603]Design Parking System","frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"","title":"Design Parking System","titleSlug":"design-parking-system"},{"articleLive":2,"formTitle":"[1604]Alert Using Same Key-Card Three or More Times in a One Hour Period","frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"articleLive":2,"formTitle":"[1605]Find Valid Matrix Given Row and Column Sums","frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"articleLive":2,"formTitle":"[1606]Find Servers That Handled Most Number of Requests","frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"articleLive":2,"formTitle":"[1607]Sellers With No Sales","frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales"},{"articleLive":2,"formTitle":"[1608]Special Array With X Elements Greater Than or Equal X","frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"articleLive":2,"formTitle":"[1609]Even Odd Tree","frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","title":"Even Odd Tree","titleSlug":"even-odd-tree"},{"articleLive":2,"formTitle":"[1610]Maximum Number of Visible Points","frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points"},{"articleLive":2,"formTitle":"[1611]Minimum One Bit Operations to Make Integers Zero","frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"articleLive":2,"formTitle":"[1612]Check If Two Expression Trees are Equivalent","frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"articleLive":2,"formTitle":"[1613]Find the Missing IDs","frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","title":"Find the Missing IDs","titleSlug":"find-the-missing-ids"},{"articleLive":2,"formTitle":"[1614]Maximum Nesting Depth of the Parentheses","frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"articleLive":2,"formTitle":"[1615]Maximal Network Rank","frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","title":"Maximal Network Rank","titleSlug":"maximal-network-rank"},{"articleLive":2,"formTitle":"[1616]Split Two Strings to Make Palindrome","frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome"},{"articleLive":2,"formTitle":"[1617]Count Subtrees With Max Distance Between Cities","frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"articleLive":2,"formTitle":"[1618]Maximum Font to Fit a Sentence in a Screen","frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"articleLive":2,"formTitle":"[1619]Mean of Array After Removing Some Elements","frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements"},{"articleLive":2,"formTitle":"[1620]Coordinate With Maximum Network Quality","frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality"},{"articleLive":2,"formTitle":"[1621]Number of Sets of K Non-Overlapping Line Segments","frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"articleLive":2,"formTitle":"[1622]Fancy Sequence","frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","title":"Fancy Sequence","titleSlug":"fancy-sequence"},{"articleLive":2,"formTitle":"[1623]All Valid Triplets That Can Represent a Country","frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"articleLive":2,"formTitle":"[1624]Largest Substring Between Two Equal Characters","frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters"},{"articleLive":2,"formTitle":"[1625]Lexicographically Smallest String After Applying Operations","frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"articleLive":2,"formTitle":"[1626]Best Team With No Conflicts","frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts"},{"articleLive":2,"formTitle":"[1627]Graph Connectivity With Threshold","frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold"},{"articleLive":2,"formTitle":"[1628]Design an Expression Tree With Evaluate Function","frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"articleLive":2,"formTitle":"[1629]Slowest Key","frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","title":"Slowest Key","titleSlug":"slowest-key"},{"articleLive":2,"formTitle":"[1630]Arithmetic Subarrays","frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"},{"articleLive":2,"formTitle":"[1631]Path With Minimum Effort","frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort"},{"articleLive":2,"formTitle":"[1632]Rank Transform of a Matrix","frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix"},{"articleLive":2,"formTitle":"[1633]Percentage of Users Attended a Contest","frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest"},{"articleLive":2,"formTitle":"[1634]Add Two Polynomials Represented as Linked Lists","frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"articleLive":2,"formTitle":"[1635]Hopper Company Queries I","frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i"},{"articleLive":2,"formTitle":"[1636]Sort Array by Increasing Frequency","frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency"},{"articleLive":2,"formTitle":"[1637]Widest Vertical Area Between Two Points Containing No Points","frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"articleLive":2,"formTitle":"[1638]Count Substrings That Differ by One Character","frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character"},{"articleLive":2,"formTitle":"[1639]Number of Ways to Form a Target String Given a Dictionary","frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","title":"Number of Ways to Form a Target String Given a Dictionary","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"articleLive":2,"formTitle":"[1640]Check Array Formation Through Concatenation","frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation"},{"articleLive":2,"formTitle":"[1641]Count Sorted Vowel Strings","frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings"},{"articleLive":2,"formTitle":"[1642]Furthest Building You Can Reach","frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach"},{"articleLive":2,"formTitle":"[1643]Kth Smallest Instructions","frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions"},{"articleLive":2,"formTitle":"[1644]Lowest Common Ancestor of a Binary Tree II","frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"articleLive":2,"formTitle":"[1645]Hopper Company Queries II","frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"articleLive":2,"formTitle":"[1646]Get Maximum in Generated Array","frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array"},{"articleLive":2,"formTitle":"[1647]Minimum Deletions to Make Character Frequencies Unique","frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"articleLive":2,"formTitle":"[1648]Sell Diminishing-Valued Colored Balls","frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls"},{"articleLive":2,"formTitle":"[1649]Create Sorted Array through Instructions","frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions"},{"articleLive":2,"formTitle":"[1650]Lowest Common Ancestor of a Binary Tree III","frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"articleLive":2,"formTitle":"[1651]Hopper Company Queries III","frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"articleLive":2,"formTitle":"[1652]Defuse the Bomb","frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","title":"Defuse the Bomb","titleSlug":"defuse-the-bomb"},{"articleLive":2,"formTitle":"[1653]Minimum Deletions to Make String Balanced","frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced"},{"articleLive":2,"formTitle":"[1654]Minimum Jumps to Reach Home","frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home"},{"articleLive":2,"formTitle":"[1655]Distribute Repeating Integers","frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers"},{"articleLive":2,"formTitle":"[1656]Design an Ordered Stream","frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream"},{"articleLive":2,"formTitle":"[1657]Determine if Two Strings Are Close","frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close"},{"articleLive":2,"formTitle":"[1658]Minimum Operations to Reduce X to Zero","frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"articleLive":2,"formTitle":"[1659]Maximize Grid Happiness","frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness"},{"articleLive":2,"formTitle":"[1660]Correct a Binary Tree","frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree"},{"articleLive":2,"formTitle":"[1661]Average Time of Process per Machine","frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine"},{"articleLive":2,"formTitle":"[1662]Check If Two String Arrays are Equivalent","frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"articleLive":2,"formTitle":"[1663]Smallest String With A Given Numeric Value","frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value"},{"articleLive":2,"formTitle":"[1664]Ways to Make a Fair Array","frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array"},{"articleLive":2,"formTitle":"[1665]Minimum Initial Energy to Finish Tasks","frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"articleLive":2,"formTitle":"[1666]Change the Root of a Binary Tree","frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree"},{"articleLive":2,"formTitle":"[1667]Fix Names in a Table","frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table"},{"articleLive":2,"formTitle":"[1668]Maximum Repeating Substring","frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring"},{"articleLive":2,"formTitle":"[1669]Merge In Between Linked Lists","frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"","title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists"},{"articleLive":2,"formTitle":"[1670]Design Front Middle Back Queue","frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"","title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue"},{"articleLive":2,"formTitle":"[1671]Minimum Number of Removals to Make Mountain Array","frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"articleLive":2,"formTitle":"[1672]Richest Customer Wealth","frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth"},{"articleLive":2,"formTitle":"[1673]Find the Most Competitive Subsequence","frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"","title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence"},{"articleLive":2,"formTitle":"[1674]Minimum Moves to Make Array Complementary","frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary"},{"articleLive":2,"formTitle":"[1675]Minimize Deviation in Array","frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array"},{"articleLive":2,"formTitle":"[1676]Lowest Common Ancestor of a Binary Tree IV","frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"articleLive":2,"formTitle":"[1677]Product's Worth Over Invoices","frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices"},{"articleLive":2,"formTitle":"[1678]Goal Parser Interpretation","frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation"},{"articleLive":2,"formTitle":"[1679]Max Number of K-Sum Pairs","frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs"},{"articleLive":2,"formTitle":"[1680]Concatenation of Consecutive Binary Numbers","frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"articleLive":2,"formTitle":"[1681]Minimum Incompatibility","frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"},{"articleLive":2,"formTitle":"[1682]Longest Palindromic Subsequence II","frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii"},{"articleLive":2,"formTitle":"[1683]Invalid Tweets","frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","title":"Invalid Tweets","titleSlug":"invalid-tweets"},{"articleLive":2,"formTitle":"[1684]Count the Number of Consistent Strings","frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings"},{"articleLive":2,"formTitle":"[1685]Sum of Absolute Differences in a Sorted Array","frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"articleLive":2,"formTitle":"[1686]Stone Game VI","frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","title":"Stone Game VI","titleSlug":"stone-game-vi"},{"articleLive":2,"formTitle":"[1687]Delivering Boxes from Storage to Ports","frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports"},{"articleLive":2,"formTitle":"[1688]Count of Matches in Tournament","frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament"},{"articleLive":2,"formTitle":"[1689]Partitioning Into Minimum Number Of Deci-Binary Numbers","frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"articleLive":2,"formTitle":"[1690]Stone Game VII","frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","title":"Stone Game VII","titleSlug":"stone-game-vii"},{"articleLive":2,"formTitle":"[1691]Maximum Height by Stacking Cuboids ","frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids"},{"articleLive":2,"formTitle":"[1692]Count Ways to Distribute Candies","frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies"},{"articleLive":2,"formTitle":"[1693]Daily Leads and Partners","frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners"},{"articleLive":2,"formTitle":"[1694]Reformat Phone Number","frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","title":"Reformat Phone Number","titleSlug":"reformat-phone-number"},{"articleLive":2,"formTitle":"[1695]Maximum Erasure Value","frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value"},{"articleLive":2,"formTitle":"[1696]Jump Game VI","frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","title":"Jump Game VI","titleSlug":"jump-game-vi"},{"articleLive":2,"formTitle":"[1697]Checking Existence of Edge Length Limited Paths","frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"articleLive":2,"formTitle":"[1698]Number of Distinct Substrings in a String","frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string"},{"articleLive":2,"formTitle":"[1699]Number of Calls Between Two Persons","frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons"},{"articleLive":2,"formTitle":"[1700]Number of Students Unable to Eat Lunch","frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch"},{"articleLive":2,"formTitle":"[1701]Average Waiting Time","frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","title":"Average Waiting Time","titleSlug":"average-waiting-time"},{"articleLive":2,"formTitle":"[1702]Maximum Binary String After Change","frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change"},{"articleLive":2,"formTitle":"[1703]Minimum Adjacent Swaps for K Consecutive Ones","frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"articleLive":2,"formTitle":"[1704]Determine if String Halves Are Alike","frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike"},{"articleLive":2,"formTitle":"[1705]Maximum Number of Eaten Apples","frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples"},{"articleLive":2,"formTitle":"[1706]Where Will the Ball Fall","frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall"},{"articleLive":2,"formTitle":"[1707]Maximum XOR With an Element From Array","frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array"},{"articleLive":2,"formTitle":"[1708]Largest Subarray Length K","frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k"},{"articleLive":2,"formTitle":"[1709]Biggest Window Between Visits","frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits"},{"articleLive":2,"formTitle":"[1710]Maximum Units on a Truck","frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck"},{"articleLive":2,"formTitle":"[1711]Count Good Meals","frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"","title":"Count Good Meals","titleSlug":"count-good-meals"},{"articleLive":2,"formTitle":"[1712]Ways to Split Array Into Three Subarrays","frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays"},{"articleLive":2,"formTitle":"[1713]Minimum Operations to Make a Subsequence","frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"","title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence"},{"articleLive":2,"formTitle":"[1714]Sum Of Special Evenly-Spaced Elements In Array","frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"lock","title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"articleLive":2,"formTitle":"[1715]Count Apples and Oranges","frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges"},{"articleLive":2,"formTitle":"[1716]Calculate Money in Leetcode Bank","frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank"},{"articleLive":2,"formTitle":"[1717]Maximum Score From Removing Substrings","frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings"},{"articleLive":2,"formTitle":"[1718]Construct the Lexicographically Largest Valid Sequence","frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"articleLive":2,"formTitle":"[1719]Number Of Ways To Reconstruct A Tree","frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"articleLive":2,"formTitle":"[1720]Decode XORed Array","frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"","title":"Decode XORed Array","titleSlug":"decode-xored-array"},{"articleLive":2,"formTitle":"[1721]Swapping Nodes in a Linked List","frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"","title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list"},{"articleLive":2,"formTitle":"[1722]Minimize Hamming Distance After Swap Operations","frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"articleLive":2,"formTitle":"[1723]Find Minimum Time to Finish All Jobs","frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"","title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"articleLive":2,"formTitle":"[1724]Checking Existence of Edge Length Limited Paths II","frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"articleLive":2,"formTitle":"[1725]Number Of Rectangles That Can Form The Largest Square","frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"articleLive":2,"formTitle":"[1726]Tuple with Same Product","frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","title":"Tuple with Same Product","titleSlug":"tuple-with-same-product"},{"articleLive":2,"formTitle":"[1727]Largest Submatrix With Rearrangements","frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"},{"articleLive":2,"formTitle":"[1728]Cat and Mouse II","frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"},{"articleLive":2,"formTitle":"[1729]Find Followers Count","frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","title":"Find Followers Count","titleSlug":"find-followers-count"},{"articleLive":2,"formTitle":"[1730]Shortest Path to Get Food","frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"},{"articleLive":2,"formTitle":"[1731]The Number of Employees Which Report to Each Employee","frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"articleLive":2,"formTitle":"[1732]Find the Highest Altitude","frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"},{"articleLive":2,"formTitle":"[1733]Minimum Number of People to Teach","frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"},{"articleLive":2,"formTitle":"[1734]Decode XORed Permutation","frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"","title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation"},{"articleLive":2,"formTitle":"[1735]Count Ways to Make Array With Product","frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product"},{"articleLive":2,"formTitle":"[1736]Latest Time by Replacing Hidden Digits","frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"","title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits"},{"articleLive":2,"formTitle":"[1737]Change Minimum Characters to Satisfy One of Three Conditions","frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"articleLive":2,"formTitle":"[1738]Find Kth Largest XOR Coordinate Value","frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"","title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value"},{"articleLive":2,"formTitle":"[1739]Building Boxes","frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","title":"Building Boxes","titleSlug":"building-boxes"},{"articleLive":2,"formTitle":"[1740]Find Distance in a Binary Tree","frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree"},{"articleLive":2,"formTitle":"[1741]Find Total Time Spent by Each Employee","frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee"},{"articleLive":2,"formTitle":"[1742]Maximum Number of Balls in a Box","frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box"},{"articleLive":2,"formTitle":"[1743]Restore the Array From Adjacent Pairs","frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"","title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs"},{"articleLive":2,"formTitle":"[1744]Can You Eat Your Favorite Candy on Your Favorite Day?","frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"","title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"articleLive":2,"formTitle":"[1745]Palindrome Partitioning IV","frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv"},{"articleLive":2,"formTitle":"[1746]Maximum Subarray Sum After One Operation","frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation"},{"articleLive":2,"formTitle":"[1747]Leetflex Banned Accounts","frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts"},{"articleLive":2,"formTitle":"[1748]Sum of Unique Elements","frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements"},{"articleLive":2,"formTitle":"[1749]Maximum Absolute Sum of Any Subarray","frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"articleLive":2,"formTitle":"[1750]Minimum Length of String After Deleting Similar Ends","frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"articleLive":2,"formTitle":"[1751]Maximum Number of Events That Can Be Attended II","frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"articleLive":2,"formTitle":"[1752]Check if Array Is Sorted and Rotated","frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated"},{"articleLive":2,"formTitle":"[1753]Maximum Score From Removing Stones","frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones"},{"articleLive":2,"formTitle":"[1754]Largest Merge Of Two Strings","frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings"},{"articleLive":2,"formTitle":"[1755]Closest Subsequence Sum","frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum"},{"articleLive":2,"formTitle":"[1756]Design Most Recently Used Queue","frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue"},{"articleLive":2,"formTitle":"[1757]Recyclable and Low Fat Products","frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products"},{"articleLive":2,"formTitle":"[1758]Minimum Changes To Make Alternating Binary String","frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"articleLive":2,"formTitle":"[1759]Count Number of Homogenous Substrings","frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings"},{"articleLive":2,"formTitle":"[1760]Minimum Limit of Balls in a Bag","frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"articleLive":2,"formTitle":"[1761]Minimum Degree of a Connected Trio in a Graph","frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"articleLive":2,"formTitle":"[1762]Buildings With an Ocean View","frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"},{"articleLive":2,"formTitle":"[1763]Longest Nice Substring","frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","title":"Longest Nice Substring","titleSlug":"longest-nice-substring"},{"articleLive":2,"formTitle":"[1764]Form Array by Concatenating Subarrays of Another Array","frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"articleLive":2,"formTitle":"[1765]Map of Highest Peak","frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"},{"articleLive":2,"formTitle":"[1766]Tree of Coprimes","frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"},{"articleLive":2,"formTitle":"[1767]Find the Subtasks That Did Not Execute","frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"},{"articleLive":2,"formTitle":"[1768]Merge Strings Alternately","frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"},{"articleLive":2,"formTitle":"[1769]Minimum Number of Operations to Move All Balls to Each Box","frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","title":"Minimum Number of Operations to Move All Balls to Each Box","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"articleLive":2,"formTitle":"[1770]Maximum Score from Performing Multiplication Operations","frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"articleLive":2,"formTitle":"[1771]Maximize Palindrome Length From Subsequences","frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"},{"articleLive":2,"formTitle":"[1772]Sort Features by Popularity","frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"},{"articleLive":2,"formTitle":"[1773]Count Items Matching a Rule","frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule"},{"articleLive":2,"formTitle":"[1774]Closest Dessert Cost","frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost"},{"articleLive":2,"formTitle":"[1775]Equal Sum Arrays With Minimum Number of Operations","frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"articleLive":2,"formTitle":"[1776]Car Fleet II","frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","title":"Car Fleet II","titleSlug":"car-fleet-ii"},{"articleLive":2,"formTitle":"[1777]Product's Price for Each Store","frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store"},{"articleLive":2,"formTitle":"[1778]Shortest Path in a Hidden Grid","frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"},{"articleLive":2,"formTitle":"[1779]Find Nearest Point That Has the Same X or Y Coordinate","frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","title":"Find Nearest Point That Has the Same X or Y Coordinate","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"articleLive":2,"formTitle":"[1780]Check if Number is a Sum of Powers of Three","frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"articleLive":2,"formTitle":"[1781]Sum of Beauty of All Substrings","frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings"},{"articleLive":2,"formTitle":"[1782]Count Pairs Of Nodes","frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes"},{"articleLive":2,"formTitle":"[1783]Grand Slam Titles","frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","title":"Grand Slam Titles","titleSlug":"grand-slam-titles"},{"articleLive":2,"formTitle":"[1784]Check if Binary String Has at Most One Segment of Ones","frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","title":"Check if Binary String Has at Most One Segment of Ones","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"articleLive":2,"formTitle":"[1785]Minimum Elements to Add to Form a Given Sum","frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"articleLive":2,"formTitle":"[1786]Number of Restricted Paths From First to Last Node","frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"articleLive":2,"formTitle":"[1787]Make the XOR of All Segments Equal to Zero","frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"","title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"articleLive":2,"formTitle":"[1788]Maximize the Beauty of the Garden","frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"},{"articleLive":2,"formTitle":"[1789]Primary Department for Each Employee","frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"},{"articleLive":2,"formTitle":"[1790]Check if One String Swap Can Make Strings Equal","frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"articleLive":2,"formTitle":"[1791]Find Center of Star Graph","frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph"},{"articleLive":2,"formTitle":"[1792]Maximum Average Pass Ratio","frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio"},{"articleLive":2,"formTitle":"[1793]Maximum Score of a Good Subarray","frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray"},{"articleLive":2,"formTitle":"[1794]Count Pairs of Equal Substrings With Minimum Difference","frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"articleLive":2,"formTitle":"[1795]Rearrange Products Table","frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","title":"Rearrange Products Table","titleSlug":"rearrange-products-table"},{"articleLive":2,"formTitle":"[1796]Second Largest Digit in a String","frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"","title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string"},{"articleLive":2,"formTitle":"[1797]Design Authentication Manager","frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"","title":"Design Authentication Manager","titleSlug":"design-authentication-manager"},{"articleLive":2,"formTitle":"[1798]Maximum Number of Consecutive Values You Can Make","frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"articleLive":2,"formTitle":"[1799]Maximize Score After N Operations","frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations"},{"articleLive":2,"formTitle":"[1800]Maximum Ascending Subarray Sum","frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"","title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum"},{"articleLive":2,"formTitle":"[1801]Number of Orders in the Backlog","frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"","title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog"},{"articleLive":2,"formTitle":"[1802]Maximum Value at a Given Index in a Bounded Array","frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"articleLive":2,"formTitle":"[1803]Count Pairs With XOR in a Range","frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"","title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range"},{"articleLive":2,"formTitle":"[1804]Implement Trie II (Prefix Tree)","frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree"},{"articleLive":2,"formTitle":"[1805]Number of Different Integers in a String","frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string"},{"articleLive":2,"formTitle":"[1806]Minimum Number of Operations to Reinitialize a Permutation","frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"articleLive":2,"formTitle":"[1807]Evaluate the Bracket Pairs of a String","frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"articleLive":2,"formTitle":"[1808]Maximize Number of Nice Divisors","frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors"},{"articleLive":2,"formTitle":"[1809]Ad-Free Sessions","frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"},{"articleLive":2,"formTitle":"[1810]Minimum Path Cost in a Hidden Grid","frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"articleLive":2,"formTitle":"[1811]Find Interview Candidates","frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","title":"Find Interview Candidates","titleSlug":"find-interview-candidates"},{"articleLive":2,"formTitle":"[1812]Determine Color of a Chessboard Square","frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"","title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square"},{"articleLive":2,"formTitle":"[1813]Sentence Similarity III","frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"","title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii"},{"articleLive":2,"formTitle":"[1814]Count Nice Pairs in an Array","frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"","title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array"},{"articleLive":2,"formTitle":"[1815]Maximum Number of Groups Getting Fresh Donuts","frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"articleLive":2,"formTitle":"[1816]Truncate Sentence","frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"","title":"Truncate Sentence","titleSlug":"truncate-sentence"},{"articleLive":2,"formTitle":"[1817]Finding the Users Active Minutes","frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"","title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes"},{"articleLive":2,"formTitle":"[1818]Minimum Absolute Sum Difference","frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"","title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference"},{"articleLive":2,"formTitle":"[1819]Number of Different Subsequences GCDs","frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds"},{"articleLive":2,"formTitle":"[1820]Maximum Number of Accepted Invitations","frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"},{"articleLive":2,"formTitle":"[1821]Find Customers With Positive Revenue this Year","frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"},{"articleLive":2,"formTitle":"[1822]Sign of the Product of an Array","frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array"},{"articleLive":2,"formTitle":"[1823]Find the Winner of the Circular Game","frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game"},{"articleLive":2,"formTitle":"[1824]Minimum Sideway Jumps","frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps"},{"articleLive":2,"formTitle":"[1825]Finding MK Average","frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","title":"Finding MK Average","titleSlug":"finding-mk-average"},{"articleLive":2,"formTitle":"[1826]Faulty Sensor","frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"articleLive":2,"formTitle":"[1827]Minimum Operations to Make the Array Increasing","frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"","title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"articleLive":2,"formTitle":"[1828]Queries on Number of Points Inside a Circle","frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"","title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"articleLive":2,"formTitle":"[1829]Maximum XOR for Each Query","frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"","title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query"},{"articleLive":2,"formTitle":"[1830]Minimum Number of Operations to Make String Sorted","frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"","title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"articleLive":2,"formTitle":"[1831]Maximum Transaction Each Day","frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"},{"articleLive":2,"formTitle":"[1832]Check if the Sentence Is Pangram","frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"","title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram"},{"articleLive":2,"formTitle":"[1833]Maximum Ice Cream Bars","frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"","title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars"},{"articleLive":2,"formTitle":"[1834]Single-Threaded CPU","frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu"},{"articleLive":2,"formTitle":"[1835]Find XOR Sum of All Pairs Bitwise AND","frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"articleLive":2,"formTitle":"[1836]Remove Duplicates From an Unsorted Linked List","frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"articleLive":2,"formTitle":"[1837]Sum of Digits in Base K","frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"","title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k"},{"articleLive":2,"formTitle":"[1838]Frequency of the Most Frequent Element","frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"","title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element"},{"articleLive":2,"formTitle":"[1839]Longest Substring Of All Vowels in Order","frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"","title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order"},{"articleLive":2,"formTitle":"[1840]Maximum Building Height","frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"","title":"Maximum Building Height","titleSlug":"maximum-building-height"},{"articleLive":2,"formTitle":"[1841]League Statistics","frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","title":"League Statistics","titleSlug":"league-statistics"},{"articleLive":2,"formTitle":"[1842]Next Palindrome Using Same Digits","frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"},{"articleLive":2,"formTitle":"[1843]Suspicious Bank Accounts","frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"articleLive":2,"formTitle":"[1844]Replace All Digits with Characters","frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters"},{"articleLive":2,"formTitle":"[1845]Seat Reservation Manager","frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager"},{"articleLive":2,"formTitle":"[1846]Maximum Element After Decreasing and Rearranging","frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"","title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"articleLive":2,"formTitle":"[1847]Closest Room","frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","title":"Closest Room","titleSlug":"closest-room"},{"articleLive":2,"formTitle":"[1848]Minimum Distance to the Target Element","frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element"},{"articleLive":2,"formTitle":"[1849]Splitting a String Into Descending Consecutive Values","frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"articleLive":2,"formTitle":"[1850]Minimum Adjacent Swaps to Reach the Kth Smallest Number","frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"articleLive":2,"formTitle":"[1851]Minimum Interval to Include Each Query","frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query"},{"articleLive":2,"formTitle":"[1852]Distinct Numbers in Each Subarray","frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray"},{"articleLive":2,"formTitle":"[1853]Convert Date Format","frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","title":"Convert Date Format","titleSlug":"convert-date-format"},{"articleLive":2,"formTitle":"[1854]Maximum Population Year","frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"","title":"Maximum Population Year","titleSlug":"maximum-population-year"},{"articleLive":2,"formTitle":"[1855]Maximum Distance Between a Pair of Values","frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"","title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values"},{"articleLive":2,"formTitle":"[1856]Maximum Subarray Min-Product","frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"","title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product"},{"articleLive":2,"formTitle":"[1857]Largest Color Value in a Directed Graph","frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph"},{"articleLive":2,"formTitle":"[1858]Longest Word With All Prefixes","frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes"},{"articleLive":2,"formTitle":"[1859]Sorting the Sentence","frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"","title":"Sorting the Sentence","titleSlug":"sorting-the-sentence"},{"articleLive":2,"formTitle":"[1860]Incremental Memory Leak","frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"","title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak"},{"articleLive":2,"formTitle":"[1861]Rotating the Box","frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"","title":"Rotating the Box","titleSlug":"rotating-the-box"},{"articleLive":2,"formTitle":"[1862]Sum of Floored Pairs","frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"","title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs"},{"articleLive":2,"formTitle":"[1863]Sum of All Subset XOR Totals","frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals"},{"articleLive":2,"formTitle":"[1864]Minimum Number of Swaps to Make the Binary String Alternating","frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"","title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"articleLive":2,"formTitle":"[1865]Finding Pairs With a Certain Sum","frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"","title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum"},{"articleLive":2,"formTitle":"[1866]Number of Ways to Rearrange Sticks With K Sticks Visible","frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"articleLive":2,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"articleLive":2,"formTitle":"[1868]Product of Two Run-Length Encoded Arrays","frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays"},{"articleLive":2,"formTitle":"[1869]Longer Contiguous Segments of Ones than Zeros","frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"","title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"articleLive":2,"formTitle":"[1870]Minimum Speed to Arrive on Time","frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"","title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time"},{"articleLive":2,"formTitle":"[1871]Jump Game VII","frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"","title":"Jump Game VII","titleSlug":"jump-game-vii"},{"articleLive":2,"formTitle":"[1872]Stone Game VIII","frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","title":"Stone Game VIII","titleSlug":"stone-game-viii"},{"articleLive":2,"formTitle":"[1873]Calculate Special Bonus","frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus"},{"articleLive":2,"formTitle":"[1874]Minimize Product Sum of Two Arrays","frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays"},{"articleLive":2,"formTitle":"[1875]Group Employees of the Same Salary","frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"articleLive":2,"formTitle":"[1876]Substrings of Size Three with Distinct Characters","frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"","title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"articleLive":2,"formTitle":"[1877]Minimize Maximum Pair Sum in Array","frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"","title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array"},{"articleLive":2,"formTitle":"[1878]Get Biggest Three Rhombus Sums in a Grid","frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"","title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"articleLive":2,"formTitle":"[1879]Minimum XOR Sum of Two Arrays","frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays"},{"articleLive":2,"formTitle":"[1880]Check if Word Equals Summation of Two Words","frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"","title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words"},{"articleLive":2,"formTitle":"[1881]Maximum Value after Insertion","frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"","title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion"},{"articleLive":2,"formTitle":"[1882]Process Tasks Using Servers","frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"","title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers"},{"articleLive":2,"formTitle":"[1883]Minimum Skips to Arrive at Meeting On Time","frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"articleLive":2,"formTitle":"[1884]Egg Drop With 2 Eggs and N Floors","frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"articleLive":2,"formTitle":"[1885]Count Pairs in Two Arrays","frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"articleLive":2,"formTitle":"[1886]Determine Whether Matrix Can Be Obtained By Rotation","frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"articleLive":2,"formTitle":"[1887]Reduction Operations to Make the Array Elements Equal","frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"articleLive":2,"formTitle":"[1888]Minimum Number of Flips to Make the Binary String Alternating","frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"articleLive":2,"formTitle":"[1889]Minimum Space Wasted From Packaging","frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging"},{"articleLive":2,"formTitle":"[1890]The Latest Login in 2020","frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020"},{"articleLive":2,"formTitle":"[1891]Cutting Ribbons","frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","title":"Cutting Ribbons","titleSlug":"cutting-ribbons"},{"articleLive":2,"formTitle":"[1892]Page Recommendations II","frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","title":"Page Recommendations II","titleSlug":"page-recommendations-ii"},{"articleLive":2,"formTitle":"[1893]Check if All the Integers in a Range Are Covered","frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"","title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"articleLive":2,"formTitle":"[1894]Find the Student that Will Replace the Chalk","frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"","title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"articleLive":2,"formTitle":"[1895]Largest Magic Square","frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"","title":"Largest Magic Square","titleSlug":"largest-magic-square"},{"articleLive":2,"formTitle":"[1896]Minimum Cost to Change the Final Value of Expression","frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"articleLive":2,"formTitle":"[1897]Redistribute Characters to Make All Strings Equal","frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"","title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"articleLive":2,"formTitle":"[1898]Maximum Number of Removable Characters","frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"","title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters"},{"articleLive":2,"formTitle":"[1899]Merge Triplets to Form Target Triplet","frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet"},{"articleLive":2,"formTitle":"[1900]The Earliest and Latest Rounds Where Players Compete","frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"articleLive":2,"formTitle":"[1901]Find a Peak Element II","frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii"},{"articleLive":2,"formTitle":"[1902]Depth of BST Given Insertion Order","frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"articleLive":2,"formTitle":"[1903]Largest Odd Number in String","frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string"},{"articleLive":2,"formTitle":"[1904]The Number of Full Rounds You Have Played","frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played"},{"articleLive":2,"formTitle":"[1905]Count Sub Islands","frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","title":"Count Sub Islands","titleSlug":"count-sub-islands"},{"articleLive":2,"formTitle":"[1906]Minimum Absolute Difference Queries","frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries"},{"articleLive":2,"formTitle":"[1907]Count Salary Categories","frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","title":"Count Salary Categories","titleSlug":"count-salary-categories"},{"articleLive":2,"formTitle":"[1908]Game of Nim","frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","title":"Game of Nim","titleSlug":"game-of-nim"},{"articleLive":2,"formTitle":"[1909]Remove One Element to Make the Array Strictly Increasing","frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"","title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"articleLive":2,"formTitle":"[1910]Remove All Occurrences of a Substring","frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"","title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring"},{"articleLive":2,"formTitle":"[1911]Maximum Alternating Subsequence Sum","frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"","title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum"},{"articleLive":2,"formTitle":"[1912]Design Movie Rental System","frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","title":"Design Movie Rental System","titleSlug":"design-movie-rental-system"},{"articleLive":2,"formTitle":"[1913]Maximum Product Difference Between Two Pairs","frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"","title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs"},{"articleLive":2,"formTitle":"[1914]Cyclically Rotating a Grid","frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid"},{"articleLive":2,"formTitle":"[1915]Number of Wonderful Substrings","frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"","title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings"},{"articleLive":2,"formTitle":"[1916]Count Ways to Build Rooms in an Ant Colony","frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"articleLive":2,"formTitle":"[1917]Leetcodify Friends Recommendations","frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"articleLive":2,"formTitle":"[1918]Kth Smallest Subarray Sum","frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum"},{"articleLive":2,"formTitle":"[1919]Leetcodify Similar Friends","frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends"},{"articleLive":2,"formTitle":"[1920]Build Array from Permutation","frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"","title":"Build Array from Permutation","titleSlug":"build-array-from-permutation"},{"articleLive":2,"formTitle":"[1921]Eliminate Maximum Number of Monsters","frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"","title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters"},{"articleLive":2,"formTitle":"[1922]Count Good Numbers","frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","title":"Count Good Numbers","titleSlug":"count-good-numbers"},{"articleLive":2,"formTitle":"[1923]Longest Common Subpath","frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","title":"Longest Common Subpath","titleSlug":"longest-common-subpath"},{"articleLive":2,"formTitle":"[1924]Erect the Fence II","frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"articleLive":2,"formTitle":"[1925]Count Square Sum Triples","frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"","title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples"},{"articleLive":2,"formTitle":"[1926]Nearest Exit from Entrance in Maze","frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"","title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze"},{"articleLive":2,"formTitle":"[1927]Sum Game","frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"","title":"Sum Game","titleSlug":"sum-game"},{"articleLive":2,"formTitle":"[1928]Minimum Cost to Reach Destination in Time","frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"","title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"articleLive":2,"formTitle":"[1929]Concatenation of Array","frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","title":"Concatenation of Array","titleSlug":"concatenation-of-array"},{"articleLive":2,"formTitle":"[1930]Unique Length-3 Palindromic Subsequences","frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"},{"articleLive":2,"formTitle":"[1931]Painting a Grid With Three Different Colors","frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors"},{"articleLive":2,"formTitle":"[1932]Merge BSTs to Create Single BST","frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst"},{"articleLive":2,"formTitle":"[1933]Check if String Is Decomposable Into Value-Equal Substrings","frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"articleLive":2,"formTitle":"[1934]Confirmation Rate","frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"articleLive":2,"formTitle":"[1935]Maximum Number of Words You Can Type","frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type"},{"articleLive":2,"formTitle":"[1936]Add Minimum Number of Rungs","frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs"},{"articleLive":2,"formTitle":"[1937]Maximum Number of Points with Cost","frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost"},{"articleLive":2,"formTitle":"[1938]Maximum Genetic Difference Query","frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query"},{"articleLive":2,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"articleLive":2,"formTitle":"[1940]Longest Common Subsequence Between Sorted Arrays","frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"articleLive":2,"formTitle":"[1941]Check if All Characters Have Equal Number of Occurrences","frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"","title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"articleLive":2,"formTitle":"[1942]The Number of the Smallest Unoccupied Chair","frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"","title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"articleLive":2,"formTitle":"[1943]Describe the Painting","frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"","title":"Describe the Painting","titleSlug":"describe-the-painting"},{"articleLive":2,"formTitle":"[1944]Number of Visible People in a Queue","frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue"},{"articleLive":2,"formTitle":"[1945]Sum of Digits of String After Convert","frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"","title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert"},{"articleLive":2,"formTitle":"[1946]Largest Number After Mutating Substring","frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"","title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring"},{"articleLive":2,"formTitle":"[1947]Maximum Compatibility Score Sum","frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"","title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum"},{"articleLive":2,"formTitle":"[1948]Delete Duplicate Folders in System","frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system"},{"articleLive":2,"formTitle":"[1949]Strong Friendship","frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","title":"Strong Friendship","titleSlug":"strong-friendship"},{"articleLive":2,"formTitle":"[1950]Maximum of Minimum Values in All Subarrays","frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"articleLive":2,"formTitle":"[1951]All the Pairs With the Maximum Number of Common Followers","frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","title":"All the Pairs With the Maximum Number of Common Followers","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"articleLive":2,"formTitle":"[1952]Three Divisors","frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"","title":"Three Divisors","titleSlug":"three-divisors"},{"articleLive":2,"formTitle":"[1953]Maximum Number of Weeks for Which You Can Work","frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"","title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"articleLive":2,"formTitle":"[1954]Minimum Garden Perimeter to Collect Enough Apples","frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"","title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"articleLive":2,"formTitle":"[1955]Count Number of Special Subsequences","frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences"},{"articleLive":2,"formTitle":"[1956]Minimum Time For K Virus Variants to Spread","frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"articleLive":2,"formTitle":"[1957]Delete Characters to Make Fancy String","frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string"},{"articleLive":2,"formTitle":"[1958]Check if Move is Legal","frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal"},{"articleLive":2,"formTitle":"[1959]Minimum Total Space Wasted With K Resizing Operations","frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"articleLive":2,"formTitle":"[1960]Maximum Product of the Length of Two Palindromic Substrings","frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"articleLive":2,"formTitle":"[1961]Check If String Is a Prefix of Array","frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array"},{"articleLive":2,"formTitle":"[1962]Remove Stones to Minimize the Total","frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total"},{"articleLive":2,"formTitle":"[1963]Minimum Number of Swaps to Make the String Balanced","frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"articleLive":2,"formTitle":"[1964]Find the Longest Valid Obstacle Course at Each Position","frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"articleLive":2,"formTitle":"[1965]Employees With Missing Information","frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"articleLive":2,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"articleLive":2,"formTitle":"[1967]Number of Strings That Appear as Substrings in Word","frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"articleLive":2,"formTitle":"[1968]Array With Elements Not Equal to Average of Neighbors","frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"articleLive":2,"formTitle":"[1969]Minimum Non-Zero Product of the Array Elements","frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"articleLive":2,"formTitle":"[1970]Last Day Where You Can Still Cross","frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross"},{"articleLive":2,"formTitle":"[1971]Find if Path Exists in Graph","frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"articleLive":2,"formTitle":"[1972]First and Last Call On the Same Day","frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"articleLive":2,"formTitle":"[LCP 01]Guess Numbers","frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","title":"Guess Numbers","titleSlug":"guess-numbers"},{"articleLive":2,"formTitle":"[LCP 02]Deep Dark Fraction","frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","title":"Deep Dark Fraction","titleSlug":"deep-dark-fraction"},{"articleLive":2,"formTitle":"[LCP 03]Programmable Robot","frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","title":"Programmable Robot","titleSlug":"programmable-robot"},{"articleLive":2,"formTitle":"[LCP 04]Broken Board Dominoes","frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","title":"Broken Board Dominoes","titleSlug":"broken-board-dominoes"},{"articleLive":2,"formTitle":"[LCP 05]Coin Bonus","frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","title":"Coin Bonus","titleSlug":"coin-bonus"},{"articleLive":2,"formTitle":"[LCP 06]拿硬币","frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","title":"拿硬币","titleSlug":"na-ying-bi"},{"articleLive":2,"formTitle":"[LCP 07]传递信息","frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"","title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"articleLive":2,"formTitle":"[LCP 08]剧情触发时间","frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"articleLive":2,"formTitle":"[LCP 09]最小跳跃次数","frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"articleLive":2,"formTitle":"[LCP 10]二叉树任务调度","frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"articleLive":2,"formTitle":"[LCP 11]期望个数统计","frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"articleLive":2,"formTitle":"[LCP 12]小张刷题计划","frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"articleLive":2,"formTitle":"[LCP 13]寻宝","frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","title":"寻宝","titleSlug":"xun-bao"},{"articleLive":2,"formTitle":"[LCP 14]切分数组","frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"articleLive":2,"formTitle":"[LCP 15]游乐园的迷宫","frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"articleLive":2,"formTitle":"[LCP 16]游乐园的游览计划","frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"articleLive":2,"formTitle":"[LCP 17]速算机器人","frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","title":"速算机器人","titleSlug":"nGK0Fy"},{"articleLive":2,"formTitle":"[LCP 18]早餐组合","frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"","title":"早餐组合","titleSlug":"2vYnGI"},{"articleLive":2,"formTitle":"[LCP 19]秋叶收藏集","frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","title":"秋叶收藏集","titleSlug":"UlBDOe"},{"articleLive":2,"formTitle":"[LCP 20]快速公交","frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","title":"快速公交","titleSlug":"meChtZ"},{"articleLive":2,"formTitle":"[LCP 21]追逐游戏","frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","title":"追逐游戏","titleSlug":"Za25hA"},{"articleLive":2,"formTitle":"[LCP 22]黑白方格画","frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"","title":"黑白方格画","titleSlug":"ccw6C7"},{"articleLive":2,"formTitle":"[LCP 23]魔术排列","frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","title":"魔术排列","titleSlug":"er94lq"},{"articleLive":2,"formTitle":"[LCP 24]数字游戏","frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","title":"数字游戏","titleSlug":"5TxKeK"},{"articleLive":2,"formTitle":"[LCP 25]古董键盘","frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","title":"古董键盘","titleSlug":"Uh984O"},{"articleLive":2,"formTitle":"[LCP 26]导航装置","frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","title":"导航装置","titleSlug":"hSRGyL"},{"articleLive":2,"formTitle":"[LCP 27]黑盒光线反射","frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"articleLive":2,"formTitle":"[LCP 28]采购方案","frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"","title":"采购方案","titleSlug":"4xy4Wx"},{"articleLive":2,"formTitle":"[LCP 29]乐团站位","frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"","title":"乐团站位","titleSlug":"SNJvJP"},{"articleLive":2,"formTitle":"[LCP 30]魔塔游戏","frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"","title":"魔塔游戏","titleSlug":"p0NxJO"},{"articleLive":2,"formTitle":"[LCP 31]变换的迷宫","frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","title":"变换的迷宫","titleSlug":"Db3wC1"},{"articleLive":2,"formTitle":"[LCP 32]批量处理任务","frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","title":"批量处理任务","titleSlug":"t3fKg1"},{"articleLive":2,"formTitle":"[LCP 33]蓄水","frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","title":"蓄水","titleSlug":"o8SXZn"},{"articleLive":2,"formTitle":"[LCP 34]二叉树染色","frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"articleLive":2,"formTitle":"[LCP 35]电动车游城市","frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","title":"电动车游城市","titleSlug":"DFPeFJ"},{"articleLive":2,"formTitle":"[LCP 36]最多牌组数","frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"","title":"最多牌组数","titleSlug":"Up5XYM"},{"articleLive":2,"formTitle":"[LCP 37]最小矩形面积","frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"articleLive":2,"formTitle":"[LCP 38]守卫城堡","frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","title":"守卫城堡","titleSlug":"7rLGCR"},{"articleLive":2,"formTitle":"[LCS 01]下载插件","frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","title":"下载插件","titleSlug":"Ju9Xwi"},{"articleLive":2,"formTitle":"[LCS 02]完成一半题目","frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","title":"完成一半题目","titleSlug":"WqXACV"},{"articleLive":2,"formTitle":"[LCS 03]主题空间","frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","title":"主题空间","titleSlug":"YesdPw"},{"articleLive":2,"formTitle":"[剑指 Offer 03]数组中重复的数字 LCOF","frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","title":"数组中重复的数字 LCOF","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 04]二维数组中的查找 LCOF","frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","title":"二维数组中的查找 LCOF","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 05]替换空格 LCOF","frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","title":"替换空格 LCOF","titleSlug":"ti-huan-kong-ge-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 06]从尾到头打印链表 LCOF","frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"","title":"从尾到头打印链表 LCOF","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 07]重建二叉树 LCOF","frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","title":"重建二叉树 LCOF","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 09]用两个栈实现队列 LCOF","frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"","title":"用两个栈实现队列 LCOF","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 10- I]斐波那契数列  LCOF","frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","title":"斐波那契数列  LCOF","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题  LCOF","frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","title":"青蛙跳台阶问题  LCOF","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 11]旋转数组的最小数字  LCOF","frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","title":"旋转数组的最小数字  LCOF","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 12]矩阵中的路径  LCOF","frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","title":"矩阵中的路径  LCOF","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 13]机器人的运动范围  LCOF","frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","title":"机器人的运动范围  LCOF","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 14- I]剪绳子  LCOF","frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","title":"剪绳子  LCOF","titleSlug":"jian-sheng-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 14- II]剪绳子 II LCOF","frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","title":"剪绳子 II LCOF","titleSlug":"jian-sheng-zi-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 15]二进制中1的个数 LCOF","frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"","title":"二进制中1的个数 LCOF","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 16]数值的整数次方 LCOF","frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","title":"数值的整数次方 LCOF","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数 LCOF","frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","title":"打印从1到最大的n位数 LCOF","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 18]删除链表的节点 LCOF","frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"","title":"删除链表的节点 LCOF","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 19]正则表达式匹配 LCOF","frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","title":"正则表达式匹配 LCOF","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 20]表示数值的字符串 LCOF","frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","title":"表示数值的字符串 LCOF","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面 LCOF","frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","title":"调整数组顺序使奇数位于偶数前面 LCOF","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点 LCOF","frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"","title":"链表中倒数第k个节点 LCOF","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 24]反转链表 LCOF","frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"","title":"反转链表 LCOF","titleSlug":"fan-zhuan-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 25]合并两个排序的链表  LCOF","frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","title":"合并两个排序的链表  LCOF","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 26]树的子结构  LCOF","frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","title":"树的子结构  LCOF","titleSlug":"shu-de-zi-jie-gou-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 27]二叉树的镜像  LCOF","frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","title":"二叉树的镜像  LCOF","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 28]对称的二叉树  LCOF","frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","title":"对称的二叉树  LCOF","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 29]顺时针打印矩阵  LCOF","frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","title":"顺时针打印矩阵  LCOF","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 30]包含min函数的栈 LCOF","frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"","title":"包含min函数的栈 LCOF","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列 LCOF","frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","title":"栈的压入、弹出序列 LCOF","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树 LCOF","frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","title":"从上到下打印二叉树 LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II LCOF","frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","title":"从上到下打印二叉树 II LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III LCOF","frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","title":"从上到下打印二叉树 III LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列 LCOF","frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","title":"二叉搜索树的后序遍历序列 LCOF","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径 LCOF","frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","title":"二叉树中和为某一值的路径 LCOF","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 35]复杂链表的复制  LCOF","frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"","title":"复杂链表的复制  LCOF","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表  LCOF","frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","title":"二叉搜索树与双向链表  LCOF","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 37]序列化二叉树  LCOF","frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"","title":"序列化二叉树  LCOF","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 38]字符串的排列  LCOF","frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"","title":"字符串的排列  LCOF","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字  LCOF","frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"","title":"数组中出现次数超过一半的数字  LCOF","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 40]最小的k个数  LCOF","frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","title":"最小的k个数  LCOF","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 41]数据流中的中位数  LCOF","frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","title":"数据流中的中位数  LCOF","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 42]连续子数组的最大和  LCOF","frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"","title":"连续子数组的最大和  LCOF","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 43]1～n整数中1出现的次数  LCOF","frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","title":"1～n整数中1出现的次数  LCOF","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字  LCOF","frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","title":"数字序列中某一位的数字  LCOF","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 45]把数组排成最小的数 LCOF","frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","title":"把数组排成最小的数 LCOF","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 46]把数字翻译成字符串 LCOF","frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","title":"把数字翻译成字符串 LCOF","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 47]礼物的最大价值 LCOF","frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","title":"礼物的最大价值 LCOF","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串 LCOF","frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","title":"最长不含重复字符的子字符串 LCOF","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 49]丑数 LCOF","frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","title":"丑数 LCOF","titleSlug":"chou-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符  LCOF","frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","title":"第一个只出现一次的字符  LCOF","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 51]数组中的逆序对  LCOF","frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","title":"数组中的逆序对  LCOF","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点  LCOF","frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"","title":"两个链表的第一个公共节点  LCOF","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字  LCOF","frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"","title":"在排序数组中查找数字  LCOF","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 53 - II]缺失的数字  LCOF","frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","title":"缺失的数字  LCOF","titleSlug":"que-shi-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点  LCOF","frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","title":"二叉搜索树的第k大节点  LCOF","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 55 - I]二叉树的深度 LCOF","frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","title":"二叉树的深度 LCOF","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 55 - II]平衡二叉树 LCOF","frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","title":"平衡二叉树 LCOF","titleSlug":"ping-heng-er-cha-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数 LCOF","frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","title":"数组中数字出现的次数 LCOF","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II LCOF","frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","title":"数组中数字出现的次数 II LCOF","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 57]和为s的两个数字 LCOF","frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","title":"和为s的两个数字 LCOF","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列 LCOF","frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","title":"和为s的连续正数序列 LCOF","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序 LCOF","frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","title":"翻转单词顺序 LCOF","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 58 - II]左旋转字符串 LCOF","frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","title":"左旋转字符串 LCOF","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值 LCOF","frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","title":"滑动窗口的最大值 LCOF","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 59 - II]队列的最大值 LCOF","frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"","title":"队列的最大值 LCOF","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 60]n个骰子的点数  LCOF","frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","title":"n个骰子的点数  LCOF","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 61]扑克牌中的顺子  LCOF","frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","title":"扑克牌中的顺子  LCOF","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字 LCOF","frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","title":"圆圈中最后剩下的数字 LCOF","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 63]股票的最大利润  LCOF","frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","title":"股票的最大利润  LCOF","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 64]求1+2+…+n LCOF","frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","title":"求1+2+…+n LCOF","titleSlug":"qiu-12n-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 65]不用加减乘除做加法 LCOF","frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","title":"不用加减乘除做加法 LCOF","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 66]构建乘积数组 LCOF","frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","title":"构建乘积数组 LCOF","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 67]把字符串转换成整数 LCOF","frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","title":"把字符串转换成整数 LCOF","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先 LCOF","frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","title":"二叉搜索树的最近公共祖先 LCOF","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先 LCOF","frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","title":"二叉树的最近公共祖先 LCOF","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"articleLive":2,"formTitle":"[剑指 Offer II 001]整数除法","frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","title":"整数除法","titleSlug":"xoh6Oh"},{"articleLive":2,"formTitle":"[剑指 Offer II 002]二进制加法","frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","title":"二进制加法","titleSlug":"JFETK5"},{"articleLive":2,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"articleLive":2,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"articleLive":2,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"articleLive":2,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"articleLive":2,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"articleLive":2,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"articleLive":2,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"articleLive":2,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"articleLive":2,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"articleLive":2,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"articleLive":2,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"articleLive":2,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","title":"字符串中的变位词","titleSlug":"MPnaiL"},{"articleLive":2,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"articleLive":2,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"articleLive":2,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"articleLive":2,"formTitle":"[剑指 Offer II 018]有效的回文","frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","title":"有效的回文","titleSlug":"XltzEq"},{"articleLive":2,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"articleLive":2,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"articleLive":2,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"articleLive":2,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","title":"链表中环的入口节点","titleSlug":"c32eOV"},{"articleLive":2,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"articleLive":2,"formTitle":"[剑指 Offer II 024]反转链表","frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","title":"反转链表","titleSlug":"UHnkqh"},{"articleLive":2,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","title":"链表中的两数相加","titleSlug":"lMSNwu"},{"articleLive":2,"formTitle":"[剑指 Offer II 026]重排链表","frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","title":"重排链表","titleSlug":"LGjMqU"},{"articleLive":2,"formTitle":"[剑指 Offer II 027]回文链表","frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","title":"回文链表","titleSlug":"aMhZSa"},{"articleLive":2,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"articleLive":2,"formTitle":"[剑指 Offer II 029]排序的循环链表","frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","title":"排序的循环链表","titleSlug":"4ueAj6"},{"articleLive":2,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"articleLive":2,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","title":"最近最少使用缓存","titleSlug":"OrIXps"},{"articleLive":2,"formTitle":"[剑指 Offer II 032]有效的变位词","frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","title":"有效的变位词","titleSlug":"dKk3P7"},{"articleLive":2,"formTitle":"[剑指 Offer II 033]变位词组","frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","title":"变位词组","titleSlug":"sfvd7V"},{"articleLive":2,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","title":"外星语言是否排序","titleSlug":"lwyVBB"},{"articleLive":2,"formTitle":"[剑指 Offer II 035]最小时间差","frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","title":"最小时间差","titleSlug":"569nqc"},{"articleLive":2,"formTitle":"[剑指 Offer II 036]后缀表达式","frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","title":"后缀表达式","titleSlug":"8Zf90G"},{"articleLive":2,"formTitle":"[剑指 Offer II 037]小行星碰撞","frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","title":"小行星碰撞","titleSlug":"XagZNi"},{"articleLive":2,"formTitle":"[剑指 Offer II 038]每日温度","frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","title":"每日温度","titleSlug":"iIQa4I"},{"articleLive":2,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"articleLive":2,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"articleLive":2,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"articleLive":2,"formTitle":"[剑指 Offer II 042]最近请求次数","frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","title":"最近请求次数","titleSlug":"H8086Q"},{"articleLive":2,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"articleLive":2,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"articleLive":2,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"articleLive":2,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"articleLive":2,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","title":"二叉树剪枝","titleSlug":"pOCWxh"},{"articleLive":2,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"articleLive":2,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"articleLive":2,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"articleLive":2,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","title":"节点之和最大的路径","titleSlug":"jC7MId"},{"articleLive":2,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"articleLive":2,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"articleLive":2,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"articleLive":2,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"articleLive":2,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"articleLive":2,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"articleLive":2,"formTitle":"[剑指 Offer II 058]日程表","frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","title":"日程表","titleSlug":"fi9suh"},{"articleLive":2,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"articleLive":2,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"articleLive":2,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"articleLive":2,"formTitle":"[剑指 Offer II 062]实现前缀树","frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","title":"实现前缀树","titleSlug":"QC3q1f"},{"articleLive":2,"formTitle":"[剑指 Offer II 063]替换单词","frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","title":"替换单词","titleSlug":"UhWRSj"},{"articleLive":2,"formTitle":"[剑指 Offer II 064]神奇的字典","frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","title":"神奇的字典","titleSlug":"US1pGT"},{"articleLive":2,"formTitle":"[剑指 Offer II 065]最短的单词编码","frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","title":"最短的单词编码","titleSlug":"iSwD2y"},{"articleLive":2,"formTitle":"[剑指 Offer II 066]单词之和","frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","title":"单词之和","titleSlug":"z1R5dt"},{"articleLive":2,"formTitle":"[剑指 Offer II 067]最大的异或","frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","title":"最大的异或","titleSlug":"ms70jA"},{"articleLive":2,"formTitle":"[剑指 Offer II 068]查找插入位置","frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","title":"查找插入位置","titleSlug":"N6YdxV"},{"articleLive":2,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","title":"山峰数组的顶部","titleSlug":"B1IidL"},{"articleLive":2,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"articleLive":2,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","title":"按权重生成随机数","titleSlug":"cuyjEf"},{"articleLive":2,"formTitle":"[剑指 Offer II 072]求平方根","frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","title":"求平方根","titleSlug":"jJ0w9p"},{"articleLive":2,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"articleLive":2,"formTitle":"[剑指 Offer II 074]合并区间","frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","title":"合并区间","titleSlug":"SsGoHC"},{"articleLive":2,"formTitle":"[剑指 Offer II 075]数组相对排序","frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","title":"数组相对排序","titleSlug":"0H97ZC"},{"articleLive":2,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"articleLive":2,"formTitle":"[剑指 Offer II 077]链表排序","frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","title":"链表排序","titleSlug":"7WHec2"},{"articleLive":2,"formTitle":"[剑指 Offer II 078]合并排序链表","frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","title":"合并排序链表","titleSlug":"vvXgSW"},{"articleLive":2,"formTitle":"[剑指 Offer II 079]所有子集","frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","title":"所有子集","titleSlug":"TVdhkn"},{"articleLive":2,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"articleLive":2,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"articleLive":2,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"articleLive":2,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"articleLive":2,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"articleLive":2,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","title":"生成匹配的括号","titleSlug":"IDBivT"},{"articleLive":2,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","title":"分割回文子字符串","titleSlug":"M99OJA"},{"articleLive":2,"formTitle":"[剑指 Offer II 087]复原 IP ","frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","title":"复原 IP ","titleSlug":"0on3uN"},{"articleLive":2,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"articleLive":2,"formTitle":"[剑指 Offer II 089]房屋偷盗","frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","title":"房屋偷盗","titleSlug":"Gu0c2T"},{"articleLive":2,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"articleLive":2,"formTitle":"[剑指 Offer II 091]粉刷房子","frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","title":"粉刷房子","titleSlug":"JEj789"},{"articleLive":2,"formTitle":"[剑指 Offer II 092]翻转字符","frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","title":"翻转字符","titleSlug":"cyJERH"},{"articleLive":2,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"articleLive":2,"formTitle":"[剑指 Offer II 094]最少回文分割","frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","title":"最少回文分割","titleSlug":"omKAoA"},{"articleLive":2,"formTitle":"[剑指 Offer II 095]最长公共子序列","frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","title":"最长公共子序列","titleSlug":"qJnOS7"},{"articleLive":2,"formTitle":"[剑指 Offer II 096]字符串交织","frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","title":"字符串交织","titleSlug":"IY6buf"},{"articleLive":2,"formTitle":"[剑指 Offer II 097]子序列的数目","frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","title":"子序列的数目","titleSlug":"21dk04"},{"articleLive":2,"formTitle":"[剑指 Offer II 098]路径的数目","frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","title":"路径的数目","titleSlug":"2AoeFn"},{"articleLive":2,"formTitle":"[剑指 Offer II 099]最小路径之和","frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","title":"最小路径之和","titleSlug":"0i0mDW"},{"articleLive":2,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"articleLive":2,"formTitle":"[剑指 Offer II 101]分割等和子串","frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","title":"分割等和子串","titleSlug":"NUPfPr"},{"articleLive":2,"formTitle":"[剑指 Offer II 102]加减的目标值","frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","title":"加减的目标值","titleSlug":"YaVDxD"},{"articleLive":2,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"articleLive":2,"formTitle":"[剑指 Offer II 104]排列的数目","frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","title":"排列的数目","titleSlug":"D0F0SV"},{"articleLive":2,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"articleLive":2,"formTitle":"[剑指 Offer II 106]二分图","frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","title":"二分图","titleSlug":"vEAB3K"},{"articleLive":2,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","title":"矩阵中的距离","titleSlug":"2bCMpM"},{"articleLive":2,"formTitle":"[剑指 Offer II 108]单词演变","frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","title":"单词演变","titleSlug":"om3reC"},{"articleLive":2,"formTitle":"[剑指 Offer II 109]开密码锁","frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","title":"开密码锁","titleSlug":"zlDJc7"},{"articleLive":2,"formTitle":"[剑指 Offer II 110]所有路径","frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","title":"所有路径","titleSlug":"bP4bmD"},{"articleLive":2,"formTitle":"[剑指 Offer II 111]计算除法","frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","title":"计算除法","titleSlug":"vlzXQL"},{"articleLive":2,"formTitle":"[剑指 Offer II 112]最长递增路径","frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","title":"最长递增路径","titleSlug":"fpTFWP"},{"articleLive":2,"formTitle":"[剑指 Offer II 113]课程顺序","frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","title":"课程顺序","titleSlug":"QA2IGt"},{"articleLive":2,"formTitle":"[剑指 Offer II 114]外星文字典","frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","title":"外星文字典","titleSlug":"Jf1JuT"},{"articleLive":2,"formTitle":"[剑指 Offer II 115]重建序列","frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","title":"重建序列","titleSlug":"ur2n8P"},{"articleLive":2,"formTitle":"[剑指 Offer II 116]朋友圈","frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","title":"朋友圈","titleSlug":"bLyHh0"},{"articleLive":2,"formTitle":"[剑指 Offer II 117]相似的字符串","frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","title":"相似的字符串","titleSlug":"H6lPxb"},{"articleLive":2,"formTitle":"[剑指 Offer II 118]多余的边","frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","title":"多余的边","titleSlug":"7LpjUW"},{"articleLive":2,"formTitle":"[剑指 Offer II 119]最长连续序列","frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","title":"最长连续序列","titleSlug":"WhsWhI"},{"articleLive":2,"formTitle":"[面试题 01.01]Is Unique LCCI","frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","title":"Is Unique LCCI","titleSlug":"is-unique-lcci"},{"articleLive":2,"formTitle":"[面试题 01.02]Check Permutation LCCI","frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","title":"Check Permutation LCCI","titleSlug":"check-permutation-lcci"},{"articleLive":2,"formTitle":"[面试题 01.03]String to URL LCCI","frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","title":"String to URL LCCI","titleSlug":"string-to-url-lcci"},{"articleLive":2,"formTitle":"[面试题 01.04]Palindrome Permutation LCCI","frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","title":"Palindrome Permutation LCCI","titleSlug":"palindrome-permutation-lcci"},{"articleLive":2,"formTitle":"[面试题 01.05]One Away LCCI","frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","title":"One Away LCCI","titleSlug":"one-away-lcci"},{"articleLive":2,"formTitle":"[面试题 01.06]Compress String LCCI","frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","title":"Compress String LCCI","titleSlug":"compress-string-lcci"},{"articleLive":2,"formTitle":"[面试题 01.07]Rotate Matrix LCCI","frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","title":"Rotate Matrix LCCI","titleSlug":"rotate-matrix-lcci"},{"articleLive":2,"formTitle":"[面试题 01.08]Zero Matrix LCCI","frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","title":"Zero Matrix LCCI","titleSlug":"zero-matrix-lcci"},{"articleLive":2,"formTitle":"[面试题 01.09]String Rotation LCCI","frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","title":"String Rotation LCCI","titleSlug":"string-rotation-lcci"},{"articleLive":2,"formTitle":"[面试题 02.01]Remove Duplicate Node LCCI","frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"","title":"Remove Duplicate Node LCCI","titleSlug":"remove-duplicate-node-lcci"},{"articleLive":2,"formTitle":"[面试题 02.02]Kth Node From End of List LCCI","frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"","title":"Kth Node From End of List LCCI","titleSlug":"kth-node-from-end-of-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.03]Delete Middle Node LCCI","frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"","title":"Delete Middle Node LCCI","titleSlug":"delete-middle-node-lcci"},{"articleLive":2,"formTitle":"[面试题 02.04]Partition List LCCI","frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"","title":"Partition List LCCI","titleSlug":"partition-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.05]Sum Lists LCCI","frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"","title":"Sum Lists LCCI","titleSlug":"sum-lists-lcci"},{"articleLive":2,"formTitle":"[面试题 02.06]Palindrome Linked List LCCI","frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"","title":"Palindrome Linked List LCCI","titleSlug":"palindrome-linked-list-lcci"},{"articleLive":2,"formTitle":"[面试题 02.07]Intersection of Two Linked Lists LCCI","frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"","title":"Intersection of Two Linked Lists LCCI","titleSlug":"intersection-of-two-linked-lists-lcci"},{"articleLive":2,"formTitle":"[面试题 02.08]Linked List Cycle LCCI","frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"","title":"Linked List Cycle LCCI","titleSlug":"linked-list-cycle-lcci"},{"articleLive":2,"formTitle":"[面试题 03.01]Three in One LCCI","frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","title":"Three in One LCCI","titleSlug":"three-in-one-lcci"},{"articleLive":2,"formTitle":"[面试题 03.02]Min Stack LCCI","frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"","title":"Min Stack LCCI","titleSlug":"min-stack-lcci"},{"articleLive":2,"formTitle":"[面试题 03.03]Stack of Plates LCCI","frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","title":"Stack of Plates LCCI","titleSlug":"stack-of-plates-lcci"},{"articleLive":2,"formTitle":"[面试题 03.04]Implement Queue using Stacks LCCI","frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"","title":"Implement Queue using Stacks LCCI","titleSlug":"implement-queue-using-stacks-lcci"},{"articleLive":2,"formTitle":"[面试题 03.05]Sort of Stacks LCCI","frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","title":"Sort of Stacks LCCI","titleSlug":"sort-of-stacks-lcci"},{"articleLive":2,"formTitle":"[面试题 03.06]Animal Shelter LCCI","frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","title":"Animal Shelter LCCI","titleSlug":"animal-shelter-lcci"},{"articleLive":2,"formTitle":"[面试题 04.01]Route Between Nodes LCCI","frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","title":"Route Between Nodes LCCI","titleSlug":"route-between-nodes-lcci"},{"articleLive":2,"formTitle":"[面试题 04.02]Minimum Height Tree LCCI","frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","title":"Minimum Height Tree LCCI","titleSlug":"minimum-height-tree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.03]List of Depth LCCI","frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","title":"List of Depth LCCI","titleSlug":"list-of-depth-lcci"},{"articleLive":2,"formTitle":"[面试题 04.04]Check Balance LCCI","frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","title":"Check Balance LCCI","titleSlug":"check-balance-lcci"},{"articleLive":2,"formTitle":"[面试题 04.05]Legal Binary Search Tree LCCI","frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","title":"Legal Binary Search Tree LCCI","titleSlug":"legal-binary-search-tree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.06]Successor LCCI","frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","title":"Successor LCCI","titleSlug":"successor-lcci"},{"articleLive":2,"formTitle":"[面试题 04.08]First Common Ancestor LCCI","frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","title":"First Common Ancestor LCCI","titleSlug":"first-common-ancestor-lcci"},{"articleLive":2,"formTitle":"[面试题 04.09]BST Sequences LCCI","frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","title":"BST Sequences LCCI","titleSlug":"bst-sequences-lcci"},{"articleLive":2,"formTitle":"[面试题 04.10]Check SubTree LCCI","frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","title":"Check SubTree LCCI","titleSlug":"check-subtree-lcci"},{"articleLive":2,"formTitle":"[面试题 04.12]Paths with Sum LCCI","frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","title":"Paths with Sum LCCI","titleSlug":"paths-with-sum-lcci"},{"articleLive":2,"formTitle":"[面试题 05.01]Insert Into Bits LCCI","frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","title":"Insert Into Bits LCCI","titleSlug":"insert-into-bits-lcci"},{"articleLive":2,"formTitle":"[面试题 05.02]Bianry Number to String LCCI","frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","title":"Bianry Number to String LCCI","titleSlug":"bianry-number-to-string-lcci"},{"articleLive":2,"formTitle":"[面试题 05.03]Reverse Bits LCCI","frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","title":"Reverse Bits LCCI","titleSlug":"reverse-bits-lcci"},{"articleLive":2,"formTitle":"[面试题 05.04]Closed Number LCCI","frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","title":"Closed Number LCCI","titleSlug":"closed-number-lcci"},{"articleLive":2,"formTitle":"[面试题 05.06]Convert Integer LCCI","frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","title":"Convert Integer LCCI","titleSlug":"convert-integer-lcci"},{"articleLive":2,"formTitle":"[面试题 05.07]Exchange LCCI","frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","title":"Exchange LCCI","titleSlug":"exchange-lcci"},{"articleLive":2,"formTitle":"[面试题 05.08]Draw Line LCCI","frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","title":"Draw Line LCCI","titleSlug":"draw-line-lcci"},{"articleLive":2,"formTitle":"[面试题 08.01]Three Steps Problem LCCI","frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","title":"Three Steps Problem LCCI","titleSlug":"three-steps-problem-lcci"},{"articleLive":2,"formTitle":"[面试题 08.02]Robot in a Grid LCCI","frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","title":"Robot in a Grid LCCI","titleSlug":"robot-in-a-grid-lcci"},{"articleLive":2,"formTitle":"[面试题 08.03]Magic Index LCCI","frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","title":"Magic Index LCCI","titleSlug":"magic-index-lcci"},{"articleLive":2,"formTitle":"[面试题 08.04]Power Set LCCI","frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","title":"Power Set LCCI","titleSlug":"power-set-lcci"},{"articleLive":2,"formTitle":"[面试题 08.05]Recursive Mulitply LCCI","frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","title":"Recursive Mulitply LCCI","titleSlug":"recursive-mulitply-lcci"},{"articleLive":2,"formTitle":"[面试题 08.06]Hanota LCCI","frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","title":"Hanota LCCI","titleSlug":"hanota-lcci"},{"articleLive":2,"formTitle":"[面试题 08.07]Permutation I LCCI","frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","title":"Permutation I LCCI","titleSlug":"permutation-i-lcci"},{"articleLive":2,"formTitle":"[面试题 08.08]Permutation II LCCI","frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"","title":"Permutation II LCCI","titleSlug":"permutation-ii-lcci"},{"articleLive":2,"formTitle":"[面试题 08.09]Bracket LCCI","frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","title":"Bracket LCCI","titleSlug":"bracket-lcci"},{"articleLive":2,"formTitle":"[面试题 08.10]Color Fill LCCI","frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","title":"Color Fill LCCI","titleSlug":"color-fill-lcci"},{"articleLive":2,"formTitle":"[面试题 08.11]Coin LCCI","frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","title":"Coin LCCI","titleSlug":"coin-lcci"},{"articleLive":2,"formTitle":"[面试题 08.12]Eight Queens LCCI","frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","title":"Eight Queens LCCI","titleSlug":"eight-queens-lcci"},{"articleLive":2,"formTitle":"[面试题 08.13]Pile Box LCCI","frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","title":"Pile Box LCCI","titleSlug":"pile-box-lcci"},{"articleLive":2,"formTitle":"[面试题 08.14]Boolean Evaluation LCCI","frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"","title":"Boolean Evaluation LCCI","titleSlug":"boolean-evaluation-lcci"},{"articleLive":2,"formTitle":"[面试题 10.01]Sorted Merge LCCI","frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","title":"Sorted Merge LCCI","titleSlug":"sorted-merge-lcci"},{"articleLive":2,"formTitle":"[面试题 10.02]Group Anagrams LCCI","frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"","title":"Group Anagrams LCCI","titleSlug":"group-anagrams-lcci"},{"articleLive":2,"formTitle":"[面试题 10.03]Search Rotate Array LCCI","frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","title":"Search Rotate Array LCCI","titleSlug":"search-rotate-array-lcci"},{"articleLive":2,"formTitle":"[面试题 10.05]Sparse Array Search LCCI","frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","title":"Sparse Array Search LCCI","titleSlug":"sparse-array-search-lcci"},{"articleLive":2,"formTitle":"[面试题 10.09]Sorted Matrix Search LCCI","frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","title":"Sorted Matrix Search LCCI","titleSlug":"sorted-matrix-search-lcci"},{"articleLive":2,"formTitle":"[面试题 10.10]Rank from Stream LCCI","frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","title":"Rank from Stream LCCI","titleSlug":"rank-from-stream-lcci"},{"articleLive":2,"formTitle":"[面试题 10.11]Peaks and Valleys LCCI","frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","title":"Peaks and Valleys LCCI","titleSlug":"peaks-and-valleys-lcci"},{"articleLive":2,"formTitle":"[面试题 16.01]Swap Numbers LCCI","frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","title":"Swap Numbers LCCI","titleSlug":"swap-numbers-lcci"},{"articleLive":2,"formTitle":"[面试题 16.02]Words Frequency LCCI","frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","title":"Words Frequency LCCI","titleSlug":"words-frequency-lcci"},{"articleLive":2,"formTitle":"[面试题 16.03]Intersection LCCI","frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","title":"Intersection LCCI","titleSlug":"intersection-lcci"},{"articleLive":2,"formTitle":"[面试题 16.04]Tic-Tac-Toe LCCI","frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","title":"Tic-Tac-Toe LCCI","titleSlug":"tic-tac-toe-lcci"},{"articleLive":2,"formTitle":"[面试题 16.05]Factorial Zeros LCCI","frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","title":"Factorial Zeros LCCI","titleSlug":"factorial-zeros-lcci"},{"articleLive":2,"formTitle":"[面试题 16.06]Smallest Difference LCCI","frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","title":"Smallest Difference LCCI","titleSlug":"smallest-difference-lcci"},{"articleLive":2,"formTitle":"[面试题 16.07]Maximum LCCI","frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","title":"Maximum LCCI","titleSlug":"maximum-lcci"},{"articleLive":2,"formTitle":"[面试题 16.08]English Int LCCI","frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","title":"English Int LCCI","titleSlug":"english-int-lcci"},{"articleLive":2,"formTitle":"[面试题 16.09]Operations LCCI","frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","title":"Operations LCCI","titleSlug":"operations-lcci"},{"articleLive":2,"formTitle":"[面试题 16.10]Living People LCCI","frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","title":"Living People LCCI","titleSlug":"living-people-lcci"},{"articleLive":2,"formTitle":"[面试题 16.11]Diving Board LCCI","frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","title":"Diving Board LCCI","titleSlug":"diving-board-lcci"},{"articleLive":2,"formTitle":"[面试题 16.13]Bisect Squares LCCI","frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","title":"Bisect Squares LCCI","titleSlug":"bisect-squares-lcci"},{"articleLive":2,"formTitle":"[面试题 16.14]Best Line LCCI","frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","title":"Best Line LCCI","titleSlug":"best-line-lcci"},{"articleLive":2,"formTitle":"[面试题 16.15]Master Mind LCCI","frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","title":"Master Mind LCCI","titleSlug":"master-mind-lcci"},{"articleLive":2,"formTitle":"[面试题 16.16]Sub Sort LCCI","frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","title":"Sub Sort LCCI","titleSlug":"sub-sort-lcci"},{"articleLive":2,"formTitle":"[面试题 16.17]Contiguous Sequence LCCI","frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","title":"Contiguous Sequence LCCI","titleSlug":"contiguous-sequence-lcci"},{"articleLive":2,"formTitle":"[面试题 16.18]Pattern Matching LCCI","frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","title":"Pattern Matching LCCI","titleSlug":"pattern-matching-lcci"},{"articleLive":2,"formTitle":"[面试题 16.19]Pond Sizes LCCI","frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","title":"Pond Sizes LCCI","titleSlug":"pond-sizes-lcci"},{"articleLive":2,"formTitle":"[面试题 16.20]T9 LCCI","frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","title":"T9 LCCI","titleSlug":"t9-lcci"},{"articleLive":2,"formTitle":"[面试题 16.21]Sum Swap LCCI","frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","title":"Sum Swap LCCI","titleSlug":"sum-swap-lcci"},{"articleLive":2,"formTitle":"[面试题 16.22]Langtons Ant LCCI","frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","title":"Langtons Ant LCCI","titleSlug":"langtons-ant-lcci"},{"articleLive":2,"formTitle":"[面试题 16.24]Pairs With Sum LCCI","frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","title":"Pairs With Sum LCCI","titleSlug":"pairs-with-sum-lcci"},{"articleLive":2,"formTitle":"[面试题 16.25]LRU Cache LCCI","frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","title":"LRU Cache LCCI","titleSlug":"lru-cache-lcci"},{"articleLive":2,"formTitle":"[面试题 16.26]Calculator LCCI","frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","title":"Calculator LCCI","titleSlug":"calculator-lcci"},{"articleLive":2,"formTitle":"[面试题 17.01]Add Without Plus LCCI","frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","title":"Add Without Plus LCCI","titleSlug":"add-without-plus-lcci"},{"articleLive":2,"formTitle":"[面试题 17.04]Missing Number LCCI","frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","title":"Missing Number LCCI","titleSlug":"missing-number-lcci"},{"articleLive":2,"formTitle":"[面试题 17.05]Find Longest Subarray LCCI","frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","title":"Find Longest Subarray LCCI","titleSlug":"find-longest-subarray-lcci"},{"articleLive":2,"formTitle":"[面试题 17.06]Number Of 2s In Range LCCI","frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","title":"Number Of 2s In Range LCCI","titleSlug":"number-of-2s-in-range-lcci"},{"articleLive":2,"formTitle":"[面试题 17.07]Baby Names LCCI","frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","title":"Baby Names LCCI","titleSlug":"baby-names-lcci"},{"articleLive":2,"formTitle":"[面试题 17.08]Circus Tower LCCI","frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","title":"Circus Tower LCCI","titleSlug":"circus-tower-lcci"},{"articleLive":2,"formTitle":"[面试题 17.09]Get Kth Magic Number LCCI","frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","title":"Get Kth Magic Number LCCI","titleSlug":"get-kth-magic-number-lcci"},{"articleLive":2,"formTitle":"[面试题 17.10]Find Majority Element LCCI","frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"","title":"Find Majority Element LCCI","titleSlug":"find-majority-element-lcci"},{"articleLive":2,"formTitle":"[面试题 17.11]Find Closest LCCI","frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","title":"Find Closest LCCI","titleSlug":"find-closest-lcci"},{"articleLive":2,"formTitle":"[面试题 17.12]BiNode LCCI","frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","title":"BiNode LCCI","titleSlug":"binode-lcci"},{"articleLive":2,"formTitle":"[面试题 17.13]Re-Space LCCI","frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","title":"Re-Space LCCI","titleSlug":"re-space-lcci"},{"articleLive":2,"formTitle":"[面试题 17.14]Smallest K LCCI","frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","title":"Smallest K LCCI","titleSlug":"smallest-k-lcci"},{"articleLive":2,"formTitle":"[面试题 17.15]Longest Word LCCI","frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","title":"Longest Word LCCI","titleSlug":"longest-word-lcci"},{"articleLive":2,"formTitle":"[面试题 17.16]The Masseuse LCCI","frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","title":"The Masseuse LCCI","titleSlug":"the-masseuse-lcci"},{"articleLive":2,"formTitle":"[面试题 17.17]Multi Search LCCI","frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","title":"Multi Search LCCI","titleSlug":"multi-search-lcci"},{"articleLive":2,"formTitle":"[面试题 17.18]Shortest Supersequence LCCI","frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","title":"Shortest Supersequence LCCI","titleSlug":"shortest-supersequence-lcci"},{"articleLive":2,"formTitle":"[面试题 17.19]Missing Two LCCI","frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","title":"Missing Two LCCI","titleSlug":"missing-two-lcci"},{"articleLive":2,"formTitle":"[面试题 17.20]Continuous Median LCCI","frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","title":"Continuous Median LCCI","titleSlug":"continuous-median-lcci"},{"articleLive":2,"formTitle":"[面试题 17.21]Volume of Histogram LCCI","frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","title":"Volume of Histogram LCCI","titleSlug":"volume-of-histogram-lcci"},{"articleLive":2,"formTitle":"[面试题 17.22]Word Transformer LCCI","frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","title":"Word Transformer LCCI","titleSlug":"word-transformer-lcci"},{"articleLive":2,"formTitle":"[面试题 17.23]Max Black Square LCCI","frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","title":"Max Black Square LCCI","titleSlug":"max-black-square-lcci"},{"articleLive":2,"formTitle":"[面试题 17.24]Max Submatrix LCCI","frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","title":"Max Submatrix LCCI","titleSlug":"max-submatrix-lcci"},{"articleLive":2,"formTitle":"[面试题 17.25]Word Rectangle LCCI","frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","title":"Word Rectangle LCCI","titleSlug":"word-rectangle-lcci"},{"articleLive":2,"formTitle":"[面试题 17.26]Sparse Similarity LCCI","frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","title":"Sparse Similarity LCCI","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/library/lib.h b/library/lib.h
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/library/lib.h
@@ -0,0 +1 @@
+
diff --git "a/\345\246\202\344\275\225AK/2021\351\233\206\350\256\255\351\230\237\350\256\272\346\226\207\345\210\235\347\250\277\345\220\210\351\233\206 \351\241\265\347\240\201\345\276\205\344\277\256.pdf" "b/\345\246\202\344\275\225AK/2021\351\233\206\350\256\255\351\230\237\350\256\272\346\226\207\345\210\235\347\250\277\345\220\210\351\233\206 \351\241\265\347\240\201\345\276\205\344\277\256.pdf"
new file mode 100644
index 0000000..bd4efad
Binary files /dev/null and "b/\345\246\202\344\275\225AK/2021\351\233\206\350\256\255\351\230\237\350\256\272\346\226\207\345\210\235\347\250\277\345\220\210\351\233\206 \351\241\265\347\240\201\345\276\205\344\277\256.pdf" differ
diff --git "a/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/CodeForces-ProblemSet.csv" "b/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/CodeForces-ProblemSet.csv"
new file mode 100644
index 0000000..405e307
--- /dev/null
+++ "b/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/CodeForces-ProblemSet.csv"
@@ -0,0 +1,6139 @@
+ID,Title,Tags,Score,Solved,Accepted,Link
+1399F,Yet Another Segments Subset,"data structures, dp, graphs, sortings",2300,743,0,https://codeforces.com/problemset/problem/1399/F
+1399E2,Weights Division (hard version),"binary search, dfs and similar, greedy, sortings, trees, two pointers",2200,1237,0,https://codeforces.com/problemset/problem/1399/E2
+1399E1,Weights Division (easy version),"data structures, dfs and similar, greedy, trees",2000,3462,0,https://codeforces.com/problemset/problem/1399/E1
+1399D,Binary String To Subsequences,"constructive algorithms, data structures, greedy, implementation",1500,9691,0,https://codeforces.com/problemset/problem/1399/D
+1399C,Boats Competition,"brute force, greedy, two pointers",1200,15046,0,https://codeforces.com/problemset/problem/1399/C
+1399B,Gifts Fixing,greedy,800,22294,0,https://codeforces.com/problemset/problem/1399/B
+1399A,Remove Smallest,"greedy, sortings",800,24250,0,https://codeforces.com/problemset/problem/1399/A
+1398G,Running Competition,"bitmasks, fft, math, number theory",2600,304,0,https://codeforces.com/problemset/problem/1398/G
+1398F,Controversial Rounds,"binary search, data structures, dp, greedy, two pointers",2500,522,0,https://codeforces.com/problemset/problem/1398/F
+1398E,Two Types of Spells,"binary search, data structures, greedy, implementation, math, sortings",2200,1310,0,https://codeforces.com/problemset/problem/1398/E
+1398D,Colored Rectangles,"dp, greedy, sortings",1800,6100,0,https://codeforces.com/problemset/problem/1398/D
+1398C,Good Subarrays,"data structures, dp, math",1600,9057,0,https://codeforces.com/problemset/problem/1398/C
+1398B,Substring Removal Game,"games, greedy, sortings",800,16481,0,https://codeforces.com/problemset/problem/1398/B
+1398A,Bad Triangle,"geometry, math",800,17671,0,https://codeforces.com/problemset/problem/1398/A
+1395C,Boboniu and Bit Operations,"bitmasks, brute force, dp, greedy",1600,7153,0,https://codeforces.com/problemset/problem/1395/C
+1395B,Boboniu Plays Chess,constructive algorithms,1100,11648,0,https://codeforces.com/problemset/problem/1395/B
+1395A,Boboniu Likes to Color Balls,"brute force, math",1000,14131,0,https://codeforces.com/problemset/problem/1395/A
+1394E,Boboniu and Banknote Collection,strings,3500,17,0,https://codeforces.com/problemset/problem/1394/E
+1394D,Boboniu and Jianghu,"dp, greedy, sortings, trees",2800,213,0,https://codeforces.com/problemset/problem/1394/D
+1394C,Boboniu and String,"binary search, geometry, ternary search",2600,440,0,https://codeforces.com/problemset/problem/1394/C
+1394B,Boboniu Walks on Graph,"brute force, dfs and similar, graphs, hashing",2300,1087,0,https://codeforces.com/problemset/problem/1394/B
+1394A,Boboniu Chats with Du,"dp, greedy, sortings, two pointers",1800,3841,0,https://codeforces.com/problemset/problem/1394/A
+1393E2,Twilight and Ancient Scroll (harder version),"dp, hashing, implementation, string suffix structures, strings, two pointers",3200,89,0,https://codeforces.com/problemset/problem/1393/E2
+1393E1,Twilight and Ancient Scroll (easier version),"dp, hashing, implementation, string suffix structures, strings",2800,144,0,https://codeforces.com/problemset/problem/1393/E1
+1393D,Rarity and New Dress,"dfs and similar, dp, implementation, shortest paths",2100,2479,0,https://codeforces.com/problemset/problem/1393/D
+1393C,Pinkie Pie Eats Patty-cakes,"constructive algorithms, greedy, math, sortings",1700,6637,0,https://codeforces.com/problemset/problem/1393/C
+1393B,Applejack and Storages,"constructive algorithms, data structures, greedy, implementation",1400,10086,0,https://codeforces.com/problemset/problem/1393/B
+1393A,"Rainbow Dash, Fluttershy and Chess Coloring","greedy, math",800,15739,0,https://codeforces.com/problemset/problem/1393/A
+1392I,Kevin and Grid,"fft, graphs, math",3300,27,0,https://codeforces.com/problemset/problem/1392/I
+1392H,ZS Shuffles Cards,"combinatorics, dp, math, probabilities",3000,122,0,https://codeforces.com/problemset/problem/1392/H
+1392G,Omkar and Pies,"bitmasks, dfs and similar, dp, math, shortest paths",2900,151,0,https://codeforces.com/problemset/problem/1392/G
+1392F,Omkar and Landslide,"binary search, constructive algorithms, data structures, greedy, math",2400,1142,0,https://codeforces.com/problemset/problem/1392/F
+1392E,Omkar and Duck,"bitmasks, constructive algorithms, interactive, math",2100,2148,0,https://codeforces.com/problemset/problem/1392/E
+1392D,Omkar and Bed Wars,"dp, greedy",1700,5380,0,https://codeforces.com/problemset/problem/1392/D
+1392C,Omkar and Waterslide,"greedy, implementation",1200,10939,0,https://codeforces.com/problemset/problem/1392/C
+1392B,Omkar and Infinity Clock,"implementation, math",800,13079,0,https://codeforces.com/problemset/problem/1392/B
+1392A,Omkar and Password,"greedy, math",800,13858,0,https://codeforces.com/problemset/problem/1392/A
+1391E,Pairs of Pairs,"constructive algorithms, dfs and similar, graphs, greedy, trees",2600,662,0,https://codeforces.com/problemset/problem/1391/E
+1391D,505,"bitmasks, brute force, constructive algorithms, dp, greedy, implementation",2000,2967,0,https://codeforces.com/problemset/problem/1391/D
+1391C,Cyclic Permutations,"combinatorics, dp, graphs, math",1500,9205,0,https://codeforces.com/problemset/problem/1391/C
+1391B,Fix You,"brute force, greedy, implementation",800,16365,0,https://codeforces.com/problemset/problem/1391/B
+1391A,Suborrays,"constructive algorithms, math",800,17650,0,https://codeforces.com/problemset/problem/1391/A
+1389G,Directing Edges,"dfs and similar, dp, graphs, trees",2800,142,0,https://codeforces.com/problemset/problem/1389/G
+1389F,Bicolored Segments,"data structures, dp, graph matchings, sortings",2600,467,0,https://codeforces.com/problemset/problem/1389/F
+1389E,Calendar Ambiguity,"math, number theory",2200,2080,0,https://codeforces.com/problemset/problem/1389/E
+1389D,Segment Intersections,"brute force, greedy, implementation, math",2100,2937,0,https://codeforces.com/problemset/problem/1389/D
+1389C,Good String,"brute force, dp, greedy, two pointers",1500,10117,0,https://codeforces.com/problemset/problem/1389/C
+1389B,Array Walk,"brute force, dp, greedy",1600,8706,0,https://codeforces.com/problemset/problem/1389/B
+1389A,LCM Problem,"constructive algorithms, greedy, math, number theory",800,19534,0,https://codeforces.com/problemset/problem/1389/A
+1388E,Uncle Bogdan and Projections,"data structures, geometry, sortings",2700,240,0,https://codeforces.com/problemset/problem/1388/E
+1388D,Captain Flint and Treasure,"data structures, dfs and similar, graphs, greedy, implementation, trees",2000,3933,0,https://codeforces.com/problemset/problem/1388/D
+1388C,Uncle Bogdan and Country Happiness,"dfs and similar, greedy, math, trees",1800,6211,0,https://codeforces.com/problemset/problem/1388/C
+1388B,Captain Flint and a Long Voyage,"greedy, math",1000,15819,0,https://codeforces.com/problemset/problem/1388/B
+1388A,Captain Flint and Crew Recruitment,"brute force, greedy, math, number theory",800,18146,0,https://codeforces.com/problemset/problem/1388/A
+1387C,Viruses,"*special problem, dp, shortest paths, string suffix structures",2900,40,0,https://codeforces.com/problemset/problem/1387/C
+1387B2,Village (Maximum),"*special problem, dfs and similar, trees",2500,229,0,https://codeforces.com/problemset/problem/1387/B2
+1387B1,Village (Minimum),"*special problem, dp, greedy, trees",2100,369,0,https://codeforces.com/problemset/problem/1387/B1
+1387A,Graph,"*special problem, binary search, dfs and similar, dp, math, ternary search",2100,307,0,https://codeforces.com/problemset/problem/1387/A
+1386C,Joker,"*special problem, bitmasks, data structures, divide and conquer, dsu",2800,113,0,https://codeforces.com/problemset/problem/1386/C
+1386B,Mixture,"*special problem, data structures, geometry, math, sortings",2900,62,0,https://codeforces.com/problemset/problem/1386/B
+1386A,Colors,"*special problem, binary search, constructive algorithms, interactive",2700,124,0,https://codeforces.com/problemset/problem/1386/A
+1385G,Columns Swaps,"2-sat, dfs and similar, dsu, graphs, implementation",2300,708,0,https://codeforces.com/problemset/problem/1385/G
+1385F,Removing Leaves,"data structures, greedy, implementation, trees",2300,1249,0,https://codeforces.com/problemset/problem/1385/F
+1385E,Directing Edges,"constructive algorithms, dfs and similar, graphs",2000,3614,0,https://codeforces.com/problemset/problem/1385/E
+1385D,a-Good String,"bitmasks, brute force, divide and conquer, dp, implementation",1500,9695,0,https://codeforces.com/problemset/problem/1385/D
+1385C,Make It Good,greedy,1200,15502,0,https://codeforces.com/problemset/problem/1385/C
+1385B,Restore the Permutation by Merger,greedy,800,22181,0,https://codeforces.com/problemset/problem/1385/B
+1385A,Three Pairwise Maximums,math,800,21260,0,https://codeforces.com/problemset/problem/1385/A
+1384B2,Koa and the Beach (Hard Version),"constructive algorithms, dp, greedy, implementation",2200,1650,0,https://codeforces.com/problemset/problem/1384/B2
+1384B1,Koa and the Beach (Easy Version),"brute force, dp, greedy",1900,2659,0,https://codeforces.com/problemset/problem/1384/B1
+1384A,Common Prefixes,"constructive algorithms, greedy, strings",1200,11937,0,https://codeforces.com/problemset/problem/1384/A
+1383F,Special Edges,"flows, graphs",3200,74,0,https://codeforces.com/problemset/problem/1383/F
+1383E,Strange Operation,"combinatorics, data structures, dp",2800,335,0,https://codeforces.com/problemset/problem/1383/E
+1383D,Rearrange,"brute force, constructive algorithms, graphs, greedy, sortings",2800,257,0,https://codeforces.com/problemset/problem/1383/D
+1383C,String Transformation 2,"bitmasks, dp, graphs, trees",3100,193,0,https://codeforces.com/problemset/problem/1383/C
+1383B,GameGame,"bitmasks, constructive algorithms, dp, games, greedy, math",1900,2947,0,https://codeforces.com/problemset/problem/1383/B
+1383A,String Transformation 1,"dsu, graphs, greedy, sortings, strings, trees, two pointers",1700,6814,0,https://codeforces.com/problemset/problem/1383/A
+1382B,Sequential Nim,"dp, games",1100,15371,0,https://codeforces.com/problemset/problem/1382/B
+1382A,Common Subsequence,brute force,800,18965,0,https://codeforces.com/problemset/problem/1382/A
+1381E,Origami,"geometry, math, sortings",3300,44,0,https://codeforces.com/problemset/problem/1381/E
+1381D,The Majestic Brown Tree Snake,"dfs and similar, dp, greedy, trees, two pointers",3000,151,0,https://codeforces.com/problemset/problem/1381/D
+1381C,Mastermind,"constructive algorithms, graph matchings, greedy, implementation, sortings, two pointers",2500,925,0,https://codeforces.com/problemset/problem/1381/C
+1381B,Unmerge,dp,1800,5137,0,https://codeforces.com/problemset/problem/1381/B
+1381A2,Prefix Flip (Hard Version),"constructive algorithms, data structures, implementation, strings, two pointers",1700,8347,0,https://codeforces.com/problemset/problem/1381/A2
+1381A1,Prefix Flip (Easy Version),"constructive algorithms, data structures, strings",1300,12920,0,https://codeforces.com/problemset/problem/1381/A1
+1380G,Circular Dungeon,"greedy, math, probabilities",2600,321,0,https://codeforces.com/problemset/problem/1380/G
+1380F,Strange Addition,"data structures, dp, matrices",2600,375,0,https://codeforces.com/problemset/problem/1380/F
+1380E,Merging Towers,"data structures, dsu, implementation, trees",2300,1104,0,https://codeforces.com/problemset/problem/1380/E
+1380D,Berserk And Fireball,"constructive algorithms, greedy, implementation, math, two pointers",2000,3003,0,https://codeforces.com/problemset/problem/1380/D
+1380C,Create The Teams,"brute force, dp, greedy, implementation, sortings",1400,9781,0,https://codeforces.com/problemset/problem/1380/C
+1380B,Universal Solution,greedy,1400,8945,0,https://codeforces.com/problemset/problem/1380/B
+1380A,Three Indices,"brute force, data structures",900,13096,0,https://codeforces.com/problemset/problem/1380/A
+1379F2,Chess Strikes Back (hard version),"data structures, divide and conquer",2800,147,0,https://codeforces.com/problemset/problem/1379/F2
+1379F1,Chess Strikes Back (easy version),"binary search, data structures",2700,204,0,https://codeforces.com/problemset/problem/1379/F1
+1379E,Inverse Genealogy,"constructive algorithms, divide and conquer, dp, math, trees",2800,112,0,https://codeforces.com/problemset/problem/1379/E
+1379D,New Passenger Trams,"binary search, brute force, data structures, sortings, two pointers",2300,671,0,https://codeforces.com/problemset/problem/1379/D
+1379C,Choosing flowers,"binary search, brute force, data structures, dfs and similar, dp, greedy, sortings, two pointers",2000,2978,0,https://codeforces.com/problemset/problem/1379/C
+1379B,Dubious Cyrpto,"binary search, brute force, math, number theory",1500,7669,0,https://codeforces.com/problemset/problem/1379/B
+1379A,Acacius and String,"brute force, implementation, strings",1500,7667,0,https://codeforces.com/problemset/problem/1379/A
+1375I,Cubic Lattice,"geometry, math, matrices, number theory",3500,35,0,https://codeforces.com/problemset/problem/1375/I
+1375H,Set Merging,"constructive algorithms, divide and conquer",3300,114,0,https://codeforces.com/problemset/problem/1375/H
+1375G,Tree Modification,"brute force, constructive algorithms, dfs and similar, graph matchings, graphs, trees",2800,911,0,https://codeforces.com/problemset/problem/1375/G
+1375F,Integer Game,"constructive algorithms, games, interactive, math",2600,1220,0,https://codeforces.com/problemset/problem/1375/F
+1375E,Inversion SwapSort,"constructive algorithms, greedy, sortings",2500,1667,0,https://codeforces.com/problemset/problem/1375/E
+1375D,Replace by MEX,"brute force, constructive algorithms, sortings",1900,5954,0,https://codeforces.com/problemset/problem/1375/D
+1375C,Element Extermination,"constructive algorithms, data structures, greedy",1400,11643,0,https://codeforces.com/problemset/problem/1375/C
+1375B,Neighbor Grid,"constructive algorithms, greedy",1200,12095,0,https://codeforces.com/problemset/problem/1375/B
+1375A,Sign Flipping,"constructive algorithms, math",1100,13704,0,https://codeforces.com/problemset/problem/1375/A
+1374F,Cyclic Shifts Sorting,"brute force, constructive algorithms, implementation, sortings",2400,869,0,https://codeforces.com/problemset/problem/1374/F
+1374E2,Reading Books (hard version),"data structures, greedy, implementation, sortings, ternary search, two pointers",2500,547,0,https://codeforces.com/problemset/problem/1374/E2
+1374E1,Reading Books (easy version),"data structures, greedy, sortings",1600,8547,0,https://codeforces.com/problemset/problem/1374/E1
+1374D,Zero Remainder Array,"math, sortings, two pointers",1400,12502,0,https://codeforces.com/problemset/problem/1374/D
+1374C,Move Brackets,"greedy, strings",1000,20201,0,https://codeforces.com/problemset/problem/1374/C
+1374B,"Multiply by 2, divide by 6",math,900,21758,0,https://codeforces.com/problemset/problem/1374/B
+1374A,Required Remainder,math,800,23577,0,https://codeforces.com/problemset/problem/1374/A
+1373G,Pawns,"data structures, divide and conquer, greedy",2600,431,0,https://codeforces.com/problemset/problem/1373/G
+1373F,Network Coverage,"binary search, constructive algorithms, data structures, greedy",2400,1114,0,https://codeforces.com/problemset/problem/1373/F
+1373E,Sum of Digits,"brute force, constructive algorithms, dp, greedy",2200,2056,0,https://codeforces.com/problemset/problem/1373/E
+1373D,Maximum Sum on Even Positions,"divide and conquer, dp, greedy, implementation",1600,8760,0,https://codeforces.com/problemset/problem/1373/D
+1373C,Pluses and Minuses,math,1300,12679,0,https://codeforces.com/problemset/problem/1373/C
+1373B,01 Game,games,900,17774,0,https://codeforces.com/problemset/problem/1373/B
+1373A,Donut Shops,"greedy, implementation, math",1000,16073,0,https://codeforces.com/problemset/problem/1373/A
+1372F,Omkar and Modes,"binary search, divide and conquer, interactive",2700,217,0,https://codeforces.com/problemset/problem/1372/F
+1372E,Omkar and Last Floor,"dp, greedy, two pointers",2900,510,0,https://codeforces.com/problemset/problem/1372/E
+1372D,Omkar and Circle,"brute force, dp, games, greedy",2100,3675,0,https://codeforces.com/problemset/problem/1372/D
+1372C,Omkar and Baseball,"constructive algorithms, math",1500,10589,0,https://codeforces.com/problemset/problem/1372/C
+1372B,Omkar and Last Class of Math,"greedy, math, number theory",1300,14849,0,https://codeforces.com/problemset/problem/1372/B
+1372A,Omkar and Completion,"constructive algorithms, implementation",800,20673,0,https://codeforces.com/problemset/problem/1372/A
+1371F,Raging Thunder,"data structures, divide and conquer, implementation",2800,278,0,https://codeforces.com/problemset/problem/1371/F
+1371E2,Asterism (Hard Version),"binary search, combinatorics, dp, math, number theory, sortings",2300,1663,0,https://codeforces.com/problemset/problem/1371/E2
+1371E1,Asterism (Easy Version),"binary search, brute force, combinatorics, math, number theory, sortings",1900,3641,0,https://codeforces.com/problemset/problem/1371/E1
+1371D,Grid-00100,"constructive algorithms, greedy, implementation",1600,9079,0,https://codeforces.com/problemset/problem/1371/D
+1371C,A Cookie for You,"greedy, implementation, math",1300,13580,0,https://codeforces.com/problemset/problem/1371/C
+1371B,Magical Calendar,math,1200,14647,0,https://codeforces.com/problemset/problem/1371/B
+1371A,Magical Sticks,math,800,22351,0,https://codeforces.com/problemset/problem/1371/A
+1370F2,The Hidden Pair (Hard Version),"binary search, dfs and similar, graphs, interactive, shortest paths, trees",2700,776,0,https://codeforces.com/problemset/problem/1370/F2
+1370F1,The Hidden Pair (Easy Version),"binary search, dfs and similar, graphs, interactive, shortest paths, trees",2400,880,0,https://codeforces.com/problemset/problem/1370/F1
+1370E,Binary Subsequence Rotation,"binary search, constructive algorithms, data structures, greedy",2100,3392,0,https://codeforces.com/problemset/problem/1370/E
+1370D,Odd-Even Subsequence,"binary search, dp, dsu, greedy, implementation",2000,5658,0,https://codeforces.com/problemset/problem/1370/D
+1370C,Number Game,"games, math, number theory",1400,13278,0,https://codeforces.com/problemset/problem/1370/C
+1370B,GCD Compression,"constructive algorithms, math, number theory",1100,15782,0,https://codeforces.com/problemset/problem/1370/B
+1370A,Maximum GCD,"greedy, implementation, math, number theory",800,22232,0,https://codeforces.com/problemset/problem/1370/A
+1369F,BareLee,"dfs and similar, dp, games",2700,370,0,https://codeforces.com/problemset/problem/1369/F
+1369E,DeadLee,"data structures, dfs and similar, greedy, implementation, sortings",2400,1421,0,https://codeforces.com/problemset/problem/1369/E
+1369D,TediousLee,"dp, graphs, greedy, math, trees",1900,5838,0,https://codeforces.com/problemset/problem/1369/D
+1369C,RationalLee,"greedy, math, sortings, two pointers",1400,12087,0,https://codeforces.com/problemset/problem/1369/C
+1369B,AccurateLee,"greedy, implementation, strings",1200,15698,0,https://codeforces.com/problemset/problem/1369/B
+1369A,FashionabLee,"geometry, math",800,21625,0,https://codeforces.com/problemset/problem/1369/A
+1368H2,Breadboard Capacity (hard version),,3500,39,0,https://codeforces.com/problemset/problem/1368/H2
+1368H1,Breadboard Capacity (easy version),"dp, flows, greedy",3300,63,0,https://codeforces.com/problemset/problem/1368/H1
+1368G,Shifting Dominoes,"data structures, geometry, graphs, trees",3200,90,0,https://codeforces.com/problemset/problem/1368/G
+1368F,Lamps on a Circle,"games, implementation, interactive, math",2600,553,0,https://codeforces.com/problemset/problem/1368/F
+1368E,Ski Accidents,"constructive algorithms, graphs, greedy",2500,1317,0,https://codeforces.com/problemset/problem/1368/E
+1368D,"AND, OR and square sum","bitmasks, greedy, math",1700,7016,0,https://codeforces.com/problemset/problem/1368/D
+1368C,Even Picture,constructive algorithms,1500,9374,0,https://codeforces.com/problemset/problem/1368/C
+1368B,Codeforces Subsequences,"brute force, constructive algorithms, greedy, math, strings",1500,11447,0,https://codeforces.com/problemset/problem/1368/B
+1368A,C+=,"brute force, greedy, implementation, math",800,18974,0,https://codeforces.com/problemset/problem/1368/A
+1367F2,Flying Sort (Hard Version),"binary search, data structures, dp, greedy, sortings, two pointers",2400,762,0,https://codeforces.com/problemset/problem/1367/F2
+1367F1,Flying Sort (Easy Version),"dp, greedy, two pointers",2100,1849,0,https://codeforces.com/problemset/problem/1367/F1
+1367E,Necklace Assembly,"brute force, dfs and similar, dp, graphs, greedy, number theory",1900,3516,0,https://codeforces.com/problemset/problem/1367/E
+1367D,Task On The Board,"constructive algorithms, greedy, implementation, sortings",1800,5611,0,https://codeforces.com/problemset/problem/1367/D
+1367C,Social Distance,"constructive algorithms, greedy, math",1300,14425,0,https://codeforces.com/problemset/problem/1367/C
+1367B,Even Array,"greedy, math",800,23266,0,https://codeforces.com/problemset/problem/1367/B
+1367A,Short Substrings,"implementation, strings",800,25626,0,https://codeforces.com/problemset/problem/1367/A
+1366G,Construct the String,"data structures, dp, strings",2700,293,0,https://codeforces.com/problemset/problem/1366/G
+1366F,Jog Around The Graph,"binary search, dp, geometry, graphs",2700,348,0,https://codeforces.com/problemset/problem/1366/F
+1366E,Two Arrays,"binary search, brute force, combinatorics, constructive algorithms, dp, two pointers",2100,2723,0,https://codeforces.com/problemset/problem/1366/E
+1366D,Two Divisors,"constructive algorithms, math, number theory",2000,6110,0,https://codeforces.com/problemset/problem/1366/D
+1366C,Palindromic Paths,"greedy, math",1500,9179,0,https://codeforces.com/problemset/problem/1366/C
+1366B,Shuffle,"math, two pointers",1300,13011,0,https://codeforces.com/problemset/problem/1366/B
+1366A,Shovels and Swords,"binary search, greedy, math",1100,16701,0,https://codeforces.com/problemset/problem/1366/A
+1365G,Secure Password,"bitmasks, combinatorics, constructive algorithms, interactive, math",2800,435,0,https://codeforces.com/problemset/problem/1365/G
+1365F,Swaps Again,"constructive algorithms, implementation, sortings",2100,3124,0,https://codeforces.com/problemset/problem/1365/F
+1365E,Maximum Subsequence Value,"brute force, constructive algorithms",1900,5463,0,https://codeforces.com/problemset/problem/1365/E
+1365D,Solve The Maze,"constructive algorithms, dfs and similar, dsu, graphs, greedy, implementation, shortest paths",1700,8470,0,https://codeforces.com/problemset/problem/1365/D
+1365C,Rotation Matching,"constructive algorithms, data structures, greedy, implementation",1400,13258,0,https://codeforces.com/problemset/problem/1365/C
+1365B,Trouble Sort,"constructive algorithms, implementation",1300,15396,0,https://codeforces.com/problemset/problem/1365/B
+1365A,Matrix Game,"games, greedy, implementation",1100,16885,0,https://codeforces.com/problemset/problem/1365/A
+1364E,X-OR,"bitmasks, constructive algorithms, divide and conquer, interactive, probabilities",2700,594,0,https://codeforces.com/problemset/problem/1364/E
+1364D,Ehab's Last Corollary,"constructive algorithms, dfs and similar, graphs, greedy, implementation, trees",2100,2553,0,https://codeforces.com/problemset/problem/1364/D
+1364C,Ehab and Prefix MEXs,"brute force, constructive algorithms, greedy",1600,8157,0,https://codeforces.com/problemset/problem/1364/C
+1364B,Most socially-distanced subsequence,"greedy, two pointers",1300,12248,0,https://codeforces.com/problemset/problem/1364/B
+1364A,XXXXX,"brute force, data structures, number theory, two pointers",1200,14608,0,https://codeforces.com/problemset/problem/1364/A
+1363F,Rotating Substrings,"dp, strings",2600,697,0,https://codeforces.com/problemset/problem/1363/F
+1363E,Tree Shuffling,"dfs and similar, dp, greedy, trees",2000,4357,0,https://codeforces.com/problemset/problem/1363/E
+1363D,Guess The Maximums,"binary search, implementation, interactive, math",2100,2855,0,https://codeforces.com/problemset/problem/1363/D
+1363C,Game On Leaves,"games, trees",1600,10493,0,https://codeforces.com/problemset/problem/1363/C
+1363B,Subsequence Hate,"implementation, strings",1400,13290,0,https://codeforces.com/problemset/problem/1363/B
+1363A,Odd Selection,"brute force, implementation, math",1200,18391,0,https://codeforces.com/problemset/problem/1363/A
+1362C,Johnny and Another Rating Drop,"bitmasks, greedy, math",1400,11266,0,https://codeforces.com/problemset/problem/1362/C
+1362B,Johnny and His Hobbies,"bitmasks, brute force",1200,12630,0,https://codeforces.com/problemset/problem/1362/B
+1362A,Johnny and Ancient Computer,implementation,1000,15822,0,https://codeforces.com/problemset/problem/1362/A
+1361F,Johnny and New Toy,"data structures, implementation, math",3300,61,0,https://codeforces.com/problemset/problem/1361/F
+1361E,James and the Chase,"dfs and similar, graphs, probabilities, trees",3000,187,0,https://codeforces.com/problemset/problem/1361/E
+1361D,Johnny and James,"greedy, implementation, math, trees",2900,186,0,https://codeforces.com/problemset/problem/1361/D
+1361C,Johnny and Megan's Necklace,"binary search, bitmasks, constructive algorithms, dfs and similar, dsu, graphs",2500,823,0,https://codeforces.com/problemset/problem/1361/C
+1361B,Johnny and Grandmaster,"greedy, implementation, math, sortings",1900,2419,0,https://codeforces.com/problemset/problem/1361/B
+1361A,Johnny and Contribution,"constructive algorithms, graphs, greedy, sortings",1700,6125,0,https://codeforces.com/problemset/problem/1361/A
+1360H,Binary Median,"binary search, bitmasks, brute force, constructive algorithms",2100,3097,0,https://codeforces.com/problemset/problem/1360/H
+1360G,A/B Matrix,"constructive algorithms, greedy, math",1900,5203,0,https://codeforces.com/problemset/problem/1360/G
+1360F,Spy-string,"bitmasks, brute force, constructive algorithms, dp, hashing, strings",1700,7390,0,https://codeforces.com/problemset/problem/1360/F
+1360E,Polygon,"dp, graphs, implementation, shortest paths",1300,14318,0,https://codeforces.com/problemset/problem/1360/E
+1360D,Buying Shovels,"math, number theory",1300,15839,0,https://codeforces.com/problemset/problem/1360/D
+1360C,Similar Pairs,"constructive algorithms, graph matchings, greedy, sortings",1100,18744,0,https://codeforces.com/problemset/problem/1360/C
+1360B,Honest Coach,"greedy, sortings",800,23106,0,https://codeforces.com/problemset/problem/1360/B
+1360A,Minimal Square,"greedy, math",800,23757,0,https://codeforces.com/problemset/problem/1360/A
+1359F,RC Kaboom Show,"binary search, brute force, data structures, geometry, math",2900,224,0,https://codeforces.com/problemset/problem/1359/F
+1359E,Modular Stability,"combinatorics, math, number theory",2000,3785,0,https://codeforces.com/problemset/problem/1359/E
+1359D,Yet Another Yet Another Task,"data structures, dp, implementation, two pointers",2000,5519,0,https://codeforces.com/problemset/problem/1359/D
+1359C,Mixing Water,"binary search, math",1700,8748,0,https://codeforces.com/problemset/problem/1359/C
+1359B,New Theatre Square,"brute force, dp, greedy, implementation, two pointers",1000,17002,0,https://codeforces.com/problemset/problem/1359/B
+1359A,Berland Poker,"brute force, greedy, math",1000,18296,0,https://codeforces.com/problemset/problem/1359/A
+1358F,Tasty Cookie,"binary search, constructive algorithms, greedy, implementation",2700,307,0,https://codeforces.com/problemset/problem/1358/F
+1358E,Are You Fired?,"constructive algorithms, data structures, greedy, implementation",2400,1459,0,https://codeforces.com/problemset/problem/1358/E
+1358D,The Best Vacation,"binary search, brute force, greedy, implementation, two pointers",1900,5852,0,https://codeforces.com/problemset/problem/1358/D
+1358C,Celex Update,math,1600,11573,0,https://codeforces.com/problemset/problem/1358/C
+1358B,Maria Breaks the Self-isolation,"greedy, sortings",1000,17738,0,https://codeforces.com/problemset/problem/1358/B
+1358A,Park Lighting,"greedy, math",800,22290,0,https://codeforces.com/problemset/problem/1358/A
+1355F,Guess Divisors Count,"constructive algorithms, interactive, number theory",2600,464,0,https://codeforces.com/problemset/problem/1355/F
+1355E,Restorer Distance,"binary search, greedy, math, sortings, ternary search",2100,2880,0,https://codeforces.com/problemset/problem/1355/E
+1355D,Game With Array,"constructive algorithms, math",1400,11261,0,https://codeforces.com/problemset/problem/1355/D
+1355C,Count Triangles,"binary search, implementation, math, two pointers",1800,6903,0,https://codeforces.com/problemset/problem/1355/C
+1355B,Young Explorers,"dp, greedy, sortings",1200,15014,0,https://codeforces.com/problemset/problem/1355/B
+1355A,Sequence with Digits,"brute force, implementation, math",1200,16135,0,https://codeforces.com/problemset/problem/1355/A
+1354G,Find a Gift,"binary search, interactive, probabilities",2600,368,0,https://codeforces.com/problemset/problem/1354/G
+1354F,Summoning Minions,"constructive algorithms, dp, flows, graph matchings, greedy, sortings",2500,565,0,https://codeforces.com/problemset/problem/1354/F
+1354E,Graph Coloring,"dfs and similar, dp, graphs",2100,1978,0,https://codeforces.com/problemset/problem/1354/E
+1354D,Multiset,"binary search, data structures",1900,5081,0,https://codeforces.com/problemset/problem/1354/D
+1354C2,Not So Simple Polygon Embedding,"binary search, brute force, geometry, math",2000,4393,0,https://codeforces.com/problemset/problem/1354/C2
+1354C1,Simple Polygon Embedding,"binary search, geometry, math, ternary search",1400,11266,0,https://codeforces.com/problemset/problem/1354/C1
+1354B,Ternary String,"binary search, dp, implementation, two pointers",1200,14890,0,https://codeforces.com/problemset/problem/1354/B
+1354A,Alarm Clock,math,900,16964,0,https://codeforces.com/problemset/problem/1354/A
+1353F,Decreasing Heights,"brute force, dp",2200,2115,0,https://codeforces.com/problemset/problem/1353/F
+1353E,K-periodic Garland,"brute force, dp, greedy",1900,4477,0,https://codeforces.com/problemset/problem/1353/E
+1353D,Constructing the Array,"constructive algorithms, data structures, sortings",1600,10611,0,https://codeforces.com/problemset/problem/1353/D
+1353C,Board Moves,math,1000,20388,0,https://codeforces.com/problemset/problem/1353/C
+1353B,Two Arrays And Swaps,"greedy, sortings",800,23905,0,https://codeforces.com/problemset/problem/1353/B
+1353A,Most Unstable Array,"constructive algorithms, greedy, math",800,23214,0,https://codeforces.com/problemset/problem/1353/A
+1352G,Special Permutation,constructive algorithms,1600,10415,0,https://codeforces.com/problemset/problem/1352/G
+1352F,Binary String Reconstruction,"constructive algorithms, dfs and similar, math",1500,9128,0,https://codeforces.com/problemset/problem/1352/F
+1352E,Special Elements,"brute force, implementation, two pointers",1500,10304,0,https://codeforces.com/problemset/problem/1352/E
+1352D,"Alice, Bob and Candies",implementation,1300,14709,0,https://codeforces.com/problemset/problem/1352/D
+1352C,K-th Not Divisible by n,"binary search, math",1200,19682,0,https://codeforces.com/problemset/problem/1352/C
+1352B,Same Parity Summands,"constructive algorithms, math",1200,17772,0,https://codeforces.com/problemset/problem/1352/B
+1352A,Sum of Round Numbers,"implementation, math",800,27298,0,https://codeforces.com/problemset/problem/1352/A
+1351C,Skier,"data structures, implementation",1400,5161,0,https://codeforces.com/problemset/problem/1351/C
+1351B,Square?,"brute force, implementation, math",900,9412,0,https://codeforces.com/problemset/problem/1351/B
+1351A,A+B (Trial Problem),implementation,800,11179,0,https://codeforces.com/problemset/problem/1351/A
+1350B,Orac and Models,"dp, math, number theory",1400,11549,0,https://codeforces.com/problemset/problem/1350/B
+1350A,Orac and Factors,math,900,17625,0,https://codeforces.com/problemset/problem/1350/A
+1349F2,Slime and Sequences (Hard Version),"dp, fft, math",3500,38,0,https://codeforces.com/problemset/problem/1349/F2
+1349F1,Slime and Sequences (Easy Version),"dp, fft, math",3100,128,0,https://codeforces.com/problemset/problem/1349/F1
+1349E,Slime and Hats,"constructive algorithms, dp, greedy",3500,31,0,https://codeforces.com/problemset/problem/1349/E
+1349D,Slime and Biscuits,"math, probabilities",3200,267,0,https://codeforces.com/problemset/problem/1349/D
+1349C,Orac and Game of Life,"dfs and similar, graphs, implementation, shortest paths",2000,2984,0,https://codeforces.com/problemset/problem/1349/C
+1349B,Orac and Medians,"constructive algorithms, greedy, math",2000,5089,0,https://codeforces.com/problemset/problem/1349/B
+1349A,Orac and LCM,"data structures, math, number theory",1600,9325,0,https://codeforces.com/problemset/problem/1349/A
+1348F,Phoenix and Memory,"data structures, dfs and similar, graphs, greedy",2600,503,0,https://codeforces.com/problemset/problem/1348/F
+1348E,Phoenix and Berries,"brute force, dp, greedy, math",2400,1381,0,https://codeforces.com/problemset/problem/1348/E
+1348D,Phoenix and Science,"binary search, constructive algorithms, greedy, implementation, math",1900,6177,0,https://codeforces.com/problemset/problem/1348/D
+1348C,Phoenix and Distribution,"constructive algorithms, greedy, sortings, strings",1600,9959,0,https://codeforces.com/problemset/problem/1348/C
+1348B,Phoenix and Beauty,"constructive algorithms, data structures, greedy, sortings",1400,15060,0,https://codeforces.com/problemset/problem/1348/B
+1348A,Phoenix and Balance,"greedy, math",800,23838,0,https://codeforces.com/problemset/problem/1348/A
+1346I,Pac-Man 2.0,"*special problem, dp",2900,15,0,https://codeforces.com/problemset/problem/1346/I
+1346H,Game with Segments,"*special problem, data structures, games",2700,20,0,https://codeforces.com/problemset/problem/1346/H
+1346G,Two IP Cameras,"*special problem, math, number theory",2300,82,0,https://codeforces.com/problemset/problem/1346/G
+1346F,Dune II: Battle For Arrakis,"*special problem, data structures, greedy, math",2000,152,0,https://codeforces.com/problemset/problem/1346/F
+1346E,Magic Tricks,"*special problem, dp, graphs",1700,216,0,https://codeforces.com/problemset/problem/1346/E
+1346D,Constructing the Dungeon,"*special problem, graphs, greedy",1600,321,0,https://codeforces.com/problemset/problem/1346/D
+1346C,Spring Cleaning,"*special problem, greedy, sortings",1600,407,0,https://codeforces.com/problemset/problem/1346/C
+1346B,Boot Camp,"*special problem, greedy",1400,790,0,https://codeforces.com/problemset/problem/1346/B
+1346A,Color Revolution,"*special problem, math",1000,1283,0,https://codeforces.com/problemset/problem/1346/A
+1345B,Card Constructions,"binary search, brute force, dp, math",1100,16025,0,https://codeforces.com/problemset/problem/1345/B
+1345A,Puzzle Pieces,math,800,18437,0,https://codeforces.com/problemset/problem/1345/A
+1344F,Piet's Palette,matrices,3200,92,0,https://codeforces.com/problemset/problem/1344/F
+1344E,Train Tracks,"data structures, trees",3100,72,0,https://codeforces.com/problemset/problem/1344/E
+1344D,Résumé Review,"binary search, greedy, math",2700,557,0,https://codeforces.com/problemset/problem/1344/D
+1344C,Quantifier Question,"dfs and similar, dp, graphs, math",2600,1179,0,https://codeforces.com/problemset/problem/1344/C
+1344B,Monopole Magnets,"constructive algorithms, dfs and similar, dsu, graphs",2000,4385,0,https://codeforces.com/problemset/problem/1344/B
+1344A,Hilbert's Hotel,"math, number theory, sortings",1600,10563,0,https://codeforces.com/problemset/problem/1344/A
+1343F,Restore the Permutation by Sorted Segments,"brute force, constructive algorithms, data structures, greedy, implementation",2400,872,0,https://codeforces.com/problemset/problem/1343/F
+1343E,Weights Distributing,"brute force, graphs, greedy, shortest paths, sortings",2100,3333,0,https://codeforces.com/problemset/problem/1343/E
+1343D,Constant Palindrome Sum,"brute force, data structures, greedy, two pointers",1700,8209,0,https://codeforces.com/problemset/problem/1343/D
+1343C,Alternating Subsequence,"dp, greedy, two pointers",1200,20078,0,https://codeforces.com/problemset/problem/1343/C
+1343B,Balanced Array,"constructive algorithms, math",800,26441,0,https://codeforces.com/problemset/problem/1343/B
+1343A,Candies,"brute force, math",900,25629,0,https://codeforces.com/problemset/problem/1343/A
+1342F,Make It Ascending,"bitmasks, brute force, dp",3000,216,0,https://codeforces.com/problemset/problem/1342/F
+1342E,Placing Rooks,"combinatorics, fft, math",2300,1561,0,https://codeforces.com/problemset/problem/1342/E
+1342D,Multiple Testcases,"binary search, constructive algorithms, data structures, greedy, sortings, two pointers",1900,4566,0,https://codeforces.com/problemset/problem/1342/D
+1342C,Yet Another Counting Problem,"math, number theory",1600,9646,0,https://codeforces.com/problemset/problem/1342/C
+1342B,Binary Period,"constructive algorithms, strings",1100,17082,0,https://codeforces.com/problemset/problem/1342/B
+1342A,Road To Zero,"greedy, math",1000,21018,0,https://codeforces.com/problemset/problem/1342/A
+1341B,Nastya and Door,"greedy, implementation",1300,13898,0,https://codeforces.com/problemset/problem/1341/B
+1341A,Nastya and Rice,math,900,19419,0,https://codeforces.com/problemset/problem/1341/A
+1340F,Nastya and CBS,"brute force, data structures, hashing",3300,111,0,https://codeforces.com/problemset/problem/1340/F
+1340E,Nastya and Bees,"graphs, interactive, probabilities",3000,37,0,https://codeforces.com/problemset/problem/1340/E
+1340D,Nastya and Time Machine,"constructive algorithms, dfs and similar, graphs, trees",2600,491,0,https://codeforces.com/problemset/problem/1340/D
+1340C,Nastya and Unexpected Guest,"dfs and similar, dp, graphs, shortest paths",2400,1460,0,https://codeforces.com/problemset/problem/1340/C
+1340B,Nastya and Scoreboard,"bitmasks, dp, graphs, greedy",1700,5713,0,https://codeforces.com/problemset/problem/1340/B
+1340A,Nastya and Strange Generator,"brute force, data structures, greedy, implementation",1500,10789,0,https://codeforces.com/problemset/problem/1340/A
+1339B,Sorted Adjacent Differences,"constructive algorithms, sortings",1200,15881,0,https://codeforces.com/problemset/problem/1339/B
+1339A,Filling Diamonds,"brute force, dp, implementation, math",900,19356,0,https://codeforces.com/problemset/problem/1339/A
+1338E,JYPnation,graphs,3500,78,0,https://codeforces.com/problemset/problem/1338/E
+1338D,Nested Rubber Bands,"constructive algorithms, dfs and similar, dp, math, trees",2700,441,0,https://codeforces.com/problemset/problem/1338/D
+1338C,Perfect Triples,"bitmasks, brute force, constructive algorithms, divide and conquer, math",2200,2206,0,https://codeforces.com/problemset/problem/1338/C
+1338B,Edge Weight Assignment,"bitmasks, constructive algorithms, dfs and similar, greedy, math, trees",1800,5669,0,https://codeforces.com/problemset/problem/1338/B
+1338A,Powered Addition,"greedy, math",1500,13795,0,https://codeforces.com/problemset/problem/1338/A
+1337B,Kana and Dragon Quest game,"greedy, implementation, math",900,20760,0,https://codeforces.com/problemset/problem/1337/B
+1337A,Ichihime and Triangle,"constructive algorithms, math",800,21443,0,https://codeforces.com/problemset/problem/1337/A
+1336F,Journey,"data structures, divide and conquer, graphs, trees",3500,80,0,https://codeforces.com/problemset/problem/1336/F
+1336E2,Chiori and Doll Picking (hard version),"bitmasks, brute force, combinatorics, math",3500,116,0,https://codeforces.com/problemset/problem/1336/E2
+1336E1,Chiori and Doll Picking (easy version),"bitmasks, brute force, combinatorics, math",2700,396,0,https://codeforces.com/problemset/problem/1336/E1
+1336D,Yui and Mahjong Set,"constructive algorithms, interactive",3200,304,0,https://codeforces.com/problemset/problem/1336/D
+1336C,Kaavi and Magic Spell,"dp, strings",2200,2331,0,https://codeforces.com/problemset/problem/1336/C
+1336B,Xenia and Colorful Gems,"binary search, greedy, math, sortings, two pointers",1700,7907,0,https://codeforces.com/problemset/problem/1336/B
+1336A,Linova and Kingdom,"dfs and similar, dp, greedy, sortings, trees",1600,11291,0,https://codeforces.com/problemset/problem/1336/A
+1335F,Robots on a Grid,"data structures, dfs and similar, dsu, graphs, greedy, matrices",2200,1399,0,https://codeforces.com/problemset/problem/1335/F
+1335E2,Three Blocks Palindrome (hard version),"brute force, data structures, dp, two pointers",1800,5338,0,https://codeforces.com/problemset/problem/1335/E2
+1335E1,Three Blocks Palindrome (easy version),"binary search, brute force, data structures, dp, two pointers",1700,7190,0,https://codeforces.com/problemset/problem/1335/E1
+1335D,Anti-Sudoku,"constructive algorithms, implementation",1300,16842,0,https://codeforces.com/problemset/problem/1335/D
+1335C,Two Teams Composing,"binary search, greedy, implementation, sortings",1100,20002,0,https://codeforces.com/problemset/problem/1335/C
+1335B,Construct the String,constructive algorithms,900,22620,0,https://codeforces.com/problemset/problem/1335/B
+1335A,Candies and Two Sisters,math,800,30542,0,https://codeforces.com/problemset/problem/1335/A
+1334G,Substring Search,"bitmasks, brute force, fft",2900,216,0,https://codeforces.com/problemset/problem/1334/G
+1334F,Strange Function,"binary search, data structures, dp, greedy",2500,628,0,https://codeforces.com/problemset/problem/1334/F
+1334E,Divisor Paths,"combinatorics, graphs, greedy, math, number theory",2200,1742,0,https://codeforces.com/problemset/problem/1334/E
+1334D,Minimum Euler Cycle,"constructive algorithms, graphs, greedy, implementation",1800,5205,0,https://codeforces.com/problemset/problem/1334/D
+1334C,Circle of Monsters,"brute force, constructive algorithms, greedy, math",1600,10562,0,https://codeforces.com/problemset/problem/1334/C
+1334B,Middle Class,"greedy, sortings",1100,16834,0,https://codeforces.com/problemset/problem/1334/B
+1334A,Level Statistics,"implementation, math",1200,16497,0,https://codeforces.com/problemset/problem/1334/A
+1333F,Kate and imperfection,"greedy, implementation, math, number theory, sortings, two pointers",2200,2938,0,https://codeforces.com/problemset/problem/1333/F
+1333E,Road to 1600,"brute force, constructive algorithms",2400,951,0,https://codeforces.com/problemset/problem/1333/E
+1333D,Challenges in school №41,"brute force, constructive algorithms, games, graphs, greedy, implementation, sortings",2100,2989,0,https://codeforces.com/problemset/problem/1333/D
+1333C,Eugene and an array,"binary search, data structures, implementation, two pointers",1700,8280,0,https://codeforces.com/problemset/problem/1333/C
+1333B,Kind Anton,"greedy, implementation",1100,15758,0,https://codeforces.com/problemset/problem/1333/B
+1333A,Little Artem,constructive algorithms,1000,17513,0,https://codeforces.com/problemset/problem/1333/A
+1332G,No Monotone Triples,data structures,3100,148,0,https://codeforces.com/problemset/problem/1332/G
+1332F,Independent Set,"dfs and similar, dp, trees",2500,686,0,https://codeforces.com/problemset/problem/1332/F
+1332E,Height All the Same,"combinatorics, constructive algorithms, math, matrices",2100,2591,0,https://codeforces.com/problemset/problem/1332/E
+1332D,Walk on Matrix,"bitmasks, constructive algorithms, math",1700,6134,0,https://codeforces.com/problemset/problem/1332/D
+1332C,K-Complete Word,"dfs and similar, dsu, greedy, implementation, strings",1500,10204,0,https://codeforces.com/problemset/problem/1332/C
+1332B,Composite Coloring,"brute force, constructive algorithms, greedy, math, number theory",1400,11566,0,https://codeforces.com/problemset/problem/1332/B
+1332A,Exercising Walk,"greedy, implementation, math",1100,15551,0,https://codeforces.com/problemset/problem/1332/A
+1330B,Dreamoon Likes Permutations,"implementation, math",1400,10157,0,https://codeforces.com/problemset/problem/1330/B
+1330A,Dreamoon and Ranking Collection,implementation,900,14729,0,https://codeforces.com/problemset/problem/1330/A
+1329E,Dreamoon Loves AA,"binary search, greedy",3300,58,0,https://codeforces.com/problemset/problem/1329/E
+1329D,Dreamoon Likes Strings,"constructive algorithms, data structures",3100,153,0,https://codeforces.com/problemset/problem/1329/D
+1329C,Drazil Likes Heap,"constructive algorithms, data structures, greedy, implementation",2400,1193,0,https://codeforces.com/problemset/problem/1329/C
+1329B,Dreamoon Likes Sequences,"bitmasks, combinatorics, math",1700,4739,0,https://codeforces.com/problemset/problem/1329/B
+1329A,Dreamoon Likes Coloring,"constructive algorithms, greedy, implementation, math",1800,6490,0,https://codeforces.com/problemset/problem/1329/A
+1328F,Make k Equal,greedy,2200,2166,0,https://codeforces.com/problemset/problem/1328/F
+1328E,Tree Queries,"dfs and similar, graphs, trees",1900,4726,0,https://codeforces.com/problemset/problem/1328/E
+1328D,Carousel,"constructive algorithms, dp, graphs, greedy, math",1800,7935,0,https://codeforces.com/problemset/problem/1328/D
+1328C,Ternary XOR,"greedy, implementation",1200,18008,0,https://codeforces.com/problemset/problem/1328/C
+1328B,K-th Beautiful String,"binary search, brute force, combinatorics, implementation, math",1300,17110,0,https://codeforces.com/problemset/problem/1328/B
+1328A,Divisibility Problem,math,800,32304,0,https://codeforces.com/problemset/problem/1328/A
+1327G,Letters and Question Marks,"bitmasks, dp, string suffix structures",2800,248,0,https://codeforces.com/problemset/problem/1327/G
+1327F,AND Segments,"bitmasks, combinatorics, data structures, dp, two pointers",2500,768,0,https://codeforces.com/problemset/problem/1327/F
+1327E,Count The Blocks,"combinatorics, dp, math",1800,5806,0,https://codeforces.com/problemset/problem/1327/E
+1327D,Infinite Path,"brute force, dfs and similar, graphs, math, number theory",2200,2326,0,https://codeforces.com/problemset/problem/1327/D
+1327C,Game with Chips,"constructive algorithms, implementation",1600,9334,0,https://codeforces.com/problemset/problem/1327/C
+1327B,Princesses and Princes,"brute force, graphs, greedy",1200,13589,0,https://codeforces.com/problemset/problem/1327/B
+1327A,Sum of Odd Integers,math,1100,19872,0,https://codeforces.com/problemset/problem/1327/A
+1326G,Spiderweb Trees,"dp, geometry, trees",3500,30,0,https://codeforces.com/problemset/problem/1326/G
+1326F2,Wise Men (Hard Version),"bitmasks, dp, math",3200,153,0,https://codeforces.com/problemset/problem/1326/F2
+1326F1,Wise Men (Easy Version),"bitmasks, brute force, dp, meet-in-the-middle",2600,490,0,https://codeforces.com/problemset/problem/1326/F1
+1326E,Bombs,"data structures, two pointers",2400,1336,0,https://codeforces.com/problemset/problem/1326/E
+1326D2,Prefix-Suffix Palindrome (Hard version),"binary search, greedy, hashing, string suffix structures, strings",1800,5949,0,https://codeforces.com/problemset/problem/1326/D2
+1326D1,Prefix-Suffix Palindrome (Easy version),"hashing, string suffix structures, strings",1500,8042,0,https://codeforces.com/problemset/problem/1326/D1
+1326C,Permutation Partitions,"combinatorics, greedy, math",1300,11133,0,https://codeforces.com/problemset/problem/1326/C
+1326B,Maximums,"implementation, math",900,16697,0,https://codeforces.com/problemset/problem/1326/B
+1326A,Bad Ugly Numbers,"constructive algorithms, number theory",1000,17480,0,https://codeforces.com/problemset/problem/1326/A
+1325F,Ehab's Last Theorem,"constructive algorithms, dfs and similar, graphs, greedy",2500,1022,0,https://codeforces.com/problemset/problem/1325/F
+1325E,Ehab's REAL Number Theory Problem,"brute force, dfs and similar, graphs, number theory, shortest paths",2600,1194,0,https://codeforces.com/problemset/problem/1325/E
+1325D,Ehab the Xorcist,"bitmasks, constructive algorithms, greedy, number theory",1700,7310,0,https://codeforces.com/problemset/problem/1325/D
+1325C,Ehab and Path-etic MEXs,"constructive algorithms, dfs and similar, greedy, trees",1500,8940,0,https://codeforces.com/problemset/problem/1325/C
+1325B,CopyCopyCopyCopyCopy,"greedy, implementation",800,20177,0,https://codeforces.com/problemset/problem/1325/B
+1325A,EhAb AnD gCd,"constructive algorithms, greedy, number theory",800,20188,0,https://codeforces.com/problemset/problem/1325/A
+1324F,Maximum White Subtree,"dfs and similar, dp, graphs, trees",1800,4132,0,https://codeforces.com/problemset/problem/1324/F
+1324E,Sleeping Schedule,"dp, implementation",1700,6660,0,https://codeforces.com/problemset/problem/1324/E
+1324D,Pair of Topics,"binary search, data structures, sortings, two pointers",1400,12433,0,https://codeforces.com/problemset/problem/1324/D
+1324C,Frog Jumps,"binary search, data structures, dfs and similar, greedy, implementation",1100,15646,0,https://codeforces.com/problemset/problem/1324/C
+1324B,Yet Another Palindrome Problem,"brute force, strings",1100,16533,0,https://codeforces.com/problemset/problem/1324/B
+1324A,Yet Another Tetris Problem,"implementation, number theory",900,17525,0,https://codeforces.com/problemset/problem/1324/A
+1323B,Count Subrectangles,"binary search, greedy, implementation",1500,5973,0,https://codeforces.com/problemset/problem/1323/B
+1323A,Even Subset Sum Problem,"brute force, dp, greedy, implementation",800,13185,0,https://codeforces.com/problemset/problem/1323/A
+1322F,Assigning Fares,"dp, trees",3500,29,0,https://codeforces.com/problemset/problem/1322/F
+1322E,Median Mountain Range,data structures,3300,74,0,https://codeforces.com/problemset/problem/1322/E
+1322D,Reality Show,"bitmasks, dp",2800,318,0,https://codeforces.com/problemset/problem/1322/D
+1322C,Instant Noodles,"graphs, hashing, math, number theory",2300,1146,0,https://codeforces.com/problemset/problem/1322/C
+1322B,Present,"binary search, bitmasks, constructive algorithms, data structures, math, sortings",2100,2386,0,https://codeforces.com/problemset/problem/1322/B
+1322A,Unusual Competitions,greedy,1300,8934,0,https://codeforces.com/problemset/problem/1322/A
+1321C,Remove Adjacent,"brute force, constructive algorithms, greedy, strings",1600,6191,0,https://codeforces.com/problemset/problem/1321/C
+1321A,Contest for Robots,greedy,900,10427,0,https://codeforces.com/problemset/problem/1321/A
+1320F,Blocks and Sensors,brute force,3500,36,0,https://codeforces.com/problemset/problem/1320/F
+1320E,Treeland and Viruses,"data structures, dfs and similar, dp, shortest paths, trees",3000,264,0,https://codeforces.com/problemset/problem/1320/E
+1320D,Reachable Strings,"data structures, hashing, strings",2500,718,0,https://codeforces.com/problemset/problem/1320/D
+1320C,World of Darkraft: Battle for Azathoth,"brute force, data structures, sortings",2000,2058,0,https://codeforces.com/problemset/problem/1320/C
+1320B,Navigation System,"dfs and similar, graphs, shortest paths",1700,4164,0,https://codeforces.com/problemset/problem/1320/B
+1320A,Journey Planning,"data structures, dp, greedy, math, sortings",1400,9784,0,https://codeforces.com/problemset/problem/1320/A
+1316F,Battalion Strength,"data structures, divide and conquer, probabilities",2800,278,0,https://codeforces.com/problemset/problem/1316/F
+1316E,Team Building,"bitmasks, dp, greedy, sortings",2300,1631,0,https://codeforces.com/problemset/problem/1316/E
+1316D,Nash Matrix,"constructive algorithms, dfs and similar, graphs, implementation",2000,2416,0,https://codeforces.com/problemset/problem/1316/D
+1316C,Primitive Primes,"constructive algorithms, math, ternary search",1800,5225,0,https://codeforces.com/problemset/problem/1316/C
+1316B,String Modification,"brute force, constructive algorithms, implementation, sortings, strings",1400,7746,0,https://codeforces.com/problemset/problem/1316/B
+1316A,Grade Allocation,implementation,800,14243,0,https://codeforces.com/problemset/problem/1316/A
+1315C,Restoring Permutation,greedy,1200,6179,0,https://codeforces.com/problemset/problem/1315/C
+1315B,Homecoming,"binary search, dp, greedy, strings",1300,5908,0,https://codeforces.com/problemset/problem/1315/B
+1315A,Dead Pixel,implementation,800,8908,0,https://codeforces.com/problemset/problem/1315/A
+1313E,Concatenation with intersection,"data structures, hashing, strings, two pointers",2700,244,0,https://codeforces.com/problemset/problem/1313/E
+1313D,Happy New Year,"bitmasks, dp, implementation",2500,468,0,https://codeforces.com/problemset/problem/1313/D
+1313C2,Skyscrapers (hard version),"data structures, dp, greedy",1900,3727,0,https://codeforces.com/problemset/problem/1313/C2
+1313C1,Skyscrapers (easy version),"brute force, data structures, dp, greedy",1500,6421,0,https://codeforces.com/problemset/problem/1313/C1
+1313B,Different Rules,"constructive algorithms, greedy, implementation, math",1700,4706,0,https://codeforces.com/problemset/problem/1313/B
+1313A,Fast Food Restaurant,"brute force, greedy, implementation",900,11027,0,https://codeforces.com/problemset/problem/1313/A
+1312G,Autocompletion,"data structures, dfs and similar, dp",2600,481,0,https://codeforces.com/problemset/problem/1312/G
+1312F,Attack on Red Kingdom,"games, two pointers",2500,448,0,https://codeforces.com/problemset/problem/1312/F
+1312E,Array Shrinking,"dp, greedy",2100,3089,0,https://codeforces.com/problemset/problem/1312/E
+1312D,Count the Arrays,"combinatorics, math",1700,5710,0,https://codeforces.com/problemset/problem/1312/D
+1312C,Adding Powers,"bitmasks, greedy, implementation, math, number theory, ternary search",1400,10162,0,https://codeforces.com/problemset/problem/1312/C
+1312B,Bogosort,"constructive algorithms, sortings",1000,14935,0,https://codeforces.com/problemset/problem/1312/B
+1312A,Two Regular Polygons,"geometry, greedy, math, number theory",800,17312,0,https://codeforces.com/problemset/problem/1312/A
+1311F,Moving Points,"data structures, divide and conquer, implementation, sortings",1900,2320,0,https://codeforces.com/problemset/problem/1311/F
+1311E,Construct the Binary Tree,"brute force, constructive algorithms, trees",2200,1263,0,https://codeforces.com/problemset/problem/1311/E
+1311D,Three Integers,"brute force, math",2000,5609,0,https://codeforces.com/problemset/problem/1311/D
+1311C,Perform the Combo,brute force,1300,10684,0,https://codeforces.com/problemset/problem/1311/C
+1311B,WeirdSort,"dfs and similar, sortings",1200,12282,0,https://codeforces.com/problemset/problem/1311/B
+1311A,Add Odd or Subtract Even,"greedy, implementation, math",800,21735,0,https://codeforces.com/problemset/problem/1311/A
+1310F,Bad Cryptography,"math, number theory",3400,29,0,https://codeforces.com/problemset/problem/1310/F
+1310E,Strange Function,dp,2900,106,0,https://codeforces.com/problemset/problem/1310/E
+1310D,Tourism,"dp, graphs, probabilities",2300,757,0,https://codeforces.com/problemset/problem/1310/D
+1310C,Au Pont Rouge,"binary search, dp, strings",2800,198,0,https://codeforces.com/problemset/problem/1310/C
+1310B,Double Elimination,"dp, implementation",2500,332,0,https://codeforces.com/problemset/problem/1310/B
+1310A,Recommendations,"data structures, greedy, sortings",1700,3440,0,https://codeforces.com/problemset/problem/1310/A
+1307G,Cow and Exercise,"flows, graphs, shortest paths",3100,154,0,https://codeforces.com/problemset/problem/1307/G
+1307F,Cow and Vacation,"dfs and similar, dsu, trees",3300,238,0,https://codeforces.com/problemset/problem/1307/F
+1307E,Cow and Treats,"binary search, combinatorics, dp, greedy, implementation, math",2500,764,0,https://codeforces.com/problemset/problem/1307/E
+1307D,Cow and Fields,"binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings",1900,3859,0,https://codeforces.com/problemset/problem/1307/D
+1307C,Cow and Message,"brute force, dp, math, strings",1500,7639,0,https://codeforces.com/problemset/problem/1307/C
+1307B,Cow and Friend,"geometry, greedy, math",1300,9325,0,https://codeforces.com/problemset/problem/1307/B
+1307A,Cow and Haybales,"greedy, implementation",800,12118,0,https://codeforces.com/problemset/problem/1307/A
+1305H,Kuroni the Private Tutor,"binary search, greedy",3500,30,0,https://codeforces.com/problemset/problem/1305/H
+1305G,Kuroni and Antihype,"bitmasks, brute force, dp, dsu, graphs",3500,209,0,https://codeforces.com/problemset/problem/1305/G
+1305F,Kuroni and the Punishment,"math, number theory, probabilities",2500,1162,0,https://codeforces.com/problemset/problem/1305/F
+1305E,Kuroni and the Score Distribution,"constructive algorithms, greedy, implementation, math",2200,2106,0,https://codeforces.com/problemset/problem/1305/E
+1305D,Kuroni and the Celebration,"constructive algorithms, dfs and similar, interactive, trees",1900,3422,0,https://codeforces.com/problemset/problem/1305/D
+1305C,Kuroni and Impossible Calculation,"brute force, combinatorics, math, number theory",1600,8020,0,https://codeforces.com/problemset/problem/1305/C
+1305B,Kuroni and Simple Strings,"constructive algorithms, greedy, strings, two pointers",1200,8180,0,https://codeforces.com/problemset/problem/1305/B
+1305A,Kuroni and the Gifts,"brute force, constructive algorithms, greedy, sortings",800,11148,0,https://codeforces.com/problemset/problem/1305/A
+1304F2,Animal Observation (hard version),"data structures, dp, greedy",2400,755,0,https://codeforces.com/problemset/problem/1304/F2
+1304F1,Animal Observation (easy version),"data structures, dp",2300,983,0,https://codeforces.com/problemset/problem/1304/F1
+1304E,1-Trees and Queries,"data structures, dfs and similar, shortest paths, trees",2000,2940,0,https://codeforces.com/problemset/problem/1304/E
+1304D,Shortest and Longest LIS,"constructive algorithms, graphs, greedy, two pointers",1800,4233,0,https://codeforces.com/problemset/problem/1304/D
+1304C,Air Conditioner,"dp, greedy, implementation, sortings, two pointers",1500,9548,0,https://codeforces.com/problemset/problem/1304/C
+1304B,Longest Palindrome,"brute force, constructive algorithms, greedy, implementation, strings",1100,12479,0,https://codeforces.com/problemset/problem/1304/B
+1304A,Two Rabbits,math,800,17138,0,https://codeforces.com/problemset/problem/1304/A
+1303G,Sum of Prefix Sums,"data structures, divide and conquer, geometry, trees",2700,302,0,https://codeforces.com/problemset/problem/1303/G
+1303F,Number of Components,"dsu, implementation",2800,283,0,https://codeforces.com/problemset/problem/1303/F
+1303E,Erase Subsequences,"dp, strings",2200,1642,0,https://codeforces.com/problemset/problem/1303/E
+1303D,Fill The Bag,"bitmasks, greedy",1900,4358,0,https://codeforces.com/problemset/problem/1303/D
+1303C,Perfect Keyboard,"dfs and similar, greedy, implementation",1600,7683,0,https://codeforces.com/problemset/problem/1303/C
+1303B,National Project,math,1400,10525,0,https://codeforces.com/problemset/problem/1303/B
+1303A,Erasing Zeroes,"implementation, strings",800,17228,0,https://codeforces.com/problemset/problem/1303/A
+1301F,Super Jaber,"dfs and similar, graphs, implementation, shortest paths",2600,607,0,https://codeforces.com/problemset/problem/1301/F
+1301E,Nanosoft,"binary search, data structures, dp, implementation",2500,793,0,https://codeforces.com/problemset/problem/1301/E
+1301D,Time to Run,"constructive algorithms, graphs, implementation",2000,2906,0,https://codeforces.com/problemset/problem/1301/D
+1301C,Ayoub's function,"binary search, combinatorics, greedy, math, strings",1700,6226,0,https://codeforces.com/problemset/problem/1301/C
+1301B,Motarack's Birthday,"binary search, greedy, ternary search",1500,9339,0,https://codeforces.com/problemset/problem/1301/B
+1301A,Three Strings,"implementation, strings",800,14411,0,https://codeforces.com/problemset/problem/1301/A
+1300B,Assigning to Classes,"greedy, implementation, sortings",1000,13014,0,https://codeforces.com/problemset/problem/1300/B
+1300A,Non-zero,"implementation, math",800,15612,0,https://codeforces.com/problemset/problem/1300/A
+1299E,So Mean,"interactive, math",3400,56,0,https://codeforces.com/problemset/problem/1299/E
+1299D,Around the World,"bitmasks, combinatorics, dfs and similar, dp, graphs, math, trees",3000,197,0,https://codeforces.com/problemset/problem/1299/D
+1299C,Water Balance,"data structures, geometry, greedy",2100,2454,0,https://codeforces.com/problemset/problem/1299/C
+1299B,Aerodynamic,geometry,1800,3996,0,https://codeforces.com/problemset/problem/1299/B
+1299A,Anu Has a Function,"brute force, greedy, math",1500,8375,0,https://codeforces.com/problemset/problem/1299/A
+1296F,Berland Beauty,"constructive algorithms, dfs and similar, greedy, sortings, trees",2100,1776,0,https://codeforces.com/problemset/problem/1296/F
+1296E2,String Coloring (hard version),"data structures, dp",2000,3057,0,https://codeforces.com/problemset/problem/1296/E2
+1296E1,String Coloring (easy version),"constructive algorithms, dp, graphs, greedy, sortings",1800,4394,0,https://codeforces.com/problemset/problem/1296/E1
+1296D,Fight with Monsters,"greedy, sortings",1500,9218,0,https://codeforces.com/problemset/problem/1296/D
+1296C,Yet Another Walking Robot,"data structures, implementation",1500,9612,0,https://codeforces.com/problemset/problem/1296/C
+1296B,Food Buying,math,900,17881,0,https://codeforces.com/problemset/problem/1296/B
+1296A,Array with Odd Sum,math,800,20799,0,https://codeforces.com/problemset/problem/1296/A
+1295F,Good Contest,"combinatorics, dp, probabilities",2700,464,0,https://codeforces.com/problemset/problem/1295/F
+1295E,Permutation Separation,"data structures, divide and conquer",2200,1600,0,https://codeforces.com/problemset/problem/1295/E
+1295D,Same GCDs,"math, number theory",1800,5017,0,https://codeforces.com/problemset/problem/1295/D
+1295C,Obtain The String,"dp, greedy, strings",1600,7876,0,https://codeforces.com/problemset/problem/1295/C
+1295B,Infinite Prefixes,"math, strings",1700,6669,0,https://codeforces.com/problemset/problem/1295/B
+1295A,Display The Number,greedy,900,15857,0,https://codeforces.com/problemset/problem/1295/A
+1294F,Three Paths on a Tree,"dfs and similar, dp, greedy, trees",2000,3016,0,https://codeforces.com/problemset/problem/1294/F
+1294E,Obtain a Permutation,"greedy, implementation, math",1900,3420,0,https://codeforces.com/problemset/problem/1294/E
+1294D,MEX maximizing,"data structures, greedy, implementation, math",1600,7318,0,https://codeforces.com/problemset/problem/1294/D
+1294C,Product of Three Numbers,"greedy, math, number theory",1300,15081,0,https://codeforces.com/problemset/problem/1294/C
+1294B,Collecting Packages,"implementation, sortings",1200,14398,0,https://codeforces.com/problemset/problem/1294/B
+1294A,Collecting Coins,math,800,21967,0,https://codeforces.com/problemset/problem/1294/A
+1293B,JOE is on TV!,"combinatorics, greedy, math",1000,13934,0,https://codeforces.com/problemset/problem/1293/B
+1293A,ConneR and the A.R.C. Markland-N,"binary search, brute force, implementation",1100,11314,0,https://codeforces.com/problemset/problem/1293/A
+1292F,Nora's Toy Boxes,"bitmasks, combinatorics, dp",3500,74,0,https://codeforces.com/problemset/problem/1292/F
+1292E,Rin and The Unknown Flower,"constructive algorithms, greedy, interactive, math",3500,108,0,https://codeforces.com/problemset/problem/1292/E
+1292D,Chaotic V.,"dp, graphs, greedy, math, number theory, trees",2700,500,0,https://codeforces.com/problemset/problem/1292/D
+1292C,Xenon's Attack on the Gangs,"combinatorics, dfs and similar, dp, greedy, trees",2300,1245,0,https://codeforces.com/problemset/problem/1292/C
+1292B,Aroma's Search,"brute force, constructive algorithms, geometry, greedy, implementation",1700,4166,0,https://codeforces.com/problemset/problem/1292/B
+1292A,NEKO's Maze Game,"data structures, dsu, implementation",1400,9485,0,https://codeforces.com/problemset/problem/1292/A
+1291F,Coffee Varieties (easy version),"graphs, interactive",2800,195,0,https://codeforces.com/problemset/problem/1291/F
+1291B,Array Sharpening,"greedy, implementation",1300,9357,0,https://codeforces.com/problemset/problem/1291/B
+1291A,Even But Not Even,"greedy, math, strings",900,12781,0,https://codeforces.com/problemset/problem/1291/A
+1290F,Making Shapes,dp,3500,52,0,https://codeforces.com/problemset/problem/1290/F
+1290E,Cartesian Tree,data structures,3300,81,0,https://codeforces.com/problemset/problem/1290/E
+1290D,Coffee Varieties (hard version),"constructive algorithms, graphs, interactive",3000,277,0,https://codeforces.com/problemset/problem/1290/D
+1290C,Prefix Enlightenment,"dfs and similar, dsu, graphs",2400,939,0,https://codeforces.com/problemset/problem/1290/C
+1290B,Irreducible Anagrams,"binary search, constructive algorithms, data structures, strings, two pointers",1800,3277,0,https://codeforces.com/problemset/problem/1290/B
+1290A,Mind Control,"brute force, data structures, implementation",1600,6091,0,https://codeforces.com/problemset/problem/1290/A
+1288F,Red-Blue Graph,"constructive algorithms, flows",2900,185,0,https://codeforces.com/problemset/problem/1288/F
+1288E,Messenger Simulator,data structures,2000,2034,0,https://codeforces.com/problemset/problem/1288/E
+1288D,Minimax Problem,"binary search, bitmasks, dp",2000,3769,0,https://codeforces.com/problemset/problem/1288/D
+1288C,Two Arrays,"combinatorics, dp",1600,6959,0,https://codeforces.com/problemset/problem/1288/C
+1288B,Yet Another Meme Problem,math,1100,11988,0,https://codeforces.com/problemset/problem/1288/B
+1288A,Deadline,"binary search, brute force, math, ternary search",1100,12432,0,https://codeforces.com/problemset/problem/1288/A
+1287B,Hyperset,"brute force, data structures, implementation",1500,6741,0,https://codeforces.com/problemset/problem/1287/B
+1287A,Angry Students,"greedy, implementation",800,14451,0,https://codeforces.com/problemset/problem/1287/A
+1286F,Harry The Potter,"brute force, constructive algorithms, dp, fft, implementation, math",3100,90,0,https://codeforces.com/problemset/problem/1286/F
+1286E,Fedya the Potter Strikes Back,"data structures, strings",3200,78,0,https://codeforces.com/problemset/problem/1286/E
+1286D,LCC,"data structures, math, matrices, probabilities",3100,246,0,https://codeforces.com/problemset/problem/1286/D
+1286C2,Madhouse (Hard version),"brute force, constructive algorithms, hashing, interactive, math",2800,355,0,https://codeforces.com/problemset/problem/1286/C2
+1286C1,Madhouse (Easy version),"brute force, constructive algorithms, interactive, math",2400,808,0,https://codeforces.com/problemset/problem/1286/C1
+1286B,Numbers on Tree,"constructive algorithms, data structures, dfs and similar, graphs, greedy, trees",1800,2912,0,https://codeforces.com/problemset/problem/1286/B
+1286A,Garland,"dp, greedy, sortings",1800,5406,0,https://codeforces.com/problemset/problem/1286/A
+1285F,Classical?,"binary search, combinatorics, number theory",2900,468,0,https://codeforces.com/problemset/problem/1285/F
+1285E,Delete a Segment,"brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers",2300,1079,0,https://codeforces.com/problemset/problem/1285/E
+1285D,Dr. Evil Underscores,"bitmasks, brute force, dfs and similar, divide and conquer, dp, greedy, strings, trees",1900,4512,0,https://codeforces.com/problemset/problem/1285/D
+1285C,Fadi and LCM,"brute force, math, number theory",1400,11449,0,https://codeforces.com/problemset/problem/1285/C
+1285B,Just Eat It!,"dp, greedy, implementation",1300,11938,0,https://codeforces.com/problemset/problem/1285/B
+1285A,Mezo Playing Zoma,math,800,18990,0,https://codeforces.com/problemset/problem/1285/A
+1284G,Seollal,graphs,3300,53,0,https://codeforces.com/problemset/problem/1284/G
+1284F,New Year and Social Network,"data structures, graph matchings, graphs, math, trees",3200,139,0,https://codeforces.com/problemset/problem/1284/F
+1284E,New Year and Castle Construction,"combinatorics, geometry, math, sortings",2500,723,0,https://codeforces.com/problemset/problem/1284/E
+1284D,New Year and Conference,"binary search, data structures, hashing, sortings",2100,2131,0,https://codeforces.com/problemset/problem/1284/D
+1284C,New Year and Permutation,"combinatorics, math",1600,5600,0,https://codeforces.com/problemset/problem/1284/C
+1284B,New Year and Ascent Sequence,"binary search, combinatorics, data structures, dp, implementation, sortings",1400,7730,0,https://codeforces.com/problemset/problem/1284/B
+1284A,New Year and Naming,"implementation, strings",800,14889,0,https://codeforces.com/problemset/problem/1284/A
+1283F,DIY Garland,"constructive algorithms, greedy, trees",2200,879,0,https://codeforces.com/problemset/problem/1283/F
+1283E,New Year Parties,"dp, greedy",1800,3933,0,https://codeforces.com/problemset/problem/1283/E
+1283D,Christmas Trees,"graphs, greedy, shortest paths",1800,4453,0,https://codeforces.com/problemset/problem/1283/D
+1283C,Friends and Gifts,"constructive algorithms, data structures, math",1500,8016,0,https://codeforces.com/problemset/problem/1283/C
+1283B,Candies Division,math,900,14473,0,https://codeforces.com/problemset/problem/1283/B
+1283A,Minutes Before the New Year,math,800,20244,0,https://codeforces.com/problemset/problem/1283/A
+1282E,The Cake Is a Lie,"constructive algorithms, data structures, dfs and similar, graphs",2400,690,0,https://codeforces.com/problemset/problem/1282/E
+1282D,Enchanted Artifact,"constructive algorithms, interactive, strings",2300,1451,0,https://codeforces.com/problemset/problem/1282/D
+1282C,Petya and Exam,"greedy, sortings, two pointers",1800,3039,0,https://codeforces.com/problemset/problem/1282/C
+1282B2,K for the Price of One (Hard Version),"dp, greedy, sortings",1600,6547,0,https://codeforces.com/problemset/problem/1282/B2
+1282B1,K for the Price of One (Easy Version),"dp, greedy, sortings",1400,7662,0,https://codeforces.com/problemset/problem/1282/B1
+1282A,Temporarily unavailable,"implementation, math",900,11097,0,https://codeforces.com/problemset/problem/1282/A
+1281B,Azamon Web Services,greedy,1600,5371,0,https://codeforces.com/problemset/problem/1281/B
+1281A,Suffix Three,implementation,800,13639,0,https://codeforces.com/problemset/problem/1281/A
+1280F,Intergalactic Sliding Puzzle,"combinatorics, constructive algorithms, math",3400,30,0,https://codeforces.com/problemset/problem/1280/F
+1280E,Kirchhoff's Current Loss,math,2900,102,0,https://codeforces.com/problemset/problem/1280/E
+1280D,Miss Punyverse,"dp, greedy, trees",2500,400,0,https://codeforces.com/problemset/problem/1280/D
+1280C,Jeremy Bearimy,"dfs and similar, graphs, greedy, trees",2000,1540,0,https://codeforces.com/problemset/problem/1280/C
+1280B,Beingawesomeism,"implementation, math",1800,2607,0,https://codeforces.com/problemset/problem/1280/B
+1280A,Cut and Paste,"implementation, math",1700,3439,0,https://codeforces.com/problemset/problem/1280/A
+1279F,New Year and Handle Change,"binary search, dp",2800,375,0,https://codeforces.com/problemset/problem/1279/F
+1279E,New Year Permutations,"combinatorics, dp",2700,216,0,https://codeforces.com/problemset/problem/1279/E
+1279D,Santa's Bot,"combinatorics, math, probabilities",1700,3563,0,https://codeforces.com/problemset/problem/1279/D
+1279C,Stack of Presents,"data structures, implementation",1400,7551,0,https://codeforces.com/problemset/problem/1279/C
+1279B,Verse For Santa,"binary search, brute force, implementation",1300,9155,0,https://codeforces.com/problemset/problem/1279/B
+1279A,New Year Garland,math,900,12131,0,https://codeforces.com/problemset/problem/1279/A
+1278F,Cards,"combinatorics, dp, math, number theory, probabilities",2600,570,0,https://codeforces.com/problemset/problem/1278/F
+1278E,Tests for problem D,"constructive algorithms, dfs and similar, divide and conquer, trees",2200,1145,0,https://codeforces.com/problemset/problem/1278/E
+1278D,Segment Tree,"data structures, dsu, graphs, trees",2100,2378,0,https://codeforces.com/problemset/problem/1278/D
+1278C,Berry Jam,"data structures, dp, greedy, implementation",1700,5175,0,https://codeforces.com/problemset/problem/1278/C
+1278B,A and B,"greedy, math",1500,8059,0,https://codeforces.com/problemset/problem/1278/B
+1278A,Shuffle Hashing,"brute force, implementation, strings",1000,10107,0,https://codeforces.com/problemset/problem/1278/A
+1277D,Let's Play the Words?,"data structures, hashing, implementation, math",1900,2149,0,https://codeforces.com/problemset/problem/1277/D
+1277B,Make Them Odd,"greedy, number theory",1200,8080,0,https://codeforces.com/problemset/problem/1277/B
+1277A,"Happy Birthday, Polycarp!",implementation,1000,8832,0,https://codeforces.com/problemset/problem/1277/A
+1276F,Asterisk Substrings,string suffix structures,3400,89,0,https://codeforces.com/problemset/problem/1276/F
+1276E,Four Stones,constructive algorithms,3500,28,0,https://codeforces.com/problemset/problem/1276/E
+1276D,Tree Elimination,"dp, trees",2900,179,0,https://codeforces.com/problemset/problem/1276/D
+1276C,Beautiful Rectangle,"brute force, combinatorics, constructive algorithms, data structures, greedy, math",2300,964,0,https://codeforces.com/problemset/problem/1276/C
+1276B,Two Fairs,"combinatorics, dfs and similar, dsu, graphs",1900,2937,0,https://codeforces.com/problemset/problem/1276/B
+1276A,As Simple as One and Two,"dp, greedy",1400,7703,0,https://codeforces.com/problemset/problem/1276/A
+1272F,Two Bracket Sequences,"dp, strings, two pointers",2200,994,0,https://codeforces.com/problemset/problem/1272/F
+1272E,Nearest Opposite Parity,"dfs and similar, graphs, shortest paths",1900,3112,0,https://codeforces.com/problemset/problem/1272/E
+1272D,Remove One Element,"brute force, dp",1500,8179,0,https://codeforces.com/problemset/problem/1272/D
+1272C,Yet Another Broken Keyboard,"combinatorics, dp, implementation",1200,11750,0,https://codeforces.com/problemset/problem/1272/C
+1272B,Snow Walking Robot,"constructive algorithms, greedy, implementation",1200,9237,0,https://codeforces.com/problemset/problem/1272/B
+1272A,Three Friends,"brute force, greedy, math, sortings",900,13611,0,https://codeforces.com/problemset/problem/1272/A
+1271F,Divide The Students,brute force,2700,98,0,https://codeforces.com/problemset/problem/1271/F
+1271E,Common Number,"binary search, combinatorics, dp, math",2100,1980,0,https://codeforces.com/problemset/problem/1271/E
+1271D,Portals,"data structures, dp, greedy, implementation, sortings",2100,1540,0,https://codeforces.com/problemset/problem/1271/D
+1271C,Shawarma Tent,"brute force, geometry, greedy, implementation",1300,7193,0,https://codeforces.com/problemset/problem/1271/C
+1271B,Blocks,"greedy, math",1300,7510,0,https://codeforces.com/problemset/problem/1271/B
+1271A,Suits,"brute force, greedy, math",800,11410,0,https://codeforces.com/problemset/problem/1271/A
+1270I,Xor on Figures,"constructive algorithms, fft, math",3500,79,0,https://codeforces.com/problemset/problem/1270/I
+1270H,Number of Components,data structures,3300,169,0,https://codeforces.com/problemset/problem/1270/H
+1270G,Subset with Zero Sum,"constructive algorithms, dfs and similar, graphs, math",2700,778,0,https://codeforces.com/problemset/problem/1270/G
+1270F,Awesome Substrings,"math, strings",2600,588,0,https://codeforces.com/problemset/problem/1270/F
+1270E,Divide Points,"constructive algorithms, geometry, math",2300,1449,0,https://codeforces.com/problemset/problem/1270/E
+1270D,Strange Device,"constructive algorithms, interactive, math, sortings",1900,3314,0,https://codeforces.com/problemset/problem/1270/D
+1270C,Make Good,"bitmasks, constructive algorithms, math",1400,8533,0,https://codeforces.com/problemset/problem/1270/C
+1270B,Interesting Subarray,"constructive algorithms, greedy, math",1200,10503,0,https://codeforces.com/problemset/problem/1270/B
+1270A,Card Game,"games, greedy, math",800,13308,0,https://codeforces.com/problemset/problem/1270/A
+1269B,Modulo Equality,"brute force, sortings",1500,6321,0,https://codeforces.com/problemset/problem/1269/B
+1269A,Equation,"brute force, math",800,12911,0,https://codeforces.com/problemset/problem/1269/A
+1268E,Happy Cactus,dp,3400,77,0,https://codeforces.com/problemset/problem/1268/E
+1268D,Invertation in Tournament,"brute force, divide and conquer, graphs, math",3200,129,0,https://codeforces.com/problemset/problem/1268/D
+1268C,K Integers,"binary search, data structures",2300,1070,0,https://codeforces.com/problemset/problem/1268/C
+1268B,Domino for Young,"dp, greedy, math",2000,3716,0,https://codeforces.com/problemset/problem/1268/B
+1268A,Long Beautiful Integer,"constructive algorithms, greedy, implementation, strings",1700,5890,0,https://codeforces.com/problemset/problem/1268/A
+1267L,Lexicography,"constructive algorithms, strings",1800,1626,0,https://codeforces.com/problemset/problem/1267/L
+1267K,Key Storage,"combinatorics, math",2100,1002,0,https://codeforces.com/problemset/problem/1267/K
+1267J,Just Arrange the Icons,"greedy, implementation, math",1800,1430,0,https://codeforces.com/problemset/problem/1267/J
+1267I,Intriguing Selection,"brute force, constructive algorithms, implementation, interactive, sortings",2600,439,0,https://codeforces.com/problemset/problem/1267/I
+1267H,Help BerLine,constructive algorithms,3200,42,0,https://codeforces.com/problemset/problem/1267/H
+1267G,Game Relics,"math, probabilities",3000,150,0,https://codeforces.com/problemset/problem/1267/G
+1267F,Foolprüf Security,graphs,2600,282,0,https://codeforces.com/problemset/problem/1267/F
+1267E,Elections,greedy,1700,1703,0,https://codeforces.com/problemset/problem/1267/E
+1267D,DevOps Best Practices,constructive algorithms,2800,133,0,https://codeforces.com/problemset/problem/1267/D
+1267C,Cactus Revenge,constructive algorithms,3500,328,0,https://codeforces.com/problemset/problem/1267/C
+1267B,Balls of Buma,,900,2115,0,https://codeforces.com/problemset/problem/1267/B
+1267A,Apprentice Learning Trajectory,,2400,499,0,https://codeforces.com/problemset/problem/1267/A
+1266H,Red-Blue Graph,"dp, graphs, math, matrices, meet-in-the-middle",3400,28,0,https://codeforces.com/problemset/problem/1266/H
+1266G,Permutation Concatenation,string suffix structures,3300,33,0,https://codeforces.com/problemset/problem/1266/G
+1266F,Almost Same Distance,"dfs and similar, graphs",2900,176,0,https://codeforces.com/problemset/problem/1266/F
+1266E,Spaceship Solitaire,"data structures, greedy, implementation",2100,1516,0,https://codeforces.com/problemset/problem/1266/E
+1266D,Decreasing Debts,"constructive algorithms, data structures, graphs, greedy, implementation, math, two pointers",2000,2624,0,https://codeforces.com/problemset/problem/1266/D
+1266C,Diverse Matrix,"constructive algorithms, greedy, math, number theory",1400,6669,0,https://codeforces.com/problemset/problem/1266/C
+1266B,Dice Tower,"constructive algorithms, math",1000,9193,0,https://codeforces.com/problemset/problem/1266/B
+1266A,Competitive Programmer,"chinese remainder theorem, math",1000,9425,0,https://codeforces.com/problemset/problem/1266/A
+1265E,Beautiful Mirrors,"data structures, dp, math, probabilities",2100,1588,0,https://codeforces.com/problemset/problem/1265/E
+1265B,Beautiful Numbers,"data structures, implementation, math, two pointers",1300,8238,0,https://codeforces.com/problemset/problem/1265/B
+1265A,Beautiful String,"constructive algorithms, greedy",1000,10343,0,https://codeforces.com/problemset/problem/1265/A
+1264F,Beautiful Fibonacci Problem,"constructive algorithms, number theory",3500,78,0,https://codeforces.com/problemset/problem/1264/F
+1264E,Beautiful League,"constructive algorithms, flows, graph matchings",2700,263,0,https://codeforces.com/problemset/problem/1264/E
+1264D2,Beautiful Bracket Sequence (hard version),"combinatorics, probabilities",2900,226,0,https://codeforces.com/problemset/problem/1264/D2
+1264D1,Beautiful Bracket Sequence (easy version),"combinatorics, dp, probabilities",2600,559,0,https://codeforces.com/problemset/problem/1264/D1
+1264C,Beautiful Mirrors with queries,"data structures, probabilities",2400,733,0,https://codeforces.com/problemset/problem/1264/C
+1264B,Beautiful Sequence,"brute force, constructive algorithms, greedy",1900,4135,0,https://codeforces.com/problemset/problem/1264/B
+1264A,Beautiful Regional Contest,"greedy, implementation",1500,7347,0,https://codeforces.com/problemset/problem/1264/A
+1263F,Economic Difficulties,"data structures, dfs and similar, dp, flows, graphs, trees",2400,534,0,https://codeforces.com/problemset/problem/1263/F
+1263E,Editor,"data structures, implementation",2100,1874,0,https://codeforces.com/problemset/problem/1263/E
+1263D,Secret Passwords,"dfs and similar, dsu, graphs",1500,7065,0,https://codeforces.com/problemset/problem/1263/D
+1263C,Everyone is a Winner!,"binary search, math, meet-in-the-middle, number theory",1400,8360,0,https://codeforces.com/problemset/problem/1263/C
+1263B,PIN Codes,"greedy, implementation",1400,7470,0,https://codeforces.com/problemset/problem/1263/B
+1263A,Sweet Problem,math,1100,11056,0,https://codeforces.com/problemset/problem/1263/A
+1261F,Xor-Set,"bitmasks, divide and conquer, math",3100,141,0,https://codeforces.com/problemset/problem/1261/F
+1260F,Colored Tree,"data structures, trees",2700,239,0,https://codeforces.com/problemset/problem/1260/F
+1260E,Tournament,"brute force, dp, greedy",2400,1086,0,https://codeforces.com/problemset/problem/1260/E
+1260D,A Game with Traps,"binary search, dp, greedy, sortings",1900,2577,0,https://codeforces.com/problemset/problem/1260/D
+1260C,Infinite Fence,"greedy, math, number theory",1700,5643,0,https://codeforces.com/problemset/problem/1260/C
+1260B,Obtain Two Zeroes,"binary search, math",1300,9593,0,https://codeforces.com/problemset/problem/1260/B
+1260A,Heating,math,1000,9566,0,https://codeforces.com/problemset/problem/1260/A
+1257G,Divisor Set,"divide and conquer, fft, greedy, math, number theory",2600,340,0,https://codeforces.com/problemset/problem/1257/G
+1257F,Make Them Similar,"bitmasks, brute force, hashing, meet-in-the-middle",2400,1214,0,https://codeforces.com/problemset/problem/1257/F
+1257E,The Contest,"data structures, dp, greedy",2000,2842,0,https://codeforces.com/problemset/problem/1257/E
+1257D,Yet Another Monster Killing Problem,"binary search, data structures, dp, greedy, sortings, two pointers",1700,5064,0,https://codeforces.com/problemset/problem/1257/D
+1257C,Dominated Subarray,"greedy, implementation, sortings, strings, two pointers",1200,10423,0,https://codeforces.com/problemset/problem/1257/C
+1257B,Magic Stick,math,1000,12465,0,https://codeforces.com/problemset/problem/1257/B
+1257A,Two Rival Students,"greedy, math",800,15532,0,https://codeforces.com/problemset/problem/1257/A
+1256F,Equalizing Two Strings,"constructive algorithms, sortings, strings",2000,1965,0,https://codeforces.com/problemset/problem/1256/F
+1256E,Yet Another Division Into Teams,"dp, greedy, sortings",2000,2439,0,https://codeforces.com/problemset/problem/1256/E
+1256D,Binary String Minimizing,greedy,1500,7533,0,https://codeforces.com/problemset/problem/1256/D
+1256C,Platforms Jumping,greedy,1700,4770,0,https://codeforces.com/problemset/problem/1256/C
+1256B,Minimize the Permutation,greedy,1400,8824,0,https://codeforces.com/problemset/problem/1256/B
+1256A,Payment Without Change,math,1000,16780,0,https://codeforces.com/problemset/problem/1256/A
+1255C,League of Leesins,"constructive algorithms, implementation",1600,4654,0,https://codeforces.com/problemset/problem/1255/C
+1255B,Fridge Lockers,"graphs, implementation",1100,8066,0,https://codeforces.com/problemset/problem/1255/B
+1255A,Changing Volume,math,800,12408,0,https://codeforces.com/problemset/problem/1255/A
+1254E,Send Tree to Charlie,"combinatorics, dfs and similar, dsu, trees",3300,102,0,https://codeforces.com/problemset/problem/1254/E
+1254D,Tree Queries,"data structures, probabilities, trees",2700,510,0,https://codeforces.com/problemset/problem/1254/D
+1254C,Point Ordering,"constructive algorithms, geometry, interactive, math",2300,860,0,https://codeforces.com/problemset/problem/1254/C
+1254B2,Send Boxes to Alice (Hard Version),"constructive algorithms, greedy, math, number theory, ternary search, two pointers",2100,1957,0,https://codeforces.com/problemset/problem/1254/B2
+1254B1,Send Boxes to Alice (Easy Version),"constructive algorithms, greedy, math, number theory, ternary search, two pointers",1800,2863,0,https://codeforces.com/problemset/problem/1254/B1
+1254A,Feeding Chicken,"constructive algorithms, greedy, implementation",1700,3663,0,https://codeforces.com/problemset/problem/1254/A
+1253F,Cheap Robot,"binary search, dsu, graphs, shortest paths, trees",2500,667,0,https://codeforces.com/problemset/problem/1253/F
+1253E,Antenna Coverage,"data structures, dp, greedy, sortings",2200,1772,0,https://codeforces.com/problemset/problem/1253/E
+1253D,Harmonious Graph,"constructive algorithms, dfs and similar, dsu, graphs, greedy, sortings",1700,5382,0,https://codeforces.com/problemset/problem/1253/D
+1253C,Sweets Eating,"dp, greedy, math, sortings",1500,7979,0,https://codeforces.com/problemset/problem/1253/C
+1253B,Silly Mistake,"greedy, implementation",1400,7443,0,https://codeforces.com/problemset/problem/1253/B
+1253A,Single Push,implementation,1000,11389,0,https://codeforces.com/problemset/problem/1253/A
+1252L,Road Construction,"flows, graphs",2300,369,0,https://codeforces.com/problemset/problem/1252/L
+1252K,Addition Robot,"data structures, math, matrices",2100,1183,0,https://codeforces.com/problemset/problem/1252/K
+1252J,Tiling Terrace,"brute force, dp",2300,460,0,https://codeforces.com/problemset/problem/1252/J
+1252I,Mission Possible,,3000,20,0,https://codeforces.com/problemset/problem/1252/I
+1252H,Twin Buildings,"greedy, implementation",1800,1839,0,https://codeforces.com/problemset/problem/1252/H
+1252G,Performance Review,data structures,2100,905,0,https://codeforces.com/problemset/problem/1252/G
+1252F,Regular Forestation,"hashing, trees",2400,524,0,https://codeforces.com/problemset/problem/1252/F
+1252E,Songwriter,"greedy, two pointers",2200,826,0,https://codeforces.com/problemset/problem/1252/E
+1252D,Find String in a Grid,"data structures, dp, strings, trees",3000,114,0,https://codeforces.com/problemset/problem/1252/D
+1252C,Even Path,"data structures, implementation",1600,2433,0,https://codeforces.com/problemset/problem/1252/C
+1252B,Cleaning Robots,"dp, trees",2300,336,0,https://codeforces.com/problemset/problem/1252/B
+1252A,Copying Homework,,1000,3869,0,https://codeforces.com/problemset/problem/1252/A
+1251F,Red-White Fence,"combinatorics, fft",2500,356,0,https://codeforces.com/problemset/problem/1251/F
+1251E2,Voting (Hard Version),"binary search, data structures, greedy",2400,1308,0,https://codeforces.com/problemset/problem/1251/E2
+1251E1,Voting (Easy Version),"data structures, dp, greedy",2300,1217,0,https://codeforces.com/problemset/problem/1251/E1
+1251D,Salary Changing,"binary search, greedy, sortings",1900,3690,0,https://codeforces.com/problemset/problem/1251/D
+1251C,Minimize The Integer,"greedy, two pointers",1600,7029,0,https://codeforces.com/problemset/problem/1251/C
+1251B,Binary Palindromes,"greedy, strings",1400,7444,0,https://codeforces.com/problemset/problem/1251/B
+1251A,Broken Keyboard,"brute force, strings, two pointers",1000,11617,0,https://codeforces.com/problemset/problem/1251/A
+1250N,Wires,"dfs and similar, graphs, greedy",2000,1108,0,https://codeforces.com/problemset/problem/1250/N
+1250M,SmartGarden,"constructive algorithms, divide and conquer",2500,259,0,https://codeforces.com/problemset/problem/1250/M
+1250L,Divide The Students,"binary search, greedy, math",1500,2424,0,https://codeforces.com/problemset/problem/1250/L
+1250K,Projectors,"flows, graphs",3100,66,0,https://codeforces.com/problemset/problem/1250/K
+1250J,The Parade,"binary search, greedy",1800,1701,0,https://codeforces.com/problemset/problem/1250/J
+1250I,Show Must Go On,"binary search, brute force, greedy, shortest paths",3100,94,0,https://codeforces.com/problemset/problem/1250/I
+1250H,Happy Birthday,math,1500,2619,0,https://codeforces.com/problemset/problem/1250/H
+1250G,Discarding Game,"dp, greedy, two pointers",2300,534,0,https://codeforces.com/problemset/problem/1250/G
+1250F,Data Center,"brute force, implementation",800,4458,0,https://codeforces.com/problemset/problem/1250/F
+1250E,The Coronation,"graphs, implementation",2300,572,0,https://codeforces.com/problemset/problem/1250/E
+1250D,Conference Problem,dp,3000,63,0,https://codeforces.com/problemset/problem/1250/D
+1250C,Trip to Saint Petersburg,data structures,2100,935,0,https://codeforces.com/problemset/problem/1250/C
+1250B,The Feast and the Bus,"brute force, constructive algorithms, greedy, math",1800,1737,0,https://codeforces.com/problemset/problem/1250/B
+1250A,Berstagram,implementation,1400,2631,0,https://codeforces.com/problemset/problem/1250/A
+1249F,Maximum Weight Subset,"dp, trees",2200,1058,0,https://codeforces.com/problemset/problem/1249/F
+1249E,By Elevator or Stairs?,"dp, shortest paths",1700,5252,0,https://codeforces.com/problemset/problem/1249/E
+1249D2,Too Many Segments (hard version),"data structures, greedy, sortings",1800,2910,0,https://codeforces.com/problemset/problem/1249/D2
+1249D1,Too Many Segments (easy version),greedy,1800,2987,0,https://codeforces.com/problemset/problem/1249/D1
+1249C2,Good Numbers (hard version),"binary search, greedy, math, meet-in-the-middle",1500,7803,0,https://codeforces.com/problemset/problem/1249/C2
+1249C1,Good Numbers (easy version),"brute force, greedy, implementation",1300,9500,0,https://codeforces.com/problemset/problem/1249/C1
+1249B2,Books Exchange (hard version),"dfs and similar, dsu, math",1300,9931,0,https://codeforces.com/problemset/problem/1249/B2
+1249B1,Books Exchange (easy version),"dsu, math",1000,13034,0,https://codeforces.com/problemset/problem/1249/B1
+1249A,Yet Another Dividing into Teams,math,800,16031,0,https://codeforces.com/problemset/problem/1249/A
+1248D1,The World Is Just a Programming Task (Easy Version),"brute force, dp, greedy, implementation",2000,1675,0,https://codeforces.com/problemset/problem/1248/D1
+1248B,Grow The Tree,"greedy, math, sortings",900,10702,0,https://codeforces.com/problemset/problem/1248/B
+1248A,Integer Points,"geometry, math",1000,9908,0,https://codeforces.com/problemset/problem/1248/A
+1246F,Cursor Distance,,3500,50,0,https://codeforces.com/problemset/problem/1246/F
+1245F,Daniel and Spring Cleaning,"bitmasks, brute force, combinatorics, dp",2300,1086,0,https://codeforces.com/problemset/problem/1245/F
+1245E,Hyakugoku and Ladders,"dp, probabilities, shortest paths",2300,821,0,https://codeforces.com/problemset/problem/1245/E
+1245D,Shichikuji and Power Grid,"dsu, graphs, greedy, shortest paths, trees",1900,3580,0,https://codeforces.com/problemset/problem/1245/D
+1245C,Constanze's Machine,dp,1400,9074,0,https://codeforces.com/problemset/problem/1245/C
+1245B,Restricted RPS,"constructive algorithms, dp, greedy",1200,9434,0,https://codeforces.com/problemset/problem/1245/B
+1245A,Good ol' Numbers Coloring,"math, number theory",1000,10642,0,https://codeforces.com/problemset/problem/1245/A
+1244G,Running in Pairs,"constructive algorithms, greedy, math",2400,911,0,https://codeforces.com/problemset/problem/1244/G
+1244F,Chips,"constructive algorithms, implementation",2300,974,0,https://codeforces.com/problemset/problem/1244/F
+1244E,Minimizing Difference,"binary search, constructive algorithms, greedy, sortings, ternary search, two pointers",2000,3083,0,https://codeforces.com/problemset/problem/1244/E
+1244D,Paint the Tree,"brute force, constructive algorithms, dp, graphs, implementation, trees",1800,4739,0,https://codeforces.com/problemset/problem/1244/D
+1244C,The Football Season,"brute force, math, number theory",2000,5096,0,https://codeforces.com/problemset/problem/1244/C
+1244B,Rooms and Staircases,"brute force, implementation",1000,10275,0,https://codeforces.com/problemset/problem/1244/B
+1244A,Pens and Pencils,math,800,14061,0,https://codeforces.com/problemset/problem/1244/A
+1243B2,Character Swap (Hard Version),strings,1600,5027,0,https://codeforces.com/problemset/problem/1243/B2
+1243B1,Character Swap (Easy Version),strings,1000,10384,0,https://codeforces.com/problemset/problem/1243/B1
+1243A,Maximum Square,implementation,800,11918,0,https://codeforces.com/problemset/problem/1243/A
+1242E,Planar Perimeter,"constructive algorithms, graphs",3200,54,0,https://codeforces.com/problemset/problem/1242/E
+1242D,Number Discovery,math,3400,87,0,https://codeforces.com/problemset/problem/1242/D
+1242C,Sum Balance,"bitmasks, dfs and similar, dp, graphs",2400,1003,0,https://codeforces.com/problemset/problem/1242/C
+1242B,0-1 MST,"dfs and similar, dsu, graphs, sortings",1900,3876,0,https://codeforces.com/problemset/problem/1242/B
+1242A,Tile Painting,"constructive algorithms, math, number theory",1500,8485,0,https://codeforces.com/problemset/problem/1242/A
+1240F,Football,graphs,3100,65,0,https://codeforces.com/problemset/problem/1240/F
+1239F,"Swiper, no swiping!","graphs, implementation",3400,56,0,https://codeforces.com/problemset/problem/1239/F
+1239E,Turtle,"dp, implementation",3100,255,0,https://codeforces.com/problemset/problem/1239/E
+1239D,Catowice City,"2-sat, dfs and similar, graph matchings, graphs",2400,983,0,https://codeforces.com/problemset/problem/1239/D
+1239C,Queue in the Train,"data structures, greedy, implementation",2300,910,0,https://codeforces.com/problemset/problem/1239/C
+1239B,The World Is Just a Programming Task (Hard Version),implementation,2500,714,0,https://codeforces.com/problemset/problem/1239/B
+1239A,Ivan the Fool and the Probability Theory,"combinatorics, dp, math",1700,5148,0,https://codeforces.com/problemset/problem/1239/A
+1238G,Adilbek and the Watering System,"data structures, greedy, sortings",2700,230,0,https://codeforces.com/problemset/problem/1238/G
+1238F,The Maximum Subtree,"dfs and similar, dp, graphs, trees",2200,1015,0,https://codeforces.com/problemset/problem/1238/F
+1238E,Keyboard Purchase,"bitmasks, dp",2200,1584,0,https://codeforces.com/problemset/problem/1238/E
+1238D,AB-string,"binary search, combinatorics, dp, strings",1900,3916,0,https://codeforces.com/problemset/problem/1238/D
+1238C,Standard Free2play,"dp, greedy, math",1600,5265,0,https://codeforces.com/problemset/problem/1238/C
+1238B,Kill `Em All,"greedy, sortings",1300,9348,0,https://codeforces.com/problemset/problem/1238/B
+1238A,Prime Subtraction,"math, number theory",900,14679,0,https://codeforces.com/problemset/problem/1238/A
+1237H,Balanced Reversals,constructive algorithms,3300,88,0,https://codeforces.com/problemset/problem/1237/H
+1237G,Balanced Distribution,"data structures, dp, greedy",3500,45,0,https://codeforces.com/problemset/problem/1237/G
+1237F,Balanced Domino Placements,"combinatorics, dp",2600,432,0,https://codeforces.com/problemset/problem/1237/F
+1237E,Balanced Binary Search Trees,"dp, math",2400,841,0,https://codeforces.com/problemset/problem/1237/E
+1237D,Balanced Playlist,"binary search, data structures, implementation",2000,2641,0,https://codeforces.com/problemset/problem/1237/D
+1237C2,Balanced Removals (Harder),"binary search, constructive algorithms, divide and conquer, greedy, implementation, sortings",1900,2988,0,https://codeforces.com/problemset/problem/1237/C2
+1237C1,Balanced Removals (Easier),"constructive algorithms, geometry, greedy",1700,4480,0,https://codeforces.com/problemset/problem/1237/C1
+1237B,Balanced Tunnel,"data structures, sortings, two pointers",1300,8584,0,https://codeforces.com/problemset/problem/1237/B
+1237A,Balanced Rating Changes,"implementation, math",1000,10561,0,https://codeforces.com/problemset/problem/1237/A
+1236F,Alice and the Cactus,"dfs and similar, graphs, math, probabilities",3000,67,0,https://codeforces.com/problemset/problem/1236/F
+1236E,Alice and the Unfair Game,"binary search, data structures, dp, dsu",2500,430,0,https://codeforces.com/problemset/problem/1236/E
+1236D,Alice and the Doll,"brute force, data structures, greedy, implementation",2300,1342,0,https://codeforces.com/problemset/problem/1236/D
+1236C,Labs,"constructive algorithms, greedy, implementation",1300,7268,0,https://codeforces.com/problemset/problem/1236/C
+1236B,Alice and the List of Presents,"combinatorics, math",1500,7370,0,https://codeforces.com/problemset/problem/1236/B
+1236A,Stones,"brute force, greedy, math",800,12164,0,https://codeforces.com/problemset/problem/1236/A
+1234F,Yet Another Substring Reverse,"bitmasks, dp",2200,1410,0,https://codeforces.com/problemset/problem/1234/F
+1234E,Special Permutations,math,2000,1792,0,https://codeforces.com/problemset/problem/1234/E
+1234D,Distinct Characters Queries,data structures,1600,7404,0,https://codeforces.com/problemset/problem/1234/D
+1234C,Pipes,"dp, implementation",1500,8100,0,https://codeforces.com/problemset/problem/1234/C
+1234B2,Social Network (hard version),"data structures, implementation",1300,11074,0,https://codeforces.com/problemset/problem/1234/B2
+1234B1,Social Network (easy version),implementation,1000,13078,0,https://codeforces.com/problemset/problem/1234/B1
+1234A,Equalize Prices Again,math,800,18571,0,https://codeforces.com/problemset/problem/1234/A
+1231E,Middle-Out,"constructive algorithms, greedy, strings",2200,437,0,https://codeforces.com/problemset/problem/1231/E
+1231C,Increasing Matrix,greedy,1100,1739,0,https://codeforces.com/problemset/problem/1231/C
+1230B,Ania and Minimizing,"greedy, implementation",1000,12661,0,https://codeforces.com/problemset/problem/1230/B
+1230A,Dawid and Bags of Candies,"brute force, implementation",800,15557,0,https://codeforces.com/problemset/problem/1230/A
+1228F,One Node is Gone,"constructive algorithms, implementation, trees",2500,309,0,https://codeforces.com/problemset/problem/1228/F
+1228E,Another Filling the Grid,"combinatorics, dp, math",2300,1413,0,https://codeforces.com/problemset/problem/1228/E
+1228D,Complete Tripartite,"brute force, constructive algorithms, graphs, hashing, implementation",1900,3867,0,https://codeforces.com/problemset/problem/1228/D
+1228C,Primes and Multiplication,"math, number theory",1700,6223,0,https://codeforces.com/problemset/problem/1228/C
+1228B,Filling the Grid,"implementation, math",1400,8937,0,https://codeforces.com/problemset/problem/1228/B
+1228A,Distinct Digits,"brute force, implementation",800,15755,0,https://codeforces.com/problemset/problem/1228/A
+1227G,Not Same,constructive algorithms,2600,406,0,https://codeforces.com/problemset/problem/1227/G
+1227F2,Wrong Answer on test 233 (Hard Version),"combinatorics, math",2400,842,0,https://codeforces.com/problemset/problem/1227/F2
+1227F1,Wrong Answer on test 233 (Easy Version),dp,2200,1119,0,https://codeforces.com/problemset/problem/1227/F1
+1227E,Arson In Berland Forest,"binary search, graphs, shortest paths",2200,995,0,https://codeforces.com/problemset/problem/1227/E
+1227D2,Optimal Subsequences (Hard Version),"data structures, greedy",1800,2923,0,https://codeforces.com/problemset/problem/1227/D2
+1227D1,Optimal Subsequences (Easy Version),"data structures, greedy",1600,4245,0,https://codeforces.com/problemset/problem/1227/D1
+1227C,Messy,constructive algorithms,1700,3853,0,https://codeforces.com/problemset/problem/1227/C
+1227B,Box,constructive algorithms,1200,6048,0,https://codeforces.com/problemset/problem/1227/B
+1227A,Math Problem,math,1100,7028,0,https://codeforces.com/problemset/problem/1227/A
+1225G,To Make 1,"bitmasks, constructive algorithms, dp, greedy, number theory",3100,163,0,https://codeforces.com/problemset/problem/1225/G
+1225F,Tree Factory,"constructive algorithms, greedy, trees",2500,562,0,https://codeforces.com/problemset/problem/1225/F
+1225E,Rock Is Push,"binary search, dp",2200,1229,0,https://codeforces.com/problemset/problem/1225/E
+1225D,Power Products,"hashing, math, number theory",1800,3967,0,https://codeforces.com/problemset/problem/1225/D
+1225C,p-binary,"bitmasks, brute force, math",1600,5838,0,https://codeforces.com/problemset/problem/1225/C
+1225B2,TV Subscriptions (Hard Version),"implementation, two pointers",1300,7060,0,https://codeforces.com/problemset/problem/1225/B2
+1225B1,TV Subscriptions (Easy Version),implementation,1000,8809,0,https://codeforces.com/problemset/problem/1225/B1
+1225A,Forgetting Things,math,900,11068,0,https://codeforces.com/problemset/problem/1225/A
+1223G,Wooden Raft,"binary search, math, number theory",3200,113,0,https://codeforces.com/problemset/problem/1223/G
+1223F,Stack Exterminable Arrays,"data structures, divide and conquer, dp, hashing",2600,628,0,https://codeforces.com/problemset/problem/1223/F
+1223E,Paint the Tree,"dp, sortings, trees",2100,1708,0,https://codeforces.com/problemset/problem/1223/E
+1223D,Sequence Sorting,"dp, greedy, two pointers",2000,2777,0,https://codeforces.com/problemset/problem/1223/D
+1223C,Save the Nature,"binary search, greedy",1600,5188,0,https://codeforces.com/problemset/problem/1223/C
+1223B,Strings Equalization,strings,1000,10080,0,https://codeforces.com/problemset/problem/1223/B
+1223A,CME,math,800,16395,0,https://codeforces.com/problemset/problem/1223/A
+1221G,Graph And Numbers,"bitmasks, brute force, combinatorics, dp, meet-in-the-middle",2900,227,0,https://codeforces.com/problemset/problem/1221/G
+1221F,Choose a Square,"binary search, data structures, sortings",2400,580,0,https://codeforces.com/problemset/problem/1221/F
+1221E,Game With String,games,2500,735,0,https://codeforces.com/problemset/problem/1221/E
+1221D,Make The Fence Great Again,dp,1800,5186,0,https://codeforces.com/problemset/problem/1221/D
+1221C,Perfect Team,"binary search, math",1200,11363,0,https://codeforces.com/problemset/problem/1221/C
+1221B,Knights,"constructive algorithms, greedy",1100,8570,0,https://codeforces.com/problemset/problem/1221/B
+1221A,2048 Game,"brute force, greedy, math",1000,11364,0,https://codeforces.com/problemset/problem/1221/A
+1220G,Geolocation,geometry,3400,26,0,https://codeforces.com/problemset/problem/1220/G
+1220F,Gardener Alex,"binary search, data structures",2700,413,0,https://codeforces.com/problemset/problem/1220/F
+1220E,Tourism,"dfs and similar, dp, dsu, graphs, greedy, trees",2200,1595,0,https://codeforces.com/problemset/problem/1220/E
+1220D,Alex and Julian,"bitmasks, math, number theory",1900,2715,0,https://codeforces.com/problemset/problem/1220/D
+1220C,Substring Game in the Lesson,"games, greedy, strings",1300,6999,0,https://codeforces.com/problemset/problem/1220/C
+1220B,Multiplication Table,"math, number theory",1300,8247,0,https://codeforces.com/problemset/problem/1220/B
+1220A,Cards,"implementation, sortings, strings",800,17781,0,https://codeforces.com/problemset/problem/1220/A
+1219G,Harvester,implementation,2000,357,0,https://codeforces.com/problemset/problem/1219/G
+1219C,Periodic integer number,"implementation, strings",1700,1015,0,https://codeforces.com/problemset/problem/1219/C
+1218I,The Light Square,"2-sat, dfs and similar, greedy",2100,371,0,https://codeforces.com/problemset/problem/1218/I
+1218H,Function Composition,dfs and similar,2900,62,0,https://codeforces.com/problemset/problem/1218/H
+1218G,Alpha planetary system,"constructive algorithms, graphs, shortest paths",3000,19,0,https://codeforces.com/problemset/problem/1218/G
+1218F,Workout plan,"data structures, greedy",1500,1614,0,https://codeforces.com/problemset/problem/1218/F
+1218E,Product Tuples,"divide and conquer, fft",2500,216,0,https://codeforces.com/problemset/problem/1218/E
+1218D,Xor Spanning Tree,"divide and conquer, fft, graphs",2400,176,0,https://codeforces.com/problemset/problem/1218/D
+1218C,Jumping Transformers,dp,2600,105,0,https://codeforces.com/problemset/problem/1218/C
+1218B,Guarding warehouses,"data structures, geometry",3000,26,0,https://codeforces.com/problemset/problem/1218/B
+1218A,BubbleReactor,"dp, graphs",2800,54,0,https://codeforces.com/problemset/problem/1218/A
+1217F,Forced Online Queries Problem,"data structures, divide and conquer, dsu, graphs, trees",2600,246,0,https://codeforces.com/problemset/problem/1217/F
+1217E,Sum Queries?,"data structures, greedy, implementation, math",2300,1152,0,https://codeforces.com/problemset/problem/1217/E
+1217D,Coloring Edges,"constructive algorithms, dfs and similar, graphs",2100,3272,0,https://codeforces.com/problemset/problem/1217/D
+1217C,The Number Of Good Substrings,"binary search, bitmasks, brute force",1700,5119,0,https://codeforces.com/problemset/problem/1217/C
+1217B,Zmei Gorynich,"greedy, math",1600,7600,0,https://codeforces.com/problemset/problem/1217/B
+1217A,Creating a Character,"binary search, math",1300,10201,0,https://codeforces.com/problemset/problem/1217/A
+1216F,Wi-Fi,"data structures, dp, greedy",2100,1217,0,https://codeforces.com/problemset/problem/1216/F
+1216E2,Numerical Sequence (hard version),"binary search, math",2200,927,0,https://codeforces.com/problemset/problem/1216/E2
+1216E1,Numerical Sequence (easy version),"binary search, brute force, math",1900,2327,0,https://codeforces.com/problemset/problem/1216/E1
+1216D,Swords,math,1300,7397,0,https://codeforces.com/problemset/problem/1216/D
+1216C,White Sheet,"geometry, math",1700,4432,0,https://codeforces.com/problemset/problem/1216/C
+1216B,Shooting,"greedy, implementation, sortings",900,11591,0,https://codeforces.com/problemset/problem/1216/B
+1216A,Prefixes,strings,800,12961,0,https://codeforces.com/problemset/problem/1216/A
+1215F,Radio Stations,2-sat,2700,357,0,https://codeforces.com/problemset/problem/1215/F
+1215E,Marbles,"bitmasks, dp",2200,1775,0,https://codeforces.com/problemset/problem/1215/E
+1215D,Ticket Game,"games, greedy, math",1700,4148,0,https://codeforces.com/problemset/problem/1215/D
+1215C,Swap Letters,"constructive algorithms, greedy",1500,6681,0,https://codeforces.com/problemset/problem/1215/C
+1215B,The Number of Products,"combinatorics, dp, implementation",1400,7503,0,https://codeforces.com/problemset/problem/1215/B
+1215A,Yellow Cards,"greedy, implementation, math",1000,8693,0,https://codeforces.com/problemset/problem/1215/A
+1214H,Tiles Placement,"constructive algorithms, dfs and similar, trees",2800,230,0,https://codeforces.com/problemset/problem/1214/H
+1214G,Feeling Good,"bitmasks, data structures",3200,134,0,https://codeforces.com/problemset/problem/1214/G
+1214F,Employment,"greedy, sortings",2700,287,0,https://codeforces.com/problemset/problem/1214/F
+1214E,Petya and Construction Set,"constructive algorithms, graphs, math, sortings, trees",2000,1835,0,https://codeforces.com/problemset/problem/1214/E
+1214D,Treasure Island,"dfs and similar, dp, flows, hashing",1900,3587,0,https://codeforces.com/problemset/problem/1214/D
+1214C,Bad Sequence,"data structures, greedy",1200,7848,0,https://codeforces.com/problemset/problem/1214/C
+1214B,Badges,"brute force, math",1100,7509,0,https://codeforces.com/problemset/problem/1214/B
+1214A,Optimal Currency Exchange,"brute force, math",1400,6521,0,https://codeforces.com/problemset/problem/1214/A
+1213G,Path Queries,"divide and conquer, dsu, graphs, sortings, trees",1800,3169,0,https://codeforces.com/problemset/problem/1213/G
+1213F,Unstable String Sort,"data structures, dfs and similar, dsu, graphs, greedy, implementation, strings",2100,1477,0,https://codeforces.com/problemset/problem/1213/F
+1213E,Two Small Strings,"brute force, constructive algorithms",1900,3371,0,https://codeforces.com/problemset/problem/1213/E
+1213D2,Equalizing by Division (hard version),"brute force, math, sortings",1600,6844,0,https://codeforces.com/problemset/problem/1213/D2
+1213D1,Equalizing by Division (easy version),"brute force, implementation",1500,7084,0,https://codeforces.com/problemset/problem/1213/D1
+1213C,Book Reading,math,1200,12092,0,https://codeforces.com/problemset/problem/1213/C
+1213B,Bad Prices,"data structures, implementation",1100,14662,0,https://codeforces.com/problemset/problem/1213/B
+1213A,Chips Moving,math,900,16057,0,https://codeforces.com/problemset/problem/1213/A
+1211I,Unusual Graph,"*special problem, graphs",3000,16,0,https://codeforces.com/problemset/problem/1211/I
+1211H,Road Repair in Treeland,"*special problem, binary search, dp, trees",3100,19,0,https://codeforces.com/problemset/problem/1211/H
+1211G,King's Path,"*special problem, math, trees",2500,43,0,https://codeforces.com/problemset/problem/1211/G
+1211F,kotlinkotlinkotlinkotlin...,"*special problem, graphs, implementation, strings",2300,82,0,https://codeforces.com/problemset/problem/1211/F
+1211E,Double Permutation Inc.,"*special problem, binary search, greedy",2000,122,0,https://codeforces.com/problemset/problem/1211/E
+1211D,Teams,"*special problem, binary search, greedy, math",2000,149,0,https://codeforces.com/problemset/problem/1211/D
+1211C,Ice Cream,"*special problem, greedy, sortings",1700,340,0,https://codeforces.com/problemset/problem/1211/C
+1211B,Traveling Around the Golden Ring of Berland,"*special problem, implementation",1500,557,0,https://codeforces.com/problemset/problem/1211/B
+1211A,Three Problems,"*special problem, implementation",1000,722,0,https://codeforces.com/problemset/problem/1211/A
+1210G,Mateusz and Escape Room,dp,3500,31,0,https://codeforces.com/problemset/problem/1210/G
+1210F2,Marek and Matching (hard version),"brute force, probabilities",3200,67,0,https://codeforces.com/problemset/problem/1210/F2
+1210F1,Marek and Matching (easy version),"brute force, probabilities",3100,90,0,https://codeforces.com/problemset/problem/1210/F1
+1210E,Wojtek and Card Tricks,math,2700,255,0,https://codeforces.com/problemset/problem/1210/E
+1210D,Konrad and Company Evaluation,graphs,2400,1101,0,https://codeforces.com/problemset/problem/1210/D
+1210C,Kamil and Making a Stream,"math, number theory, trees",2000,2286,0,https://codeforces.com/problemset/problem/1210/C
+1210B,Marcin and Training Camp,"brute force, greedy",1700,4516,0,https://codeforces.com/problemset/problem/1210/B
+1210A,Anadi and Domino,"brute force, graphs",1700,4143,0,https://codeforces.com/problemset/problem/1210/A
+1209H,Moving Walkways,"data structures, greedy, math",3300,61,0,https://codeforces.com/problemset/problem/1209/H
+1209G2,Into Blocks (hard version),data structures,3200,111,0,https://codeforces.com/problemset/problem/1209/G2
+1209G1,Into Blocks (easy version),"data structures, dsu, greedy, implementation, two pointers",2000,1882,0,https://codeforces.com/problemset/problem/1209/G1
+1209F,Koala and Notebook,"data structures, dfs and similar, graphs, shortest paths, strings, trees",2600,544,0,https://codeforces.com/problemset/problem/1209/F
+1209E2,Rotate Columns (hard version),"bitmasks, dp, greedy, sortings",2500,1040,0,https://codeforces.com/problemset/problem/1209/E2
+1209E1,Rotate Columns (easy version),"bitmasks, brute force, dp, greedy, sortings",2000,1790,0,https://codeforces.com/problemset/problem/1209/E1
+1209D,Cow and Snacks,"dfs and similar, dsu, graphs",1700,4936,0,https://codeforces.com/problemset/problem/1209/D
+1209C,Paint the Digits,"constructive algorithms, greedy, implementation",1500,5194,0,https://codeforces.com/problemset/problem/1209/C
+1209B,Koala and Lights,"implementation, math, number theory",1300,6287,0,https://codeforces.com/problemset/problem/1209/B
+1209A,Paint the Numbers,"greedy, implementation, math",800,9211,0,https://codeforces.com/problemset/problem/1209/A
+1208H,Red Blue Tree,"data structures, implementation, trees",3500,45,0,https://codeforces.com/problemset/problem/1208/H
+1208G,Polygons,"greedy, math, number theory",2800,403,0,https://codeforces.com/problemset/problem/1208/G
+1208F,Bits And Pieces,"bitmasks, dfs and similar, dp, greedy",2600,859,0,https://codeforces.com/problemset/problem/1208/F
+1208E,Let Them Slide,"data structures, implementation",2200,1451,0,https://codeforces.com/problemset/problem/1208/E
+1208D,Restore Permutation,"binary search, data structures, greedy, implementation",1900,3299,0,https://codeforces.com/problemset/problem/1208/D
+1208C,Magic Grid,constructive algorithms,1800,4455,0,https://codeforces.com/problemset/problem/1208/C
+1208B,Uniqueness,"binary search, brute force, implementation, two pointers",1500,6615,0,https://codeforces.com/problemset/problem/1208/B
+1208A,XORinacci,math,900,11707,0,https://codeforces.com/problemset/problem/1208/A
+1207G,Indie Album,"data structures, dfs and similar, hashing, string suffix structures, strings, trees",2700,395,0,https://codeforces.com/problemset/problem/1207/G
+1207F,Remainder Problem,"brute force, data structures, implementation",2100,2431,0,https://codeforces.com/problemset/problem/1207/F
+1207E,XOR Guessing,"bitmasks, interactive, math",1900,3659,0,https://codeforces.com/problemset/problem/1207/E
+1207D,Number Of Permutations,combinatorics,1800,3934,0,https://codeforces.com/problemset/problem/1207/D
+1207C,Gas Pipeline,"dp, greedy",1500,6703,0,https://codeforces.com/problemset/problem/1207/C
+1207B,Square Filling,"constructive algorithms, greedy, implementation",1200,9965,0,https://codeforces.com/problemset/problem/1207/B
+1207A,There Are Two Types Of Burgers,"brute force, greedy, implementation, math",800,16355,0,https://codeforces.com/problemset/problem/1207/A
+1206B,Make Product Equal One,"dp, implementation",900,15266,0,https://codeforces.com/problemset/problem/1206/B
+1206A,Choose Two Numbers,"math, sortings",800,15719,0,https://codeforces.com/problemset/problem/1206/A
+1205F,Beauty of a Permutation,"constructive algorithms, math",3400,45,0,https://codeforces.com/problemset/problem/1205/F
+1205E,Expected Value Again,"combinatorics, strings",3100,108,0,https://codeforces.com/problemset/problem/1205/E
+1205D,Almost All,"constructive algorithms, trees",2700,362,0,https://codeforces.com/problemset/problem/1205/D
+1205C,Palindromic Paths,"implementation, interactive",2400,843,0,https://codeforces.com/problemset/problem/1205/C
+1205B,Shortest Cycle,"bitmasks, brute force, graphs, shortest paths",1900,4280,0,https://codeforces.com/problemset/problem/1205/B
+1205A,Almost Equal,"constructive algorithms, greedy, math",1200,10286,0,https://codeforces.com/problemset/problem/1205/A
+1204E,"Natasha, Sasha and the Prefix Sums","combinatorics, dp, math, number theory",2300,920,0,https://codeforces.com/problemset/problem/1204/E
+1204D2,Kirk and a Binary String (hard version),"data structures, greedy, math, strings",2100,2212,0,https://codeforces.com/problemset/problem/1204/D2
+1204D1,Kirk and a Binary String (easy version),"brute force, greedy, strings",2000,2152,0,https://codeforces.com/problemset/problem/1204/D1
+1204C,"Anna, Svyatoslav and Maps","dp, graphs, greedy, shortest paths",1700,4869,0,https://codeforces.com/problemset/problem/1204/C
+1204B,Mislove Has Lost an Array,"greedy, math",900,12625,0,https://codeforces.com/problemset/problem/1204/B
+1204A,BowWow and the Timetable,math,1000,12472,0,https://codeforces.com/problemset/problem/1204/A
+1203F2,Complete the Projects (hard version),"dp, greedy",2300,1480,0,https://codeforces.com/problemset/problem/1203/F2
+1203F1,Complete the Projects (easy version),greedy,2100,2004,0,https://codeforces.com/problemset/problem/1203/F1
+1203E,Boxers,"greedy, sortings",1500,8129,0,https://codeforces.com/problemset/problem/1203/E
+1203D2,Remove the Substring (hard version),"binary search, greedy, implementation, two pointers",1700,4539,0,https://codeforces.com/problemset/problem/1203/D2
+1203D1,Remove the Substring (easy version),"greedy, implementation",1600,5472,0,https://codeforces.com/problemset/problem/1203/D1
+1203C,Common Divisors,"implementation, math",1300,11215,0,https://codeforces.com/problemset/problem/1203/C
+1203B,Equal Rectangles,"greedy, math",1200,10407,0,https://codeforces.com/problemset/problem/1203/B
+1203A,Circle of Students,implementation,1000,12046,0,https://codeforces.com/problemset/problem/1203/A
+1202F,You Are Given Some Letters...,"binary search, implementation, math",2700,203,0,https://codeforces.com/problemset/problem/1202/F
+1202E,You Are Given Some Strings...,"brute force, string suffix structures, strings",2400,687,0,https://codeforces.com/problemset/problem/1202/E
+1202D,Print a 1337-string...,"combinatorics, constructive algorithms, math, strings",1900,3291,0,https://codeforces.com/problemset/problem/1202/D
+1202C,You Are Given a WASD-string...,"brute force, data structures, dp, greedy, implementation, math, strings",2100,1561,0,https://codeforces.com/problemset/problem/1202/C
+1202B,You Are Given a Decimal String...,"brute force, dp, shortest paths",1700,3276,0,https://codeforces.com/problemset/problem/1202/B
+1202A,You Are Given Two Binary Strings...,"bitmasks, greedy",1100,6163,0,https://codeforces.com/problemset/problem/1202/A
+1201E2,Knightmare (hard),"graphs, interactive, shortest paths",3000,79,0,https://codeforces.com/problemset/problem/1201/E2
+1201E1,Knightmare (easy),"graphs, interactive, shortest paths",2900,71,0,https://codeforces.com/problemset/problem/1201/E1
+1201D,Treasure Hunting,"binary search, dp, greedy, implementation",2100,1509,0,https://codeforces.com/problemset/problem/1201/D
+1201C,Maximum Median,"binary search, greedy, math, sortings",1400,8691,0,https://codeforces.com/problemset/problem/1201/C
+1201B,Zero Array,"greedy, math",1500,9712,0,https://codeforces.com/problemset/problem/1201/B
+1201A,Important Exam,"implementation, strings",900,10655,0,https://codeforces.com/problemset/problem/1201/A
+1200F,Graph Traveler,"brute force, data structures, dfs and similar, dp, graphs, implementation, math, number theory",2300,639,0,https://codeforces.com/problemset/problem/1200/F
+1200E,Compress Words,"brute force, hashing, implementation, string suffix structures, strings",2000,3125,0,https://codeforces.com/problemset/problem/1200/E
+1200D,White Lines,"brute force, data structures, dp, implementation, two pointers",1900,3014,0,https://codeforces.com/problemset/problem/1200/D
+1200C,Round Corridor,"math, number theory",1400,7172,0,https://codeforces.com/problemset/problem/1200/C
+1200B,Block Adventure,"dp, greedy",1200,9732,0,https://codeforces.com/problemset/problem/1200/B
+1200A,Hotelier,"brute force, data structures, implementation",800,13610,0,https://codeforces.com/problemset/problem/1200/A
+1199B,Water Lily,"geometry, math",1000,12317,0,https://codeforces.com/problemset/problem/1199/B
+1199A,City Day,implementation,1000,10120,0,https://codeforces.com/problemset/problem/1199/A
+1198F,GCD Groups 2,"greedy, number theory, probabilities",2900,320,0,https://codeforces.com/problemset/problem/1198/F
+1198E,Rectangle Painting 2,"flows, graph matchings, graphs",2500,570,0,https://codeforces.com/problemset/problem/1198/E
+1198D,Rectangle Painting 1,dp,2300,1684,0,https://codeforces.com/problemset/problem/1198/D
+1198C,Matching vs  Independent Set,"constructive algorithms, graphs, greedy, sortings",2000,2126,0,https://codeforces.com/problemset/problem/1198/C
+1198B,Welfare State,"binary search, brute force, data structures, sortings",1600,6285,0,https://codeforces.com/problemset/problem/1198/B
+1198A,MP3,"sortings, two pointers",1600,6380,0,https://codeforces.com/problemset/problem/1198/A
+1197F,Coloring Game,"dp, games, matrices",2700,131,0,https://codeforces.com/problemset/problem/1197/F
+1197E,Culture Code,"binary search, combinatorics, data structures, dp, shortest paths, sortings",2300,957,0,https://codeforces.com/problemset/problem/1197/E
+1197D,Yet Another Subarray Problem,"dp, greedy, math",1900,3455,0,https://codeforces.com/problemset/problem/1197/D
+1197C,Array Splitting,"greedy, sortings",1400,9087,0,https://codeforces.com/problemset/problem/1197/C
+1197B,Pillars,"greedy, implementation",1000,10092,0,https://codeforces.com/problemset/problem/1197/B
+1197A,DIY Wooden Ladder,"greedy, math, sortings",900,10597,0,https://codeforces.com/problemset/problem/1197/A
+1196F,K-th Path,"brute force, constructive algorithms, shortest paths, sortings",2200,1409,0,https://codeforces.com/problemset/problem/1196/F
+1196E,Connected Component on a Chessboard,"constructive algorithms, implementation",1800,2497,0,https://codeforces.com/problemset/problem/1196/E
+1196D2,RGB Substring (hard version),"data structures, dp, implementation, two pointers",1600,5949,0,https://codeforces.com/problemset/problem/1196/D2
+1196D1,RGB Substring (easy version),implementation,1500,6835,0,https://codeforces.com/problemset/problem/1196/D1
+1196C,Robot Breakout,implementation,1500,6785,0,https://codeforces.com/problemset/problem/1196/C
+1196B,Odd Sum Segments,"constructive algorithms, math",1200,10783,0,https://codeforces.com/problemset/problem/1196/B
+1196A,Three Piles of Candies,"brute force, constructive algorithms, math",800,19107,0,https://codeforces.com/problemset/problem/1196/A
+1195F,Geometers Anonymous Club,"data structures, geometry, math, sortings",2500,402,0,https://codeforces.com/problemset/problem/1195/F
+1195E,OpenStreetMap,"data structures, two pointers",2100,1952,0,https://codeforces.com/problemset/problem/1195/E
+1195D2,Submarine in the Rybinsk Sea (hard edition),"combinatorics, math, number theory",1800,3378,0,https://codeforces.com/problemset/problem/1195/D2
+1195D1,Submarine in the Rybinsk Sea (easy edition),"combinatorics, math, number theory",1500,5944,0,https://codeforces.com/problemset/problem/1195/D1
+1195C,Basketball Exercise,dp,1400,10838,0,https://codeforces.com/problemset/problem/1195/C
+1195B,Sport Mafia,"binary search, brute force, math",1000,11405,0,https://codeforces.com/problemset/problem/1195/B
+1195A,Drinks Choosing,"greedy, math",1000,9353,0,https://codeforces.com/problemset/problem/1195/A
+1194G,Another Meme Problem,dp,2700,103,0,https://codeforces.com/problemset/problem/1194/G
+1194F,Crossword Expert,"combinatorics, dp, number theory, probabilities, two pointers",2400,517,0,https://codeforces.com/problemset/problem/1194/F
+1194E,Count The Rectangles,"bitmasks, brute force, data structures, geometry, sortings",2200,1199,0,https://codeforces.com/problemset/problem/1194/E
+1194D,1-2-K Game,"games, math",1700,4396,0,https://codeforces.com/problemset/problem/1194/D
+1194C,From S To T,"implementation, strings",1300,8563,0,https://codeforces.com/problemset/problem/1194/C
+1194B,Yet Another Crosses Problem,implementation,1300,7783,0,https://codeforces.com/problemset/problem/1194/B
+1194A,Remove a Progression,math,800,12060,0,https://codeforces.com/problemset/problem/1194/A
+1191B,Tokitsukaze and Mahjong,"brute force, implementation",1200,7621,0,https://codeforces.com/problemset/problem/1191/B
+1191A,Tokitsukaze and Enhancement,brute force,800,13415,0,https://codeforces.com/problemset/problem/1191/A
+1190F,Tokitsukaze and Powers,"number theory, probabilities",3400,47,0,https://codeforces.com/problemset/problem/1190/F
+1190E,Tokitsukaze and Explosion,"binary search, greedy",3100,133,0,https://codeforces.com/problemset/problem/1190/E
+1190D,Tokitsukaze and Strange Rectangle,"data structures, divide and conquer, sortings, two pointers",2000,1596,0,https://codeforces.com/problemset/problem/1190/D
+1190C,Tokitsukaze and Duel,"brute force, games, greedy",2300,1270,0,https://codeforces.com/problemset/problem/1190/C
+1190B,"Tokitsukaze, CSL and Stone Game",games,1800,4543,0,https://codeforces.com/problemset/problem/1190/B
+1190A,Tokitsukaze and Discard Items,"implementation, two pointers",1400,7146,0,https://codeforces.com/problemset/problem/1190/A
+1189C,Candies!,"data structures, dp, implementation, math",1400,7258,0,https://codeforces.com/problemset/problem/1189/C
+1189B,Number Circle,"greedy, math, sortings",1100,9066,0,https://codeforces.com/problemset/problem/1189/B
+1189A,Keanu Reeves,strings,800,11364,0,https://codeforces.com/problemset/problem/1189/A
+1188E,Problem from Red Panda,combinatorics,3300,92,0,https://codeforces.com/problemset/problem/1188/E
+1188D,Make Equal,dp,3100,202,0,https://codeforces.com/problemset/problem/1188/D
+1188C,Array Beauty,dp,2500,894,0,https://codeforces.com/problemset/problem/1188/C
+1188B,Count Pairs,"math, matrices, number theory, two pointers",2300,2734,0,https://codeforces.com/problemset/problem/1188/B
+1188A2,Add on a Tree: Revolution,"constructive algorithms, dfs and similar, implementation, trees",2500,795,0,https://codeforces.com/problemset/problem/1188/A2
+1188A1,Add on a Tree,trees,1600,5683,0,https://codeforces.com/problemset/problem/1188/A1
+1187G,Gang Up,"flows, graphs",2500,256,0,https://codeforces.com/problemset/problem/1187/G
+1187F,Expected Square Beauty,"dp, math, probabilities",2500,414,0,https://codeforces.com/problemset/problem/1187/F
+1187E,Tree Painting,"dfs and similar, dp, trees",2100,3091,0,https://codeforces.com/problemset/problem/1187/E
+1187D,Subarray Sorting,"data structures, sortings",2400,1579,0,https://codeforces.com/problemset/problem/1187/D
+1187C,Vasya And Array,"constructive algorithms, greedy, implementation",1800,4341,0,https://codeforces.com/problemset/problem/1187/C
+1187B,Letters Shop,"binary search, implementation, strings",1300,8335,0,https://codeforces.com/problemset/problem/1187/B
+1187A,Stickers and Toys,math,900,11409,0,https://codeforces.com/problemset/problem/1187/A
+1186F,Vus the Cossack and a Graph,"dfs and similar, graphs, greedy, implementation",2400,513,0,https://codeforces.com/problemset/problem/1186/F
+1186E,Vus the Cossack and a Field,"divide and conquer, implementation, math",2500,408,0,https://codeforces.com/problemset/problem/1186/E
+1186D,Vus the Cossack and Numbers,"constructive algorithms, greedy, math",1500,6331,0,https://codeforces.com/problemset/problem/1186/D
+1186C,Vus the Cossack and Strings,"implementation, math",1800,4376,0,https://codeforces.com/problemset/problem/1186/C
+1186A,Vus the Cossack and a Contest,implementation,800,20146,0,https://codeforces.com/problemset/problem/1186/A
+1185G2,Playlist for Polycarp (hard version),"combinatorics, dp",2600,417,0,https://codeforces.com/problemset/problem/1185/G2
+1185G1,Playlist for Polycarp (easy version),"bitmasks, combinatorics, dp",2100,1584,0,https://codeforces.com/problemset/problem/1185/G1
+1185F,Two Pizzas,"bitmasks, brute force",2100,1218,0,https://codeforces.com/problemset/problem/1185/F
+1185E,Polycarp and Snakes,"brute force, implementation",2000,1891,0,https://codeforces.com/problemset/problem/1185/E
+1185D,Extra Element,"implementation, math",1700,4671,0,https://codeforces.com/problemset/problem/1185/D
+1185C2,Exam in BerSU (hard version),"brute force, data structures, greedy, math",1700,5315,0,https://codeforces.com/problemset/problem/1185/C2
+1185C1,Exam in BerSU (easy version),"greedy, sortings",1200,8413,0,https://codeforces.com/problemset/problem/1185/C1
+1185B,Email from Polycarp,"implementation, strings",1200,9185,0,https://codeforces.com/problemset/problem/1185/B
+1185A,Ropewalkers,math,800,11764,0,https://codeforces.com/problemset/problem/1185/A
+1184E3,Daleks' Invasion (hard),"data structures, dsu, graphs, trees",2400,296,0,https://codeforces.com/problemset/problem/1184/E3
+1184E2,Daleks' Invasion (medium),"dfs and similar, graphs, shortest paths, trees",2100,617,0,https://codeforces.com/problemset/problem/1184/E2
+1184E1,Daleks' Invasion (easy),"graphs, trees",1900,1081,0,https://codeforces.com/problemset/problem/1184/E1
+1184D2,Parallel Universes (Hard),"math, matrices",3100,21,0,https://codeforces.com/problemset/problem/1184/D2
+1184D1,Parallel Universes (Easy),implementation,1600,1781,0,https://codeforces.com/problemset/problem/1184/D1
+1184C3,Heidi and the Turing Test (Hard),,3200,24,0,https://codeforces.com/problemset/problem/1184/C3
+1184C2,Heidi and the Turing Test (Medium),data structures,2200,466,0,https://codeforces.com/problemset/problem/1184/C2
+1184C1,Heidi and the Turing Test (Easy),implementation,1600,1620,0,https://codeforces.com/problemset/problem/1184/C1
+1184B3,The Doctor Meets Vader (Hard),"flows, shortest paths",2700,127,0,https://codeforces.com/problemset/problem/1184/B3
+1184B2,The Doctor Meets Vader (Medium),"flows, graph matchings, graphs, shortest paths, sortings",2200,411,0,https://codeforces.com/problemset/problem/1184/B2
+1184B1,The Doctor Meets Vader (Easy),"binary search, sortings",1400,2846,0,https://codeforces.com/problemset/problem/1184/B1
+1184A3,Heidi Learns Hashing (Hard),"fft, math, number theory",3100,49,0,https://codeforces.com/problemset/problem/1184/A3
+1184A2,Heidi Learns Hashing (Medium),"brute force, number theory",2100,737,0,https://codeforces.com/problemset/problem/1184/A2
+1184A1,Heidi Learns Hashing (Easy),"brute force, math, number theory",1200,3777,0,https://codeforces.com/problemset/problem/1184/A1
+1183H,Subsequences (hard version),"dp, strings",1900,1664,0,https://codeforces.com/problemset/problem/1183/H
+1183G,Candy Box (hard version),"greedy, implementation, sortings",2000,1555,0,https://codeforces.com/problemset/problem/1183/G
+1183F,Topforces Strikes Back,"brute force, math, sortings",2100,1162,0,https://codeforces.com/problemset/problem/1183/F
+1183E,Subsequences (easy version),"dp, graphs, implementation, shortest paths",2000,2835,0,https://codeforces.com/problemset/problem/1183/E
+1183D,Candy Box (easy version),"greedy, sortings",1400,8516,0,https://codeforces.com/problemset/problem/1183/D
+1183C,Computer Game,"binary search, math",1400,8507,0,https://codeforces.com/problemset/problem/1183/C
+1183B,Equalize Prices,math,900,12672,0,https://codeforces.com/problemset/problem/1183/B
+1183A,Nearest Interesting Number,implementation,800,16469,0,https://codeforces.com/problemset/problem/1183/A
+1182F,Maximum Sine,"binary search, data structures, number theory",2700,182,0,https://codeforces.com/problemset/problem/1182/F
+1182E,Product Oriented Recurrence,"dp, math, matrices, number theory",2300,1565,0,https://codeforces.com/problemset/problem/1182/E
+1182D,Complete Mirror,"constructive algorithms, dfs and similar, dp, hashing, implementation, trees",2400,552,0,https://codeforces.com/problemset/problem/1182/D
+1182C,Beautiful Lyrics,"data structures, greedy, strings",1700,3599,0,https://codeforces.com/problemset/problem/1182/C
+1182B,Plus from Picture,"dfs and similar, implementation, strings",1300,7754,0,https://codeforces.com/problemset/problem/1182/B
+1182A,Filling Shapes,"dp, math",1000,13490,0,https://codeforces.com/problemset/problem/1182/A
+1181E2,A Story of One Country (Hard),"brute force, greedy, sortings",3000,155,0,https://codeforces.com/problemset/problem/1181/E2
+1181E1,A Story of One Country (Easy),"brute force, divide and conquer, sortings",2500,287,0,https://codeforces.com/problemset/problem/1181/E1
+1181D,Irrigation,"binary search, data structures, implementation, sortings, trees, two pointers",2200,1286,0,https://codeforces.com/problemset/problem/1181/D
+1181C,Flag,"brute force, combinatorics, dp, implementation",1900,2309,0,https://codeforces.com/problemset/problem/1181/C
+1181B,Split a Number,"greedy, implementation, strings",1500,4616,0,https://codeforces.com/problemset/problem/1181/B
+1181A,Chunga-Changa,"greedy, math",1000,9036,0,https://codeforces.com/problemset/problem/1181/A
+1180B,Nick and Array,"greedy, implementation",1500,6470,0,https://codeforces.com/problemset/problem/1180/B
+1180A,Alex and a Rhombus,"dp, implementation, math",800,14780,0,https://codeforces.com/problemset/problem/1180/A
+1179E,Alesya and Discrete Math,"divide and conquer, interactive",3200,68,0,https://codeforces.com/problemset/problem/1179/E
+1179D,Fedor Runs for President,"data structures, dp, trees",2700,389,0,https://codeforces.com/problemset/problem/1179/D
+1179C,Serge and Dining Room,"binary search, data structures, graph matchings, greedy, implementation, math, trees",2200,1137,0,https://codeforces.com/problemset/problem/1179/C
+1179B,Tolik and His Uncle,constructive algorithms,1800,3176,0,https://codeforces.com/problemset/problem/1179/B
+1179A,Valeriy and Deque,"data structures, implementation",1500,6468,0,https://codeforces.com/problemset/problem/1179/A
+1178H,Stock Exchange,"binary search, flows, graphs",3500,49,0,https://codeforces.com/problemset/problem/1178/H
+1178G,The Awesomest Vertex,"data structures, dfs and similar",3000,167,0,https://codeforces.com/problemset/problem/1178/G
+1178F2,Long Colorful Strip,dp,2600,497,0,https://codeforces.com/problemset/problem/1178/F2
+1178F1,Short Colorful Strip,"combinatorics, dfs and similar, dp",2200,1185,0,https://codeforces.com/problemset/problem/1178/F1
+1178E,Archaeology,"brute force, constructive algorithms, greedy, strings",1900,3108,0,https://codeforces.com/problemset/problem/1178/E
+1178D,Prime Graph,"constructive algorithms, greedy, math, number theory",1500,4968,0,https://codeforces.com/problemset/problem/1178/D
+1178C,Tiles,"combinatorics, greedy, math",1300,7250,0,https://codeforces.com/problemset/problem/1178/C
+1178B,WOW Factor,"dp, strings",1300,8128,0,https://codeforces.com/problemset/problem/1178/B
+1178A,Prime Minister,greedy,800,8231,0,https://codeforces.com/problemset/problem/1178/A
+1177B,Digits Sequence (Hard Edition),"binary search, divide and conquer, implementation",1800,1374,0,https://codeforces.com/problemset/problem/1177/B
+1177A,Digits Sequence (Easy Edition),implementation,1000,2628,0,https://codeforces.com/problemset/problem/1177/A
+1176F,Destroy it!,"dp, implementation, sortings",2100,962,0,https://codeforces.com/problemset/problem/1176/F
+1176E,Cover it!,"dfs and similar, dsu, graphs, shortest paths, trees",1700,5006,0,https://codeforces.com/problemset/problem/1176/E
+1176D,Recover it!,"dfs and similar, graphs, greedy, number theory, sortings",1800,3204,0,https://codeforces.com/problemset/problem/1176/D
+1176C,Lose it!,"dp, greedy, implementation",1300,8925,0,https://codeforces.com/problemset/problem/1176/C
+1176B,Merge it!,math,1100,11212,0,https://codeforces.com/problemset/problem/1176/B
+1176A,Divide it!,"brute force, greedy, implementation",800,14111,0,https://codeforces.com/problemset/problem/1176/A
+1175G,Yet Another Partiton Problem,"data structures, divide and conquer, dp, geometry, two pointers",3000,101,0,https://codeforces.com/problemset/problem/1175/G
+1175F,The Number of Subpermutations,"brute force, data structures, divide and conquer, hashing, math",2500,607,0,https://codeforces.com/problemset/problem/1175/F
+1175E,Minimal Segment Cover,"data structures, dfs and similar, divide and conquer, dp, greedy, implementation, trees",2200,1502,0,https://codeforces.com/problemset/problem/1175/E
+1175D,Array Splitting,"greedy, sortings",1900,3519,0,https://codeforces.com/problemset/problem/1175/D
+1175C,Electrification,"binary search, brute force, greedy",1600,4618,0,https://codeforces.com/problemset/problem/1175/C
+1175B,Catch Overflow!,"data structures, expression parsing, implementation",1600,6293,0,https://codeforces.com/problemset/problem/1175/B
+1175A,From Hero to Zero,"implementation, math",900,11619,0,https://codeforces.com/problemset/problem/1175/A
+1174F,Ehab and the Big Finale,"constructive algorithms, divide and conquer, graphs, implementation, interactive, trees",2400,786,0,https://codeforces.com/problemset/problem/1174/F
+1174E,Ehab and the Expected GCD Problem,"combinatorics, dp, math, number theory",2500,761,0,https://codeforces.com/problemset/problem/1174/E
+1174D,Ehab and the Expected XOR Problem,"bitmasks, constructive algorithms",1900,3319,0,https://codeforces.com/problemset/problem/1174/D
+1174C,Ehab and a Special Coloring Problem,"constructive algorithms, number theory",1300,8369,0,https://codeforces.com/problemset/problem/1174/C
+1174B,Ehab Is an Odd Person,sortings,1200,9272,0,https://codeforces.com/problemset/problem/1174/B
+1174A,Ehab Fails to Be Thanos,"constructive algorithms, greedy, sortings",1000,11217,0,https://codeforces.com/problemset/problem/1174/A
+1173B,Nauuo and Chess,"constructive algorithms, greedy",1100,6840,0,https://codeforces.com/problemset/problem/1173/B
+1173A,Nauuo and Votes,greedy,800,12155,0,https://codeforces.com/problemset/problem/1173/A
+1172F,Nauuo and Bug,data structures,3300,89,0,https://codeforces.com/problemset/problem/1172/F
+1172E,Nauuo and ODT,data structures,3300,116,0,https://codeforces.com/problemset/problem/1172/E
+1172D,Nauuo and Portals,constructive algorithms,2900,273,0,https://codeforces.com/problemset/problem/1172/D
+1172C2,Nauuo and Pictures (hard version),"dp, probabilities",2600,420,0,https://codeforces.com/problemset/problem/1172/C2
+1172C1,Nauuo and Pictures (easy version),"dp, probabilities",2300,639,0,https://codeforces.com/problemset/problem/1172/C1
+1172B,Nauuo and Circle,"combinatorics, dfs and similar, dp, trees",1900,2698,0,https://codeforces.com/problemset/problem/1172/B
+1172A,Nauuo and Cards,"greedy, implementation",1800,3655,0,https://codeforces.com/problemset/problem/1172/A
+1169B,Pairs,"graphs, implementation",1500,6179,0,https://codeforces.com/problemset/problem/1169/B
+1169A,Circle Metro,"implementation, math",900,8760,0,https://codeforces.com/problemset/problem/1169/A
+1168E,Xor Permutations,"constructive algorithms, math",3100,83,0,https://codeforces.com/problemset/problem/1168/E
+1168D,Anagram Paths,"dp, implementation, trees",3000,159,0,https://codeforces.com/problemset/problem/1168/D
+1168C,And Reachability,"bitmasks, dp",2200,1471,0,https://codeforces.com/problemset/problem/1168/C
+1168B,Good Triple,"brute force, two pointers",1900,2309,0,https://codeforces.com/problemset/problem/1168/B
+1168A,Increasing by Modulo,"binary search, greedy",1700,4100,0,https://codeforces.com/problemset/problem/1168/A
+1167G,Low Budget Inception,"brute force, geometry",3100,103,0,https://codeforces.com/problemset/problem/1167/G
+1167F,Scalar Queries,"combinatorics, data structures, math, sortings",2300,908,0,https://codeforces.com/problemset/problem/1167/F
+1167E,Range Deleting,"binary search, combinatorics, data structures, two pointers",2100,1561,0,https://codeforces.com/problemset/problem/1167/E
+1167D,Bicolored RBS,"constructive algorithms, greedy",1500,5029,0,https://codeforces.com/problemset/problem/1167/D
+1167C,News Distribution,"dfs and similar, dsu, graphs",1400,8279,0,https://codeforces.com/problemset/problem/1167/C
+1167B,Lost Numbers,"brute force, divide and conquer, interactive, math",1400,6128,0,https://codeforces.com/problemset/problem/1167/B
+1167A,Telephone Number,"brute force, greedy, strings",800,13812,0,https://codeforces.com/problemset/problem/1167/A
+1166F,Vicky's Delivery Service,"data structures, dsu, graphs, hashing",2400,383,0,https://codeforces.com/problemset/problem/1166/F
+1166E,The LCMs Must be Large,"bitmasks, brute force, constructive algorithms, math, number theory",2100,1887,0,https://codeforces.com/problemset/problem/1166/E
+1166D,Cute Sequences,"binary search, brute force, greedy, math",2200,1510,0,https://codeforces.com/problemset/problem/1166/D
+1166C,A Tale of Two Lands,"binary search, sortings, two pointers",1500,6094,0,https://codeforces.com/problemset/problem/1166/C
+1166B,All the Vowels Please,"constructive algorithms, math, number theory",1100,8522,0,https://codeforces.com/problemset/problem/1166/B
+1166A,Silent Classroom,"combinatorics, greedy",900,10422,0,https://codeforces.com/problemset/problem/1166/A
+1165F2,Microtransactions (hard version),"binary search, greedy, implementation",2000,1208,0,https://codeforces.com/problemset/problem/1165/F2
+1165F1,Microtransactions (easy version),"binary search, greedy",2000,1106,0,https://codeforces.com/problemset/problem/1165/F1
+1165E,Two Arrays and Sum of Functions,"greedy, math, sortings",1600,4542,0,https://codeforces.com/problemset/problem/1165/E
+1165D,Almost All Divisors,"math, number theory",1600,7483,0,https://codeforces.com/problemset/problem/1165/D
+1165C,Good String,greedy,1300,8120,0,https://codeforces.com/problemset/problem/1165/C
+1165B,Polycarp Training,"data structures, greedy, sortings",1000,11852,0,https://codeforces.com/problemset/problem/1165/B
+1165A,Remainder,"implementation, math",1100,9769,0,https://codeforces.com/problemset/problem/1165/A
+1163F,Indecisive Taxi Fee,"data structures, graphs, shortest paths",3000,153,0,https://codeforces.com/problemset/problem/1163/F
+1163E,Magical Permutation,"bitmasks, brute force, constructive algorithms, data structures, graphs, math",2400,339,0,https://codeforces.com/problemset/problem/1163/E
+1163D,Mysterious Code,"dp, strings",2100,826,0,https://codeforces.com/problemset/problem/1163/D
+1163C2,Power Transmission (Hard Edition),"data structures, geometry, implementation, math",1900,2352,0,https://codeforces.com/problemset/problem/1163/C2
+1163C1,Power Transmission (Easy Edition),"brute force, geometry",1900,2267,0,https://codeforces.com/problemset/problem/1163/C1
+1163B2,Cat Party (Hard Edition),"data structures, implementation",1600,4405,0,https://codeforces.com/problemset/problem/1163/B2
+1163B1,Cat Party (Easy Edition),"data structures, implementation",1500,4778,0,https://codeforces.com/problemset/problem/1163/B1
+1163A,Eating Soup,"greedy, math",900,8946,0,https://codeforces.com/problemset/problem/1163/A
+1162B,Double Matrix,"brute force, greedy",1400,3980,0,https://codeforces.com/problemset/problem/1162/B
+1162A,Zoning Restrictions Again,implementation,800,6283,0,https://codeforces.com/problemset/problem/1162/A
+1159B,Expansion coefficient of the array,"implementation, math",1300,5359,0,https://codeforces.com/problemset/problem/1159/B
+1159A,A pile of stones,"implementation, math",800,8821,0,https://codeforces.com/problemset/problem/1159/A
+1158F,Density of subarrays,"dp, math",3500,93,0,https://codeforces.com/problemset/problem/1158/F
+1158E,Strange device,"binary search, interactive, math, trees",3400,55,0,https://codeforces.com/problemset/problem/1158/E
+1158D,Winding polygonal line,"constructive algorithms, geometry, greedy, math",2600,387,0,https://codeforces.com/problemset/problem/1158/D
+1158C,Permutation recovery,"constructive algorithms, data structures, dfs and similar, graphs, greedy, math, sortings",2100,1108,0,https://codeforces.com/problemset/problem/1158/C
+1158B,The minimal unique substring,"constructive algorithms, math, strings",2200,1525,0,https://codeforces.com/problemset/problem/1158/B
+1158A,The Party and Sweets,"binary search, constructive algorithms, greedy, implementation, math, sortings, two pointers",1500,4541,0,https://codeforces.com/problemset/problem/1158/A
+1157G,Inverse of Rows and Columns,"brute force, constructive algorithms",2200,538,0,https://codeforces.com/problemset/problem/1157/G
+1157F,Maximum Balanced Circle,"constructive algorithms, dp, greedy, two pointers",2000,1328,0,https://codeforces.com/problemset/problem/1157/F
+1157E,Minimum Array,"binary search, data structures, greedy",1700,4822,0,https://codeforces.com/problemset/problem/1157/E
+1157D,N Problems During K Days,"constructive algorithms, greedy, math",1900,2214,0,https://codeforces.com/problemset/problem/1157/D
+1157C2,Increasing Subsequence (hard version),greedy,1700,4931,0,https://codeforces.com/problemset/problem/1157/C2
+1157C1,Increasing Subsequence (easy version),greedy,1300,8001,0,https://codeforces.com/problemset/problem/1157/C1
+1157B,Long Number,greedy,1300,9195,0,https://codeforces.com/problemset/problem/1157/B
+1157A,Reachable Numbers,implementation,1100,10574,0,https://codeforces.com/problemset/problem/1157/A
+1156G,Optimizer,"graphs, greedy, hashing, implementation",2700,78,0,https://codeforces.com/problemset/problem/1156/G
+1156F,Card Bag,"dp, math, probabilities",2300,645,0,https://codeforces.com/problemset/problem/1156/F
+1156E,Special Segments of Permutation,"data structures, divide and conquer, dsu, two pointers",2200,1439,0,https://codeforces.com/problemset/problem/1156/E
+1156D,0-1-Tree,"dfs and similar, divide and conquer, dp, dsu, trees",2200,1871,0,https://codeforces.com/problemset/problem/1156/D
+1156C,Match Points,"binary search, greedy, sortings, ternary search, two pointers",2000,3593,0,https://codeforces.com/problemset/problem/1156/C
+1156B,Ugly Pairs,"dfs and similar, greedy, implementation, sortings, strings",1800,4083,0,https://codeforces.com/problemset/problem/1156/B
+1156A,Inscribed Figures,geometry,1400,5903,0,https://codeforces.com/problemset/problem/1156/A
+1155F,Delivery Oligopoly,"brute force, dp, graphs",2800,235,0,https://codeforces.com/problemset/problem/1155/F
+1155E,Guess the Root,"brute force, interactive, math",2200,942,0,https://codeforces.com/problemset/problem/1155/E
+1155D,Beautiful Array,"brute force, data structures, divide and conquer, dp, greedy",1900,3913,0,https://codeforces.com/problemset/problem/1155/D
+1155C,Alarm Clocks Everywhere,"math, number theory",1300,6611,0,https://codeforces.com/problemset/problem/1155/C
+1155B,Game with Telephone Numbers,"games, greedy, implementation",1200,7983,0,https://codeforces.com/problemset/problem/1155/B
+1155A,Reverse a Substring,"implementation, sortings, strings",1000,8720,0,https://codeforces.com/problemset/problem/1155/A
+1154G,Minimum Possible LCM,"brute force, greedy, math, number theory",2200,1598,0,https://codeforces.com/problemset/problem/1154/G
+1154F,Shovels Shop,"dp, greedy, sortings",2100,1685,0,https://codeforces.com/problemset/problem/1154/F
+1154E,Two Teams,"data structures, implementation, sortings",1800,3529,0,https://codeforces.com/problemset/problem/1154/E
+1154D,Walking Robot,greedy,1500,6927,0,https://codeforces.com/problemset/problem/1154/D
+1154C,Gourmet Cat,"implementation, math",1400,7041,0,https://codeforces.com/problemset/problem/1154/C
+1154B,Make Them Equal,math,1200,11096,0,https://codeforces.com/problemset/problem/1154/B
+1154A,Restoring Three Numbers,math,800,26811,0,https://codeforces.com/problemset/problem/1154/A
+1153F,Serval and Bonus Problem,"combinatorics, dp, math, probabilities",2600,404,0,https://codeforces.com/problemset/problem/1153/F
+1153E,Serval and Snake,"binary search, brute force, interactive",2200,1101,0,https://codeforces.com/problemset/problem/1153/E
+1153D,Serval and Rooted Tree,"binary search, dfs and similar, dp, greedy, trees",1900,3022,0,https://codeforces.com/problemset/problem/1153/D
+1153C,Serval and Parenthesis Sequence,"greedy, strings",1700,5307,0,https://codeforces.com/problemset/problem/1153/C
+1153B,Serval and Toy Bricks,"constructive algorithms, greedy",1200,7080,0,https://codeforces.com/problemset/problem/1153/B
+1153A,Serval and Bus,"brute force, math",1000,8764,0,https://codeforces.com/problemset/problem/1153/A
+1152F2,Neko Rules the Catniverse (Large Version),"bitmasks, dp, matrices",3000,169,0,https://codeforces.com/problemset/problem/1152/F2
+1152F1,Neko Rules the Catniverse (Small Version),"bitmasks, dp, matrices",2800,181,0,https://codeforces.com/problemset/problem/1152/F1
+1152E,Neko and Flashback,"constructive algorithms, dfs and similar, graphs",2400,624,0,https://codeforces.com/problemset/problem/1152/E
+1152D,Neko and Aki's Prank,"dp, greedy, trees",2100,1597,0,https://codeforces.com/problemset/problem/1152/D
+1152C,Neko does Maths,"brute force, math, number theory",1800,4200,0,https://codeforces.com/problemset/problem/1152/C
+1152B,Neko Performs Cat Furrier Transform,"bitmasks, constructive algorithms, dfs and similar, math",1300,6349,0,https://codeforces.com/problemset/problem/1152/B
+1152A,Neko Finds Grapes,"greedy, implementation, math",800,10850,0,https://codeforces.com/problemset/problem/1152/A
+1151F,Sonya and Informatics,"combinatorics, dp, matrices, probabilities",2300,595,0,https://codeforces.com/problemset/problem/1151/F
+1151E,Number of Components,"combinatorics, data structures, dp, math",2100,1892,0,https://codeforces.com/problemset/problem/1151/E
+1151D,Stas and the Queue at the Buffet,"greedy, math, sortings",1600,5636,0,https://codeforces.com/problemset/problem/1151/D
+1151C,Problem for Nazar,"constructive algorithms, math",1800,3620,0,https://codeforces.com/problemset/problem/1151/C
+1151B,Dima and a Bad XOR,"bitmasks, brute force, constructive algorithms, dp",1600,6128,0,https://codeforces.com/problemset/problem/1151/B
+1151A,Maxim and Biology,"brute force, strings",1000,8330,0,https://codeforces.com/problemset/problem/1151/A
+1150B,Tiling Challenge,"greedy, implementation",900,7902,0,https://codeforces.com/problemset/problem/1150/B
+1150A,Stock Arbitraging,"greedy, implementation",800,9075,0,https://codeforces.com/problemset/problem/1150/A
+1149E,Election Promises,"games, graphs",3200,146,0,https://codeforces.com/problemset/problem/1149/E
+1149D,Abandoning Roads,"brute force, dp, graphs, greedy",3000,265,0,https://codeforces.com/problemset/problem/1149/D
+1149C,Tree Generator™,"data structures, implementation, trees",2700,519,0,https://codeforces.com/problemset/problem/1149/C
+1149B,Three Religions,"dp, implementation, strings",2200,1411,0,https://codeforces.com/problemset/problem/1149/B
+1149A,Prefix Sum Primes,"constructive algorithms, greedy, math, number theory",1200,9361,0,https://codeforces.com/problemset/problem/1149/A
+1148H,Holy Diver,data structures,3500,61,0,https://codeforces.com/problemset/problem/1148/H
+1148G,Gold Experience,"constructive algorithms, graphs, math, number theory, probabilities",3300,101,0,https://codeforces.com/problemset/problem/1148/G
+1148F,Foo Fighters,"bitmasks, constructive algorithms",2700,536,0,https://codeforces.com/problemset/problem/1148/F
+1148E,Earth Wind and Fire,"constructive algorithms, greedy, math, sortings, two pointers",2300,1234,0,https://codeforces.com/problemset/problem/1148/E
+1148D,Dirty Deeds Done Dirt Cheap,"greedy, sortings",1800,3481,0,https://codeforces.com/problemset/problem/1148/D
+1148C,Crazy Diamond,"constructive algorithms, sortings",1700,3728,0,https://codeforces.com/problemset/problem/1148/C
+1148B,Born This Way,"binary search, brute force, two pointers",1600,5197,0,https://codeforces.com/problemset/problem/1148/B
+1148A,Another One Bites The Dust,greedy,800,11130,0,https://codeforces.com/problemset/problem/1148/A
+1147F,Zigzag Game,"games, interactive",3500,73,0,https://codeforces.com/problemset/problem/1147/F
+1147E,Rainbow Coins,interactive,3000,196,0,https://codeforces.com/problemset/problem/1147/E
+1147D,Palindrome XOR,"dfs and similar, graphs",2400,525,0,https://codeforces.com/problemset/problem/1147/D
+1147C,Thanos Nim,games,2000,1778,0,https://codeforces.com/problemset/problem/1147/C
+1147B,Chladni Figure,"brute force, strings",1900,1958,0,https://codeforces.com/problemset/problem/1147/B
+1147A,Hide and Seek,graphs,1500,3658,0,https://codeforces.com/problemset/problem/1147/A
+1146H,Satanic Panic,"dp, geometry",2900,204,0,https://codeforces.com/problemset/problem/1146/H
+1146G,Zoning Restrictions,"dp, flows, graphs",2700,396,0,https://codeforces.com/problemset/problem/1146/G
+1146F,Leaf Partition,"dp, trees",2500,527,0,https://codeforces.com/problemset/problem/1146/F
+1146E,Hot is Cold,"bitmasks, data structures, divide and conquer, implementation",2400,539,0,https://codeforces.com/problemset/problem/1146/E
+1146D,Frog Jumping,"dfs and similar, math, number theory",2100,837,0,https://codeforces.com/problemset/problem/1146/D
+1146C,Tree Diameter,"bitmasks, graphs, interactive",1700,2475,0,https://codeforces.com/problemset/problem/1146/C
+1146B,"Hate ""A""","implementation, strings",1100,4929,0,https://codeforces.com/problemset/problem/1146/B
+1146A,"Love ""A""","implementation, strings",800,13290,0,https://codeforces.com/problemset/problem/1146/A
+1144G,Two Merged Sequences,"dp, greedy",2400,919,0,https://codeforces.com/problemset/problem/1144/G
+1144F,Graph Without Long Directed Paths,"dfs and similar, graphs",1700,4974,0,https://codeforces.com/problemset/problem/1144/F
+1144E,Median String,"bitmasks, math, number theory, strings",1900,2823,0,https://codeforces.com/problemset/problem/1144/E
+1144D,Equalize Them All,"constructive algorithms, greedy",1400,6661,0,https://codeforces.com/problemset/problem/1144/D
+1144C,Two Shuffled Sequences,"constructive algorithms, sortings",1000,9725,0,https://codeforces.com/problemset/problem/1144/C
+1144B,Parity Alternated Deletions,"greedy, implementation, sortings",900,11196,0,https://codeforces.com/problemset/problem/1144/B
+1144A,Diverse Strings,"implementation, strings",800,13245,0,https://codeforces.com/problemset/problem/1144/A
+1143C,Queen,"dfs and similar, trees",1400,6087,0,https://codeforces.com/problemset/problem/1143/C
+1143B,Nirvana,"brute force, math, number theory",1200,6853,0,https://codeforces.com/problemset/problem/1143/B
+1143A,The Doors,implementation,800,10655,0,https://codeforces.com/problemset/problem/1143/A
+1142E,Pink Floyd,"graphs, interactive",3200,127,0,https://codeforces.com/problemset/problem/1142/E
+1142D,Foreigner,dp,2800,220,0,https://codeforces.com/problemset/problem/1142/D
+1142C,U2,geometry,2400,721,0,https://codeforces.com/problemset/problem/1142/C
+1142B,Lynyrd Skynyrd,"data structures, dfs and similar, dp, math, trees",2000,1492,0,https://codeforces.com/problemset/problem/1142/B
+1142A,The Beatles,"brute force, math",1700,2625,0,https://codeforces.com/problemset/problem/1142/A
+1141G,Privatization of Roads in Treeland,"binary search, constructive algorithms, dfs and similar, graphs, greedy, trees",1900,1326,0,https://codeforces.com/problemset/problem/1141/G
+1141F2,Same Sum Blocks (Hard),"data structures, greedy",1900,2625,0,https://codeforces.com/problemset/problem/1141/F2
+1141F1,Same Sum Blocks (Easy),greedy,1900,2586,0,https://codeforces.com/problemset/problem/1141/F1
+1141E,Superhero Battle,math,1700,4476,0,https://codeforces.com/problemset/problem/1141/E
+1141D,Colored Boots,"greedy, implementation",1500,5890,0,https://codeforces.com/problemset/problem/1141/D
+1141C,Polycarp Restores Permutation,math,1500,7854,0,https://codeforces.com/problemset/problem/1141/C
+1141B,Maximal Continuous Rest,implementation,900,13914,0,https://codeforces.com/problemset/problem/1141/B
+1141A,Game 23,"implementation, math",1000,15240,0,https://codeforces.com/problemset/problem/1141/A
+1140G,Double Tree,"data structures, divide and conquer, shortest paths, trees",2700,169,0,https://codeforces.com/problemset/problem/1140/G
+1140F,Extending Set of Points,"data structures, divide and conquer, dsu",2600,388,0,https://codeforces.com/problemset/problem/1140/F
+1140E,Palindrome-less Arrays,"combinatorics, divide and conquer, dp",2200,1363,0,https://codeforces.com/problemset/problem/1140/E
+1140D,Minimum Triangulation,"dp, greedy, math",1200,8999,0,https://codeforces.com/problemset/problem/1140/D
+1140C,Playlist,"brute force, data structures, sortings",1600,5849,0,https://codeforces.com/problemset/problem/1140/C
+1140B,Good String,"implementation, strings",1200,8210,0,https://codeforces.com/problemset/problem/1140/B
+1140A,Detective Book,implementation,1000,9642,0,https://codeforces.com/problemset/problem/1140/A
+1139F,Dish Shopping,"data structures, divide and conquer",2500,200,0,https://codeforces.com/problemset/problem/1139/F
+1139E,Maximize Mex,"flows, graph matchings, graphs",2400,853,0,https://codeforces.com/problemset/problem/1139/E
+1139D,Steps to One,"dp, math, number theory, probabilities",2300,1032,0,https://codeforces.com/problemset/problem/1139/D
+1139C,Edgy Trees,"dfs and similar, dsu, graphs, math, trees",1500,7087,0,https://codeforces.com/problemset/problem/1139/C
+1139B,Chocolates,"greedy, implementation",1000,9716,0,https://codeforces.com/problemset/problem/1139/B
+1139A,Even Substrings,"implementation, strings",800,12804,0,https://codeforces.com/problemset/problem/1139/A
+1138B,Circus,"brute force, greedy, math, strings",1800,2726,0,https://codeforces.com/problemset/problem/1138/B
+1138A,Sushi for Two,"binary search, greedy, implementation",900,9252,0,https://codeforces.com/problemset/problem/1138/A
+1137F,Matches Are Not a Child's Play,"data structures, trees",3400,197,0,https://codeforces.com/problemset/problem/1137/F
+1137E,Train Car Selection,"data structures, greedy",2700,293,0,https://codeforces.com/problemset/problem/1137/E
+1137D,Cooperative Game,"constructive algorithms, interactive, number theory",2400,676,0,https://codeforces.com/problemset/problem/1137/D
+1137C,Museums Tour,"dp, graphs, implementation",2500,654,0,https://codeforces.com/problemset/problem/1137/C
+1137B,Camp Schedule,"greedy, hashing, strings",1600,3328,0,https://codeforces.com/problemset/problem/1137/B
+1137A,Skyscrapers,"implementation, sortings",1600,3319,0,https://codeforces.com/problemset/problem/1137/A
+1136E,Nastya Hasn't Written a Legend,"binary search, data structures",2200,773,0,https://codeforces.com/problemset/problem/1136/E
+1136D,Nastya Is Buying Lunch,greedy,1800,2824,0,https://codeforces.com/problemset/problem/1136/D
+1136C,Nastya Is Transposing Matrices,"constructive algorithms, sortings",1500,5869,0,https://codeforces.com/problemset/problem/1136/C
+1136B,Nastya Is Playing Computer Games,"constructive algorithms, math",1000,8916,0,https://codeforces.com/problemset/problem/1136/B
+1136A,Nastya Is Reading a Book,implementation,800,12821,0,https://codeforces.com/problemset/problem/1136/A
+1133F2,Spanning Tree with One Fixed Degree,"constructive algorithms, dfs and similar, dsu, graphs, greedy",1900,1651,0,https://codeforces.com/problemset/problem/1133/F2
+1133F1,Spanning Tree with Maximum Degree,graphs,1600,4322,0,https://codeforces.com/problemset/problem/1133/F1
+1133E,K Balanced Teams,"dp, sortings, two pointers",1800,2680,0,https://codeforces.com/problemset/problem/1133/E
+1133D,Zero Quantity Maximization,"hashing, math, number theory",1500,6360,0,https://codeforces.com/problemset/problem/1133/D
+1133C,Balanced Team,"sortings, two pointers",1200,9514,0,https://codeforces.com/problemset/problem/1133/C
+1133B,Preparation for International Women's Day,"math, number theory",1200,7966,0,https://codeforces.com/problemset/problem/1133/B
+1133A,Middle of the Contest,implementation,1000,10634,0,https://codeforces.com/problemset/problem/1133/A
+1132G,Greedy Subsequences,"data structures, dp, trees",2400,467,0,https://codeforces.com/problemset/problem/1132/G
+1132F,Clear the String,dp,2000,3380,0,https://codeforces.com/problemset/problem/1132/F
+1132E,Knapsack,"dfs and similar, dp, greedy",2300,774,0,https://codeforces.com/problemset/problem/1132/E
+1132D,Stressful Training,"binary search, greedy",2300,1169,0,https://codeforces.com/problemset/problem/1132/D
+1132C,Painting the Fence,brute force,1700,3833,0,https://codeforces.com/problemset/problem/1132/C
+1132B,Discounts,"greedy, sortings",900,8587,0,https://codeforces.com/problemset/problem/1132/B
+1132A,Regular Bracket Sequence,"greedy, implementation",1100,7339,0,https://codeforces.com/problemset/problem/1132/A
+1131G,Most Dangerous Shark,"data structures, dp, two pointers",2700,234,0,https://codeforces.com/problemset/problem/1131/G
+1131F,Asya And Kittens,"constructive algorithms, dsu",1700,4044,0,https://codeforces.com/problemset/problem/1131/F
+1131E,String Multiplication,"dp, greedy, strings",2300,877,0,https://codeforces.com/problemset/problem/1131/E
+1131D,Gourmet choice,"dfs and similar, dp, dsu, graphs, greedy",2000,2202,0,https://codeforces.com/problemset/problem/1131/D
+1131C,Birthday,"binary search, greedy, sortings",1200,9194,0,https://codeforces.com/problemset/problem/1131/C
+1131B,Draw!,"greedy, implementation",1400,7008,0,https://codeforces.com/problemset/problem/1131/B
+1131A,Sea Battle,math,800,9996,0,https://codeforces.com/problemset/problem/1131/A
+1130C,Connect,"brute force, dfs and similar, dsu",1400,5634,0,https://codeforces.com/problemset/problem/1130/C
+1130B,Two Cakes,greedy,1200,6209,0,https://codeforces.com/problemset/problem/1130/B
+1130A,Be Positive,implementation,800,8854,0,https://codeforces.com/problemset/problem/1130/A
+1129E,Legendary Tree,"binary search, interactive, trees",3100,183,0,https://codeforces.com/problemset/problem/1129/E
+1129D,Isolation,"data structures, dp",2900,370,0,https://codeforces.com/problemset/problem/1129/D
+1129C,Morse Code,"binary search, data structures, dp, hashing, sortings, string suffix structures, strings",2400,592,0,https://codeforces.com/problemset/problem/1129/C
+1129B,Wrong Answer,constructive algorithms,2000,1582,0,https://codeforces.com/problemset/problem/1129/B
+1129A2,Toy Train,"brute force, greedy",1800,3122,0,https://codeforces.com/problemset/problem/1129/A2
+1129A1,Toy Train (Simplified),"brute force, greedy",1700,3114,0,https://codeforces.com/problemset/problem/1129/A1
+1121C,System Testing,implementation,1600,1523,0,https://codeforces.com/problemset/problem/1121/C
+1121B,Mike and Children,"brute force, implementation",1200,5278,0,https://codeforces.com/problemset/problem/1121/B
+1121A,Technogoblet of Fire,"implementation, sortings",1100,5676,0,https://codeforces.com/problemset/problem/1121/A
+1120F,Secret Letters,"data structures, dp, greedy",3100,89,0,https://codeforces.com/problemset/problem/1120/F
+1120E,The very same Munchhausen,brute force,2600,48,0,https://codeforces.com/problemset/problem/1120/E
+1120D,Power Tree,"dfs and similar, dp, dsu, graphs, greedy, trees",2500,453,0,https://codeforces.com/problemset/problem/1120/D
+1120C,Compress String,"dp, strings",2100,1323,0,https://codeforces.com/problemset/problem/1120/C
+1120B,Once in a casino,"constructive algorithms, greedy, implementation, math",2700,253,0,https://codeforces.com/problemset/problem/1120/B
+1120A,Diana and Liana,"greedy, implementation, two pointers",1900,1199,0,https://codeforces.com/problemset/problem/1120/A
+1119H,Triple,"fft, math",3200,173,0,https://codeforces.com/problemset/problem/1119/H
+1119G,Get Ready for the Battle,"constructive algorithms, implementation",3100,171,0,https://codeforces.com/problemset/problem/1119/G
+1119F,Niyaz and Small Degrees,"data structures, dp, trees",3400,183,0,https://codeforces.com/problemset/problem/1119/F
+1119E,Pavel and Triangles,"brute force, dp, fft, greedy, ternary search",1900,3298,0,https://codeforces.com/problemset/problem/1119/E
+1119D,Frets On Fire,"binary search, sortings",1800,3568,0,https://codeforces.com/problemset/problem/1119/D
+1119C,Ramesses and Corner Inversion,"constructive algorithms, greedy, implementation, math",1500,5291,0,https://codeforces.com/problemset/problem/1119/C
+1119B,Alyona and a Narrow Fridge,"binary search, flows, greedy, sortings",1300,6745,0,https://codeforces.com/problemset/problem/1119/B
+1119A,Ilya and a Colorful Walk,"greedy, implementation",1100,8132,0,https://codeforces.com/problemset/problem/1119/A
+1118F2,Tree Cutting (Hard Version),"combinatorics, dfs and similar, dp, trees",2700,242,0,https://codeforces.com/problemset/problem/1118/F2
+1118F1,Tree Cutting (Easy Version),"dfs and similar, trees",1800,3212,0,https://codeforces.com/problemset/problem/1118/F1
+1118E,Yet Another Ball Problem,"constructive algorithms, implementation",1700,2605,0,https://codeforces.com/problemset/problem/1118/E
+1118D2,Coffee and Coursework (Hard Version),"binary search, greedy",1700,3675,0,https://codeforces.com/problemset/problem/1118/D2
+1118D1,Coffee and Coursework (Easy version),"brute force, greedy",1700,3555,0,https://codeforces.com/problemset/problem/1118/D1
+1118C,Palindromic Matrix,"constructive algorithms, implementation",1700,3939,0,https://codeforces.com/problemset/problem/1118/C
+1118B,Tanya and Candies,implementation,1200,7886,0,https://codeforces.com/problemset/problem/1118/B
+1118A,Water Buying,math,800,13835,0,https://codeforces.com/problemset/problem/1118/A
+1117G,Recursive Queries,data structures,2500,312,0,https://codeforces.com/problemset/problem/1117/G
+1117F,Crisp String,"bitmasks, dp",2500,296,0,https://codeforces.com/problemset/problem/1117/F
+1117E,Decypher the String,"bitmasks, chinese remainder theorem, constructive algorithms, interactive, math",2200,1022,0,https://codeforces.com/problemset/problem/1117/E
+1117D,Magic Gems,"dp, math, matrices",2100,2347,0,https://codeforces.com/problemset/problem/1117/D
+1117C,Magic Ship,binary search,1900,3286,0,https://codeforces.com/problemset/problem/1117/C
+1117B,Emotes,"greedy, math, sortings",1000,8655,0,https://codeforces.com/problemset/problem/1117/B
+1117A,Best Subsegment,"implementation, math",1100,8458,0,https://codeforces.com/problemset/problem/1117/A
+1115U3,Block unitary,*special problem,1700,185,0,https://codeforces.com/problemset/problem/1115/U3
+1115U2,Chessboard unitary,*special problem,1600,213,0,https://codeforces.com/problemset/problem/1115/U2
+1115U1,Anti-diagonal unitary,*special problem,1500,231,0,https://codeforces.com/problemset/problem/1115/U1
+1115G3,Palindrome checker oracle,*special problem,1600,211,0,https://codeforces.com/problemset/problem/1115/G3
+1115G2,OR oracle,*special problem,1600,289,0,https://codeforces.com/problemset/problem/1115/G2
+1115G1,AND oracle,*special problem,1100,342,0,https://codeforces.com/problemset/problem/1115/G1
+1114F,"Please, another Queries on Array?","bitmasks, data structures, divide and conquer, math, number theory",2400,973,0,https://codeforces.com/problemset/problem/1114/F
+1114E,Arithmetic Progression,"binary search, interactive, number theory, probabilities",2200,1868,0,https://codeforces.com/problemset/problem/1114/E
+1114D,Flood Fill,dp,1900,3776,0,https://codeforces.com/problemset/problem/1114/D
+1114C,Trailing Loves (or L'oeufs?),"brute force, implementation, math, number theory",1700,5557,0,https://codeforces.com/problemset/problem/1114/C
+1114B,Yet Another Array Partitioning Task,"constructive algorithms, greedy, sortings",1500,6858,0,https://codeforces.com/problemset/problem/1114/B
+1114A,Got Any Grapes?,"brute force, greedy, implementation",800,14924,0,https://codeforces.com/problemset/problem/1114/A
+1113B,Sasha and Magnetic Machines,"greedy, number theory",1300,5917,0,https://codeforces.com/problemset/problem/1113/B
+1113A,Sasha and His Trip,"dp, greedy, math",900,11467,0,https://codeforces.com/problemset/problem/1113/A
+1111E,Tree,"data structures, dfs and similar, dp, graphs, trees",2500,420,0,https://codeforces.com/problemset/problem/1111/E
+1111D,Destroy the Colony,"combinatorics, dp, math",2600,593,0,https://codeforces.com/problemset/problem/1111/D
+1111C,Creative Snap,"binary search, brute force, divide and conquer, math",1700,4460,0,https://codeforces.com/problemset/problem/1111/C
+1111B,Average Superhero Gang Power,"brute force, implementation, math",1700,4787,0,https://codeforces.com/problemset/problem/1111/B
+1111A,Superhero Transformation,"implementation, strings",1000,11563,0,https://codeforces.com/problemset/problem/1111/A
+1110H,Modest Substrings,"dp, strings",3500,120,0,https://codeforces.com/problemset/problem/1110/H
+1110G,Tree-Tac-Toe,"constructive algorithms, games, trees",3100,251,0,https://codeforces.com/problemset/problem/1110/G
+1110F,Nearest Leaf,"data structures, trees",2600,1052,0,https://codeforces.com/problemset/problem/1110/F
+1110E,Magic Stones,"constructive algorithms, math, sortings",2200,2573,0,https://codeforces.com/problemset/problem/1110/E
+1110D,Jongmah,dp,2200,2218,0,https://codeforces.com/problemset/problem/1110/D
+1110C,Meaningless Operations,"constructive algorithms, math, number theory",1500,6327,0,https://codeforces.com/problemset/problem/1110/C
+1110B,Tape,"greedy, sortings",1400,7697,0,https://codeforces.com/problemset/problem/1110/B
+1110A,Parity,math,900,11006,0,https://codeforces.com/problemset/problem/1110/A
+1109F,Sasha and Algorithm of Silence's Sounds,"data structures, trees",3200,123,0,https://codeforces.com/problemset/problem/1109/F
+1109E,Sasha and a Very Easy Test,"data structures, number theory",2700,269,0,https://codeforces.com/problemset/problem/1109/E
+1109D,Sasha and Interesting Fact from Graph Theory,"brute force, combinatorics, dp, math, trees",2400,790,0,https://codeforces.com/problemset/problem/1109/D
+1109C,Sasha and a Patient Friend,"binary search, data structures, implementation",2800,169,0,https://codeforces.com/problemset/problem/1109/C
+1109B,Sasha and One More Name,"constructive algorithms, hashing, strings",1800,3166,0,https://codeforces.com/problemset/problem/1109/B
+1109A,Sasha and a Bit of Relax,"dp, implementation",1600,5665,0,https://codeforces.com/problemset/problem/1109/A
+1108F,MST Unification,"binary search, dsu, graphs, greedy",2100,1421,0,https://codeforces.com/problemset/problem/1108/F
+1108E2,Array and Segments (Hard version),"data structures, implementation",2100,1387,0,https://codeforces.com/problemset/problem/1108/E2
+1108E1,Array and Segments (Easy version),"brute force, greedy, implementation",1800,3063,0,https://codeforces.com/problemset/problem/1108/E1
+1108D,Diverse Garland,"constructive algorithms, dp, greedy",1400,9524,0,https://codeforces.com/problemset/problem/1108/D
+1108C,Nice Garland,"brute force, greedy, math",1300,8358,0,https://codeforces.com/problemset/problem/1108/C
+1108B,Divisors of Two Integers,"brute force, greedy, math, number theory",1100,13747,0,https://codeforces.com/problemset/problem/1108/B
+1108A,Two distinct points,implementation,800,15863,0,https://codeforces.com/problemset/problem/1108/A
+1107G,Vasya and Maximum Profit,"binary search, constructive algorithms, data structures, dp, dsu",2400,619,0,https://codeforces.com/problemset/problem/1107/G
+1107F,Vasya and Endless Credits,"dp, flows, graph matchings, graphs, sortings",2600,404,0,https://codeforces.com/problemset/problem/1107/F
+1107E,Vasya and Binary String,dp,2400,1039,0,https://codeforces.com/problemset/problem/1107/E
+1107D,Compression,"dp, implementation, math, number theory",1800,2916,0,https://codeforces.com/problemset/problem/1107/D
+1107C,Brutality,"greedy, sortings, two pointers",1300,7038,0,https://codeforces.com/problemset/problem/1107/C
+1107B,Digital root,"math, number theory",1000,9296,0,https://codeforces.com/problemset/problem/1107/B
+1107A,Digits Sequence Dividing,"greedy, strings",900,9153,0,https://codeforces.com/problemset/problem/1107/A
+1106F,Lunar New Year and a Recursive Sequence,"math, matrices, number theory",2400,554,0,https://codeforces.com/problemset/problem/1106/F
+1106E,Lunar New Year and Red Envelopes,"data structures, dp",2100,1535,0,https://codeforces.com/problemset/problem/1106/E
+1106D,Lunar New Year and a Wander,"data structures, dfs and similar, graphs, greedy, shortest paths",1500,7992,0,https://codeforces.com/problemset/problem/1106/D
+1106C,Lunar New Year and Number Division,"greedy, implementation, math, sortings",900,10581,0,https://codeforces.com/problemset/problem/1106/C
+1106B,Lunar New Year and Food Ordering,"data structures, implementation",1500,5454,0,https://codeforces.com/problemset/problem/1106/B
+1106A,Lunar New Year and Cross Counting,implementation,800,10729,0,https://codeforces.com/problemset/problem/1106/A
+1105E,Helping Hiasat,"bitmasks, brute force, dp, meet-in-the-middle",2200,1074,0,https://codeforces.com/problemset/problem/1105/E
+1105D,Kilani and the Game,"dfs and similar, graphs, implementation, shortest paths",1900,2881,0,https://codeforces.com/problemset/problem/1105/D
+1105C,Ayoub and Lost Array,"combinatorics, dp, math",1500,6667,0,https://codeforces.com/problemset/problem/1105/C
+1105B,Zuhair and Strings,"brute force, implementation, strings",1100,7680,0,https://codeforces.com/problemset/problem/1105/B
+1105A,Salem and Sticks,"brute force, implementation",1100,8314,0,https://codeforces.com/problemset/problem/1105/A
+1104B,Game with string,"data structures, implementation, math",1200,9473,0,https://codeforces.com/problemset/problem/1104/B
+1104A,Splitting into digits,"constructive algorithms, implementation, math",800,12203,0,https://codeforces.com/problemset/problem/1104/A
+1103E,Radix sum,"fft, math, number theory",3400,107,0,https://codeforces.com/problemset/problem/1103/E
+1103D,Professional layer,"bitmasks, dp",3100,211,0,https://codeforces.com/problemset/problem/1103/D
+1103C,Johnny Solving,"constructive algorithms, dfs and similar, graphs, math",2700,468,0,https://codeforces.com/problemset/problem/1103/C
+1103B,Game with modulo,"binary search, constructive algorithms, interactive",2000,2410,0,https://codeforces.com/problemset/problem/1103/B
+1103A,Grid game,"constructive algorithms, implementation",1400,7079,0,https://codeforces.com/problemset/problem/1103/A
+1102F,Elongated Matrix,"binary search, bitmasks, brute force, dp, graphs",2000,1036,0,https://codeforces.com/problemset/problem/1102/F
+1102E,Monotonic Renumeration,"combinatorics, sortings",1700,3336,0,https://codeforces.com/problemset/problem/1102/E
+1102D,Balanced Ternary String,"greedy, strings",1500,5306,0,https://codeforces.com/problemset/problem/1102/D
+1102C,Doors Breaking and Repairing,games,1200,8720,0,https://codeforces.com/problemset/problem/1102/C
+1102B,Array K-Coloring,"greedy, sortings",1400,6796,0,https://codeforces.com/problemset/problem/1102/B
+1102A,Integer Sequence Dividing,math,800,14059,0,https://codeforces.com/problemset/problem/1102/A
+1101G,(Zero XOR Subset)-less,"math, matrices",2300,788,0,https://codeforces.com/problemset/problem/1101/G
+1101F,Trucks and Cities,"binary search, dp",2400,690,0,https://codeforces.com/problemset/problem/1101/F
+1101E,Polycarp's New Job,implementation,1500,6039,0,https://codeforces.com/problemset/problem/1101/E
+1101D,GCD Counting,"data structures, dfs and similar, dp, number theory, trees",2000,2468,0,https://codeforces.com/problemset/problem/1101/D
+1101C,Division and Union,sortings,1500,5586,0,https://codeforces.com/problemset/problem/1101/C
+1101B,Accordion,"greedy, implementation",1300,7754,0,https://codeforces.com/problemset/problem/1101/B
+1101A,Minimum Integer,math,1000,11468,0,https://codeforces.com/problemset/problem/1101/A
+1100F,Ivan and Burgers,"data structures, divide and conquer, greedy, math",2500,673,0,https://codeforces.com/problemset/problem/1100/F
+1100E,Andrew and Taxi,"binary search, dfs and similar, graphs",2200,1514,0,https://codeforces.com/problemset/problem/1100/E
+1100D,Dasha and Chess,"constructive algorithms, games, interactive",2500,625,0,https://codeforces.com/problemset/problem/1100/D
+1100C,NN and the Optical Illusion,"binary search, geometry, math",1200,7274,0,https://codeforces.com/problemset/problem/1100/C
+1100B,Build a Contest,"data structures, implementation",1300,7872,0,https://codeforces.com/problemset/problem/1100/B
+1100A,Roman and Browser,implementation,1000,8120,0,https://codeforces.com/problemset/problem/1100/A
+1099F,Cookies,"binary search, data structures, dfs and similar, dp, games, trees",2400,581,0,https://codeforces.com/problemset/problem/1099/F
+1099C,Postcard,"constructive algorithms, implementation",1200,6396,0,https://codeforces.com/problemset/problem/1099/C
+1099B,Squares and Segments,"binary search, constructive algorithms, math",1100,8122,0,https://codeforces.com/problemset/problem/1099/B
+1099A,Snowball,implementation,800,9898,0,https://codeforces.com/problemset/problem/1099/A
+1098F,Ж-function,"string suffix structures, strings",3500,57,0,https://codeforces.com/problemset/problem/1098/F
+1098E,Fedya the Potter,"binary search, implementation, math, number theory",3400,83,0,https://codeforces.com/problemset/problem/1098/E
+1098D,Eels,data structures,2800,342,0,https://codeforces.com/problemset/problem/1098/D
+1098C,Construct a tree,"binary search, constructive algorithms, dfs and similar, graphs, greedy, trees",2400,569,0,https://codeforces.com/problemset/problem/1098/C
+1098B,Nice table,"brute force, constructive algorithms, greedy, math",2100,1043,0,https://codeforces.com/problemset/problem/1098/B
+1098A,Sum in the tree,"constructive algorithms, dfs and similar, greedy, trees",1600,5457,0,https://codeforces.com/problemset/problem/1098/A
+1097H,Mateusz and an Infinite Sequence,"bitmasks, brute force, dp, strings",3400,51,0,https://codeforces.com/problemset/problem/1097/H
+1097G,Vladislav and a Great Legend,"combinatorics, dp, trees",3000,253,0,https://codeforces.com/problemset/problem/1097/G
+1097F,Alex and a TV Show,"bitmasks, combinatorics, number theory",2500,750,0,https://codeforces.com/problemset/problem/1097/F
+1097E,Egor and an RPG game,"constructive algorithms, greedy",3400,249,0,https://codeforces.com/problemset/problem/1097/E
+1097D,Makoto and a Blackboard,"dp, math, number theory, probabilities",2200,1836,0,https://codeforces.com/problemset/problem/1097/D
+1097C,Yuhao and a Parenthesis,"greedy, implementation",1400,6265,0,https://codeforces.com/problemset/problem/1097/C
+1097B,Petr and a Combination Lock,"bitmasks, brute force, dp",1200,11972,0,https://codeforces.com/problemset/problem/1097/B
+1097A,Gennady and a Card Game,"brute force, implementation",800,22195,0,https://codeforces.com/problemset/problem/1097/A
+1096G,Lucky Tickets,"divide and conquer, dp, fft",2400,757,0,https://codeforces.com/problemset/problem/1096/G
+1096F,Inversion Expectation,"dp, math, probabilities",2300,986,0,https://codeforces.com/problemset/problem/1096/F
+1096E,The Top Scorer,"combinatorics, dp, math, probabilities",2500,389,0,https://codeforces.com/problemset/problem/1096/E
+1096D,Easy Problem,dp,1800,4350,0,https://codeforces.com/problemset/problem/1096/D
+1096C,Polygon for the Angle,"brute force, geometry",1600,4981,0,https://codeforces.com/problemset/problem/1096/C
+1096B,Substring Removal,"combinatorics, math, strings",1300,7162,0,https://codeforces.com/problemset/problem/1096/B
+1096A,Find Divisible,"greedy, implementation, math",800,12594,0,https://codeforces.com/problemset/problem/1096/A
+1095F,Make It Connected,"dsu, graphs, greedy",1900,2834,0,https://codeforces.com/problemset/problem/1095/F
+1095E,Almost Regular Bracket Sequence,implementation,1900,2361,0,https://codeforces.com/problemset/problem/1095/E
+1095D,Circular Dance,implementation,1600,4937,0,https://codeforces.com/problemset/problem/1095/D
+1095C,Powers Of Two,"bitmasks, greedy",1400,8229,0,https://codeforces.com/problemset/problem/1095/C
+1095B,Array Stabilization,implementation,900,12533,0,https://codeforces.com/problemset/problem/1095/B
+1095A,Repeating Cipher,implementation,800,16798,0,https://codeforces.com/problemset/problem/1095/A
+1093G,Multidimensional Queries,"bitmasks, data structures",2300,1068,0,https://codeforces.com/problemset/problem/1093/G
+1093F,Vasya and Array,dp,2400,492,0,https://codeforces.com/problemset/problem/1093/F
+1093E,Intersection of Permutations,data structures,2400,835,0,https://codeforces.com/problemset/problem/1093/E
+1093D,Beautiful Graph,"dfs and similar, graphs",1700,4747,0,https://codeforces.com/problemset/problem/1093/D
+1093C,Mishka and the Last Exam,greedy,1300,6957,0,https://codeforces.com/problemset/problem/1093/C
+1093B,Letters Rearranging,"constructive algorithms, greedy, sortings, strings",900,10362,0,https://codeforces.com/problemset/problem/1093/B
+1093A,Dice Rolling,math,800,12981,0,https://codeforces.com/problemset/problem/1093/A
+1092F,Tree with Maximum Cost,"dfs and similar, dp, trees",1900,2611,0,https://codeforces.com/problemset/problem/1092/F
+1092E,Minimal Diameter Forest,"constructive algorithms, dfs and similar, greedy, trees",2000,850,0,https://codeforces.com/problemset/problem/1092/E
+1092D2,Great Vova Wall (Version 2),"data structures, implementation",2200,1570,0,https://codeforces.com/problemset/problem/1092/D2
+1092D1,Great Vova Wall (Version 1),"greedy, implementation, math",2200,2049,0,https://codeforces.com/problemset/problem/1092/D1
+1092C,Prefixes and Suffixes,strings,1700,3882,0,https://codeforces.com/problemset/problem/1092/C
+1092B,Teams Forming,sortings,800,15954,0,https://codeforces.com/problemset/problem/1092/B
+1092A,Uniform String,implementation,800,11535,0,https://codeforces.com/problemset/problem/1092/A
+1091H,New Year and the Tricolore Recreation,games,3200,222,0,https://codeforces.com/problemset/problem/1091/H
+1091G,New Year and the Factorisation Collaboration,"interactive, math, number theory",3200,103,0,https://codeforces.com/problemset/problem/1091/G
+1091F,New Year and the Mallard Expedition,"constructive algorithms, greedy",2600,566,0,https://codeforces.com/problemset/problem/1091/F
+1091E,New Year and the Acquaintance Estimation,"binary search, data structures, graphs, greedy, implementation, math, sortings",2400,792,0,https://codeforces.com/problemset/problem/1091/E
+1091D,New Year and the Permutation Concatenation,"combinatorics, dp, math",1700,4827,0,https://codeforces.com/problemset/problem/1091/D
+1091C,New Year and the Sphere Transmission,"math, number theory",1400,7106,0,https://codeforces.com/problemset/problem/1091/C
+1091B,New Year and the Treasure Geolocation,"brute force, constructive algorithms, greedy, implementation",1200,8569,0,https://codeforces.com/problemset/problem/1091/B
+1091A,New Year and the Christmas Ornament,"brute force, implementation, math",800,14122,0,https://codeforces.com/problemset/problem/1091/A
+1090M,The Pleasant Walk,implementation,1000,3526,0,https://codeforces.com/problemset/problem/1090/M
+1090L,Berland University,"greedy, math",2000,710,0,https://codeforces.com/problemset/problem/1090/L
+1090K,Right Expansion Of The Mind,math,2000,576,0,https://codeforces.com/problemset/problem/1090/K
+1090J,Two Prefixes,strings,2600,171,0,https://codeforces.com/problemset/problem/1090/J
+1090I,Minimal Product,,2000,552,0,https://codeforces.com/problemset/problem/1090/I
+1090H,Linearization,,2900,46,0,https://codeforces.com/problemset/problem/1090/H
+1090G,Combostone,"games, implementation",2500,46,0,https://codeforces.com/problemset/problem/1090/G
+1090F,How to Learn You Score,"constructive algorithms, interactive",2600,125,0,https://codeforces.com/problemset/problem/1090/F
+1090E,Horseback Riding,"flows, graphs",2300,305,0,https://codeforces.com/problemset/problem/1090/E
+1090D,Similar Arrays,constructive algorithms,1800,1145,0,https://codeforces.com/problemset/problem/1090/D
+1090C,New Year Presents,"constructive algorithms, data structures",2400,253,0,https://codeforces.com/problemset/problem/1090/C
+1090B,LaTeX Expert,,1900,810,0,https://codeforces.com/problemset/problem/1090/B
+1090A,Company Merging,greedy,1300,2447,0,https://codeforces.com/problemset/problem/1090/A
+1089M,Minegraphed,"constructive algorithms, graphs",2400,383,0,https://codeforces.com/problemset/problem/1089/M
+1089L,Lazyland,,900,2286,0,https://codeforces.com/problemset/problem/1089/L
+1089K,King Kog's Reception,data structures,2400,611,0,https://codeforces.com/problemset/problem/1089/K
+1089J,JS Minification,"greedy, implementation",3200,82,0,https://codeforces.com/problemset/problem/1089/J
+1089I,Interval-Free Permutations,,2600,139,0,https://codeforces.com/problemset/problem/1089/I
+1089H,Harder Satisfiability,"2-sat, dfs and similar, graphs",3400,60,0,https://codeforces.com/problemset/problem/1089/H
+1089G,Guest Student,math,1500,1932,0,https://codeforces.com/problemset/problem/1089/G
+1089F,Fractions,math,1900,1271,0,https://codeforces.com/problemset/problem/1089/F
+1089E,Easy Chess,constructive algorithms,1700,1421,0,https://codeforces.com/problemset/problem/1089/E
+1089D,Distance Sum,graphs,3100,57,0,https://codeforces.com/problemset/problem/1089/D
+1089C,Cactus Search,interactive,2500,260,0,https://codeforces.com/problemset/problem/1089/C
+1089B,Bimatching,graphs,3200,124,0,https://codeforces.com/problemset/problem/1089/B
+1089A,Alice the Fan,dp,2200,727,0,https://codeforces.com/problemset/problem/1089/A
+1088F,Ehab and a weird weight formula,"data structures, trees",2800,256,0,https://codeforces.com/problemset/problem/1088/F
+1088E,Ehab and a component choosing problem,"dp, greedy, math, trees",2400,977,0,https://codeforces.com/problemset/problem/1088/E
+1088D,Ehab and another another xor problem,"bitmasks, constructive algorithms, implementation, interactive",2000,1845,0,https://codeforces.com/problemset/problem/1088/D
+1088C,Ehab and a 2-operation task,"constructive algorithms, greedy, math",1400,5921,0,https://codeforces.com/problemset/problem/1088/C
+1088B,Ehab and subtraction,"implementation, sortings",1000,9116,0,https://codeforces.com/problemset/problem/1088/B
+1088A,Ehab and another construction problem,"brute force, constructive algorithms",800,11721,0,https://codeforces.com/problemset/problem/1088/A
+1086F,Forest Fires,math,3500,57,0,https://codeforces.com/problemset/problem/1086/F
+1085G,Beautiful Matrix,"combinatorics, data structures, dp",2900,231,0,https://codeforces.com/problemset/problem/1085/G
+1085F,Rock-Paper-Scissors Champion,,2500,415,0,https://codeforces.com/problemset/problem/1085/F
+1085E,Vasya and Templates,"greedy, implementation, strings",2300,660,0,https://codeforces.com/problemset/problem/1085/E
+1085D,Minimum Diameter Tree,"constructive algorithms, implementation, trees",1700,3980,0,https://codeforces.com/problemset/problem/1085/D
+1085C,Connect Three,"implementation, math",1600,4442,0,https://codeforces.com/problemset/problem/1085/C
+1085B,Div Times Mod,math,1100,7031,0,https://codeforces.com/problemset/problem/1085/B
+1085A,Right-Left Cipher,"implementation, strings",800,9511,0,https://codeforces.com/problemset/problem/1085/A
+1084C,The Fair Nut and String,"combinatorics, dp, implementation",1500,5136,0,https://codeforces.com/problemset/problem/1084/C
+1084B,Kvass and the Fair Nut,"greedy, implementation",1200,5670,0,https://codeforces.com/problemset/problem/1084/B
+1084A,The Fair Nut and Elevator,"brute force, implementation",1000,6525,0,https://codeforces.com/problemset/problem/1084/A
+1083F,The Fair Nut and Amusing Xor,data structures,3300,83,0,https://codeforces.com/problemset/problem/1083/F
+1083E,The Fair Nut and Rectangles,"data structures, dp, geometry",2400,1331,0,https://codeforces.com/problemset/problem/1083/E
+1083D,The Fair Nut's getting crazy,"data structures, implementation",3500,89,0,https://codeforces.com/problemset/problem/1083/D
+1083C,Max Mex,"data structures, trees",2900,393,0,https://codeforces.com/problemset/problem/1083/C
+1083B,The Fair Nut and Strings,"greedy, strings",2000,1243,0,https://codeforces.com/problemset/problem/1083/B
+1083A,The Fair Nut and the Best Path,"data structures, dp, trees",1800,3194,0,https://codeforces.com/problemset/problem/1083/A
+1082G,Petya and Graph,"flows, graphs",2400,841,0,https://codeforces.com/problemset/problem/1082/G
+1082F,Speed Dial,"dp, strings, trees",2800,233,0,https://codeforces.com/problemset/problem/1082/F
+1082E,Increasing Frequency,"binary search, dp, greedy",2000,2106,0,https://codeforces.com/problemset/problem/1082/E
+1082D,Maximum Diameter Graph,"constructive algorithms, graphs, implementation",1800,2579,0,https://codeforces.com/problemset/problem/1082/D
+1082C,Multi-Subject Competition,"greedy, sortings",1600,4071,0,https://codeforces.com/problemset/problem/1082/C
+1082B,Vova and Trophies,greedy,1600,5324,0,https://codeforces.com/problemset/problem/1082/B
+1082A,Vasya and Book,"implementation, math",1200,6442,0,https://codeforces.com/problemset/problem/1082/A
+1081H,Palindromic Magic,"data structures, hashing, strings",3500,52,0,https://codeforces.com/problemset/problem/1081/H
+1081G,Mergesort Strikes Back,"math, probabilities",3200,115,0,https://codeforces.com/problemset/problem/1081/G
+1081F,Tricky Interactor,"constructive algorithms, implementation, interactive",2600,283,0,https://codeforces.com/problemset/problem/1081/F
+1081E,Missing Numbers,"binary search, constructive algorithms, greedy, math, number theory",1900,1749,0,https://codeforces.com/problemset/problem/1081/E
+1081D,Maximum Distance,"dsu, graphs, shortest paths, sortings",1800,2423,0,https://codeforces.com/problemset/problem/1081/D
+1081C,Colorful Bricks,"combinatorics, dp, math",1500,4465,0,https://codeforces.com/problemset/problem/1081/C
+1081B,Farewell Party,"constructive algorithms, implementation",1500,3545,0,https://codeforces.com/problemset/problem/1081/B
+1081A,Definite Game,"constructive algorithms, math",800,8395,0,https://codeforces.com/problemset/problem/1081/A
+1080F,Katya and Segments Sets,"data structures, interactive, sortings",2400,370,0,https://codeforces.com/problemset/problem/1080/F
+1080E,Sonya and Matrix Beauty,strings,2400,499,0,https://codeforces.com/problemset/problem/1080/E
+1080D,Olya and magical square,"constructive algorithms, implementation, math",2000,1173,0,https://codeforces.com/problemset/problem/1080/D
+1080C,Masha and two friends,implementation,1500,3350,0,https://codeforces.com/problemset/problem/1080/C
+1080B,Margarite and the best present,math,900,8471,0,https://codeforces.com/problemset/problem/1080/B
+1080A,Petya and Origami,math,800,12577,0,https://codeforces.com/problemset/problem/1080/A
+1078E,Negative Time Summation,constructive algorithms,3400,47,0,https://codeforces.com/problemset/problem/1078/E
+1077F2,Pictures with Kittens (hard version),"data structures, dp",2100,1192,0,https://codeforces.com/problemset/problem/1077/F2
+1077F1,Pictures with Kittens (easy version),dp,1900,1839,0,https://codeforces.com/problemset/problem/1077/F1
+1077E,Thematic Contests,"greedy, sortings",1800,2862,0,https://codeforces.com/problemset/problem/1077/E
+1077D,Cutting Out,"binary search, sortings",1600,4614,0,https://codeforces.com/problemset/problem/1077/D
+1077C,Good Array,,1300,8653,0,https://codeforces.com/problemset/problem/1077/C
+1077B,Disturbed People,greedy,1000,11504,0,https://codeforces.com/problemset/problem/1077/B
+1077A,Frog Jumping,math,800,17674,0,https://codeforces.com/problemset/problem/1077/A
+1076G,Array Game,"data structures, games",3000,163,0,https://codeforces.com/problemset/problem/1076/G
+1076F,Summer Practice Report,"dp, greedy",2500,409,0,https://codeforces.com/problemset/problem/1076/F
+1076E,Vasya and a Tree,"data structures, trees",1900,2385,0,https://codeforces.com/problemset/problem/1076/E
+1076D,Edge Deletion,"graphs, greedy, shortest paths",1800,2908,0,https://codeforces.com/problemset/problem/1076/D
+1076C,Meme Problem,"binary search, math",1300,7841,0,https://codeforces.com/problemset/problem/1076/C
+1076B,Divisor Subtraction,"implementation, math, number theory",1200,8261,0,https://codeforces.com/problemset/problem/1076/B
+1076A,Minimizing the String,"greedy, strings",1200,8303,0,https://codeforces.com/problemset/problem/1076/A
+1075B,Taxi drivers and Lyft,"implementation, sortings",1200,3313,0,https://codeforces.com/problemset/problem/1075/B
+1075A,The King's Race,"implementation, math",800,5821,0,https://codeforces.com/problemset/problem/1075/A
+1073G,Yet Another LCP Problem,"data structures, string suffix structures",2600,315,0,https://codeforces.com/problemset/problem/1073/G
+1073F,Choosing Two Paths,"dfs and similar, dp, greedy, trees",2500,305,0,https://codeforces.com/problemset/problem/1073/F
+1073E,Segment Sum,"bitmasks, combinatorics, dp, math",2300,1240,0,https://codeforces.com/problemset/problem/1073/E
+1073D,Berland Fair,"binary search, brute force, data structures, greedy",1700,4772,0,https://codeforces.com/problemset/problem/1073/D
+1073C,Vasya and Robot,"binary search, two pointers",1800,3145,0,https://codeforces.com/problemset/problem/1073/C
+1073B,Vasya and Books,"implementation, math",1000,8118,0,https://codeforces.com/problemset/problem/1073/B
+1073A,Diverse Substring,"implementation, strings",1000,9947,0,https://codeforces.com/problemset/problem/1073/A
+1071E,Rain Protection,"binary search, geometry",3500,56,0,https://codeforces.com/problemset/problem/1071/E
+1070M,Algoland and Berland,"constructive algorithms, divide and conquer, geometry",3000,41,0,https://codeforces.com/problemset/problem/1070/M
+1070L,Odd Federalization,constructive algorithms,2600,122,0,https://codeforces.com/problemset/problem/1070/L
+1070K,Video Posts,implementation,1100,3472,0,https://codeforces.com/problemset/problem/1070/K
+1070J,Streets and Avenues in Berhattan,dp,2300,456,0,https://codeforces.com/problemset/problem/1070/J
+1070I,Privatization of Roads in Berland,"flows, graphs",2400,337,0,https://codeforces.com/problemset/problem/1070/I
+1070H,BerOS File Suggestion,"brute force, implementation",1500,2775,0,https://codeforces.com/problemset/problem/1070/H
+1070G,Monsters and Potions,"brute force, dp, greedy, implementation",2300,633,0,https://codeforces.com/problemset/problem/1070/G
+1070F,Debate,greedy,1500,2717,0,https://codeforces.com/problemset/problem/1070/F
+1070E,Getting Deals Done,"binary search, data structures",2100,900,0,https://codeforces.com/problemset/problem/1070/E
+1070D,Garbage Disposal,greedy,1300,3550,0,https://codeforces.com/problemset/problem/1070/D
+1070C,Cloud Computing,"data structures, greedy",2000,1452,0,https://codeforces.com/problemset/problem/1070/C
+1070B,Berkomnadzor,"data structures, greedy",2400,371,0,https://codeforces.com/problemset/problem/1070/B
+1070A,Find a Number,"dp, graphs, number theory, shortest paths",2200,1508,0,https://codeforces.com/problemset/problem/1070/A
+1068C,Colored Rooks,"constructive algorithms, graphs",1700,2354,0,https://codeforces.com/problemset/problem/1068/C
+1068B,LCM,"math, number theory",1200,6722,0,https://codeforces.com/problemset/problem/1068/B
+1068A,Birthday,math,1400,4955,0,https://codeforces.com/problemset/problem/1068/A
+1067E,Random Forest Rank,"dp, graph matchings, math, trees",2800,177,0,https://codeforces.com/problemset/problem/1067/E
+1067D,Computer Game,"dp, greedy, math, probabilities",3100,114,0,https://codeforces.com/problemset/problem/1067/D
+1067C,Knights,constructive algorithms,2600,412,0,https://codeforces.com/problemset/problem/1067/C
+1067B,Multihedgehog,"dfs and similar, graphs, shortest paths",1800,1759,0,https://codeforces.com/problemset/problem/1067/B
+1067A,Array Without Local Maximums,dp,1900,1802,0,https://codeforces.com/problemset/problem/1067/A
+1066F,Yet another 2D Walking,dp,2100,1055,0,https://codeforces.com/problemset/problem/1066/F
+1066E,Binary Numbers AND Sum,"data structures, implementation, math",1700,3775,0,https://codeforces.com/problemset/problem/1066/E
+1066D,Boxes Packing,"binary search, implementation",1800,3457,0,https://codeforces.com/problemset/problem/1066/D
+1066C,Books Queries,implementation,1400,6075,0,https://codeforces.com/problemset/problem/1066/C
+1066B,Heaters,"greedy, two pointers",1500,5368,0,https://codeforces.com/problemset/problem/1066/B
+1066A,Vova and Train,math,1100,9902,0,https://codeforces.com/problemset/problem/1066/A
+1065G,Fibonacci Suffix,strings,2700,115,0,https://codeforces.com/problemset/problem/1065/G
+1065F,Up and Down the Tree,"dfs and similar, dp, trees",2500,644,0,https://codeforces.com/problemset/problem/1065/F
+1065E,Side Transmutations,"combinatorics, strings",2300,675,0,https://codeforces.com/problemset/problem/1065/E
+1065D,Three Pieces,"dfs and similar, dp, shortest paths",2200,947,0,https://codeforces.com/problemset/problem/1065/D
+1065C,Make It Equal,greedy,1600,5173,0,https://codeforces.com/problemset/problem/1065/C
+1065B,Vasya and Isolated Vertices,"constructive algorithms, graphs",1300,7641,0,https://codeforces.com/problemset/problem/1065/B
+1065A,Vasya and Chocolate,"implementation, math",800,11530,0,https://codeforces.com/problemset/problem/1065/A
+1064B,Equations of Mathematical Magic,math,1200,6144,0,https://codeforces.com/problemset/problem/1064/B
+1064A,Make a triangle!,"brute force, geometry, math",800,13393,0,https://codeforces.com/problemset/problem/1064/A
+1063F,String Journey,"data structures, dp, string suffix structures",3300,285,0,https://codeforces.com/problemset/problem/1063/F
+1063E,Lasers and Mirrors,"constructive algorithms, math",3000,161,0,https://codeforces.com/problemset/problem/1063/E
+1063D,Candies for Children,"brute force, math",2600,295,0,https://codeforces.com/problemset/problem/1063/D
+1063C,"Dwarves, Hats and Extrasensory Abilities","binary search, constructive algorithms, geometry, interactive",1900,2032,0,https://codeforces.com/problemset/problem/1063/C
+1063B,Labyrinth,"graphs, shortest paths",1800,4010,0,https://codeforces.com/problemset/problem/1063/B
+1063A,Oh Those Palindromes,"constructive algorithms, strings",1300,7434,0,https://codeforces.com/problemset/problem/1063/A
+1062F,Upgrading Cities,"dfs and similar, graphs",2900,203,0,https://codeforces.com/problemset/problem/1062/F
+1062E,Company,"binary search, data structures, dfs and similar, greedy, trees",2300,972,0,https://codeforces.com/problemset/problem/1062/E
+1062D,Fun with Integers,"dfs and similar, graphs, implementation, math",1800,2892,0,https://codeforces.com/problemset/problem/1062/D
+1062C,Banh-mi,"greedy, implementation, math",1600,4145,0,https://codeforces.com/problemset/problem/1062/C
+1062B,Math,"greedy, math, number theory",1500,5389,0,https://codeforces.com/problemset/problem/1062/B
+1062A,A Prank,"greedy, implementation",1300,6382,0,https://codeforces.com/problemset/problem/1062/A
+1061F,Lost Root,"interactive, probabilities",2400,384,0,https://codeforces.com/problemset/problem/1061/F
+1061E,Politics,"flows, graphs",2600,288,0,https://codeforces.com/problemset/problem/1061/E
+1061D,TV Shows,"data structures, greedy, implementation, sortings",2000,1693,0,https://codeforces.com/problemset/problem/1061/D
+1061C,Multiplicity,"data structures, dp, implementation, math, number theory",1700,4306,0,https://codeforces.com/problemset/problem/1061/C
+1061B,Views Matter,"greedy, implementation, sortings",1400,5628,0,https://codeforces.com/problemset/problem/1061/B
+1061A,Coins,"greedy, implementation, math",800,13202,0,https://codeforces.com/problemset/problem/1061/A
+1060H,Sophisticated Device,constructive algorithms,3300,88,0,https://codeforces.com/problemset/problem/1060/H
+1060G,Balls and Pockets,data structures,3400,42,0,https://codeforces.com/problemset/problem/1060/G
+1060F,Shrinking Tree,"combinatorics, dp",2900,232,0,https://codeforces.com/problemset/problem/1060/F
+1060E,Sergey and Subway,"dfs and similar, dp, trees",2000,1864,0,https://codeforces.com/problemset/problem/1060/E
+1060D,Social Circles,"greedy, math",1900,2786,0,https://codeforces.com/problemset/problem/1060/D
+1060C,Maximum Subrectangle,"binary search, implementation, two pointers",1600,3521,0,https://codeforces.com/problemset/problem/1060/C
+1060B,Maximum Sum of Digits,greedy,1100,6569,0,https://codeforces.com/problemset/problem/1060/B
+1060A,Phone Numbers,brute force,800,8967,0,https://codeforces.com/problemset/problem/1060/A
+1059E,Split the Tree,"binary search, data structures, dp, greedy, trees",2400,845,0,https://codeforces.com/problemset/problem/1059/E
+1059D,Nature Reserve,"binary search, geometry, ternary search",2200,1860,0,https://codeforces.com/problemset/problem/1059/D
+1059C,Sequence Transformation,"constructive algorithms, math",1600,5221,0,https://codeforces.com/problemset/problem/1059/C
+1059B,Forgery,implementation,1300,5614,0,https://codeforces.com/problemset/problem/1059/B
+1059A,Cashier,implementation,1000,8825,0,https://codeforces.com/problemset/problem/1059/A
+1057C,Tanya and Colored Candies,"*special problem, dp",2000,397,0,https://codeforces.com/problemset/problem/1057/C
+1057B,DDoS,"*special problem, brute force",1400,1240,0,https://codeforces.com/problemset/problem/1057/B
+1057A,Bmail Computer Network,"*special problem, dfs and similar, trees",900,2678,0,https://codeforces.com/problemset/problem/1057/A
+1056H,Detect Robots,"data structures, strings",3200,70,0,https://codeforces.com/problemset/problem/1056/H
+1056G,Take Metro,"brute force, data structures, graphs",2900,133,0,https://codeforces.com/problemset/problem/1056/G
+1056F,Write The Contest,"binary search, dp, math",2500,347,0,https://codeforces.com/problemset/problem/1056/F
+1056E,Check Transcription,"brute force, data structures, hashing, strings",2100,1133,0,https://codeforces.com/problemset/problem/1056/E
+1056D,Decorate Apple Tree,"constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees",1600,3427,0,https://codeforces.com/problemset/problem/1056/D
+1056C,Pick Heroes,"greedy, implementation, interactive, sortings",1700,1763,0,https://codeforces.com/problemset/problem/1056/C
+1056B,Divide Candies,"math, number theory",1600,3067,0,https://codeforces.com/problemset/problem/1056/B
+1056A,Determine Line,implementation,800,4906,0,https://codeforces.com/problemset/problem/1056/A
+1055G,Jellyfish Nightmare,,3500,40,0,https://codeforces.com/problemset/problem/1055/G
+1055F,Tree and XOR,"strings, trees",2900,246,0,https://codeforces.com/problemset/problem/1055/F
+1055E,Segments on the Line,"binary search, dp",2500,456,0,https://codeforces.com/problemset/problem/1055/E
+1055D,Refactoring,"greedy, implementation, strings",2400,505,0,https://codeforces.com/problemset/problem/1055/D
+1055C,Lucky Days,"math, number theory",1900,1524,0,https://codeforces.com/problemset/problem/1055/C
+1055B,Alice and Hairdresser,"dsu, implementation",1300,3494,0,https://codeforces.com/problemset/problem/1055/B
+1055A,Metro,graphs,900,5941,0,https://codeforces.com/problemset/problem/1055/A
+1054H,Epic Convolution,"chinese remainder theorem, fft, math, number theory",3500,84,0,https://codeforces.com/problemset/problem/1054/H
+1054G,New Road Network,"constructive algorithms, greedy, math",3300,81,0,https://codeforces.com/problemset/problem/1054/G
+1054F,Electric Scheme,"flows, graph matchings",2700,192,0,https://codeforces.com/problemset/problem/1054/F
+1054E,Chips Puzzle,"constructive algorithms, implementation, math",2400,376,0,https://codeforces.com/problemset/problem/1054/E
+1054D,Changing Array,"greedy, implementation",1900,1661,0,https://codeforces.com/problemset/problem/1054/D
+1054C,Candies Distribution,"constructive algorithms, implementation",1500,3444,0,https://codeforces.com/problemset/problem/1054/C
+1054B,Appending Mex,implementation,1000,4976,0,https://codeforces.com/problemset/problem/1054/B
+1054A,Elevator or Stairs?,implementation,800,6912,0,https://codeforces.com/problemset/problem/1054/A
+1053E,Euler tour,"constructive algorithms, trees",3500,98,0,https://codeforces.com/problemset/problem/1053/E
+1051G,Distinctification,"data structures, dsu, greedy",2900,120,0,https://codeforces.com/problemset/problem/1051/G
+1051F,The Shortest Statement,"graphs, shortest paths, trees",2400,1243,0,https://codeforces.com/problemset/problem/1051/F
+1051E,Vasya and Big Integers,"binary search, data structures, dp, hashing, strings",2600,439,0,https://codeforces.com/problemset/problem/1051/E
+1051D,Bicolorings,"bitmasks, dp",1700,4441,0,https://codeforces.com/problemset/problem/1051/D
+1051C,Vasya and Multisets,"brute force, dp, greedy, implementation, math",1500,6561,0,https://codeforces.com/problemset/problem/1051/C
+1051B,Relatively Prime Pairs,"greedy, math, number theory",1000,9692,0,https://codeforces.com/problemset/problem/1051/B
+1051A,Vasya And Password,"greedy, implementation, strings",1200,6768,0,https://codeforces.com/problemset/problem/1051/A
+1047B,Cover Points,"geometry, math",900,11531,0,https://codeforces.com/problemset/problem/1047/B
+1047A,Little C Loves 3 I,math,800,12989,0,https://codeforces.com/problemset/problem/1047/A
+1046I,Say Hello,geometry,2300,200,0,https://codeforces.com/problemset/problem/1046/I
+1046F,Splitting money,implementation,1400,1823,0,https://codeforces.com/problemset/problem/1046/F
+1046C,Space Formula,greedy,1400,1965,0,https://codeforces.com/problemset/problem/1046/C
+1045J,Moonwalk challenge,"data structures, strings, trees",2600,90,0,https://codeforces.com/problemset/problem/1045/J
+1045I,Palindrome Pairs,"hashing, strings",1600,1976,0,https://codeforces.com/problemset/problem/1045/I
+1045H,Self-exploration,math,2400,264,0,https://codeforces.com/problemset/problem/1045/H
+1045G,AI robots,data structures,2200,767,0,https://codeforces.com/problemset/problem/1045/G
+1045F,Shady Lady,"geometry, math",3400,65,0,https://codeforces.com/problemset/problem/1045/F
+1045E,Ancient civilizations,"constructive algorithms, geometry",3200,47,0,https://codeforces.com/problemset/problem/1045/E
+1045D,Interstellar battle,"math, probabilities, trees",2200,369,0,https://codeforces.com/problemset/problem/1045/D
+1045C,Hyperspace Highways,"dfs and similar, graphs, trees",2300,418,0,https://codeforces.com/problemset/problem/1045/C
+1045B,Space Isaac,"hashing, number theory",2400,350,0,https://codeforces.com/problemset/problem/1045/B
+1045A,Last chance,"data structures, flows, graph matchings, graphs, trees",2500,184,0,https://codeforces.com/problemset/problem/1045/A
+1044F,DFS,data structures,2700,263,0,https://codeforces.com/problemset/problem/1044/F
+1044E,Grid Sort,implementation,3100,53,0,https://codeforces.com/problemset/problem/1044/E
+1044D,Deduction Queries,"data structures, dsu",2400,568,0,https://codeforces.com/problemset/problem/1044/D
+1044C,Optimal Polygon Perimeter,"dp, geometry",2100,881,0,https://codeforces.com/problemset/problem/1044/C
+1044B,Intersecting Subtrees,"dfs and similar, interactive, trees",1900,1198,0,https://codeforces.com/problemset/problem/1044/B
+1044A,The Tower is Going Home,"binary search, two pointers",1700,2208,0,https://codeforces.com/problemset/problem/1044/A
+1043G,Speckled Band,"data structures, divide and conquer, hashing, string suffix structures, strings",3500,71,0,https://codeforces.com/problemset/problem/1043/G
+1043F,Make It One,"bitmasks, combinatorics, dp, math, number theory, shortest paths",2500,1050,0,https://codeforces.com/problemset/problem/1043/F
+1043E,"Train Hard, Win Easy","constructive algorithms, greedy, math, sortings",1900,2155,0,https://codeforces.com/problemset/problem/1043/E
+1043D,Mysterious Crime,"brute force, combinatorics, math, meet-in-the-middle, two pointers",1700,3401,0,https://codeforces.com/problemset/problem/1043/D
+1043C,Smallest Word,"constructive algorithms, greedy, implementation",1500,4985,0,https://codeforces.com/problemset/problem/1043/C
+1043B,Lost Array,implementation,1200,5240,0,https://codeforces.com/problemset/problem/1043/B
+1043A,Elections,"implementation, math",800,8836,0,https://codeforces.com/problemset/problem/1043/A
+1042F,Leaf Sets,"data structures, dfs and similar, dsu, graphs, greedy, sortings, trees",2400,825,0,https://codeforces.com/problemset/problem/1042/F
+1042E,Vasya and Magic Matrix,"dp, math, probabilities",2300,858,0,https://codeforces.com/problemset/problem/1042/E
+1042D,Petya and Array,"data structures, divide and conquer, two pointers",1800,3147,0,https://codeforces.com/problemset/problem/1042/D
+1042C,Array Product,"constructive algorithms, greedy, math",1700,3494,0,https://codeforces.com/problemset/problem/1042/C
+1042B,Vitamins,"bitmasks, brute force, dp, implementation",1200,7488,0,https://codeforces.com/problemset/problem/1042/B
+1042A,Benches,"binary search, implementation",1100,8179,0,https://codeforces.com/problemset/problem/1042/A
+1041F,Ray in the tube,"data structures, divide and conquer, dp, math",2500,967,0,https://codeforces.com/problemset/problem/1041/F
+1041E,Tree Reconstruction,"constructive algorithms, data structures, graphs, greedy",1900,2452,0,https://codeforces.com/problemset/problem/1041/E
+1041D,Glider,"binary search, data structures, two pointers",1700,4242,0,https://codeforces.com/problemset/problem/1041/D
+1041C,Coffee Break,"binary search, data structures, greedy, two pointers",1600,6165,0,https://codeforces.com/problemset/problem/1041/C
+1041B,Buying a TV Set,math,1000,9587,0,https://codeforces.com/problemset/problem/1041/B
+1041A,Heist,"greedy, implementation, sortings",800,15388,0,https://codeforces.com/problemset/problem/1041/A
+1040B,Shashlik Cooking,"dp, greedy, math",1300,5627,0,https://codeforces.com/problemset/problem/1040/B
+1040A,Palindrome Dance,greedy,1000,7211,0,https://codeforces.com/problemset/problem/1040/A
+1039E,Summer Oenothera Exhibition,data structures,3400,117,0,https://codeforces.com/problemset/problem/1039/E
+1039D,You Are Given a Tree,"data structures, dp, trees",2800,551,0,https://codeforces.com/problemset/problem/1039/D
+1039C,Network Safety,"dfs and similar, dsu, graphs, math, sortings",2200,962,0,https://codeforces.com/problemset/problem/1039/C
+1039B,Subway Pursuit,"binary search, interactive, probabilities",2100,1566,0,https://codeforces.com/problemset/problem/1039/B
+1039A,Timetable,"constructive algorithms, data structures, greedy, math",2300,589,0,https://codeforces.com/problemset/problem/1039/A
+1038F,Wrap Around,"dp, strings",2900,186,0,https://codeforces.com/problemset/problem/1038/F
+1038E,Maximum Matching,"bitmasks, brute force, dfs and similar, dp, graphs",2400,700,0,https://codeforces.com/problemset/problem/1038/E
+1038D,Slime,"dp, greedy, implementation",1800,5393,0,https://codeforces.com/problemset/problem/1038/D
+1038C,Gambling,"greedy, sortings",1300,7213,0,https://codeforces.com/problemset/problem/1038/C
+1038B,Non-Coprime Partition,"constructive algorithms, math",1100,9048,0,https://codeforces.com/problemset/problem/1038/B
+1038A,Equality,"implementation, strings",800,10911,0,https://codeforces.com/problemset/problem/1038/A
+1037H,Security,"data structures, string suffix structures",3200,310,0,https://codeforces.com/problemset/problem/1037/H
+1037G,A Game on Strings,games,3200,151,0,https://codeforces.com/problemset/problem/1037/G
+1037F,Maximum Reduction,"combinatorics, data structures, math",2500,680,0,https://codeforces.com/problemset/problem/1037/F
+1037E,Trips,graphs,2200,1941,0,https://codeforces.com/problemset/problem/1037/E
+1037D,Valid BFS?,"dfs and similar, graphs, shortest paths, trees",1700,7272,0,https://codeforces.com/problemset/problem/1037/D
+1037C,Equalize,"dp, greedy, strings",1300,10809,0,https://codeforces.com/problemset/problem/1037/C
+1037B,Reach Median,greedy,1300,7723,0,https://codeforces.com/problemset/problem/1037/B
+1037A,Packets,"constructive algorithms, greedy, math",1300,8149,0,https://codeforces.com/problemset/problem/1037/A
+1036G,Sources and Sinks,"bitmasks, brute force, dfs and similar",2700,229,0,https://codeforces.com/problemset/problem/1036/G
+1036F,Relatively Prime Powers,"combinatorics, math, number theory",2400,834,0,https://codeforces.com/problemset/problem/1036/F
+1036E,Covered Points,"fft, geometry, number theory",2400,1009,0,https://codeforces.com/problemset/problem/1036/E
+1036D,Vasya and Arrays,"greedy, two pointers",1600,5682,0,https://codeforces.com/problemset/problem/1036/D
+1036C,Classy Numbers,"combinatorics, dp",1900,4059,0,https://codeforces.com/problemset/problem/1036/C
+1036B,Diagonal Walking v.2,math,1600,4639,0,https://codeforces.com/problemset/problem/1036/B
+1036A,Function Height,math,1000,7941,0,https://codeforces.com/problemset/problem/1036/A
+1034E,Little C Loves 3 III,"bitmasks, dp, math",3200,140,0,https://codeforces.com/problemset/problem/1034/E
+1034D,Intervals of Intervals,"binary search, data structures, two pointers",3500,131,0,https://codeforces.com/problemset/problem/1034/D
+1034C,Region Separation,"combinatorics, dp, number theory, trees",2700,390,0,https://codeforces.com/problemset/problem/1034/C
+1034B,Little C Loves 3 II,"brute force, constructive algorithms, flows, graph matchings",2200,1626,0,https://codeforces.com/problemset/problem/1034/B
+1034A,Enlarge GCD,number theory,1800,4984,0,https://codeforces.com/problemset/problem/1034/A
+1033G,Chip Game,games,3500,68,0,https://codeforces.com/problemset/problem/1033/G
+1033F,Boolean Computer,"bitmasks, brute force, fft, math",2800,227,0,https://codeforces.com/problemset/problem/1033/F
+1033E,Hidden Bipartite Graph,"binary search, constructive algorithms, dfs and similar, graphs, interactive",2800,295,0,https://codeforces.com/problemset/problem/1033/E
+1033D,Divisors,"interactive, math, number theory",2000,1582,0,https://codeforces.com/problemset/problem/1033/D
+1033C,Permutation Game,"brute force, dp, games",1600,3622,0,https://codeforces.com/problemset/problem/1033/C
+1033B,Square Difference,"math, number theory",1100,5670,0,https://codeforces.com/problemset/problem/1033/B
+1033A,King Escape,"dfs and similar, graphs, implementation",1000,7017,0,https://codeforces.com/problemset/problem/1033/A
+1032G,Chattering,,2900,255,0,https://codeforces.com/problemset/problem/1032/G
+1032F,Vasya and Maximum Matching,"dp, trees",2400,470,0,https://codeforces.com/problemset/problem/1032/F
+1032E,The Unbearable Lightness of Weights,"dp, math",2100,1078,0,https://codeforces.com/problemset/problem/1032/E
+1032D,Barcelonian Distance,"geometry, implementation",1900,2055,0,https://codeforces.com/problemset/problem/1032/D
+1032C,Playing Piano,"constructive algorithms, dp",1700,2520,0,https://codeforces.com/problemset/problem/1032/C
+1032B,Personalized Cup,,1200,4222,0,https://codeforces.com/problemset/problem/1032/B
+1032A,Kitchen Utensils,,900,5557,0,https://codeforces.com/problemset/problem/1032/A
+1031F,Familiar Operations,"brute force, graphs, math",2800,167,0,https://codeforces.com/problemset/problem/1031/F
+1031E,Triple Flips,constructive algorithms,2600,294,0,https://codeforces.com/problemset/problem/1031/E
+1031D,Minimum path,greedy,1900,1919,0,https://codeforces.com/problemset/problem/1031/D
+1031C,Cram Time,greedy,1600,4087,0,https://codeforces.com/problemset/problem/1031/C
+1031B,Curiosity Has No Limits,,1500,3284,0,https://codeforces.com/problemset/problem/1031/B
+1031A,Golden Plate,"implementation, math",800,9963,0,https://codeforces.com/problemset/problem/1031/A
+1030G,Linear Congruential Generator,number theory,2900,235,0,https://codeforces.com/problemset/problem/1030/G
+1030F,Putting Boxes Together,data structures,2500,543,0,https://codeforces.com/problemset/problem/1030/F
+1030E,Vasya and Good Sequences,"bitmasks, dp",2000,2049,0,https://codeforces.com/problemset/problem/1030/E
+1030D,Vasya and Triangle,"geometry, number theory",1800,4486,0,https://codeforces.com/problemset/problem/1030/D
+1030C,Vasya and Golden Ticket,implementation,1300,7102,0,https://codeforces.com/problemset/problem/1030/C
+1030B,Vasya and Cornfield,geometry,1100,8712,0,https://codeforces.com/problemset/problem/1030/B
+1030A,In Search of an Easy Problem,implementation,800,40063,0,https://codeforces.com/problemset/problem/1030/A
+1029F,Multicolored Markers,"binary search, brute force, math, number theory",2000,1665,0,https://codeforces.com/problemset/problem/1029/F
+1029E,Tree with Small Distances,"dp, graphs, greedy",2100,1514,0,https://codeforces.com/problemset/problem/1029/E
+1029D,Concatenated Multiples,"implementation, math",1900,2458,0,https://codeforces.com/problemset/problem/1029/D
+1029C,Maximal Intersection,"greedy, math, sortings",1600,4829,0,https://codeforces.com/problemset/problem/1029/C
+1029B,Creating the Contest,"dp, greedy, math",1200,10279,0,https://codeforces.com/problemset/problem/1029/B
+1029A,Many Equal Substrings,"implementation, strings",1300,8131,0,https://codeforces.com/problemset/problem/1029/A
+1028H,Make Square,math,2900,293,0,https://codeforces.com/problemset/problem/1028/H
+1028G,Guess the number,"dp, interactive",3000,265,0,https://codeforces.com/problemset/problem/1028/G
+1028F,Make Symmetrical,brute force,2900,362,0,https://codeforces.com/problemset/problem/1028/F
+1028E,Restore Array,constructive algorithms,2400,886,0,https://codeforces.com/problemset/problem/1028/E
+1028D,Order book,"combinatorics, data structures, greedy",2100,1352,0,https://codeforces.com/problemset/problem/1028/D
+1028C,Rectangles,"geometry, implementation, sortings",1600,3466,0,https://codeforces.com/problemset/problem/1028/C
+1028B,Unnatural Conditions,"constructive algorithms, math",1200,5952,0,https://codeforces.com/problemset/problem/1028/B
+1028A,Find Square,implementation,800,8216,0,https://codeforces.com/problemset/problem/1028/A
+1027G,X-mouse in the Campus,"bitmasks, math, number theory",2600,187,0,https://codeforces.com/problemset/problem/1027/G
+1027F,Session in BSU,"binary search, dfs and similar, dsu, graph matchings, graphs",2400,797,0,https://codeforces.com/problemset/problem/1027/F
+1027E,Inverse Coloring,"combinatorics, dp, math",2100,1255,0,https://codeforces.com/problemset/problem/1027/E
+1027D,Mouse Hunt,"dfs and similar, graphs",1700,4487,0,https://codeforces.com/problemset/problem/1027/D
+1027C,Minimum Value Rectangle,greedy,1600,5227,0,https://codeforces.com/problemset/problem/1027/C
+1027B,Numbers on the Chessboard,"implementation, math",1200,6814,0,https://codeforces.com/problemset/problem/1027/B
+1027A,Palindromic Twist,"implementation, strings",1000,10423,0,https://codeforces.com/problemset/problem/1027/A
+1025G,Company Acquisitions,"constructive algorithms, math",3200,189,0,https://codeforces.com/problemset/problem/1025/G
+1025F,Disjoint Triangles,geometry,2700,411,0,https://codeforces.com/problemset/problem/1025/F
+1025E,Colored Cubes,"constructive algorithms, implementation, matrices",2700,399,0,https://codeforces.com/problemset/problem/1025/E
+1025D,Recovering BST,"brute force, dp, math, number theory, trees",2100,2278,0,https://codeforces.com/problemset/problem/1025/D
+1025C,Plasticine zebra,"constructive algorithms, implementation",1600,4576,0,https://codeforces.com/problemset/problem/1025/C
+1025B,Weakened Common Divisor,"brute force, greedy, number theory",1600,5589,0,https://codeforces.com/problemset/problem/1025/B
+1025A,Doggo Recoloring,"implementation, sortings",900,9394,0,https://codeforces.com/problemset/problem/1025/A
+1023G,Pisces,"data structures, flows, trees",3400,33,0,https://codeforces.com/problemset/problem/1023/G
+1023F,Mobile Phone Network,"dfs and similar, dsu, graphs, trees",2600,530,0,https://codeforces.com/problemset/problem/1023/F
+1023E,Down or Right,"constructive algorithms, interactive, matrices",2100,1424,0,https://codeforces.com/problemset/problem/1023/E
+1023D,Array Restoration,"constructive algorithms, data structures",1700,3159,0,https://codeforces.com/problemset/problem/1023/D
+1023C,Bracket Subsequence,greedy,1200,6801,0,https://codeforces.com/problemset/problem/1023/C
+1023B,Pair of Toys,math,1000,7541,0,https://codeforces.com/problemset/problem/1023/B
+1023A,Single Wildcard Pattern Matching,"brute force, implementation, strings",1200,6499,0,https://codeforces.com/problemset/problem/1023/A
+1020B,Badge,"brute force, dfs and similar, graphs",1000,11734,0,https://codeforces.com/problemset/problem/1020/B
+1020A,New Building for SIS,math,1000,7411,0,https://codeforces.com/problemset/problem/1020/A
+1019E,Raining season,"data structures, divide and conquer, trees",3200,167,0,https://codeforces.com/problemset/problem/1019/E
+1019D,Large Triangle,"binary search, geometry, sortings",2700,383,0,https://codeforces.com/problemset/problem/1019/D
+1019C,Sergey's problem,"constructive algorithms, graphs",3000,581,0,https://codeforces.com/problemset/problem/1019/C
+1019B,The hat,"binary search, interactive",2000,1379,0,https://codeforces.com/problemset/problem/1019/B
+1019A,Elections,"brute force, greedy",1700,3635,0,https://codeforces.com/problemset/problem/1019/A
+1017H,The Films,brute force,3300,47,0,https://codeforces.com/problemset/problem/1017/H
+1017G,The Tree,data structures,3200,279,0,https://codeforces.com/problemset/problem/1017/G
+1017F,The Neutral Zone,"brute force, math",2500,569,0,https://codeforces.com/problemset/problem/1017/F
+1017E,The Supersonic Rocket,"geometry, hashing, strings",2400,593,0,https://codeforces.com/problemset/problem/1017/E
+1017D,The Wu,"bitmasks, brute force, data structures",1900,2500,0,https://codeforces.com/problemset/problem/1017/D
+1017C,The Phone Number,"constructive algorithms, greedy",1600,4617,0,https://codeforces.com/problemset/problem/1017/C
+1017B,The Bits,"implementation, math",1200,7443,0,https://codeforces.com/problemset/problem/1017/B
+1017A,The Rank,implementation,800,13226,0,https://codeforces.com/problemset/problem/1017/A
+1016G,Appropriate Team,"bitmasks, math, number theory",2700,149,0,https://codeforces.com/problemset/problem/1016/G
+1016F,Road Projects,"dfs and similar, dp, trees",2600,439,0,https://codeforces.com/problemset/problem/1016/F
+1016E,Rest In The Shades,"binary search, geometry",2400,677,0,https://codeforces.com/problemset/problem/1016/E
+1016D,Vasya And The Matrix,"constructive algorithms, flows, math",1800,3327,0,https://codeforces.com/problemset/problem/1016/D
+1016C,Vasya And The Mushrooms,"dp, implementation",1800,2811,0,https://codeforces.com/problemset/problem/1016/C
+1016B,Segment Occurrences,"brute force, implementation",1300,6792,0,https://codeforces.com/problemset/problem/1016/B
+1016A,Death Note,"greedy, implementation, math",900,10402,0,https://codeforces.com/problemset/problem/1016/A
+1015F,Bracket Substring,"dp, strings",2300,525,0,https://codeforces.com/problemset/problem/1015/F
+1015E2,Stars Drawing (Hard Edition),"binary search, dp, greedy",1900,2192,0,https://codeforces.com/problemset/problem/1015/E2
+1015E1,Stars Drawing (Easy Edition),"brute force, dp, greedy",1700,3133,0,https://codeforces.com/problemset/problem/1015/E1
+1015D,Walking Between Houses,"constructive algorithms, greedy",1600,4932,0,https://codeforces.com/problemset/problem/1015/D
+1015C,Songs Compression,sortings,1100,10096,0,https://codeforces.com/problemset/problem/1015/C
+1015B,Obtaining the String,implementation,1200,8125,0,https://codeforces.com/problemset/problem/1015/B
+1015A,Points in Segments,implementation,800,14298,0,https://codeforces.com/problemset/problem/1015/A
+1013B,And,greedy,1200,5548,0,https://codeforces.com/problemset/problem/1013/B
+1013A,Piles With Stones,math,800,8504,0,https://codeforces.com/problemset/problem/1013/A
+1012F,Passports,"dp, implementation",3400,78,0,https://codeforces.com/problemset/problem/1012/F
+1012E,Cycle sort,"dsu, math",3100,128,0,https://codeforces.com/problemset/problem/1012/E
+1012D,AB-Strings,"constructive algorithms, strings",2800,181,0,https://codeforces.com/problemset/problem/1012/D
+1012C,Hills,dp,1900,1975,0,https://codeforces.com/problemset/problem/1012/C
+1012B,Chemical table,"constructive algorithms, dfs and similar, dsu, graphs, matrices",1900,2606,0,https://codeforces.com/problemset/problem/1012/B
+1012A,Photo of The Sky,"brute force, implementation, math, sortings",1500,4909,0,https://codeforces.com/problemset/problem/1012/A
+1011B,Planning The Expedition,"binary search, brute force, implementation",1200,7252,0,https://codeforces.com/problemset/problem/1011/B
+1011A,Stages,"greedy, implementation, sortings",900,8871,0,https://codeforces.com/problemset/problem/1011/A
+1010F,Tree,"fft, graphs, trees",3400,98,0,https://codeforces.com/problemset/problem/1010/F
+1010E,Store,data structures,2700,219,0,https://codeforces.com/problemset/problem/1010/E
+1010D,Mars rover,"dfs and similar, graphs, implementation, trees",2000,1721,0,https://codeforces.com/problemset/problem/1010/D
+1010C,Border,number theory,1800,3462,0,https://codeforces.com/problemset/problem/1010/C
+1010B,Rocket,"binary search, interactive",1800,3571,0,https://codeforces.com/problemset/problem/1010/B
+1010A,Fly,"binary search, math",1500,6332,0,https://codeforces.com/problemset/problem/1010/A
+1009G,Allowed Letters,"bitmasks, flows, graph matchings, graphs, greedy",2400,399,0,https://codeforces.com/problemset/problem/1009/G
+1009F,Dominant Indices,"data structures, dsu, trees",2300,1633,0,https://codeforces.com/problemset/problem/1009/F
+1009E,Intercity Travelling,"combinatorics, math, probabilities",2000,2019,0,https://codeforces.com/problemset/problem/1009/E
+1009D,Relatively Prime Graph,"brute force, constructive algorithms, graphs, greedy, math",1700,4472,0,https://codeforces.com/problemset/problem/1009/D
+1009C,Annoying Present,"greedy, math",1700,4206,0,https://codeforces.com/problemset/problem/1009/C
+1009B,Minimum Ternary String,"greedy, implementation",1400,6642,0,https://codeforces.com/problemset/problem/1009/B
+1009A,Game Shopping,implementation,800,9659,0,https://codeforces.com/problemset/problem/1009/A
+1008B,Turn the Rectangles,"greedy, sortings",1000,8256,0,https://codeforces.com/problemset/problem/1008/B
+1008A,Romaji,"implementation, strings",900,9789,0,https://codeforces.com/problemset/problem/1008/A
+1007E,Mini Metro,dp,3400,70,0,https://codeforces.com/problemset/problem/1007/E
+1007D,Ants,"2-sat, data structures, trees",3200,100,0,https://codeforces.com/problemset/problem/1007/D
+1007C,Guess two numbers,"binary search, interactive",3000,192,0,https://codeforces.com/problemset/problem/1007/C
+1007B,Pave the Parallelepiped,"bitmasks, brute force, combinatorics, math, number theory",2400,700,0,https://codeforces.com/problemset/problem/1007/B
+1007A,Reorder the Array,"combinatorics, data structures, math, sortings, two pointers",1300,8451,0,https://codeforces.com/problemset/problem/1007/A
+1006F,Xor-Paths,"bitmasks, brute force, dp, meet-in-the-middle",2100,2047,0,https://codeforces.com/problemset/problem/1006/F
+1006E,Military Problem,"dfs and similar, graphs, trees",1600,5323,0,https://codeforces.com/problemset/problem/1006/E
+1006D,Two Strings Swaps,implementation,1700,4123,0,https://codeforces.com/problemset/problem/1006/D
+1006C,Three Parts of the Array,"binary search, data structures, two pointers",1200,10598,0,https://codeforces.com/problemset/problem/1006/C
+1006B,Polycarp's Practice,"greedy, implementation, sortings",1200,8410,0,https://codeforces.com/problemset/problem/1006/B
+1006A,Adjacent Replacements,implementation,800,15110,0,https://codeforces.com/problemset/problem/1006/A
+1005F,Berland and the Shortest Paths,"brute force, dfs and similar, graphs, shortest paths",2100,829,0,https://codeforces.com/problemset/problem/1005/F
+1005E2,Median on Segments (General Case Edition),sortings,2400,674,0,https://codeforces.com/problemset/problem/1005/E2
+1005E1,Median on Segments (Permutations Edition),sortings,1800,2340,0,https://codeforces.com/problemset/problem/1005/E1
+1005D,Polycarp and Div 3,"dp, greedy, number theory",1500,6114,0,https://codeforces.com/problemset/problem/1005/D
+1005C,Summarize to the Power of Two,"brute force, greedy, implementation",1300,6902,0,https://codeforces.com/problemset/problem/1005/C
+1005B,Delete from the Left,"brute force, implementation, strings",900,11484,0,https://codeforces.com/problemset/problem/1005/B
+1005A,Tanya and Stairways,implementation,800,14919,0,https://codeforces.com/problemset/problem/1005/A
+1004F,Sonya and Bitwise OR,"bitmasks, data structures, divide and conquer",2600,245,0,https://codeforces.com/problemset/problem/1004/F
+1004E,Sonya and Ice Cream,"binary search, data structures, dp, greedy, shortest paths, trees",2400,596,0,https://codeforces.com/problemset/problem/1004/E
+1004D,Sonya and Matrix,"brute force, constructive algorithms, implementation",2300,990,0,https://codeforces.com/problemset/problem/1004/D
+1004C,Sonya and Robots,"constructive algorithms, implementation",1400,5635,0,https://codeforces.com/problemset/problem/1004/C
+1004B,Sonya and Exhibition,"constructive algorithms, greedy, implementation, math",1300,6871,0,https://codeforces.com/problemset/problem/1004/B
+1004A,Sonya and Hotels,implementation,900,8426,0,https://codeforces.com/problemset/problem/1004/A
+1003F,Abbreviation,"dp, hashing, strings",2200,639,0,https://codeforces.com/problemset/problem/1003/F
+1003E,Tree Constructing,"constructive algorithms, graphs",2100,1556,0,https://codeforces.com/problemset/problem/1003/E
+1003D,Coins and Queries,greedy,1600,4754,0,https://codeforces.com/problemset/problem/1003/D
+1003C,Intense Heat,"brute force, implementation, math",1300,6714,0,https://codeforces.com/problemset/problem/1003/C
+1003B,Binary String Constructing,constructive algorithms,1300,7080,0,https://codeforces.com/problemset/problem/1003/B
+1003A,Polycarp's Pockets,implementation,800,16008,0,https://codeforces.com/problemset/problem/1003/A
+1002E2,Another array reconstruction algorithm,,1900,181,0,https://codeforces.com/problemset/problem/1002/E2
+1002E1,Bernstein-Vazirani algorithm,,1500,294,0,https://codeforces.com/problemset/problem/1002/E1
+1002D3,Oracle for majority function,,1600,303,0,https://codeforces.com/problemset/problem/1002/D3
+1002D2,Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2,,1300,338,0,https://codeforces.com/problemset/problem/1002/D2
+1002D1,Oracle for f(x) = b * x mod 2,,1200,361,0,https://codeforces.com/problemset/problem/1002/D1
+1002C2,Distinguish zero state and plus state without errors,,1800,241,0,https://codeforces.com/problemset/problem/1002/C2
+1002C1,Distinguish zero state and plus state with minimum error,,1700,272,0,https://codeforces.com/problemset/problem/1002/C1
+1002B4,Distinguish four 2-qubit states - 2,,1700,278,0,https://codeforces.com/problemset/problem/1002/B4
+1002B3,Distinguish four 2-qubit states,,1600,378,0,https://codeforces.com/problemset/problem/1002/B3
+1002B2,Distinguish GHZ state and W state,,1600,408,0,https://codeforces.com/problemset/problem/1002/B2
+1002B1,Distinguish zero state and W state,,1300,435,0,https://codeforces.com/problemset/problem/1002/B1
+1002A4,Generate W state,,1900,237,0,https://codeforces.com/problemset/problem/1002/A4
+1002A3,Generate superposition of two basis states,,1500,432,0,https://codeforces.com/problemset/problem/1002/A3
+1002A2,Generate superposition of zero state and a basis state,,1300,506,0,https://codeforces.com/problemset/problem/1002/A2
+1002A1,Generate superposition of all basis states,,800,609,0,https://codeforces.com/problemset/problem/1002/A1
+1001I,Deutsch-Jozsa algorithm,*special problem,1700,367,0,https://codeforces.com/problemset/problem/1001/I
+1001H,Oracle for f(x) = parity of the number of 1s in x,*special problem,1200,474,0,https://codeforces.com/problemset/problem/1001/H
+1001G,Oracle for f(x) = k-th element of x,*special problem,1400,491,0,https://codeforces.com/problemset/problem/1001/G
+1001F,Distinguish multi-qubit basis states,*special problem,1300,488,0,https://codeforces.com/problemset/problem/1001/F
+1001E,Distinguish Bell states,*special problem,1600,511,0,https://codeforces.com/problemset/problem/1001/E
+1001D,Distinguish plus state and minus state,*special problem,1400,630,0,https://codeforces.com/problemset/problem/1001/D
+1001C,Generate GHZ state,*special problem,1400,599,0,https://codeforces.com/problemset/problem/1001/C
+1001B,Generate Bell state,*special problem,1400,654,0,https://codeforces.com/problemset/problem/1001/B
+1001A,Generate plus state or minus state,*special problem,1100,896,0,https://codeforces.com/problemset/problem/1001/A
+1000G,Two-Paths,"data structures, dp, trees",2700,207,0,https://codeforces.com/problemset/problem/1000/G
+1000F,One Occurrence,"data structures, divide and conquer",2400,1227,0,https://codeforces.com/problemset/problem/1000/F
+1000E,We Need More Bosses,"dfs and similar, graphs, trees",2100,1624,0,https://codeforces.com/problemset/problem/1000/E
+1000D,Yet Another Problem On a Subsequence,"combinatorics, dp",1900,2427,0,https://codeforces.com/problemset/problem/1000/D
+1000C,Covered Points Count,"data structures, implementation, sortings",1700,3918,0,https://codeforces.com/problemset/problem/1000/C
+1000B,Light It Up,greedy,1500,3819,0,https://codeforces.com/problemset/problem/1000/B
+1000A,Codehorses T-shirts,"greedy, implementation",1200,6699,0,https://codeforces.com/problemset/problem/1000/A
+999F,Cards and Joy,dp,2000,1367,0,https://codeforces.com/problemset/problem/999/F
+999E,Reachability from the Capital,"dfs and similar, graphs, greedy",2000,3497,0,https://codeforces.com/problemset/problem/999/E
+999D,Equalize the Remainders,"data structures, greedy, implementation",1900,2535,0,https://codeforces.com/problemset/problem/999/D
+999C,Alphabetic Removals,implementation,1200,8837,0,https://codeforces.com/problemset/problem/999/C
+999B,Reversing Encryption,implementation,900,10673,0,https://codeforces.com/problemset/problem/999/B
+999A,Mishka and Contest,"brute force, implementation",800,13811,0,https://codeforces.com/problemset/problem/999/A
+998B,Cutting,"dp, greedy, sortings",1200,8125,0,https://codeforces.com/problemset/problem/998/B
+998A,Balloons,"constructive algorithms, implementation",1000,7095,0,https://codeforces.com/problemset/problem/998/A
+997E,Good Subsegments,data structures,3000,267,0,https://codeforces.com/problemset/problem/997/E
+997D,Cycles in product,"combinatorics, divide and conquer, trees",2900,233,0,https://codeforces.com/problemset/problem/997/D
+997C,Sky Full of Stars,"combinatorics, math",2500,789,0,https://codeforces.com/problemset/problem/997/C
+997B,Roman Digits,"brute force, combinatorics, dp, greedy, math",2000,2299,0,https://codeforces.com/problemset/problem/997/B
+997A,Convert to Ones,"brute force, greedy, implementation, math",1500,6226,0,https://codeforces.com/problemset/problem/997/A
+996B,World Cup,"binary search, math",1300,5956,0,https://codeforces.com/problemset/problem/996/B
+996A,Hit the Lottery,"dp, greedy",800,29013,0,https://codeforces.com/problemset/problem/996/A
+995F,Cowmpany Cowmpensation,"combinatorics, dp, math, trees",2700,431,0,https://codeforces.com/problemset/problem/995/F
+995E,Number Clicker,"divide and conquer, graphs, meet-in-the-middle, number theory",2700,335,0,https://codeforces.com/problemset/problem/995/E
+995D,Game,math,2500,518,0,https://codeforces.com/problemset/problem/995/D
+995C,Leaving the Bar,"brute force, data structures, geometry, greedy, math, sortings",2300,1195,0,https://codeforces.com/problemset/problem/995/C
+995B,Suit and Tie,"greedy, implementation, math",1400,5439,0,https://codeforces.com/problemset/problem/995/B
+995A,Tesla,"constructive algorithms, implementation",2100,1171,0,https://codeforces.com/problemset/problem/995/A
+994B,Knights of a Polygonal Table,"greedy, implementation, sortings",1400,4248,0,https://codeforces.com/problemset/problem/994/B
+994A,Fingerprints,implementation,800,10284,0,https://codeforces.com/problemset/problem/994/A
+993F,The Moral Dilemma,,3200,28,0,https://codeforces.com/problemset/problem/993/F
+993E,Nikita and Order Statistics,"chinese remainder theorem, fft, math",2300,791,0,https://codeforces.com/problemset/problem/993/E
+993D,Compute Power,"binary search, dp, greedy",2500,437,0,https://codeforces.com/problemset/problem/993/D
+993C,Careful Maneuvering,"bitmasks, brute force, geometry",2100,1138,0,https://codeforces.com/problemset/problem/993/C
+993B,Open Communication,"bitmasks, brute force",1900,1617,0,https://codeforces.com/problemset/problem/993/B
+993A,Two Squares,"geometry, implementation",1600,3080,0,https://codeforces.com/problemset/problem/993/A
+992E,Nastya and King-Shamans,"binary search, data structures",2500,627,0,https://codeforces.com/problemset/problem/992/E
+992D,Nastya and a Game,"brute force, implementation, math",2100,1265,0,https://codeforces.com/problemset/problem/992/D
+992C,Nastya and a Wardrobe,math,1600,3744,0,https://codeforces.com/problemset/problem/992/C
+992B,Nastya Studies Informatics,"math, number theory",1600,4560,0,https://codeforces.com/problemset/problem/992/B
+992A,Nastya and an Array,"implementation, sortings",800,9089,0,https://codeforces.com/problemset/problem/992/A
+991F,Concise and clear,"brute force, greedy, implementation, math",2700,204,0,https://codeforces.com/problemset/problem/991/F
+991E,Bus Number,"brute force, combinatorics, math",1800,2307,0,https://codeforces.com/problemset/problem/991/E
+991D,Bishwock,"dp, greedy",1500,5144,0,https://codeforces.com/problemset/problem/991/D
+991C,Candies,"binary search, implementation",1500,6307,0,https://codeforces.com/problemset/problem/991/C
+991B,Getting an A,"greedy, sortings",900,8149,0,https://codeforces.com/problemset/problem/991/B
+991A,If at first you don't succeed...,implementation,1000,8106,0,https://codeforces.com/problemset/problem/991/A
+990G,GCD Counting,"divide and conquer, dp, dsu, number theory, trees",2400,817,0,https://codeforces.com/problemset/problem/990/G
+990F,Flow Control,"dfs and similar, dp, greedy, trees",2400,562,0,https://codeforces.com/problemset/problem/990/F
+990E,Post Lamps,"brute force, greedy",2100,1516,0,https://codeforces.com/problemset/problem/990/E
+990D,Graph And Its Complement,"constructive algorithms, graphs, implementation",1700,2827,0,https://codeforces.com/problemset/problem/990/D
+990C,Bracket Sequences Concatenation Problem,implementation,1500,4582,0,https://codeforces.com/problemset/problem/990/C
+990B,Micro-World,"greedy, sortings",1200,6343,0,https://codeforces.com/problemset/problem/990/B
+990A,Commentary Boxes,"implementation, math",1000,8225,0,https://codeforces.com/problemset/problem/990/A
+989E,A Trance of Nightfall,"dp, geometry, matrices, probabilities",2700,170,0,https://codeforces.com/problemset/problem/989/E
+989D,A Shade of Moonlight,"binary search, geometry, math, sortings, two pointers",2500,408,0,https://codeforces.com/problemset/problem/989/D
+989C,A Mist of Florescence,"constructive algorithms, graphs",1800,2806,0,https://codeforces.com/problemset/problem/989/C
+989B,A Tide of Riverscape,"constructive algorithms, strings",1200,5749,0,https://codeforces.com/problemset/problem/989/B
+989A,A Blend of Springtime,"implementation, strings",900,7707,0,https://codeforces.com/problemset/problem/989/A
+988F,Rain and Umbrellas,dp,2100,1285,0,https://codeforces.com/problemset/problem/988/F
+988E,Divisibility by 25,"brute force, greedy",2100,2274,0,https://codeforces.com/problemset/problem/988/E
+988D,Points and Powers of Two,"brute force, math",1800,4090,0,https://codeforces.com/problemset/problem/988/D
+988C,Equal Sums,"implementation, sortings",1400,6198,0,https://codeforces.com/problemset/problem/988/C
+988B,Substrings Sort,"sortings, strings",1100,10367,0,https://codeforces.com/problemset/problem/988/B
+988A,Diverse Team,"brute force, implementation",800,14113,0,https://codeforces.com/problemset/problem/988/A
+987C,Three displays,"brute force, dp, implementation",1400,7635,0,https://codeforces.com/problemset/problem/987/C
+987B,High School: Become Human,math,1100,8594,0,https://codeforces.com/problemset/problem/987/B
+987A,Infinity Gauntlet,implementation,800,11838,0,https://codeforces.com/problemset/problem/987/A
+986F,Oppa Funcan Style Remastered,"graphs, math, number theory, shortest paths",3300,177,0,https://codeforces.com/problemset/problem/986/F
+986E,Prince's Problem,"brute force, data structures, math, number theory, trees",2800,373,0,https://codeforces.com/problemset/problem/986/E
+986D,Perfect Encoding,"fft, math",3100,209,0,https://codeforces.com/problemset/problem/986/D
+986C,AND Graph,"bitmasks, dfs and similar, dsu, graphs",2500,1328,0,https://codeforces.com/problemset/problem/986/C
+986B,Petr and Permutations,"combinatorics, math",1800,3368,0,https://codeforces.com/problemset/problem/986/B
+986A,Fair,"graphs, greedy, number theory, shortest paths",1600,4320,0,https://codeforces.com/problemset/problem/986/A
+985G,Team Players,combinatorics,2700,198,0,https://codeforces.com/problemset/problem/985/G
+985F,Isomorphic Strings,"hashing, strings",2300,883,0,https://codeforces.com/problemset/problem/985/F
+985E,Pencils and Boxes,"binary search, data structures, dp, greedy, two pointers",2100,1971,0,https://codeforces.com/problemset/problem/985/E
+985D,Sand Fortress,"binary search, constructive algorithms, math",2100,1593,0,https://codeforces.com/problemset/problem/985/D
+985C,Liebig's Barrels,greedy,1500,4595,0,https://codeforces.com/problemset/problem/985/C
+985B,Switches and Lamps,implementation,1200,6033,0,https://codeforces.com/problemset/problem/985/B
+985A,Chess Placing,implementation,1100,6880,0,https://codeforces.com/problemset/problem/985/A
+984B,Minesweeper,implementation,1100,5966,0,https://codeforces.com/problemset/problem/984/B
+984A,Game,sortings,800,12487,0,https://codeforces.com/problemset/problem/984/A
+983E,NN country,"binary search, data structures, trees",2800,390,0,https://codeforces.com/problemset/problem/983/E
+983D,Arkady and Rectangles,data structures,3300,144,0,https://codeforces.com/problemset/problem/983/D
+983C,Elevator,"dp, graphs, shortest paths",2400,678,0,https://codeforces.com/problemset/problem/983/C
+983B,XOR-pyramid,dp,1800,3515,0,https://codeforces.com/problemset/problem/983/B
+983A,Finite or not?,"implementation, math",1700,3790,0,https://codeforces.com/problemset/problem/983/A
+982F,The Meeting Place Cannot Be Changed,"dfs and similar, graphs",2700,124,0,https://codeforces.com/problemset/problem/982/F
+982E,Billiard,"geometry, number theory",2600,385,0,https://codeforces.com/problemset/problem/982/E
+982D,Shark,"brute force, data structures, dsu, trees",1900,1656,0,https://codeforces.com/problemset/problem/982/D
+982C,Cut 'em all!,"dfs and similar, dp, graphs, greedy, trees",1500,6266,0,https://codeforces.com/problemset/problem/982/C
+982B,Bus of Characters,"data structures, greedy, implementation",1300,5897,0,https://codeforces.com/problemset/problem/982/B
+982A,Row,"brute force, constructive algorithms",1200,7011,0,https://codeforces.com/problemset/problem/982/A
+981H,K Paths,"combinatorics, data structures, dp, fft, math",3100,150,0,https://codeforces.com/problemset/problem/981/H
+981G,Magic multisets,data structures,2500,413,0,https://codeforces.com/problemset/problem/981/G
+981F,Round Marriage,"binary search, graph matchings, greedy",2500,376,0,https://codeforces.com/problemset/problem/981/F
+981E,Addition on Segments,"bitmasks, data structures, divide and conquer, dp",2200,1210,0,https://codeforces.com/problemset/problem/981/E
+981D,Bookshelves,"bitmasks, dp, greedy",1900,2244,0,https://codeforces.com/problemset/problem/981/D
+981C,Useful Decomposition,"implementation, trees",1400,3597,0,https://codeforces.com/problemset/problem/981/C
+981B,Businessmen Problems,sortings,1000,5105,0,https://codeforces.com/problemset/problem/981/B
+981A,Antipalindrome,"brute force, implementation, strings",900,6509,0,https://codeforces.com/problemset/problem/981/A
+980F,Cactus to Tree,"dp, graphs, trees",2900,84,0,https://codeforces.com/problemset/problem/980/F
+980E,The Number Games,"data structures, greedy, trees",2200,1198,0,https://codeforces.com/problemset/problem/980/E
+980D,Perfect Groups,"dp, math, number theory",2100,1367,0,https://codeforces.com/problemset/problem/980/D
+980C,Posterized,"games, greedy",1700,3147,0,https://codeforces.com/problemset/problem/980/C
+980B,Marlin,constructive algorithms,1600,3866,0,https://codeforces.com/problemset/problem/980/B
+980A,Links and Pearls,"implementation, math",900,8486,0,https://codeforces.com/problemset/problem/980/A
+979E,Kuro and Topological Parity,dp,2400,277,0,https://codeforces.com/problemset/problem/979/E
+979D,Kuro and GCD and XOR and SUM,"binary search, bitmasks, brute force, data structures, dp, dsu, greedy, math, number theory, strings, trees",2200,1057,0,https://codeforces.com/problemset/problem/979/D
+979C,Kuro and Walking Route,"dfs and similar, trees",1600,4045,0,https://codeforces.com/problemset/problem/979/C
+979B,Treasure Hunt,greedy,1800,3415,0,https://codeforces.com/problemset/problem/979/B
+979A,"Pizza, Pizza, Pizza!!!",math,1000,9423,0,https://codeforces.com/problemset/problem/979/A
+978G,Petya's Exams,"greedy, implementation, sortings",1700,2662,0,https://codeforces.com/problemset/problem/978/G
+978F,Mentors,"binary search, data structures, implementation",1500,4836,0,https://codeforces.com/problemset/problem/978/F
+978E,Bus Video System,"combinatorics, math",1400,5626,0,https://codeforces.com/problemset/problem/978/E
+978D,Almost Arithmetic Progression,"brute force, implementation, math",1500,5019,0,https://codeforces.com/problemset/problem/978/D
+978C,Letters,"binary search, implementation, two pointers",1000,11722,0,https://codeforces.com/problemset/problem/978/C
+978B,File Name,"greedy, strings",800,17662,0,https://codeforces.com/problemset/problem/978/B
+978A,Remove Duplicates,implementation,800,13655,0,https://codeforces.com/problemset/problem/978/A
+977F,Consecutive Subsequence,dp,1700,7131,0,https://codeforces.com/problemset/problem/977/F
+977E,Cyclic Components,"dfs and similar, dsu, graphs",1500,8602,0,https://codeforces.com/problemset/problem/977/E
+977D,"Divide by three, multiply by two","dfs and similar, math, sortings",1400,9745,0,https://codeforces.com/problemset/problem/977/D
+977C,Less or Equal,sortings,1200,14020,0,https://codeforces.com/problemset/problem/977/C
+977B,Two-gram,"implementation, strings",900,16367,0,https://codeforces.com/problemset/problem/977/B
+977A,Wrong Subtraction,implementation,800,49883,0,https://codeforces.com/problemset/problem/977/A
+976F,Minimal k-covering,"flows, graphs",2500,310,0,https://codeforces.com/problemset/problem/976/F
+976E,Well played!,"greedy, sortings",2100,1532,0,https://codeforces.com/problemset/problem/976/E
+976D,Degree Set,"constructive algorithms, graphs, implementation",2500,460,0,https://codeforces.com/problemset/problem/976/D
+976C,Nested Segments,"greedy, implementation, sortings",1500,4678,0,https://codeforces.com/problemset/problem/976/C
+976B,Lara Croft and the New Game,"implementation, math",1300,4741,0,https://codeforces.com/problemset/problem/976/B
+976A,Minimum Binary Number,implementation,800,8271,0,https://codeforces.com/problemset/problem/976/A
+975E,Hag's Khashba,geometry,2600,249,0,https://codeforces.com/problemset/problem/975/E
+975D,Ghosts,"geometry, math",2000,1507,0,https://codeforces.com/problemset/problem/975/D
+975C,Valhalla Siege,binary search,1400,5467,0,https://codeforces.com/problemset/problem/975/C
+975B,Mancala,"brute force, implementation",1100,5490,0,https://codeforces.com/problemset/problem/975/B
+975A,Aramic script,"implementation, strings",900,6662,0,https://codeforces.com/problemset/problem/975/A
+967B,Watering System,"math, sortings",1000,4104,0,https://codeforces.com/problemset/problem/967/B
+967A,Mind the Gap,implementation,1100,3502,0,https://codeforces.com/problemset/problem/967/A
+965E,Short Code,"data structures, dp, greedy, strings, trees",2200,722,0,https://codeforces.com/problemset/problem/965/E
+965D,Single-use Stones,"binary search, flows, greedy, two pointers",1900,2119,0,https://codeforces.com/problemset/problem/965/D
+965C,Greedy Arkady,math,2000,1663,0,https://codeforces.com/problemset/problem/965/C
+965B,Battleship,implementation,1300,3570,0,https://codeforces.com/problemset/problem/965/B
+965A,Paper Airplanes,math,800,6878,0,https://codeforces.com/problemset/problem/965/A
+964B,Messages,math,1300,3574,0,https://codeforces.com/problemset/problem/964/B
+964A,Splits,math,800,6900,0,https://codeforces.com/problemset/problem/964/A
+963E,Circles of Waiting,math,3100,178,0,https://codeforces.com/problemset/problem/963/E
+963D,Frequency of String,"hashing, string suffix structures, strings",2500,755,0,https://codeforces.com/problemset/problem/963/D
+963C,Cutting Rectangle,"brute force, math, number theory",2600,406,0,https://codeforces.com/problemset/problem/963/C
+963B,Destruction of a Tree,"constructive algorithms, dfs and similar, dp, greedy, trees",2000,1817,0,https://codeforces.com/problemset/problem/963/B
+963A,Alternating Sum,"math, number theory",1800,2469,0,https://codeforces.com/problemset/problem/963/A
+962G,Visible Black Areas,"data structures, dsu, geometry, trees",2800,72,0,https://codeforces.com/problemset/problem/962/G
+962F,Simple Cycles Edges,"dfs and similar, graphs, trees",2400,577,0,https://codeforces.com/problemset/problem/962/F
+962E,"Byteland, Berland and Disputed Cities","constructive algorithms, greedy",2200,803,0,https://codeforces.com/problemset/problem/962/E
+962D,Merge Equals,"data structures, implementation",1600,4558,0,https://codeforces.com/problemset/problem/962/D
+962C,Make a Square,"brute force, implementation, math",1400,5732,0,https://codeforces.com/problemset/problem/962/C
+962B,Students in Railway Carriage,"constructive algorithms, greedy, implementation",1300,6016,0,https://codeforces.com/problemset/problem/962/B
+962A,Equator,implementation,1300,9418,0,https://codeforces.com/problemset/problem/962/A
+961G,Partitions,"combinatorics, math, number theory",2700,455,0,https://codeforces.com/problemset/problem/961/G
+961F,k-substrings,"binary search, hashing, string suffix structures",2700,286,0,https://codeforces.com/problemset/problem/961/F
+961E,Tufurama,data structures,1900,2283,0,https://codeforces.com/problemset/problem/961/E
+961D,Pair Of Lines,geometry,2000,2632,0,https://codeforces.com/problemset/problem/961/D
+961C,Chessboard,"bitmasks, brute force, implementation",1400,4130,0,https://codeforces.com/problemset/problem/961/C
+961B,Lecture Sleep,"data structures, dp, implementation, two pointers",1200,8095,0,https://codeforces.com/problemset/problem/961/B
+961A,Tetris,implementation,900,7835,0,https://codeforces.com/problemset/problem/961/A
+960H,Santa's Gift,"data structures, trees",3100,99,0,https://codeforces.com/problemset/problem/960/H
+960G,Bandit Blues,"combinatorics, dp, fft, math",2900,512,0,https://codeforces.com/problemset/problem/960/G
+960F,Pathwalks,"data structures, dp, graphs",2100,1606,0,https://codeforces.com/problemset/problem/960/F
+960E,Alternating Tree,"combinatorics, dfs and similar, divide and conquer, dp, probabilities, trees",2300,943,0,https://codeforces.com/problemset/problem/960/E
+960D,Full Binary Tree Queries,"brute force, implementation, trees",2100,1267,0,https://codeforces.com/problemset/problem/960/D
+960C,Subsequence Counting,"bitmasks, constructive algorithms, greedy, implementation",1700,2960,0,https://codeforces.com/problemset/problem/960/C
+960B,Minimize the error,"data structures, greedy, sortings",1500,4824,0,https://codeforces.com/problemset/problem/960/B
+960A,Check the string,implementation,1200,6118,0,https://codeforces.com/problemset/problem/960/A
+959F,Mahmoud and Ehab and yet another xor task,"bitmasks, dp, math, matrices",2400,807,0,https://codeforces.com/problemset/problem/959/F
+959E,Mahmoud and Ehab and the xor-MST,"bitmasks, dp, graphs, implementation, math",1900,2429,0,https://codeforces.com/problemset/problem/959/E
+959D,Mahmoud and Ehab and another array construction task,"constructive algorithms, greedy, math, number theory",1900,2157,0,https://codeforces.com/problemset/problem/959/D
+959C,Mahmoud and Ehab and the wrong algorithm,"constructive algorithms, trees",1500,4154,0,https://codeforces.com/problemset/problem/959/C
+959B,Mahmoud and Ehab and the message,"dsu, greedy, implementation",1200,6333,0,https://codeforces.com/problemset/problem/959/B
+959A,Mahmoud and Ehab and the even-odd game,"games, math",800,20901,0,https://codeforces.com/problemset/problem/959/A
+958F3,Lightsabers (hard),fft,2600,321,0,https://codeforces.com/problemset/problem/958/F3
+958F2,Lightsabers (medium),"binary search, two pointers",1800,866,0,https://codeforces.com/problemset/problem/958/F2
+958F1,Lightsabers (easy),implementation,1500,1218,0,https://codeforces.com/problemset/problem/958/F1
+958E3,Guard Duty (hard),geometry,2700,138,0,https://codeforces.com/problemset/problem/958/E3
+958E2,Guard Duty (medium),"binary search, dp, greedy, sortings",2200,419,0,https://codeforces.com/problemset/problem/958/E2
+958E1,Guard Duty (easy),"brute force, geometry, greedy, math",1600,1107,0,https://codeforces.com/problemset/problem/958/E1
+958D2,Hyperspace Jump (hard),,2700,56,0,https://codeforces.com/problemset/problem/958/D2
+958D1,Hyperspace Jump (easy),"expression parsing, math",1400,1496,0,https://codeforces.com/problemset/problem/958/D1
+958C3,Encryption (hard),"data structures, dp",2500,214,0,https://codeforces.com/problemset/problem/958/C3
+958C2,Encryption (medium),dp,2000,726,0,https://codeforces.com/problemset/problem/958/C2
+958C1,Encryption (easy),brute force,1200,1803,0,https://codeforces.com/problemset/problem/958/C1
+958B2,Maximum Control (medium),"data structures, dfs and similar, graphs, greedy, trees",2200,397,0,https://codeforces.com/problemset/problem/958/B2
+958B1,Maximum Control (easy),implementation,1000,2039,0,https://codeforces.com/problemset/problem/958/B1
+958A3,Death Stars (hard),,3100,29,0,https://codeforces.com/problemset/problem/958/A3
+958A2,Death Stars (medium),"hashing, strings",2000,664,0,https://codeforces.com/problemset/problem/958/A2
+958A1,Death Stars (easy),implementation,1400,1361,0,https://codeforces.com/problemset/problem/958/A1
+957A,Tritonic Iridescence,implementation,1300,4444,0,https://codeforces.com/problemset/problem/957/A
+955F,Heaps,"dp, trees",2600,120,0,https://codeforces.com/problemset/problem/955/F
+955E,Icicles,,2900,50,0,https://codeforces.com/problemset/problem/955/E
+955D,Scissors,"brute force, strings",2600,252,0,https://codeforces.com/problemset/problem/955/D
+955C,Sad powers,"binary search, math, number theory",2100,1613,0,https://codeforces.com/problemset/problem/955/C
+955B,Not simply beatiful strings,implementation,1400,3642,0,https://codeforces.com/problemset/problem/955/B
+955A,Feed the cat,"greedy, math",1100,5128,0,https://codeforces.com/problemset/problem/955/A
+954I,Yet Another String Matching Problem,"fft, math",2200,466,0,https://codeforces.com/problemset/problem/954/I
+954H,Path Counting,"combinatorics, dp",2500,258,0,https://codeforces.com/problemset/problem/954/H
+954G,Castle Defense,"binary search, data structures, greedy, two pointers",2000,1138,0,https://codeforces.com/problemset/problem/954/G
+954F,Runner's Problem,"dp, matrices, sortings",2100,618,0,https://codeforces.com/problemset/problem/954/F
+954E,Water Taps,"binary search, greedy, sortings",2000,1260,0,https://codeforces.com/problemset/problem/954/E
+954D,Fight Against Traffic,"dfs and similar, graphs, shortest paths",1600,3734,0,https://codeforces.com/problemset/problem/954/D
+954C,Matrix Walk,implementation,1700,2834,0,https://codeforces.com/problemset/problem/954/C
+954B,String Typing,"implementation, strings",1400,4931,0,https://codeforces.com/problemset/problem/954/B
+954A,Diagonal Walking,implementation,800,7443,0,https://codeforces.com/problemset/problem/954/A
+952G,Puzzling Language,constructive algorithms,2200,164,0,https://codeforces.com/problemset/problem/952/G
+952F,2 + 2 != 4,,2400,200,0,https://codeforces.com/problemset/problem/952/F
+952E,Cheese Board,,2000,445,0,https://codeforces.com/problemset/problem/952/E
+952D,I'm Feeling Lucky!,probabilities,1800,1851,0,https://codeforces.com/problemset/problem/952/D
+952C,Ravioli Sort,implementation,1600,2327,0,https://codeforces.com/problemset/problem/952/C
+952B,A Map of the Cat,"brute force, interactive",1900,1593,0,https://codeforces.com/problemset/problem/952/B
+952A,Quirky Quantifiers,math,800,8494,0,https://codeforces.com/problemset/problem/952/A
+950B,Intercepted Message,"greedy, implementation",1100,6041,0,https://codeforces.com/problemset/problem/950/B
+950A,"Left-handers, Right-handers and Ambidexters","implementation, math",800,9988,0,https://codeforces.com/problemset/problem/950/A
+949F,Astronomy,"geometry, probabilities",3300,31,0,https://codeforces.com/problemset/problem/949/F
+949E,Binary Cards,brute force,2700,310,0,https://codeforces.com/problemset/problem/949/E
+949D,Curfew,"binary search, brute force, greedy, sortings",2300,619,0,https://codeforces.com/problemset/problem/949/D
+949C,Data Center Maintenance,"dfs and similar, graphs",1900,1382,0,https://codeforces.com/problemset/problem/949/C
+949B,A Leapfrog in the Array,"constructive algorithms, math",1700,2976,0,https://codeforces.com/problemset/problem/949/B
+949A,Zebras,greedy,1600,4135,0,https://codeforces.com/problemset/problem/949/A
+948A,Protect Sheep,"brute force, dfs and similar, graphs, implementation",900,8099,0,https://codeforces.com/problemset/problem/948/A
+946G,Almost Increasing Array,"data structures, dp",2500,300,0,https://codeforces.com/problemset/problem/946/G
+946F,Fibonacci String Subsequences,"combinatorics, dp, matrices",2400,315,0,https://codeforces.com/problemset/problem/946/F
+946E,Largest Beautiful Number,"greedy, implementation",2200,759,0,https://codeforces.com/problemset/problem/946/E
+946D,Timetable,dp,1800,2845,0,https://codeforces.com/problemset/problem/946/D
+946C,String Transformation,"greedy, strings",1300,6574,0,https://codeforces.com/problemset/problem/946/C
+946B,Weird Subtraction Process,"math, number theory",1100,7947,0,https://codeforces.com/problemset/problem/946/B
+946A,Partition,greedy,800,10839,0,https://codeforces.com/problemset/problem/946/A
+940F,Machine Learning,"brute force, data structures",2600,734,0,https://codeforces.com/problemset/problem/940/F
+940E,Cashback,"data structures, dp, greedy, math",2000,1938,0,https://codeforces.com/problemset/problem/940/E
+940D,Alena And The Heater,"binary search, implementation",1600,2878,0,https://codeforces.com/problemset/problem/940/D
+940C,Phone Numbers,"constructive algorithms, implementation, strings",1500,4225,0,https://codeforces.com/problemset/problem/940/C
+940B,Our Tanya is Crying Out Loud,"dp, greedy",1400,6184,0,https://codeforces.com/problemset/problem/940/B
+940A,Points on the line,"brute force, greedy, sortings",1200,6094,0,https://codeforces.com/problemset/problem/940/A
+939F,Cutlet,"data structures, dp",2400,359,0,https://codeforces.com/problemset/problem/939/F
+939E,Maximize!,"binary search, greedy, ternary search, two pointers",1800,2084,0,https://codeforces.com/problemset/problem/939/E
+939D,Love Rescue,"dfs and similar, dsu, graphs, greedy, strings",1600,4479,0,https://codeforces.com/problemset/problem/939/D
+939C,Convenient For Everybody,"binary search, two pointers",1600,3746,0,https://codeforces.com/problemset/problem/939/C
+939B,Hamster Farm,implementation,1000,7701,0,https://codeforces.com/problemset/problem/939/B
+939A,Love Triangle,graphs,800,12797,0,https://codeforces.com/problemset/problem/939/A
+938G,Shortest Path Queries,"bitmasks, data structures, dsu, graphs",2900,285,0,https://codeforces.com/problemset/problem/938/G
+938F,Erasing Substrings,"bitmasks, dp, greedy",2700,277,0,https://codeforces.com/problemset/problem/938/F
+938E,Max History,"combinatorics, math",2300,741,0,https://codeforces.com/problemset/problem/938/E
+938D,Buy a Ticket,"data structures, graphs, shortest paths",2000,2583,0,https://codeforces.com/problemset/problem/938/D
+938C,Constructing Tests,"binary search, brute force, constructive algorithms",1700,2566,0,https://codeforces.com/problemset/problem/938/C
+938B,Run For Your Prize,"brute force, greedy",1100,6975,0,https://codeforces.com/problemset/problem/938/B
+938A,Word Correction,implementation,800,8803,0,https://codeforces.com/problemset/problem/938/A
+937B,Vile Grasshoppers,"brute force, math, number theory",1400,5433,0,https://codeforces.com/problemset/problem/937/B
+937A,Olympiad,"implementation, sortings",800,10381,0,https://codeforces.com/problemset/problem/937/A
+936E,Iqea,"data structures, dfs and similar, divide and conquer, dsu, shortest paths, trees",3400,115,0,https://codeforces.com/problemset/problem/936/E
+936D,World of Tank,"dp, greedy",3000,141,0,https://codeforces.com/problemset/problem/936/D
+936C,Lock Puzzle,"constructive algorithms, implementation, strings",2300,840,0,https://codeforces.com/problemset/problem/936/C
+936B,Sleepy Game,"dfs and similar, dp, games, graphs",2100,2275,0,https://codeforces.com/problemset/problem/936/B
+936A,Save Energy!,"binary search, implementation, math",1700,3694,0,https://codeforces.com/problemset/problem/936/A
+935F,Fafa and Array,"data structures, greedy",2600,216,0,https://codeforces.com/problemset/problem/935/F
+935E,Fafa and Ancient Mathematics,"dfs and similar, dp, trees",2300,647,0,https://codeforces.com/problemset/problem/935/E
+935D,Fafa and Ancient Alphabet,"math, probabilities",1900,1888,0,https://codeforces.com/problemset/problem/935/D
+935C,Fifa and Fafa,geometry,1600,3921,0,https://codeforces.com/problemset/problem/935/C
+935B,Fafa and the Gates,implementation,900,8364,0,https://codeforces.com/problemset/problem/935/B
+935A,Fafa and his Company,"brute force, implementation",800,21616,0,https://codeforces.com/problemset/problem/935/A
+934B,A Prosperous Lot,"constructive algorithms, implementation",1200,6714,0,https://codeforces.com/problemset/problem/934/B
+934A,A Compatible Pair,"brute force, games",1400,5168,0,https://codeforces.com/problemset/problem/934/A
+933E,A Preponderant Reunion,"constructive algorithms, dp",3200,102,0,https://codeforces.com/problemset/problem/933/E
+933D,A Creative Cutout,"brute force, combinatorics, math",2900,170,0,https://codeforces.com/problemset/problem/933/D
+933C,A Colourful Prospect,"geometry, graphs",2700,411,0,https://codeforces.com/problemset/problem/933/C
+933B,A Determined Cleanup,math,2000,1576,0,https://codeforces.com/problemset/problem/933/B
+933A,A Twisty Movement,dp,1800,3342,0,https://codeforces.com/problemset/problem/933/A
+932G,Palindrome Partition,"dp, string suffix structures, strings",2900,297,0,https://codeforces.com/problemset/problem/932/G
+932F,Escape Through Leaf,"data structures, dp, geometry",2700,842,0,https://codeforces.com/problemset/problem/932/F
+932E,Team Work,"combinatorics, dp, math",2400,1365,0,https://codeforces.com/problemset/problem/932/E
+932D,Tree,"binary search, dp, trees",2200,1136,0,https://codeforces.com/problemset/problem/932/D
+932C,Permutation Cycle,"brute force, constructive algorithms",1600,3319,0,https://codeforces.com/problemset/problem/932/C
+932B,Recursive Queries,"binary search, data structures, dfs and similar",1300,5740,0,https://codeforces.com/problemset/problem/932/B
+932A,Palindromic Supersequence,constructive algorithms,800,8141,0,https://codeforces.com/problemset/problem/932/A
+931C,Laboratory Work,"implementation, math",1700,2766,0,https://codeforces.com/problemset/problem/931/C
+931B,World Cup,"constructive algorithms, implementation",1200,5478,0,https://codeforces.com/problemset/problem/931/B
+931A,Friends Meeting,"brute force, greedy, implementation, math",800,8607,0,https://codeforces.com/problemset/problem/931/A
+930E,Coins Exhibition,"data structures, dp, math",2900,178,0,https://codeforces.com/problemset/problem/930/E
+930D,Game with Tokens,"data structures, games, implementation",2500,274,0,https://codeforces.com/problemset/problem/930/D
+930C,Teodor is not a liar!,"data structures, dp",1900,1375,0,https://codeforces.com/problemset/problem/930/C
+930B,Game with String,"implementation, probabilities, strings",1600,1998,0,https://codeforces.com/problemset/problem/930/B
+930A,Peculiar apple-tree,"dfs and similar, graphs, trees",1500,4733,0,https://codeforces.com/problemset/problem/930/A
+929D,Пограничные врата,,2400,134,0,https://codeforces.com/problemset/problem/929/D
+929C,Красивая команда,"*special problem, combinatorics, math",1700,1049,0,https://codeforces.com/problemset/problem/929/C
+929B,Места в самолёте,"*special problem, implementation",1300,1987,0,https://codeforces.com/problemset/problem/929/B
+929A,Прокат велосипедов,"*special problem, greedy, implementation",1400,2363,0,https://codeforces.com/problemset/problem/929/A
+928D,Autocompletion,"*special problem, strings, trees",1900,721,0,https://codeforces.com/problemset/problem/928/D
+928C,Dependency management,"*special problem, graphs, implementation",1900,830,0,https://codeforces.com/problemset/problem/928/C
+928B,Chat,"*special problem, dp",1400,1937,0,https://codeforces.com/problemset/problem/928/B
+928A,Login Verification,"*special problem, strings",1200,2693,0,https://codeforces.com/problemset/problem/928/A
+927A,BuberPool Taxi Optimization,,2900,1,0,https://codeforces.com/problemset/problem/927/A
+926J,Segments,data structures,2100,152,0,https://codeforces.com/problemset/problem/926/J
+926I,A Vital Problem,,1700,553,0,https://codeforces.com/problemset/problem/926/I
+926H,Endless Roses Most Beautiful,,2200,139,0,https://codeforces.com/problemset/problem/926/H
+926G,Large Bouquets,,1500,1069,0,https://codeforces.com/problemset/problem/926/G
+926F,Mobile Communications,,2000,81,0,https://codeforces.com/problemset/problem/926/F
+926E,Merge Equal Elements,"constructive algorithms, data structures",1900,572,0,https://codeforces.com/problemset/problem/926/E
+926D,Choose Place,,1600,733,0,https://codeforces.com/problemset/problem/926/D
+926C,Is This a Zebra?,,1700,1474,0,https://codeforces.com/problemset/problem/926/C
+926B,Add Points,,1800,1151,0,https://codeforces.com/problemset/problem/926/B
+926A,2-3-numbers,"implementation, math",1300,2434,0,https://codeforces.com/problemset/problem/926/A
+925F,Parametric Circulation,"binary search, flows",3100,52,0,https://codeforces.com/problemset/problem/925/F
+925E,May Holidays,"data structures, trees",2900,189,0,https://codeforces.com/problemset/problem/925/E
+925D,Aztec Catacombs,constructive algorithms,2600,361,0,https://codeforces.com/problemset/problem/925/D
+925C,Big Secret,"constructive algorithms, math",2200,942,0,https://codeforces.com/problemset/problem/925/C
+925B,Resource Distribution,"binary search, implementation, sortings",1700,1758,0,https://codeforces.com/problemset/problem/925/B
+925A,Stairs and Elevators,binary search,1600,2632,0,https://codeforces.com/problemset/problem/925/A
+924F,Minimal Subset Difference,dp,3200,48,0,https://codeforces.com/problemset/problem/924/F
+924E,Wardrobe,,2700,386,0,https://codeforces.com/problemset/problem/924/E
+924D,Contact ATC,,2500,683,0,https://codeforces.com/problemset/problem/924/D
+924C,Riverside Curio,"data structures, dp, greedy",1700,2939,0,https://codeforces.com/problemset/problem/924/C
+924B,Three-level Laser,"binary search, greedy, two pointers",1600,4293,0,https://codeforces.com/problemset/problem/924/B
+924A,Mystical Mosaic,"greedy, implementation",1300,4287,0,https://codeforces.com/problemset/problem/924/A
+923F,Public Service,"constructive algorithms, graphs, trees",3200,39,0,https://codeforces.com/problemset/problem/923/F
+923E,Perpetual Subtraction,"fft, math, matrices",3100,193,0,https://codeforces.com/problemset/problem/923/E
+923D,Picking Strings,"constructive algorithms, implementation, strings",2500,872,0,https://codeforces.com/problemset/problem/923/D
+923C,Perfect Security,"data structures, greedy, strings, trees",1800,3163,0,https://codeforces.com/problemset/problem/923/C
+923B,Producing Snow,"binary search, data structures",1600,5379,0,https://codeforces.com/problemset/problem/923/B
+923A,Primal Sport,"math, number theory",1700,4146,0,https://codeforces.com/problemset/problem/923/A
+922F,Divisibility,"constructive algorithms, dp, greedy, number theory",2400,431,0,https://codeforces.com/problemset/problem/922/F
+922E,Birds,dp,2200,1240,0,https://codeforces.com/problemset/problem/922/E
+922D,Robot Vacuum Cleaner,"greedy, sortings",1800,3147,0,https://codeforces.com/problemset/problem/922/D
+922C,Cave Painting,"brute force, number theory",1600,5301,0,https://codeforces.com/problemset/problem/922/C
+922B,Magic Forest,brute force,1300,6548,0,https://codeforces.com/problemset/problem/922/B
+922A,Cloning Toys,implementation,1300,7826,0,https://codeforces.com/problemset/problem/922/A
+920G,List Of Integers,"binary search, bitmasks, brute force, combinatorics, math, number theory",2200,1026,0,https://codeforces.com/problemset/problem/920/G
+920F,SUM and REPLACE,"brute force, data structures, dsu, number theory",2000,2818,0,https://codeforces.com/problemset/problem/920/F
+920E,Connected Components?,"data structures, dfs and similar, dsu, graphs",2100,2713,0,https://codeforces.com/problemset/problem/920/E
+920D,Tanks,"dp, greedy, implementation",2400,430,0,https://codeforces.com/problemset/problem/920/D
+920C,Swap Adjacent Elements,"dfs and similar, greedy, math, sortings, two pointers",1400,5759,0,https://codeforces.com/problemset/problem/920/C
+920B,Tea Queue,implementation,1200,5356,0,https://codeforces.com/problemset/problem/920/B
+920A,Water The Garden,implementation,1000,6297,0,https://codeforces.com/problemset/problem/920/A
+919F,A Game With Numbers,"games, graphs, shortest paths",2600,187,0,https://codeforces.com/problemset/problem/919/F
+919E,Congruence Equation,"chinese remainder theorem, math, number theory",2100,1251,0,https://codeforces.com/problemset/problem/919/E
+919D,Substring,"dfs and similar, dp, graphs",1700,4426,0,https://codeforces.com/problemset/problem/919/D
+919C,Seat Arrangements,"brute force, implementation",1300,6898,0,https://codeforces.com/problemset/problem/919/C
+919B,Perfect Number,"binary search, brute force, dp, implementation, number theory",1100,15321,0,https://codeforces.com/problemset/problem/919/B
+919A,Supermarket,"brute force, greedy, implementation",800,11833,0,https://codeforces.com/problemset/problem/919/A
+918B,Radio Station,"implementation, strings",900,8935,0,https://codeforces.com/problemset/problem/918/B
+918A,Eleven,"brute force, implementation",800,11843,0,https://codeforces.com/problemset/problem/918/A
+917E,Upside Down,"data structures, string suffix structures, strings, trees",3400,66,0,https://codeforces.com/problemset/problem/917/E
+917D,Stranger Trees,"dp, math, matrices, trees",2600,388,0,https://codeforces.com/problemset/problem/917/D
+917C,Pollywog,"combinatorics, dp, matrices",2900,212,0,https://codeforces.com/problemset/problem/917/C
+917B,MADMAX,"dfs and similar, dp, games, graphs",1700,2580,0,https://codeforces.com/problemset/problem/917/B
+917A,The Monster,"dp, greedy, implementation, math",1800,2877,0,https://codeforces.com/problemset/problem/917/A
+916E,Jamie and Tree,"data structures, trees",2400,640,0,https://codeforces.com/problemset/problem/916/E
+916D,Jamie and To-do List,"data structures, interactive, trees",2200,286,0,https://codeforces.com/problemset/problem/916/D
+916C,Jamie and Interesting Graph,"constructive algorithms, graphs, shortest paths",1600,3643,0,https://codeforces.com/problemset/problem/916/C
+916B,Jamie and Binary Sequence (changed after round),"bitmasks, greedy, math",2000,1321,0,https://codeforces.com/problemset/problem/916/B
+916A,Jamie and Alarm Snooze,"brute force, implementation, math",900,6978,0,https://codeforces.com/problemset/problem/916/A
+915G,Coprime Arrays,"math, number theory",2300,606,0,https://codeforces.com/problemset/problem/915/G
+915F,Imbalance Value of a Tree,"data structures, dsu, graphs, trees",2400,1005,0,https://codeforces.com/problemset/problem/915/F
+915E,Physical Education Lessons,"data structures, implementation, sortings",2300,1518,0,https://codeforces.com/problemset/problem/915/E
+915D,Almost Acyclic Graph,"dfs and similar, graphs",2200,1996,0,https://codeforces.com/problemset/problem/915/D
+915C,Permute Digits,"dp, greedy",1700,4883,0,https://codeforces.com/problemset/problem/915/C
+915B,Browser,implementation,1300,6408,0,https://codeforces.com/problemset/problem/915/B
+915A,Garden,implementation,900,10401,0,https://codeforces.com/problemset/problem/915/A
+914H,Ember and Storm's Tree Game,"combinatorics, dp, games, trees",3400,69,0,https://codeforces.com/problemset/problem/914/H
+914G,Sum the Fibonacci,"bitmasks, divide and conquer, dp, fft, math",2600,459,0,https://codeforces.com/problemset/problem/914/G
+914F,Substrings in a String,"bitmasks, brute force, data structures, string suffix structures, strings",3000,479,0,https://codeforces.com/problemset/problem/914/F
+914E,Palindromes in a Tree,"bitmasks, data structures, divide and conquer, trees",2400,696,0,https://codeforces.com/problemset/problem/914/E
+914D,Bash and a Tough Math Puzzle,"data structures, number theory",1900,2884,0,https://codeforces.com/problemset/problem/914/D
+914C,Travelling Salesman and Special Numbers,"brute force, combinatorics, dp",1800,2653,0,https://codeforces.com/problemset/problem/914/C
+914B,Conan and Agasa play a Card Game,"games, greedy, implementation",1200,6603,0,https://codeforces.com/problemset/problem/914/B
+914A,Perfect Squares,"brute force, implementation, math",900,9691,0,https://codeforces.com/problemset/problem/914/A
+913H,Don't Exceed,"math, probabilities",3400,70,0,https://codeforces.com/problemset/problem/913/H
+913G,Power Substring,"math, number theory",3200,116,0,https://codeforces.com/problemset/problem/913/G
+913F,Strongly Connected Tournament,"dp, graphs, math, probabilities",2800,331,0,https://codeforces.com/problemset/problem/913/F
+913E,Logical Expression,"bitmasks, dp, shortest paths",2400,578,0,https://codeforces.com/problemset/problem/913/E
+913D,Too Easy Problems,"binary search, brute force, data structures, greedy, sortings",1800,3455,0,https://codeforces.com/problemset/problem/913/D
+913C,Party Lemonade,"bitmasks, dp, greedy",1600,5763,0,https://codeforces.com/problemset/problem/913/C
+913B,Christmas Spruce,"implementation, trees",1200,9839,0,https://codeforces.com/problemset/problem/913/B
+913A,Modular Exponentiation,"implementation, math",900,13711,0,https://codeforces.com/problemset/problem/913/A
+912E,Prime Gift,"binary search, dfs and similar, math, meet-in-the-middle, number theory, two pointers",2400,824,0,https://codeforces.com/problemset/problem/912/E
+912D,Fishes,"data structures, graphs, greedy, probabilities, shortest paths",2100,1373,0,https://codeforces.com/problemset/problem/912/D
+912C,"Perun, Ult!","brute force, greedy, sortings",2500,430,0,https://codeforces.com/problemset/problem/912/C
+912B,New Year's Eve,"bitmasks, constructive algorithms, number theory",1300,6805,0,https://codeforces.com/problemset/problem/912/B
+912A,Tricky Alchemy,implementation,800,9993,0,https://codeforces.com/problemset/problem/912/A
+911G,Mass Change Queries,data structures,2500,799,0,https://codeforces.com/problemset/problem/911/G
+911F,Tree Destruction,"constructive algorithms, dfs and similar, graphs, greedy, trees",2400,733,0,https://codeforces.com/problemset/problem/911/F
+911E,Stack Sorting,"constructive algorithms, data structures, greedy, implementation",2000,1742,0,https://codeforces.com/problemset/problem/911/E
+911D,Inversion Counting,"brute force, math",1800,3117,0,https://codeforces.com/problemset/problem/911/D
+911C,Three Garlands,"brute force, constructive algorithms",1400,5440,0,https://codeforces.com/problemset/problem/911/C
+911B,Two Cakes,"binary search, brute force, implementation",1200,7653,0,https://codeforces.com/problemset/problem/911/B
+911A,Nearest Minimums,implementation,1100,8425,0,https://codeforces.com/problemset/problem/911/A
+910C,Minimum Sum,"constructive algorithms, greedy, math",1700,1179,0,https://codeforces.com/problemset/problem/910/C
+910B,Door Frames,"greedy, implementation",1600,1251,0,https://codeforces.com/problemset/problem/910/B
+910A,The Way to Home,"dfs and similar, dp, greedy, implementation",800,5540,0,https://codeforces.com/problemset/problem/910/A
+909F,AND-permutations,constructive algorithms,2500,364,0,https://codeforces.com/problemset/problem/909/F
+909E,Coprocessor,"dfs and similar, dp, graphs, greedy",1900,1145,0,https://codeforces.com/problemset/problem/909/E
+909D,Colorful Points,"data structures, greedy, implementation",2100,1260,0,https://codeforces.com/problemset/problem/909/D
+909C,Python Indentation,dp,1800,3185,0,https://codeforces.com/problemset/problem/909/C
+909B,Segments,"constructive algorithms, math",1300,5063,0,https://codeforces.com/problemset/problem/909/B
+909A,Generate Login,"brute force, greedy, sortings",1000,6923,0,https://codeforces.com/problemset/problem/909/A
+908H,New Year and Boolean Bridges,,3100,195,0,https://codeforces.com/problemset/problem/908/H
+908G,New Year and Original Order,"dp, math",2800,562,0,https://codeforces.com/problemset/problem/908/G
+908F,New Year and Rainbow Roads,"graphs, greedy, implementation",2400,996,0,https://codeforces.com/problemset/problem/908/F
+908E,New Year and Entity Enumeration,"bitmasks, combinatorics, dp, math",2500,549,0,https://codeforces.com/problemset/problem/908/E
+908D,New Year and Arbitrary Arrangement,"dp, math, probabilities",2200,1531,0,https://codeforces.com/problemset/problem/908/D
+908C,New Year and Curling,"brute force, geometry, implementation, math",1500,5570,0,https://codeforces.com/problemset/problem/908/C
+908B,New Year and Buggy Bot,"brute force, implementation",1200,6698,0,https://codeforces.com/problemset/problem/908/B
+908A,New Year and Counting Cards,"brute force, implementation",800,11919,0,https://codeforces.com/problemset/problem/908/A
+907B,Tic-Tac-Toe,implementation,1400,3519,0,https://codeforces.com/problemset/problem/907/B
+907A,Masha and Bears,"brute force, implementation",1300,4769,0,https://codeforces.com/problemset/problem/907/A
+906E,Reverses,"dp, string suffix structures, strings",3300,155,0,https://codeforces.com/problemset/problem/906/E
+906D,Power Tower,"chinese remainder theorem, math, number theory",2700,707,0,https://codeforces.com/problemset/problem/906/D
+906C,Party,"bitmasks, brute force, dp, graphs",2400,859,0,https://codeforces.com/problemset/problem/906/C
+906B,Seating of Students,"brute force, constructive algorithms, math",2200,883,0,https://codeforces.com/problemset/problem/906/B
+906A,Shockers,"implementation, strings",1600,3531,0,https://codeforces.com/problemset/problem/906/A
+903G,Yet Another Maxflow Problem,"data structures, flows, graphs",2700,272,0,https://codeforces.com/problemset/problem/903/G
+903F,Clear The Matrix,"bitmasks, dp",2200,401,0,https://codeforces.com/problemset/problem/903/F
+903E,Swapping Characters,"brute force, hashing, implementation, strings",2200,898,0,https://codeforces.com/problemset/problem/903/E
+903D,Almost Difference,"data structures, math",2200,2538,0,https://codeforces.com/problemset/problem/903/D
+903C,Boxes Packing,greedy,1200,7553,0,https://codeforces.com/problemset/problem/903/C
+903B,The Modcrab,"greedy, implementation",1200,6031,0,https://codeforces.com/problemset/problem/903/B
+903A,Hungry Student Problem,"greedy, implementation",900,10227,0,https://codeforces.com/problemset/problem/903/A
+902B,Coloring a Tree,"dfs and similar, dsu, greedy",1200,6824,0,https://codeforces.com/problemset/problem/902/B
+902A,Visiting a Friend,"greedy, implementation",1100,7309,0,https://codeforces.com/problemset/problem/902/A
+901E,Cyclic Cipher,"fft, math",3300,48,0,https://codeforces.com/problemset/problem/901/E
+901D,Weighting a Tree,"constructive algorithms, dfs and similar, graphs",2700,255,0,https://codeforces.com/problemset/problem/901/D
+901C,Bipartite Segments,"binary search, data structures, dfs and similar, dsu, graphs, two pointers",2300,809,0,https://codeforces.com/problemset/problem/901/C
+901B,GCD of Polynomials,"constructive algorithms, math",2200,1185,0,https://codeforces.com/problemset/problem/901/B
+901A,Hashing Trees,"constructive algorithms, trees",1500,4191,0,https://codeforces.com/problemset/problem/901/A
+900E,Maximum Questions,"data structures, dp, strings",2100,706,0,https://codeforces.com/problemset/problem/900/E
+900D,Unusual Sequences,"bitmasks, combinatorics, dp, math, number theory",2000,1704,0,https://codeforces.com/problemset/problem/900/D
+900C,Remove Extra One,"brute force, data structures, math",1700,3125,0,https://codeforces.com/problemset/problem/900/C
+900B,Position in Fraction,"math, number theory",1300,5872,0,https://codeforces.com/problemset/problem/900/B
+900A,Find Extra One,"geometry, implementation",800,9485,0,https://codeforces.com/problemset/problem/900/A
+899F,Letters Removing,"data structures, strings",2100,1067,0,https://codeforces.com/problemset/problem/899/F
+899E,Segments Removal,"data structures, dsu, flows, implementation, two pointers",2000,1528,0,https://codeforces.com/problemset/problem/899/E
+899D,Shovel Sale,"constructive algorithms, math",1800,1917,0,https://codeforces.com/problemset/problem/899/D
+899C,Dividing the numbers,"constructive algorithms, graphs, math",1300,5669,0,https://codeforces.com/problemset/problem/899/C
+899B,Months and Years,implementation,1200,4609,0,https://codeforces.com/problemset/problem/899/B
+899A,Splitting in Teams,"constructive algorithms, greedy, math",800,7661,0,https://codeforces.com/problemset/problem/899/A
+898F,Restoring the Expression,"brute force, hashing, math",2300,704,0,https://codeforces.com/problemset/problem/898/F
+898E,Squares and not squares,"constructive algorithms, greedy",1600,3338,0,https://codeforces.com/problemset/problem/898/E
+898D,Alarm Clock,greedy,1600,2728,0,https://codeforces.com/problemset/problem/898/D
+898C,Phone Numbers,"implementation, strings",1400,3926,0,https://codeforces.com/problemset/problem/898/C
+898B,Proper Nutrition,"brute force, implementation, number theory",1100,6783,0,https://codeforces.com/problemset/problem/898/B
+898A,Rounding,"implementation, math",800,10702,0,https://codeforces.com/problemset/problem/898/A
+897B,Chtholly's request,brute force,1300,5709,0,https://codeforces.com/problemset/problem/897/B
+897A,Scarborough Fair,implementation,800,10310,0,https://codeforces.com/problemset/problem/897/A
+896E,"Welcome home, Chtholly","data structures, dsu",3100,372,0,https://codeforces.com/problemset/problem/896/E
+896D,Nephren Runs a Cinema,"chinese remainder theorem, combinatorics, math, number theory",2900,205,0,https://codeforces.com/problemset/problem/896/D
+896C,"Willem, Chtholly and Seniorious","data structures, probabilities",2600,889,0,https://codeforces.com/problemset/problem/896/C
+896B,Ithea Plays With Chtholly,"binary search, constructive algorithms, games, greedy, interactive",2000,1495,0,https://codeforces.com/problemset/problem/896/B
+896A,Nephren gives a riddle,"binary search, dfs and similar",1700,2820,0,https://codeforces.com/problemset/problem/896/A
+895E,Eyes Closed,"data structures, probabilities",2300,535,0,https://codeforces.com/problemset/problem/895/E
+895D,String Mark,"combinatorics, math, strings",2100,768,0,https://codeforces.com/problemset/problem/895/D
+895C,Square Subsets,"bitmasks, combinatorics, dp, math",2000,2250,0,https://codeforces.com/problemset/problem/895/C
+895B,XK Segments,"binary search, math, sortings, two pointers",1700,2686,0,https://codeforces.com/problemset/problem/895/B
+895A,Pizza Separation,"brute force, implementation",1200,5166,0,https://codeforces.com/problemset/problem/895/A
+894E,Ralph and Mushrooms,"dp, graphs",2100,1117,0,https://codeforces.com/problemset/problem/894/E
+894D,Ralph And His Tour in Binary Country,"brute force, data structures, trees",2200,841,0,https://codeforces.com/problemset/problem/894/D
+894C,Marco and GCD Sequence,"constructive algorithms, math",1900,3202,0,https://codeforces.com/problemset/problem/894/C
+894B,Ralph And His Magic Field,"combinatorics, constructive algorithms, math, number theory",1800,3402,0,https://codeforces.com/problemset/problem/894/B
+894A,QAQ,"brute force, dp",800,16652,0,https://codeforces.com/problemset/problem/894/A
+893F,Subtree Minimum Query,"data structures, trees",2300,815,0,https://codeforces.com/problemset/problem/893/F
+893E,Counting Arrays,"combinatorics, dp, math, number theory",2000,1744,0,https://codeforces.com/problemset/problem/893/E
+893D,Credit Card,"data structures, dp, greedy, implementation",1900,2075,0,https://codeforces.com/problemset/problem/893/D
+893C,Rumor,"dfs and similar, graphs, greedy",1300,9863,0,https://codeforces.com/problemset/problem/893/C
+893B,Beautiful Divisors,"brute force, implementation",1000,7043,0,https://codeforces.com/problemset/problem/893/B
+893A,Chess For Three,implementation,900,7554,0,https://codeforces.com/problemset/problem/893/A
+892B,Wrath,"greedy, implementation, two pointers",1200,6185,0,https://codeforces.com/problemset/problem/892/B
+892A,Greed,"greedy, implementation",900,9350,0,https://codeforces.com/problemset/problem/892/A
+891E,Lust,"combinatorics, math, matrices",3000,299,0,https://codeforces.com/problemset/problem/891/E
+891D,Sloth,"dfs and similar, dp, graph matchings, trees",3100,82,0,https://codeforces.com/problemset/problem/891/D
+891C,Envy,"data structures, dsu, graphs",2300,1075,0,https://codeforces.com/problemset/problem/891/C
+891B,Gluttony,"constructive algorithms, greedy",2000,2160,0,https://codeforces.com/problemset/problem/891/B
+891A,Pride,"brute force, dp, greedy, math, number theory",1500,6303,0,https://codeforces.com/problemset/problem/891/A
+889E,Mod Mod Mod,"binary search, dp, math",3000,179,0,https://codeforces.com/problemset/problem/889/E
+888G,Xor-MST,"bitmasks, constructive algorithms, data structures",2300,1205,0,https://codeforces.com/problemset/problem/888/G
+888F,Connecting Vertices,"dp, graphs",2500,339,0,https://codeforces.com/problemset/problem/888/F
+888E,Maximum Subsequence,"bitmasks, divide and conquer, meet-in-the-middle",1800,2976,0,https://codeforces.com/problemset/problem/888/E
+888D,Almost Identity Permutations,"combinatorics, dp, math",1600,3412,0,https://codeforces.com/problemset/problem/888/D
+888C,K-Dominant Character,"binary search, implementation, two pointers",1400,4904,0,https://codeforces.com/problemset/problem/888/C
+888B,Buggy Robot,greedy,1000,6581,0,https://codeforces.com/problemset/problem/888/B
+888A,Local Extrema,"brute force, implementation",800,7715,0,https://codeforces.com/problemset/problem/888/A
+887F,Row of Models,"greedy, sortings",2500,80,0,https://codeforces.com/problemset/problem/887/F
+887E,Little Brother,"binary search, geometry, sortings",2800,91,0,https://codeforces.com/problemset/problem/887/E
+887D,Ratings and Reality Shows,"data structures, two pointers",2400,389,0,https://codeforces.com/problemset/problem/887/D
+887C,Solution for Cube,"brute force, implementation",1500,2434,0,https://codeforces.com/problemset/problem/887/C
+887B,Cubes for Masha,"brute force, implementation",1300,4286,0,https://codeforces.com/problemset/problem/887/B
+887A,Div. 64,implementation,1000,8137,0,https://codeforces.com/problemset/problem/887/A
+886F,Symmetric Projections,geometry,2900,203,0,https://codeforces.com/problemset/problem/886/F
+886E,Maximum Element,"combinatorics, dp, math",2400,600,0,https://codeforces.com/problemset/problem/886/E
+886D,Restoration of string,"constructive algorithms, graphs, implementation",2000,1440,0,https://codeforces.com/problemset/problem/886/D
+886C,Petya and Catacombs,"dsu, greedy, implementation, trees",1300,4539,0,https://codeforces.com/problemset/problem/886/C
+886B,Vlad and Cafes,,1000,6033,0,https://codeforces.com/problemset/problem/886/B
+886A,ACM ICPC,brute force,1000,7553,0,https://codeforces.com/problemset/problem/886/A
+884F,Anti-Palindromize,"flows, graphs, greedy",2500,469,0,https://codeforces.com/problemset/problem/884/F
+884E,Binary Matrix,dsu,2500,382,0,https://codeforces.com/problemset/problem/884/E
+884D,Boxes And Balls,"data structures, greedy",2300,1253,0,https://codeforces.com/problemset/problem/884/D
+884C,Bertown Subway,"dfs and similar, greedy, math",1500,3324,0,https://codeforces.com/problemset/problem/884/C
+884B,Japanese Crosswords Strike Back,implementation,1100,5287,0,https://codeforces.com/problemset/problem/884/B
+884A,Book Reading,implementation,800,7508,0,https://codeforces.com/problemset/problem/884/A
+883M,Quadcopter Competition,"greedy, math",1100,2232,0,https://codeforces.com/problemset/problem/883/M
+883L,Berland.Taxi,data structures,2500,147,0,https://codeforces.com/problemset/problem/883/L
+883K,Road Widening,"constructive algorithms, greedy, implementation",1800,703,0,https://codeforces.com/problemset/problem/883/K
+883J,Renovation,"constructive algorithms, greedy, sortings",2400,375,0,https://codeforces.com/problemset/problem/883/J
+883I,Photo Processing,"binary search, dp",1900,934,0,https://codeforces.com/problemset/problem/883/I
+883H,Palindromic Cut,"brute force, implementation, strings",1800,1062,0,https://codeforces.com/problemset/problem/883/H
+883G,Orientation of Edges,"dfs and similar, graphs",1900,898,0,https://codeforces.com/problemset/problem/883/G
+883F,Lost in Transliteration,implementation,1300,1530,0,https://codeforces.com/problemset/problem/883/F
+883E,Field of Wonders,"implementation, strings",1500,1264,0,https://codeforces.com/problemset/problem/883/E
+883D,Packmen Strike Back,"binary search, dp, math",2500,171,0,https://codeforces.com/problemset/problem/883/D
+883C,Downloading B++,binary search,2300,427,0,https://codeforces.com/problemset/problem/883/C
+883B,Berland Army,"constructive algorithms, graphs, greedy",2600,216,0,https://codeforces.com/problemset/problem/883/B
+883A,Automatic Door,implementation,2200,396,0,https://codeforces.com/problemset/problem/883/A
+879B,Table Tennis,"data structures, implementation",1200,7736,0,https://codeforces.com/problemset/problem/879/B
+879A,Borya's Diagnosis,implementation,900,7553,0,https://codeforces.com/problemset/problem/879/A
+878E,Numbers on the blackboard,"combinatorics, dp",3300,205,0,https://codeforces.com/problemset/problem/878/E
+878D,Magic Breeding,bitmasks,2900,288,0,https://codeforces.com/problemset/problem/878/D
+878C,Tournament,"data structures, graphs",2700,591,0,https://codeforces.com/problemset/problem/878/C
+878B,Teams Formation,"data structures, implementation",2300,815,0,https://codeforces.com/problemset/problem/878/B
+878A,Short Program,"bitmasks, constructive algorithms",1600,4132,0,https://codeforces.com/problemset/problem/878/A
+877F,Ann and Books,"data structures, flows, hashing",2300,602,0,https://codeforces.com/problemset/problem/877/F
+877E,Danil and a Part-time Job,"bitmasks, data structures, trees",2000,2478,0,https://codeforces.com/problemset/problem/877/E
+877D,Olya and Energy Drinks,"data structures, dfs and similar, graphs, shortest paths",2100,2375,0,https://codeforces.com/problemset/problem/877/D
+877C,Slava and tanks,constructive algorithms,1600,4463,0,https://codeforces.com/problemset/problem/877/C
+877B,Nikita and string,"brute force, dp",1500,6172,0,https://codeforces.com/problemset/problem/877/B
+877A,Alex and broken contest,"implementation, strings",1100,8428,0,https://codeforces.com/problemset/problem/877/A
+876B,Divisiblity of Differences,"implementation, math, number theory",1300,6164,0,https://codeforces.com/problemset/problem/876/B
+876A,Trip For Meal,math,900,7445,0,https://codeforces.com/problemset/problem/876/A
+875F,Royal Questions,"dsu, graphs, greedy",2500,704,0,https://codeforces.com/problemset/problem/875/F
+875E,Delivery Club,"binary search, data structures, dp",2600,466,0,https://codeforces.com/problemset/problem/875/E
+875D,High Cry,"binary search, bitmasks, combinatorics, data structures, divide and conquer",2200,1342,0,https://codeforces.com/problemset/problem/875/D
+875C,National Property,"2-sat, dfs and similar, graphs, implementation",2100,1422,0,https://codeforces.com/problemset/problem/875/C
+875B,Sorting the Coins,"dsu, implementation, sortings, two pointers",1500,4279,0,https://codeforces.com/problemset/problem/875/B
+875A,Classroom Watch,"brute force, math",1200,7729,0,https://codeforces.com/problemset/problem/875/A
+873F,Forbidden Indices,"dsu, string suffix structures, strings",2400,579,0,https://codeforces.com/problemset/problem/873/F
+873E,Awards For Contestants,"brute force, data structures, dp",2300,254,0,https://codeforces.com/problemset/problem/873/E
+873D,Merge Sort,"constructive algorithms, divide and conquer",1800,1812,0,https://codeforces.com/problemset/problem/873/D
+873C,Strange Game On Matrix,"greedy, two pointers",1600,2388,0,https://codeforces.com/problemset/problem/873/C
+873B,Balanced Substring,"dp, implementation",1500,4647,0,https://codeforces.com/problemset/problem/873/B
+873A,Chores,implementation,800,5614,0,https://codeforces.com/problemset/problem/873/A
+871E,Restore the Tree,"graphs, greedy, trees",2900,67,0,https://codeforces.com/problemset/problem/871/E
+870F,Paths,"data structures, number theory",2700,299,0,https://codeforces.com/problemset/problem/870/F
+870E,"Points, Lines and Ready-made Titles","dfs and similar, dsu, graphs, trees",2300,696,0,https://codeforces.com/problemset/problem/870/E
+870D,Something with XOR Queries,"brute force, interactive, probabilities",2000,945,0,https://codeforces.com/problemset/problem/870/D
+870C,Maximum splitting,"dp, greedy, math, number theory",1300,6744,0,https://codeforces.com/problemset/problem/870/C
+870B,Maximum of Maximums of Minimums,greedy,1200,6207,0,https://codeforces.com/problemset/problem/870/B
+870A,Search for Pretty Integers,"brute force, implementation",900,7814,0,https://codeforces.com/problemset/problem/870/A
+869E,The Untended Antiquity,"data structures, hashing",2400,937,0,https://codeforces.com/problemset/problem/869/E
+869D,The Overdosing Ubiquity,"brute force, dfs and similar, graphs",2800,118,0,https://codeforces.com/problemset/problem/869/D
+869C,The Intriguing Obsession,"combinatorics, dp, math",1800,3139,0,https://codeforces.com/problemset/problem/869/C
+869B,The Eternal Immortality,math,1100,8734,0,https://codeforces.com/problemset/problem/869/B
+869A,The Artful Expedient,"brute force, implementation",1100,7720,0,https://codeforces.com/problemset/problem/869/A
+868G,El Toll Caves,math,3300,61,0,https://codeforces.com/problemset/problem/868/G
+868F,Yet Another Minimization Problem,"divide and conquer, dp",2500,952,0,https://codeforces.com/problemset/problem/868/F
+868E,Policeman and a Tree,"dp, graphs, trees",2700,240,0,https://codeforces.com/problemset/problem/868/E
+868D,Huge Strings,"bitmasks, brute force, dp, implementation, strings",2200,731,0,https://codeforces.com/problemset/problem/868/D
+868C,Qualification Rounds,"bitmasks, brute force, constructive algorithms, dp",1500,3172,0,https://codeforces.com/problemset/problem/868/C
+868B,Race Against Time,implementation,1400,3002,0,https://codeforces.com/problemset/problem/868/B
+868A,Bark to Unlock,"brute force, implementation, strings",900,5969,0,https://codeforces.com/problemset/problem/868/A
+867A,Between the Offices,implementation,800,13777,0,https://codeforces.com/problemset/problem/867/A
+865G,Flowers and Chocolate,"combinatorics, math, matrices",3300,83,0,https://codeforces.com/problemset/problem/865/G
+865F,Egg Roulette,"bitmasks, brute force, divide and conquer, math, meet-in-the-middle",3300,34,0,https://codeforces.com/problemset/problem/865/F
+865E,Hex Dyslexia,"bitmasks, brute force, dp, graphs",3300,51,0,https://codeforces.com/problemset/problem/865/E
+865D,Buy Low Sell High,"constructive algorithms, data structures, greedy",2400,1582,0,https://codeforces.com/problemset/problem/865/D
+865C,Gotta Go Fast,"binary search, dp",2400,508,0,https://codeforces.com/problemset/problem/865/C
+865B,Ordering Pizza,"binary search, sortings, ternary search",1900,1443,0,https://codeforces.com/problemset/problem/865/B
+865A,Save the problem!,constructive algorithms,1400,3575,0,https://codeforces.com/problemset/problem/865/A
+864F,Cities Excursions,"dfs and similar, graphs, trees",2700,427,0,https://codeforces.com/problemset/problem/864/F
+864E,Fire,"dp, sortings",2000,2680,0,https://codeforces.com/problemset/problem/864/E
+864D,Make a Permutation!,"greedy, implementation, math",1500,4695,0,https://codeforces.com/problemset/problem/864/D
+864C,Bus,"greedy, implementation, math",1500,4989,0,https://codeforces.com/problemset/problem/864/C
+864B,Polycarp and Letters,"brute force, implementation, strings",1000,6993,0,https://codeforces.com/problemset/problem/864/B
+864A,Fair Game,"implementation, sortings",1000,8965,0,https://codeforces.com/problemset/problem/864/A
+863G,Graphic Settings,,3200,31,0,https://codeforces.com/problemset/problem/863/G
+863F,Almost Permutation,flows,2200,694,0,https://codeforces.com/problemset/problem/863/F
+863E,Turn Off The TV,"data structures, sortings",2000,1467,0,https://codeforces.com/problemset/problem/863/E
+863D,Yet Another Array Queries Problem,"data structures, implementation",1800,2030,0,https://codeforces.com/problemset/problem/863/D
+863C,1-2-3,"graphs, implementation",1800,1759,0,https://codeforces.com/problemset/problem/863/C
+863B,Kayaking,"brute force, greedy, sortings",1500,3292,0,https://codeforces.com/problemset/problem/863/B
+863A,Quasi-palindrome,"brute force, implementation",900,6720,0,https://codeforces.com/problemset/problem/863/A
+862F,Mahmoud and Ehab and the final stage,"data structures, strings",2900,105,0,https://codeforces.com/problemset/problem/862/F
+862E,Mahmoud and Ehab and the function,"binary search, data structures, sortings",2100,871,0,https://codeforces.com/problemset/problem/862/E
+862D,Mahmoud and Ehab and the binary string,"binary search, divide and conquer, interactive",2000,1270,0,https://codeforces.com/problemset/problem/862/D
+862C,Mahmoud and Ehab and the xor,constructive algorithms,1900,2922,0,https://codeforces.com/problemset/problem/862/C
+862B,Mahmoud and Ehab and the bipartiteness,"dfs and similar, graphs, trees",1300,7840,0,https://codeforces.com/problemset/problem/862/B
+862A,Mahmoud and Ehab and the MEX,"greedy, implementation",1000,7632,0,https://codeforces.com/problemset/problem/862/A
+860E,Arkady and a Nobody-men,"data structures, dfs and similar, trees",2700,279,0,https://codeforces.com/problemset/problem/860/E
+859G,Circle of Numbers,math,3000,90,0,https://codeforces.com/problemset/problem/859/G
+859F,Ordering T-Shirts,greedy,2800,103,0,https://codeforces.com/problemset/problem/859/F
+859E,Desk Disorder,"combinatorics, dfs and similar, dsu, graphs, trees",2100,1137,0,https://codeforces.com/problemset/problem/859/E
+859D,Third Month Insanity,"dp, probabilities, trees",2100,666,0,https://codeforces.com/problemset/problem/859/D
+859C,Pie Rules,"dp, games",1500,3374,0,https://codeforces.com/problemset/problem/859/C
+859B,Lazy Security Guard,"brute force, geometry, math",1000,4800,0,https://codeforces.com/problemset/problem/859/B
+859A,Declined Finalists,"greedy, implementation",800,5871,0,https://codeforces.com/problemset/problem/859/A
+858F,Wizard's Tour,"constructive algorithms, dfs and similar, graphs",2300,729,0,https://codeforces.com/problemset/problem/858/F
+858E,Tests Renumeration,"greedy, implementation",2200,417,0,https://codeforces.com/problemset/problem/858/E
+858D,Polycarp's phone book,"data structures, implementation, sortings",1600,2703,0,https://codeforces.com/problemset/problem/858/D
+858C,Did you mean...,"dp, greedy, implementation",1500,4316,0,https://codeforces.com/problemset/problem/858/C
+858B,Which floor?,"brute force, implementation",1500,3009,0,https://codeforces.com/problemset/problem/858/B
+858A,k-rounding,"brute force, math, number theory",1100,5688,0,https://codeforces.com/problemset/problem/858/A
+856F,To Play or not to Play,greedy,3000,41,0,https://codeforces.com/problemset/problem/856/F
+856E,Satellites,,3100,45,0,https://codeforces.com/problemset/problem/856/E
+856D,Masha and Cactus,"dp, trees",2400,233,0,https://codeforces.com/problemset/problem/856/D
+856C,Eleventh Birthday,"combinatorics, dp, math",2400,263,0,https://codeforces.com/problemset/problem/856/C
+856B,Similar Words,"dp, strings",2300,331,0,https://codeforces.com/problemset/problem/856/B
+856A,Set Theory,"brute force, constructive algorithms",1600,886,0,https://codeforces.com/problemset/problem/856/A
+855G,Harry Vs Voldemort,"dfs and similar, dp, graphs, trees",3300,95,0,https://codeforces.com/problemset/problem/855/G
+855F,Nagini,"binary search, data structures",3100,152,0,https://codeforces.com/problemset/problem/855/F
+855E,Salazar Slytherin's Locket,"bitmasks, dp",2200,828,0,https://codeforces.com/problemset/problem/855/E
+855D,Rowena Ravenclaw's Diadem,trees,2500,384,0,https://codeforces.com/problemset/problem/855/D
+855C,Helga Hufflepuff's Cup,"dp, trees",2000,1208,0,https://codeforces.com/problemset/problem/855/C
+855B,Marvolo Gaunt's Ring,"brute force, data structures, dp",1500,4997,0,https://codeforces.com/problemset/problem/855/B
+855A,Tom Riddle's Diary,"brute force, implementation, strings",800,10037,0,https://codeforces.com/problemset/problem/855/A
+854B,Maxim Buys an Apartment,"constructive algorithms, math",1200,6817,0,https://codeforces.com/problemset/problem/854/B
+854A,Fraction,"brute force, constructive algorithms, math",800,10059,0,https://codeforces.com/problemset/problem/854/A
+853E,Lada Malina,"data structures, geometry",3400,40,0,https://codeforces.com/problemset/problem/853/E
+853D,Michael and Charging Stations,"binary search, dp, greedy",2400,456,0,https://codeforces.com/problemset/problem/853/D
+853C,Boredom,data structures,2100,1144,0,https://codeforces.com/problemset/problem/853/C
+853B,Jury Meeting,"greedy, sortings, two pointers",1800,2153,0,https://codeforces.com/problemset/problem/853/B
+853A,Planning,greedy,1500,4911,0,https://codeforces.com/problemset/problem/853/A
+852I,Dating,"brute force, dfs and similar, graphs, trees",2300,339,0,https://codeforces.com/problemset/problem/852/I
+852H,Bob and stages,"dp, geometry",3000,67,0,https://codeforces.com/problemset/problem/852/H
+852G,Bathroom terminal,implementation,1700,992,0,https://codeforces.com/problemset/problem/852/G
+852F,Product transformation,"combinatorics, math, number theory",2200,408,0,https://codeforces.com/problemset/problem/852/F
+852E,Casinos and travel,dp,2100,595,0,https://codeforces.com/problemset/problem/852/E
+852D,Exploration plan,"binary search, flows, graph matchings, shortest paths",2100,543,0,https://codeforces.com/problemset/problem/852/D
+852C,Property,"greedy, sortings",2100,248,0,https://codeforces.com/problemset/problem/852/C
+852B,Neural Network country,"dp, matrices",2000,720,0,https://codeforces.com/problemset/problem/852/B
+852A,Digits,"brute force, implementation, math",2500,255,0,https://codeforces.com/problemset/problem/852/A
+851B,Arpa and an exam about geometry,"geometry, math",1400,4209,0,https://codeforces.com/problemset/problem/851/B
+851A,Arpa and a research in Mexican wave,"implementation, math",800,7486,0,https://codeforces.com/problemset/problem/851/A
+850F,Rainbow Balls,math,2800,168,0,https://codeforces.com/problemset/problem/850/F
+850E,Random Elections,"bitmasks, brute force, divide and conquer, fft, math",2800,229,0,https://codeforces.com/problemset/problem/850/E
+850D,Tournament Construction,"constructive algorithms, dp, graphs, greedy, math",2800,215,0,https://codeforces.com/problemset/problem/850/D
+850C,Arpa and a game with Mojtaba,"bitmasks, dp, games",2200,881,0,https://codeforces.com/problemset/problem/850/C
+850B,Arpa and a list of numbers,"implementation, number theory",2100,1505,0,https://codeforces.com/problemset/problem/850/B
+850A,Five Dimensional Points,"brute force, geometry, math",1700,2614,0,https://codeforces.com/problemset/problem/850/A
+849B,Tell Your World,"brute force, geometry",1600,2940,0,https://codeforces.com/problemset/problem/849/B
+849A,Odds and Ends,implementation,1000,7128,0,https://codeforces.com/problemset/problem/849/A
+848E,Days of Floral Colours,"combinatorics, divide and conquer, dp, fft, math",3400,89,0,https://codeforces.com/problemset/problem/848/E
+848D,Shake It!,"combinatorics, dp, flows, graphs",2900,137,0,https://codeforces.com/problemset/problem/848/D
+848C,Goodbye Souvenir,"data structures, divide and conquer",2600,619,0,https://codeforces.com/problemset/problem/848/C
+848B,Rooter's Song,"constructive algorithms, data structures, geometry, implementation, sortings, two pointers",1900,1382,0,https://codeforces.com/problemset/problem/848/B
+848A,From Y to Y,constructive algorithms,1600,4158,0,https://codeforces.com/problemset/problem/848/A
+847M,Weather Tomorrow,"implementation, math",1000,4173,0,https://codeforces.com/problemset/problem/847/M
+847L,Berland SU Computer Network,"dfs and similar, hashing, trees",2400,236,0,https://codeforces.com/problemset/problem/847/L
+847K,Travel Cards,"greedy, implementation, sortings",1800,1094,0,https://codeforces.com/problemset/problem/847/K
+847J,Students Initiation,"binary search, flows, graphs",2400,428,0,https://codeforces.com/problemset/problem/847/J
+847I,Noise Level,"dfs and similar, implementation, math",1900,1222,0,https://codeforces.com/problemset/problem/847/I
+847H,Load Testing,greedy,1600,1862,0,https://codeforces.com/problemset/problem/847/H
+847G,University Classes,implementation,900,4288,0,https://codeforces.com/problemset/problem/847/G
+847F,Berland Elections,"greedy, sortings",2100,659,0,https://codeforces.com/problemset/problem/847/F
+847E,Packmen,"binary search, dp",1800,1282,0,https://codeforces.com/problemset/problem/847/E
+847D,Dog Show,"data structures, greedy",2200,715,0,https://codeforces.com/problemset/problem/847/D
+847C,Sum of Nestings,constructive algorithms,1800,1746,0,https://codeforces.com/problemset/problem/847/C
+847B,Preparing for Merge Sort,"binary search, data structures",1600,2429,0,https://codeforces.com/problemset/problem/847/B
+847A,Union of Doubly Linked Lists,implementation,1500,2577,0,https://codeforces.com/problemset/problem/847/A
+846F,Random Query,"data structures, math, probabilities, two pointers",1800,1297,0,https://codeforces.com/problemset/problem/846/F
+846E,Chemistry in Berland,"dfs and similar, greedy, trees",2300,443,0,https://codeforces.com/problemset/problem/846/E
+846D,Monitor,"binary search, data structures",1900,1498,0,https://codeforces.com/problemset/problem/846/D
+846C,Four Segments,"brute force, data structures, dp",1800,1619,0,https://codeforces.com/problemset/problem/846/C
+846B,Math Show,"brute force, greedy",1800,1858,0,https://codeforces.com/problemset/problem/846/B
+846A,Curriculum Vitae,"brute force, implementation",1500,3034,0,https://codeforces.com/problemset/problem/846/A
+845G,Shortest Path Problem?,"dfs and similar, graphs, math",2300,632,0,https://codeforces.com/problemset/problem/845/G
+845F,Guards In The Storehouse,"bitmasks, dp",2500,187,0,https://codeforces.com/problemset/problem/845/F
+845E,Fire in the City,"binary search, data structures",2400,311,0,https://codeforces.com/problemset/problem/845/E
+845D,Driving Test,"data structures, dp, greedy",1800,1701,0,https://codeforces.com/problemset/problem/845/D
+845C,Two TVs,"data structures, greedy, sortings",1500,4563,0,https://codeforces.com/problemset/problem/845/C
+845B,Luba And The Ticket,"brute force, greedy, implementation",1600,3622,0,https://codeforces.com/problemset/problem/845/B
+845A,Chess Tourney,"implementation, sortings",1100,5615,0,https://codeforces.com/problemset/problem/845/A
+844B,Rectangles,"combinatorics, math",1300,4576,0,https://codeforces.com/problemset/problem/844/B
+844A,Diversity,"greedy, implementation, strings",1000,6866,0,https://codeforces.com/problemset/problem/844/A
+843E,Maximum Flow,"flows, graphs",3000,84,0,https://codeforces.com/problemset/problem/843/E
+843D,Dynamic Shortest Path,"graphs, shortest paths",3400,247,0,https://codeforces.com/problemset/problem/843/D
+843C,Upgrading Tree,"constructive algorithms, dfs and similar, graphs, math, trees",2600,246,0,https://codeforces.com/problemset/problem/843/C
+843B,Interactive LowerBound,"brute force, interactive, probabilities",2000,1526,0,https://codeforces.com/problemset/problem/843/B
+843A,Sorting by Subsequences,"dfs and similar, dsu, implementation, math, sortings",1400,4376,0,https://codeforces.com/problemset/problem/843/A
+842E,Nikita and game,"binary search, dfs and similar, divide and conquer, graphs, trees",2800,157,0,https://codeforces.com/problemset/problem/842/E
+842D,Vitya and Strange Lesson,"binary search, data structures",2000,1837,0,https://codeforces.com/problemset/problem/842/D
+842C,Ilya And The Tree,"dfs and similar, graphs, math, number theory, trees",2000,2637,0,https://codeforces.com/problemset/problem/842/C
+842B,Gleb And Pizza,geometry,1100,7865,0,https://codeforces.com/problemset/problem/842/B
+842A,Kirill And The Game,"brute force, two pointers",1200,7052,0,https://codeforces.com/problemset/problem/842/A
+841B,Godsend,"games, math",1100,8832,0,https://codeforces.com/problemset/problem/841/B
+841A,Generous Kefa,"brute force, implementation",900,9968,0,https://codeforces.com/problemset/problem/841/A
+840E,In a Trap,trees,3200,187,0,https://codeforces.com/problemset/problem/840/E
+840D,Destiny,"data structures, probabilities",2500,864,0,https://codeforces.com/problemset/problem/840/D
+840C,On the Bench,"combinatorics, dp",2500,812,0,https://codeforces.com/problemset/problem/840/C
+840B,Leha and another game about graph,"constructive algorithms, data structures, dfs and similar, dp, graphs",2100,1605,0,https://codeforces.com/problemset/problem/840/B
+840A,Leha and Function,"combinatorics, greedy, math, number theory, sortings",1300,6178,0,https://codeforces.com/problemset/problem/840/A
+839E,Mother of Dragons,"brute force, graphs, math, meet-in-the-middle",2700,503,0,https://codeforces.com/problemset/problem/839/E
+839D,Winter is here,"combinatorics, dp, math, number theory",2200,1921,0,https://codeforces.com/problemset/problem/839/D
+839C,Journey,"dfs and similar, dp, graphs, probabilities, trees",1500,8790,0,https://codeforces.com/problemset/problem/839/C
+839B,Game of the Rows,"brute force, greedy, implementation",1900,2857,0,https://codeforces.com/problemset/problem/839/B
+839A,Arya and Bran,implementation,900,10900,0,https://codeforces.com/problemset/problem/839/A
+838F,Expected Earnings,,2800,32,0,https://codeforces.com/problemset/problem/838/F
+838E,Convex Countour,dp,2300,216,0,https://codeforces.com/problemset/problem/838/E
+838D,Airplane Arrangements,"math, number theory",2700,136,0,https://codeforces.com/problemset/problem/838/D
+838C,Future Failure,"dp, games",2800,60,0,https://codeforces.com/problemset/problem/838/C
+838B,Diverging Directions,"data structures, dfs and similar, trees",2100,268,0,https://codeforces.com/problemset/problem/838/B
+838A,Binary Blocks,brute force,1400,610,0,https://codeforces.com/problemset/problem/838/A
+837G,Functions On The Segments,data structures,2500,304,0,https://codeforces.com/problemset/problem/837/G
+837F,Prefix Sums,"binary search, brute force, combinatorics, math, matrices",2400,457,0,https://codeforces.com/problemset/problem/837/F
+837E,Vasya's Function,"binary search, implementation, math",2100,1048,0,https://codeforces.com/problemset/problem/837/E
+837D,Round Subset,"dp, math",2100,1986,0,https://codeforces.com/problemset/problem/837/D
+837C,Two Seals,"brute force, implementation",1500,3012,0,https://codeforces.com/problemset/problem/837/C
+837B,Flag of Berland,"brute force, implementation",1600,2954,0,https://codeforces.com/problemset/problem/837/B
+837A,Text Volume,implementation,800,6717,0,https://codeforces.com/problemset/problem/837/A
+835F,Roads in the Kingdom,"dfs and similar, dp, graphs, trees",2500,445,0,https://codeforces.com/problemset/problem/835/F
+835E,The penguin's game,"binary search, constructive algorithms, interactive",2400,675,0,https://codeforces.com/problemset/problem/835/E
+835D,Palindromic characteristics,"brute force, dp, hashing, strings",1900,2431,0,https://codeforces.com/problemset/problem/835/D
+835C,Star sky,"dp, implementation",1600,5351,0,https://codeforces.com/problemset/problem/835/C
+835B,The number on the board,greedy,1100,8643,0,https://codeforces.com/problemset/problem/835/B
+835A,Key races,math,800,14823,0,https://codeforces.com/problemset/problem/835/A
+834B,The Festive Evening,"data structures, implementation",1100,6514,0,https://codeforces.com/problemset/problem/834/B
+834A,The Useless Toy,implementation,900,6958,0,https://codeforces.com/problemset/problem/834/A
+833E,Caramel Clouds,"data structures, dp, sortings",3400,87,0,https://codeforces.com/problemset/problem/833/E
+833D,Red-Black Cobweb,"data structures, divide and conquer, implementation, trees",2800,193,0,https://codeforces.com/problemset/problem/833/D
+833C,Ever-Hungry Krakozyabra,"brute force, combinatorics, greedy, math",2700,301,0,https://codeforces.com/problemset/problem/833/C
+833B,The Bakery,"binary search, data structures, divide and conquer, dp, two pointers",2200,1937,0,https://codeforces.com/problemset/problem/833/B
+833A,The Meaningless Game,"math, number theory",1700,4689,0,https://codeforces.com/problemset/problem/833/A
+832E,Vasya and Shifts,matrices,2600,184,0,https://codeforces.com/problemset/problem/832/E
+832D,"Misha, Grisha and Underground","dfs and similar, graphs, trees",1900,2321,0,https://codeforces.com/problemset/problem/832/D
+832C,Strange Radiation,"binary search, implementation, math",2500,336,0,https://codeforces.com/problemset/problem/832/C
+832B,Petya and Exam,"implementation, strings",1600,3721,0,https://codeforces.com/problemset/problem/832/B
+832A,Sasha and Sticks,"games, math",800,14008,0,https://codeforces.com/problemset/problem/832/A
+831C,Jury Marks,"brute force, constructive algorithms",1700,2912,0,https://codeforces.com/problemset/problem/831/C
+831B,Keyboard Layouts,"implementation, strings",800,10004,0,https://codeforces.com/problemset/problem/831/B
+831A,Unimodal Array,implementation,1000,7530,0,https://codeforces.com/problemset/problem/831/A
+830E,Perpetual Motion Machine,"constructive algorithms, dp, graphs, implementation, math, trees",3100,115,0,https://codeforces.com/problemset/problem/830/E
+830D,Singer House,"combinatorics, dp, graphs, trees",2800,345,0,https://codeforces.com/problemset/problem/830/D
+830C,Bamboo Partition,"brute force, data structures, implementation, math, number theory, sortings, two pointers",2300,818,0,https://codeforces.com/problemset/problem/830/C
+830B,Cards Sorting,"data structures, implementation, sortings",1600,2198,0,https://codeforces.com/problemset/problem/830/B
+830A,Office Keys,"binary search, brute force, dp, greedy, sortings",1800,3427,0,https://codeforces.com/problemset/problem/830/A
+828B,Black Square,implementation,1300,4783,0,https://codeforces.com/problemset/problem/828/B
+828A,Restaurant Tables,implementation,1200,6306,0,https://codeforces.com/problemset/problem/828/A
+827F,Dirty Arkady's Kitchen,"data structures, dp, graphs, shortest paths",3200,121,0,https://codeforces.com/problemset/problem/827/F
+827E,Rusty String,"fft, math, strings",2700,491,0,https://codeforces.com/problemset/problem/827/E
+827D,Best Edge Weight,"data structures, dfs and similar, graphs, trees",2700,595,0,https://codeforces.com/problemset/problem/827/D
+827C,DNA Evolution,"data structures, strings",2100,1232,0,https://codeforces.com/problemset/problem/827/C
+827B,High Load,"constructive algorithms, greedy, implementation, trees",1800,2778,0,https://codeforces.com/problemset/problem/827/B
+827A,String Reconstruction,"data structures, greedy, sortings, strings",1700,3153,0,https://codeforces.com/problemset/problem/827/A
+825G,Tree Queries,"dfs and similar, graphs, trees",2500,486,0,https://codeforces.com/problemset/problem/825/G
+825F,String Compression,"dp, hashing, string suffix structures, strings",2400,665,0,https://codeforces.com/problemset/problem/825/F
+825E,Minimal Labels,"data structures, dfs and similar, graphs, greedy",2300,1612,0,https://codeforces.com/problemset/problem/825/E
+825D,Suitable Replacement,"binary search, greedy, implementation",1500,2276,0,https://codeforces.com/problemset/problem/825/D
+825C,Multi-judge Solving,"greedy, implementation",1600,3354,0,https://codeforces.com/problemset/problem/825/C
+825B,Five-In-a-Row,"brute force, implementation",1600,3030,0,https://codeforces.com/problemset/problem/825/B
+825A,Binary Protocol,implementation,1100,5499,0,https://codeforces.com/problemset/problem/825/A
+822F,Madness,"constructive algorithms, dfs and similar, trees",2500,190,0,https://codeforces.com/problemset/problem/822/F
+822E,Liar,"binary search, dp, hashing, string suffix structures",2400,406,0,https://codeforces.com/problemset/problem/822/E
+822D,My pretty girl Noora,"brute force, dp, greedy, math, number theory",1800,2483,0,https://codeforces.com/problemset/problem/822/D
+822C,"Hacker, pack your bags!","binary search, greedy, implementation, sortings",1600,3518,0,https://codeforces.com/problemset/problem/822/C
+822B,Crossword solving,"brute force, implementation, strings",1000,7415,0,https://codeforces.com/problemset/problem/822/B
+822A,I'm bored with life,"implementation, math, number theory",800,17842,0,https://codeforces.com/problemset/problem/822/A
+821E,Okabe and El Psy Kongroo,"dp, matrices",2100,1083,0,https://codeforces.com/problemset/problem/821/E
+821D,Okabe and City,"dfs and similar, graphs, shortest paths",2200,888,0,https://codeforces.com/problemset/problem/821/D
+821C,Okabe and Boxes,"data structures, greedy, trees",1500,4634,0,https://codeforces.com/problemset/problem/821/C
+821B,Okabe and Banana Trees,"brute force, math",1300,4904,0,https://codeforces.com/problemset/problem/821/B
+821A,Okabe and Future Gadget Laboratory,implementation,800,6840,0,https://codeforces.com/problemset/problem/821/A
+820B,Mister B and Angle in Polygon,"constructive algorithms, geometry, math",1300,4345,0,https://codeforces.com/problemset/problem/820/B
+820A,Mister B and Book Reading,implementation,900,6761,0,https://codeforces.com/problemset/problem/820/A
+819E,Mister B and Flight to the Moon,"constructive algorithms, graphs",2800,223,0,https://codeforces.com/problemset/problem/819/E
+819D,Mister B and Astronomers,number theory,2900,122,0,https://codeforces.com/problemset/problem/819/D
+819C,Mister B and Beacons on Field,number theory,2900,156,0,https://codeforces.com/problemset/problem/819/C
+819B,Mister B and PR Shifts,"data structures, implementation, math",1900,1337,0,https://codeforces.com/problemset/problem/819/B
+819A,Mister B and Boring Game,"games, greedy",2200,227,0,https://codeforces.com/problemset/problem/819/A
+818G,Four Melodies,"flows, graphs",2600,235,0,https://codeforces.com/problemset/problem/818/G
+818F,Level Generation,"binary search, math, ternary search",2100,676,0,https://codeforces.com/problemset/problem/818/F
+818E,Card Game Again,"binary search, data structures, number theory, two pointers",1900,1220,0,https://codeforces.com/problemset/problem/818/E
+818D,Multicolored Cars,"data structures, implementation",1700,2454,0,https://codeforces.com/problemset/problem/818/D
+818C,Sofa Thief,"brute force, implementation",2000,876,0,https://codeforces.com/problemset/problem/818/C
+818B,Permutation Game,implementation,1600,2263,0,https://codeforces.com/problemset/problem/818/B
+818A,Diplomas and Certificates,"implementation, math",800,4696,0,https://codeforces.com/problemset/problem/818/A
+817F,MEX Queries,"binary search, data structures, trees",2300,898,0,https://codeforces.com/problemset/problem/817/F
+817E,Choosing The Commander,"bitmasks, data structures, trees",2000,1137,0,https://codeforces.com/problemset/problem/817/E
+817D,Imbalanced Array,"data structures, divide and conquer, dsu, sortings",1900,2132,0,https://codeforces.com/problemset/problem/817/D
+817C,Really Big Numbers,"binary search, brute force, dp, math",1600,3867,0,https://codeforces.com/problemset/problem/817/C
+817B,Makes And The Product,"combinatorics, implementation, math, sortings",1500,3607,0,https://codeforces.com/problemset/problem/817/B
+817A,Treasure Hunt,"implementation, math, number theory",1200,4355,0,https://codeforces.com/problemset/problem/817/A
+816B,Karen and Coffee,"binary search, data structures, implementation",1400,7091,0,https://codeforces.com/problemset/problem/816/B
+816A,Karen and Morning,"brute force, implementation",1000,7135,0,https://codeforces.com/problemset/problem/816/A
+815E,Karen and Neighborhood,"binary search, constructive algorithms, implementation",2900,157,0,https://codeforces.com/problemset/problem/815/E
+815D,Karen and Cards,"binary search, combinatorics, data structures, geometry",2800,329,0,https://codeforces.com/problemset/problem/815/D
+815C,Karen and Supermarket,"brute force, dp, trees",2400,1313,0,https://codeforces.com/problemset/problem/815/C
+815B,Karen and Test,"brute force, combinatorics, constructive algorithms, math",2200,1110,0,https://codeforces.com/problemset/problem/815/B
+815A,Karen and Game,"brute force, greedy, implementation",1700,4738,0,https://codeforces.com/problemset/problem/815/A
+814E,An unavoidable detour for home,"combinatorics, dp, graphs, shortest paths",2600,439,0,https://codeforces.com/problemset/problem/814/E
+814D,An overnight dance in discotheque,"dfs and similar, dp, geometry, greedy, trees",2000,1593,0,https://codeforces.com/problemset/problem/814/D
+814C,An impassioned circulation of affection,"brute force, dp, strings, two pointers",1600,4060,0,https://codeforces.com/problemset/problem/814/C
+814B,An express train to reveries,constructive algorithms,1300,4784,0,https://codeforces.com/problemset/problem/814/B
+814A,An abandoned sentiment from past,"constructive algorithms, greedy, implementation, sortings",900,8169,0,https://codeforces.com/problemset/problem/814/A
+813F,Bipartite Checking,"data structures, dsu, graphs",2500,374,0,https://codeforces.com/problemset/problem/813/F
+813E,Army Creation,"binary search, data structures",2200,1171,0,https://codeforces.com/problemset/problem/813/E
+813D,Two Melodies,"dp, flows",2600,534,0,https://codeforces.com/problemset/problem/813/D
+813C,The Tag Game,"dfs and similar, graphs",1700,3380,0,https://codeforces.com/problemset/problem/813/C
+813B,The Golden Age,"brute force, math",1800,2570,0,https://codeforces.com/problemset/problem/813/B
+813A,The Contest,implementation,1100,3814,0,https://codeforces.com/problemset/problem/813/A
+812E,Sagheer and Apple Tree,"games, trees",2300,745,0,https://codeforces.com/problemset/problem/812/E
+812D,Sagheer and Kindergarten,"dfs and similar, graphs, implementation, trees",2700,258,0,https://codeforces.com/problemset/problem/812/D
+812C,Sagheer and Nubian Market,"binary search, sortings",1500,7178,0,https://codeforces.com/problemset/problem/812/C
+812B,"Sagheer, the Hausmeister","bitmasks, brute force, dp",1600,3966,0,https://codeforces.com/problemset/problem/812/B
+812A,Sagheer and Crossroads,implementation,1200,5492,0,https://codeforces.com/problemset/problem/812/A
+811E,Vladik and Entertaining Flags,"data structures, dsu, graphs",2600,470,0,https://codeforces.com/problemset/problem/811/E
+811D,Vladik and Favorite Game,"constructive algorithms, dfs and similar, graphs, interactive",2100,1125,0,https://codeforces.com/problemset/problem/811/D
+811C,Vladik and Memorable Trip,"dp, implementation",1900,2534,0,https://codeforces.com/problemset/problem/811/C
+811B,Vladik and Complicated Book,"implementation, sortings",1200,5412,0,https://codeforces.com/problemset/problem/811/B
+811A,Vladik and Courtesy,"brute force, implementation",800,8968,0,https://codeforces.com/problemset/problem/811/A
+810B,Summer sell-off,"greedy, sortings",1300,6199,0,https://codeforces.com/problemset/problem/810/B
+810A,Straight <<A>>,"implementation, math",900,6977,0,https://codeforces.com/problemset/problem/810/A
+809E,Surprise me!,"divide and conquer, math, number theory, trees",3100,330,0,https://codeforces.com/problemset/problem/809/E
+809D,Hitchhiking in the Baltic States,"data structures, dp",2900,338,0,https://codeforces.com/problemset/problem/809/D
+809C,Find a car,"combinatorics, divide and conquer, dp",2600,474,0,https://codeforces.com/problemset/problem/809/C
+809B,Glad to see you!,"binary search, interactive",2200,1126,0,https://codeforces.com/problemset/problem/809/B
+809A,Do you want a date?,"implementation, math, sortings",1500,3994,0,https://codeforces.com/problemset/problem/809/A
+808G,Anthem of Berland,"dp, strings",2300,711,0,https://codeforces.com/problemset/problem/808/G
+808F,Card Game,"binary search, flows, graphs",2400,470,0,https://codeforces.com/problemset/problem/808/F
+808E,Selling Souvenirs,"binary search, dp, greedy, ternary search",2300,1077,0,https://codeforces.com/problemset/problem/808/E
+808D,Array Division,"binary search, data structures, implementation",1900,3859,0,https://codeforces.com/problemset/problem/808/D
+808C,Tea Party,"constructive algorithms, greedy, sortings",1400,3979,0,https://codeforces.com/problemset/problem/808/C
+808B,Average Sleep Time,"data structures, implementation, math",1300,4429,0,https://codeforces.com/problemset/problem/808/B
+808A,Lucky Year,implementation,900,6143,0,https://codeforces.com/problemset/problem/808/A
+807B,T-Shirt Hunt,"brute force, implementation",1300,3221,0,https://codeforces.com/problemset/problem/807/B
+807A,Is it rated?,"implementation, sortings",900,9422,0,https://codeforces.com/problemset/problem/807/A
+805B,3-palindrome,constructive algorithms,1000,10027,0,https://codeforces.com/problemset/problem/805/B
+805A,Fake NP,"greedy, math",1000,11634,0,https://codeforces.com/problemset/problem/805/A
+804F,Fake bullions,"combinatorics, dfs and similar, dp, graphs, number theory",3400,90,0,https://codeforces.com/problemset/problem/804/F
+804E,The same permutation,constructive algorithms,3100,207,0,https://codeforces.com/problemset/problem/804/E
+804D,Expected diameter of a tree,"binary search, brute force, dfs and similar, dp, sortings, trees",2500,783,0,https://codeforces.com/problemset/problem/804/D
+804C,Ice cream coloring,"constructive algorithms, dfs and similar, greedy",2200,1366,0,https://codeforces.com/problemset/problem/804/C
+804B,Minimum number of steps,"combinatorics, greedy, implementation, math",1400,7309,0,https://codeforces.com/problemset/problem/804/B
+804A,Find Amir,"constructive algorithms, greedy, math",1000,11323,0,https://codeforces.com/problemset/problem/804/A
+803G,Periodic RMQ Problem,data structures,2300,528,0,https://codeforces.com/problemset/problem/803/G
+803F,Coprime Subsequences,"bitmasks, combinatorics, number theory",2000,1311,0,https://codeforces.com/problemset/problem/803/F
+803E,Roma and Poker,"dp, graphs",2000,1227,0,https://codeforces.com/problemset/problem/803/E
+803D,Magazine Ad,"binary search, greedy",1900,1855,0,https://codeforces.com/problemset/problem/803/D
+803C,Maximal GCD,"constructive algorithms, greedy, math",1900,2939,0,https://codeforces.com/problemset/problem/803/C
+803B,Distances to Zero,constructive algorithms,1200,4352,0,https://codeforces.com/problemset/problem/803/B
+803A,Maximal Binary Matrix,constructive algorithms,1400,3189,0,https://codeforces.com/problemset/problem/803/A
+802O,April Fools' Problem (hard),"binary search, data structures, flows",2900,99,0,https://codeforces.com/problemset/problem/802/O
+802N,April Fools' Problem (medium),"binary search, flows, graphs",2400,272,0,https://codeforces.com/problemset/problem/802/N
+802M,April Fools' Problem (easy),"greedy, sortings",1200,1750,0,https://codeforces.com/problemset/problem/802/M
+802L,Send the Fool Further! (hard),"dfs and similar, dp, math, trees",2400,120,0,https://codeforces.com/problemset/problem/802/L
+802K,Send the Fool Further! (medium),"dp, trees",2100,408,0,https://codeforces.com/problemset/problem/802/K
+802J,Send the Fool Further! (easy),"dfs and similar, graphs, trees",1400,1661,0,https://codeforces.com/problemset/problem/802/J
+802I,Fake News (hard),string suffix structures,2300,461,0,https://codeforces.com/problemset/problem/802/I
+802H,Fake News (medium),"constructive algorithms, strings",2200,271,0,https://codeforces.com/problemset/problem/802/H
+802G,Fake News (easy),implementation,800,2810,0,https://codeforces.com/problemset/problem/802/G
+802F,Marmots (hard),"math, probabilities",2800,88,0,https://codeforces.com/problemset/problem/802/F
+802E,Marmots (medium),math,2200,180,0,https://codeforces.com/problemset/problem/802/E
+802D,Marmots (easy),math,2100,332,0,https://codeforces.com/problemset/problem/802/D
+802C,Heidi and Library (hard),flows,2600,251,0,https://codeforces.com/problemset/problem/802/C
+802B,Heidi and Library (medium),"data structures, greedy",1800,698,0,https://codeforces.com/problemset/problem/802/B
+802A,Heidi and Library (easy),greedy,1800,908,0,https://codeforces.com/problemset/problem/802/A
+801B,Valued Keys,"constructive algorithms, greedy, strings",900,7008,0,https://codeforces.com/problemset/problem/801/B
+801A,Vicious Keyboard,brute force,1100,5931,0,https://codeforces.com/problemset/problem/801/A
+799G,Cut the pie,"binary search, data structures, geometry",3500,68,0,https://codeforces.com/problemset/problem/799/G
+799F,Beautiful fountains rows,data structures,3500,168,0,https://codeforces.com/problemset/problem/799/F
+799E,Aquarium decoration,"data structures, greedy, two pointers",2500,665,0,https://codeforces.com/problemset/problem/799/E
+799D,Field expansion,"brute force, dp, meet-in-the-middle",2100,1567,0,https://codeforces.com/problemset/problem/799/D
+799C,Fountains,"binary search, data structures, implementation",1800,2699,0,https://codeforces.com/problemset/problem/799/C
+799B,T-shirt buying,"data structures, implementation",1400,4881,0,https://codeforces.com/problemset/problem/799/B
+799A,Carrot Cakes,"brute force, implementation",1100,8213,0,https://codeforces.com/problemset/problem/799/A
+798E,Mike and code of a permutation,"constructive algorithms, data structures, graphs, sortings",3000,195,0,https://codeforces.com/problemset/problem/798/E
+798D,Mike and distribution,"constructive algorithms, sortings",2400,1323,0,https://codeforces.com/problemset/problem/798/D
+798C,Mike and gcd problem,"dp, greedy, number theory",1700,4084,0,https://codeforces.com/problemset/problem/798/C
+798B,Mike and strings,"brute force, dp, strings",1300,6356,0,https://codeforces.com/problemset/problem/798/B
+798A,Mike and palindrome,"brute force, constructive algorithms, strings",1000,12633,0,https://codeforces.com/problemset/problem/798/A
+797F,Mice and Holes,"data structures, dp, greedy, sortings",2600,435,0,https://codeforces.com/problemset/problem/797/F
+797E,Array Queries,"brute force, data structures, dp",2000,1751,0,https://codeforces.com/problemset/problem/797/E
+797D,Broken BST,"data structures, dfs and similar",2100,1091,0,https://codeforces.com/problemset/problem/797/D
+797C,Minimal string,"data structures, greedy, strings",1700,3559,0,https://codeforces.com/problemset/problem/797/C
+797B,Odd sum,"dp, greedy, implementation",1400,6006,0,https://codeforces.com/problemset/problem/797/B
+797A,k-Factorization,"implementation, math, number theory",1100,6265,0,https://codeforces.com/problemset/problem/797/A
+796F,Sequence Recovery,"bitmasks, data structures, greedy",2800,108,0,https://codeforces.com/problemset/problem/796/F
+796E,Exam Cheating,"binary search, dp",2400,409,0,https://codeforces.com/problemset/problem/796/E
+796D,Police Stations,"constructive algorithms, dfs and similar, dp, graphs, shortest paths, trees",2100,2490,0,https://codeforces.com/problemset/problem/796/D
+796C,Bank Hacking,"constructive algorithms, data structures, dp, trees",1900,2389,0,https://codeforces.com/problemset/problem/796/C
+796B,Find The Bone,implementation,1300,7004,0,https://codeforces.com/problemset/problem/796/B
+796A,Buying A House,"brute force, implementation",800,9722,0,https://codeforces.com/problemset/problem/796/A
+794G,Replace All,"combinatorics, dp, math",3400,129,0,https://codeforces.com/problemset/problem/794/G
+794F,Leha and security system,data structures,2800,435,0,https://codeforces.com/problemset/problem/794/F
+794E,Choosing Carrot,"games, math",2800,355,0,https://codeforces.com/problemset/problem/794/E
+794D,Labelling Cities,"dfs and similar, graphs, hashing",2400,598,0,https://codeforces.com/problemset/problem/794/D
+794C,Naming Company,"games, greedy, sortings",1800,2487,0,https://codeforces.com/problemset/problem/794/C
+794B,Cutting Carrot,"geometry, math",1200,4674,0,https://codeforces.com/problemset/problem/794/B
+794A,Bank Robbery,"brute force, implementation",800,5438,0,https://codeforces.com/problemset/problem/794/A
+793G,Oleg and chess,"data structures, divide and conquer, flows, graph matchings",3400,136,0,https://codeforces.com/problemset/problem/793/G
+793F,Julia the snail,"data structures, divide and conquer, dp",3000,173,0,https://codeforces.com/problemset/problem/793/F
+793E,Problem of offices,"constructive algorithms, dfs and similar, dp, trees",2900,157,0,https://codeforces.com/problemset/problem/793/E
+793D,Presents in Bankopolis,"dp, graphs, shortest paths",2100,1079,0,https://codeforces.com/problemset/problem/793/D
+793C,Mice problem,"geometry, implementation, math, sortings",2300,1003,0,https://codeforces.com/problemset/problem/793/C
+793B,Igor and his way to work,"dfs and similar, graphs, implementation, shortest paths",1600,3019,0,https://codeforces.com/problemset/problem/793/B
+793A,Oleg and shares,"implementation, math",900,4751,0,https://codeforces.com/problemset/problem/793/A
+792F,Mages and Monsters,"data structures, geometry",3100,99,0,https://codeforces.com/problemset/problem/792/F
+792E,Colored Balls,"greedy, math, number theory",2500,665,0,https://codeforces.com/problemset/problem/792/E
+792D,Paths in a Complete Binary Tree,"bitmasks, trees",1900,2109,0,https://codeforces.com/problemset/problem/792/D
+792C,Divide by Three,"dp, greedy, math, number theory",2000,2538,0,https://codeforces.com/problemset/problem/792/C
+792B,Counting-out Rhyme,implementation,1300,4442,0,https://codeforces.com/problemset/problem/792/B
+792A,New Bus Route,"implementation, sortings",1100,6348,0,https://codeforces.com/problemset/problem/792/A
+791A,Bear and Big Brother,implementation,800,51298,0,https://codeforces.com/problemset/problem/791/A
+789B,Masha and geometric depression,"brute force, implementation, math",1700,3913,0,https://codeforces.com/problemset/problem/789/B
+789A,Anastasia and pebbles,"implementation, math",1100,7257,0,https://codeforces.com/problemset/problem/789/A
+788E,New task,data structures,2900,175,0,https://codeforces.com/problemset/problem/788/E
+788D,Finding lines,"constructive algorithms, divide and conquer, interactive",3000,159,0,https://codeforces.com/problemset/problem/788/D
+788C,The Great Mixing,"dfs and similar, graphs, shortest paths",2300,1484,0,https://codeforces.com/problemset/problem/788/C
+788B,Weird journey,"combinatorics, constructive algorithms, dfs and similar, dsu, graphs",2100,1723,0,https://codeforces.com/problemset/problem/788/B
+788A,Functions again,"dp, two pointers",1600,6715,0,https://codeforces.com/problemset/problem/788/A
+787B,Not Afraid,"greedy, implementation, math",1300,4851,0,https://codeforces.com/problemset/problem/787/B
+787A,The Monster,"brute force, math, number theory",1200,7931,0,https://codeforces.com/problemset/problem/787/A
+786E,ALT,"data structures, flows, graphs, trees",3200,237,0,https://codeforces.com/problemset/problem/786/E
+786D,Rap God,"data structures, dfs and similar, hashing, strings, trees",3400,62,0,https://codeforces.com/problemset/problem/786/D
+786C,Till I Collapse,"data structures, divide and conquer",2400,1190,0,https://codeforces.com/problemset/problem/786/C
+786B,Legacy,"data structures, graphs, shortest paths",2300,1934,0,https://codeforces.com/problemset/problem/786/B
+786A,Berzerk,"dfs and similar, dp, games",2000,1679,0,https://codeforces.com/problemset/problem/786/A
+785E,Anton and Permutation,"brute force, data structures",2200,1059,0,https://codeforces.com/problemset/problem/785/E
+785D,Anton and School - 2,"combinatorics, dp, math, number theory",2300,1693,0,https://codeforces.com/problemset/problem/785/D
+785C,Anton and Fairy Tale,"binary search, math",1600,5642,0,https://codeforces.com/problemset/problem/785/C
+785B,Anton and Classes,"greedy, sortings",1100,8287,0,https://codeforces.com/problemset/problem/785/B
+785A,Anton and Polyhedrons,"implementation, strings",800,32675,0,https://codeforces.com/problemset/problem/785/A
+784G,BF Calculator,*special problem,2000,616,0,https://codeforces.com/problemset/problem/784/G
+784F,Crunching Numbers Just for You,"*special problem, implementation",1900,714,0,https://codeforces.com/problemset/problem/784/F
+784E,Twisted Circuit,"*special problem, brute force, implementation",2000,1530,0,https://codeforces.com/problemset/problem/784/E
+784D,Touchy-Feely Palindromes,"*special problem, implementation",1900,283,0,https://codeforces.com/problemset/problem/784/D
+784C,INTERCALC,"*special problem, implementation",1800,490,0,https://codeforces.com/problemset/problem/784/C
+784B,Kids' Riddle,*special problem,2000,591,0,https://codeforces.com/problemset/problem/784/B
+784A,Numbers Joke,*special problem,1700,2555,0,https://codeforces.com/problemset/problem/784/A
+780H,Intranet of Buses,"binary search, geometry, implementation, two pointers",3100,82,0,https://codeforces.com/problemset/problem/780/H
+780G,Andryusha and Nervous Barriers,"data structures, dp",2700,317,0,https://codeforces.com/problemset/problem/780/G
+780F,Axel and Marston in Bitland,"bitmasks, dp, graphs, matrices",2400,707,0,https://codeforces.com/problemset/problem/780/F
+780E,Underground Lab,"constructive algorithms, dfs and similar, graphs",2100,1683,0,https://codeforces.com/problemset/problem/780/E
+780D,Innokenty and a Football League,"2-sat, graphs, greedy, implementation, shortest paths, strings",1900,2427,0,https://codeforces.com/problemset/problem/780/D
+780C,Andryusha and Colored Balloons,"dfs and similar, graphs, greedy, trees",1600,6245,0,https://codeforces.com/problemset/problem/780/C
+780B,The Meeting Place Cannot Be Changed,binary search,1600,4890,0,https://codeforces.com/problemset/problem/780/B
+780A,Andryusha and Socks,implementation,800,10216,0,https://codeforces.com/problemset/problem/780/A
+779C,Dishonest Sellers,"constructive algorithms, greedy, sortings",1200,8418,0,https://codeforces.com/problemset/problem/779/C
+779B,Weird Rounding,"brute force, greedy",1100,7808,0,https://codeforces.com/problemset/problem/779/B
+779A,Pupils Redistribution,"constructive algorithms, math",1000,7471,0,https://codeforces.com/problemset/problem/779/A
+778E,Selling Numbers,"dp, sortings",3000,184,0,https://codeforces.com/problemset/problem/778/E
+778D,Parquet Re-laying,constructive algorithms,2700,307,0,https://codeforces.com/problemset/problem/778/D
+778C,Peterson Polyglot,"brute force, dfs and similar, dsu, hashing, strings, trees",2500,626,0,https://codeforces.com/problemset/problem/778/C
+778B,Bitwise Formula,"bitmasks, brute force, dfs and similar, expression parsing, implementation",1800,1803,0,https://codeforces.com/problemset/problem/778/B
+778A,String Game,"binary search, greedy, strings",1700,6951,0,https://codeforces.com/problemset/problem/778/A
+777E,Hanoi Factory,"brute force, data structures, dp, greedy, sortings",2000,2436,0,https://codeforces.com/problemset/problem/777/E
+777D,Cloud of Hashtags,"binary search, greedy, implementation, strings",1800,3760,0,https://codeforces.com/problemset/problem/777/D
+777C,Alyona and Spreadsheet,"binary search, data structures, dp, greedy, implementation, two pointers",1600,4811,0,https://codeforces.com/problemset/problem/777/C
+777B,Game of Credit Cards,"data structures, dp, greedy, sortings",1300,7155,0,https://codeforces.com/problemset/problem/777/B
+777A,Shell Game,"constructive algorithms, implementation, math",1000,7696,0,https://codeforces.com/problemset/problem/777/A
+776G,Sherlock and the Encrypted Data,"bitmasks, combinatorics, dp",2900,210,0,https://codeforces.com/problemset/problem/776/G
+776F,Sherlock's bet to Moriarty,"constructive algorithms, data structures, divide and conquer, geometry, graphs, implementation, trees",2800,260,0,https://codeforces.com/problemset/problem/776/F
+776E,The Holmes Children,"math, number theory",2100,1468,0,https://codeforces.com/problemset/problem/776/E
+776D,The Door Problem,"2-sat, dfs and similar, dsu, graphs",2000,2780,0,https://codeforces.com/problemset/problem/776/D
+776C,Molly's Chemicals,"binary search, brute force, data structures, implementation, math",1800,4172,0,https://codeforces.com/problemset/problem/776/C
+776B,Sherlock and his girlfriend,"constructive algorithms, number theory",1200,9102,0,https://codeforces.com/problemset/problem/776/B
+776A,A Serial Killer,"brute force, implementation, strings",900,8447,0,https://codeforces.com/problemset/problem/776/A
+774L,Bars,"*special problem, binary search",2000,177,0,https://codeforces.com/problemset/problem/774/L
+774K,Stepan and Vowels,"*special problem, implementation, strings",1600,1036,0,https://codeforces.com/problemset/problem/774/K
+774J,Stepan's Series,"*special problem, dp",2000,261,0,https://codeforces.com/problemset/problem/774/J
+774I,Composing Of String,"*special problem, dp",2300,67,0,https://codeforces.com/problemset/problem/774/I
+774H,Repairing Of String,"*special problem, constructive algorithms",2200,150,0,https://codeforces.com/problemset/problem/774/H
+774G,Perfectionist Arkadiy,"*special problem, number theory",2700,58,0,https://codeforces.com/problemset/problem/774/G
+774F,Pens And Days Of Week,"*special problem, binary search, number theory",2700,55,0,https://codeforces.com/problemset/problem/774/F
+774E,Big Number and Remainder,"*special problem, math, number theory",2300,142,0,https://codeforces.com/problemset/problem/774/E
+774D,Lie or Truth,"*special problem, constructive algorithms, sortings",1500,1555,0,https://codeforces.com/problemset/problem/774/D
+774C,Maximum Number,"*special problem, constructive algorithms, greedy, implementation",1200,2461,0,https://codeforces.com/problemset/problem/774/C
+774B,Significant Cups,"*special problem, binary search, data structures, two pointers",2100,165,0,https://codeforces.com/problemset/problem/774/B
+774A,Amusement Park,"*special problem, ternary search",2100,254,0,https://codeforces.com/problemset/problem/774/A
+773F,Test Data Generation,"combinatorics, divide and conquer, dp, fft, math, number theory",3400,80,0,https://codeforces.com/problemset/problem/773/F
+773E,Blog Post Rating,"data structures, sortings",3000,150,0,https://codeforces.com/problemset/problem/773/E
+773D,Perishable Roads,"dp, graphs, shortest paths",2700,355,0,https://codeforces.com/problemset/problem/773/D
+773C,Prairie Partition,"binary search, constructive algorithms, greedy, math",2200,769,0,https://codeforces.com/problemset/problem/773/C
+773B,Dynamic Problem Scoring,"brute force, greedy",2000,1014,0,https://codeforces.com/problemset/problem/773/B
+773A,Success Rate,"binary search, math",1700,3396,0,https://codeforces.com/problemset/problem/773/A
+772E,Verifying Kingdom,"binary search, divide and conquer, interactive, trees",3200,72,0,https://codeforces.com/problemset/problem/772/E
+772D,Varying Kibibits,"bitmasks, dp",2700,343,0,https://codeforces.com/problemset/problem/772/D
+772C,Vulnerable Kerbals,"constructive algorithms, dp, graphs, math, number theory",2300,910,0,https://codeforces.com/problemset/problem/772/C
+772B,Volatile Kite,geometry,1800,2543,0,https://codeforces.com/problemset/problem/772/B
+772A,Voltage Keepsake,"binary search, math",1800,3460,0,https://codeforces.com/problemset/problem/772/A
+771F,Bear and Isomorphic Points,"geometry, two pointers",3300,54,0,https://codeforces.com/problemset/problem/771/F
+771E,Bear and Rectangle Strips,"dp, greedy",3000,199,0,https://codeforces.com/problemset/problem/771/E
+771D,Bear and Company,dp,2500,779,0,https://codeforces.com/problemset/problem/771/D
+771C,Bear and Tree Jumps,"dfs and similar, dp, trees",2100,1982,0,https://codeforces.com/problemset/problem/771/C
+771B,Bear and Different Names,"constructive algorithms, greedy",1500,5667,0,https://codeforces.com/problemset/problem/771/B
+771A,Bear and Friendship Condition,"dfs and similar, dsu, graphs",1500,8333,0,https://codeforces.com/problemset/problem/771/A
+770D,Draw Brackets!,"*special problem, implementation",1400,1464,0,https://codeforces.com/problemset/problem/770/D
+770C,Online Courses In BSU,"*special problem, dfs and similar, graphs, implementation",1500,1819,0,https://codeforces.com/problemset/problem/770/C
+770B,Maximize Sum of Digits,"*special problem, implementation, math",1300,2075,0,https://codeforces.com/problemset/problem/770/B
+770A,New Password,"*special problem, implementation",800,8088,0,https://codeforces.com/problemset/problem/770/A
+769D,k-Interesting Pairs Of Integers,"*special problem, bitmasks, brute force, meet-in-the-middle",1700,1700,0,https://codeforces.com/problemset/problem/769/D
+769C,Cycle In Maze,"*special problem, dfs and similar, graphs, greedy, shortest paths",1700,1264,0,https://codeforces.com/problemset/problem/769/C
+769B,News About Credit,"*special problem, greedy, two pointers",1200,2780,0,https://codeforces.com/problemset/problem/769/B
+769A,Year of University Entrance,"*special problem, implementation, sortings",800,3896,0,https://codeforces.com/problemset/problem/769/A
+768G,The Winds of Winter,"binary search, data structures",3300,170,0,https://codeforces.com/problemset/problem/768/G
+768F,Barrels and boxes,"brute force, combinatorics, math, number theory, probabilities",2300,722,0,https://codeforces.com/problemset/problem/768/F
+768E,Game of Stones,"bitmasks, dp, games",2100,1802,0,https://codeforces.com/problemset/problem/768/E
+768D,Jon and Orbs,"dp, math, probabilities",2200,1581,0,https://codeforces.com/problemset/problem/768/D
+768C,Jon Snow and his Favourite Number,"brute force, dp, implementation, sortings",1800,3074,0,https://codeforces.com/problemset/problem/768/C
+768B,Code For 1,"constructive algorithms, dfs and similar, divide and conquer",1600,4173,0,https://codeforces.com/problemset/problem/768/B
+768A,Oath of the Night's Watch,"constructive algorithms, sortings",900,12816,0,https://codeforces.com/problemset/problem/768/A
+767E,Change-free,greedy,2400,651,0,https://codeforces.com/problemset/problem/767/E
+767D,Cartons of milk,"binary search, data structures, greedy, sortings, two pointers",2100,1626,0,https://codeforces.com/problemset/problem/767/D
+767C,Garland,"dfs and similar, graphs, greedy, trees",2000,2634,0,https://codeforces.com/problemset/problem/767/C
+767B,The Queue,"brute force, greedy",2100,1867,0,https://codeforces.com/problemset/problem/767/B
+767A,Snacktower,"data structures, implementation",1100,9435,0,https://codeforces.com/problemset/problem/767/A
+766E,Mahmoud and a xor trip,"bitmasks, constructive algorithms, data structures, dfs and similar, dp, math, trees",2100,1676,0,https://codeforces.com/problemset/problem/766/E
+766D,Mahmoud and a Dictionary,"data structures, dfs and similar, dp, dsu, graphs",2000,2148,0,https://codeforces.com/problemset/problem/766/D
+766C,Mahmoud and a Message,"brute force, dp, greedy, strings",1700,3456,0,https://codeforces.com/problemset/problem/766/C
+766B,Mahmoud and a Triangle,"constructive algorithms, geometry, greedy, math, number theory, sortings",1000,15279,0,https://codeforces.com/problemset/problem/766/B
+766A,Mahmoud and Longest Uncommon Subsequence,"constructive algorithms, strings",1000,14303,0,https://codeforces.com/problemset/problem/766/A
+765G,"Math, math everywhere","brute force, dp, math, meet-in-the-middle, number theory",3200,31,0,https://codeforces.com/problemset/problem/765/G
+765F,Souvenirs,data structures,3100,559,0,https://codeforces.com/problemset/problem/765/F
+765E,Tree Folding,"dfs and similar, dp, greedy, implementation, trees",2200,1030,0,https://codeforces.com/problemset/problem/765/E
+765D,Artsem and Saunders,"constructive algorithms, dsu, math",1700,2122,0,https://codeforces.com/problemset/problem/765/D
+765C,Table Tennis Game 2,math,1200,5458,0,https://codeforces.com/problemset/problem/765/C
+765B,Code obfuscation,"greedy, implementation, strings",1100,5699,0,https://codeforces.com/problemset/problem/765/B
+765A,Neverending competitions,"implementation, math",900,6684,0,https://codeforces.com/problemset/problem/765/A
+764B,Timofey and cubes,"constructive algorithms, implementation",900,8749,0,https://codeforces.com/problemset/problem/764/B
+764A,Taymyr is calling you,"brute force, implementation, math",800,12254,0,https://codeforces.com/problemset/problem/764/A
+763E,Timofey and our friends animals,"data structures, divide and conquer, dsu",2900,286,0,https://codeforces.com/problemset/problem/763/E
+763D,Timofey and a flat tree,"data structures, graphs, hashing, shortest paths, trees",2900,259,0,https://codeforces.com/problemset/problem/763/D
+763C,Timofey and remoduling,"brute force, implementation, math, number theory",2600,544,0,https://codeforces.com/problemset/problem/763/C
+763B,Timofey and rectangles,"constructive algorithms, geometry",2100,2142,0,https://codeforces.com/problemset/problem/763/B
+763A,Timofey and a tree,"dfs and similar, dp, dsu, graphs, implementation, trees",1600,6798,0,https://codeforces.com/problemset/problem/763/A
+762F,Tree nesting,"combinatorics, graphs, trees",2800,130,0,https://codeforces.com/problemset/problem/762/F
+762E,Radio stations,"binary search, data structures",2200,699,0,https://codeforces.com/problemset/problem/762/E
+762D,Maximum path,"dp, greedy, implementation",2300,791,0,https://codeforces.com/problemset/problem/762/D
+762C,Two strings,"binary search, hashing, strings, two pointers",2100,1647,0,https://codeforces.com/problemset/problem/762/C
+762B,USB vs. PS/2,"greedy, implementation, sortings, two pointers",1400,4569,0,https://codeforces.com/problemset/problem/762/B
+762A,k-th divisor,"math, number theory",1400,9188,0,https://codeforces.com/problemset/problem/762/A
+761F,Dasha and Photos,"brute force, data structures, dp, implementation",2600,282,0,https://codeforces.com/problemset/problem/761/F
+761E,Dasha and Puzzle,"constructive algorithms, dfs and similar, graphs, greedy, trees",2000,1434,0,https://codeforces.com/problemset/problem/761/E
+761D,Dasha and Very Difficult Problem,"binary search, brute force, constructive algorithms, greedy, sortings",1700,3025,0,https://codeforces.com/problemset/problem/761/D
+761C,Dasha and Password,"brute force, dp, implementation",1500,4437,0,https://codeforces.com/problemset/problem/761/C
+761B,Dasha and friends,"brute force, implementation, math",1300,5672,0,https://codeforces.com/problemset/problem/761/B
+761A,Dasha and Stairs,"brute force, constructive algorithms, implementation, math",1000,11028,0,https://codeforces.com/problemset/problem/761/A
+760B,Frodo and pillows,"binary search, greedy",1500,3803,0,https://codeforces.com/problemset/problem/760/B
+760A,Petr and a calendar,"implementation, math",800,6329,0,https://codeforces.com/problemset/problem/760/A
+758F,Geometrical Progression,"brute force, math, number theory",2400,442,0,https://codeforces.com/problemset/problem/758/F
+758E,Broken Tree,"dfs and similar, dp, graphs, greedy, trees",2600,306,0,https://codeforces.com/problemset/problem/758/E
+758D,Ability To Convert,"constructive algorithms, dp, greedy, math, strings",2000,2242,0,https://codeforces.com/problemset/problem/758/D
+758C,Unfair Poll,"binary search, constructive algorithms, implementation, math",1700,3195,0,https://codeforces.com/problemset/problem/758/C
+758B,Blown Garland,"brute force, implementation, number theory",1100,7840,0,https://codeforces.com/problemset/problem/758/B
+758A,Holiday Of Equality,"implementation, math",800,25181,0,https://codeforces.com/problemset/problem/758/A
+757G,Can Bash Save the Day?,"data structures, divide and conquer, graphs, trees",3400,166,0,https://codeforces.com/problemset/problem/757/G
+757F,Team Rocket Rises Again,"data structures, graphs, shortest paths",2800,551,0,https://codeforces.com/problemset/problem/757/F
+757E,Bash Plays with Functions,"brute force, combinatorics, dp, number theory",2500,756,0,https://codeforces.com/problemset/problem/757/E
+757D,Felicity's Big Secret Revealed,"bitmasks, dp",2200,1035,0,https://codeforces.com/problemset/problem/757/D
+757C,Felicity is Coming!,"data structures, hashing, sortings, strings",1900,2022,0,https://codeforces.com/problemset/problem/757/C
+757B,Bash's Big Day,"greedy, math, number theory",1400,6463,0,https://codeforces.com/problemset/problem/757/B
+757A,Gotta Catch Em' All!,implementation,1000,8768,0,https://codeforces.com/problemset/problem/757/A
+756F,Long number,"expression parsing, math, number theory",3400,54,0,https://codeforces.com/problemset/problem/756/F
+756E,Byteland coins,"combinatorics, dp, math",3200,82,0,https://codeforces.com/problemset/problem/756/E
+756D,Bacterial Melee,"brute force, combinatorics, dp, string suffix structures",2400,631,0,https://codeforces.com/problemset/problem/756/D
+756C,Nikita and stack,data structures,2200,972,0,https://codeforces.com/problemset/problem/756/C
+756B,Travel Card,"binary search, dp",1600,2357,0,https://codeforces.com/problemset/problem/756/B
+756A,Pavel and barbecue,"constructive algorithms, dfs and similar",1700,2618,0,https://codeforces.com/problemset/problem/756/A
+755G,PolandBall and Many Other Balls,"combinatorics, divide and conquer, dp, fft, math, number theory",3200,317,0,https://codeforces.com/problemset/problem/755/G
+755F,PolandBall and Gifts,"bitmasks, dp, greedy",2600,661,0,https://codeforces.com/problemset/problem/755/F
+755E,PolandBall and White-Red graph,"constructive algorithms, graphs, shortest paths",2400,615,0,https://codeforces.com/problemset/problem/755/E
+755D,PolandBall and Polygon,data structures,2000,2125,0,https://codeforces.com/problemset/problem/755/D
+755C,PolandBall and Forest,"dfs and similar, dsu, graphs, interactive, trees",1300,6511,0,https://codeforces.com/problemset/problem/755/C
+755B,PolandBall and Game,"binary search, data structures, games, greedy, sortings, strings",1100,6942,0,https://codeforces.com/problemset/problem/755/B
+755A,PolandBall and Hypothesis,"brute force, graphs, math, number theory",800,11104,0,https://codeforces.com/problemset/problem/755/A
+754E,Dasha and cyclic table,"bitmasks, brute force, fft, strings, trees",2600,297,0,https://codeforces.com/problemset/problem/754/E
+754D,Fedor and coupons,"binary search, data structures, greedy, sortings",2100,1718,0,https://codeforces.com/problemset/problem/754/D
+754C,Vladik and chat,"brute force, constructive algorithms, dp, implementation, strings",2200,765,0,https://codeforces.com/problemset/problem/754/C
+754B,Ilya and tic-tac-toe game,"brute force, implementation",1100,6021,0,https://codeforces.com/problemset/problem/754/B
+754A,Lesha and array splitting,"constructive algorithms, greedy, implementation",1200,6142,0,https://codeforces.com/problemset/problem/754/A
+753C,Interactive Bulls and Cows (Hard),"brute force, constructive algorithms, interactive",2500,209,0,https://codeforces.com/problemset/problem/753/C
+753B,Interactive Bulls and Cows (Easy),"brute force, constructive algorithms, implementation",1600,939,0,https://codeforces.com/problemset/problem/753/B
+753A,Santa Claus and Candies,"dp, greedy, math",1000,4974,0,https://codeforces.com/problemset/problem/753/A
+750H,New Year and Snowy Grid,"dfs and similar, dsu, graphs, interactive",3500,63,0,https://codeforces.com/problemset/problem/750/H
+750G,New Year and Binary Tree Paths,"bitmasks, brute force, combinatorics, dp",3200,191,0,https://codeforces.com/problemset/problem/750/G
+750F,New Year and Finding Roots,"constructive algorithms, implementation, interactive, trees",2800,315,0,https://codeforces.com/problemset/problem/750/F
+750E,New Year and Old Subsequence,"data structures, divide and conquer, dp, matrices",2600,861,0,https://codeforces.com/problemset/problem/750/E
+750D,New Year and Fireworks,"brute force, data structures, dfs and similar, dp, implementation",1900,2772,0,https://codeforces.com/problemset/problem/750/D
+750C,New Year and Rating,"binary search, greedy, math",1600,5402,0,https://codeforces.com/problemset/problem/750/C
+750B,New Year and North Pole,"geometry, implementation",1300,7869,0,https://codeforces.com/problemset/problem/750/B
+750A,New Year and Hurry,"binary search, brute force, implementation, math",800,26454,0,https://codeforces.com/problemset/problem/750/A
+749E,Inversions After Shuffle,"data structures, probabilities",2400,591,0,https://codeforces.com/problemset/problem/749/E
+749D,Leaving Auction,"binary search, data structures",2000,2003,0,https://codeforces.com/problemset/problem/749/D
+749C,Voting,"greedy, implementation, two pointers",1500,4893,0,https://codeforces.com/problemset/problem/749/C
+749B,Parallelogram is Back,"brute force, constructive algorithms, geometry",1200,6616,0,https://codeforces.com/problemset/problem/749/B
+749A,Bachgold Problem,"greedy, implementation, math, number theory",800,22905,0,https://codeforces.com/problemset/problem/749/A
+748F,Santa Clauses and a Soccer Championship,"constructive algorithms, dfs and similar, graphs, trees",2300,440,0,https://codeforces.com/problemset/problem/748/F
+748E,Santa Claus and Tangerines,"binary search, data structures, greedy, two pointers",2100,1208,0,https://codeforces.com/problemset/problem/748/E
+748D,Santa Claus and a Palindrome,"constructive algorithms, data structures, greedy",2100,1390,0,https://codeforces.com/problemset/problem/748/D
+748C,Santa Claus and Robot,"constructive algorithms, math",1400,3938,0,https://codeforces.com/problemset/problem/748/C
+748B,Santa Claus and Keyboard Check,"implementation, strings",1500,4403,0,https://codeforces.com/problemset/problem/748/B
+748A,Santa Claus and a Place in a Class,"implementation, math",800,6925,0,https://codeforces.com/problemset/problem/748/A
+747F,Igor and Interesting Numbers,"brute force, combinatorics, dp, math",2500,305,0,https://codeforces.com/problemset/problem/747/F
+747E,Comments,"dfs and similar, expression parsing, implementation, strings",1700,1607,0,https://codeforces.com/problemset/problem/747/E
+747D,Winter Is Coming,"dp, greedy, sortings",1800,2211,0,https://codeforces.com/problemset/problem/747/D
+747C,Servers,implementation,1300,3537,0,https://codeforces.com/problemset/problem/747/C
+747B,Mammoth's Genome Decoding,"implementation, strings",900,6032,0,https://codeforces.com/problemset/problem/747/B
+747A,Display Size,"brute force, math",800,7067,0,https://codeforces.com/problemset/problem/747/A
+746G,New Roads,"constructive algorithms, graphs, trees",2100,936,0,https://codeforces.com/problemset/problem/746/G
+746F,Music in Car,"data structures, greedy, two pointers",2200,465,0,https://codeforces.com/problemset/problem/746/F
+746E,Numbers Exchange,"greedy, implementation, math",1900,1395,0,https://codeforces.com/problemset/problem/746/E
+746D,Green and Black Tea,"constructive algorithms, greedy, math",1500,3828,0,https://codeforces.com/problemset/problem/746/D
+746C,Tram,"constructive algorithms, implementation, math",1600,3112,0,https://codeforces.com/problemset/problem/746/C
+746B,Decoding,"implementation, strings",900,12722,0,https://codeforces.com/problemset/problem/746/B
+746A,Compote,"implementation, math",800,12999,0,https://codeforces.com/problemset/problem/746/A
+745B,Hongcow Solves A Puzzle,implementation,1400,3245,0,https://codeforces.com/problemset/problem/745/B
+745A,Hongcow Learns the Cyclic Shift,"implementation, strings",900,7778,0,https://codeforces.com/problemset/problem/745/A
+744E,Hongcow Masters the Cyclic Shift,"strings, two pointers",3200,70,0,https://codeforces.com/problemset/problem/744/E
+744D,Hongcow Draws a Circle,geometry,3200,83,0,https://codeforces.com/problemset/problem/744/D
+744C,Hongcow Buys a Deck of Cards,"bitmasks, brute force, dp",2400,703,0,https://codeforces.com/problemset/problem/744/C
+744B,Hongcow's Game,"bitmasks, divide and conquer, interactive",1900,1385,0,https://codeforces.com/problemset/problem/744/B
+744A,Hongcow Builds A Nation,"dfs and similar, graphs",1500,5444,0,https://codeforces.com/problemset/problem/744/A
+743E,Vladik and cards,"binary search, bitmasks, brute force, dp",2200,1070,0,https://codeforces.com/problemset/problem/743/E
+743D,Chloe and pleasant prizes,"dfs and similar, dp, graphs, trees",1800,3150,0,https://codeforces.com/problemset/problem/743/D
+743C,Vladik and fractions,"brute force, constructive algorithms, math, number theory",1500,7363,0,https://codeforces.com/problemset/problem/743/C
+743B,Chloe and the sequence,"binary search, bitmasks, constructive algorithms, implementation",1200,9132,0,https://codeforces.com/problemset/problem/743/B
+743A,Vladik and flights,"constructive algorithms, greedy, implementation",1200,8494,0,https://codeforces.com/problemset/problem/743/A
+742B,Arpa’s obvious problem and Mehrdad’s terrible solution,"brute force, math, number theory",1500,6853,0,https://codeforces.com/problemset/problem/742/B
+742A,Arpa’s hard exam and Mehrdad’s naive cheat,"implementation, math, number theory",1000,17647,0,https://codeforces.com/problemset/problem/742/A
+741E,Arpa’s abnormal DNA and Mehrdad’s deep interest,"data structures, string suffix structures",3400,109,0,https://codeforces.com/problemset/problem/741/E
+741D,Arpa’s letter-marked tree and Mehrdad’s Dokhtar-kosh paths,"data structures, dfs and similar, trees",2900,910,0,https://codeforces.com/problemset/problem/741/D
+741C,Arpa’s overnight party and Mehrdad’s silent entering,"constructive algorithms, dfs and similar, graphs",2600,1344,0,https://codeforces.com/problemset/problem/741/C
+741B,Arpa's weak amphitheater and Mehrdad's valuable Hoses,"dfs and similar, dp, dsu",1600,3914,0,https://codeforces.com/problemset/problem/741/B
+741A,Arpa's loud Owf and Mehrdad's evil plan,"dfs and similar, math",1600,4710,0,https://codeforces.com/problemset/problem/741/A
+740B,Alyona and flowers,constructive algorithms,1200,5929,0,https://codeforces.com/problemset/problem/740/B
+740A,Alyona and copybooks,"brute force, implementation",1300,6964,0,https://codeforces.com/problemset/problem/740/A
+739E,Gosha is hunting,"brute force, data structures, dp, flows, math, probabilities, sortings",3000,776,0,https://codeforces.com/problemset/problem/739/E
+739D,Recover a functional graph,graph matchings,3400,93,0,https://codeforces.com/problemset/problem/739/D
+739C,Alyona and towers,data structures,2500,789,0,https://codeforces.com/problemset/problem/739/C
+739B,Alyona and a tree,"binary search, data structures, dfs and similar, graphs, trees",1900,3151,0,https://codeforces.com/problemset/problem/739/B
+739A,Alyona and mex,"constructive algorithms, greedy",1700,5367,0,https://codeforces.com/problemset/problem/739/A
+737F,Dirty plates,"constructive algorithms, math",3300,43,0,https://codeforces.com/problemset/problem/737/F
+737E,Tanya is 5!,"graph matchings, graphs, greedy, schedules",3300,48,0,https://codeforces.com/problemset/problem/737/E
+736E,Chess Championship,"constructive algorithms, flows, greedy, math",2900,137,0,https://codeforces.com/problemset/problem/736/E
+736D,Permutations,"math, matrices",2800,283,0,https://codeforces.com/problemset/problem/736/D
+735E,Ostap and Tree,"dp, trees",2500,540,0,https://codeforces.com/problemset/problem/735/E
+735D,Taxes,"math, number theory",1600,7828,0,https://codeforces.com/problemset/problem/735/D
+735C,Tennis Championship,"combinatorics, constructive algorithms, greedy, math",1600,5684,0,https://codeforces.com/problemset/problem/735/C
+735B,Urbanization,"greedy, number theory, sortings",1100,6561,0,https://codeforces.com/problemset/problem/735/B
+735A,Ostap and Grasshopper,"implementation, strings",800,9113,0,https://codeforces.com/problemset/problem/735/A
+734F,Anton and School,"bitmasks, constructive algorithms, implementation, math",2500,835,0,https://codeforces.com/problemset/problem/734/F
+734E,Anton and Tree,"dfs and similar, dp, trees",2100,2044,0,https://codeforces.com/problemset/problem/734/E
+734D,Anton and Chess,implementation,1700,3238,0,https://codeforces.com/problemset/problem/734/D
+734C,Anton and Making Potions,"binary search, dp, greedy, two pointers",1600,4307,0,https://codeforces.com/problemset/problem/734/C
+734B,Anton and Digits,"brute force, greedy, implementation, math",800,18545,0,https://codeforces.com/problemset/problem/734/B
+734A,Anton and Danik,"implementation, strings",800,44098,0,https://codeforces.com/problemset/problem/734/A
+733F,Drivers Dissatisfaction,"data structures, dsu, graphs, trees",2200,776,0,https://codeforces.com/problemset/problem/733/F
+733E,Sleep in Class,"constructive algorithms, data structures, math, two pointers",2400,521,0,https://codeforces.com/problemset/problem/733/E
+733D,Kostya the Sculptor,"data structures, hashing",1600,3527,0,https://codeforces.com/problemset/problem/733/D
+733C,Epidemic in Monstropolis,"constructive algorithms, dp, greedy, two pointers",1800,2762,0,https://codeforces.com/problemset/problem/733/C
+733B,Parade,math,1100,9019,0,https://codeforces.com/problemset/problem/733/B
+733A,Grasshopper And the String,implementation,1000,12671,0,https://codeforces.com/problemset/problem/733/A
+732F,Tourist Reform,"dfs and similar, graphs",2300,1091,0,https://codeforces.com/problemset/problem/732/F
+732E,Sockets,"greedy, sortings",2100,1398,0,https://codeforces.com/problemset/problem/732/E
+732D,Exams,"binary search, greedy, sortings",1700,4156,0,https://codeforces.com/problemset/problem/732/D
+732C,Sanatorium,"binary search, constructive algorithms, greedy, implementation, math",1200,7412,0,https://codeforces.com/problemset/problem/732/C
+732B,Cormen --- The Best Friend Of a Man,"dp, greedy",1000,16021,0,https://codeforces.com/problemset/problem/732/B
+732A,Buy a Shovel,"brute force, constructive algorithms, implementation, math",800,26237,0,https://codeforces.com/problemset/problem/732/A
+731F,Video Cards,"brute force, data structures, implementation, math, number theory",1900,2205,0,https://codeforces.com/problemset/problem/731/F
+731E,Funny Game,"dp, games",2200,975,0,https://codeforces.com/problemset/problem/731/E
+731D,80-th Level Archeology,"brute force, data structures, greedy, sortings",2200,906,0,https://codeforces.com/problemset/problem/731/D
+731C,Socks,"dfs and similar, dsu, graphs, greedy",1600,4752,0,https://codeforces.com/problemset/problem/731/C
+731B,Coupons and Discounts,"constructive algorithms, greedy",1100,6325,0,https://codeforces.com/problemset/problem/731/B
+731A,Night at the Museum,"implementation, strings",800,19180,0,https://codeforces.com/problemset/problem/731/A
+730L,Expression Queries,,3200,41,0,https://codeforces.com/problemset/problem/730/L
+730K,Roads Orientation Problem,graphs,3200,59,0,https://codeforces.com/problemset/problem/730/K
+730J,Bottles,dp,1900,1668,0,https://codeforces.com/problemset/problem/730/J
+730I,Olympiad in Programming and Sports,"dp, flows, graphs, greedy",2000,974,0,https://codeforces.com/problemset/problem/730/I
+730H,Delete Them,"constructive algorithms, implementation",1300,2335,0,https://codeforces.com/problemset/problem/730/H
+730G,Car Repair Shop,implementation,1600,1762,0,https://codeforces.com/problemset/problem/730/G
+730F,Ber Patio,,3100,60,0,https://codeforces.com/problemset/problem/730/F
+730E,Award Ceremony,"greedy, implementation",2200,573,0,https://codeforces.com/problemset/problem/730/E
+730D,Running Over The Bridges,"greedy, implementation, math",2200,539,0,https://codeforces.com/problemset/problem/730/D
+730C,Bulmart,"binary search, dfs and similar",2100,838,0,https://codeforces.com/problemset/problem/730/C
+730B,Minimum and Maximum,"constructive algorithms, interactive",1800,1786,0,https://codeforces.com/problemset/problem/730/B
+730A,Toda 2,"greedy, implementation",1800,1284,0,https://codeforces.com/problemset/problem/730/A
+729F,Financiers Game,dp,2500,636,0,https://codeforces.com/problemset/problem/729/F
+729E,Subordinates,"constructive algorithms, data structures, graphs, greedy, sortings",1900,1688,0,https://codeforces.com/problemset/problem/729/E
+729D,Sea Battle,"constructive algorithms, greedy, math",1700,2728,0,https://codeforces.com/problemset/problem/729/D
+729C,Road to Cinema,"binary search, greedy, sortings",1700,3048,0,https://codeforces.com/problemset/problem/729/C
+729B,Spotlights,"dp, implementation",1200,5199,0,https://codeforces.com/problemset/problem/729/B
+729A,Interview with Oleg,"implementation, strings",900,5652,0,https://codeforces.com/problemset/problem/729/A
+727F,Polycarp's problems,"binary search, dp, greedy",2300,453,0,https://codeforces.com/problemset/problem/727/F
+727E,Games on a CD,"data structures, hashing, string suffix structures, strings",2300,577,0,https://codeforces.com/problemset/problem/727/E
+727D,T-shirts Distribution,"constructive algorithms, flows, greedy",1800,1334,0,https://codeforces.com/problemset/problem/727/D
+727C,Guess the Array,"constructive algorithms, interactive, math",1400,3253,0,https://codeforces.com/problemset/problem/727/C
+727B,Bill Total Value,"expression parsing, implementation, strings",1600,1595,0,https://codeforces.com/problemset/problem/727/B
+727A,Transformation: from A to B,"brute force, dfs and similar, math",1000,6572,0,https://codeforces.com/problemset/problem/727/A
+725G,Messages on a Tree,,3300,76,0,https://codeforces.com/problemset/problem/725/G
+725F,Family Photos,"games, greedy",2900,231,0,https://codeforces.com/problemset/problem/725/F
+725E,Too Much Money,"brute force, greedy",2600,505,0,https://codeforces.com/problemset/problem/725/E
+725D,Contest Balloons,"data structures, greedy",1800,2126,0,https://codeforces.com/problemset/problem/725/D
+725C,Hidden Word,"brute force, constructive algorithms, implementation, strings",1600,2273,0,https://codeforces.com/problemset/problem/725/C
+725B,Food on the Plane,"implementation, math",1200,4399,0,https://codeforces.com/problemset/problem/725/B
+725A,Jumping Ball,implementation,1000,5559,0,https://codeforces.com/problemset/problem/725/A
+724G,Xor-matic Number of the Graph,"bitmasks, graphs, math, number theory, trees",2600,531,0,https://codeforces.com/problemset/problem/724/G
+724F,Uniformly Branched Trees,"combinatorics, dp, trees",2700,181,0,https://codeforces.com/problemset/problem/724/F
+724E,Goods transportation,"dp, flows, greedy",2900,649,0,https://codeforces.com/problemset/problem/724/E
+724D,Dense Subsequence,"data structures, greedy, strings",1900,1914,0,https://codeforces.com/problemset/problem/724/D
+724C,Ray Tracing,"greedy, hashing, implementation, math, number theory, sortings",1800,1731,0,https://codeforces.com/problemset/problem/724/C
+724B,Batch Sort,"brute force, greedy, implementation, math",1500,3413,0,https://codeforces.com/problemset/problem/724/B
+724A,Checking the Calendar,implementation,1000,5647,0,https://codeforces.com/problemset/problem/724/A
+723F,st-Spanning Tree,"dsu, graphs, greedy, implementation",2300,1088,0,https://codeforces.com/problemset/problem/723/F
+723E,One-Way Reform,"constructive algorithms, dfs and similar, flows, graphs, greedy",2200,1284,0,https://codeforces.com/problemset/problem/723/E
+723D,Lakes in Berland,"dfs and similar, dsu, graphs, greedy, implementation",1600,5003,0,https://codeforces.com/problemset/problem/723/D
+723C,Polycarp at the Radio,greedy,1600,3880,0,https://codeforces.com/problemset/problem/723/C
+723B,Text Document Analysis,"expression parsing, implementation, strings",1100,8000,0,https://codeforces.com/problemset/problem/723/B
+723A,The New Year: Meeting Friends,"implementation, math, sortings",800,25237,0,https://codeforces.com/problemset/problem/723/A
+722F,Cyclic Cipher,"chinese remainder theorem, data structures, implementation, number theory, two pointers",2800,284,0,https://codeforces.com/problemset/problem/722/F
+722E,Research Rover,"combinatorics, dp",2900,463,0,https://codeforces.com/problemset/problem/722/E
+722D,Generating Sets,"binary search, data structures, dfs and similar, greedy, strings, trees",1900,2555,0,https://codeforces.com/problemset/problem/722/D
+722C,Destroying Array,"data structures, dsu",1600,5101,0,https://codeforces.com/problemset/problem/722/C
+722B,Verse Pattern,"implementation, strings",1200,5418,0,https://codeforces.com/problemset/problem/722/B
+722A,Broken Clock,"brute force, implementation",1300,5442,0,https://codeforces.com/problemset/problem/722/A
+721E,Road to Home,"binary search, dp",2700,240,0,https://codeforces.com/problemset/problem/721/E
+721D,Maxim and Array,"constructive algorithms, data structures, greedy, math",2000,1902,0,https://codeforces.com/problemset/problem/721/D
+721C,Journey,"dp, graphs",1800,3633,0,https://codeforces.com/problemset/problem/721/C
+721B,Passwords,"implementation, math, sortings, strings",1100,9342,0,https://codeforces.com/problemset/problem/721/B
+721A,One-dimensional Japanese Crossword,implementation,800,14331,0,https://codeforces.com/problemset/problem/721/A
+720F,Array Covering,data structures,3100,48,0,https://codeforces.com/problemset/problem/720/F
+720E,Cipher,implementation,3100,31,0,https://codeforces.com/problemset/problem/720/E
+720D,Slalom,"data structures, dp, sortings",3100,85,0,https://codeforces.com/problemset/problem/720/D
+720C,Homework,constructive algorithms,3100,49,0,https://codeforces.com/problemset/problem/720/C
+720B,Cactusophobia,"dfs and similar, flows",2400,210,0,https://codeforces.com/problemset/problem/720/B
+720A,Closing ceremony,greedy,2000,540,0,https://codeforces.com/problemset/problem/720/A
+719B,Anatoly and Cockroaches,greedy,1400,6531,0,https://codeforces.com/problemset/problem/719/B
+719A,Vitya in the Countryside,implementation,1100,12219,0,https://codeforces.com/problemset/problem/719/A
+718E,Matvey's Birthday,"bitmasks, graphs",3300,156,0,https://codeforces.com/problemset/problem/718/E
+718D,Andrew and Chemistry,"dp, hashing, trees",2900,240,0,https://codeforces.com/problemset/problem/718/D
+718C,Sasha and Array,"data structures, math, matrices",2300,1741,0,https://codeforces.com/problemset/problem/718/C
+718A,Efim and Strange Grade,"dp, implementation, math",1700,3787,0,https://codeforces.com/problemset/problem/718/A
+717I,Cowboy Beblop at his computer,geometry,2800,179,0,https://codeforces.com/problemset/problem/717/I
+717H,Pokermon League challenge,"math, probabilities",2400,333,0,https://codeforces.com/problemset/problem/717/H
+717G,Underfail,flows,2400,440,0,https://codeforces.com/problemset/problem/717/G
+717F,Heroes of Making Magic III,data structures,2600,212,0,https://codeforces.com/problemset/problem/717/F
+717E,"Paint it really, really dark gray",dfs and similar,1900,1051,0,https://codeforces.com/problemset/problem/717/E
+717D,Dexterina’s Lab,"games, matrices, probabilities",1900,989,0,https://codeforces.com/problemset/problem/717/D
+717C,Potions Homework,"implementation, sortings",1200,2704,0,https://codeforces.com/problemset/problem/717/C
+717B,R3D3’s Summer Adventure,"dp, greedy",2700,80,0,https://codeforces.com/problemset/problem/717/B
+717A,Festival Organization,"math, number theory",2900,154,0,https://codeforces.com/problemset/problem/717/A
+716B,Complete the Word,"greedy, two pointers",1300,8186,0,https://codeforces.com/problemset/problem/716/B
+716A,Crazy Computer,implementation,800,15805,0,https://codeforces.com/problemset/problem/716/A
+715E,Complete the Permutations,"combinatorics, fft, graphs, math",3400,151,0,https://codeforces.com/problemset/problem/715/E
+715D,Create a Maze,constructive algorithms,3100,137,0,https://codeforces.com/problemset/problem/715/D
+715C,Digit Tree,"dfs and similar, divide and conquer, dsu, trees",2700,1006,0,https://codeforces.com/problemset/problem/715/C
+715B,Complete The Graph,"binary search, constructive algorithms, graphs, shortest paths",2300,1659,0,https://codeforces.com/problemset/problem/715/B
+715A,Plus and Square Root,"constructive algorithms, math",1600,4854,0,https://codeforces.com/problemset/problem/715/A
+714B,Filya and Homework,"implementation, sortings",1200,8769,0,https://codeforces.com/problemset/problem/714/B
+714A,Meeting of Old Friends,"implementation, math",1100,8512,0,https://codeforces.com/problemset/problem/714/A
+713E,Sonya Partymaker,"binary search, dp",3300,128,0,https://codeforces.com/problemset/problem/713/E
+713D,Animals and Puzzle,"binary search, data structures",2700,636,0,https://codeforces.com/problemset/problem/713/D
+713C,Sonya and Problem Wihtout a Legend,"dp, sortings",2300,1781,0,https://codeforces.com/problemset/problem/713/C
+713B,Searching Rectangles,"binary search, constructive algorithms, interactive",2200,1192,0,https://codeforces.com/problemset/problem/713/B
+713A,Sonya and Queries,"data structures, implementation",1400,6594,0,https://codeforces.com/problemset/problem/713/A
+712E,Memory and Casinos,"data structures, math, probabilities",2500,413,0,https://codeforces.com/problemset/problem/712/E
+712D,Memory and Scores,"combinatorics, dp, math",2200,1220,0,https://codeforces.com/problemset/problem/712/D
+712C,Memory and De-Evolution,"greedy, math",1600,4642,0,https://codeforces.com/problemset/problem/712/C
+712B,Memory and Trident,"implementation, strings",1100,7233,0,https://codeforces.com/problemset/problem/712/B
+712A,Memory and Crow,"implementation, math",800,9241,0,https://codeforces.com/problemset/problem/712/A
+711E,ZS and The Birthday Paradox,"math, number theory, probabilities",2300,1041,0,https://codeforces.com/problemset/problem/711/E
+711D,Directed Roads,"combinatorics, dfs and similar, graphs, math",1900,3125,0,https://codeforces.com/problemset/problem/711/D
+711C,Coloring Trees,dp,1700,5216,0,https://codeforces.com/problemset/problem/711/C
+711B,Chris and Magic Square,"constructive algorithms, implementation",1400,6979,0,https://codeforces.com/problemset/problem/711/B
+711A,Bus to Udayland,"brute force, implementation",800,20567,0,https://codeforces.com/problemset/problem/711/A
+710F,String Set Queries,"brute force, data structures, hashing, string suffix structures, strings",2400,614,0,https://codeforces.com/problemset/problem/710/F
+710E,Generate a String,"dfs and similar, dp",2000,3085,0,https://codeforces.com/problemset/problem/710/E
+710D,Two Arithmetic Progressions,"math, number theory",2500,567,0,https://codeforces.com/problemset/problem/710/D
+710C,Magic Odd Square,"constructive algorithms, math",1500,3796,0,https://codeforces.com/problemset/problem/710/C
+710B,Optimal Point on a Line,"brute force, sortings",1400,6065,0,https://codeforces.com/problemset/problem/710/B
+710A,King Moves,implementation,800,9498,0,https://codeforces.com/problemset/problem/710/A
+709B,Checkpoints,"greedy, implementation, sortings",1500,3984,0,https://codeforces.com/problemset/problem/709/B
+709A,Juicer,implementation,900,12930,0,https://codeforces.com/problemset/problem/709/A
+708E,Student's Camp,"dp, math",3100,294,0,https://codeforces.com/problemset/problem/708/E
+708D,Incorrect Flow,flows,2900,358,0,https://codeforces.com/problemset/problem/708/D
+708C,Centroids,"data structures, dfs and similar, dp, graphs, greedy, trees",2300,1284,0,https://codeforces.com/problemset/problem/708/C
+708B,Recover the String,"constructive algorithms, greedy, implementation, math",1900,2616,0,https://codeforces.com/problemset/problem/708/B
+708A,Letters Cyclic Shift,"constructive algorithms, greedy, implementation, strings",1200,6962,0,https://codeforces.com/problemset/problem/708/A
+707E,Garlands,data structures,2400,683,0,https://codeforces.com/problemset/problem/707/E
+707D,Persistent Bookcase,"bitmasks, data structures, dfs and similar, implementation",2200,1876,0,https://codeforces.com/problemset/problem/707/D
+707C,Pythagorean Triples,"math, number theory",1500,8206,0,https://codeforces.com/problemset/problem/707/C
+707B,Bakery,graphs,1300,9453,0,https://codeforces.com/problemset/problem/707/B
+707A,Brain's Photos,implementation,800,21918,0,https://codeforces.com/problemset/problem/707/A
+706E,Working routine,"data structures, implementation",2500,805,0,https://codeforces.com/problemset/problem/706/E
+706D,Vasiliy's Multiset,"binary search, bitmasks, data structures, trees",1800,4959,0,https://codeforces.com/problemset/problem/706/D
+706C,Hard problem,"dp, strings",1600,9437,0,https://codeforces.com/problemset/problem/706/C
+706B,Interesting drink,"binary search, dp, implementation",1100,22026,0,https://codeforces.com/problemset/problem/706/B
+706A,Beru-taxi,"brute force, geometry, implementation",900,10943,0,https://codeforces.com/problemset/problem/706/A
+705B,Spider Man,"games, math",1100,7095,0,https://codeforces.com/problemset/problem/705/B
+705A,Hulk,implementation,800,39681,0,https://codeforces.com/problemset/problem/705/A
+704E,Iron Man,"data structures, geometry, trees",3300,143,0,https://codeforces.com/problemset/problem/704/E
+704D,Captain America,"flows, greedy",3100,331,0,https://codeforces.com/problemset/problem/704/D
+704C,Black Widow,"dp, graphs, implementation, math",2900,289,0,https://codeforces.com/problemset/problem/704/C
+704B,Ant Man,"dp, graphs, greedy",2500,906,0,https://codeforces.com/problemset/problem/704/B
+704A,Thor,"brute force, data structures, implementation",1600,6089,0,https://codeforces.com/problemset/problem/704/A
+703E,Mishka and Divisors,"dp, number theory",2600,413,0,https://codeforces.com/problemset/problem/703/E
+703D,Mishka and Interesting sum,data structures,2100,2188,0,https://codeforces.com/problemset/problem/703/D
+703C,Chris and Road,"geometry, implementation",2100,1366,0,https://codeforces.com/problemset/problem/703/C
+703B,Mishka and trip,"implementation, math",1400,5070,0,https://codeforces.com/problemset/problem/703/B
+703A,Mishka and Game,implementation,800,23813,0,https://codeforces.com/problemset/problem/703/A
+702F,T-Shirts,data structures,2800,316,0,https://codeforces.com/problemset/problem/702/F
+702E,Analysis of Pathes in Functional Graph,"data structures, graphs",2100,1310,0,https://codeforces.com/problemset/problem/702/E
+702D,Road to Post Office,math,1900,2366,0,https://codeforces.com/problemset/problem/702/D
+702C,Cellular Network,"binary search, implementation, two pointers",1500,4726,0,https://codeforces.com/problemset/problem/702/C
+702B,Powers of Two,"brute force, data structures, implementation, math",1500,6259,0,https://codeforces.com/problemset/problem/702/B
+702A,Maximum Increase,"dp, greedy, implementation",800,18002,0,https://codeforces.com/problemset/problem/702/A
+701C,They Are Everywhere,"binary search, strings, two pointers",1500,7262,0,https://codeforces.com/problemset/problem/701/C
+701B,Cells Not Under Attack,"data structures, math",1200,8446,0,https://codeforces.com/problemset/problem/701/B
+701A,Cards,"greedy, implementation",800,14077,0,https://codeforces.com/problemset/problem/701/A
+700E,Cool Slogans,"string suffix structures, strings",3300,533,0,https://codeforces.com/problemset/problem/700/E
+700D,Huffman Coding on Segment,"data structures, greedy",3100,264,0,https://codeforces.com/problemset/problem/700/D
+700C,Break Up,"dfs and similar, graphs",2600,744,0,https://codeforces.com/problemset/problem/700/C
+700B,Connecting Universities,"dfs and similar, dp, graphs, trees",1800,2561,0,https://codeforces.com/problemset/problem/700/B
+700A,As Fast As Possible,"binary search, math",1900,2664,0,https://codeforces.com/problemset/problem/700/A
+699B,One Bomb,implementation,1400,5932,0,https://codeforces.com/problemset/problem/699/B
+699A,Launch of Collider,implementation,1000,8826,0,https://codeforces.com/problemset/problem/699/A
+698F,Coprime Permutation,"combinatorics, number theory",3000,123,0,https://codeforces.com/problemset/problem/698/F
+698E,Cron,,2800,84,0,https://codeforces.com/problemset/problem/698/E
+698D,Limak and Shooting Points,"brute force, geometry, math",2600,329,0,https://codeforces.com/problemset/problem/698/D
+698C,LRU,"bitmasks, dp, math, probabilities",2400,868,0,https://codeforces.com/problemset/problem/698/C
+698B,Fix a Tree,"constructive algorithms, dfs and similar, dsu, graphs, trees",1700,4103,0,https://codeforces.com/problemset/problem/698/B
+698A,Vacations,dp,1400,14347,0,https://codeforces.com/problemset/problem/698/A
+697B,Barnicle,"brute force, implementation, math, strings",1400,4779,0,https://codeforces.com/problemset/problem/697/B
+697A,Pineapple Incident,"implementation, math",900,9941,0,https://codeforces.com/problemset/problem/697/A
+696F,...Dary!,"binary search, geometry, two pointers",3300,76,0,https://codeforces.com/problemset/problem/696/F
+696E,...Wait for it...,"data structures, dsu, trees",3000,269,0,https://codeforces.com/problemset/problem/696/E
+696D,Legen...,"data structures, dp, matrices, strings",2500,654,0,https://codeforces.com/problemset/problem/696/D
+696C,PLEASE,"combinatorics, dp, implementation, math, matrices",2000,1480,0,https://codeforces.com/problemset/problem/696/C
+696B,Puzzles,"dfs and similar, math, probabilities, trees",1700,2627,0,https://codeforces.com/problemset/problem/696/B
+696A,Lorenzo Von Matterhorn,"brute force, data structures, implementation, trees",1500,4853,0,https://codeforces.com/problemset/problem/696/A
+691F,Couple Cover,"brute force, dp, number theory",2200,811,0,https://codeforces.com/problemset/problem/691/F
+691E,Xor-sequences,matrices,1900,1182,0,https://codeforces.com/problemset/problem/691/E
+691D,Swaps in Permutation,"dfs and similar, dsu, math",1700,2874,0,https://codeforces.com/problemset/problem/691/D
+691C,Exponential notation,"implementation, strings",1800,1652,0,https://codeforces.com/problemset/problem/691/C
+691B,s-palindrome,"implementation, strings",1600,3392,0,https://codeforces.com/problemset/problem/691/B
+691A,Fashion in Berland,implementation,1000,7024,0,https://codeforces.com/problemset/problem/691/A
+690F3,Tree of Life (hard),trees,3200,28,0,https://codeforces.com/problemset/problem/690/F3
+690F2,Tree of Life (medium),"constructive algorithms, hashing, trees",2700,47,0,https://codeforces.com/problemset/problem/690/F2
+690F1,Tree of Life (easy),,1300,1536,0,https://codeforces.com/problemset/problem/690/F1
+690E2,Photographs (II),,2600,102,0,https://codeforces.com/problemset/problem/690/E2
+690E1,Photographs (I),,1800,546,0,https://codeforces.com/problemset/problem/690/E1
+690D3,The Wall (hard),,2100,363,0,https://codeforces.com/problemset/problem/690/D3
+690D2,The Wall (medium),combinatorics,1800,912,0,https://codeforces.com/problemset/problem/690/D2
+690D1,The Wall (easy),,1200,1693,0,https://codeforces.com/problemset/problem/690/D1
+690C3,Brain Network (hard),trees,2200,637,0,https://codeforces.com/problemset/problem/690/C3
+690C2,Brain Network (medium),"dfs and similar, graphs, trees",1500,1883,0,https://codeforces.com/problemset/problem/690/C2
+690C1,Brain Network (easy),,1300,1775,0,https://codeforces.com/problemset/problem/690/C1
+690B3,Recover Polygon (hard),,2600,65,0,https://codeforces.com/problemset/problem/690/B3
+690B2,Recover Polygon (medium),geometry,2600,138,0,https://codeforces.com/problemset/problem/690/B2
+690B1,Recover Polygon (easy),,1700,746,0,https://codeforces.com/problemset/problem/690/B1
+690A3,Collective Mindsets (hard),,2400,202,0,https://codeforces.com/problemset/problem/690/A3
+690A2,Collective Mindsets (medium),,2300,352,0,https://codeforces.com/problemset/problem/690/A2
+690A1,Collective Mindsets (easy),,1100,1996,0,https://codeforces.com/problemset/problem/690/A1
+689E,Mike and Geometry Problem,"combinatorics, data structures, dp, geometry, implementation",2000,1069,0,https://codeforces.com/problemset/problem/689/E
+689D,Friends and Subsequences,"binary search, data structures",2100,1890,0,https://codeforces.com/problemset/problem/689/D
+689C,Mike and Chocolate Thieves,"binary search, combinatorics, math",1700,3190,0,https://codeforces.com/problemset/problem/689/C
+689B,Mike and Shortcuts,"dfs and similar, graphs, greedy, shortest paths",1600,4003,0,https://codeforces.com/problemset/problem/689/B
+689A,Mike and Cellphone,"brute force, constructive algorithms, implementation",1400,4405,0,https://codeforces.com/problemset/problem/689/A
+688B,Lovely Palindromes,"constructive algorithms, math",1000,15978,0,https://codeforces.com/problemset/problem/688/B
+688A,Opponents,implementation,800,11068,0,https://codeforces.com/problemset/problem/688/A
+687E,TOF,"dfs and similar, graphs",2900,217,0,https://codeforces.com/problemset/problem/687/E
+687D,Dividing Kingdom II,"brute force, data structures, dsu, graphs, sortings",2500,586,0,https://codeforces.com/problemset/problem/687/D
+687C,The Values You Can Make,dp,1900,3439,0,https://codeforces.com/problemset/problem/687/C
+687B,Remainders Game,"chinese remainder theorem, math, number theory",1800,3680,0,https://codeforces.com/problemset/problem/687/B
+687A,NP-Hard Problem,"dfs and similar, graphs",1500,8734,0,https://codeforces.com/problemset/problem/687/A
+686B,Little Robber Girl's Zoo,"constructive algorithms, implementation, sortings",1100,6177,0,https://codeforces.com/problemset/problem/686/B
+686A,Free Ice Cream,"constructive algorithms, implementation",800,16807,0,https://codeforces.com/problemset/problem/686/A
+685E,Travelling Through the Snow Queen's Kingdom,"bitmasks, brute force, divide and conquer, graphs",2800,272,0,https://codeforces.com/problemset/problem/685/E
+685D,Kay and Eternity,"brute force, implementation, sortings",2600,359,0,https://codeforces.com/problemset/problem/685/D
+685C,Optimal Point,"binary search, math",2900,349,0,https://codeforces.com/problemset/problem/685/C
+685B,Kay and Snowflake,"data structures, dfs and similar, dp, trees",1900,2405,0,https://codeforces.com/problemset/problem/685/B
+685A,Robbers' watch,"brute force, combinatorics, dp, math",1700,3658,0,https://codeforces.com/problemset/problem/685/A
+683J,The Hero with Bombs,*special problem,3000,26,0,https://codeforces.com/problemset/problem/683/J
+683I,Loader,*special problem,2500,25,0,https://codeforces.com/problemset/problem/683/I
+683H,Exchange of Books,*special problem,1900,76,0,https://codeforces.com/problemset/problem/683/H
+683G,The Fraction,*special problem,1900,110,0,https://codeforces.com/problemset/problem/683/G
+683F,Reformat the String,*special problem,1800,122,0,https://codeforces.com/problemset/problem/683/F
+683E,Hammer throwing,*special problem,1800,163,0,https://codeforces.com/problemset/problem/683/E
+683D,Chocolate Bar,"*special problem, math",1400,254,0,https://codeforces.com/problemset/problem/683/D
+683C,Symmetric Difference,*special problem,1600,282,0,https://codeforces.com/problemset/problem/683/C
+683B,The Teacher of Physical Education,*special problem,1600,287,0,https://codeforces.com/problemset/problem/683/B
+683A,The Check of the Point,"*special problem, geometry",1200,596,0,https://codeforces.com/problemset/problem/683/A
+682E,Alyona and Triangles,"geometry, two pointers",2600,477,0,https://codeforces.com/problemset/problem/682/E
+682D,Alyona and Strings,"dp, strings",1900,2394,0,https://codeforces.com/problemset/problem/682/D
+682C,Alyona and the Tree,"dfs and similar, dp, graphs, trees",1600,4875,0,https://codeforces.com/problemset/problem/682/C
+682B,Alyona and Mex,sortings,1200,7594,0,https://codeforces.com/problemset/problem/682/B
+682A,Alyona and Numbers,"constructive algorithms, math, number theory",1100,11323,0,https://codeforces.com/problemset/problem/682/A
+681E,Runaway to a Shadow,"geometry, sortings",2500,356,0,https://codeforces.com/problemset/problem/681/E
+681D,Gifts by the List,"constructive algorithms, dfs and similar, graphs, trees",2000,1425,0,https://codeforces.com/problemset/problem/681/D
+681C,Heap Operations,"constructive algorithms, data structures, greedy",1600,4422,0,https://codeforces.com/problemset/problem/681/C
+681B,Economy Game,brute force,1300,6727,0,https://codeforces.com/problemset/problem/681/B
+681A,A Good Contest,implementation,800,11172,0,https://codeforces.com/problemset/problem/681/A
+680B,Bear and Finding Criminals,"constructive algorithms, implementation",1000,12814,0,https://codeforces.com/problemset/problem/680/B
+680A,Bear and Five Cards,"constructive algorithms, implementation",800,9620,0,https://codeforces.com/problemset/problem/680/A
+679E,Bear and Bad Powers of 42,data structures,3100,292,0,https://codeforces.com/problemset/problem/679/E
+679D,Bear and Chase,"brute force, dfs and similar, graphs, implementation, math, probabilities",2900,231,0,https://codeforces.com/problemset/problem/679/D
+679C,Bear and Square Grid,"dfs and similar, dsu, implementation",2400,951,0,https://codeforces.com/problemset/problem/679/C
+679B,Bear and Tower of Cubes,"binary search, dp, greedy",2200,1806,0,https://codeforces.com/problemset/problem/679/B
+679A,Bear and Prime 100,"constructive algorithms, interactive, math",1400,7216,0,https://codeforces.com/problemset/problem/679/A
+678F,Lena and Queries,"data structures, divide and conquer, geometry",2500,350,0,https://codeforces.com/problemset/problem/678/F
+678E,Another Sith Tournament,"bitmasks, dp, math, probabilities",2200,1136,0,https://codeforces.com/problemset/problem/678/E
+678D,Iterated Linear Function,"math, number theory",1700,2890,0,https://codeforces.com/problemset/problem/678/D
+678C,Joty and Chocolate,"implementation, math, number theory",1600,5534,0,https://codeforces.com/problemset/problem/678/C
+678B,The Same Calendar,implementation,1600,3035,0,https://codeforces.com/problemset/problem/678/B
+678A,Johny Likes Numbers,"implementation, math",800,7889,0,https://codeforces.com/problemset/problem/678/A
+677E,Vanya and Balloons,"binary search, brute force, dp, implementation",2300,464,0,https://codeforces.com/problemset/problem/677/E
+677D,Vanya and Treasure,"data structures, dp, graphs, shortest paths",2300,1112,0,https://codeforces.com/problemset/problem/677/D
+677C,Vanya and Label,"bitmasks, combinatorics, implementation, strings",1500,4779,0,https://codeforces.com/problemset/problem/677/C
+677B,Vanya and Food Processor,"implementation, math",1400,5855,0,https://codeforces.com/problemset/problem/677/B
+677A,Vanya and Fence,implementation,800,41658,0,https://codeforces.com/problemset/problem/677/A
+676E,The Last Fight Between Human and AI,math,2400,768,0,https://codeforces.com/problemset/problem/676/E
+676D,Theseus and labyrinth,"graphs, implementation, shortest paths",2000,1502,0,https://codeforces.com/problemset/problem/676/D
+676C,Vasya and String,"binary search, dp, strings, two pointers",1500,9735,0,https://codeforces.com/problemset/problem/676/C
+676B,Pyramid of Glasses,"implementation, math",1500,4356,0,https://codeforces.com/problemset/problem/676/B
+676A,Nicholas and Permutation,"constructive algorithms, implementation",800,10286,0,https://codeforces.com/problemset/problem/676/A
+675E,Trains and Statistic,"data structures, dp, greedy",2300,1513,0,https://codeforces.com/problemset/problem/675/E
+675D,Дерево,"data structures, trees",1800,2818,0,https://codeforces.com/problemset/problem/675/D
+675C,Money Transfers,"constructive algorithms, data structures, greedy, sortings",2100,2863,0,https://codeforces.com/problemset/problem/675/C
+675B,Restoring Painting,"brute force, constructive algorithms, math",1400,5851,0,https://codeforces.com/problemset/problem/675/B
+675A,Infinite Sequence,math,1100,11193,0,https://codeforces.com/problemset/problem/675/A
+673B,Problems for Round,"greedy, implementation",1300,3056,0,https://codeforces.com/problemset/problem/673/B
+673A,Bear and Game,implementation,800,7096,0,https://codeforces.com/problemset/problem/673/A
+672B,Different is Good,"constructive algorithms, implementation, strings",1000,11436,0,https://codeforces.com/problemset/problem/672/B
+672A,Summer Camp,implementation,800,11039,0,https://codeforces.com/problemset/problem/672/A
+671E,Organizing a Race,"data structures, greedy",3300,143,0,https://codeforces.com/problemset/problem/671/E
+671D,Roads in Yusland,"data structures, dp, greedy",2900,572,0,https://codeforces.com/problemset/problem/671/D
+671C,Ultimate Weirdness of an Array,"data structures, number theory",2800,465,0,https://codeforces.com/problemset/problem/671/C
+671B,Robin Hood,"binary search, greedy",2000,2396,0,https://codeforces.com/problemset/problem/671/B
+671A,Recycling Bottles,"dp, geometry, greedy, implementation",1800,3595,0,https://codeforces.com/problemset/problem/671/A
+670F,Restore a Number,"brute force, constructive algorithms, strings",2300,727,0,https://codeforces.com/problemset/problem/670/F
+670E,Correct Bracket Sequence Editor,"data structures, dsu, strings",1700,2544,0,https://codeforces.com/problemset/problem/670/E
+670D2,Magic Powder - 2,"binary search, implementation",1500,5943,0,https://codeforces.com/problemset/problem/670/D2
+670D1,Magic Powder - 1,"binary search, brute force, implementation",1400,6945,0,https://codeforces.com/problemset/problem/670/D1
+670C,Cinema,"implementation, sortings",1300,6209,0,https://codeforces.com/problemset/problem/670/C
+670B,Game of Robots,implementation,1000,7890,0,https://codeforces.com/problemset/problem/670/B
+670A,Holidays,"brute force, constructive algorithms, greedy, math",900,11354,0,https://codeforces.com/problemset/problem/670/A
+669A,Little Artem and Presents,math,800,7358,0,https://codeforces.com/problemset/problem/669/A
+667B,Coat of Anticubism,"constructive algorithms, geometry",1100,4378,0,https://codeforces.com/problemset/problem/667/B
+667A,Pouring Rain,"geometry, math",1100,5639,0,https://codeforces.com/problemset/problem/667/A
+666E,Forensic Examination,"data structures, string suffix structures",3100,600,0,https://codeforces.com/problemset/problem/666/E
+666D,Chain Reaction,"brute force, geometry",3000,169,0,https://codeforces.com/problemset/problem/666/D
+666C,Codeword,"combinatorics, strings",2500,514,0,https://codeforces.com/problemset/problem/666/C
+666B,World Tour,"graphs, shortest paths",2000,1489,0,https://codeforces.com/problemset/problem/666/B
+666A,Reberland Linguistics,"dp, implementation, strings",1800,2871,0,https://codeforces.com/problemset/problem/666/A
+665F,Four Divisors,"data structures, dp, math, number theory, sortings, two pointers",2400,296,0,https://codeforces.com/problemset/problem/665/F
+665E,Beautiful Subarrays,"data structures, divide and conquer, strings, trees",2100,1301,0,https://codeforces.com/problemset/problem/665/E
+665D,Simple Subset,"constructive algorithms, greedy, number theory",1800,1920,0,https://codeforces.com/problemset/problem/665/D
+665C,Simple Strings,"dp, greedy, strings",1300,5746,0,https://codeforces.com/problemset/problem/665/C
+665B,Shopping,brute force,1400,2510,0,https://codeforces.com/problemset/problem/665/B
+665A,Buses Between Cities,implementation,1600,2083,0,https://codeforces.com/problemset/problem/665/A
+664A,Complicated GCD,"math, number theory",800,9961,0,https://codeforces.com/problemset/problem/664/A
+663A,Rebus,"constructive algorithms, expression parsing, greedy, math",1800,2578,0,https://codeforces.com/problemset/problem/663/A
+662E,To Hack or not to Hack,"brute force, dp, greedy",3100,82,0,https://codeforces.com/problemset/problem/662/E
+662D,International Olympiad,"constructive algorithms, greedy, implementation, math",2000,1425,0,https://codeforces.com/problemset/problem/662/D
+662C,Binary Table,"bitmasks, brute force, divide and conquer, dp, fft, math",2600,1010,0,https://codeforces.com/problemset/problem/662/C
+662B,Graph Coloring,"dfs and similar, graphs",2200,1043,0,https://codeforces.com/problemset/problem/662/B
+662A,Gambling Nim,"bitmasks, math, matrices, probabilities",2400,238,0,https://codeforces.com/problemset/problem/662/A
+661H,Rotate Matrix,*special problem,2400,36,0,https://codeforces.com/problemset/problem/661/H
+661G,Hungarian Notation,*special problem,2200,35,0,https://codeforces.com/problemset/problem/661/G
+661F,Primes in Interval,*special problem,1900,74,0,https://codeforces.com/problemset/problem/661/F
+661E,Divisibility Check,*special problem,2000,60,0,https://codeforces.com/problemset/problem/661/E
+661D,Maximal Difference,*special problem,2100,111,0,https://codeforces.com/problemset/problem/661/D
+661C,Array Sum,*special problem,2000,106,0,https://codeforces.com/problemset/problem/661/C
+661B,Seasons,*special problem,1900,196,0,https://codeforces.com/problemset/problem/661/B
+661A,Lazy Caterer Sequence,*special problem,1300,474,0,https://codeforces.com/problemset/problem/661/A
+660F,Bear and Bowling 4,"binary search, data structures, geometry, ternary search",2500,696,0,https://codeforces.com/problemset/problem/660/F
+660E,Different Subsets For All Tuples,combinatorics,2300,494,0,https://codeforces.com/problemset/problem/660/E
+660D,Number of Parallelograms,geometry,1900,2378,0,https://codeforces.com/problemset/problem/660/D
+660C,Hard Process,"binary search, dp, two pointers",1600,5117,0,https://codeforces.com/problemset/problem/660/C
+660B,Seating On Bus,implementation,1000,3806,0,https://codeforces.com/problemset/problem/660/B
+660A,Co-prime Array,"greedy, implementation, math, number theory",1200,5069,0,https://codeforces.com/problemset/problem/660/A
+659G,Fence Divercity,"combinatorics, dp, number theory",2300,717,0,https://codeforces.com/problemset/problem/659/G
+659F,Polycarp and Hay,"dfs and similar, dsu, graphs, greedy, sortings",2000,1358,0,https://codeforces.com/problemset/problem/659/F
+659E,New Reform,"data structures, dfs and similar, dsu, graphs, greedy",1600,5178,0,https://codeforces.com/problemset/problem/659/E
+659D,Bicycle Race,"geometry, implementation, math",1500,4864,0,https://codeforces.com/problemset/problem/659/D
+659C,Tanya and Toys,"greedy, implementation",1200,8985,0,https://codeforces.com/problemset/problem/659/C
+659B,Qualifying Contest,"constructive algorithms, sortings",1300,5195,0,https://codeforces.com/problemset/problem/659/B
+659A,Round House,"implementation, math",1000,11576,0,https://codeforces.com/problemset/problem/659/A
+658A,Bear and Reverse Radewoosh,implementation,800,5746,0,https://codeforces.com/problemset/problem/658/A
+656G,You're a Professional,*special problem,1900,406,0,https://codeforces.com/problemset/problem/656/G
+656F,Ace It!,*special problem,1900,513,0,https://codeforces.com/problemset/problem/656/F
+656E,Out of Controls,*special problem,2000,584,0,https://codeforces.com/problemset/problem/656/E
+656D,Rosetta Problem,*special problem,2100,599,0,https://codeforces.com/problemset/problem/656/D
+656C,Without Text,*special problem,2000,489,0,https://codeforces.com/problemset/problem/656/C
+656B,Scrambled,"*special problem, implementation",1700,1478,0,https://codeforces.com/problemset/problem/656/B
+656A,Da Vinci Powers,*special problem,1900,2909,0,https://codeforces.com/problemset/problem/656/A
+653G,Move by Prime,"combinatorics, math, number theory",3100,225,0,https://codeforces.com/problemset/problem/653/G
+653F,Paper task,"data structures, string suffix structures, strings",2600,490,0,https://codeforces.com/problemset/problem/653/F
+653E,Bear and Forgotten Tree 2,"dfs and similar, dsu, graphs, trees",2400,920,0,https://codeforces.com/problemset/problem/653/E
+653D,Delivery Bears,"binary search, flows, graphs",2200,1512,0,https://codeforces.com/problemset/problem/653/D
+653C,Bear and Up-Down,"brute force, implementation",1900,1368,0,https://codeforces.com/problemset/problem/653/C
+653B,Bear and Compressing,"brute force, dfs and similar, dp, strings",1300,3884,0,https://codeforces.com/problemset/problem/653/B
+653A,Bear and Three Balls,"brute force, implementation, sortings",900,5632,0,https://codeforces.com/problemset/problem/653/A
+652F,Ants on a Circle,"constructive algorithms, math",2800,198,0,https://codeforces.com/problemset/problem/652/F
+652E,Pursuit For Artifacts,"dfs and similar, dsu, graphs, trees",2300,913,0,https://codeforces.com/problemset/problem/652/E
+652D,Nested Segments,"data structures, sortings",1800,2095,0,https://codeforces.com/problemset/problem/652/D
+652C,Foe Pairs,"combinatorics, sortings, two pointers",1800,1986,0,https://codeforces.com/problemset/problem/652/C
+652B,z-sort,sortings,1000,5679,0,https://codeforces.com/problemset/problem/652/B
+652A,Gabriel and Caterpillar,"implementation, math",1400,3243,0,https://codeforces.com/problemset/problem/652/A
+651B,Beautiful Paintings,"greedy, sortings",1200,8265,0,https://codeforces.com/problemset/problem/651/B
+651A,Joysticks,"dp, greedy, implementation, math",1100,15246,0,https://codeforces.com/problemset/problem/651/A
+650E,Clockwork Bomb,"data structures, dfs and similar, dsu, greedy, trees",3200,326,0,https://codeforces.com/problemset/problem/650/E
+650D,Zip-line,"binary search, data structures, dp, hashing",2600,785,0,https://codeforces.com/problemset/problem/650/D
+650C,Table Compression,"dfs and similar, dp, dsu, graphs, greedy",2200,1464,0,https://codeforces.com/problemset/problem/650/C
+650B,Image Preview,"binary search, brute force, dp, two pointers",1900,2759,0,https://codeforces.com/problemset/problem/650/B
+650A,Watchmen,"data structures, geometry, math",1400,9747,0,https://codeforces.com/problemset/problem/650/A
+645G,Armistice Area Apportionment,"binary search, geometry",3200,84,0,https://codeforces.com/problemset/problem/645/G
+645F,Cowslip Collections,"combinatorics, math, number theory",2500,442,0,https://codeforces.com/problemset/problem/645/F
+645E,Intellectual Inquiry,"dp, greedy, strings",2200,983,0,https://codeforces.com/problemset/problem/645/E
+645D,Robot Rapping Results Report,"binary search, dp, graphs",1800,2029,0,https://codeforces.com/problemset/problem/645/D
+645C,Enduring Exodus,"binary search, two pointers",1600,2311,0,https://codeforces.com/problemset/problem/645/C
+645B,Mischievous Mess Makers,"greedy, math",1200,2572,0,https://codeforces.com/problemset/problem/645/B
+645A,Amity Assessment,"brute force, constructive algorithms, implementation",1200,2540,0,https://codeforces.com/problemset/problem/645/A
+644C,Hostname Aliases,"*special problem, binary search, data structures, implementation, sortings, strings",2100,823,0,https://codeforces.com/problemset/problem/644/C
+644B,Processing Queries,"*special problem, constructive algorithms, data structures, two pointers",1700,2235,0,https://codeforces.com/problemset/problem/644/B
+644A,Parliament of Berland,"*special problem, constructive algorithms",1000,3711,0,https://codeforces.com/problemset/problem/644/A
+643G,Choosing Ads,data structures,3200,288,0,https://codeforces.com/problemset/problem/643/G
+643F,Bears and Juice,"dp, math, meet-in-the-middle",2900,264,0,https://codeforces.com/problemset/problem/643/F
+643E,Bear and Destroying Subtrees,"dp, math, probabilities, trees",2700,332,0,https://codeforces.com/problemset/problem/643/E
+643D,Bearish Fanpages,,2900,213,0,https://codeforces.com/problemset/problem/643/D
+643C,Levels and Regions,dp,2400,799,0,https://codeforces.com/problemset/problem/643/C
+643B,Bear and Two Paths,"constructive algorithms, graphs",1600,2616,0,https://codeforces.com/problemset/problem/643/B
+643A,Bear and Colors,implementation,1500,3455,0,https://codeforces.com/problemset/problem/643/A
+641G,Little Artem and Graph,,2300,64,0,https://codeforces.com/problemset/problem/641/G
+641F,Little Artem and 2-SAT,,3000,104,0,https://codeforces.com/problemset/problem/641/F
+641E,Little Artem and Time Machine,data structures,2000,1875,0,https://codeforces.com/problemset/problem/641/E
+641D,Little Artem and Random Variable,"dp, implementation, math, probabilities",2400,717,0,https://codeforces.com/problemset/problem/641/D
+641C,Little Artem and Dance,"brute force, constructive algorithms, implementation",1800,2452,0,https://codeforces.com/problemset/problem/641/C
+641B,Little Artem and Matrix,implementation,1400,3394,0,https://codeforces.com/problemset/problem/641/B
+641A,Little Artem and Grasshopper,implementation,1000,4870,0,https://codeforces.com/problemset/problem/641/A
+639F,Bear and Chemistry,"data structures, dfs and similar, graphs, trees",3300,185,0,https://codeforces.com/problemset/problem/639/F
+639E,Bear and Paradox,"binary search, greedy, math, sortings",2800,361,0,https://codeforces.com/problemset/problem/639/E
+639D,Bear and Contribution,"data structures, greedy, sortings, two pointers",2400,638,0,https://codeforces.com/problemset/problem/639/D
+639C,Bear and Polynomials,"hashing, implementation, math",2200,1055,0,https://codeforces.com/problemset/problem/639/C
+639B,Bear and Forgotten Tree 3,"constructive algorithms, graphs, trees",1600,5054,0,https://codeforces.com/problemset/problem/639/B
+639A,Bear and Displayed Friends,implementation,1200,4845,0,https://codeforces.com/problemset/problem/639/A
+638D,Three-dimensional Turtle Super Computer,"brute force, dfs and similar, graphs",1800,579,0,https://codeforces.com/problemset/problem/638/D
+638C,Road Improvement,"*special problem, dfs and similar, graphs, greedy, trees",1800,932,0,https://codeforces.com/problemset/problem/638/C
+638B,Making Genome in Berland,"*special problem, dfs and similar, strings",1500,1447,0,https://codeforces.com/problemset/problem/638/B
+638A,Home Numbers,"*special problem, constructive algorithms, math",1100,2909,0,https://codeforces.com/problemset/problem/638/A
+637D,Running with Obstacles,"*special problem, data structures, dp, greedy",1600,1651,0,https://codeforces.com/problemset/problem/637/D
+637C,Promocodes with Mistakes,"*special problem, brute force, constructive algorithms, implementation",1400,2219,0,https://codeforces.com/problemset/problem/637/C
+637B,Chat Order,"*special problem, binary search, constructive algorithms, data structures, sortings",1200,6309,0,https://codeforces.com/problemset/problem/637/B
+637A,Voting for Photos,"*special problem, constructive algorithms, implementation",1000,4003,0,https://codeforces.com/problemset/problem/637/A
+635A,Orchestra,"brute force, implementation",1100,2268,0,https://codeforces.com/problemset/problem/635/A
+634A,Island Puzzle,"constructive algorithms, implementation",1300,2625,0,https://codeforces.com/problemset/problem/634/A
+633H,Fibonacci-ish II,"data structures, implementation",3100,267,0,https://codeforces.com/problemset/problem/633/H
+633G,Yash And Trees,"bitmasks, data structures, dfs and similar, math, number theory",2800,433,0,https://codeforces.com/problemset/problem/633/G
+633F,The Chocolate Spree,"dfs and similar, dp, graphs, trees",2600,481,0,https://codeforces.com/problemset/problem/633/F
+633E,Startup Funding,"binary search, constructive algorithms, data structures, probabilities, two pointers",2400,468,0,https://codeforces.com/problemset/problem/633/E
+633D,Fibonacci-ish,"brute force, dp, hashing, implementation, math",2000,1904,0,https://codeforces.com/problemset/problem/633/D
+633C,Spy Syndrome 2,"data structures, dp, hashing, implementation, sortings, string suffix structures, strings",1900,1791,0,https://codeforces.com/problemset/problem/633/C
+633B,A Trivial Problem,"brute force, constructive algorithms, math, number theory",1300,4914,0,https://codeforces.com/problemset/problem/633/B
+633A,Ebony and Ivory,"brute force, math, number theory",1100,7465,0,https://codeforces.com/problemset/problem/633/A
+632F,Magic Matrix,"brute force, divide and conquer, graphs, matrices, trees",2400,437,0,https://codeforces.com/problemset/problem/632/F
+632E,Thief in a Shop,"divide and conquer, dp, fft, math",2400,1211,0,https://codeforces.com/problemset/problem/632/E
+632D,Longest Subsequence,"brute force, math, number theory",2100,1768,0,https://codeforces.com/problemset/problem/632/D
+632C,The Smallest String Concatenation,"sortings, strings",1700,3417,0,https://codeforces.com/problemset/problem/632/C
+632B,"Alice, Bob, Two Teams","brute force, constructive algorithms",1400,2858,0,https://codeforces.com/problemset/problem/632/B
+632A,Grandma Laura and Apples,,1200,3373,0,https://codeforces.com/problemset/problem/632/A
+631E,Product Sum,"data structures, dp, geometry",2600,1097,0,https://codeforces.com/problemset/problem/631/E
+631D,Messenger,"data structures, hashing, implementation, string suffix structures, strings",2100,1555,0,https://codeforces.com/problemset/problem/631/D
+631C,Report,"data structures, sortings",1700,2979,0,https://codeforces.com/problemset/problem/631/C
+631B,Print Check,"constructive algorithms, implementation",1200,5533,0,https://codeforces.com/problemset/problem/631/B
+631A,Interview,"brute force, implementation",900,6902,0,https://codeforces.com/problemset/problem/631/A
+630R,Game,"games, math",1200,5298,0,https://codeforces.com/problemset/problem/630/R
+630Q,Pyramids,"geometry, math",1700,851,0,https://codeforces.com/problemset/problem/630/Q
+630P,Area of a Star,geometry,2100,637,0,https://codeforces.com/problemset/problem/630/P
+630O,Arrow,geometry,2000,518,0,https://codeforces.com/problemset/problem/630/O
+630N,Forecast,math,1300,3266,0,https://codeforces.com/problemset/problem/630/N
+630M,Turn,"geometry, math",1800,812,0,https://codeforces.com/problemset/problem/630/M
+630L,Cracking the Code,"implementation, math",1400,2476,0,https://codeforces.com/problemset/problem/630/L
+630K,Indivisibility,"math, number theory",1500,2891,0,https://codeforces.com/problemset/problem/630/K
+630J,Divisibility,"math, number theory",1100,6694,0,https://codeforces.com/problemset/problem/630/J
+630I,Parking Lot,"combinatorics, math",1700,2485,0,https://codeforces.com/problemset/problem/630/I
+630H,Benches,"combinatorics, math",1400,2714,0,https://codeforces.com/problemset/problem/630/H
+630G,Challenge Pennants,"combinatorics, math",1600,1643,0,https://codeforces.com/problemset/problem/630/G
+630F,Selection of Personnel,"combinatorics, math",1300,4116,0,https://codeforces.com/problemset/problem/630/F
+630E,A rectangle,math,1900,1497,0,https://codeforces.com/problemset/problem/630/E
+630D,Hexagons!,math,1100,6058,0,https://codeforces.com/problemset/problem/630/D
+630C,Lucky Numbers,"combinatorics, math",1100,10454,0,https://codeforces.com/problemset/problem/630/C
+630B,Moore's Law,math,1200,4830,0,https://codeforces.com/problemset/problem/630/B
+630A,Again Twenty Five!,number theory,800,19388,0,https://codeforces.com/problemset/problem/630/A
+629E,Famil Door and Roads,"combinatorics, data structures, dfs and similar, dp, probabilities, trees",2300,635,0,https://codeforces.com/problemset/problem/629/E
+629D,Babaei and Birthday Cake,"data structures, dp",2000,2657,0,https://codeforces.com/problemset/problem/629/D
+629C,Famil Door and Brackets,"dp, strings",2000,2123,0,https://codeforces.com/problemset/problem/629/C
+629B,Far Relative’s Problem,brute force,1100,6209,0,https://codeforces.com/problemset/problem/629/B
+629A,Far Relative’s Birthday Cake,"brute force, combinatorics, constructive algorithms, implementation",800,8942,0,https://codeforces.com/problemset/problem/629/A
+628F,Bear and Fair Set,flows,2500,374,0,https://codeforces.com/problemset/problem/628/F
+628E,Zbazi in Zeydabad,"data structures, implementation",2300,477,0,https://codeforces.com/problemset/problem/628/E
+628D,Magic Numbers,dp,2200,2148,0,https://codeforces.com/problemset/problem/628/D
+628C,Bear and String Distance,"greedy, strings",1300,3793,0,https://codeforces.com/problemset/problem/628/C
+628B,New Skateboard,dp,1300,6207,0,https://codeforces.com/problemset/problem/628/B
+628A,Tennis Tournament,"implementation, math",1000,4399,0,https://codeforces.com/problemset/problem/628/A
+627F,Island Puzzle,"dfs and similar, dsu, graphs, trees",3400,102,0,https://codeforces.com/problemset/problem/627/F
+627E,Orchestra,two pointers,3000,256,0,https://codeforces.com/problemset/problem/627/E
+627D,Preorder Test,"binary search, dfs and similar, dp, graphs, greedy, trees",2600,503,0,https://codeforces.com/problemset/problem/627/D
+627C,Package Delivery,"data structures, divide and conquer, greedy",2200,898,0,https://codeforces.com/problemset/problem/627/C
+627B,Factory Repairs,data structures,1700,1932,0,https://codeforces.com/problemset/problem/627/B
+627A,XOR Equation,"dp, math",1700,2736,0,https://codeforces.com/problemset/problem/627/A
+626G,Raffles,"data structures, dp, greedy, math",3100,271,0,https://codeforces.com/problemset/problem/626/G
+626F,Group Projects,dp,2400,1365,0,https://codeforces.com/problemset/problem/626/F
+626E,Simple Skewness,"binary search, math, ternary search",2400,899,0,https://codeforces.com/problemset/problem/626/E
+626D,Jerry's Protest,"brute force, combinatorics, dp, probabilities",1800,2150,0,https://codeforces.com/problemset/problem/626/D
+626C,Block Towers,"brute force, greedy, math, number theory",1600,3509,0,https://codeforces.com/problemset/problem/626/C
+626B,Cards,"constructive algorithms, dp, math",1300,5133,0,https://codeforces.com/problemset/problem/626/B
+626A,Robot Sequence,"brute force, implementation",1000,4997,0,https://codeforces.com/problemset/problem/626/A
+625E,Frog Fights,"data structures, greedy",2800,147,0,https://codeforces.com/problemset/problem/625/E
+625D,Finals in arithmetic,"constructive algorithms, implementation, math",2400,506,0,https://codeforces.com/problemset/problem/625/D
+625C,K-special Tables,"constructive algorithms, implementation",1300,5362,0,https://codeforces.com/problemset/problem/625/C
+625B,War of the Corporations,"constructive algorithms, greedy, strings",1200,7170,0,https://codeforces.com/problemset/problem/625/B
+625A,Guest From the Past,"implementation, math",1700,4440,0,https://codeforces.com/problemset/problem/625/A
+624B,Making a String,"greedy, sortings",1100,6113,0,https://codeforces.com/problemset/problem/624/B
+624A,Save Luke,math,800,7514,0,https://codeforces.com/problemset/problem/624/A
+623E,Transforming Sequence,"combinatorics, dp, fft, math",3300,265,0,https://codeforces.com/problemset/problem/623/E
+623D,Birthday,"greedy, math, probabilities",2700,304,0,https://codeforces.com/problemset/problem/623/D
+623C,Electric Charges,"binary search, dp",2900,349,0,https://codeforces.com/problemset/problem/623/C
+623B,Array GCD,"dp, greedy, number theory",2300,1390,0,https://codeforces.com/problemset/problem/623/B
+623A,Graph and String,"constructive algorithms, graphs",1800,3521,0,https://codeforces.com/problemset/problem/623/A
+622F,The Sum of the k-th Powers,math,2600,1019,0,https://codeforces.com/problemset/problem/622/F
+622E,Ants in Leaves,"dfs and similar, greedy, sortings, trees",2200,1184,0,https://codeforces.com/problemset/problem/622/E
+622D,Optimal Number Permutation,constructive algorithms,1900,1923,0,https://codeforces.com/problemset/problem/622/D
+622C,Not Equal on a Segment,"data structures, implementation",1700,4004,0,https://codeforces.com/problemset/problem/622/C
+622B,The Time,implementation,900,6104,0,https://codeforces.com/problemset/problem/622/B
+622A,Infinite Sequence,"implementation, math",1000,6509,0,https://codeforces.com/problemset/problem/622/A
+621E,Wet Shark and Blocks,"dp, matrices",2000,1827,0,https://codeforces.com/problemset/problem/621/E
+621D,Rat Kwesh and Cheese,"brute force, constructive algorithms, math",2400,837,0,https://codeforces.com/problemset/problem/621/D
+621C,Wet Shark and Flowers,"combinatorics, math, number theory, probabilities",1700,3715,0,https://codeforces.com/problemset/problem/621/C
+621B,Wet Shark and Bishops,"combinatorics, implementation",1300,7633,0,https://codeforces.com/problemset/problem/621/B
+621A,Wet Shark and Odd and Even,implementation,900,13628,0,https://codeforces.com/problemset/problem/621/A
+620F,Xors on Segments,"data structures, strings, trees",2800,375,0,https://codeforces.com/problemset/problem/620/F
+620E,New Year Tree,"bitmasks, data structures, trees",2100,2305,0,https://codeforces.com/problemset/problem/620/E
+620D,Professor GukiZ and Two Arrays,"binary search, two pointers",2200,1063,0,https://codeforces.com/problemset/problem/620/D
+620C,Pearls in a Row,greedy,1500,4073,0,https://codeforces.com/problemset/problem/620/C
+620B,Grandfather Dovlet’s calculator,implementation,1000,6609,0,https://codeforces.com/problemset/problem/620/B
+620A,Professor GukiZ's Robot,"implementation, math",800,8704,0,https://codeforces.com/problemset/problem/620/A
+618G,Combining Slimes,"dp, math, matrices, probabilities",3300,105,0,https://codeforces.com/problemset/problem/618/G
+618F,Double Knapsack,"constructive algorithms, two pointers",3000,498,0,https://codeforces.com/problemset/problem/618/F
+618E,Robot Arm,"data structures, geometry",2500,457,0,https://codeforces.com/problemset/problem/618/E
+618D,Hamiltonian Spanning Tree,"dfs and similar, dp, graph matchings, greedy, trees",2200,1346,0,https://codeforces.com/problemset/problem/618/D
+618C,Constellation,"geometry, implementation",1600,3401,0,https://codeforces.com/problemset/problem/618/C
+618B,Guess the Permutation,constructive algorithms,1100,5979,0,https://codeforces.com/problemset/problem/618/B
+618A,Slime Combining,implementation,800,6800,0,https://codeforces.com/problemset/problem/618/A
+617E,XOR and Favorite Number,data structures,2200,3312,0,https://codeforces.com/problemset/problem/617/E
+617D,Polyline,"constructive algorithms, implementation",1700,3470,0,https://codeforces.com/problemset/problem/617/D
+617C,Watering Flowers,implementation,1600,3924,0,https://codeforces.com/problemset/problem/617/C
+617B,Chocolate,combinatorics,1300,10308,0,https://codeforces.com/problemset/problem/617/B
+617A,Elephant,math,800,48338,0,https://codeforces.com/problemset/problem/617/A
+616F,Expensive Strings,"string suffix structures, strings",2700,306,0,https://codeforces.com/problemset/problem/616/F
+616E,Sum of Remainders,"implementation, math, number theory",2200,1310,0,https://codeforces.com/problemset/problem/616/E
+616D,Longest k-Good Segment,"binary search, data structures, two pointers",1600,4298,0,https://codeforces.com/problemset/problem/616/D
+616C,The Labyrinth,dfs and similar,1600,3487,0,https://codeforces.com/problemset/problem/616/C
+616B,Dinner with Emma,"games, greedy",1000,7113,0,https://codeforces.com/problemset/problem/616/B
+616A,Comparing Two Long Integers,"implementation, strings",900,6211,0,https://codeforces.com/problemset/problem/616/A
+615E,Hexagons,"binary search, implementation, math",2100,817,0,https://codeforces.com/problemset/problem/615/E
+615D,Multipliers,"math, number theory",2000,2635,0,https://codeforces.com/problemset/problem/615/D
+615C,Running Track,"dp, greedy, strings, trees",2000,1863,0,https://codeforces.com/problemset/problem/615/C
+615B,Longtail Hedgehog,"dp, graphs",1600,3783,0,https://codeforces.com/problemset/problem/615/B
+615A,Bulbs,implementation,800,12259,0,https://codeforces.com/problemset/problem/615/A
+614B,Gena's Code,"implementation, math",1400,5073,0,https://codeforces.com/problemset/problem/614/B
+614A,Link/Cut Tree,"brute force, implementation",1500,6076,0,https://codeforces.com/problemset/problem/614/A
+613E,Puzzle Lover,"dp, hashing, strings",3200,212,0,https://codeforces.com/problemset/problem/613/E
+613D,Kingdom and its Cities,"dfs and similar, divide and conquer, dp, graphs, sortings, trees",2800,955,0,https://codeforces.com/problemset/problem/613/D
+613C,Necklace,"constructive algorithms, math",2500,730,0,https://codeforces.com/problemset/problem/613/C
+613B,Skills,"binary search, brute force, dp, greedy, sortings, two pointers",1900,1668,0,https://codeforces.com/problemset/problem/613/B
+613A,Peter and Snow Blower,"binary search, geometry, ternary search",1900,2711,0,https://codeforces.com/problemset/problem/613/A
+612F,Simba on the Circle,dp,2600,156,0,https://codeforces.com/problemset/problem/612/F
+612E,Square Root of Permutation,"combinatorics, constructive algorithms, dfs and similar, graphs, math",2200,864,0,https://codeforces.com/problemset/problem/612/E
+612D,The Union of k-Segments,"greedy, sortings",1800,2313,0,https://codeforces.com/problemset/problem/612/D
+612C,Replace To Make Regular Bracket Sequence,"data structures, expression parsing, math",1400,4742,0,https://codeforces.com/problemset/problem/612/C
+612B,HDD is Outdated Technology,"implementation, math",1200,4785,0,https://codeforces.com/problemset/problem/612/B
+612A,The Text Splitting,"brute force, implementation, strings",1300,5061,0,https://codeforces.com/problemset/problem/612/A
+611H,New Year  and Forgotten Tree,"constructive algorithms, flows, graphs",3200,260,0,https://codeforces.com/problemset/problem/611/H
+611G,New Year and Cake,"geometry, two pointers",2900,280,0,https://codeforces.com/problemset/problem/611/G
+611F,New Year and Cleaning,"binary search, implementation",2500,352,0,https://codeforces.com/problemset/problem/611/F
+611E,New Year and Three Musketeers,"data structures, greedy, sortings",2400,719,0,https://codeforces.com/problemset/problem/611/E
+611D,New Year and Ancient Prophecy,"dp, hashing, strings",2000,2031,0,https://codeforces.com/problemset/problem/611/D
+611C,New Year and Domino,"dp, implementation",1500,6742,0,https://codeforces.com/problemset/problem/611/C
+611B,New Year and Old Property,"bitmasks, brute force, implementation",1300,6533,0,https://codeforces.com/problemset/problem/611/B
+611A,New Year and Days,implementation,900,9620,0,https://codeforces.com/problemset/problem/611/A
+610E,Alphabet Permutations,"data structures, strings",2500,431,0,https://codeforces.com/problemset/problem/610/E
+610D,Vika and Segments,"constructive algorithms, data structures, geometry, two pointers",2300,896,0,https://codeforces.com/problemset/problem/610/D
+610C,Harmony Analysis,constructive algorithms,1800,2462,0,https://codeforces.com/problemset/problem/610/C
+610B,Vika and Squares,"constructive algorithms, implementation",1300,5046,0,https://codeforces.com/problemset/problem/610/B
+610A,Pasha and Stick,"combinatorics, math",1000,11050,0,https://codeforces.com/problemset/problem/610/A
+609F,Frogs and mosquitoes,"data structures, greedy",2500,533,0,https://codeforces.com/problemset/problem/609/F
+609E,Minimum spanning tree for each edge,"data structures, dfs and similar, dsu, graphs, trees",2100,2912,0,https://codeforces.com/problemset/problem/609/E
+609D,Gadgets for dollars and pounds,"binary search, greedy, two pointers",2000,1590,0,https://codeforces.com/problemset/problem/609/D
+609C,Load Balancing,"implementation, math",1500,4243,0,https://codeforces.com/problemset/problem/609/C
+609B,Книга - лучший подарок,"constructive algorithms, implementation",1100,6151,0,https://codeforces.com/problemset/problem/609/B
+609A,Флеш-карты,"greedy, implementation, sortings",800,11431,0,https://codeforces.com/problemset/problem/609/A
+608B,Hamming Distance Sum,"combinatorics, strings",1500,4553,0,https://codeforces.com/problemset/problem/608/B
+608A,Saitama Destroys Hotel,"implementation, math",1000,6951,0,https://codeforces.com/problemset/problem/608/A
+607E,Cross Sum,"binary search, geometry",3300,167,0,https://codeforces.com/problemset/problem/607/E
+607D,Power Tree,"data structures, trees",2600,387,0,https://codeforces.com/problemset/problem/607/D
+607C,Marbles,"hashing, strings",2500,654,0,https://codeforces.com/problemset/problem/607/C
+607B,Zuma,dp,1900,4683,0,https://codeforces.com/problemset/problem/607/B
+607A,Chain Reaction,"binary search, dp",1600,6349,0,https://codeforces.com/problemset/problem/607/A
+606B,Testing Robots,implementation,1600,2518,0,https://codeforces.com/problemset/problem/606/B
+606A,Magic Spheres,implementation,1200,6459,0,https://codeforces.com/problemset/problem/606/A
+605E,Intergalaxy Trips,"probabilities, shortest paths",2700,546,0,https://codeforces.com/problemset/problem/605/E
+605D,Board Game,"data structures, dfs and similar",2500,573,0,https://codeforces.com/problemset/problem/605/D
+605C,Freelancer's Dreams,geometry,2400,871,0,https://codeforces.com/problemset/problem/605/C
+605B,Lazy Student,"constructive algorithms, data structures, graphs",1700,2762,0,https://codeforces.com/problemset/problem/605/B
+605A,Sorting Railway Cars,"constructive algorithms, greedy",1600,5458,0,https://codeforces.com/problemset/problem/605/A
+604B,More Cowbell,"binary search, greedy",1400,6238,0,https://codeforces.com/problemset/problem/604/B
+604A,Uncowed Forces,implementation,1000,6924,0,https://codeforces.com/problemset/problem/604/A
+603E,Pastoral Oddities,"data structures, divide and conquer, dsu, math, trees",3000,371,0,https://codeforces.com/problemset/problem/603/E
+603D,Ruminations on Ruminants,"geometry, math",2900,241,0,https://codeforces.com/problemset/problem/603/D
+603C,Lieges of Legendre,"games, math",2200,1429,0,https://codeforces.com/problemset/problem/603/C
+603B,Moodular Arithmetic,"combinatorics, dfs and similar, dsu, math, number theory",1800,2065,0,https://codeforces.com/problemset/problem/603/B
+603A,Alternative Thinking,"dp, greedy, math",1600,5621,0,https://codeforces.com/problemset/problem/603/A
+602B,Approximating a Constant Range,"dp, implementation, two pointers",1400,6728,0,https://codeforces.com/problemset/problem/602/B
+602A,Two Bases,"brute force, implementation",1100,6684,0,https://codeforces.com/problemset/problem/602/A
+601E,A Museum Robbery,"data structures, dp",2800,358,0,https://codeforces.com/problemset/problem/601/E
+601D,Acyclic Organic Compounds,"data structures, dfs and similar, dsu, hashing, strings, trees",2400,735,0,https://codeforces.com/problemset/problem/601/D
+601C,Kleofáš and the n-thlon,"dp, math, probabilities",2300,938,0,https://codeforces.com/problemset/problem/601/C
+601B,Lipshitz Sequence,"data structures, math",2100,1611,0,https://codeforces.com/problemset/problem/601/B
+601A,The Two Routes,"graphs, shortest paths",1600,7347,0,https://codeforces.com/problemset/problem/601/A
+600F,Edge coloring of bipartite graph,graphs,2800,261,0,https://codeforces.com/problemset/problem/600/F
+600E,Lomsat gelral,"data structures, dfs and similar, dsu, trees",2300,4196,0,https://codeforces.com/problemset/problem/600/E
+600D,Area of Two Circles' Intersection,geometry,2000,1324,0,https://codeforces.com/problemset/problem/600/D
+600C,Make Palindrome,"constructive algorithms, greedy, strings",1800,3332,0,https://codeforces.com/problemset/problem/600/C
+600B,Queries about less or equal elements,"binary search, data structures, sortings, two pointers",1300,11711,0,https://codeforces.com/problemset/problem/600/B
+600A,Extract Numbers,"implementation, strings",1600,3366,0,https://codeforces.com/problemset/problem/600/A
+599E,Sandy and Nuts,"bitmasks, dp, trees",2600,362,0,https://codeforces.com/problemset/problem/599/E
+599D,Spongebob and Squares,"brute force, math",1900,2201,0,https://codeforces.com/problemset/problem/599/D
+599C,Day at the Beach,sortings,1600,3787,0,https://codeforces.com/problemset/problem/599/C
+599B,Spongebob and Joke,implementation,1500,3766,0,https://codeforces.com/problemset/problem/599/B
+599A,Patrick and Shopping,implementation,800,18939,0,https://codeforces.com/problemset/problem/599/A
+598F,Cut Length,geometry,2900,201,0,https://codeforces.com/problemset/problem/598/F
+598E,Chocolate Bar,"brute force, dp",2000,2602,0,https://codeforces.com/problemset/problem/598/E
+598D,Igor In the Museum,"dfs and similar, graphs, shortest paths",1700,5783,0,https://codeforces.com/problemset/problem/598/D
+598C,Nearest vectors,"geometry, sortings",2300,2281,0,https://codeforces.com/problemset/problem/598/C
+598B,Queries on a String,"implementation, strings",1300,6938,0,https://codeforces.com/problemset/problem/598/B
+598A,Tricky Sum,math,900,13572,0,https://codeforces.com/problemset/problem/598/A
+597C,Subsequences,"data structures, dp",1900,1907,0,https://codeforces.com/problemset/problem/597/C
+597B,Restaurant,"dp, greedy, sortings",1600,2917,0,https://codeforces.com/problemset/problem/597/B
+597A,Divisibility,math,1600,3124,0,https://codeforces.com/problemset/problem/597/A
+596E,Wilbur and Strings,"dfs and similar, dp, graphs, strings",2500,292,0,https://codeforces.com/problemset/problem/596/E
+596D,Wilbur and Trees,"dp, math, probabilities, sortings",2300,565,0,https://codeforces.com/problemset/problem/596/D
+596C,Wilbur and Points,"combinatorics, greedy, sortings",1700,2055,0,https://codeforces.com/problemset/problem/596/C
+596B,Wilbur and Array,"greedy, implementation",1100,7732,0,https://codeforces.com/problemset/problem/596/B
+596A,Wilbur and Swimming Pool,"geometry, implementation",1100,5951,0,https://codeforces.com/problemset/problem/596/A
+595B,Pasha and Phone,"binary search, math",1600,2607,0,https://codeforces.com/problemset/problem/595/B
+595A,Vitaly and Night,"constructive algorithms, implementation",800,11130,0,https://codeforces.com/problemset/problem/595/A
+594E,Cutting the Line,"string suffix structures, strings",3100,84,0,https://codeforces.com/problemset/problem/594/E
+594D,REQ,"data structures, number theory",2500,760,0,https://codeforces.com/problemset/problem/594/D
+594C,Edo and Magnets,"brute force, greedy, implementation, two pointers",2300,583,0,https://codeforces.com/problemset/problem/594/C
+594B,Max and Bike,"binary search, geometry",2500,395,0,https://codeforces.com/problemset/problem/594/B
+594A,Warrior and Archer,games,2300,1155,0,https://codeforces.com/problemset/problem/594/A
+593E,Strange Calculation and Cats,"dp, matrices",2400,285,0,https://codeforces.com/problemset/problem/593/E
+593D,Happy Tree Party,"data structures, dfs and similar, graphs, math, trees",2400,851,0,https://codeforces.com/problemset/problem/593/D
+593C,Beautiful Function,"constructive algorithms, math",2200,221,0,https://codeforces.com/problemset/problem/593/C
+593B,Anton and Lines,"geometry, sortings",1600,3423,0,https://codeforces.com/problemset/problem/593/B
+593A,2Char,"brute force, implementation",1200,4876,0,https://codeforces.com/problemset/problem/593/A
+592E,BCPC,"binary search, geometry, two pointers",2700,159,0,https://codeforces.com/problemset/problem/592/E
+592D,Super M,"dfs and similar, dp, graphs, trees",2200,1743,0,https://codeforces.com/problemset/problem/592/D
+592C,The Big Race,math,1800,2645,0,https://codeforces.com/problemset/problem/592/C
+592B,The Monster and the Squirrel,math,1100,6942,0,https://codeforces.com/problemset/problem/592/B
+592A,PawnChess,implementation,1200,5350,0,https://codeforces.com/problemset/problem/592/A
+591B,Rebranding,"implementation, strings",1200,6249,0,https://codeforces.com/problemset/problem/591/B
+591A,Wizards' Duel,"implementation, math",900,9889,0,https://codeforces.com/problemset/problem/591/A
+590E,Birthday,"graph matchings, strings",3200,364,0,https://codeforces.com/problemset/problem/590/E
+590D,Top Secret Task,dp,2300,873,0,https://codeforces.com/problemset/problem/590/D
+590C,Three States,"dfs and similar, graphs, shortest paths",2200,1784,0,https://codeforces.com/problemset/problem/590/C
+590B,Chip 'n Dale Rescue Rangers,"binary search, geometry, math",2100,1492,0,https://codeforces.com/problemset/problem/590/B
+590A,Median Smoothing,implementation,1700,3300,0,https://codeforces.com/problemset/problem/590/A
+588B,Duff in Love,math,1300,9266,0,https://codeforces.com/problemset/problem/588/B
+588A,Duff and Meat,greedy,900,16679,0,https://codeforces.com/problemset/problem/588/A
+587F,Duff is Mad,"data structures, strings",3000,343,0,https://codeforces.com/problemset/problem/587/F
+587E,Duff as a Queen,data structures,2900,374,0,https://codeforces.com/problemset/problem/587/E
+587D,Duff in Mafia,"2-sat, binary search",3100,315,0,https://codeforces.com/problemset/problem/587/D
+587C,Duff in the Army,"data structures, trees",2200,2063,0,https://codeforces.com/problemset/problem/587/C
+587B,Duff in Beach,dp,2100,1164,0,https://codeforces.com/problemset/problem/587/B
+587A,Duff and Weight Lifting,greedy,1500,5917,0,https://codeforces.com/problemset/problem/587/A
+586B,Laurenty and Shop,implementation,1300,4741,0,https://codeforces.com/problemset/problem/586/B
+586A,Alena's Schedule,implementation,900,7559,0,https://codeforces.com/problemset/problem/586/A
+585F,Digits of Number Pi,"dp, implementation, strings",3200,270,0,https://codeforces.com/problemset/problem/585/F
+585E,Present for Vitalik the Philatelist,"combinatorics, math, number theory",2900,535,0,https://codeforces.com/problemset/problem/585/E
+585D,Lizard Era: Beginning,meet-in-the-middle,2300,993,0,https://codeforces.com/problemset/problem/585/D
+585C,"Alice, Bob, Oranges and Apples",number theory,2400,781,0,https://codeforces.com/problemset/problem/585/C
+585B,Phillip and Trains,"dfs and similar, graphs, shortest paths",1700,2877,0,https://codeforces.com/problemset/problem/585/B
+585A,Gennady the Dentist,"brute force, implementation",1800,3631,0,https://codeforces.com/problemset/problem/585/A
+584E,Anton and Ira,"constructive algorithms, greedy, math",2300,1114,0,https://codeforces.com/problemset/problem/584/E
+584D,Dima and Lisa,"brute force, math, number theory",1800,5608,0,https://codeforces.com/problemset/problem/584/D
+584C,Marina and Vasya,"constructive algorithms, greedy, strings",1700,4547,0,https://codeforces.com/problemset/problem/584/C
+584B,Kolya and Tanya,combinatorics,1500,7671,0,https://codeforces.com/problemset/problem/584/B
+584A,Olesya and Rodion,math,1000,21537,0,https://codeforces.com/problemset/problem/584/A
+583B,Robot's Task,"greedy, implementation",1200,7333,0,https://codeforces.com/problemset/problem/583/B
+583A,Asphalting Roads,implementation,1000,9829,0,https://codeforces.com/problemset/problem/583/A
+582E,Boolean Function,"bitmasks, dp, expression parsing",3000,239,0,https://codeforces.com/problemset/problem/582/E
+582D,Number of Binominal Coefficients,"dp, math, number theory",3300,234,0,https://codeforces.com/problemset/problem/582/D
+582C,Superior Periodic Subarrays,number theory,2400,579,0,https://codeforces.com/problemset/problem/582/C
+582B,Once Again...,"constructive algorithms, dp, matrices",1900,2607,0,https://codeforces.com/problemset/problem/582/B
+582A,GCD Table,"constructive algorithms, greedy, number theory",1700,5292,0,https://codeforces.com/problemset/problem/582/A
+581F,Zublicanes and Mumocrates,"dp, trees, two pointers",2400,477,0,https://codeforces.com/problemset/problem/581/F
+581E,Kojiro and Furrari,"dp, greedy",2800,134,0,https://codeforces.com/problemset/problem/581/E
+581D,Three Logos,"bitmasks, brute force, constructive algorithms, geometry, implementation, math",1700,2640,0,https://codeforces.com/problemset/problem/581/D
+581C,Developing Skills,"implementation, math, sortings",1400,6082,0,https://codeforces.com/problemset/problem/581/C
+581B,Luxurious Houses,"implementation, math",1100,9588,0,https://codeforces.com/problemset/problem/581/B
+581A,Vasya the Hipster,"implementation, math",800,27425,0,https://codeforces.com/problemset/problem/581/A
+580E,Kefa and Watch,"data structures, hashing, strings",2500,1086,0,https://codeforces.com/problemset/problem/580/E
+580D,Kefa and Dishes,"bitmasks, dp",1800,5357,0,https://codeforces.com/problemset/problem/580/D
+580C,Kefa and Park,"dfs and similar, graphs, trees",1500,17847,0,https://codeforces.com/problemset/problem/580/C
+580B,Kefa and Company,"binary search, sortings, two pointers",1500,12331,0,https://codeforces.com/problemset/problem/580/B
+580A,Kefa and First Steps,"brute force, dp, implementation",900,41870,0,https://codeforces.com/problemset/problem/580/A
+579B,Finding Team Member,"brute force, implementation, sortings",1300,4611,0,https://codeforces.com/problemset/problem/579/B
+579A,Raising Bacteria,bitmasks,1000,23102,0,https://codeforces.com/problemset/problem/579/A
+578F,Mirror Box,"matrices, trees",3200,200,0,https://codeforces.com/problemset/problem/578/F
+578E,Walking!,"constructive algorithms, greedy",2700,351,0,https://codeforces.com/problemset/problem/578/E
+578D,LCS Again,"dp, greedy",2700,417,0,https://codeforces.com/problemset/problem/578/D
+578C,Weakness and Poorness,ternary search,2000,2726,0,https://codeforces.com/problemset/problem/578/C
+578B,"""Or"" Game","brute force, greedy",1700,4112,0,https://codeforces.com/problemset/problem/578/B
+578A,A Problem about Polyline,"geometry, math",1700,4053,0,https://codeforces.com/problemset/problem/578/A
+577B,Modulo Sum,"combinatorics, data structures, dp, two pointers",1900,6252,0,https://codeforces.com/problemset/problem/577/B
+577A,Multiplication Table,"implementation, number theory",1000,21001,0,https://codeforces.com/problemset/problem/577/A
+576E,Painting Edges,"binary search, data structures",3300,357,0,https://codeforces.com/problemset/problem/576/E
+576D,Flights for Regular Customers,"dp, matrices",2700,608,0,https://codeforces.com/problemset/problem/576/D
+576C,Points on Plane,"constructive algorithms, divide and conquer, geometry, greedy, sortings",2100,1860,0,https://codeforces.com/problemset/problem/576/C
+576B,Invariance of Tree,"constructive algorithms, dfs and similar, greedy, trees",2100,1327,0,https://codeforces.com/problemset/problem/576/B
+576A,Vasya and Petya's Game,"math, number theory",1500,8456,0,https://codeforces.com/problemset/problem/576/A
+575I,Robots protection,data structures,2800,201,0,https://codeforces.com/problemset/problem/575/I
+575H,Bots,"combinatorics, number theory",1800,1317,0,https://codeforces.com/problemset/problem/575/H
+575G,Run for beer,"dfs and similar, shortest paths",2200,614,0,https://codeforces.com/problemset/problem/575/G
+575F,Bulbo,"dp, greedy",2100,839,0,https://codeforces.com/problemset/problem/575/F
+575E,Spectator Riots,geometry,2800,155,0,https://codeforces.com/problemset/problem/575/E
+575D,Tablecity,"constructive algorithms, implementation",1700,1662,0,https://codeforces.com/problemset/problem/575/D
+575C,Party,"bitmasks, brute force, graph matchings",2700,162,0,https://codeforces.com/problemset/problem/575/C
+575B,Bribes,"dfs and similar, graphs, trees",2200,733,0,https://codeforces.com/problemset/problem/575/B
+575A,Fibonotci,"data structures, math, matrices",2700,371,0,https://codeforces.com/problemset/problem/575/A
+574B,Bear and Three Musketeers,"brute force, dfs and similar, graphs, hashing",1500,5605,0,https://codeforces.com/problemset/problem/574/B
+574A,Bear and Elections,"greedy, implementation",1200,7047,0,https://codeforces.com/problemset/problem/574/A
+573E,Bear and Bowling,"data structures, greedy",3200,252,0,https://codeforces.com/problemset/problem/573/E
+573D,Bear and Cavalry,"data structures, divide and conquer, dp",3000,195,0,https://codeforces.com/problemset/problem/573/D
+573C,Bear and Drawing,"constructive algorithms, dfs and similar, trees",2300,810,0,https://codeforces.com/problemset/problem/573/C
+573B,Bear and Blocks,"binary search, data structures, dp, math",1600,4292,0,https://codeforces.com/problemset/problem/573/B
+573A,Bear and Poker,"implementation, math, number theory",1300,11278,0,https://codeforces.com/problemset/problem/573/A
+572B,Order Book,"data structures, greedy, implementation, sortings",1300,4714,0,https://codeforces.com/problemset/problem/572/B
+572A,Arrays,sortings,900,11336,0,https://codeforces.com/problemset/problem/572/A
+571E,Geometric Progressions,math,3200,137,0,https://codeforces.com/problemset/problem/571/E
+571D,Campus,"binary search, data structures, dsu, trees",3100,302,0,https://codeforces.com/problemset/problem/571/D
+571C,CNF 2,"constructive algorithms, dfs and similar, graphs, greedy",2500,451,0,https://codeforces.com/problemset/problem/571/C
+571B,Minimization,"dp, greedy, sortings",2000,1901,0,https://codeforces.com/problemset/problem/571/B
+571A,Lengthening Sticks,"combinatorics, implementation, math",2100,1552,0,https://codeforces.com/problemset/problem/571/A
+570E,Pig and Palindromes,"combinatorics, dp",2300,1271,0,https://codeforces.com/problemset/problem/570/E
+570D,Tree Requests,"binary search, bitmasks, constructive algorithms, dfs and similar, graphs, trees",2200,3122,0,https://codeforces.com/problemset/problem/570/D
+570C,Replacement,"constructive algorithms, data structures, implementation",1600,7049,0,https://codeforces.com/problemset/problem/570/C
+570B,Simple Game,"constructive algorithms, games, greedy, implementation, math",1300,11232,0,https://codeforces.com/problemset/problem/570/B
+570A,Elections,implementation,1100,11367,0,https://codeforces.com/problemset/problem/570/A
+569B,Inventory,"greedy, math",1200,5653,0,https://codeforces.com/problemset/problem/569/B
+569A,Music,"implementation, math",1500,3991,0,https://codeforces.com/problemset/problem/569/A
+568E,Longest Increasing Subsequence,"data structures, dp",3000,281,0,https://codeforces.com/problemset/problem/568/E
+568D,Sign Posts,"brute force, geometry, math",2800,246,0,https://codeforces.com/problemset/problem/568/D
+568C,New Language,"2-sat, greedy",2600,519,0,https://codeforces.com/problemset/problem/568/C
+568B,Symmetric and Transitive,"combinatorics, dp, math",1900,1855,0,https://codeforces.com/problemset/problem/568/B
+568A,Primes or Palindromes?,"brute force, implementation, math, number theory",1600,3961,0,https://codeforces.com/problemset/problem/568/A
+567F,Mausoleum,dp,2400,396,0,https://codeforces.com/problemset/problem/567/F
+567E,President and Roads,"dfs and similar, graphs, hashing, shortest paths",2200,1080,0,https://codeforces.com/problemset/problem/567/E
+567D,One-Dimensional Battle Ships,"binary search, data structures, greedy, sortings",1700,3347,0,https://codeforces.com/problemset/problem/567/D
+567C,Geometric Progression,"binary search, data structures, dp",1700,6669,0,https://codeforces.com/problemset/problem/567/C
+567B,Berland National Library,implementation,1300,6730,0,https://codeforces.com/problemset/problem/567/B
+567A,Lineland Mail,"greedy, implementation",900,16092,0,https://codeforces.com/problemset/problem/567/A
+566G,Max and Min,geometry,2500,248,0,https://codeforces.com/problemset/problem/566/G
+566F,Clique in the Divisibility Graph,"dp, math, number theory",1500,2446,0,https://codeforces.com/problemset/problem/566/F
+566E,Restoring Map,"bitmasks, constructive algorithms, trees",3200,230,0,https://codeforces.com/problemset/problem/566/E
+566D,Restructuring Company,"data structures, dsu",1900,1689,0,https://codeforces.com/problemset/problem/566/D
+566C,Logistical Questions,"dfs and similar, divide and conquer, trees",3000,282,0,https://codeforces.com/problemset/problem/566/C
+566B,Replicating Processes,"constructive algorithms, greedy",2600,209,0,https://codeforces.com/problemset/problem/566/B
+566A,Matching Names,"dfs and similar, strings, trees",2300,602,0,https://codeforces.com/problemset/problem/566/A
+560B,Gerald is into Art,"constructive algorithms, implementation",1200,6297,0,https://codeforces.com/problemset/problem/560/B
+560A,Currency System in Geraldion,"implementation, sortings",1000,11976,0,https://codeforces.com/problemset/problem/560/A
+559E,Gerald and Path,"dp, sortings",3000,420,0,https://codeforces.com/problemset/problem/559/E
+559D,Randomizer,"combinatorics, geometry, probabilities",2800,283,0,https://codeforces.com/problemset/problem/559/D
+559C,Gerald and Giant Chess,"combinatorics, dp, math, number theory",2200,3362,0,https://codeforces.com/problemset/problem/559/C
+559B,Equivalent Strings,"divide and conquer, hashing, sortings, strings",1700,7209,0,https://codeforces.com/problemset/problem/559/B
+559A,Gerald's Hexagon,"brute force, geometry, math",1600,7897,0,https://codeforces.com/problemset/problem/559/A
+558E,A Simple Task,"data structures, sortings, strings",2300,2539,0,https://codeforces.com/problemset/problem/558/E
+558D,Guess Your Way Out! II,"data structures, implementation, sortings",2300,961,0,https://codeforces.com/problemset/problem/558/D
+558C,Amr and Chemistry,"brute force, graphs, greedy, math, shortest paths",1900,3202,0,https://codeforces.com/problemset/problem/558/C
+558B,Amr and The Large Array,implementation,1300,5895,0,https://codeforces.com/problemset/problem/558/B
+558A,Lala Land and Apple Trees,"brute force, implementation, sortings",1100,7601,0,https://codeforces.com/problemset/problem/558/A
+557E,Ann and Half-Palindrome,"data structures, dp, graphs, string suffix structures, strings, trees",2300,838,0,https://codeforces.com/problemset/problem/557/E
+557D,Vitaly and Cycle,"combinatorics, dfs and similar, graphs, math",2000,1734,0,https://codeforces.com/problemset/problem/557/D
+557C,Arthur and Table,"brute force, data structures, dp, greedy, math, sortings",1900,3268,0,https://codeforces.com/problemset/problem/557/C
+557B,Pasha and Tea,"constructive algorithms, implementation, math, sortings",1500,6043,0,https://codeforces.com/problemset/problem/557/B
+557A,Ilya and Diplomas,"greedy, implementation, math",1100,7078,0,https://codeforces.com/problemset/problem/557/A
+556B,Case of Fake Numbers,"brute force, implementation",1100,6567,0,https://codeforces.com/problemset/problem/556/B
+556A,Case of the Zeros and Ones,greedy,900,20851,0,https://codeforces.com/problemset/problem/556/A
+555E,Case of Computer Network,"dfs and similar, graphs, trees",2800,1028,0,https://codeforces.com/problemset/problem/555/E
+555D,Case of a Top Secret,"binary search, implementation, math",2500,724,0,https://codeforces.com/problemset/problem/555/D
+555C,Case of Chocolate,data structures,2200,1633,0,https://codeforces.com/problemset/problem/555/C
+555B,Case of Fugitive,"data structures, greedy, sortings",2000,2909,0,https://codeforces.com/problemset/problem/555/B
+555A,Case of Matryoshkas,implementation,1500,5530,0,https://codeforces.com/problemset/problem/555/A
+554B,Ohana Cleans Up,"brute force, greedy, strings",1200,6969,0,https://codeforces.com/problemset/problem/554/B
+554A,Kyoya and Photobooks,"brute force, math, strings",900,9342,0,https://codeforces.com/problemset/problem/554/A
+553E,Kyoya and Train,"dp, fft, graphs, math, probabilities",3200,300,0,https://codeforces.com/problemset/problem/553/E
+553D,Nudist Beach,"binary search, graphs, greedy",2300,787,0,https://codeforces.com/problemset/problem/553/D
+553C,Love Triangles,"dfs and similar, dsu, graphs",2200,1362,0,https://codeforces.com/problemset/problem/553/C
+553B,Kyoya and Permutation,"binary search, combinatorics, constructive algorithms, greedy, implementation, math",1900,1829,0,https://codeforces.com/problemset/problem/553/B
+553A,Kyoya and Colored Balls,"combinatorics, dp, math",1500,6023,0,https://codeforces.com/problemset/problem/553/A
+552E,Vanya and Brackets,"brute force, dp, expression parsing, greedy, implementation, strings",2100,1191,0,https://codeforces.com/problemset/problem/552/E
+552D,Vanya and Triangles,"brute force, combinatorics, data structures, geometry, math, sortings",1900,3340,0,https://codeforces.com/problemset/problem/552/D
+552C,Vanya and Scales,"brute force, dp, greedy, math, meet-in-the-middle, number theory",1900,4275,0,https://codeforces.com/problemset/problem/552/C
+552B,Vanya and Books,"implementation, math",1200,11578,0,https://codeforces.com/problemset/problem/552/B
+552A,Vanya and Table,"implementation, math",1000,7851,0,https://codeforces.com/problemset/problem/552/A
+551E,GukiZ and GukiZiana,"binary search, data structures, implementation",2500,1168,0,https://codeforces.com/problemset/problem/551/E
+551D,GukiZ and Binary Operations,"combinatorics, implementation, math, matrices, number theory",2100,1393,0,https://codeforces.com/problemset/problem/551/D
+551C,GukiZ hates Boxes,"binary search, greedy",2200,2453,0,https://codeforces.com/problemset/problem/551/C
+551B,ZgukistringZ,"brute force, constructive algorithms, implementation, strings",1800,3164,0,https://codeforces.com/problemset/problem/551/B
+551A,GukiZ and Contest,"brute force, implementation, sortings",800,12098,0,https://codeforces.com/problemset/problem/551/A
+550E,Brackets in Implications,"constructive algorithms, greedy, implementation, math",2200,1174,0,https://codeforces.com/problemset/problem/550/E
+550D,Regular Bridge,"constructive algorithms, graphs, implementation",1900,2483,0,https://codeforces.com/problemset/problem/550/D
+550C,Divisibility by Eight,"brute force, dp, math",1500,14679,0,https://codeforces.com/problemset/problem/550/C
+550B,Preparing Olympiad,"bitmasks, brute force",1400,9496,0,https://codeforces.com/problemset/problem/550/B
+550A,Two Substrings,"brute force, dp, greedy, implementation, strings",1500,18952,0,https://codeforces.com/problemset/problem/550/A
+549H,Degenerate Matrix,"binary search, math",2100,1613,0,https://codeforces.com/problemset/problem/549/H
+549G,Happy Line,"constructive algorithms, greedy, sortings",2200,1864,0,https://codeforces.com/problemset/problem/549/G
+549F,Yura and Developers,"data structures, divide and conquer",2800,529,0,https://codeforces.com/problemset/problem/549/F
+549E,Sasha Circle,"geometry, math",2700,95,0,https://codeforces.com/problemset/problem/549/E
+549D,Haar Features,"greedy, implementation",1900,2000,0,https://codeforces.com/problemset/problem/549/D
+549C,The Game Of Parity,games,2200,1477,0,https://codeforces.com/problemset/problem/549/C
+549B,Looksery Party,"constructive algorithms, dfs and similar, graphs, greedy",2300,1249,0,https://codeforces.com/problemset/problem/549/B
+549A,Face Detection,"implementation, strings",900,7388,0,https://codeforces.com/problemset/problem/549/A
+548B,Mike and Fun,"brute force, dp, greedy, implementation",1400,5900,0,https://codeforces.com/problemset/problem/548/B
+548A,Mike and Fax,"brute force, implementation, strings",1100,7870,0,https://codeforces.com/problemset/problem/548/A
+547E,Mike and Friends,"data structures, string suffix structures, strings, trees",2800,808,0,https://codeforces.com/problemset/problem/547/E
+547D,Mike and Fish,"constructive algorithms, dfs and similar, graphs",2600,1049,0,https://codeforces.com/problemset/problem/547/D
+547C,Mike and Foam,"bitmasks, combinatorics, dp, math, number theory",2300,1711,0,https://codeforces.com/problemset/problem/547/C
+547B,Mike and Feet,"binary search, data structures, dp, dsu",1900,4779,0,https://codeforces.com/problemset/problem/547/B
+547A,Mike and Frog,"brute force, greedy, implementation, math",2200,2061,0,https://codeforces.com/problemset/problem/547/A
+546E,Soldier and Traveling,"flows, graphs, math",2100,2250,0,https://codeforces.com/problemset/problem/546/E
+546D,Soldier and Number Game,"constructive algorithms, dp, math, number theory",1700,7042,0,https://codeforces.com/problemset/problem/546/D
+546C,Soldier and Cards,"brute force, dfs and similar, games",1400,10654,0,https://codeforces.com/problemset/problem/546/C
+546B,Soldier and Badges,"brute force, greedy, implementation, sortings",1200,12191,0,https://codeforces.com/problemset/problem/546/B
+546A,Soldier and Bananas,"brute force, implementation, math",800,53072,0,https://codeforces.com/problemset/problem/546/A
+545E,Paths and Trees,"graphs, greedy, shortest paths",2000,2668,0,https://codeforces.com/problemset/problem/545/E
+545D,Queue,"greedy, implementation, sortings",1300,14386,0,https://codeforces.com/problemset/problem/545/D
+545C,Woodcutters,"dp, greedy",1500,13757,0,https://codeforces.com/problemset/problem/545/C
+545B,Equidistant String,greedy,1100,8754,0,https://codeforces.com/problemset/problem/545/B
+545A,Toy Cars,implementation,900,8979,0,https://codeforces.com/problemset/problem/545/A
+544B,Sea and Islands,"constructive algorithms, implementation",1400,5422,0,https://codeforces.com/problemset/problem/544/B
+544A,Set of Strings,"implementation, strings",1100,5807,0,https://codeforces.com/problemset/problem/544/A
+543E,Listening to Music,"constructive algorithms, data structures",3200,132,0,https://codeforces.com/problemset/problem/543/E
+543D,Road Improvement,"dp, trees",2300,1338,0,https://codeforces.com/problemset/problem/543/D
+543C,Remembering Strings,"bitmasks, dp",2500,1001,0,https://codeforces.com/problemset/problem/543/C
+543B,Destroying Roads,"constructive algorithms, graphs, shortest paths",2100,2729,0,https://codeforces.com/problemset/problem/543/B
+543A,Writing Code,dp,1800,5212,0,https://codeforces.com/problemset/problem/543/A
+542F,Quest,"dp, greedy",2100,652,0,https://codeforces.com/problemset/problem/542/F
+542E,Playing on Graph,"graphs, shortest paths",2600,485,0,https://codeforces.com/problemset/problem/542/E
+542D,Superhero's Job,"dfs and similar, dp, hashing, math, number theory",2600,381,0,https://codeforces.com/problemset/problem/542/D
+542C,Idempotent functions,"constructive algorithms, graphs, math",2000,967,0,https://codeforces.com/problemset/problem/542/C
+542B,Duck Hunt,data structures,3100,64,0,https://codeforces.com/problemset/problem/542/B
+542A,Place Your Ad Here,"data structures, sortings",2400,432,0,https://codeforces.com/problemset/problem/542/A
+540E,Infinite Inversions,"binary search, data structures, implementation, sortings, trees",2100,1358,0,https://codeforces.com/problemset/problem/540/E
+540D,Bad Luck Island,"dp, probabilities",1900,3429,0,https://codeforces.com/problemset/problem/540/D
+540C,Ice Cave,dfs and similar,2000,4922,0,https://codeforces.com/problemset/problem/540/C
+540B,School Marks,"greedy, implementation",1700,3872,0,https://codeforces.com/problemset/problem/540/B
+540A,Combination Lock,implementation,800,20176,0,https://codeforces.com/problemset/problem/540/A
+538H,Summer Dichotomy,"2-sat, data structures, dfs and similar, greedy",3200,257,0,https://codeforces.com/problemset/problem/538/H
+538G,Berserk Robot,"constructive algorithms, math, sortings",3100,228,0,https://codeforces.com/problemset/problem/538/G
+538F,A Heap of Heaps,"brute force, data structures, math, sortings",2200,1201,0,https://codeforces.com/problemset/problem/538/F
+538E,Demiurges Play Again,"dfs and similar, dp, math, trees",2200,1254,0,https://codeforces.com/problemset/problem/538/E
+538D,Weird Chess,"brute force, constructive algorithms, implementation",1800,2209,0,https://codeforces.com/problemset/problem/538/D
+538C,Tourist's Notes,"binary search, brute force, greedy, implementation, math",1600,4955,0,https://codeforces.com/problemset/problem/538/C
+538B,Quasi Binary,"constructive algorithms, dp, greedy, implementation",1400,11510,0,https://codeforces.com/problemset/problem/538/B
+538A,Cutting Banner,"brute force, implementation",1400,5821,0,https://codeforces.com/problemset/problem/538/A
+536E,Tavas on the Path,"data structures, divide and conquer, trees",3100,211,0,https://codeforces.com/problemset/problem/536/E
+536D,Tavas in Kansas,"dp, games",2900,368,0,https://codeforces.com/problemset/problem/536/D
+535E,Tavas and Pashmaks,"geometry, math",2600,627,0,https://codeforces.com/problemset/problem/535/E
+535D,Tavas and Malekas,"greedy, hashing, string suffix structures, strings",1900,2595,0,https://codeforces.com/problemset/problem/535/D
+535C,Tavas and Karafs,"binary search, greedy, math",1900,3095,0,https://codeforces.com/problemset/problem/535/C
+535B,Tavas and SaDDas,"bitmasks, brute force, combinatorics, implementation",1100,12564,0,https://codeforces.com/problemset/problem/535/B
+535A,Tavas and Nafas,"brute force, implementation",1000,8983,0,https://codeforces.com/problemset/problem/535/A
+534F,Simplified Nonogram,"bitmasks, dp, hashing, meet-in-the-middle",2400,311,0,https://codeforces.com/problemset/problem/534/F
+534E,Berland Local Positioning System,"constructive algorithms, greedy, hashing, implementation",2400,293,0,https://codeforces.com/problemset/problem/534/E
+534D,Handshakes,"binary search, constructive algorithms, data structures, greedy",1900,1868,0,https://codeforces.com/problemset/problem/534/D
+534C,Polycarpus' Dice,math,1600,3656,0,https://codeforces.com/problemset/problem/534/C
+534B,Covered Path,"dp, greedy, math",1400,6270,0,https://codeforces.com/problemset/problem/534/B
+534A,Exam,"constructive algorithms, implementation, math",1100,8960,0,https://codeforces.com/problemset/problem/534/A
+533F,Encoding,"hashing, string suffix structures, strings",2400,636,0,https://codeforces.com/problemset/problem/533/F
+533E,Correcting Mistakes,"constructive algorithms, dp, greedy, hashing, strings, two pointers",1800,1637,0,https://codeforces.com/problemset/problem/533/E
+533D,Landmarks,"data structures, dp",3000,90,0,https://codeforces.com/problemset/problem/533/D
+533C,Board Game,"games, greedy, implementation, math",1700,1721,0,https://codeforces.com/problemset/problem/533/C
+533B,Work Group,"dfs and similar, dp, graphs, strings, trees",2000,1408,0,https://codeforces.com/problemset/problem/533/B
+533A,Berland Miners,"binary search, data structures, dfs and similar, greedy, trees",3000,176,0,https://codeforces.com/problemset/problem/533/A
+530I,Different variables,*special problem,2500,35,0,https://codeforces.com/problemset/problem/530/I
+530H,Points in triangle,"*special problem, geometry",2100,110,0,https://codeforces.com/problemset/problem/530/H
+530G,Levenshtein distance,*special problem,2100,80,0,https://codeforces.com/problemset/problem/530/G
+530F,Jumping frogs,*special problem,2100,85,0,https://codeforces.com/problemset/problem/530/F
+530E,Sum and product,*special problem,1700,275,0,https://codeforces.com/problemset/problem/530/E
+530D,Set subtraction,*special problem,1600,421,0,https://codeforces.com/problemset/problem/530/D
+530C,Diophantine equation,*special problem,1500,420,0,https://codeforces.com/problemset/problem/530/C
+530B,String inside out,*special problem,1600,508,0,https://codeforces.com/problemset/problem/530/B
+530A,Quadratic equation,*special problem,1500,638,0,https://codeforces.com/problemset/problem/530/A
+529B,Group Photo 2 (online mirror version),"brute force, greedy, sortings",1900,694,0,https://codeforces.com/problemset/problem/529/B
+528E,Triangles 3000,"geometry, sortings",3100,169,0,https://codeforces.com/problemset/problem/528/E
+528D,Fuzzy Search,"bitmasks, brute force, fft",2500,1269,0,https://codeforces.com/problemset/problem/528/D
+527E,Data Center Drama,"dfs and similar, graphs",2600,929,0,https://codeforces.com/problemset/problem/527/E
+527D,Clique Problem,"data structures, dp, greedy, implementation, sortings",1800,3356,0,https://codeforces.com/problemset/problem/527/D
+527C,Glass Carving,"binary search, data structures, implementation",1500,4941,0,https://codeforces.com/problemset/problem/527/C
+527B,Error Correct System,greedy,1500,3326,0,https://codeforces.com/problemset/problem/527/B
+527A,Playing with Paper,"implementation, math",1100,11034,0,https://codeforces.com/problemset/problem/527/A
+526G,Spiders Evil Plan,"greedy, trees",3300,245,0,https://codeforces.com/problemset/problem/526/G
+526F,Pudding Monsters,"data structures, divide and conquer",3000,704,0,https://codeforces.com/problemset/problem/526/F
+526E,Transmitting Levels,"dp, implementation",2400,761,0,https://codeforces.com/problemset/problem/526/E
+526D,Om Nom and Necklace,"hashing, string suffix structures, strings",2200,1307,0,https://codeforces.com/problemset/problem/526/D
+526C,Om Nom and Candies,"brute force, greedy, math",2000,1965,0,https://codeforces.com/problemset/problem/526/C
+526B,Om Nom and Dark Park,"dfs and similar, greedy, implementation",1400,3927,0,https://codeforces.com/problemset/problem/526/B
+526A,King of Thieves,"brute force, implementation",1300,4234,0,https://codeforces.com/problemset/problem/526/A
+525E,Anya and Cubes,"binary search, bitmasks, brute force, dp, math, meet-in-the-middle",2100,1593,0,https://codeforces.com/problemset/problem/525/E
+525D,Arthur and Walls,"constructive algorithms, data structures, graphs, greedy, shortest paths",2400,1110,0,https://codeforces.com/problemset/problem/525/D
+525C,Ilya and Sticks,"greedy, math, sortings",1600,4693,0,https://codeforces.com/problemset/problem/525/C
+525B,Pasha and String,"constructive algorithms, greedy, math, strings",1400,6673,0,https://codeforces.com/problemset/problem/525/B
+525A,Vitaliy and Pie,"greedy, hashing, strings",1100,8204,0,https://codeforces.com/problemset/problem/525/A
+524F,And Yet Another Bracket Sequence,"data structures, greedy, hashing, string suffix structures, strings",2700,325,0,https://codeforces.com/problemset/problem/524/F
+524E,Rooks and Rectangles,"data structures, sortings",2400,810,0,https://codeforces.com/problemset/problem/524/E
+524D,Social Network,"greedy, two pointers",2100,847,0,https://codeforces.com/problemset/problem/524/D
+524C,The Art of Dealing with ATM,"binary search, sortings",1900,1755,0,https://codeforces.com/problemset/problem/524/C
+524B,Фото на память - 2 (round version),"dp, greedy",1700,1322,0,https://codeforces.com/problemset/problem/524/B
+524A,"Возможно, вы знаете этих людей?",implementation,1600,1310,0,https://codeforces.com/problemset/problem/524/A
+523D,Statistics of Recompressing Videos,"*special problem, data structures, implementation",1600,1501,0,https://codeforces.com/problemset/problem/523/D
+523C,Name Quest,"*special problem, greedy",1400,2106,0,https://codeforces.com/problemset/problem/523/C
+523B,Mean Requests,"*special problem, implementation",1500,893,0,https://codeforces.com/problemset/problem/523/B
+523A,"Rotate, Flip and Zoom","*special problem, implementation",1200,2236,0,https://codeforces.com/problemset/problem/523/A
+522D,Closest Equals,"*special problem, data structures",2000,1447,0,https://codeforces.com/problemset/problem/522/D
+522C,Chicken or Fish?,greedy,2100,653,0,https://codeforces.com/problemset/problem/522/C
+522B,Photo to Remember,"*special problem, data structures, dp, implementation",1100,5862,0,https://codeforces.com/problemset/problem/522/B
+522A,Reposts,"*special problem, dfs and similar, dp, graphs, trees",1200,8963,0,https://codeforces.com/problemset/problem/522/A
+521E,Cycling City,"dfs and similar, graphs",3100,356,0,https://codeforces.com/problemset/problem/521/E
+521D,Shop,greedy,2800,649,0,https://codeforces.com/problemset/problem/521/D
+520E,Pluses everywhere,"combinatorics, dp, math, number theory",2200,1382,0,https://codeforces.com/problemset/problem/520/E
+520D,Cubes,"games, greedy, implementation",2100,1329,0,https://codeforces.com/problemset/problem/520/D
+520C,DNA Alignment,"math, strings",1500,3493,0,https://codeforces.com/problemset/problem/520/C
+520B,Two Buttons,"dfs and similar, graphs, greedy, implementation, math, shortest paths",1400,22694,0,https://codeforces.com/problemset/problem/520/B
+520A,Pangram,"implementation, strings",800,31877,0,https://codeforces.com/problemset/problem/520/A
+519E,A and B and Lecture Rooms,"binary search, data structures, dfs and similar, dp, trees",2100,3232,0,https://codeforces.com/problemset/problem/519/E
+519D,A and B and Interesting Substrings,"data structures, dp, two pointers",1800,4580,0,https://codeforces.com/problemset/problem/519/D
+519C,A and B and Team Training,"greedy, implementation, math, number theory",1300,13658,0,https://codeforces.com/problemset/problem/519/C
+519B,A and B and Compilation Errors,"data structures, implementation, sortings",1100,21596,0,https://codeforces.com/problemset/problem/519/B
+519A,A and B and Chess,implementation,900,14337,0,https://codeforces.com/problemset/problem/519/A
+518F,Pasha and Pipe,"binary search, brute force, combinatorics, dp, implementation",2300,276,0,https://codeforces.com/problemset/problem/518/F
+518E,Arthur and Questions,"greedy, implementation, math, ternary search",2200,782,0,https://codeforces.com/problemset/problem/518/E
+518D,Ilya and Escalator,"combinatorics, dp, math, probabilities",1700,4282,0,https://codeforces.com/problemset/problem/518/D
+518C,Anya and Smartphone,"constructive algorithms, data structures, implementation",1600,4997,0,https://codeforces.com/problemset/problem/518/C
+518B,Tanya and Postcard,"greedy, implementation, strings",1400,5738,0,https://codeforces.com/problemset/problem/518/B
+518A,Vitaly and Strings,"constructive algorithms, strings",1600,6756,0,https://codeforces.com/problemset/problem/518/A
+516E,Drazil and His Happy Friends,"math, number theory",3100,200,0,https://codeforces.com/problemset/problem/516/E
+516D,Drazil and Morning Exercise,"dfs and similar, dp, dsu, trees, two pointers",2800,593,0,https://codeforces.com/problemset/problem/516/D
+515E,Drazil and Park,data structures,2300,1258,0,https://codeforces.com/problemset/problem/515/E
+515D,Drazil and Tiles,"constructive algorithms, greedy",2000,2285,0,https://codeforces.com/problemset/problem/515/D
+515C,Drazil and Factorial,"greedy, math, sortings",1400,14413,0,https://codeforces.com/problemset/problem/515/C
+515B,Drazil and His Happy Friends,"brute force, dsu, meet-in-the-middle, number theory",1300,5963,0,https://codeforces.com/problemset/problem/515/B
+515A,Drazil and Date,math,1000,13526,0,https://codeforces.com/problemset/problem/515/A
+514E,Darth Vader and Tree,"dp, matrices",2200,915,0,https://codeforces.com/problemset/problem/514/E
+514D,R2D2 and Droid Army,"binary search, data structures, two pointers",2000,2409,0,https://codeforces.com/problemset/problem/514/D
+514C,Watto and Mechanism,"binary search, data structures, hashing, string suffix structures, strings",2000,4035,0,https://codeforces.com/problemset/problem/514/C
+514B,Han Solo and Lazer Gun,"brute force, data structures, geometry, implementation, math",1400,11892,0,https://codeforces.com/problemset/problem/514/B
+514A,Chewbaсca and Number,"greedy, implementation",1200,15345,0,https://codeforces.com/problemset/problem/514/A
+513G3,Inversions problem,dp,3100,115,0,https://codeforces.com/problemset/problem/513/G3
+513G2,Inversions problem,"dp, probabilities",2400,445,0,https://codeforces.com/problemset/problem/513/G2
+513G1,Inversions problem,"brute force, dfs and similar, dp, meet-in-the-middle",1800,1555,0,https://codeforces.com/problemset/problem/513/G1
+513F2,Scaygerboss,flows,2800,198,0,https://codeforces.com/problemset/problem/513/F2
+513F1,Scaygerboss,flows,2700,192,0,https://codeforces.com/problemset/problem/513/F1
+513E2,Subarray Cuts,dp,2700,339,0,https://codeforces.com/problemset/problem/513/E2
+513E1,Subarray Cuts,dp,2600,335,0,https://codeforces.com/problemset/problem/513/E1
+513D2,Constrained Tree,"constructive algorithms, data structures",2600,300,0,https://codeforces.com/problemset/problem/513/D2
+513D1,Constrained Tree,dfs and similar,2400,375,0,https://codeforces.com/problemset/problem/513/D1
+513C,Second price auction,"bitmasks, probabilities",2000,1286,0,https://codeforces.com/problemset/problem/513/C
+513B2,Permutations,"bitmasks, divide and conquer, math",1800,2317,0,https://codeforces.com/problemset/problem/513/B2
+513B1,Permutations,brute force,1400,3279,0,https://codeforces.com/problemset/problem/513/B1
+513A,Game,"constructive algorithms, math",800,15026,0,https://codeforces.com/problemset/problem/513/A
+512E,Fox And Polygon,"constructive algorithms, divide and conquer",2900,207,0,https://codeforces.com/problemset/problem/512/E
+512D,Fox And Travelling,"dp, trees",2900,448,0,https://codeforces.com/problemset/problem/512/D
+510E,Fox And Dinner,flows,2300,1527,0,https://codeforces.com/problemset/problem/510/E
+510D,Fox And Jumping,"bitmasks, brute force, dp, math",1900,3226,0,https://codeforces.com/problemset/problem/510/D
+510C,Fox And Names,"dfs and similar, graphs, sortings",1600,8080,0,https://codeforces.com/problemset/problem/510/C
+510B,Fox And Two Dots,dfs and similar,1500,8288,0,https://codeforces.com/problemset/problem/510/B
+510A,Fox And Snake,implementation,800,28562,0,https://codeforces.com/problemset/problem/510/A
+509F,Progress Monitoring,"dp, trees",2300,584,0,https://codeforces.com/problemset/problem/509/F
+509E,Pretty Song,"math, strings",2000,1526,0,https://codeforces.com/problemset/problem/509/E
+509D,Restoring Numbers,"constructive algorithms, math",2200,620,0,https://codeforces.com/problemset/problem/509/D
+509C,Sums of Digits,"dp, greedy, implementation",2000,1547,0,https://codeforces.com/problemset/problem/509/C
+509B,Painting Pebbles,"constructive algorithms, greedy, implementation",1300,6641,0,https://codeforces.com/problemset/problem/509/B
+509A,Maximum in Table,"brute force, implementation",800,22930,0,https://codeforces.com/problemset/problem/509/A
+508E,Arthur and Brackets,"dp, greedy",2200,1179,0,https://codeforces.com/problemset/problem/508/E
+508D,Tanya and Password,"dfs and similar, graphs",2500,1645,0,https://codeforces.com/problemset/problem/508/D
+508C,Anya and Ghosts,"constructive algorithms, greedy",1600,3622,0,https://codeforces.com/problemset/problem/508/C
+508B,Anton and currency you all know,"greedy, math, strings",1300,12762,0,https://codeforces.com/problemset/problem/508/B
+508A,Pasha and Pixels,brute force,1100,6223,0,https://codeforces.com/problemset/problem/508/A
+507E,Breaking Good,"dfs and similar, dp, graphs, shortest paths",2100,1902,0,https://codeforces.com/problemset/problem/507/E
+507D,The Maths Lecture,"dp, implementation",2200,1159,0,https://codeforces.com/problemset/problem/507/D
+507C,Guess Your Way Out!,"implementation, math, trees",1700,3345,0,https://codeforces.com/problemset/problem/507/C
+507B,Amr and Pins,"geometry, math",1400,13702,0,https://codeforces.com/problemset/problem/507/B
+507A,Amr and Music,"greedy, implementation, sortings",1000,11112,0,https://codeforces.com/problemset/problem/507/A
+506E,Mr. Kitayuta's Gift,"combinatorics, dp, matrices, strings",3000,298,0,https://codeforces.com/problemset/problem/506/E
+506D,Mr. Kitayuta's Colorful Graph,"brute force, dfs and similar, dsu, graphs",2400,1161,0,https://codeforces.com/problemset/problem/506/D
+505E,Mr. Kitayuta vs. Bamboos,"binary search, greedy",2900,504,0,https://codeforces.com/problemset/problem/505/E
+505D,Mr. Kitayuta's Technology,dfs and similar,2200,1618,0,https://codeforces.com/problemset/problem/505/D
+505C,"Mr. Kitayuta, the Treasure Hunter","dfs and similar, dp, two pointers",1900,3732,0,https://codeforces.com/problemset/problem/505/C
+505B,Mr. Kitayuta's Colorful Graph,"dfs and similar, dp, dsu, graphs",1400,7014,0,https://codeforces.com/problemset/problem/505/B
+505A,Mr. Kitayuta's Gift,"brute force, implementation, strings",1100,5527,0,https://codeforces.com/problemset/problem/505/A
+504E,Misha and LCP on Tree,"binary search, dfs and similar, hashing, string suffix structures, trees",3000,328,0,https://codeforces.com/problemset/problem/504/E
+504D,Misha and XOR,bitmasks,2700,236,0,https://codeforces.com/problemset/problem/504/D
+501E,Misha and Palindrome Degree,"binary search, combinatorics, implementation",2500,571,0,https://codeforces.com/problemset/problem/501/E
+501D,Misha and Permutations Summation,data structures,2000,1734,0,https://codeforces.com/problemset/problem/501/D
+501C,Misha and Forest,"constructive algorithms, data structures, greedy, sortings, trees",1500,4293,0,https://codeforces.com/problemset/problem/501/C
+501B,Misha and Changing Handles,"data structures, dsu, strings",1100,9170,0,https://codeforces.com/problemset/problem/501/B
+501A,Contest,implementation,900,12774,0,https://codeforces.com/problemset/problem/501/A
+500G,New Year Running,"number theory, trees",3200,70,0,https://codeforces.com/problemset/problem/500/G
+500F,New Year Shopping,"divide and conquer, dp",2700,405,0,https://codeforces.com/problemset/problem/500/F
+500E,New Year Domino,"data structures, dp, dsu",2300,1026,0,https://codeforces.com/problemset/problem/500/E
+500D,New Year Santa Network,"combinatorics, dfs and similar, graphs, trees",1900,2555,0,https://codeforces.com/problemset/problem/500/D
+500C,New Year Book Reading,"constructive algorithms, greedy, implementation, math",1600,4918,0,https://codeforces.com/problemset/problem/500/C
+500B,New Year Permutation,"dfs and similar, dsu, graphs, greedy, math, sortings",1600,6553,0,https://codeforces.com/problemset/problem/500/B
+500A,New Year Transportation,"dfs and similar, graphs, implementation",1000,25661,0,https://codeforces.com/problemset/problem/500/A
+499B,Lecture,"implementation, strings",1000,18542,0,https://codeforces.com/problemset/problem/499/B
+499A,Watching a movie,"greedy, implementation",1000,9391,0,https://codeforces.com/problemset/problem/499/A
+498E,Stairs and Lines,"dp, matrices",2700,284,0,https://codeforces.com/problemset/problem/498/E
+498D,Traffic Jams in the Land,"data structures, dp, number theory",2400,748,0,https://codeforces.com/problemset/problem/498/D
+498C,Array and Operations,"flows, graph matchings, number theory",2100,2097,0,https://codeforces.com/problemset/problem/498/C
+498B,Name That Tune,"dp, probabilities, two pointers",2400,886,0,https://codeforces.com/problemset/problem/498/B
+498A,Crazy Town,geometry,1700,5074,0,https://codeforces.com/problemset/problem/498/A
+497E,Subsequences Return,"dp, matrices",2900,172,0,https://codeforces.com/problemset/problem/497/E
+497D,Gears,"brute force, geometry, math",2900,177,0,https://codeforces.com/problemset/problem/497/D
+496E,Distributing Parts,"greedy, sortings",2100,1306,0,https://codeforces.com/problemset/problem/496/E
+496D,Tennis Game,binary search,1900,2428,0,https://codeforces.com/problemset/problem/496/D
+496C,Removing Columns,"brute force, constructive algorithms, implementation",1500,5917,0,https://codeforces.com/problemset/problem/496/C
+496B,Secret Combination,"brute force, constructive algorithms, implementation",1500,4313,0,https://codeforces.com/problemset/problem/496/B
+496A,Minimum Difficulty,"brute force, implementation, math",900,10919,0,https://codeforces.com/problemset/problem/496/A
+495B,Modular Equations,"math, number theory",1600,4391,0,https://codeforces.com/problemset/problem/495/B
+495A,Digital Counter,implementation,1100,6380,0,https://codeforces.com/problemset/problem/495/A
+494E,Sharti,"data structures, games",3200,138,0,https://codeforces.com/problemset/problem/494/E
+494D,Birthday,"data structures, dfs and similar, dp, trees",2700,396,0,https://codeforces.com/problemset/problem/494/D
+494C,Helping People,"dp, probabilities",2600,459,0,https://codeforces.com/problemset/problem/494/C
+494B,Obsessive String,"dp, strings",2000,1980,0,https://codeforces.com/problemset/problem/494/B
+494A,Treasure,greedy,1500,4682,0,https://codeforces.com/problemset/problem/494/A
+493E,Vasya and Polynomial,math,2800,348,0,https://codeforces.com/problemset/problem/493/E
+493D,Vasya and Chess,"constructive algorithms, games, math",1700,6823,0,https://codeforces.com/problemset/problem/493/D
+493C,Vasya and Basketball,"binary search, brute force, data structures, implementation, sortings, two pointers",1600,4724,0,https://codeforces.com/problemset/problem/493/C
+493B,Vasya and Wrestling,implementation,1400,7824,0,https://codeforces.com/problemset/problem/493/B
+493A,Vasya and Football,implementation,1300,5173,0,https://codeforces.com/problemset/problem/493/A
+492E,Vanya and Field,math,2000,1333,0,https://codeforces.com/problemset/problem/492/E
+492D,Vanya and Computer Game,"binary search, implementation, math, sortings",1800,2629,0,https://codeforces.com/problemset/problem/492/D
+492C,Vanya and Exams,"greedy, sortings",1400,8260,0,https://codeforces.com/problemset/problem/492/C
+492B,Vanya and Lanterns,"binary search, implementation, math, sortings",1200,30529,0,https://codeforces.com/problemset/problem/492/B
+492A,Vanya and Cubes,implementation,800,21656,0,https://codeforces.com/problemset/problem/492/A
+491C,Deciphering,"flows, graph matchings",2300,236,0,https://codeforces.com/problemset/problem/491/C
+491B,New York Hotel,"greedy, math",2100,354,0,https://codeforces.com/problemset/problem/491/B
+491A,Up the hill,"constructive algorithms, implementation",1000,1323,0,https://codeforces.com/problemset/problem/491/A
+490F,Treeland Tour,"data structures, dfs and similar, dp, trees",2200,880,0,https://codeforces.com/problemset/problem/490/F
+490E,Restoring Increasing Sequence,"binary search, brute force, greedy, implementation",2000,1215,0,https://codeforces.com/problemset/problem/490/E
+490D,Chocolate,"brute force, dfs and similar, math, meet-in-the-middle, number theory",1900,1804,0,https://codeforces.com/problemset/problem/490/D
+490C,Hacking Cypher,"brute force, math, number theory, strings",1700,6217,0,https://codeforces.com/problemset/problem/490/C
+490B,Queue,"dsu, implementation",1500,4571,0,https://codeforces.com/problemset/problem/490/B
+490A,Team Olympiad,"greedy, implementation, sortings",800,23342,0,https://codeforces.com/problemset/problem/490/A
+489F,Special Matrices,"combinatorics, dp",2100,1311,0,https://codeforces.com/problemset/problem/489/F
+489E,Hiking,"binary search, dp",2300,719,0,https://codeforces.com/problemset/problem/489/E
+489D,Unbearable Controversy of Being,"brute force, combinatorics, dfs and similar, graphs",1700,5126,0,https://codeforces.com/problemset/problem/489/D
+489C,Given Length and Sum of Digits...,"dp, greedy, implementation",1400,23722,0,https://codeforces.com/problemset/problem/489/C
+489B,BerSU Ball,"dfs and similar, dp, graph matchings, greedy, sortings, two pointers",1200,22927,0,https://codeforces.com/problemset/problem/489/B
+489A,SwapSort,"greedy, implementation, sortings",1200,6652,0,https://codeforces.com/problemset/problem/489/A
+488B,Candy Boxes,"brute force, constructive algorithms, math",1900,1812,0,https://codeforces.com/problemset/problem/488/B
+488A,Giga Tower,brute force,1100,9389,0,https://codeforces.com/problemset/problem/488/A
+487E,Tourists,"data structures, dfs and similar, graphs, trees",3200,664,0,https://codeforces.com/problemset/problem/487/E
+487D,Conveyor Belts,data structures,2700,584,0,https://codeforces.com/problemset/problem/487/D
+487C,Prefix Product Sequence,"constructive algorithms, math, number theory",2300,1470,0,https://codeforces.com/problemset/problem/487/C
+487B,Strip,"binary search, data structures, dp, two pointers",2000,2246,0,https://codeforces.com/problemset/problem/487/B
+487A,Fight the Monster,"binary search, brute force, implementation",1800,3002,0,https://codeforces.com/problemset/problem/487/A
+486E,LIS of Sequence,"data structures, dp, greedy, hashing, math",2200,1268,0,https://codeforces.com/problemset/problem/486/E
+486D,Valid Sets,"dfs and similar, dp, math, trees",2100,2594,0,https://codeforces.com/problemset/problem/486/D
+486C,Palindrome Transformation,"brute force, greedy, implementation",1700,7516,0,https://codeforces.com/problemset/problem/486/C
+486B,OR in Matrix,"greedy, hashing, implementation",1300,9038,0,https://codeforces.com/problemset/problem/486/B
+486A,Calculating Function,"implementation, math",800,38227,0,https://codeforces.com/problemset/problem/486/A
+485B,Valuable Resources,"brute force, greedy",1300,5383,0,https://codeforces.com/problemset/problem/485/B
+485A,Factory,"implementation, math, matrices",1400,5897,0,https://codeforces.com/problemset/problem/485/A
+484E,Sign on Fence,"binary search, constructive algorithms, data structures",2500,1059,0,https://codeforces.com/problemset/problem/484/E
+484D,Kindergarten,"data structures, dp, greedy",2400,1460,0,https://codeforces.com/problemset/problem/484/D
+484C,Strange Sorting,"implementation, math",2600,404,0,https://codeforces.com/problemset/problem/484/C
+484B,Maximum Value,"binary search, math, sortings, two pointers",2100,4410,0,https://codeforces.com/problemset/problem/484/B
+484A,Bits,"bitmasks, constructive algorithms",1700,6738,0,https://codeforces.com/problemset/problem/484/A
+483B,Friends and Presents,"binary search, math",1800,3136,0,https://codeforces.com/problemset/problem/483/B
+483A,Counterexample,"brute force, implementation, math, number theory",1100,11815,0,https://codeforces.com/problemset/problem/483/A
+482E,ELCA,"data structures, trees",3200,122,0,https://codeforces.com/problemset/problem/482/E
+482D,Random Function and Tree,"combinatorics, dp, trees",2700,263,0,https://codeforces.com/problemset/problem/482/D
+482C,Game with Strings,"bitmasks, dp, probabilities",2600,581,0,https://codeforces.com/problemset/problem/482/C
+482B,Interesting Array,"constructive algorithms, data structures, trees",1800,4022,0,https://codeforces.com/problemset/problem/482/B
+482A,Diverse Permutation,"constructive algorithms, greedy",1200,7131,0,https://codeforces.com/problemset/problem/482/A
+480E,Parking Lot,"data structures, divide and conquer",2800,319,0,https://codeforces.com/problemset/problem/480/E
+480D,Parcels,"dp, graphs",2600,371,0,https://codeforces.com/problemset/problem/480/D
+479E,Riding in a Lift,"combinatorics, dp",1900,3654,0,https://codeforces.com/problemset/problem/479/E
+479D,Long Jumps,"binary search, greedy, implementation",1700,3899,0,https://codeforces.com/problemset/problem/479/D
+479C,Exams,"greedy, sortings",1400,15595,0,https://codeforces.com/problemset/problem/479/C
+479B,Towers,"brute force, constructive algorithms, greedy, implementation, sortings",1400,5350,0,https://codeforces.com/problemset/problem/479/B
+479A,Expression,"brute force, math",1000,39418,0,https://codeforces.com/problemset/problem/479/A
+478E,Wavy numbers,"brute force, dfs and similar, meet-in-the-middle, sortings",2900,122,0,https://codeforces.com/problemset/problem/478/E
+478D,Red-Green Towers,dp,2000,3546,0,https://codeforces.com/problemset/problem/478/D
+478C,Table Decorations,greedy,1800,10196,0,https://codeforces.com/problemset/problem/478/C
+478B,Random Teams,"combinatorics, constructive algorithms, greedy, math",1300,17992,0,https://codeforces.com/problemset/problem/478/B
+478A,Initial Bet,implementation,1100,17380,0,https://codeforces.com/problemset/problem/478/A
+477E,Dreamoon and Notepad,data structures,3100,62,0,https://codeforces.com/problemset/problem/477/E
+477D,Dreamoon and Binary,"dp, strings",2700,304,0,https://codeforces.com/problemset/problem/477/D
+476E,Dreamoon and Strings,"dp, strings",2200,1380,0,https://codeforces.com/problemset/problem/476/E
+476D,Dreamoon and Sets,"constructive algorithms, greedy, math",1900,2974,0,https://codeforces.com/problemset/problem/476/D
+476C,Dreamoon and Sums,math,1600,4507,0,https://codeforces.com/problemset/problem/476/C
+476B,Dreamoon and WiFi,"bitmasks, brute force, combinatorics, dp, math, probabilities",1300,15431,0,https://codeforces.com/problemset/problem/476/B
+476A,Dreamoon and Stairs,"implementation, math",1000,20147,0,https://codeforces.com/problemset/problem/476/A
+475F,Meta-universe,data structures,2900,138,0,https://codeforces.com/problemset/problem/475/F
+475E,Strongly Connected City 2,dfs and similar,2700,229,0,https://codeforces.com/problemset/problem/475/E
+475D,CGCDSSQ,"brute force, data structures, math",2000,2150,0,https://codeforces.com/problemset/problem/475/D
+475C,Kamal-ol-molk's Painting,"brute force, constructive algorithms, greedy",2100,700,0,https://codeforces.com/problemset/problem/475/C
+475B,Strongly Connected City,"brute force, dfs and similar, graphs, implementation",1400,5874,0,https://codeforces.com/problemset/problem/475/B
+475A,Bayan Bus,implementation,1100,4164,0,https://codeforces.com/problemset/problem/475/A
+474F,Ant colony,"data structures, math, number theory",2100,3607,0,https://codeforces.com/problemset/problem/474/F
+474E,Pillars,"binary search, data structures, dp, sortings, trees",2000,1825,0,https://codeforces.com/problemset/problem/474/E
+474D,Flowers,dp,1700,12970,0,https://codeforces.com/problemset/problem/474/D
+474C,Captain Marmot,"brute force, geometry",2000,2489,0,https://codeforces.com/problemset/problem/474/C
+474B,Worms,"binary search, implementation",1200,20361,0,https://codeforces.com/problemset/problem/474/B
+474A,Keyboard,implementation,900,20120,0,https://codeforces.com/problemset/problem/474/A
+472G,Design Tutorial: Increase the Constraints,"bitmasks, data structures, fft",2800,217,0,https://codeforces.com/problemset/problem/472/G
+472F,Design Tutorial: Change the Goal,"constructive algorithms, math, matrices",2700,198,0,https://codeforces.com/problemset/problem/472/F
+472E,Design Tutorial: Learn from a Game,"constructive algorithms, implementation",2800,98,0,https://codeforces.com/problemset/problem/472/E
+472D,Design Tutorial: Inverse the Problem,"dfs and similar, dsu, shortest paths, trees",1900,3012,0,https://codeforces.com/problemset/problem/472/D
+472C,Design Tutorial: Make It Nondeterministic,greedy,1400,5686,0,https://codeforces.com/problemset/problem/472/C
+472B,Design Tutorial: Learn from Life,,1300,6463,0,https://codeforces.com/problemset/problem/472/B
+472A,Design Tutorial: Learn from Math,"math, number theory",800,27868,0,https://codeforces.com/problemset/problem/472/A
+471E,MUH and Lots and Lots of Segments,"data structures, dsu",2700,55,0,https://codeforces.com/problemset/problem/471/E
+471D,MUH and Cube Walls,"string suffix structures, strings",1800,3775,0,https://codeforces.com/problemset/problem/471/D
+471C,MUH and House of Cards,"binary search, brute force, greedy, math",1700,3177,0,https://codeforces.com/problemset/problem/471/C
+471B,MUH and Important Things,"implementation, sortings",1300,5095,0,https://codeforces.com/problemset/problem/471/B
+471A,MUH and Sticks,implementation,1100,11009,0,https://codeforces.com/problemset/problem/471/A
+470H,Array Sorting,*special problem,2300,135,0,https://codeforces.com/problemset/problem/470/H
+470G,Hamming Distance,*special problem,2300,81,0,https://codeforces.com/problemset/problem/470/G
+470F,Pairwise Sums,*special problem,2300,87,0,https://codeforces.com/problemset/problem/470/F
+470E,Chessboard,*special problem,1900,175,0,https://codeforces.com/problemset/problem/470/E
+470D,Caesar Cipher,*special problem,1900,131,0,https://codeforces.com/problemset/problem/470/D
+470C,Eval,*special problem,1900,156,0,https://codeforces.com/problemset/problem/470/C
+470B,Hexakosioihexekontahexaphobia,*special problem,1800,237,0,https://codeforces.com/problemset/problem/470/B
+470A,Crystal Ball Sequence,"*special problem, implementation",1400,476,0,https://codeforces.com/problemset/problem/470/A
+469B,Chat Online,implementation,1300,7633,0,https://codeforces.com/problemset/problem/469/B
+469A,I Wanna Be the Guy,"greedy, implementation",800,35444,0,https://codeforces.com/problemset/problem/469/A
+468E,Permanent,"dp, graph matchings, math, meet-in-the-middle",3100,98,0,https://codeforces.com/problemset/problem/468/E
+468D,Tree,graph matchings,3100,186,0,https://codeforces.com/problemset/problem/468/D
+468C,Hack it!,"binary search, constructive algorithms, math",2500,794,0,https://codeforces.com/problemset/problem/468/C
+468B,Two Sets,"2-sat, dfs and similar, dsu, graph matchings, greedy",2000,2741,0,https://codeforces.com/problemset/problem/468/B
+468A,24 Game,"constructive algorithms, greedy, math",1500,6013,0,https://codeforces.com/problemset/problem/468/A
+467E,Alex and Complicated Task,"data structures, dp, greedy",2300,525,0,https://codeforces.com/problemset/problem/467/E
+467D,Fedor and Essay,"dfs and similar, dp, graphs, hashing, strings",2400,1298,0,https://codeforces.com/problemset/problem/467/D
+467C,George and Job,"dp, implementation",1700,8469,0,https://codeforces.com/problemset/problem/467/C
+467B,Fedor and New Game,"bitmasks, brute force, constructive algorithms, implementation",1100,18774,0,https://codeforces.com/problemset/problem/467/B
+467A,George and Accommodation,implementation,800,43724,0,https://codeforces.com/problemset/problem/467/A
+466E,Information Graph,"dfs and similar, dsu, graphs, trees",2100,1308,0,https://codeforces.com/problemset/problem/466/E
+466D,Increase Sequence,"combinatorics, dp",2100,1856,0,https://codeforces.com/problemset/problem/466/D
+466C,Number of Ways,"binary search, brute force, data structures, dp, two pointers",1700,19062,0,https://codeforces.com/problemset/problem/466/C
+466B,Wonder Room,"brute force, math",2000,3405,0,https://codeforces.com/problemset/problem/466/B
+466A,Cheap Travel,implementation,1200,25040,0,https://codeforces.com/problemset/problem/466/A
+465B,Inbox (100500),implementation,1000,7926,0,https://codeforces.com/problemset/problem/465/B
+465A,inc ARG,implementation,900,7979,0,https://codeforces.com/problemset/problem/465/A
+464E,The Classic Problem,"data structures, graphs, shortest paths",3000,418,0,https://codeforces.com/problemset/problem/464/E
+464D,World of Darkraft - 2,"dp, probabilities",2700,393,0,https://codeforces.com/problemset/problem/464/D
+464C,Substitutes in Number,dp,2100,1350,0,https://codeforces.com/problemset/problem/464/C
+464B,Restore Cube,"brute force, geometry",2000,1467,0,https://codeforces.com/problemset/problem/464/B
+464A,No to Palindromes!,"greedy, strings",1700,4583,0,https://codeforces.com/problemset/problem/464/A
+463E,Caisa and Tree,"brute force, dfs and similar, math, number theory, trees",2100,1049,0,https://codeforces.com/problemset/problem/463/E
+463D,Gargari and Permutations,"dfs and similar, dp, graphs, implementation",1900,3998,0,https://codeforces.com/problemset/problem/463/D
+463C,Gargari and Bishops,"greedy, hashing, implementation",1900,5800,0,https://codeforces.com/problemset/problem/463/C
+463B,Caisa and Pylons,"brute force, implementation, math",1100,13920,0,https://codeforces.com/problemset/problem/463/B
+463A,Caisa and Sugar,"brute force, implementation",1200,7363,0,https://codeforces.com/problemset/problem/463/A
+462B,Appleman and Card Game,greedy,1300,7807,0,https://codeforces.com/problemset/problem/462/B
+462A,Appleman and Easy Task,"brute force, implementation",1000,10911,0,https://codeforces.com/problemset/problem/462/A
+461E,Appleman and a Game,"binary search, shortest paths, strings",3000,212,0,https://codeforces.com/problemset/problem/461/E
+461D,Appleman and Complicated Task,"dsu, math",2800,256,0,https://codeforces.com/problemset/problem/461/D
+461C,Appleman and a Sheet of Paper,"data structures, implementation",2200,1105,0,https://codeforces.com/problemset/problem/461/C
+461B,Appleman and Tree,"dfs and similar, dp, trees",2000,3256,0,https://codeforces.com/problemset/problem/461/B
+461A,Appleman and Toastman,"greedy, sortings",1200,11411,0,https://codeforces.com/problemset/problem/461/A
+460E,Roland and Rose,"brute force, geometry, math, sortings",2700,273,0,https://codeforces.com/problemset/problem/460/E
+460D,Little Victor and Set,"brute force, constructive algorithms, math",2300,771,0,https://codeforces.com/problemset/problem/460/D
+460C,Present,"binary search, data structures, greedy",1700,4046,0,https://codeforces.com/problemset/problem/460/C
+460B,Little Dima and Equation,"brute force, implementation, math, number theory",1500,7728,0,https://codeforces.com/problemset/problem/460/B
+460A,Vasya and Socks,"brute force, implementation, math",900,25116,0,https://codeforces.com/problemset/problem/460/A
+459E,Pashmak and Graph,"dp, sortings",1900,3606,0,https://codeforces.com/problemset/problem/459/E
+459D,Pashmak and Parmida's problem,"data structures, divide and conquer, sortings",1800,5374,0,https://codeforces.com/problemset/problem/459/D
+459C,Pashmak and Buses,"combinatorics, constructive algorithms, math",1900,4610,0,https://codeforces.com/problemset/problem/459/C
+459B,Pashmak and Flowers,"combinatorics, implementation, sortings",1300,18863,0,https://codeforces.com/problemset/problem/459/B
+459A,Pashmak and Garden,implementation,1200,16789,0,https://codeforces.com/problemset/problem/459/A
+457F,An easy problem about trees,"dp, games, greedy, trees",3200,54,0,https://codeforces.com/problemset/problem/457/F
+457E,Flow Optimality,"constructive algorithms, flows, math",3000,36,0,https://codeforces.com/problemset/problem/457/E
+457D,Bingo!,"combinatorics, math, probabilities",2700,177,0,https://codeforces.com/problemset/problem/457/D
+457C,Elections,brute force,2100,660,0,https://codeforces.com/problemset/problem/457/C
+457B,Distributed Join,greedy,1900,1036,0,https://codeforces.com/problemset/problem/457/B
+457A,Golden System,"math, meet-in-the-middle",1700,1060,0,https://codeforces.com/problemset/problem/457/A
+456B,Fedya and Maths,"math, number theory",1200,10427,0,https://codeforces.com/problemset/problem/456/B
+456A,Laptops,sortings,1100,19643,0,https://codeforces.com/problemset/problem/456/A
+455E,Function,data structures,2900,388,0,https://codeforces.com/problemset/problem/455/E
+455D,Serega and Fun,data structures,2700,1508,0,https://codeforces.com/problemset/problem/455/D
+455C,Civilization,"dfs and similar, dp, dsu, ternary search, trees",2100,3497,0,https://codeforces.com/problemset/problem/455/C
+455B,A Lot of Games,"dfs and similar, dp, games, implementation, strings, trees",1900,3603,0,https://codeforces.com/problemset/problem/455/B
+455A,Boredom,dp,1500,26925,0,https://codeforces.com/problemset/problem/455/A
+454B,Little Pony and Sort by Shift,implementation,1200,10715,0,https://codeforces.com/problemset/problem/454/B
+454A,Little Pony and Crystal Mine,implementation,800,10765,0,https://codeforces.com/problemset/problem/454/A
+453E,Little Pony and Lord Tirek,data structures,3100,248,0,https://codeforces.com/problemset/problem/453/E
+453D,Little Pony and Elements of Harmony,"dp, matrices",3000,262,0,https://codeforces.com/problemset/problem/453/D
+453C,Little Pony and Summer Sun Celebration,"constructive algorithms, dfs and similar, graphs",2200,1137,0,https://codeforces.com/problemset/problem/453/C
+453B,Little Pony and Harmony Chest,"bitmasks, brute force, dp",2000,2898,0,https://codeforces.com/problemset/problem/453/B
+453A,Little Pony and Expected Maximum,probabilities,1600,6342,0,https://codeforces.com/problemset/problem/453/A
+452F,Permutation,"data structures, divide and conquer, hashing",2700,487,0,https://codeforces.com/problemset/problem/452/F
+452E,Three strings,"data structures, dsu, string suffix structures, strings",2400,567,0,https://codeforces.com/problemset/problem/452/E
+452D,"Washer, Dryer, Folder","greedy, implementation",1900,1204,0,https://codeforces.com/problemset/problem/452/D
+452C,Magic Trick,"combinatorics, math, probabilities",2100,1100,0,https://codeforces.com/problemset/problem/452/C
+452B,4-point polyline,"brute force, constructive algorithms, geometry, trees",1800,1787,0,https://codeforces.com/problemset/problem/452/B
+452A,Eevee,"brute force, implementation, strings",1000,5946,0,https://codeforces.com/problemset/problem/452/A
+451E,Devu and Flowers,"bitmasks, combinatorics, number theory",2300,1605,0,https://codeforces.com/problemset/problem/451/E
+451D,Count Good Substrings,math,2000,3340,0,https://codeforces.com/problemset/problem/451/D
+451C,Predict Outcome of the Game,"brute force, implementation, math",1700,2723,0,https://codeforces.com/problemset/problem/451/C
+451B,Sort the Array,"implementation, sortings",1300,18289,0,https://codeforces.com/problemset/problem/451/B
+451A,Game With Sticks,implementation,900,30890,0,https://codeforces.com/problemset/problem/451/A
+450B,Jzzhu and Sequences,"implementation, math",1300,12843,0,https://codeforces.com/problemset/problem/450/B
+450A,Jzzhu and Children,implementation,1000,13397,0,https://codeforces.com/problemset/problem/450/A
+449E,Jzzhu and Squares,"dp, math, number theory",2900,174,0,https://codeforces.com/problemset/problem/449/E
+449D,Jzzhu and Numbers,"bitmasks, combinatorics, dp",2400,1819,0,https://codeforces.com/problemset/problem/449/D
+449C,Jzzhu and Apples,"constructive algorithms, number theory",2500,1604,0,https://codeforces.com/problemset/problem/449/C
+449B,Jzzhu and Cities,"graphs, greedy, shortest paths",2000,3867,0,https://codeforces.com/problemset/problem/449/B
+449A,Jzzhu and Chocolate,"greedy, math",1700,3399,0,https://codeforces.com/problemset/problem/449/A
+448E,Divisors,"brute force, dfs and similar, implementation, number theory",2200,1076,0,https://codeforces.com/problemset/problem/448/E
+448D,Multiplication Table,"binary search, brute force",1800,7022,0,https://codeforces.com/problemset/problem/448/D
+448C,Painting Fence,"divide and conquer, dp, greedy",1900,4708,0,https://codeforces.com/problemset/problem/448/C
+448B,Suffix Structures,"implementation, strings",1400,9220,0,https://codeforces.com/problemset/problem/448/B
+448A,Rewards,implementation,800,17364,0,https://codeforces.com/problemset/problem/448/A
+447B,DZY Loves Strings,"greedy, implementation",1000,11771,0,https://codeforces.com/problemset/problem/447/B
+447A,DZY Loves Hash,implementation,800,6740,0,https://codeforces.com/problemset/problem/447/A
+446E,DZY Loves Bridges,"math, matrices",3100,72,0,https://codeforces.com/problemset/problem/446/E
+446D,DZY Loves Games,"math, matrices, probabilities",2800,200,0,https://codeforces.com/problemset/problem/446/D
+446C,DZY Loves Fibonacci Numbers,"data structures, math, number theory",2400,1635,0,https://codeforces.com/problemset/problem/446/C
+446B,DZY Loves Modification,"brute force, data structures, greedy",2000,2695,0,https://codeforces.com/problemset/problem/446/B
+446A,DZY Loves Sequences,"dp, implementation, two pointers",1600,8537,0,https://codeforces.com/problemset/problem/446/A
+445B,DZY Loves Chemistry,"dfs and similar, dsu, greedy",1400,6884,0,https://codeforces.com/problemset/problem/445/B
+445A,DZY Loves Chessboard,"dfs and similar, implementation",1200,13252,0,https://codeforces.com/problemset/problem/445/A
+444E,DZY Loves Planting,"binary search, dsu, trees",2700,404,0,https://codeforces.com/problemset/problem/444/E
+444D,DZY Loves Strings,"binary search, hashing, strings, two pointers",2500,434,0,https://codeforces.com/problemset/problem/444/D
+444C,DZY Loves Colors,data structures,2400,1508,0,https://codeforces.com/problemset/problem/444/C
+444B,DZY Loves FFT,probabilities,2300,803,0,https://codeforces.com/problemset/problem/444/B
+444A,DZY Loves Physics,"greedy, math",1600,2670,0,https://codeforces.com/problemset/problem/444/A
+443B,Kolya and Tandem Repeat,"brute force, implementation, strings",1500,3247,0,https://codeforces.com/problemset/problem/443/B
+443A,Anton and Letters,"constructive algorithms, implementation",800,33096,0,https://codeforces.com/problemset/problem/443/A
+442E,Gena and Second Distance,geometry,3100,120,0,https://codeforces.com/problemset/problem/442/E
+442D,Adam and Tree,"data structures, trees",2600,524,0,https://codeforces.com/problemset/problem/442/D
+442C,Artem and Array,"data structures, greedy",2500,1096,0,https://codeforces.com/problemset/problem/442/C
+442B,Andrey and Problem,"greedy, math, probabilities",1800,3731,0,https://codeforces.com/problemset/problem/442/B
+442A,Borya and Hanabi,"bitmasks, brute force, implementation",1700,1763,0,https://codeforces.com/problemset/problem/442/A
+441E,Valera and Number,"bitmasks, dp, math, probabilities",2400,312,0,https://codeforces.com/problemset/problem/441/E
+441D,Valera and Swaps,"constructive algorithms, dsu, graphs, implementation, math, string suffix structures",2100,823,0,https://codeforces.com/problemset/problem/441/D
+441C,Valera and Tubes,"constructive algorithms, dfs and similar, implementation",1500,7336,0,https://codeforces.com/problemset/problem/441/C
+441B,Valera and Fruits,"greedy, implementation",1400,5024,0,https://codeforces.com/problemset/problem/441/B
+441A,Valera and Antique Items,implementation,1000,12054,0,https://codeforces.com/problemset/problem/441/A
+440D,Berland Federalization,"dp, trees",2200,291,0,https://codeforces.com/problemset/problem/440/D
+440C,One-Based Arithmetic,"brute force, dfs and similar, divide and conquer",1800,623,0,https://codeforces.com/problemset/problem/440/C
+440B,Balancer,"greedy, implementation",1600,1473,0,https://codeforces.com/problemset/problem/440/B
+440A,Forgotten Episode,implementation,800,3575,0,https://codeforces.com/problemset/problem/440/A
+439E,Devu and Birthday Celebration,"combinatorics, dp, math",2100,994,0,https://codeforces.com/problemset/problem/439/E
+439D,Devu and his Brother,"binary search, sortings, ternary search, two pointers",1700,3497,0,https://codeforces.com/problemset/problem/439/D
+439C,Devu and Partitioning of the Array,"brute force, constructive algorithms, implementation, number theory",1700,2979,0,https://codeforces.com/problemset/problem/439/C
+439B,"Devu, the Dumb Guy","implementation, sortings",1200,10130,0,https://codeforces.com/problemset/problem/439/B
+439A,"Devu, the Singer and Churu, the Joker","greedy, implementation",900,15755,0,https://codeforces.com/problemset/problem/439/A
+438E,The Child and Binary Tree,"combinatorics, divide and conquer, fft, number theory",3100,870,0,https://codeforces.com/problemset/problem/438/E
+438D,The Child and Sequence,"data structures, math",2300,2790,0,https://codeforces.com/problemset/problem/438/D
+437E,The Child and Polygon,"dp, geometry",2500,412,0,https://codeforces.com/problemset/problem/437/E
+437D,The Child and Zoo,"dsu, sortings",1900,2327,0,https://codeforces.com/problemset/problem/437/D
+437C,The Child and Toy,"graphs, greedy, sortings",1400,8986,0,https://codeforces.com/problemset/problem/437/C
+437B,The Child and Set,"bitmasks, greedy, implementation, sortings",1500,5359,0,https://codeforces.com/problemset/problem/437/B
+437A,The Child and Homework,implementation,1300,6498,0,https://codeforces.com/problemset/problem/437/A
+436F,Banners,"brute force, data structures, dp",3000,184,0,https://codeforces.com/problemset/problem/436/F
+436E,Cardboard Box,"data structures, greedy",2600,418,0,https://codeforces.com/problemset/problem/436/E
+436D,Pudding Monsters,dp,2800,222,0,https://codeforces.com/problemset/problem/436/D
+436C,Dungeons and Candies,"dsu, graphs, greedy, trees",1800,2133,0,https://codeforces.com/problemset/problem/436/C
+436B,Om Nom and Spiders,"implementation, math",1400,2741,0,https://codeforces.com/problemset/problem/436/B
+436A,Feed with Candy,greedy,1500,2748,0,https://codeforces.com/problemset/problem/436/A
+435E,Special Graph,,2500,174,0,https://codeforces.com/problemset/problem/435/E
+435D,Special Grid,"brute force, dp, greedy",2000,634,0,https://codeforces.com/problemset/problem/435/D
+435C,Cardiogram,implementation,1600,2261,0,https://codeforces.com/problemset/problem/435/C
+435B,Pasha Maximizes,greedy,1400,4339,0,https://codeforces.com/problemset/problem/435/B
+435A,Queue on Bus Stop,implementation,1000,7283,0,https://codeforces.com/problemset/problem/435/A
+434E,Furukawa Nagisa's Tree,"binary search, divide and conquer, sortings, trees",3000,151,0,https://codeforces.com/problemset/problem/434/E
+434D,Nanami's Power Plant,flows,2900,234,0,https://codeforces.com/problemset/problem/434/D
+433E,Tachibana Kanade's Tofu,dp,2500,323,0,https://codeforces.com/problemset/problem/433/E
+433D,Nanami's Digital Board,"dsu, implementation",2000,892,0,https://codeforces.com/problemset/problem/433/D
+433C,Ryouko's Memory Note,"implementation, math, sortings",1800,1921,0,https://codeforces.com/problemset/problem/433/C
+433B,Kuriyama Mirai's Stones,"dp, implementation, sortings",1200,13979,0,https://codeforces.com/problemset/problem/433/B
+433A,Kitahara Haruki's Gift,"brute force, implementation",1100,8043,0,https://codeforces.com/problemset/problem/433/A
+432E,Square Tiling,"constructive algorithms, greedy",2300,507,0,https://codeforces.com/problemset/problem/432/E
+432D,Prefixes and Suffixes,"dp, string suffix structures, strings, two pointers",2000,3793,0,https://codeforces.com/problemset/problem/432/D
+432C,Prime Swaps,"greedy, sortings",1800,1971,0,https://codeforces.com/problemset/problem/432/C
+432B,Football Kit,"brute force, greedy, implementation",1200,7620,0,https://codeforces.com/problemset/problem/432/B
+432A,Choosing Teams,"greedy, implementation, sortings",800,24283,0,https://codeforces.com/problemset/problem/432/A
+431E,Chemistry Experiment,"binary search, data structures, ternary search",2200,341,0,https://codeforces.com/problemset/problem/431/E
+431D,Random Task,"binary search, bitmasks, combinatorics, dp, math",2100,1500,0,https://codeforces.com/problemset/problem/431/D
+431C,k-Tree,"dp, implementation, trees",1600,13332,0,https://codeforces.com/problemset/problem/431/C
+431B,Shower Line,"brute force, implementation",1200,6503,0,https://codeforces.com/problemset/problem/431/B
+431A,Black Square,implementation,800,21119,0,https://codeforces.com/problemset/problem/431/A
+430B,Balls Game,"brute force, two pointers",1400,2589,0,https://codeforces.com/problemset/problem/430/B
+430A,Points and Segments (easy),"constructive algorithms, sortings",1600,1816,0,https://codeforces.com/problemset/problem/430/A
+429E,Points and Segments,graphs,3000,416,0,https://codeforces.com/problemset/problem/429/E
+429D,Tricky Function,"data structures, divide and conquer, geometry",2200,1707,0,https://codeforces.com/problemset/problem/429/D
+429C,Guess the Tree,"bitmasks, constructive algorithms, dp, greedy, trees",2300,654,0,https://codeforces.com/problemset/problem/429/C
+429B,Working out,dp,1600,5457,0,https://codeforces.com/problemset/problem/429/B
+429A,Xor-tree,"dfs and similar, trees",1300,6235,0,https://codeforces.com/problemset/problem/429/A
+427E,Police Patrol,"greedy, implementation, math, ternary search",2000,1197,0,https://codeforces.com/problemset/problem/427/E
+427D,Match & Catch,"dp, string suffix structures, strings",2200,1317,0,https://codeforces.com/problemset/problem/427/D
+427C,Checkposts,"dfs and similar, graphs, two pointers",1700,6760,0,https://codeforces.com/problemset/problem/427/C
+427B,Prison Transfer,"data structures, implementation",1100,9529,0,https://codeforces.com/problemset/problem/427/B
+427A,Police Recruits,implementation,800,25510,0,https://codeforces.com/problemset/problem/427/A
+426B,Sereja and Mirroring,implementation,1300,3087,0,https://codeforces.com/problemset/problem/426/B
+426A,Sereja and Mugs,implementation,800,6495,0,https://codeforces.com/problemset/problem/426/A
+425E,Sereja and Sets,dp,2500,365,0,https://codeforces.com/problemset/problem/425/E
+425D,Sereja and Squares,"binary search, data structures, hashing",2300,911,0,https://codeforces.com/problemset/problem/425/D
+425C,Sereja and Two Sequences,"data structures, dp",2300,756,0,https://codeforces.com/problemset/problem/425/C
+425B,Sereja and Table,"bitmasks, greedy",2200,982,0,https://codeforces.com/problemset/problem/425/B
+425A,Sereja and Swaps,"brute force, sortings",1500,3013,0,https://codeforces.com/problemset/problem/425/A
+424E,Colored Jenga,"dfs and similar, dp, probabilities",2500,77,0,https://codeforces.com/problemset/problem/424/E
+424D,Biathlon Track,"binary search, brute force, constructive algorithms, data structures, dp",2300,445,0,https://codeforces.com/problemset/problem/424/D
+424C,Magic Formulas,math,1600,3395,0,https://codeforces.com/problemset/problem/424/C
+424B,Megacity,"binary search, greedy, implementation, sortings",1200,4839,0,https://codeforces.com/problemset/problem/424/B
+424A,Squats,implementation,900,5429,0,https://codeforces.com/problemset/problem/424/A
+421D,Bug in Code,"binary search, data structures, sortings",1900,338,0,https://codeforces.com/problemset/problem/421/D
+421A,Pasha and Hamsters,"constructive algorithms, implementation",800,3551,0,https://codeforces.com/problemset/problem/421/A
+420E,Playing the ball,geometry,2600,146,0,https://codeforces.com/problemset/problem/420/E
+420D,Cup Trick,data structures,2200,462,0,https://codeforces.com/problemset/problem/420/D
+420C,Bug in Code,"data structures, graphs, implementation, two pointers",1900,933,0,https://codeforces.com/problemset/problem/420/C
+420B,Online Meeting,implementation,1800,901,0,https://codeforces.com/problemset/problem/420/B
+420A,Start Up,implementation,1000,3872,0,https://codeforces.com/problemset/problem/420/A
+418E,Tricky Password,data structures,3100,129,0,https://codeforces.com/problemset/problem/418/E
+418D,Big Problems for Organizers,"data structures, graphs, trees",2800,276,0,https://codeforces.com/problemset/problem/418/D
+417E,Square Table,"constructive algorithms, math, probabilities",2400,597,0,https://codeforces.com/problemset/problem/417/E
+417D,Cunning Gena,"bitmasks, dp, greedy, sortings",1900,1510,0,https://codeforces.com/problemset/problem/417/D
+417C,Football,"constructive algorithms, graphs, implementation",1400,3506,0,https://codeforces.com/problemset/problem/417/C
+417B,Crash,implementation,1400,1414,0,https://codeforces.com/problemset/problem/417/B
+417A,Elimination,"dp, implementation, math",1500,1892,0,https://codeforces.com/problemset/problem/417/A
+416E,President's Path,"dp, graphs, shortest paths",2500,797,0,https://codeforces.com/problemset/problem/416/E
+416D,Population Size,"greedy, implementation, math",2400,621,0,https://codeforces.com/problemset/problem/416/D
+416C,Booking System,"binary search, dp, greedy, implementation",1600,4743,0,https://codeforces.com/problemset/problem/416/C
+416B,Art Union,"brute force, dp, implementation",1300,5601,0,https://codeforces.com/problemset/problem/416/B
+416A,Guess a number!,"greedy, implementation, two pointers",1400,5693,0,https://codeforces.com/problemset/problem/416/A
+415B,Mashmokh and Tokens,"binary search, greedy, implementation, math",1500,4121,0,https://codeforces.com/problemset/problem/415/B
+415A,Mashmokh and Lights,implementation,900,6290,0,https://codeforces.com/problemset/problem/415/A
+414E,Mashmokh's Designed Problem,data structures,3200,110,0,https://codeforces.com/problemset/problem/414/E
+414D,Mashmokh and Water Tanks,"binary search, data structures, greedy, trees, two pointers",2300,505,0,https://codeforces.com/problemset/problem/414/D
+414C,Mashmokh and Reverse Operation,"combinatorics, divide and conquer",2100,1599,0,https://codeforces.com/problemset/problem/414/C
+414B,Mashmokh and ACM,"combinatorics, dp, number theory",1400,11387,0,https://codeforces.com/problemset/problem/414/B
+414A,Mashmokh and Numbers,"constructive algorithms, number theory",1500,6827,0,https://codeforces.com/problemset/problem/414/A
+413E,Maze 2D,"data structures, divide and conquer",2200,323,0,https://codeforces.com/problemset/problem/413/E
+413D,2048,"bitmasks, dp",2000,467,0,https://codeforces.com/problemset/problem/413/D
+413C,Jeopardy!,"greedy, math",1400,1516,0,https://codeforces.com/problemset/problem/413/C
+413B,Spyke Chatting,implementation,1300,1313,0,https://codeforces.com/problemset/problem/413/B
+413A,Data Recovery,implementation,1200,1877,0,https://codeforces.com/problemset/problem/413/A
+412E,E-mail Addresses,implementation,1900,673,0,https://codeforces.com/problemset/problem/412/E
+412D,Giving Awards,dfs and similar,2000,1247,0,https://codeforces.com/problemset/problem/412/D
+412C,Pattern,"implementation, strings",1200,2469,0,https://codeforces.com/problemset/problem/412/C
+412B,Network Configuration,"greedy, sortings",900,3190,0,https://codeforces.com/problemset/problem/412/B
+412A,Poster,"greedy, implementation",900,2732,0,https://codeforces.com/problemset/problem/412/A
+411C,Kicker,implementation,1700,895,0,https://codeforces.com/problemset/problem/411/C
+411B,Multi-core Processor,implementation,1600,1116,0,https://codeforces.com/problemset/problem/411/B
+411A,Password Check,implementation,800,4028,0,https://codeforces.com/problemset/problem/411/A
+409I,Feed the Golorp,*special problem,2400,73,0,https://codeforces.com/problemset/problem/409/I
+409H,A + B Strikes Back,"*special problem, brute force, constructive algorithms, dsu, implementation",1500,5139,0,https://codeforces.com/problemset/problem/409/H
+409G,On a plane,*special problem,2200,319,0,https://codeforces.com/problemset/problem/409/G
+409F,000001,*special problem,1900,1517,0,https://codeforces.com/problemset/problem/409/F
+409E,Dome,*special problem,1800,446,0,https://codeforces.com/problemset/problem/409/E
+409D,Big Data,*special problem,1700,1178,0,https://codeforces.com/problemset/problem/409/D
+409C,Magnum Opus,*special problem,1700,1605,0,https://codeforces.com/problemset/problem/409/C
+409B,Mysterious Language,*special problem,1700,1118,0,https://codeforces.com/problemset/problem/409/B
+409A,The Great Game,*special problem,1700,2002,0,https://codeforces.com/problemset/problem/409/A
+408B,Garland,implementation,1200,4925,0,https://codeforces.com/problemset/problem/408/B
+408A,Line to Cashier,implementation,900,7072,0,https://codeforces.com/problemset/problem/408/A
+407E,k-d-sequence,data structures,3100,305,0,https://codeforces.com/problemset/problem/407/E
+407D,Largest Submatrix 3,"dp, hashing",2700,372,0,https://codeforces.com/problemset/problem/407/D
+407C,Curious Array,"brute force, combinatorics, implementation, math",2500,612,0,https://codeforces.com/problemset/problem/407/C
+407B,Long Path,"dp, implementation",1600,4645,0,https://codeforces.com/problemset/problem/407/B
+407A,Triangle,"brute force, geometry, implementation, math",1600,3680,0,https://codeforces.com/problemset/problem/407/A
+406E,Hamming Triples,"implementation, math, two pointers",2800,169,0,https://codeforces.com/problemset/problem/406/E
+406D,Hill Climbing,"dfs and similar, geometry, trees",2200,925,0,https://codeforces.com/problemset/problem/406/D
+405E,Graph Cutting,"dfs and similar, graphs",2300,950,0,https://codeforces.com/problemset/problem/405/E
+405D,Toy Sum,"greedy, implementation, math",1700,2619,0,https://codeforces.com/problemset/problem/405/D
+405C,Unusual Product,"implementation, math",1600,3780,0,https://codeforces.com/problemset/problem/405/C
+405B,Domino Effect,,1100,4488,0,https://codeforces.com/problemset/problem/405/B
+405A,Gravity Flip,"greedy, implementation, sortings",900,37370,0,https://codeforces.com/problemset/problem/405/A
+404E,Maze 1D,"binary search, greedy, implementation",2200,397,0,https://codeforces.com/problemset/problem/404/E
+404D,Minesweeper 1D,"dp, implementation",1900,1449,0,https://codeforces.com/problemset/problem/404/D
+404C,Restore Graph,"dfs and similar, graphs, sortings",1800,3438,0,https://codeforces.com/problemset/problem/404/C
+404B,Marathon,"implementation, math",1500,2629,0,https://codeforces.com/problemset/problem/404/B
+404A,Valera and X,implementation,1000,11703,0,https://codeforces.com/problemset/problem/404/A
+403E,Two Rooted Trees,"data structures, implementation, trees",2900,127,0,https://codeforces.com/problemset/problem/403/E
+403D,Beautiful Pairs of Numbers,"combinatorics, dp",2300,807,0,https://codeforces.com/problemset/problem/403/D
+402E,Strictly Positive Matrix,"graphs, math",2200,1495,0,https://codeforces.com/problemset/problem/402/E
+402D,Upgrading Array,"dp, greedy, math, number theory",1800,1847,0,https://codeforces.com/problemset/problem/402/D
+402C,Searching for Graph,"brute force, constructive algorithms, graphs",1500,3813,0,https://codeforces.com/problemset/problem/402/C
+402B,Trees in a Row,"brute force, implementation",1400,2757,0,https://codeforces.com/problemset/problem/402/B
+402A,Nuts,"greedy, math",1100,3830,0,https://codeforces.com/problemset/problem/402/A
+401E,Olympic Games,math,2500,146,0,https://codeforces.com/problemset/problem/401/E
+401D,Roman and Numbers,"bitmasks, brute force, combinatorics, dp, number theory",2000,2501,0,https://codeforces.com/problemset/problem/401/D
+401C,Team,"constructive algorithms, greedy, implementation",1400,11274,0,https://codeforces.com/problemset/problem/401/C
+401B,Sereja and Contests,"greedy, implementation, math",1200,3851,0,https://codeforces.com/problemset/problem/401/B
+401A,Vanya and Cards,"implementation, math",800,11755,0,https://codeforces.com/problemset/problem/401/A
+400E,Inna and Binary Logic,"binary search, bitmasks, data structures",2100,713,0,https://codeforces.com/problemset/problem/400/E
+400D,Dima and Bacteria,"dsu, graphs, shortest paths",2000,2024,0,https://codeforces.com/problemset/problem/400/D
+400C,Inna and Huge Candy Matrix,"implementation, math",1500,2528,0,https://codeforces.com/problemset/problem/400/C
+400B,Inna and New Matrix of Candies,"brute force, implementation, schedules",1200,4376,0,https://codeforces.com/problemset/problem/400/B
+400A,Inna and Choose Options,implementation,1000,5627,0,https://codeforces.com/problemset/problem/400/A
+389B,Fox and Cross,"greedy, implementation",1100,5202,0,https://codeforces.com/problemset/problem/389/B
+389A,Fox and Number Game,"greedy, math",1000,8896,0,https://codeforces.com/problemset/problem/389/A
+388E,Fox and Meteor Shower,geometry,3100,89,0,https://codeforces.com/problemset/problem/388/E
+388D,Fox and Perfect Sets,math,2700,253,0,https://codeforces.com/problemset/problem/388/D
+388C,Fox and Card Game,"games, greedy, sortings",2000,2115,0,https://codeforces.com/problemset/problem/388/C
+388B,Fox and Minimal path,"bitmasks, constructive algorithms, graphs, implementation, math",1900,1845,0,https://codeforces.com/problemset/problem/388/B
+388A,Fox and Box Accumulation,"greedy, sortings",1400,7949,0,https://codeforces.com/problemset/problem/388/A
+387E,George and Cards,"binary search, data structures",2200,630,0,https://codeforces.com/problemset/problem/387/E
+387D,George and Interesting Graph,graph matchings,2200,534,0,https://codeforces.com/problemset/problem/387/D
+387C,George and Number,"greedy, implementation",1700,1892,0,https://codeforces.com/problemset/problem/387/C
+387B,George and Round,"brute force, greedy, two pointers",1200,7861,0,https://codeforces.com/problemset/problem/387/B
+387A,George and Sleep,implementation,900,6808,0,https://codeforces.com/problemset/problem/387/A
+386D,Game with Points,"dp, graphs, implementation, shortest paths",2100,268,0,https://codeforces.com/problemset/problem/386/D
+386C,Diverse Substrings,"dp, strings, two pointers",2000,375,0,https://codeforces.com/problemset/problem/386/C
+386B,"Fly, freebies, fly!","binary search, brute force, implementation",1400,1321,0,https://codeforces.com/problemset/problem/386/B
+386A,Second-Price Auction,implementation,800,2333,0,https://codeforces.com/problemset/problem/386/A
+385E,Bear in the Field,"math, matrices",2300,424,0,https://codeforces.com/problemset/problem/385/E
+385D,Bear and Floodlight,"bitmasks, dp, geometry",2200,551,0,https://codeforces.com/problemset/problem/385/D
+385C,Bear and Prime Numbers,"binary search, brute force, data structures, dp, implementation, math, number theory",1700,6123,0,https://codeforces.com/problemset/problem/385/C
+385B,Bear and Strings,"brute force, greedy, implementation, math, strings",1200,6105,0,https://codeforces.com/problemset/problem/385/B
+385A,Bear and Raspberry,"brute force, greedy, implementation",1000,10507,0,https://codeforces.com/problemset/problem/385/A
+384B,Multitasking,"greedy, implementation, sortings, two pointers",1500,2716,0,https://codeforces.com/problemset/problem/384/B
+384A,Coder,implementation,800,11611,0,https://codeforces.com/problemset/problem/384/A
+383E,Vowels,"combinatorics, divide and conquer, dp",2700,992,0,https://codeforces.com/problemset/problem/383/E
+383D,Antimatter,dp,2300,1988,0,https://codeforces.com/problemset/problem/383/D
+383C,Propagating tree,"data structures, dfs and similar, trees",2000,3535,0,https://codeforces.com/problemset/problem/383/C
+383B,Volcanoes,"binary search, implementation, sortings, two pointers",2500,510,0,https://codeforces.com/problemset/problem/383/B
+383A,Milking cows,"data structures, greedy",1600,4235,0,https://codeforces.com/problemset/problem/383/A
+382E,Ksenia and Combinatorics,"combinatorics, dp",2600,235,0,https://codeforces.com/problemset/problem/382/E
+382D,Ksenia and Pawns,"dfs and similar, graphs, implementation, trees",2200,553,0,https://codeforces.com/problemset/problem/382/D
+382C,Arithmetic Progression,"implementation, sortings",1700,5447,0,https://codeforces.com/problemset/problem/382/C
+382B,Number Busters,"binary search, math",2000,1193,0,https://codeforces.com/problemset/problem/382/B
+382A,Ksenia and Pan Scales,"greedy, implementation",1100,6287,0,https://codeforces.com/problemset/problem/382/A
+381B,Sereja and Stairs,"greedy, implementation, sortings",1100,4750,0,https://codeforces.com/problemset/problem/381/B
+381A,Sereja and Dima,"greedy, implementation, two pointers",800,19482,0,https://codeforces.com/problemset/problem/381/A
+380E,Sereja and Dividing,data structures,2600,205,0,https://codeforces.com/problemset/problem/380/E
+380D,Sereja and Cinema,"combinatorics, math",2500,343,0,https://codeforces.com/problemset/problem/380/D
+380C,Sereja and Brackets,"data structures, schedules",2000,6694,0,https://codeforces.com/problemset/problem/380/C
+380B,Sereja and Tree,"graphs, implementation",2400,447,0,https://codeforces.com/problemset/problem/380/B
+380A,Sereja and Prefixes,"binary search, brute force",1600,2206,0,https://codeforces.com/problemset/problem/380/A
+379G,New Year Cactus,dp,3100,85,0,https://codeforces.com/problemset/problem/379/G
+379F,New Year Tree,"data structures, divide and conquer, trees",2400,1256,0,https://codeforces.com/problemset/problem/379/F
+379E,New Year Tree Decorations,"geometry, schedules, sortings",2500,279,0,https://codeforces.com/problemset/problem/379/E
+379D,New Year Letter,"bitmasks, brute force, dp",2000,1229,0,https://codeforces.com/problemset/problem/379/D
+379C,New Year Ratings Change,"greedy, sortings",1400,5397,0,https://codeforces.com/problemset/problem/379/C
+379B,New Year Present,"constructive algorithms, implementation",1200,5888,0,https://codeforces.com/problemset/problem/379/B
+379A,New Year Candles,implementation,1000,24048,0,https://codeforces.com/problemset/problem/379/A
+378B,Semifinals,"implementation, sortings",1300,3563,0,https://codeforces.com/problemset/problem/378/B
+378A,Playing with Dice,brute force,800,13666,0,https://codeforces.com/problemset/problem/378/A
+377E,Cookie Clicker,"dp, geometry",2800,217,0,https://codeforces.com/problemset/problem/377/E
+377D,Developing Game,data structures,2400,680,0,https://codeforces.com/problemset/problem/377/D
+377C,Captains Mode,"bitmasks, dp, games",2200,863,0,https://codeforces.com/problemset/problem/377/C
+377B,Preparing for the Contest,"binary search, data structures, greedy, sortings",1900,1605,0,https://codeforces.com/problemset/problem/377/B
+377A,Maze,dfs and similar,1600,11453,0,https://codeforces.com/problemset/problem/377/A
+376B,I.O.U.,implementation,1300,3767,0,https://codeforces.com/problemset/problem/376/B
+376A,Lever,"implementation, math",900,5950,0,https://codeforces.com/problemset/problem/376/A
+375E,Red and Black Tree,"dp, implementation, math",3000,250,0,https://codeforces.com/problemset/problem/375/E
+375D,Tree and Queries,"data structures, dfs and similar, trees",2400,2826,0,https://codeforces.com/problemset/problem/375/D
+375C,Circling Round Treasures,"bitmasks, shortest paths",2600,341,0,https://codeforces.com/problemset/problem/375/C
+375B,Maximum Submatrix 2,"data structures, dp, implementation, sortings",1600,3842,0,https://codeforces.com/problemset/problem/375/B
+375A,Divisible by Seven,"math, number theory",1600,3312,0,https://codeforces.com/problemset/problem/375/A
+374E,Inna and Babies,"binary search, data structures, dsu, geometry, implementation",2600,149,0,https://codeforces.com/problemset/problem/374/E
+374D,Inna and Sequence,"binary search, data structures, dp, trees",2000,635,0,https://codeforces.com/problemset/problem/374/D
+374C,Inna and Dima,"dfs and similar, dp, graphs, implementation",1900,1944,0,https://codeforces.com/problemset/problem/374/C
+374B,Inna and Nine,"combinatorics, greedy",1500,2462,0,https://codeforces.com/problemset/problem/374/B
+374A,Inna and Pink Pony,"greedy, implementation",2000,2220,0,https://codeforces.com/problemset/problem/374/A
+373B,Making Sequences is Fun,"binary search, implementation, math",1600,1998,0,https://codeforces.com/problemset/problem/373/B
+373A,Collecting Beats is Fun,implementation,900,6856,0,https://codeforces.com/problemset/problem/373/A
+372E,Drawing Circles is Fun,"combinatorics, geometry",3000,128,0,https://codeforces.com/problemset/problem/372/E
+372D,Choosing Subtree is Fun,"binary search, data structures, dfs and similar, trees, two pointers",2600,499,0,https://codeforces.com/problemset/problem/372/D
+372C,Watching Fireworks is Fun,"data structures, dp, math",2100,1584,0,https://codeforces.com/problemset/problem/372/C
+372B,Counting Rectangles is Fun,"brute force, divide and conquer, dp",1900,1867,0,https://codeforces.com/problemset/problem/372/B
+372A,Counting Kangaroos is Fun,"binary search, greedy, sortings, two pointers",1600,7023,0,https://codeforces.com/problemset/problem/372/A
+371E,Subway Innovation,"greedy, math, two pointers",2000,868,0,https://codeforces.com/problemset/problem/371/E
+371D,Vessels,"data structures, dsu, implementation, trees",1800,3270,0,https://codeforces.com/problemset/problem/371/D
+371C,Hamburgers,"binary search, brute force",1600,8749,0,https://codeforces.com/problemset/problem/371/C
+371B,Fox Dividing Cheese,"math, number theory",1300,6079,0,https://codeforces.com/problemset/problem/371/B
+371A,K-Periodic Array,"greedy, implementation, math",1000,4103,0,https://codeforces.com/problemset/problem/371/A
+370E,Summer Reading,"dp, greedy",2500,164,0,https://codeforces.com/problemset/problem/370/E
+370D,Broken Monitor,"brute force, constructive algorithms, greedy, implementation",2100,486,0,https://codeforces.com/problemset/problem/370/D
+370C,Mittens,"constructive algorithms, greedy, sortings",1800,1255,0,https://codeforces.com/problemset/problem/370/C
+370B,Berland Bingo,implementation,1300,2173,0,https://codeforces.com/problemset/problem/370/B
+370A,"Rook, Bishop and King","graphs, math, shortest paths",1100,5110,0,https://codeforces.com/problemset/problem/370/A
+369E,Valera and Queries,"binary search, data structures",2200,1220,0,https://codeforces.com/problemset/problem/369/E
+369D,Valera and Fools,"dfs and similar, dp, graphs, shortest paths",2200,828,0,https://codeforces.com/problemset/problem/369/D
+369C,Valera and Elections,"dfs and similar, graphs, trees",1600,5939,0,https://codeforces.com/problemset/problem/369/C
+369B,Valera and Contest,"constructive algorithms, implementation, math",1400,4350,0,https://codeforces.com/problemset/problem/369/B
+369A,Valera and Plates,"greedy, implementation",900,7681,0,https://codeforces.com/problemset/problem/369/A
+368B,Sereja and Suffixes,"data structures, dp",1100,19463,0,https://codeforces.com/problemset/problem/368/B
+368A,Sereja and Coat Rack,implementation,1000,5599,0,https://codeforces.com/problemset/problem/368/A
+367E,Sereja and Intervals,"combinatorics, dp",2700,605,0,https://codeforces.com/problemset/problem/367/E
+367D,Sereja and Sets,"bitmasks, dfs and similar",2400,480,0,https://codeforces.com/problemset/problem/367/D
+367C,Sereja and the Arrangement of Numbers,"graphs, greedy, sortings",2000,1416,0,https://codeforces.com/problemset/problem/367/C
+367B,Sereja ans Anagrams,"binary search, data structures",1900,1978,0,https://codeforces.com/problemset/problem/367/B
+367A,Sereja and Algorithm,"data structures, implementation",1500,3668,0,https://codeforces.com/problemset/problem/367/A
+366E,Dima and Magic Guitar,"brute force, implementation, math",2200,570,0,https://codeforces.com/problemset/problem/366/E
+366D,Dima and Trap Graph,"binary search, data structures, dfs and similar, dsu, shortest paths, two pointers",2000,919,0,https://codeforces.com/problemset/problem/366/D
+366C,Dima and Salad,dp,1900,2748,0,https://codeforces.com/problemset/problem/366/C
+366B,Dima and To-do List,"brute force, implementation",1200,4575,0,https://codeforces.com/problemset/problem/366/B
+366A,Dima and Guards,implementation,1100,3660,0,https://codeforces.com/problemset/problem/366/A
+365B,The Fibonacci Segment,implementation,1100,8022,0,https://codeforces.com/problemset/problem/365/B
+365A,Good Number,implementation,1100,7293,0,https://codeforces.com/problemset/problem/365/A
+364E,Empty Rectangles,"divide and conquer, two pointers",3000,194,0,https://codeforces.com/problemset/problem/364/E
+364D,Ghd,"brute force, math, probabilities",2900,868,0,https://codeforces.com/problemset/problem/364/D
+364C,Beautiful Set,"brute force, number theory",2300,478,0,https://codeforces.com/problemset/problem/364/C
+364B,Free Market,"dp, greedy",2200,896,0,https://codeforces.com/problemset/problem/364/B
+364A,Matrix,"combinatorics, data structures, implementation",1600,3613,0,https://codeforces.com/problemset/problem/364/A
+363E,Two Circles,"brute force, data structures, implementation",2500,151,0,https://codeforces.com/problemset/problem/363/E
+363D,Renting Bikes,"binary search, greedy",1800,2329,0,https://codeforces.com/problemset/problem/363/D
+363C,Fixing Typos,"greedy, implementation",1400,8149,0,https://codeforces.com/problemset/problem/363/C
+363B,Fence,"brute force, dp",1100,19291,0,https://codeforces.com/problemset/problem/363/B
+363A,Soroban,implementation,800,6394,0,https://codeforces.com/problemset/problem/363/A
+362E,Petya and Pipes,"flows, graphs, shortest paths",2300,493,0,https://codeforces.com/problemset/problem/362/E
+362D,Fools and Foolproof Roads,"data structures, dfs and similar, dsu, graphs, greedy",2100,681,0,https://codeforces.com/problemset/problem/362/D
+362C,Insertion Sort,"data structures, dp, implementation, math",1900,1055,0,https://codeforces.com/problemset/problem/362/C
+362B,Petya and Staircases,"implementation, sortings",1100,7760,0,https://codeforces.com/problemset/problem/362/B
+362A,Two Semiknights Meet,"greedy, math",1500,2362,0,https://codeforces.com/problemset/problem/362/A
+361B,Levko and Permutation,"constructive algorithms, math, number theory",1200,4808,0,https://codeforces.com/problemset/problem/361/B
+361A,Levko and Table,"constructive algorithms, implementation",800,9277,0,https://codeforces.com/problemset/problem/361/A
+360E,Levko and Game,"graphs, greedy, shortest paths",2800,289,0,https://codeforces.com/problemset/problem/360/E
+360D,Levko and Sets,number theory,2600,275,0,https://codeforces.com/problemset/problem/360/D
+360C,Levko and Strings,"combinatorics, dp",2500,690,0,https://codeforces.com/problemset/problem/360/C
+360B,Levko and Array,"binary search, dp",2000,1858,0,https://codeforces.com/problemset/problem/360/B
+360A,Levko and Array Recovery,"greedy, implementation",1700,1801,0,https://codeforces.com/problemset/problem/360/A
+359E,Neatness,"constructive algorithms, dfs and similar",2400,339,0,https://codeforces.com/problemset/problem/359/E
+359D,Pair of Numbers,"binary search, brute force, data structures, math, two pointers",2000,3025,0,https://codeforces.com/problemset/problem/359/D
+359C,Prime Number,"math, number theory",1900,2084,0,https://codeforces.com/problemset/problem/359/C
+359B,Permutation,"constructive algorithms, dp, math",1400,4485,0,https://codeforces.com/problemset/problem/359/B
+359A,Table,"constructive algorithms, greedy, implementation",1000,5570,0,https://codeforces.com/problemset/problem/359/A
+358E,Dima and Kicks,"brute force, dsu, graphs, implementation",2300,320,0,https://codeforces.com/problemset/problem/358/E
+358D,Dima and Hares,"dp, greedy",1800,2591,0,https://codeforces.com/problemset/problem/358/D
+358C,Dima and Containers,"constructive algorithms, greedy, implementation",2000,1444,0,https://codeforces.com/problemset/problem/358/C
+358B,Dima and Text Messages,"brute force, strings",1500,3157,0,https://codeforces.com/problemset/problem/358/B
+358A,Dima and Continuous Line,"brute force, implementation",1400,5394,0,https://codeforces.com/problemset/problem/358/A
+357B,Flag Day,"constructive algorithms, implementation",1400,5019,0,https://codeforces.com/problemset/problem/357/B
+357A,Group of Students,"brute force, greedy, implementation",1000,4956,0,https://codeforces.com/problemset/problem/357/A
+356E,Xenia and String Problem,"dp, hashing, implementation, string suffix structures, strings",3000,203,0,https://codeforces.com/problemset/problem/356/E
+356D,Bags and Coins,"bitmasks, constructive algorithms, dp, greedy",2700,546,0,https://codeforces.com/problemset/problem/356/D
+356C,Compartments,"combinatorics, constructive algorithms, greedy, implementation",2100,1046,0,https://codeforces.com/problemset/problem/356/C
+356B,Xenia and Hamming,"implementation, math",1900,1584,0,https://codeforces.com/problemset/problem/356/B
+356A,Knight Tournament,"data structures, dsu",1500,7054,0,https://codeforces.com/problemset/problem/356/A
+355B,Vasya and Public Transport,"greedy, implementation",1100,3549,0,https://codeforces.com/problemset/problem/355/B
+355A,Vasya and Digital Root,"constructive algorithms, implementation",1100,6192,0,https://codeforces.com/problemset/problem/355/A
+354E,Lucky Number Representation,"constructive algorithms, dfs and similar, dp",2200,720,0,https://codeforces.com/problemset/problem/354/E
+354D,Transferring Pyramid,dp,2900,207,0,https://codeforces.com/problemset/problem/354/D
+354C,Vasya and Beautiful Arrays,"brute force, dp, number theory",2100,2070,0,https://codeforces.com/problemset/problem/354/C
+354B,Game with Strings,"bitmasks, dp, games",2400,354,0,https://codeforces.com/problemset/problem/354/B
+354A,Vasya and Robot,"brute force, greedy, math",1500,4091,0,https://codeforces.com/problemset/problem/354/A
+353E,Antichain,"dp, graph matchings, greedy",2200,454,0,https://codeforces.com/problemset/problem/353/E
+353D,Queue,"constructive algorithms, dp",2000,1798,0,https://codeforces.com/problemset/problem/353/D
+353C,Find Maximum,"implementation, math, number theory",1600,3345,0,https://codeforces.com/problemset/problem/353/C
+353B,Two Heaps,"combinatorics, constructive algorithms, greedy, implementation, math, sortings",1900,1877,0,https://codeforces.com/problemset/problem/353/B
+353A,Domino,"implementation, math",1200,9918,0,https://codeforces.com/problemset/problem/353/A
+352B,Jeff and Periods,"implementation, sortings",1300,7590,0,https://codeforces.com/problemset/problem/352/B
+352A,Jeff and Digits,"brute force, implementation, math",1000,12111,0,https://codeforces.com/problemset/problem/352/A
+351E,Jeff and Permutation,greedy,2200,1040,0,https://codeforces.com/problemset/problem/351/E
+351D,Jeff and Removing Periods,data structures,2700,581,0,https://codeforces.com/problemset/problem/351/D
+351C,Jeff and Brackets,"dp, matrices",2500,407,0,https://codeforces.com/problemset/problem/351/C
+351B,Jeff and Furik,"combinatorics, dp, probabilities",1900,1700,0,https://codeforces.com/problemset/problem/351/B
+351A,Jeff and Rounding,"dp, greedy, implementation, math",1800,2239,0,https://codeforces.com/problemset/problem/351/A
+350E,Wrong Floyd,"brute force, constructive algorithms, dfs and similar, graphs",2200,612,0,https://codeforces.com/problemset/problem/350/E
+350D,Looking for Owls,"binary search, data structures, geometry, hashing, sortings",2400,182,0,https://codeforces.com/problemset/problem/350/D
+350C,Bombs,"greedy, implementation, sortings",1600,4724,0,https://codeforces.com/problemset/problem/350/C
+350B,Resort,graphs,1500,2499,0,https://codeforces.com/problemset/problem/350/B
+350A,TL,"brute force, greedy, implementation",1200,8980,0,https://codeforces.com/problemset/problem/350/A
+349B,Color the Fence,"data structures, dp, greedy, implementation",1700,8383,0,https://codeforces.com/problemset/problem/349/B
+349A,Cinema Line,"greedy, implementation",1100,15871,0,https://codeforces.com/problemset/problem/349/A
+348E,Pilgrims,"dfs and similar, dp, trees",2800,269,0,https://codeforces.com/problemset/problem/348/E
+348D,Turtles,"dp, matrices",2500,619,0,https://codeforces.com/problemset/problem/348/D
+348C,Subset Sums,"brute force, data structures",2500,1112,0,https://codeforces.com/problemset/problem/348/C
+348B,Apple Tree,"dfs and similar, number theory, trees",2100,1524,0,https://codeforces.com/problemset/problem/348/B
+348A,Mafia,"binary search, math, sortings",1600,7961,0,https://codeforces.com/problemset/problem/348/A
+347B,Fixed Points,"brute force, implementation, math",1100,6453,0,https://codeforces.com/problemset/problem/347/B
+347A,Difference Row,"constructive algorithms, implementation, sortings",1300,5703,0,https://codeforces.com/problemset/problem/347/A
+346E,Doodle Jump,"math, number theory",3000,142,0,https://codeforces.com/problemset/problem/346/E
+346D,Robot Control,"dp, graphs, shortest paths",2600,450,0,https://codeforces.com/problemset/problem/346/D
+346C,Number Transformation II,"greedy, math",2200,1169,0,https://codeforces.com/problemset/problem/346/C
+346B,Lucky Common Subsequence,"dp, strings",2000,2182,0,https://codeforces.com/problemset/problem/346/B
+346A,Alice and Bob,"games, math, number theory",1600,5816,0,https://codeforces.com/problemset/problem/346/A
+345G,Suffix Subgroup,"*special problem, strings",2200,38,0,https://codeforces.com/problemset/problem/345/G
+345F,Superstitions Inspection,*special problem,2700,34,0,https://codeforces.com/problemset/problem/345/F
+345E,Black Cat Rush,*special problem,2700,33,0,https://codeforces.com/problemset/problem/345/E
+345D,Chain Letter,"*special problem, dfs and similar, graphs",2200,67,0,https://codeforces.com/problemset/problem/345/D
+345C,Counting Fridays,*special problem,2000,110,0,https://codeforces.com/problemset/problem/345/C
+345B,Triskaidekaphobia,*special problem,2100,112,0,https://codeforces.com/problemset/problem/345/B
+345A,Expecting Trouble,"*special problem, probabilities",1500,368,0,https://codeforces.com/problemset/problem/345/A
+344B,Simple Molecules,"brute force, graphs, math",1200,5942,0,https://codeforces.com/problemset/problem/344/B
+344A,Magnets,implementation,800,40128,0,https://codeforces.com/problemset/problem/344/A
+343E,Pumping Stations,"brute force, dfs and similar, divide and conquer, flows, graphs, greedy, trees",2900,298,0,https://codeforces.com/problemset/problem/343/E
+343D,Water Tree,"data structures, dfs and similar, graphs, trees",2100,2668,0,https://codeforces.com/problemset/problem/343/D
+343C,Read Time,"binary search, greedy, two pointers",1900,2079,0,https://codeforces.com/problemset/problem/343/C
+343B,Alternating Current,"data structures, greedy, implementation",1600,6335,0,https://codeforces.com/problemset/problem/343/B
+343A,Rational Resistance,"math, number theory",1600,5942,0,https://codeforces.com/problemset/problem/343/A
+342E,Xenia and Tree,"data structures, divide and conquer, trees",2400,3734,0,https://codeforces.com/problemset/problem/342/E
+342D,Xenia and Dominoes,"bitmasks, dfs and similar, dp",2100,379,0,https://codeforces.com/problemset/problem/342/D
+342C,Cupboard and Balloons,geometry,1900,1536,0,https://codeforces.com/problemset/problem/342/C
+342B,Xenia and Spies,"brute force, greedy, implementation",1500,2972,0,https://codeforces.com/problemset/problem/342/B
+342A,Xenia and Divisors,"greedy, implementation",1200,6700,0,https://codeforces.com/problemset/problem/342/A
+341E,Candies Game,"constructive algorithms, greedy",3000,233,0,https://codeforces.com/problemset/problem/341/E
+341D,Iahub and Xors,data structures,2500,667,0,https://codeforces.com/problemset/problem/341/D
+340E,Iahub and Permutations,"combinatorics, math",2000,1659,0,https://codeforces.com/problemset/problem/340/E
+340D,Bubble Sort Graph,"binary search, data structures, dp",1500,4753,0,https://codeforces.com/problemset/problem/340/D
+340C,Tourist Problem,"combinatorics, implementation, math",1600,3037,0,https://codeforces.com/problemset/problem/340/C
+340B,Maximal Area Quadrilateral,"brute force, geometry",2100,1558,0,https://codeforces.com/problemset/problem/340/B
+340A,The Wall,math,1200,5764,0,https://codeforces.com/problemset/problem/340/A
+339E,Three Swaps,"constructive algorithms, dfs and similar, greedy",2700,426,0,https://codeforces.com/problemset/problem/339/E
+339D,Xenia and Bit Operations,"data structures, trees",1700,11994,0,https://codeforces.com/problemset/problem/339/D
+339C,Xenia and Weights,"constructive algorithms, dfs and similar, dp, graphs, greedy, shortest paths",1700,5816,0,https://codeforces.com/problemset/problem/339/C
+339B,Xenia and Ringroad,implementation,1000,29915,0,https://codeforces.com/problemset/problem/339/B
+339A,Helpful Maths,"greedy, implementation, sortings, strings",800,67796,0,https://codeforces.com/problemset/problem/339/A
+338E,Optimize!,data structures,2600,544,0,https://codeforces.com/problemset/problem/338/E
+338D,GCD Table,"chinese remainder theorem, math, number theory",2900,532,0,https://codeforces.com/problemset/problem/338/D
+337E,Divisor Tree,"brute force, number theory, trees",2200,804,0,https://codeforces.com/problemset/problem/337/E
+337D,Book of Evil,"dfs and similar, divide and conquer, dp, trees",2000,3343,0,https://codeforces.com/problemset/problem/337/D
+337C,Quiz,"binary search, greedy, math, matrices, number theory",1600,3717,0,https://codeforces.com/problemset/problem/337/C
+337B,Routine Problem,"greedy, math, number theory",1400,5379,0,https://codeforces.com/problemset/problem/337/B
+337A,Puzzles,greedy,900,37601,0,https://codeforces.com/problemset/problem/337/A
+336E,Vasily the Bear and Painting Square,"bitmasks, combinatorics, dp, implementation",2700,81,0,https://codeforces.com/problemset/problem/336/E
+336D,Vasily the Bear and Beautiful Strings,"combinatorics, math, number theory",2100,690,0,https://codeforces.com/problemset/problem/336/D
+336C,Vasily the Bear and Sequence,"brute force, greedy, implementation, number theory",1800,1889,0,https://codeforces.com/problemset/problem/336/C
+336B,Vasily the Bear and Fly,math,1900,1060,0,https://codeforces.com/problemset/problem/336/B
+336A,Vasily the Bear and Triangle,"implementation, math",1000,6487,0,https://codeforces.com/problemset/problem/336/A
+335F,"Buy One, Get One Free","dp, greedy",3000,156,0,https://codeforces.com/problemset/problem/335/F
+335E,Counting Skyscrapers,"dp, math, probabilities",2800,130,0,https://codeforces.com/problemset/problem/335/E
+335D,Rectangles and Square,"brute force, dp",2400,218,0,https://codeforces.com/problemset/problem/335/D
+335C,More Reclamation,games,2100,393,0,https://codeforces.com/problemset/problem/335/C
+335B,Palindrome,"constructive algorithms, dp",1900,1198,0,https://codeforces.com/problemset/problem/335/B
+335A,Banana,"binary search, constructive algorithms, greedy",1400,1418,0,https://codeforces.com/problemset/problem/335/A
+334B,Eight Point Sets,sortings,1400,2905,0,https://codeforces.com/problemset/problem/334/B
+334A,Candy Bags,implementation,1000,11479,0,https://codeforces.com/problemset/problem/334/A
+333E,Summer Earnings,"binary search, bitmasks, brute force, geometry, sortings",2500,535,0,https://codeforces.com/problemset/problem/333/E
+333D,Characteristics of Rectangles,"binary search, bitmasks, brute force, implementation, sortings",2100,1383,0,https://codeforces.com/problemset/problem/333/D
+333C,Lucky Tickets,"brute force, constructive algorithms",2700,286,0,https://codeforces.com/problemset/problem/333/C
+333B,Chips,greedy,1800,2222,0,https://codeforces.com/problemset/problem/333/B
+333A,Secrets,greedy,1600,3353,0,https://codeforces.com/problemset/problem/333/A
+332E,Binary Key,"dp, greedy, implementation",2400,228,0,https://codeforces.com/problemset/problem/332/E
+332D,Theft of Blueprints,"graphs, math",2400,297,0,https://codeforces.com/problemset/problem/332/D
+332C,Students' Revenge,"data structures, greedy, sortings",2200,716,0,https://codeforces.com/problemset/problem/332/C
+332B,Maximum Absurdity,"data structures, dp, implementation",1500,5314,0,https://codeforces.com/problemset/problem/332/B
+332A,Down the Hatch!,implementation,1300,3077,0,https://codeforces.com/problemset/problem/332/A
+331E2,Deja Vu,"constructive algorithms, dp",3100,82,0,https://codeforces.com/problemset/problem/331/E2
+331E1,Deja Vu,"constructive algorithms, graphs, implementation",2900,69,0,https://codeforces.com/problemset/problem/331/E1
+331D3,Escaping on Beaveractor,"data structures, implementation, trees",3000,114,0,https://codeforces.com/problemset/problem/331/D3
+331D2,Escaping on Beaveractor,graphs,2600,93,0,https://codeforces.com/problemset/problem/331/D2
+331D1,Escaping on Beaveractor,"dfs and similar, implementation",2400,146,0,https://codeforces.com/problemset/problem/331/D1
+331C3,The Great Julya Calendar,dp,2500,312,0,https://codeforces.com/problemset/problem/331/C3
+331C2,The Great Julya Calendar,dp,2400,253,0,https://codeforces.com/problemset/problem/331/C2
+331C1,The Great Julya Calendar,dp,1100,3064,0,https://codeforces.com/problemset/problem/331/C1
+331B2,Shave Beaver!,data structures,1900,541,0,https://codeforces.com/problemset/problem/331/B2
+331B1,Shave Beaver!,implementation,1700,644,0,https://codeforces.com/problemset/problem/331/B1
+331A2,Oh Sweet Beaverette,"data structures, sortings",1500,1099,0,https://codeforces.com/problemset/problem/331/A2
+331A1,Oh Sweet Beaverette,"brute force, implementation",1400,1094,0,https://codeforces.com/problemset/problem/331/A1
+330B,Road Construction,"constructive algorithms, graphs",1300,9628,0,https://codeforces.com/problemset/problem/330/B
+330A,Cakeminator,"brute force, implementation",800,14971,0,https://codeforces.com/problemset/problem/330/A
+329E,Evil,math,3100,106,0,https://codeforces.com/problemset/problem/329/E
+329D,The Evil Temple and the Moving Rocks,constructive algorithms,2500,295,0,https://codeforces.com/problemset/problem/329/D
+329C,Graph Reconstruction,constructive algorithms,2400,686,0,https://codeforces.com/problemset/problem/329/C
+329B,Biridian Forest,"dfs and similar, shortest paths",1500,3946,0,https://codeforces.com/problemset/problem/329/B
+329A,Purification,"constructive algorithms, greedy",1500,3731,0,https://codeforces.com/problemset/problem/329/A
+328B,Sheldon and Ice Pieces,greedy,1500,738,0,https://codeforces.com/problemset/problem/328/B
+328A,IQ Test,implementation,1800,1004,0,https://codeforces.com/problemset/problem/328/A
+327E,Axis Walking,"bitmasks, combinatorics, constructive algorithms, dp, meet-in-the-middle",2300,834,0,https://codeforces.com/problemset/problem/327/E
+327D,Block Tower,"constructive algorithms, dfs and similar, graphs",1900,1725,0,https://codeforces.com/problemset/problem/327/D
+327C,Magic Five,"combinatorics, math",1700,2379,0,https://codeforces.com/problemset/problem/327/C
+327B,Hungry Sequence,math,1200,10094,0,https://codeforces.com/problemset/problem/327/B
+327A,Flipping Game,"brute force, dp, implementation",1200,21140,0,https://codeforces.com/problemset/problem/327/A
+325E,The Red Button,"combinatorics, dfs and similar, dsu, graphs, greedy",2800,326,0,https://codeforces.com/problemset/problem/325/E
+325D,Reclamation,dsu,2900,273,0,https://codeforces.com/problemset/problem/325/D
+325C,Monsters and Diamonds,"dfs and similar, graphs, shortest paths",2600,230,0,https://codeforces.com/problemset/problem/325/C
+325B,Stadium and Games,"binary search, math",1800,1009,0,https://codeforces.com/problemset/problem/325/B
+325A,Square and Rectangles,implementation,1500,1538,0,https://codeforces.com/problemset/problem/325/A
+323C,Two permutations,data structures,2400,304,0,https://codeforces.com/problemset/problem/323/C
+323B,Tournament-graph,"constructive algorithms, graphs",2200,260,0,https://codeforces.com/problemset/problem/323/B
+323A,Black-and-White Cube,"combinatorics, constructive algorithms",1600,466,0,https://codeforces.com/problemset/problem/323/A
+322B,Ciel and Flowers,"combinatorics, math",1600,7121,0,https://codeforces.com/problemset/problem/322/B
+322A,Ciel and Dancing,greedy,1000,6006,0,https://codeforces.com/problemset/problem/322/A
+321E,Ciel and Gondolas,"data structures, divide and conquer, dp",2600,2020,0,https://codeforces.com/problemset/problem/321/E
+321D,Ciel and Flipboard,"dp, greedy, math",2900,263,0,https://codeforces.com/problemset/problem/321/D
+321C,Ciel the Commander,"constructive algorithms, dfs and similar, divide and conquer, greedy, trees",2100,3354,0,https://codeforces.com/problemset/problem/321/C
+321B,Ciel and Duel,"dp, flows, greedy",1900,1952,0,https://codeforces.com/problemset/problem/321/B
+321A,Ciel and Robot,"binary search, implementation, math",1700,2956,0,https://codeforces.com/problemset/problem/321/A
+320B,Ping-Pong (Easy Version),"dfs and similar, graphs",1500,4661,0,https://codeforces.com/problemset/problem/320/B
+320A,Magic Numbers,"brute force, greedy",900,15015,0,https://codeforces.com/problemset/problem/320/A
+319E,Ping-Pong,data structures,3000,262,0,https://codeforces.com/problemset/problem/319/E
+319D,Have You Ever Heard About the Word?,"greedy, hashing, string suffix structures, strings",2800,325,0,https://codeforces.com/problemset/problem/319/D
+319C,Kalila and Dimna in the Logging Industry,"dp, geometry",2100,2613,0,https://codeforces.com/problemset/problem/319/C
+319B,Psychos in a Line,"data structures, implementation",1900,2840,0,https://codeforces.com/problemset/problem/319/B
+319A,Malek Dance Club,"combinatorics, math",1600,2230,0,https://codeforces.com/problemset/problem/319/A
+318B,Strings of Power,"implementation, strings, two pointers",1300,5356,0,https://codeforces.com/problemset/problem/318/B
+318A,Even Odds,math,900,39586,0,https://codeforces.com/problemset/problem/318/A
+317E,Princess and Her Shadow,"constructive algorithms, shortest paths",3100,99,0,https://codeforces.com/problemset/problem/317/E
+317D,Game with Powers,"dp, games",2300,734,0,https://codeforces.com/problemset/problem/317/D
+317C,Balance,"constructive algorithms, dfs and similar, graphs, trees",2500,348,0,https://codeforces.com/problemset/problem/317/C
+317B,Ants,"brute force, implementation",2000,1392,0,https://codeforces.com/problemset/problem/317/B
+317A,Perfect Pair,brute force,1600,3702,0,https://codeforces.com/problemset/problem/317/A
+316G3,Good Substrings,string suffix structures,2400,310,0,https://codeforces.com/problemset/problem/316/G3
+316G2,Good Substrings,string suffix structures,2200,353,0,https://codeforces.com/problemset/problem/316/G2
+316G1,Good Substrings,"hashing, strings",1700,772,0,https://codeforces.com/problemset/problem/316/G1
+316F3,Suns and Rays,"constructive algorithms, dfs and similar, implementation",2200,139,0,https://codeforces.com/problemset/problem/316/F3
+316F2,Suns and Rays,,2300,131,0,https://codeforces.com/problemset/problem/316/F2
+316F1,Suns and Rays,"dfs and similar, implementation",2200,143,0,https://codeforces.com/problemset/problem/316/F1
+316E3,Summer Homework,"data structures, math",2300,411,0,https://codeforces.com/problemset/problem/316/E3
+316E2,Summer Homework,"data structures, math",2300,319,0,https://codeforces.com/problemset/problem/316/E2
+316E1,Summer Homework,"brute force, data structures",1500,1252,0,https://codeforces.com/problemset/problem/316/E1
+316D3,PE Lesson,"dp, math",2400,307,0,https://codeforces.com/problemset/problem/316/D3
+316D2,PE Lesson,dp,2300,270,0,https://codeforces.com/problemset/problem/316/D2
+316D1,PE Lesson,"brute force, dp",2300,295,0,https://codeforces.com/problemset/problem/316/D1
+316C2,Tidying Up,"flows, graph matchings",2300,448,0,https://codeforces.com/problemset/problem/316/C2
+316C1,Tidying Up,flows,2200,440,0,https://codeforces.com/problemset/problem/316/C1
+316B2,EKG,"dfs and similar, dp",1600,1334,0,https://codeforces.com/problemset/problem/316/B2
+316B1,EKG,"brute force, dfs and similar",1500,1226,0,https://codeforces.com/problemset/problem/316/B1
+316A2,Special Task,math,1400,1816,0,https://codeforces.com/problemset/problem/316/A2
+316A1,Special Task,greedy,1100,2120,0,https://codeforces.com/problemset/problem/316/A1
+315B,Sereja and Array,implementation,1200,4724,0,https://codeforces.com/problemset/problem/315/B
+315A,Sereja and Bottles,brute force,1400,5613,0,https://codeforces.com/problemset/problem/315/A
+314E,Sereja and Squares,dp,2900,221,0,https://codeforces.com/problemset/problem/314/E
+314D,Sereja and Straight Lines,"binary search, data structures, geometry, sortings, two pointers",2500,410,0,https://codeforces.com/problemset/problem/314/D
+314C,Sereja and Subsequences,"data structures, dp",2000,1418,0,https://codeforces.com/problemset/problem/314/C
+314B,Sereja and Periods,"binary search, dfs and similar, strings",2000,1204,0,https://codeforces.com/problemset/problem/314/B
+314A,Sereja and Contest,implementation,1600,1743,0,https://codeforces.com/problemset/problem/314/A
+313E,Ilya and Two Numbers,"constructive algorithms, data structures, dsu, greedy",2300,406,0,https://codeforces.com/problemset/problem/313/E
+313D,Ilya and Roads,dp,2100,1031,0,https://codeforces.com/problemset/problem/313/D
+313C,Ilya and Matrix,"constructive algorithms, greedy, implementation, sortings",1400,4027,0,https://codeforces.com/problemset/problem/313/C
+313B,Ilya and Queries,"dp, implementation",1100,20326,0,https://codeforces.com/problemset/problem/313/B
+313A,Ilya and Bank Account,"implementation, number theory",900,24348,0,https://codeforces.com/problemset/problem/313/A
+312B,Archer,"math, probabilities",1300,6214,0,https://codeforces.com/problemset/problem/312/B
+312A,Whose sentence is it?,"implementation, strings",1100,3747,0,https://codeforces.com/problemset/problem/312/A
+311E,Biologist,flows,2300,413,0,https://codeforces.com/problemset/problem/311/E
+311D,Interval Cubing,"data structures, math",2600,471,0,https://codeforces.com/problemset/problem/311/D
+311C,Fetch the Treasure,"brute force, data structures, graphs, shortest paths",2500,319,0,https://codeforces.com/problemset/problem/311/C
+311B,Cats Transport,"data structures, dp",2400,1333,0,https://codeforces.com/problemset/problem/311/B
+311A,The Closest Pair,"constructive algorithms, implementation",1300,3280,0,https://codeforces.com/problemset/problem/311/A
+309E,Sheep,"binary search, greedy",2900,96,0,https://codeforces.com/problemset/problem/309/E
+309D,Tennis Rackets,"brute force, geometry",2700,144,0,https://codeforces.com/problemset/problem/309/D
+309C,Memory for Arrays,"binary search, bitmasks, greedy",1900,711,0,https://codeforces.com/problemset/problem/309/C
+309B,Context Advertising,"dp, two pointers",2100,352,0,https://codeforces.com/problemset/problem/309/B
+309A,Morning run,"binary search, math, two pointers",2000,400,0,https://codeforces.com/problemset/problem/309/A
+306D,Polygon,"constructive algorithms, geometry",2300,170,0,https://codeforces.com/problemset/problem/306/D
+306C,"White, Black and White Again","combinatorics, number theory",2100,296,0,https://codeforces.com/problemset/problem/306/C
+306B,Optimizer,"data structures, greedy, sortings",2100,306,0,https://codeforces.com/problemset/problem/306/B
+306A,Candies,implementation,800,2340,0,https://codeforces.com/problemset/problem/306/A
+305E,Playing with String,games,2300,449,0,https://codeforces.com/problemset/problem/305/E
+305D,Olya and Graph,"combinatorics, math",2200,389,0,https://codeforces.com/problemset/problem/305/D
+305C,Ivan and Powers of Two,"greedy, implementation",1600,1906,0,https://codeforces.com/problemset/problem/305/C
+305B,Continued Fractions,"brute force, implementation, math",1700,1720,0,https://codeforces.com/problemset/problem/305/B
+305A,Strange Addition,"brute force, constructive algorithms, implementation",1600,3077,0,https://codeforces.com/problemset/problem/305/A
+304B,Calendar,"brute force, implementation",1300,2261,0,https://codeforces.com/problemset/problem/304/B
+304A,Pythagorean Theorem II,"brute force, math",1200,5661,0,https://codeforces.com/problemset/problem/304/A
+303E,Random Ranking,"dp, math, probabilities",3000,155,0,https://codeforces.com/problemset/problem/303/E
+303D,Rotatable Number,"math, number theory",2600,189,0,https://codeforces.com/problemset/problem/303/D
+303C,Minimum Modular,"brute force, graphs, math, number theory",2400,654,0,https://codeforces.com/problemset/problem/303/C
+303B,Rectangle Puzzle II,"implementation, math",1700,1168,0,https://codeforces.com/problemset/problem/303/B
+303A,Lucky Permutation Triple,"constructive algorithms, implementation, math",1300,4541,0,https://codeforces.com/problemset/problem/303/A
+302B,Eugeny and Play List,"binary search, implementation, two pointers",1200,4706,0,https://codeforces.com/problemset/problem/302/B
+302A,Eugeny and Array,implementation,800,5568,0,https://codeforces.com/problemset/problem/302/A
+301E,Yaroslav and Arrangements,dp,2800,227,0,https://codeforces.com/problemset/problem/301/E
+301D,Yaroslav and Divisors,data structures,2200,1352,0,https://codeforces.com/problemset/problem/301/D
+301C,Yaroslav and Algorithm,constructive algorithms,2500,347,0,https://codeforces.com/problemset/problem/301/C
+301B,Yaroslav and Time,"binary search, graphs, shortest paths",2100,1704,0,https://codeforces.com/problemset/problem/301/B
+301A,Yaroslav and Sequence,constructive algorithms,1800,2370,0,https://codeforces.com/problemset/problem/301/A
+300E,Empire Strikes Back,"binary search, math, number theory",2300,736,0,https://codeforces.com/problemset/problem/300/E
+300D,Painting Square,"dp, fft",2300,552,0,https://codeforces.com/problemset/problem/300/D
+300C,Beautiful Numbers,"brute force, combinatorics",1800,4451,0,https://codeforces.com/problemset/problem/300/C
+300B,Coach,"brute force, dfs and similar, graphs",1500,3979,0,https://codeforces.com/problemset/problem/300/B
+300A,Array,"brute force, constructive algorithms, implementation",1100,11078,0,https://codeforces.com/problemset/problem/300/A
+299B,Ksusha the Squirrel,"brute force, implementation",900,2678,0,https://codeforces.com/problemset/problem/299/B
+299A,Ksusha and Array,"brute force, number theory, sortings",1000,4219,0,https://codeforces.com/problemset/problem/299/A
+298B,Sail,"brute force, greedy, implementation",1200,6506,0,https://codeforces.com/problemset/problem/298/B
+298A,Snow Footprints,"greedy, implementation",1300,5551,0,https://codeforces.com/problemset/problem/298/A
+297E,Mystic Carvings,data structures,3000,181,0,https://codeforces.com/problemset/problem/297/E
+297D,Color the Carpet,constructive algorithms,2500,343,0,https://codeforces.com/problemset/problem/297/D
+297C,Splitting the Uniqueness,constructive algorithms,2400,729,0,https://codeforces.com/problemset/problem/297/C
+297B,Fish Weight,"constructive algorithms, greedy",1600,2719,0,https://codeforces.com/problemset/problem/297/B
+297A,Parity Game,constructive algorithms,1700,2929,0,https://codeforces.com/problemset/problem/297/A
+296B,Yaroslav and Two Strings,"combinatorics, dp",2000,944,0,https://codeforces.com/problemset/problem/296/B
+296A,Yaroslav and Permutations,"greedy, math",1100,9608,0,https://codeforces.com/problemset/problem/296/A
+295E,Yaroslav and Points,data structures,2500,434,0,https://codeforces.com/problemset/problem/295/E
+295D,Greg and Caves,"combinatorics, dp",2400,422,0,https://codeforces.com/problemset/problem/295/D
+295C,Greg and Friends,"combinatorics, dp, graphs, shortest paths",2100,1295,0,https://codeforces.com/problemset/problem/295/C
+295B,Greg and Graph,"dp, graphs, shortest paths",1700,6254,0,https://codeforces.com/problemset/problem/295/B
+295A,Greg and Array,"data structures, implementation",1400,7792,0,https://codeforces.com/problemset/problem/295/A
+294E,Shaass the Great,"dp, trees",2300,604,0,https://codeforces.com/problemset/problem/294/E
+294D,Shaass and Painter Robot,"brute force, implementation, number theory",2500,231,0,https://codeforces.com/problemset/problem/294/D
+294C,Shaass and Lights,"combinatorics, number theory",1900,2362,0,https://codeforces.com/problemset/problem/294/C
+294B,Shaass and Bookshelf,"dp, greedy",1700,2915,0,https://codeforces.com/problemset/problem/294/B
+294A,Shaass and Oskols,"implementation, math",800,10422,0,https://codeforces.com/problemset/problem/294/A
+293E,Close Vertices,"data structures, divide and conquer, trees",2700,646,0,https://codeforces.com/problemset/problem/293/E
+293D,Ksusha and Square,"geometry, math, probabilities, two pointers",2700,187,0,https://codeforces.com/problemset/problem/293/D
+293C,Cube Problem,"brute force, math, number theory",2400,456,0,https://codeforces.com/problemset/problem/293/C
+293B,Distinct Paths,"brute force, combinatorics",2700,514,0,https://codeforces.com/problemset/problem/293/B
+293A,Weird Game,"games, greedy",1500,1903,0,https://codeforces.com/problemset/problem/293/A
+292E,Copying Data,data structures,1900,2641,0,https://codeforces.com/problemset/problem/292/E
+292D,Connected Components,"data structures, dfs and similar, dp, dsu",1900,1615,0,https://codeforces.com/problemset/problem/292/D
+292C,Beautiful IP Addresses,brute force,2000,825,0,https://codeforces.com/problemset/problem/292/C
+292B,Network Topology,"graphs, implementation",1200,4248,0,https://codeforces.com/problemset/problem/292/B
+292A,SMSC,implementation,1100,2196,0,https://codeforces.com/problemset/problem/292/A
+291E,Tree-String Problem,"*special problem, dfs and similar, hashing, strings",2000,990,0,https://codeforces.com/problemset/problem/291/E
+291D,Parallel Programming,"*special problem, greedy",1600,1389,0,https://codeforces.com/problemset/problem/291/D
+291C,Network Mask,"*special problem, bitmasks, brute force, implementation",1600,1576,0,https://codeforces.com/problemset/problem/291/C
+291B,Command Line Arguments,"*special problem, implementation, strings",1300,2689,0,https://codeforces.com/problemset/problem/291/B
+291A,Spyke Talks,"*special problem, implementation, sortings",800,4549,0,https://codeforces.com/problemset/problem/291/A
+290F,Greedy Petya,"*special problem, dfs and similar, graphs, greedy",2800,76,0,https://codeforces.com/problemset/problem/290/F
+290E,HQ,"*special problem, constructive algorithms",2500,128,0,https://codeforces.com/problemset/problem/290/E
+290D,Orange,"*special problem, implementation",1400,1519,0,https://codeforces.com/problemset/problem/290/D
+290C,WTF?,"*special problem, graph matchings, implementation, trees",1700,1113,0,https://codeforces.com/problemset/problem/290/C
+290B,QR code,"*special problem, implementation",1500,1977,0,https://codeforces.com/problemset/problem/290/B
+290A,Mysterious strings,"*special problem, implementation",1400,2438,0,https://codeforces.com/problemset/problem/290/A
+289B,Polo the Penguin and Matrix,"brute force, dp, implementation, sortings, ternary search",1400,8963,0,https://codeforces.com/problemset/problem/289/B
+289A,Polo the Penguin and Segments,"brute force, implementation",1100,4634,0,https://codeforces.com/problemset/problem/289/A
+288E,Polo the Penguin and Lucky Numbers,"dp, implementation, math",2800,180,0,https://codeforces.com/problemset/problem/288/E
+288D,Polo the Penguin and Trees,"combinatorics, dfs and similar, trees",2400,532,0,https://codeforces.com/problemset/problem/288/D
+288C,Polo the Penguin and XOR operation,"implementation, math",1700,1740,0,https://codeforces.com/problemset/problem/288/C
+288B,Polo the Penguin and Houses,combinatorics,1500,2156,0,https://codeforces.com/problemset/problem/288/B
+288A,Polo the Penguin and Strings,greedy,1300,5185,0,https://codeforces.com/problemset/problem/288/A
+287B,Pipeline,"binary search, math",1700,3906,0,https://codeforces.com/problemset/problem/287/B
+287A,IQ Test,"brute force, implementation",1100,8886,0,https://codeforces.com/problemset/problem/287/A
+286E,Ladies' Shop,"constructive algorithms, fft, math",2800,552,0,https://codeforces.com/problemset/problem/286/E
+286D,Tourists,"data structures, sortings",2600,274,0,https://codeforces.com/problemset/problem/286/D
+286C,Main Sequence,"greedy, implementation",2100,1095,0,https://codeforces.com/problemset/problem/286/C
+286B,Shifting,implementation,2200,951,0,https://codeforces.com/problemset/problem/286/B
+286A,Lucky Permutation,"constructive algorithms, math",1400,2567,0,https://codeforces.com/problemset/problem/286/A
+285E,Positions in Permutations,"combinatorics, dp, math",2600,446,0,https://codeforces.com/problemset/problem/285/E
+285D,Permutation Sum,"bitmasks, combinatorics, dp, implementation, meet-in-the-middle",1900,1256,0,https://codeforces.com/problemset/problem/285/D
+285C,Building Permutation,"greedy, implementation, sortings",1200,12371,0,https://codeforces.com/problemset/problem/285/C
+285B,Find Marble,implementation,1200,8768,0,https://codeforces.com/problemset/problem/285/B
+285A,Slightly Decreasing Permutations,"greedy, implementation",1100,8447,0,https://codeforces.com/problemset/problem/285/A
+284B,Cows and Poker Game,"brute force, implementation",1000,4675,0,https://codeforces.com/problemset/problem/284/B
+284A,Cows and Primitive Roots,"implementation, math, number theory",1400,4430,0,https://codeforces.com/problemset/problem/284/A
+283E,Cow Tennis Tournament,"combinatorics, data structures, math",2800,404,0,https://codeforces.com/problemset/problem/283/E
+283D,Cows and Cool Sequences,"dp, math, number theory",2400,383,0,https://codeforces.com/problemset/problem/283/D
+283C,Coin Troubles,dp,2100,990,0,https://codeforces.com/problemset/problem/283/C
+283B,Cow Program,"dfs and similar, dp, graphs",1700,2856,0,https://codeforces.com/problemset/problem/283/B
+283A,Cows and Sequence,"constructive algorithms, data structures, implementation",1600,4889,0,https://codeforces.com/problemset/problem/283/A
+282E,Sausage Maximization,"bitmasks, data structures, trees",2200,1963,0,https://codeforces.com/problemset/problem/282/E
+282D,Yet Another Number Game,"dp, games",2100,1017,0,https://codeforces.com/problemset/problem/282/D
+282C,XOR and OR,"constructive algorithms, implementation, math",1500,5886,0,https://codeforces.com/problemset/problem/282/C
+282B,Painting Eggs,"greedy, math",1500,7055,0,https://codeforces.com/problemset/problem/282/B
+282A,Bit++,implementation,800,73939,0,https://codeforces.com/problemset/problem/282/A
+281B,Nearest Fraction,"brute force, implementation, two pointers",1700,2226,0,https://codeforces.com/problemset/problem/281/B
+281A,Word Capitalization,"implementation, strings",800,65383,0,https://codeforces.com/problemset/problem/281/A
+280E,Sequence Transformation,"data structures, dp, implementation, math",3000,107,0,https://codeforces.com/problemset/problem/280/E
+280D,k-Maximum Subsequence Sum,"data structures, flows, graphs, implementation",2800,508,0,https://codeforces.com/problemset/problem/280/D
+280C,Game on Tree,"implementation, math, probabilities, trees",2200,1592,0,https://codeforces.com/problemset/problem/280/C
+280B,Maximum Xor Secondary,"data structures, implementation, two pointers",1800,2898,0,https://codeforces.com/problemset/problem/280/B
+280A,Rectangle Puzzle,geometry,2000,1194,0,https://codeforces.com/problemset/problem/280/A
+279E,Beautiful Decomposition,"dp, games, greedy, number theory",1900,1066,0,https://codeforces.com/problemset/problem/279/E
+279D,The Minimum Number of Variables,"bitmasks, dp",2200,511,0,https://codeforces.com/problemset/problem/279/D
+279C,Ladder,"dp, implementation, two pointers",1700,5454,0,https://codeforces.com/problemset/problem/279/C
+279B,Books,"binary search, brute force, implementation, two pointers",1400,17512,0,https://codeforces.com/problemset/problem/279/B
+279A,Point on Spiral,"brute force, geometry, implementation",1400,4002,0,https://codeforces.com/problemset/problem/279/A
+278B,New Problem,"brute force, strings",1500,2824,0,https://codeforces.com/problemset/problem/278/B
+278A,Circle Line,implementation,800,7958,0,https://codeforces.com/problemset/problem/278/A
+277E,Binary Tree on Plane,"flows, trees",2400,676,0,https://codeforces.com/problemset/problem/277/E
+277D,Google Code Jam,"dp, probabilities",2800,213,0,https://codeforces.com/problemset/problem/277/D
+277C,Game,"games, implementation",2400,393,0,https://codeforces.com/problemset/problem/277/C
+277B,Set of Points,"constructive algorithms, geometry",2300,624,0,https://codeforces.com/problemset/problem/277/B
+277A,Learning Languages,"dfs and similar, dsu",1400,10441,0,https://codeforces.com/problemset/problem/277/A
+276E,Little Girl and Problem on Trees,"data structures, graphs, trees",2100,1063,0,https://codeforces.com/problemset/problem/276/E
+276D,Little Girl and Maximum XOR,"bitmasks, dp, greedy, implementation, math",1700,7008,0,https://codeforces.com/problemset/problem/276/D
+276C,Little Girl and Maximum Sum,"data structures, greedy, implementation, sortings",1500,10738,0,https://codeforces.com/problemset/problem/276/C
+276B,Little Girl and Game,"games, greedy",1300,12267,0,https://codeforces.com/problemset/problem/276/B
+276A,Lunch Rush,implementation,900,14167,0,https://codeforces.com/problemset/problem/276/A
+275B,Convex Shape,"constructive algorithms, implementation",1700,2050,0,https://codeforces.com/problemset/problem/275/B
+275A,Lights Out,implementation,900,11393,0,https://codeforces.com/problemset/problem/275/A
+274E,Mirror Room,"data structures, implementation",3000,176,0,https://codeforces.com/problemset/problem/274/E
+274D,Lovely Matrix,"dfs and similar, graphs, greedy, sortings",2200,792,0,https://codeforces.com/problemset/problem/274/D
+274C,The Last Hole!,"brute force, geometry",2600,281,0,https://codeforces.com/problemset/problem/274/C
+274B,Zero Tree,"dfs and similar, dp, greedy, trees",1800,3304,0,https://codeforces.com/problemset/problem/274/B
+274A,k-Multiple Free Set,"binary search, greedy, sortings",1500,6232,0,https://codeforces.com/problemset/problem/274/A
+273E,Dima and Game,"dp, games",2600,192,0,https://codeforces.com/problemset/problem/273/E
+273D,Dima and Figure,dp,2400,290,0,https://codeforces.com/problemset/problem/273/D
+272E,Dima and Horses,"combinatorics, constructive algorithms, graphs",2200,928,0,https://codeforces.com/problemset/problem/272/E
+272D,Dima and Two Sequences,"combinatorics, math, sortings",1600,2051,0,https://codeforces.com/problemset/problem/272/D
+272C,Dima and Staircase,"data structures, implementation",1500,4843,0,https://codeforces.com/problemset/problem/272/C
+272B,Dima and Sequence,"implementation, math",1400,3154,0,https://codeforces.com/problemset/problem/272/B
+272A,Dima and Friends,"implementation, math",1000,10151,0,https://codeforces.com/problemset/problem/272/A
+271E,Three Horses,"constructive algorithms, math, number theory",2200,382,0,https://codeforces.com/problemset/problem/271/E
+271D,Good Substrings,"data structures, strings",1800,5048,0,https://codeforces.com/problemset/problem/271/D
+271C,Secret,"constructive algorithms, implementation",1500,2370,0,https://codeforces.com/problemset/problem/271/C
+271B,Prime Matrix,"binary search, brute force, math, number theory",1300,7058,0,https://codeforces.com/problemset/problem/271/B
+271A,Beautiful Year,brute force,800,43335,0,https://codeforces.com/problemset/problem/271/A
+270B,Multithreading,"data structures, greedy, implementation",1400,3424,0,https://codeforces.com/problemset/problem/270/B
+270A,Fancy Fence,"geometry, implementation, math",1100,22501,0,https://codeforces.com/problemset/problem/270/A
+269E,String Theory,,3100,58,0,https://codeforces.com/problemset/problem/269/E
+269D,Maximum Waterfall,"data structures, dp, graphs, sortings",2600,331,0,https://codeforces.com/problemset/problem/269/D
+269C,Flawed Flow,"constructive algorithms, flows, graphs, greedy",2100,1299,0,https://codeforces.com/problemset/problem/269/C
+269B,Greenhouse Effect,dp,1700,4280,0,https://codeforces.com/problemset/problem/269/B
+269A,Magical Boxes,"greedy, math",1600,2815,0,https://codeforces.com/problemset/problem/269/A
+268E,Playlist,"math, probabilities, sortings",2100,792,0,https://codeforces.com/problemset/problem/268/E
+268D,Wall Bars,dp,2300,353,0,https://codeforces.com/problemset/problem/268/D
+268C,Beautiful Sets of Points,"constructive algorithms, implementation",1500,8781,0,https://codeforces.com/problemset/problem/268/C
+268B,Buttons,"implementation, math",1000,18552,0,https://codeforces.com/problemset/problem/268/B
+268A,Games,brute force,800,32330,0,https://codeforces.com/problemset/problem/268/A
+267C,Berland Traffic,"math, matrices",2700,113,0,https://codeforces.com/problemset/problem/267/C
+267B,Dominoes,"dfs and similar, graphs",2000,427,0,https://codeforces.com/problemset/problem/267/B
+267A,Subtractions,"math, number theory",900,3379,0,https://codeforces.com/problemset/problem/267/A
+266E,More Queries to Array...,"data structures, math",2500,476,0,https://codeforces.com/problemset/problem/266/E
+266D,BerDonalds,"graphs, math, shortest paths",2400,448,0,https://codeforces.com/problemset/problem/266/D
+266C,Below the Diagonal,"constructive algorithms, greedy, math",2100,1147,0,https://codeforces.com/problemset/problem/266/C
+266B,Queue at the School,"constructive algorithms, graph matchings, implementation, shortest paths",800,47461,0,https://codeforces.com/problemset/problem/266/B
+266A,Stones on the Table,implementation,800,62053,0,https://codeforces.com/problemset/problem/266/A
+265B,Roadside Trees (Simplified Edition),"greedy, implementation",1000,9926,0,https://codeforces.com/problemset/problem/265/B
+265A,Colorful Stones (Simplified Edition),implementation,800,14057,0,https://codeforces.com/problemset/problem/265/A
+264E,Roadside Trees,"data structures, dp",3000,242,0,https://codeforces.com/problemset/problem/264/E
+264D,Colorful Stones,"dp, two pointers",2500,299,0,https://codeforces.com/problemset/problem/264/D
+264C,Choosing Balls,dp,2000,1934,0,https://codeforces.com/problemset/problem/264/C
+264B,Good Sequences,"dp, number theory",1500,6064,0,https://codeforces.com/problemset/problem/264/B
+264A,Escape from Stones,"constructive algorithms, data structures, implementation, two pointers",1200,7455,0,https://codeforces.com/problemset/problem/264/A
+263E,Rhombus,"brute force, data structures, dp",2500,280,0,https://codeforces.com/problemset/problem/263/E
+263D,Cycle in Graph,"dfs and similar, graphs",1800,2080,0,https://codeforces.com/problemset/problem/263/D
+263C,Circle of Numbers,"brute force, dfs and similar, implementation",2000,921,0,https://codeforces.com/problemset/problem/263/C
+263B,Squares,"greedy, implementation, sortings",900,6322,0,https://codeforces.com/problemset/problem/263/B
+263A,Beautiful Matrix,implementation,800,70879,0,https://codeforces.com/problemset/problem/263/A
+262B,Roma and Changing Signs,greedy,1200,5994,0,https://codeforces.com/problemset/problem/262/B
+262A,Roma and Lucky Numbers,implementation,800,10827,0,https://codeforces.com/problemset/problem/262/A
+261E,Maxim and Calculator,"brute force, dp, two pointers",2800,296,0,https://codeforces.com/problemset/problem/261/E
+261D,Maxim and Increasing Subsequence,dp,2600,386,0,https://codeforces.com/problemset/problem/261/D
+261C,Maxim and Matrix,"constructive algorithms, dp, math",2000,644,0,https://codeforces.com/problemset/problem/261/C
+261B,Maxim and Restaurant,"dp, math, probabilities",1900,1107,0,https://codeforces.com/problemset/problem/261/B
+261A,Maxim and Discounts,"greedy, sortings",1400,3770,0,https://codeforces.com/problemset/problem/261/A
+260E,Dividing Kingdom,"binary search, brute force, data structures",2500,334,0,https://codeforces.com/problemset/problem/260/E
+260D,Black and White Tree,"constructive algorithms, dsu, graphs, greedy, trees",2100,962,0,https://codeforces.com/problemset/problem/260/D
+260C,Balls and Boxes,"constructive algorithms, greedy, implementation",1700,2166,0,https://codeforces.com/problemset/problem/260/C
+260B,Ancient Prophesy,"brute force, implementation, strings",1600,2765,0,https://codeforces.com/problemset/problem/260/B
+260A,Adding Digits,"implementation, math",1400,6725,0,https://codeforces.com/problemset/problem/260/A
+259B,Little Elephant and Magic Square,"brute force, implementation",1100,8204,0,https://codeforces.com/problemset/problem/259/B
+259A,Little Elephant and Chess,"brute force, strings",1000,6337,0,https://codeforces.com/problemset/problem/259/A
+258E,Little Elephant and Tree,"data structures, dfs and similar, trees",2400,640,0,https://codeforces.com/problemset/problem/258/E
+258D,Little Elephant and Broken Sorting,"dp, math, probabilities",2600,671,0,https://codeforces.com/problemset/problem/258/D
+258C,Little Elephant and LCM,"binary search, combinatorics, dp, math",2000,1288,0,https://codeforces.com/problemset/problem/258/C
+258B,Little Elephant and Elections,"brute force, combinatorics, dp",1900,1193,0,https://codeforces.com/problemset/problem/258/B
+258A,Little Elephant and Bits,"greedy, math",1100,12116,0,https://codeforces.com/problemset/problem/258/A
+257E,Greedy Elevator,"data structures, implementation",2200,210,0,https://codeforces.com/problemset/problem/257/E
+257D,Sum,"greedy, math",1900,1286,0,https://codeforces.com/problemset/problem/257/D
+257C,View Angle,"brute force, geometry, math",1800,3061,0,https://codeforces.com/problemset/problem/257/C
+257B,Playing Cubes,"games, greedy, implementation",1300,4293,0,https://codeforces.com/problemset/problem/257/B
+257A,Sockets,"greedy, implementation, sortings",1100,4512,0,https://codeforces.com/problemset/problem/257/A
+256E,Lucky Arrays,data structures,2400,455,0,https://codeforces.com/problemset/problem/256/E
+256D,Liars and Serge,dp,2700,209,0,https://codeforces.com/problemset/problem/256/D
+255E,Furlo and Rublo and Game,"games, implementation, math",2200,706,0,https://codeforces.com/problemset/problem/255/E
+255D,Mr. Bender and Square,"binary search, implementation, math",1800,1558,0,https://codeforces.com/problemset/problem/255/D
+255C,Almost Arithmetical Progression,"brute force, dp",1500,3253,0,https://codeforces.com/problemset/problem/255/C
+255B,Code Parsing,implementation,1200,3664,0,https://codeforces.com/problemset/problem/255/B
+255A,Greg's Workout,implementation,800,14888,0,https://codeforces.com/problemset/problem/255/A
+254E,Dormitory,"dp, implementation",2100,346,0,https://codeforces.com/problemset/problem/254/E
+254D,Rats,"brute force, dfs and similar, graphs, implementation, shortest paths",2300,327,0,https://codeforces.com/problemset/problem/254/D
+254C,Anagram,"greedy, strings",1800,1119,0,https://codeforces.com/problemset/problem/254/C
+254B,Jury Size,"brute force, implementation",1500,1755,0,https://codeforces.com/problemset/problem/254/B
+254A,Cards with Numbers,"constructive algorithms, sortings",1200,3945,0,https://codeforces.com/problemset/problem/254/A
+253E,Printer,"binary search, data structures, implementation, sortings",2200,424,0,https://codeforces.com/problemset/problem/253/E
+253D,Table with Letters - 2,"brute force, two pointers",2000,618,0,https://codeforces.com/problemset/problem/253/D
+253C,Text Editor,"data structures, dfs and similar, graphs, greedy, shortest paths",1600,1718,0,https://codeforces.com/problemset/problem/253/C
+253B,Physics Practical,"binary search, dp, sortings, two pointers",1400,6076,0,https://codeforces.com/problemset/problem/253/B
+253A,Boys and Girls,greedy,1100,6156,0,https://codeforces.com/problemset/problem/253/A
+252B,Unsorting Array,"brute force, sortings",1800,1372,0,https://codeforces.com/problemset/problem/252/B
+252A,Little Xor,"brute force, implementation",1100,3579,0,https://codeforces.com/problemset/problem/252/A
+251E,Tree and Table,"dfs and similar, dp, implementation, trees",3000,85,0,https://codeforces.com/problemset/problem/251/E
+251D,Two Sets,"bitmasks, math",2700,308,0,https://codeforces.com/problemset/problem/251/D
+251C,Number Transformation,"dp, greedy, number theory",2000,853,0,https://codeforces.com/problemset/problem/251/C
+251B,Playing with Permutations,"implementation, math",1800,1077,0,https://codeforces.com/problemset/problem/251/B
+251A,Points on Line,"binary search, combinatorics, two pointers",1300,8360,0,https://codeforces.com/problemset/problem/251/A
+250E,Mad Joe,brute force,2000,356,0,https://codeforces.com/problemset/problem/250/E
+250D,Building Bridge,"geometry, ternary search, two pointers",1900,686,0,https://codeforces.com/problemset/problem/250/D
+250C,Movie Critics,greedy,1600,1435,0,https://codeforces.com/problemset/problem/250/C
+250B,Restoring IPv6,"implementation, strings",1500,1452,0,https://codeforces.com/problemset/problem/250/B
+250A,Paper Work,greedy,1000,2449,0,https://codeforces.com/problemset/problem/250/A
+249E,Endless Matrix,math,2600,169,0,https://codeforces.com/problemset/problem/249/E
+249D,Donkey and Stars,"data structures, dp, geometry, math, sortings",2700,224,0,https://codeforces.com/problemset/problem/249/D
+248E,Piglet's Birthday,"dp, math, probabilities",2600,292,0,https://codeforces.com/problemset/problem/248/E
+248D,Sweets for Everyone!,"binary search, greedy, implementation",2300,366,0,https://codeforces.com/problemset/problem/248/D
+248C,Robo-Footballer,"binary search, geometry",2000,655,0,https://codeforces.com/problemset/problem/248/C
+248B,Chilly Willy,"math, number theory",1400,3504,0,https://codeforces.com/problemset/problem/248/B
+248A,Cupboards,implementation,800,9354,0,https://codeforces.com/problemset/problem/248/A
+246E,Blood Cousins Return,"binary search, data structures, dfs and similar, dp, sortings",2400,1109,0,https://codeforces.com/problemset/problem/246/E
+246D,Colorful Graph,"brute force, dfs and similar, graphs",1600,6135,0,https://codeforces.com/problemset/problem/246/D
+246C,Beauty Pageant,"brute force, constructive algorithms, greedy",1600,2111,0,https://codeforces.com/problemset/problem/246/C
+246B,Increase and Decrease,"greedy, math",1300,6101,0,https://codeforces.com/problemset/problem/246/B
+246A,Buggy Sorting,"constructive algorithms, greedy, sortings",900,6303,0,https://codeforces.com/problemset/problem/246/A
+245H,Queries for Number of Palindromes,"dp, hashing, strings",1800,2776,0,https://codeforces.com/problemset/problem/245/H
+245G,Suggested Friends,"brute force, graphs",2200,373,0,https://codeforces.com/problemset/problem/245/G
+245F,Log Stream Analysis,"binary search, brute force, implementation, strings",2000,675,0,https://codeforces.com/problemset/problem/245/F
+245E,Mishap in Club,"greedy, implementation",1400,2460,0,https://codeforces.com/problemset/problem/245/E
+245D,Restoring Table,"constructive algorithms, greedy",1500,1617,0,https://codeforces.com/problemset/problem/245/D
+245C,Game with Coins,greedy,1700,1274,0,https://codeforces.com/problemset/problem/245/C
+245B,Internet Address,"implementation, strings",1100,4071,0,https://codeforces.com/problemset/problem/245/B
+245A,System Administrator,implementation,800,5916,0,https://codeforces.com/problemset/problem/245/A
+244B,Undoubtedly Lucky Numbers,"bitmasks, brute force, dfs and similar",1600,2978,0,https://codeforces.com/problemset/problem/244/B
+244A,Dividing Orange,implementation,900,5252,0,https://codeforces.com/problemset/problem/244/A
+243E,Matrix,data structures,3000,102,0,https://codeforces.com/problemset/problem/243/E
+243D,Cubes,"data structures, dp, geometry, two pointers",2700,142,0,https://codeforces.com/problemset/problem/243/D
+243C,Colorado Potato Beetle,"dfs and similar, implementation",2200,407,0,https://codeforces.com/problemset/problem/243/C
+243B,Hydra,"graphs, sortings",2000,951,0,https://codeforces.com/problemset/problem/243/B
+243A,The Brand New Function,bitmasks,1600,2704,0,https://codeforces.com/problemset/problem/243/A
+242E,XOR on Segment,"bitmasks, data structures",2000,3601,0,https://codeforces.com/problemset/problem/242/E
+242D,Dispute,"dfs and similar, graphs, greedy",2100,1285,0,https://codeforces.com/problemset/problem/242/D
+242C,King's Path,"dfs and similar, graphs, hashing, shortest paths",1800,4012,0,https://codeforces.com/problemset/problem/242/C
+242B,Big Segment,"implementation, sortings",1100,8245,0,https://codeforces.com/problemset/problem/242/B
+242A,Heads or Tails,"brute force, implementation",1100,4836,0,https://codeforces.com/problemset/problem/242/A
+241G,Challenging Balloons,constructive algorithms,1900,486,0,https://codeforces.com/problemset/problem/241/G
+241F,Race,"brute force, implementation",2300,227,0,https://codeforces.com/problemset/problem/241/F
+241E,Flights,"graphs, shortest paths",2600,496,0,https://codeforces.com/problemset/problem/241/E
+241D,Numbers,,2900,160,0,https://codeforces.com/problemset/problem/241/D
+241C,Mirror Box,"geometry, implementation",2000,450,0,https://codeforces.com/problemset/problem/241/C
+241B,Friends,"binary search, bitmasks, data structures, math",2700,302,0,https://codeforces.com/problemset/problem/241/B
+241A,Old Peykan,greedy,1300,1943,0,https://codeforces.com/problemset/problem/241/A
+240F,TorCoder,data structures,2600,670,0,https://codeforces.com/problemset/problem/240/F
+240E,Road Repairs,"dfs and similar, graphs, greedy",2800,250,0,https://codeforces.com/problemset/problem/240/E
+239B,Easy Tape Programming,"brute force, implementation",1500,1155,0,https://codeforces.com/problemset/problem/239/B
+239A,Two Bags of Potatoes,"greedy, implementation, math",1200,9288,0,https://codeforces.com/problemset/problem/239/A
+238E,Meeting Her,"dp, graphs, shortest paths",2600,250,0,https://codeforces.com/problemset/problem/238/E
+238D,Tape Programming,"data structures, implementation",2900,166,0,https://codeforces.com/problemset/problem/238/D
+238C,World Eater Brothers,"dfs and similar, dp, greedy, trees",2100,800,0,https://codeforces.com/problemset/problem/238/C
+238B,Boring Partition,constructive algorithms,1800,988,0,https://codeforces.com/problemset/problem/238/B
+238A,Not Wool Sequences,"constructive algorithms, math",1300,1679,0,https://codeforces.com/problemset/problem/238/A
+237E,Build String,"flows, graphs",2000,1086,0,https://codeforces.com/problemset/problem/237/E
+237D,T-decomposition,"dfs and similar, graphs, greedy, trees",2000,434,0,https://codeforces.com/problemset/problem/237/D
+237C,Primes on Interval,"binary search, number theory, two pointers",1600,3756,0,https://codeforces.com/problemset/problem/237/C
+237B,Young Table,"implementation, sortings",1500,1974,0,https://codeforces.com/problemset/problem/237/B
+237A,Free Cash,implementation,1000,14898,0,https://codeforces.com/problemset/problem/237/A
+236B,Easy Number Challenge,"implementation, number theory",1300,6405,0,https://codeforces.com/problemset/problem/236/B
+236A,Boy or Girl,"brute force, implementation, strings",800,59634,0,https://codeforces.com/problemset/problem/236/A
+235E,Number Challenge,"combinatorics, dp, implementation, math, number theory",2600,469,0,https://codeforces.com/problemset/problem/235/E
+235D,Graph Game,graphs,3000,265,0,https://codeforces.com/problemset/problem/235/D
+235C,Cyclical Quest,"data structures, string suffix structures, strings",2700,885,0,https://codeforces.com/problemset/problem/235/C
+235B,Let's Play Osu!,"dp, math, probabilities",2000,1755,0,https://codeforces.com/problemset/problem/235/B
+235A,LCM Challenge,number theory,1600,9023,0,https://codeforces.com/problemset/problem/235/A
+234H,Merging Two Decks,"constructive algorithms, greedy",2000,491,0,https://codeforces.com/problemset/problem/234/H
+234G,Practice,"constructive algorithms, divide and conquer, implementation",1600,1106,0,https://codeforces.com/problemset/problem/234/G
+234F,Fence,dp,1800,1315,0,https://codeforces.com/problemset/problem/234/F
+234E,Champions' League,implementation,1600,829,0,https://codeforces.com/problemset/problem/234/E
+234D,Cinema,implementation,1600,1348,0,https://codeforces.com/problemset/problem/234/D
+234C,Weather,"dp, implementation",1300,3719,0,https://codeforces.com/problemset/problem/234/C
+234B,Reading,sortings,1000,4270,0,https://codeforces.com/problemset/problem/234/B
+234A,Lefthanders and Righthanders,implementation,1200,3148,0,https://codeforces.com/problemset/problem/234/A
+233B,Non-square Equation,"binary search, brute force, math",1400,4462,0,https://codeforces.com/problemset/problem/233/B
+233A,Perfect Permutation,"implementation, math",800,15864,0,https://codeforces.com/problemset/problem/233/A
+232E,Quick Tortoise,"bitmasks, divide and conquer, dp",3000,291,0,https://codeforces.com/problemset/problem/232/E
+232D,Fence,"binary search, data structures, string suffix structures",2900,290,0,https://codeforces.com/problemset/problem/232/D
+232C,Doe Graphs,"constructive algorithms, divide and conquer, dp, graphs, shortest paths",2600,170,0,https://codeforces.com/problemset/problem/232/C
+232B,Table,"bitmasks, combinatorics, dp, math",1900,1043,0,https://codeforces.com/problemset/problem/232/B
+232A,Cycles,"binary search, constructive algorithms, graphs, greedy",1600,1871,0,https://codeforces.com/problemset/problem/232/A
+231E,Cactus,"data structures, dfs and similar, dp, graphs, trees",2100,913,0,https://codeforces.com/problemset/problem/231/E
+231D,Magic Box,"brute force, geometry",1600,3289,0,https://codeforces.com/problemset/problem/231/D
+231C,To Add or Not to Add,"binary search, sortings, two pointers",1600,4764,0,https://codeforces.com/problemset/problem/231/C
+231B,"Magic, Wizardry and Wonders","constructive algorithms, greedy",1500,2615,0,https://codeforces.com/problemset/problem/231/B
+231A,Team,"brute force, greedy",800,88305,0,https://codeforces.com/problemset/problem/231/A
+230B,T-primes,"binary search, implementation, math, number theory",1300,28201,0,https://codeforces.com/problemset/problem/230/B
+230A,Dragons,"greedy, sortings",1000,29967,0,https://codeforces.com/problemset/problem/230/A
+229E,Gifts,"combinatorics, dp, math, probabilities",2600,344,0,https://codeforces.com/problemset/problem/229/E
+229D,Towers,"dp, greedy, two pointers",2100,1161,0,https://codeforces.com/problemset/problem/229/D
+229C,Triangles,"combinatorics, graphs, math",1900,1297,0,https://codeforces.com/problemset/problem/229/C
+229B,Planets,"binary search, data structures, graphs, shortest paths",1700,2802,0,https://codeforces.com/problemset/problem/229/B
+229A,Shifts,"brute force, two pointers",1500,2858,0,https://codeforces.com/problemset/problem/229/A
+228E,The Road to Berland is Paved With Good Intentions,"2-sat, dfs and similar, dsu, graphs",1900,1529,0,https://codeforces.com/problemset/problem/228/E
+228D,Zigzag,data structures,2100,307,0,https://codeforces.com/problemset/problem/228/D
+228C,Fractal Detector,"dp, hashing",2000,379,0,https://codeforces.com/problemset/problem/228/C
+228B,Two Tables,"brute force, implementation",1400,2706,0,https://codeforces.com/problemset/problem/228/B
+228A,Is your horseshoe on the other hoof?,implementation,800,33645,0,https://codeforces.com/problemset/problem/228/A
+227B,Effective Approach,implementation,1100,9540,0,https://codeforces.com/problemset/problem/227/B
+227A,Where do I Turn?,geometry,1300,3024,0,https://codeforces.com/problemset/problem/227/A
+226E,Noble Knight's Path,"data structures, trees",2900,309,0,https://codeforces.com/problemset/problem/226/E
+226D,The table,"constructive algorithms, greedy",2100,760,0,https://codeforces.com/problemset/problem/226/D
+226C,Anniversary,"data structures, implementation, math, matrices, number theory",2400,601,0,https://codeforces.com/problemset/problem/226/C
+226B,Naughty Stone Piles,greedy,1900,1226,0,https://codeforces.com/problemset/problem/226/B
+226A,Flying Saucer Segments,math,1400,2811,0,https://codeforces.com/problemset/problem/226/A
+225E,Unsolvable,"math, number theory",2100,561,0,https://codeforces.com/problemset/problem/225/E
+225D,Snake,"bitmasks, dfs and similar, graphs, implementation",2200,716,0,https://codeforces.com/problemset/problem/225/D
+225C,Barcode,"dp, matrices",1700,5536,0,https://codeforces.com/problemset/problem/225/C
+225B,Well-known Numbers,"binary search, greedy, number theory",1600,2391,0,https://codeforces.com/problemset/problem/225/B
+225A,Dice Tower,"constructive algorithms, greedy",1100,5401,0,https://codeforces.com/problemset/problem/225/A
+224B,Array,"bitmasks, implementation, two pointers",1500,4533,0,https://codeforces.com/problemset/problem/224/B
+224A,Parallelepiped,"brute force, geometry, math",1100,11277,0,https://codeforces.com/problemset/problem/224/A
+223E,Planar Graph,"flows, geometry, graphs",3000,104,0,https://codeforces.com/problemset/problem/223/E
+223D,Spider,"geometry, graphs",3000,41,0,https://codeforces.com/problemset/problem/223/D
+223C,Partial Sums,"combinatorics, math, number theory",1900,1077,0,https://codeforces.com/problemset/problem/223/C
+223B,Two Strings,"data structures, dp, strings",1900,1171,0,https://codeforces.com/problemset/problem/223/B
+223A,Bracket Sequence,"data structures, expression parsing, implementation",1700,1852,0,https://codeforces.com/problemset/problem/223/A
+222E,Decoding Genome,"dp, matrices",1900,1404,0,https://codeforces.com/problemset/problem/222/E
+222D,Olympiad,"binary search, greedy, sortings, two pointers",1900,1703,0,https://codeforces.com/problemset/problem/222/D
+222C,Reducing Fractions,"implementation, math, number theory, sortings",1800,1383,0,https://codeforces.com/problemset/problem/222/C
+222B,Cosmic Tables,"data structures, implementation",1300,4145,0,https://codeforces.com/problemset/problem/222/B
+222A,Shooshuns and Sequence,"brute force, implementation",1200,5738,0,https://codeforces.com/problemset/problem/222/A
+221B,Little Elephant and Numbers,implementation,1300,3368,0,https://codeforces.com/problemset/problem/221/B
+221A,Little Elephant and Function,"implementation, math",1000,7733,0,https://codeforces.com/problemset/problem/221/A
+220E,Little Elephant and Inversions,"data structures, two pointers",2400,832,0,https://codeforces.com/problemset/problem/220/E
+220D,Little Elephant and Triangle,"geometry, math",2500,230,0,https://codeforces.com/problemset/problem/220/D
+220C,Little Elephant and Shifts,data structures,2100,775,0,https://codeforces.com/problemset/problem/220/C
+220B,Little Elephant and Array,"constructive algorithms, data structures",1800,4677,0,https://codeforces.com/problemset/problem/220/B
+220A,Little Elephant and Problem,"implementation, sortings",1300,7809,0,https://codeforces.com/problemset/problem/220/A
+219E,Parking Lot,data structures,2200,517,0,https://codeforces.com/problemset/problem/219/E
+219D,Choosing Capital for Treeland,"dfs and similar, dp, graphs, trees",1700,4337,0,https://codeforces.com/problemset/problem/219/D
+219C,Color Stripe,"brute force, dp, greedy",1600,4512,0,https://codeforces.com/problemset/problem/219/C
+219B,Special Offer! Super Price 999 Bourles!,implementation,1400,3533,0,https://codeforces.com/problemset/problem/219/B
+219A,k-String,"implementation, strings",1000,11776,0,https://codeforces.com/problemset/problem/219/A
+218B,Airport,implementation,1100,7324,0,https://codeforces.com/problemset/problem/218/B
+218A,Mountain Scenery,"brute force, constructive algorithms, implementation",1100,4243,0,https://codeforces.com/problemset/problem/218/A
+217E,Alien DNA,"data structures, dsu, trees",2800,212,0,https://codeforces.com/problemset/problem/217/E
+217D,Bitonix' Patrol,"bitmasks, brute force, combinatorics, dfs and similar, math",2900,205,0,https://codeforces.com/problemset/problem/217/D
+217C,Formurosa,"divide and conquer, dp, expression parsing",2600,253,0,https://codeforces.com/problemset/problem/217/C
+217B,Blackboard Fibonacci,"brute force, math",2100,705,0,https://codeforces.com/problemset/problem/217/B
+217A,Ice Skating,"brute force, dfs and similar, dsu, graphs",1200,11814,0,https://codeforces.com/problemset/problem/217/A
+216E,Martian Luck,"math, number theory",2000,438,0,https://codeforces.com/problemset/problem/216/E
+216D,Spider's Web,"binary search, sortings, two pointers",1700,940,0,https://codeforces.com/problemset/problem/216/D
+216C,Hiring Staff,greedy,1800,1328,0,https://codeforces.com/problemset/problem/216/C
+216B,Forming Teams,"dfs and similar, implementation",1700,3433,0,https://codeforces.com/problemset/problem/216/B
+216A,Tiling with Hexagons,"implementation, math",1200,3745,0,https://codeforces.com/problemset/problem/216/A
+215E,Periodical Numbers,"combinatorics, dp, number theory",2100,391,0,https://codeforces.com/problemset/problem/215/E
+215D,Hot Days,greedy,1900,1295,0,https://codeforces.com/problemset/problem/215/D
+215C,Crosses,"brute force, implementation",2100,392,0,https://codeforces.com/problemset/problem/215/C
+215B,Olympic Medal,"greedy, math",1300,3320,0,https://codeforces.com/problemset/problem/215/B
+215A,Bicycle Chain,"brute force, implementation",900,6739,0,https://codeforces.com/problemset/problem/215/A
+214B,Hometask,"brute force, constructive algorithms, greedy, math",1600,3346,0,https://codeforces.com/problemset/problem/214/B
+214A,System of Equations,brute force,800,15194,0,https://codeforces.com/problemset/problem/214/A
+213E,Two Permutations,"data structures, hashing, strings",2700,403,0,https://codeforces.com/problemset/problem/213/E
+213D,Stars,"constructive algorithms, geometry",2300,278,0,https://codeforces.com/problemset/problem/213/D
+213C,Relay Race,dp,2000,1519,0,https://codeforces.com/problemset/problem/213/C
+213B,Numbers,"combinatorics, dp",1900,1380,0,https://codeforces.com/problemset/problem/213/B
+213A,Game,"dfs and similar, greedy",1700,1407,0,https://codeforces.com/problemset/problem/213/A
+212E,IT Restaurants,"dfs and similar, dp, trees",1500,798,0,https://codeforces.com/problemset/problem/212/E
+212D,Cutting a Fence,"binary search, data structures, dsu",2500,307,0,https://codeforces.com/problemset/problem/212/D
+212C,Cowboys,"combinatorics, dp, math",2100,305,0,https://codeforces.com/problemset/problem/212/C
+212B,Polycarpus is Looking for Good Substrings,"bitmasks, hashing, implementation",2300,285,0,https://codeforces.com/problemset/problem/212/B
+212A,Privatization,"flows, graphs",3000,96,0,https://codeforces.com/problemset/problem/212/A
+209C,Trails and Glades,"constructive algorithms, dsu, graphs, greedy",2400,428,0,https://codeforces.com/problemset/problem/209/C
+209B,Pixels,"constructive algorithms, math",2100,228,0,https://codeforces.com/problemset/problem/209/B
+209A,Multicolored Marbles,"dp, math",1600,1174,0,https://codeforces.com/problemset/problem/209/A
+208E,Blood Cousins,"binary search, data structures, dfs and similar, trees",2100,2482,0,https://codeforces.com/problemset/problem/208/E
+208D,"Prizes, Prizes, more Prizes",implementation,1200,5923,0,https://codeforces.com/problemset/problem/208/D
+208C,Police Station,"dp, graphs, shortest paths",1900,1285,0,https://codeforces.com/problemset/problem/208/C
+208B,Solitaire,"dfs and similar, dp",1900,1063,0,https://codeforces.com/problemset/problem/208/B
+208A,Dubstep,strings,900,36430,0,https://codeforces.com/problemset/problem/208/A
+207D9,The Beaver's Problem - 3,,1800,37,0,https://codeforces.com/problemset/problem/207/D9
+207D8,The Beaver's Problem - 3,,2300,41,0,https://codeforces.com/problemset/problem/207/D8
+207D7,The Beaver's Problem - 3,,1600,43,0,https://codeforces.com/problemset/problem/207/D7
+207D6,The Beaver's Problem - 3,,2100,40,0,https://codeforces.com/problemset/problem/207/D6
+207D5,The Beaver's Problem - 3,,1600,44,0,https://codeforces.com/problemset/problem/207/D5
+207D4,The Beaver's Problem - 3,,2100,44,0,https://codeforces.com/problemset/problem/207/D4
+207D3,The Beaver's Problem - 3,,2000,48,0,https://codeforces.com/problemset/problem/207/D3
+207D2,The Beaver's Problem - 3,,2000,55,0,https://codeforces.com/problemset/problem/207/D2
+207D10,The Beaver's Problem - 3,,2100,39,0,https://codeforces.com/problemset/problem/207D/10
+207D1,The Beaver's Problem - 3,,1800,64,0,https://codeforces.com/problemset/problem/207/D1
+207C3,Game with Two Trees,data structures,2700,37,0,https://codeforces.com/problemset/problem/207/C3
+207C2,Game with Two Trees,,2200,40,0,https://codeforces.com/problemset/problem/207/C2
+207C1,Game with Two Trees,,2100,51,0,https://codeforces.com/problemset/problem/207/C1
+207B3,Military Trainings,,1700,114,0,https://codeforces.com/problemset/problem/207/B3
+207B2,Military Trainings,,1900,121,0,https://codeforces.com/problemset/problem/207/B2
+207B1,Military Trainings,,1600,172,0,https://codeforces.com/problemset/problem/207/B1
+207A3,Beaver's Calculator 1.0,greedy,2000,170,0,https://codeforces.com/problemset/problem/207/A3
+207A2,Beaver's Calculator 1.0,greedy,1800,175,0,https://codeforces.com/problemset/problem/207/A2
+207A1,Beaver's Calculator 1.0,greedy,1600,213,0,https://codeforces.com/problemset/problem/207/A1
+205B,Little Elephant and Sorting,"brute force, greedy",1400,3823,0,https://codeforces.com/problemset/problem/205/B
+205A,Little Elephant and Rozdil,"brute force, implementation",900,9553,0,https://codeforces.com/problemset/problem/205/A
+204E,Little Elephant and Strings,"data structures, implementation, string suffix structures, two pointers",2800,551,0,https://codeforces.com/problemset/problem/204/E
+204D,Little Elephant and Retro Strings,dp,2400,303,0,https://codeforces.com/problemset/problem/204/D
+204C,Little Elephant and Furik and Rubik,"math, probabilities",2000,857,0,https://codeforces.com/problemset/problem/204/C
+204B,Little Elephant and Cards,"binary search, data structures",1500,3539,0,https://codeforces.com/problemset/problem/204/B
+204A,Little Elephant and Interval,"binary search, combinatorics, dp",1500,3872,0,https://codeforces.com/problemset/problem/204/A
+203E,Transportation,"greedy, sortings, two pointers",2300,219,0,https://codeforces.com/problemset/problem/203/E
+203D,Hit Ball,"geometry, implementation, math",1700,1207,0,https://codeforces.com/problemset/problem/203/D
+203C,Photographer,"greedy, sortings",1400,4006,0,https://codeforces.com/problemset/problem/203/C
+203B,Game on Paper,"brute force, implementation",1300,2152,0,https://codeforces.com/problemset/problem/203/B
+203A,Two Problems,"brute force, implementation",1200,3444,0,https://codeforces.com/problemset/problem/203/A
+202B,Brand New Easy Problem,brute force,1700,723,0,https://codeforces.com/problemset/problem/202/B
+202A,LLPS,"binary search, bitmasks, brute force, greedy, implementation, strings",800,7115,0,https://codeforces.com/problemset/problem/202/A
+201E,Thoroughly Bureaucratic Organization,"binary search, combinatorics",2600,271,0,https://codeforces.com/problemset/problem/201/E
+201D,Brand New Problem,"bitmasks, brute force, dp",2600,293,0,https://codeforces.com/problemset/problem/201/D
+201C,Fragile Bridges,dp,2000,998,0,https://codeforces.com/problemset/problem/201/C
+201B,Guess That Car!,"math, ternary search",1800,1027,0,https://codeforces.com/problemset/problem/201/B
+201A,Clear Symmetry,"constructive algorithms, dp, math",1700,2330,0,https://codeforces.com/problemset/problem/201/A
+200E,Tractor College,"implementation, math, number theory, ternary search",2400,250,0,https://codeforces.com/problemset/problem/200/E
+200D,Programming Language,"binary search, brute force, expression parsing, implementation",1800,729,0,https://codeforces.com/problemset/problem/200/D
+200C,Football Championship,"brute force, implementation",1800,827,0,https://codeforces.com/problemset/problem/200/C
+200B,Drinks,"implementation, math",800,36423,0,https://codeforces.com/problemset/problem/200/B
+200A,Cinema,"brute force, data structures",2400,474,0,https://codeforces.com/problemset/problem/200/A
+199B,Special Olympics,geometry,1900,589,0,https://codeforces.com/problemset/problem/199/B
+199A,Hexadecimal's theorem,"brute force, constructive algorithms, implementation, number theory",900,10916,0,https://codeforces.com/problemset/problem/199/A
+198E,Gripping Story,"binary search, data structures, sortings",2400,322,0,https://codeforces.com/problemset/problem/198/E
+198D,Cube Snake,constructive algorithms,2700,63,0,https://codeforces.com/problemset/problem/198/D
+198C,Delivering Carcinogen,"binary search, geometry",2400,312,0,https://codeforces.com/problemset/problem/198/C
+198B,Jumping on Walls,shortest paths,1400,2477,0,https://codeforces.com/problemset/problem/198/B
+198A,About Bacteria,"implementation, math",1700,2448,0,https://codeforces.com/problemset/problem/198/A
+197B,Limit,math,1400,2961,0,https://codeforces.com/problemset/problem/197/B
+197A,Plate Game,"constructive algorithms, games, math",1600,3784,0,https://codeforces.com/problemset/problem/197/A
+196E,Opening Portals,"dsu, graphs, shortest paths",2600,448,0,https://codeforces.com/problemset/problem/196/E
+196D,The Next Good String,"data structures, greedy, hashing, strings",2800,303,0,https://codeforces.com/problemset/problem/196/D
+196C,Paint Tree,"constructive algorithms, divide and conquer, geometry, sortings, trees",2200,638,0,https://codeforces.com/problemset/problem/196/C
+196B,Infinite Maze,"dfs and similar, graphs",2000,1658,0,https://codeforces.com/problemset/problem/196/B
+196A,Lexicographically Maximum Subsequence,"greedy, strings",1100,4045,0,https://codeforces.com/problemset/problem/196/A
+195E,Building Forest,"data structures, dsu, graphs",2000,562,0,https://codeforces.com/problemset/problem/195/E
+195D,Analyzing Polyline,"geometry, math, sortings",1900,809,0,https://codeforces.com/problemset/problem/195/D
+195C,Try and Catch,"expression parsing, implementation",1800,834,0,https://codeforces.com/problemset/problem/195/C
+195B,After Training,"data structures, implementation, math",1300,3347,0,https://codeforces.com/problemset/problem/195/B
+195A,Let's Watch Football,"binary search, brute force, math",1000,4290,0,https://codeforces.com/problemset/problem/195/A
+194B,Square,math,1200,2473,0,https://codeforces.com/problemset/problem/194/B
+194A,Exams,"implementation, math",900,5283,0,https://codeforces.com/problemset/problem/194/A
+193E,Fibonacci Number,"brute force, math, matrices",2900,206,0,https://codeforces.com/problemset/problem/193/E
+193D,Two Segments,data structures,2900,275,0,https://codeforces.com/problemset/problem/193/D
+193C,Hamming Distance,"constructive algorithms, greedy, math, matrices",2400,371,0,https://codeforces.com/problemset/problem/193/C
+193B,Xor,brute force,2000,728,0,https://codeforces.com/problemset/problem/193/B
+193A,Cutting Figure,"constructive algorithms, graphs, trees",1700,2147,0,https://codeforces.com/problemset/problem/193/A
+192B,Walking in the Rain,"brute force, implementation",1100,3741,0,https://codeforces.com/problemset/problem/192/B
+192A,Funky Numbers,"binary search, brute force, implementation",1300,6089,0,https://codeforces.com/problemset/problem/192/A
+191E,Thwarting Demonstrations,"binary search, data structures, trees",2200,602,0,https://codeforces.com/problemset/problem/191/E
+191D,Metro Scheme,"graphs, greedy",2700,172,0,https://codeforces.com/problemset/problem/191/D
+191C,Fools and Roads,"data structures, dfs and similar, trees",1900,3661,0,https://codeforces.com/problemset/problem/191/C
+191B,Demonstration,greedy,1700,867,0,https://codeforces.com/problemset/problem/191/B
+191A,Dynasty Puzzles,dp,1500,2391,0,https://codeforces.com/problemset/problem/191/A
+190E,Counter Attack,"data structures, dsu, graphs, hashing, sortings",2100,826,0,https://codeforces.com/problemset/problem/190/E
+190D,Non-Secret Cypher,two pointers,1900,1406,0,https://codeforces.com/problemset/problem/190/D
+190C,STL,dfs and similar,1500,1755,0,https://codeforces.com/problemset/problem/190/C
+190B,Surrounded,geometry,1800,2157,0,https://codeforces.com/problemset/problem/190/B
+190A,Vasya and the Bus,"greedy, math",1100,4104,0,https://codeforces.com/problemset/problem/190/A
+189B,Counting Rhombi,"brute force, math",1300,2542,0,https://codeforces.com/problemset/problem/189/B
+189A,Cut Ribbon,"brute force, dp",1300,28495,0,https://codeforces.com/problemset/problem/189/A
+188H,Stack,"*special problem, expression parsing, implementation",1800,179,0,https://codeforces.com/problemset/problem/188/H
+188G,Array Sorting,"*special problem, implementation",1600,167,0,https://codeforces.com/problemset/problem/188/G
+188F,Binary Notation,"*special problem, implementation",1400,224,0,https://codeforces.com/problemset/problem/188/F
+188E,HQ9+,"*special problem, implementation",1400,255,0,https://codeforces.com/problemset/problem/188/E
+188D,Asterisks,"*special problem, implementation",1100,311,0,https://codeforces.com/problemset/problem/188/D
+188C,LCM,"*special problem, implementation, math",1400,313,0,https://codeforces.com/problemset/problem/188/C
+188B,A + Reverse B,"*special problem, implementation",1300,351,0,https://codeforces.com/problemset/problem/188/B
+188A,Hexagonal Numbers,*special problem,1100,456,0,https://codeforces.com/problemset/problem/188/A
+187E,Heaven Tour,"data structures, greedy",2900,59,0,https://codeforces.com/problemset/problem/187/E
+187D,BRT Contract,data structures,2800,251,0,https://codeforces.com/problemset/problem/187/D
+187C,Weak Memory,"dfs and similar, dsu",2000,956,0,https://codeforces.com/problemset/problem/187/C
+187B,AlgoRace,"dp, shortest paths",1800,1269,0,https://codeforces.com/problemset/problem/187/B
+187A,Permutations,greedy,1500,2011,0,https://codeforces.com/problemset/problem/187/A
+186B,Growing Mushrooms,"greedy, sortings",1200,2947,0,https://codeforces.com/problemset/problem/186/B
+186A,Comparing Strings,"implementation, strings",1100,8060,0,https://codeforces.com/problemset/problem/186/A
+185E,Soap Time! - 2,"binary search, data structures",3000,73,0,https://codeforces.com/problemset/problem/185/E
+185D,Visit of the Great,"math, number theory",2600,264,0,https://codeforces.com/problemset/problem/185/D
+185C,Clever Fat Rat,dp,2500,76,0,https://codeforces.com/problemset/problem/185/C
+185B,Mushroom Scientists,"math, ternary search",1800,1298,0,https://codeforces.com/problemset/problem/185/B
+185A,Plant,math,1300,4009,0,https://codeforces.com/problemset/problem/185/A
+183E,Candy Shop,greedy,2900,90,0,https://codeforces.com/problemset/problem/183/E
+183D,T-shirt,"dp, greedy, probabilities",2700,257,0,https://codeforces.com/problemset/problem/183/D
+183C,Cyclic Coloring,dfs and similar,2200,411,0,https://codeforces.com/problemset/problem/183/C
+183B,Zoo,"brute force, geometry",1700,477,0,https://codeforces.com/problemset/problem/183/B
+183A,Headquarters,"constructive algorithms, math",1700,408,0,https://codeforces.com/problemset/problem/183/A
+182E,Wooden Fence,dp,1800,1003,0,https://codeforces.com/problemset/problem/182/E
+182D,Common Divisors,"brute force, hashing, implementation, math, strings",1400,5215,0,https://codeforces.com/problemset/problem/182/D
+182C,Optimal Sum,"data structures, greedy",2000,528,0,https://codeforces.com/problemset/problem/182/C
+182B,Vasya's Calendar,implementation,1000,4121,0,https://codeforces.com/problemset/problem/182/B
+182A,Battlefield,"geometry, graphs, implementation, shortest paths",2200,227,0,https://codeforces.com/problemset/problem/182/A
+181B,Number of Triplets,"binary search, brute force",1300,1636,0,https://codeforces.com/problemset/problem/181/B
+181A,Series of Crimes,"brute force, geometry, implementation",800,3402,0,https://codeforces.com/problemset/problem/181/A
+180F,Mathematical Analysis Rocks!,"constructive algorithms, implementation, math",1200,1519,0,https://codeforces.com/problemset/problem/180/F
+180E,Cubes,"binary search, dp, two pointers",1800,1149,0,https://codeforces.com/problemset/problem/180/E
+180D,Name,"greedy, strings",1900,567,0,https://codeforces.com/problemset/problem/180/D
+180C,Letter,dp,1400,4079,0,https://codeforces.com/problemset/problem/180/C
+180B,Divisibility Rules,"math, number theory",2300,266,0,https://codeforces.com/problemset/problem/180/B
+180A,Defragmentation,implementation,1800,447,0,https://codeforces.com/problemset/problem/180/A
+178F3,Representative Sampling,,2500,199,0,https://codeforces.com/problemset/problem/178/F3
+178F2,Representative Sampling,"dp, sortings, strings",2200,193,0,https://codeforces.com/problemset/problem/178/F2
+178F1,Representative Sampling,,1800,276,0,https://codeforces.com/problemset/problem/178/F1
+178E3,The Beaver's Problem - 2,,2300,167,0,https://codeforces.com/problemset/problem/178/E3
+178E2,The Beaver's Problem - 2,,2000,194,0,https://codeforces.com/problemset/problem/178/E2
+178E1,The Beaver's Problem - 2,,1900,253,0,https://codeforces.com/problemset/problem/178/E1
+178D3,Magic Squares,,2100,194,0,https://codeforces.com/problemset/problem/178/D3
+178D2,Magic Squares,,1900,216,0,https://codeforces.com/problemset/problem/178/D2
+178D1,Magic Squares,,1500,515,0,https://codeforces.com/problemset/problem/178/D1
+178C3,Smart Beaver and Resolving Collisions,,2000,257,0,https://codeforces.com/problemset/problem/178/C3
+178C2,Smart Beaver and Resolving Collisions,,1900,249,0,https://codeforces.com/problemset/problem/178/C2
+178C1,Smart Beaver and Resolving Collisions,,1600,406,0,https://codeforces.com/problemset/problem/178/C1
+178B3,Greedy Merchants,,1800,699,0,https://codeforces.com/problemset/problem/178/B3
+178B2,Greedy Merchants,,1600,504,0,https://codeforces.com/problemset/problem/178/B2
+178B1,Greedy Merchants,,1600,550,0,https://codeforces.com/problemset/problem/178/B1
+178A3,Educational Game,greedy,1100,917,0,https://codeforces.com/problemset/problem/178/A3
+178A2,Educational Game,greedy,1000,993,0,https://codeforces.com/problemset/problem/178/A2
+178A1,Educational Game,,1000,985,0,https://codeforces.com/problemset/problem/178/A1
+177G2,Fibonacci Strings,"matrices, strings",2600,84,0,https://codeforces.com/problemset/problem/177/G2
+177G1,Fibonacci Strings,strings,2400,89,0,https://codeforces.com/problemset/problem/177/G1
+177F2,Script Generation,,2300,134,0,https://codeforces.com/problemset/problem/177/F2
+177F1,Script Generation,,1800,248,0,https://codeforces.com/problemset/problem/177/F1
+177E2,Space Voyage,binary search,1900,310,0,https://codeforces.com/problemset/problem/177/E2
+177E1,Space Voyage,binary search,1700,468,0,https://codeforces.com/problemset/problem/177/E1
+177D2,Encrypting Messages,data structures,1500,1062,0,https://codeforces.com/problemset/problem/177/D2
+177D1,Encrypting Messages,brute force,1200,1402,0,https://codeforces.com/problemset/problem/177/D1
+177C2,Party,"brute force, dfs and similar, dsu, graphs",1500,1490,0,https://codeforces.com/problemset/problem/177/C2
+177C1,Party,"dfs and similar, dsu, graphs",1500,1441,0,https://codeforces.com/problemset/problem/177/C1
+177B2,Rectangular Game,number theory,1200,1950,0,https://codeforces.com/problemset/problem/177/B2
+177B1,Rectangular Game,number theory,1000,2564,0,https://codeforces.com/problemset/problem/177/B1
+177A2,Good Matrix Elements,implementation,800,4316,0,https://codeforces.com/problemset/problem/177/A2
+177A1,Good Matrix Elements,implementation,800,4516,0,https://codeforces.com/problemset/problem/177/A1
+176E,Archaeology,"data structures, dfs and similar, trees",3100,461,0,https://codeforces.com/problemset/problem/176/E
+176D,Hyper String,dp,2500,231,0,https://codeforces.com/problemset/problem/176/D
+176C,Playing with Superglue,"combinatorics, constructive algorithms",2000,378,0,https://codeforces.com/problemset/problem/176/C
+176B,Word Cut,dp,1700,977,0,https://codeforces.com/problemset/problem/176/B
+176A,Trading Business,"greedy, sortings",1200,1043,0,https://codeforces.com/problemset/problem/176/A
+175F,Gnomes of Might and Magic,"data structures, graphs, implementation, shortest paths",3000,48,0,https://codeforces.com/problemset/problem/175/F
+175E,Power Defence,"brute force, dp, geometry, greedy",2600,203,0,https://codeforces.com/problemset/problem/175/E
+175D,Plane of Tanks: Duel,"brute force, dp, math, probabilities",2400,240,0,https://codeforces.com/problemset/problem/175/D
+175C,Geometry Horse,"greedy, implementation, sortings, two pointers",1600,949,0,https://codeforces.com/problemset/problem/175/C
+175B,Plane of Tanks: Pro,implementation,1400,1124,0,https://codeforces.com/problemset/problem/175/B
+175A,Robot Bicorn Attack,"brute force, implementation",1400,1988,0,https://codeforces.com/problemset/problem/175/A
+174C,Range Increments,"data structures, greedy",1800,726,0,https://codeforces.com/problemset/problem/174/C
+174B,File List,"dp, greedy, implementation",1400,1345,0,https://codeforces.com/problemset/problem/174/B
+174A,Problem About Equation,math,1100,1582,0,https://codeforces.com/problemset/problem/174/A
+173E,Camping Groups,"data structures, sortings",2600,366,0,https://codeforces.com/problemset/problem/173/E
+173D,Deputies,"constructive algorithms, graphs, greedy, implementation",2500,197,0,https://codeforces.com/problemset/problem/173/D
+173C,Spiral Maximum,"brute force, dp",1900,767,0,https://codeforces.com/problemset/problem/173/C
+173B,Chamber of Secrets,"dfs and similar, shortest paths",1800,1463,0,https://codeforces.com/problemset/problem/173/B
+173A,Rock-Paper-Scissors,"implementation, math",1300,1758,0,https://codeforces.com/problemset/problem/173/A
+172E,BHTML+BCSS,"*special problem, dfs and similar, expression parsing",2200,242,0,https://codeforces.com/problemset/problem/172/E
+172D,Calendar Reform,"*special problem, number theory",1500,1112,0,https://codeforces.com/problemset/problem/172/D
+172C,Bus,"*special problem, implementation, sortings",1500,1005,0,https://codeforces.com/problemset/problem/172/C
+172B,Pseudorandom Sequence Period,"*special problem, implementation, number theory",1200,2044,0,https://codeforces.com/problemset/problem/172/B
+172A,Phone Code,"*special problem, brute force, implementation",800,3699,0,https://codeforces.com/problemset/problem/172/A
+171H,A polyline,"*special problem, implementation",1700,170,0,https://codeforces.com/problemset/problem/171/H
+171G,Mysterious numbers - 2,*special problem,1600,511,0,https://codeforces.com/problemset/problem/171/G
+171F,ucyhf,"*special problem, brute force, implementation, number theory",1600,898,0,https://codeforces.com/problemset/problem/171/F
+171E,MYSTERIOUS LANGUAGE,*special problem,2000,732,0,https://codeforces.com/problemset/problem/171/E
+171D,Broken checker,"*special problem, brute force",1300,1759,0,https://codeforces.com/problemset/problem/171/D
+171C,A Piece of Cake,"*special problem, implementation",2000,619,0,https://codeforces.com/problemset/problem/171/C
+171B,Star,"*special problem, combinatorics",1300,2544,0,https://codeforces.com/problemset/problem/171/B
+171A,Mysterious numbers - 1,"*special problem, constructive algorithms",1200,2807,0,https://codeforces.com/problemset/problem/171/A
+169B,Replacing Digits,greedy,1100,2131,0,https://codeforces.com/problemset/problem/169/B
+169A,Chores,sortings,800,3655,0,https://codeforces.com/problemset/problem/169/A
+168B,Wizards and Minimal Spell,"implementation, strings",1700,1083,0,https://codeforces.com/problemset/problem/168/B
+168A,Wizards and Demonstration,"implementation, math",900,6885,0,https://codeforces.com/problemset/problem/168/A
+167E,Wizards and Bets,"dfs and similar, graphs, math, matrices",2900,266,0,https://codeforces.com/problemset/problem/167/E
+167D,Wizards and Roads,"data structures, divide and conquer, graph matchings, graphs, greedy",3000,133,0,https://codeforces.com/problemset/problem/167/D
+167C,Wizards and Numbers,"games, math",2300,456,0,https://codeforces.com/problemset/problem/167/C
+167B,Wizards and Huge Prize,"dp, math, probabilities",1800,1533,0,https://codeforces.com/problemset/problem/167/B
+167A,Wizards and Trolleybuses,implementation,1600,1832,0,https://codeforces.com/problemset/problem/167/A
+166E,Tetrahedron,"dp, math, matrices",1500,11083,0,https://codeforces.com/problemset/problem/166/E
+166D,Shoe Store,"dp, graph matchings, greedy, sortings, two pointers",2500,261,0,https://codeforces.com/problemset/problem/166/D
+166C,Median,"greedy, math, sortings",1500,3986,0,https://codeforces.com/problemset/problem/166/C
+166B,Polygons,"geometry, sortings",2100,1255,0,https://codeforces.com/problemset/problem/166/B
+166A,Rank List,"binary search, implementation, sortings",1100,8819,0,https://codeforces.com/problemset/problem/166/A
+165E,Compatible Numbers,"bitmasks, brute force, dfs and similar, dp",2200,2645,0,https://codeforces.com/problemset/problem/165/E
+165D,Beard Graph,"data structures, dsu, trees",2100,947,0,https://codeforces.com/problemset/problem/165/D
+165C,Another Problem on Strings,"binary search, brute force, dp, math, strings, two pointers",1600,7641,0,https://codeforces.com/problemset/problem/165/C
+165B,Burning Midnight Oil,"binary search, implementation",1500,7646,0,https://codeforces.com/problemset/problem/165/B
+165A,Supercentral Point,implementation,1000,10845,0,https://codeforces.com/problemset/problem/165/A
+164E,Polycarpus and Tasks,,3100,44,0,https://codeforces.com/problemset/problem/164/E
+164D,Minimum Diameter,"binary search, brute force",3100,177,0,https://codeforces.com/problemset/problem/164/D
+164C,Machine Programming,"flows, graphs",2400,595,0,https://codeforces.com/problemset/problem/164/C
+164B,Ancient Berland Hieroglyphs,two pointers,2000,363,0,https://codeforces.com/problemset/problem/164/B
+164A,"Variable, or There and Back Again","dfs and similar, graphs",1700,758,0,https://codeforces.com/problemset/problem/164/A
+163E,e-Government,"data structures, dfs and similar, dp, strings, trees",2800,650,0,https://codeforces.com/problemset/problem/163/E
+163D,Large Refrigerator,brute force,2900,300,0,https://codeforces.com/problemset/problem/163/D
+163C,Conveyor,"sortings, two pointers",2100,480,0,https://codeforces.com/problemset/problem/163/C
+163B,Lemmings,binary search,2000,817,0,https://codeforces.com/problemset/problem/163/B
+163A,Substring and Subsequence,dp,1700,1864,0,https://codeforces.com/problemset/problem/163/A
+162J,Brackets,*special problem,1800,61,0,https://codeforces.com/problemset/problem/162/J
+162I,Truncatable primes,*special problem,2000,45,0,https://codeforces.com/problemset/problem/162/I
+162H,Alternating case,*special problem,1800,59,0,https://codeforces.com/problemset/problem/162/H
+162G,Non-decimal sum,*special problem,2000,35,0,https://codeforces.com/problemset/problem/162/G
+162F,Factorial zeros,*special problem,1800,114,0,https://codeforces.com/problemset/problem/162/F
+162E,HQ9+,*special problem,1800,152,0,https://codeforces.com/problemset/problem/162/E
+162D,Remove digits,*special problem,1900,194,0,https://codeforces.com/problemset/problem/162/D
+162C,Prime factorization,*special problem,1800,123,0,https://codeforces.com/problemset/problem/162/C
+162B,Binary notation,*special problem,1800,280,0,https://codeforces.com/problemset/problem/162/B
+162A,Pentagonal numbers,"*special problem, implementation",1100,551,0,https://codeforces.com/problemset/problem/162/A
+161E,Polycarpus the Safecracker,"brute force, dp",2500,355,0,https://codeforces.com/problemset/problem/161/E
+161D,Distance in Tree,"dfs and similar, dp, trees",1800,6084,0,https://codeforces.com/problemset/problem/161/D
+161C,Abracadabra,divide and conquer,2400,432,0,https://codeforces.com/problemset/problem/161/C
+161B,Discounts,"constructive algorithms, greedy, sortings",1700,1639,0,https://codeforces.com/problemset/problem/161/B
+161A,Dress'em in Vests!,"binary search, brute force, greedy, two pointers",1300,3546,0,https://codeforces.com/problemset/problem/161/A
+160E,Buses and People,"binary search, data structures, sortings",2400,374,0,https://codeforces.com/problemset/problem/160/E
+160D,Edges in MST,"dfs and similar, dsu, graphs, sortings",2300,1213,0,https://codeforces.com/problemset/problem/160/D
+160C,Find Pair,"implementation, math, sortings",1700,2540,0,https://codeforces.com/problemset/problem/160/C
+160B,Unlucky Ticket,"greedy, sortings",1100,7851,0,https://codeforces.com/problemset/problem/160/B
+160A,Twins,"greedy, sortings",900,48499,0,https://codeforces.com/problemset/problem/160/A
+159E,Zebra Tower,"*special problem, data structures, greedy, sortings",1700,861,0,https://codeforces.com/problemset/problem/159/E
+159D,Palindrome pairs,"*special problem, brute force, dp, strings",1500,3421,0,https://codeforces.com/problemset/problem/159/D
+159C,String Manipulation 1.0,"*special problem, binary search, brute force, data structures, strings",1400,2240,0,https://codeforces.com/problemset/problem/159/C
+159B,Matchmaker,"*special problem, greedy, sortings",1100,2905,0,https://codeforces.com/problemset/problem/159/B
+159A,Friends or Not,"*special problem, greedy, implementation",1400,2111,0,https://codeforces.com/problemset/problem/159/A
+158E,Phone Talks,"*special problem, dp, sortings",1900,1298,0,https://codeforces.com/problemset/problem/158/E
+158D,Ice Sculptures,"*special problem, brute force, number theory",1300,5526,0,https://codeforces.com/problemset/problem/158/D
+158C,Cd and pwd commands,"*special problem, data structures, implementation",1400,6091,0,https://codeforces.com/problemset/problem/158/C
+158B,Taxi,"*special problem, greedy, implementation",1100,44780,0,https://codeforces.com/problemset/problem/158/B
+158A,Next Round,"*special problem, implementation",800,85251,0,https://codeforces.com/problemset/problem/158/A
+157B,Trace,"geometry, sortings",1000,7810,0,https://codeforces.com/problemset/problem/157/B
+157A,Game Outcome,brute force,800,5231,0,https://codeforces.com/problemset/problem/157/A
+156E,Mrs. Hudson's Pancakes,"brute force, dp",3000,125,0,https://codeforces.com/problemset/problem/156/E
+156D,Clues,"combinatorics, graphs",2500,563,0,https://codeforces.com/problemset/problem/156/D
+156C,Cipher,"combinatorics, dp",2000,1508,0,https://codeforces.com/problemset/problem/156/C
+156B,Suspects,"constructive algorithms, data structures, implementation",1600,1709,0,https://codeforces.com/problemset/problem/156/B
+156A,Message,brute force,1700,2541,0,https://codeforces.com/problemset/problem/156/A
+155B,Combination,"greedy, sortings",1100,6279,0,https://codeforces.com/problemset/problem/155/B
+155A,I_love_\%username\%,brute force,800,26539,0,https://codeforces.com/problemset/problem/155/A
+154E,Martian Colony,geometry,3000,69,0,https://codeforces.com/problemset/problem/154/E
+154D,Flatland Fencing,"games, math",2400,348,0,https://codeforces.com/problemset/problem/154/D
+154C,Double Profiles,"graphs, hashing, sortings",2300,1479,0,https://codeforces.com/problemset/problem/154/C
+154B,Colliders,"math, number theory",1600,2502,0,https://codeforces.com/problemset/problem/154/B
+154A,Hometask,greedy,1600,2953,0,https://codeforces.com/problemset/problem/154/A
+153E,Euclidean Distance,*special problem,2100,53,0,https://codeforces.com/problemset/problem/153/E
+153D,Date Change,*special problem,2000,60,0,https://codeforces.com/problemset/problem/153/D
+153C,Caesar Cipher,*special problem,2200,73,0,https://codeforces.com/problemset/problem/153/C
+153B,Binary notation,*special problem,1800,128,0,https://codeforces.com/problemset/problem/153/B
+153A,A + B,*special problem,1600,257,0,https://codeforces.com/problemset/problem/153/A
+152E,Garden,"bitmasks, dp, graphs, trees",2500,285,0,https://codeforces.com/problemset/problem/152/E
+152D,Frames,brute force,2600,207,0,https://codeforces.com/problemset/problem/152/D
+152C,Pocket Book,combinatorics,1400,6417,0,https://codeforces.com/problemset/problem/152/C
+152B,Steps,"binary search, implementation",1300,3619,0,https://codeforces.com/problemset/problem/152/B
+152A,Marks,implementation,900,9374,0,https://codeforces.com/problemset/problem/152/A
+151B,Phone Numbers,"implementation, strings",1200,4033,0,https://codeforces.com/problemset/problem/151/B
+151A,Soft Drinking,"implementation, math",800,19534,0,https://codeforces.com/problemset/problem/151/A
+150E,Freezing with Style,"binary search, data structures, divide and conquer, trees",3000,307,0,https://codeforces.com/problemset/problem/150/E
+150D,Mission Impassable,"dp, strings",2600,316,0,https://codeforces.com/problemset/problem/150/D
+150C,Smart Cheater,"data structures, math, probabilities",2200,505,0,https://codeforces.com/problemset/problem/150/C
+150B,Quantity of Strings,"combinatorics, dfs and similar, graphs, math",1600,2721,0,https://codeforces.com/problemset/problem/150/B
+150A,Win or Freeze,"games, math, number theory",1400,4879,0,https://codeforces.com/problemset/problem/150/A
+149E,Martian Strings,"string suffix structures, strings",2300,1333,0,https://codeforces.com/problemset/problem/149/E
+149D,Coloring Brackets,dp,1900,1365,0,https://codeforces.com/problemset/problem/149/D
+149C,Division into Teams,"greedy, math, sortings",1500,3852,0,https://codeforces.com/problemset/problem/149/C
+149B,Martian Clock,implementation,1600,1823,0,https://codeforces.com/problemset/problem/149/B
+149A,Business trip,"greedy, implementation, sortings",900,18660,0,https://codeforces.com/problemset/problem/149/A
+148E,Porcelain,dp,1900,2201,0,https://codeforces.com/problemset/problem/148/E
+148D,Bag of mice,"dp, games, math, probabilities",1800,3676,0,https://codeforces.com/problemset/problem/148/D
+148C,Terse princess,"constructive algorithms, greedy",1700,2256,0,https://codeforces.com/problemset/problem/148/C
+148B,Escape,"implementation, math",1500,3271,0,https://codeforces.com/problemset/problem/148/B
+148A,Insomnia cure,"constructive algorithms, implementation, math",800,35650,0,https://codeforces.com/problemset/problem/148/A
+147B,Smile House,"binary search, graphs, matrices",2500,502,0,https://codeforces.com/problemset/problem/147/B
+147A,Punctuation,"implementation, strings",1300,2290,0,https://codeforces.com/problemset/problem/147/A
+146B,Lucky Mask,"brute force, implementation",1300,3033,0,https://codeforces.com/problemset/problem/146/B
+146A,Lucky Ticket,implementation,800,8860,0,https://codeforces.com/problemset/problem/146/A
+145E,Lucky Queries,data structures,2400,1494,0,https://codeforces.com/problemset/problem/145/E
+145D,Lucky Pair,"combinatorics, data structures, implementation",2900,190,0,https://codeforces.com/problemset/problem/145/D
+145C,Lucky Subsequence,"combinatorics, dp, math",2100,1400,0,https://codeforces.com/problemset/problem/145/C
+145B,Lucky Number 2,constructive algorithms,1800,1674,0,https://codeforces.com/problemset/problem/145/B
+145A,Lucky Conversion,"greedy, implementation",1200,5268,0,https://codeforces.com/problemset/problem/145/A
+144E,Competition,"data structures, greedy",2200,390,0,https://codeforces.com/problemset/problem/144/E
+144D,Missile Silos,"data structures, dfs and similar, graphs, shortest paths",1900,2355,0,https://codeforces.com/problemset/problem/144/D
+144C,Anagram Search,"implementation, strings",1500,2966,0,https://codeforces.com/problemset/problem/144/C
+144B,Meeting,implementation,1300,3218,0,https://codeforces.com/problemset/problem/144/B
+144A,Arrival of the General,implementation,800,33828,0,https://codeforces.com/problemset/problem/144/A
+143B,Help Kingdom of Far Far Away 2,"implementation, strings",1200,3475,0,https://codeforces.com/problemset/problem/143/B
+143A,Help Vasilisa the Wise 2,"brute force, math",1000,6574,0,https://codeforces.com/problemset/problem/143/A
+142E,Help Greg the Dwarf 2,geometry,3000,44,0,https://codeforces.com/problemset/problem/142/E
+142D,Help Shrek and Donkey 2,games,2600,239,0,https://codeforces.com/problemset/problem/142/D
+142C,Help Caretaker,"brute force, dp",2300,641,0,https://codeforces.com/problemset/problem/142/C
+142B,Help General,"constructive algorithms, greedy, implementation",1800,1678,0,https://codeforces.com/problemset/problem/142/B
+142A,Help Farmer,"brute force, math",1600,2041,0,https://codeforces.com/problemset/problem/142/A
+141E,Clearing Up,"constructive algorithms, dp, dsu, graphs",2300,483,0,https://codeforces.com/problemset/problem/141/E
+141D,Take-off Ramps,"graphs, shortest paths",2300,514,0,https://codeforces.com/problemset/problem/141/D
+141C,Queue,"constructive algorithms, greedy, sortings",1800,1749,0,https://codeforces.com/problemset/problem/141/C
+141B,Hopscotch,"geometry, math",1400,3505,0,https://codeforces.com/problemset/problem/141/B
+141A,Amusing Joke,"implementation, sortings, strings",800,30561,0,https://codeforces.com/problemset/problem/141/A
+140F,New Year Snowflake,"geometry, sortings",2600,312,0,https://codeforces.com/problemset/problem/140/F
+140E,New Year Garland,"combinatorics, dp",2600,401,0,https://codeforces.com/problemset/problem/140/E
+140D,New Year Contest,"greedy, sortings",1800,1954,0,https://codeforces.com/problemset/problem/140/D
+140C,New Year Snowmen,"binary search, data structures, greedy",1800,3072,0,https://codeforces.com/problemset/problem/140/C
+140B,New Year Cards,"brute force, greedy, implementation",1800,1276,0,https://codeforces.com/problemset/problem/140/B
+140A,New Year Table,"geometry, math",1700,3443,0,https://codeforces.com/problemset/problem/140/A
+139B,Wallpaper,"implementation, math",1600,1098,0,https://codeforces.com/problemset/problem/139/B
+139A,Petr and Book,implementation,1000,10719,0,https://codeforces.com/problemset/problem/139/A
+138E,Hellish Constraints,"brute force, dp, two pointers",2900,105,0,https://codeforces.com/problemset/problem/138/E
+138D,World of Darkraft,"dp, games",2500,339,0,https://codeforces.com/problemset/problem/138/D
+138C,Mushroom Gnomes - 2,"binary search, data structures, probabilities, sortings",2200,673,0,https://codeforces.com/problemset/problem/138/C
+138B,Digits Permutations,greedy,1900,793,0,https://codeforces.com/problemset/problem/138/B
+138A,Literature Lesson,implementation,1600,1881,0,https://codeforces.com/problemset/problem/138/A
+137E,Last Chance,"data structures, implementation, strings",2000,926,0,https://codeforces.com/problemset/problem/137/E
+137D,Palindromes,"dp, strings",1900,1173,0,https://codeforces.com/problemset/problem/137/D
+137C,History,sortings,1500,4808,0,https://codeforces.com/problemset/problem/137/C
+137B,Permutation,greedy,1000,7517,0,https://codeforces.com/problemset/problem/137/B
+137A,Postcards and photos,implementation,900,4855,0,https://codeforces.com/problemset/problem/137/A
+136B,Ternary Logic,"implementation, math",1100,3341,0,https://codeforces.com/problemset/problem/136/B
+136A,Presents,implementation,800,42469,0,https://codeforces.com/problemset/problem/136/A
+135E,Weak Subsequence,combinatorics,3000,166,0,https://codeforces.com/problemset/problem/135/E
+135D,Cycle,"brute force, dfs and similar, implementation",2500,255,0,https://codeforces.com/problemset/problem/135/D
+135C,Zero-One,"constructive algorithms, games, greedy",1900,1085,0,https://codeforces.com/problemset/problem/135/C
+135B,Rectangle and Square,"brute force, geometry, math",1600,1886,0,https://codeforces.com/problemset/problem/135/B
+135A,Replacement,"greedy, implementation, sortings",1300,5269,0,https://codeforces.com/problemset/problem/135/A
+134C,Swaps,"constructive algorithms, graphs, greedy",2200,345,0,https://codeforces.com/problemset/problem/134/C
+134B,Pairs of Numbers,"brute force, dfs and similar, math, number theory",1900,1079,0,https://codeforces.com/problemset/problem/134/B
+134A,Average Numbers,"brute force, implementation",1200,2127,0,https://codeforces.com/problemset/problem/134/A
+133B,Unary,implementation,1200,5492,0,https://codeforces.com/problemset/problem/133/B
+133A,HQ9+,implementation,900,45781,0,https://codeforces.com/problemset/problem/133/A
+132E,Bits of merry old England,"flows, graphs",2700,319,0,https://codeforces.com/problemset/problem/132/E
+132D,Constants in the language of Shakespeare,"constructive algorithms, dp, greedy",2100,498,0,https://codeforces.com/problemset/problem/132/D
+132C,Logo Turtle,dp,1800,1671,0,https://codeforces.com/problemset/problem/132/C
+132B,Piet,implementation,2100,412,0,https://codeforces.com/problemset/problem/132/B
+132A,Turing Tape,implementation,1300,2391,0,https://codeforces.com/problemset/problem/132/A
+131F,Present to Mom,"binary search, two pointers",2000,479,0,https://codeforces.com/problemset/problem/131/F
+131E,Yet Another Task with Queens,sortings,1700,1522,0,https://codeforces.com/problemset/problem/131/E
+131D,Subway,"dfs and similar, graphs",1600,3335,0,https://codeforces.com/problemset/problem/131/D
+131C,The World is a Theatre,"combinatorics, math",1400,6323,0,https://codeforces.com/problemset/problem/131/C
+131B,Opposites Attract,"implementation, math",1200,5055,0,https://codeforces.com/problemset/problem/131/B
+131A,cAPS lOCK,"implementation, strings",1000,41667,0,https://codeforces.com/problemset/problem/131/A
+130J,Date calculation,*special problem,1800,94,0,https://codeforces.com/problemset/problem/130/J
+130I,Array sorting,"*special problem, sortings",2300,116,0,https://codeforces.com/problemset/problem/130/I
+130H,Balanced brackets,*special problem,1600,225,0,https://codeforces.com/problemset/problem/130/H
+130G,CAPS LOCK ON,*special problem,1700,192,0,https://codeforces.com/problemset/problem/130/G
+130F,Prime factorization,*special problem,1600,181,0,https://codeforces.com/problemset/problem/130/F
+130E,Tribonacci numbers,*special problem,1600,208,0,https://codeforces.com/problemset/problem/130/E
+130D,Exponentiation,*special problem,1500,283,0,https://codeforces.com/problemset/problem/130/D
+130C,Decimal sum,*special problem,1500,383,0,https://codeforces.com/problemset/problem/130/C
+130B,Gnikool Ssalg,"*special problem, implementation, strings",1400,380,0,https://codeforces.com/problemset/problem/130/B
+130A,Hexagonal numbers,"*special problem, implementation",900,682,0,https://codeforces.com/problemset/problem/130/A
+129B,Students and Shoelaces,"brute force, dfs and similar, graphs, implementation",1200,6361,0,https://codeforces.com/problemset/problem/129/B
+129A,Cookies,implementation,900,11170,0,https://codeforces.com/problemset/problem/129/A
+128E,Birthday,"geometry, math",2900,70,0,https://codeforces.com/problemset/problem/128/E
+128D,Numbers,"constructive algorithms, implementation",2000,840,0,https://codeforces.com/problemset/problem/128/D
+128C,Games with Rectangle,"combinatorics, dp",2000,1837,0,https://codeforces.com/problemset/problem/128/C
+128B,String,"brute force, constructive algorithms, hashing, implementation, string suffix structures, strings",2100,1654,0,https://codeforces.com/problemset/problem/128/B
+128A,Statues,dfs and similar,1500,2384,0,https://codeforces.com/problemset/problem/128/A
+127B,Canvas Frames,implementation,1000,4609,0,https://codeforces.com/problemset/problem/127/B
+127A,Wasted Time,geometry,900,6677,0,https://codeforces.com/problemset/problem/127/A
+126E,Pills,"brute force, flows",2900,52,0,https://codeforces.com/problemset/problem/126/E
+126D,Fibonacci Sums,"dp, math",2300,596,0,https://codeforces.com/problemset/problem/126/D
+126C,E-reader Display,"constructive algorithms, greedy",2000,560,0,https://codeforces.com/problemset/problem/126/C
+126B,Password,"binary search, dp, hashing, string suffix structures, strings",1700,8725,0,https://codeforces.com/problemset/problem/126/B
+126A,Hot Bath,"binary search, brute force, math",1900,1142,0,https://codeforces.com/problemset/problem/126/A
+125E,MST Company,"binary search, graphs",2400,537,0,https://codeforces.com/problemset/problem/125/E
+125D,Two progressions,"constructive algorithms, greedy",2200,268,0,https://codeforces.com/problemset/problem/125/D
+125C,Hobbits' Party,"constructive algorithms, greedy",1600,648,0,https://codeforces.com/problemset/problem/125/C
+125B,Simple XML,implementation,1000,1424,0,https://codeforces.com/problemset/problem/125/B
+125A,Measuring Lengths in Baden,math,1400,1862,0,https://codeforces.com/problemset/problem/125/A
+124B,Permutations,"brute force, combinatorics, implementation",1400,2384,0,https://codeforces.com/problemset/problem/124/B
+124A,The number of positions,math,1000,17070,0,https://codeforces.com/problemset/problem/124/A
+123E,Maze,"dfs and similar, dp, probabilities, trees",2500,355,0,https://codeforces.com/problemset/problem/123/E
+123D,String,string suffix structures,2300,670,0,https://codeforces.com/problemset/problem/123/D
+123C,Brackets,"combinatorics, dp, greedy",2300,453,0,https://codeforces.com/problemset/problem/123/C
+123B,Squares,math,1800,824,0,https://codeforces.com/problemset/problem/123/B
+123A,Prime Permutation,"implementation, number theory, strings",1300,2278,0,https://codeforces.com/problemset/problem/123/A
+122B,Lucky Substring,"brute force, implementation",1000,6899,0,https://codeforces.com/problemset/problem/122/B
+122A,Lucky Division,"brute force, number theory",1000,51238,0,https://codeforces.com/problemset/problem/122/A
+121E,Lucky Array,data structures,2400,903,0,https://codeforces.com/problemset/problem/121/E
+121D,Lucky Segments,"binary search, implementation, two pointers",2500,209,0,https://codeforces.com/problemset/problem/121/D
+121C,Lucky Permutation,"brute force, combinatorics, number theory",1900,984,0,https://codeforces.com/problemset/problem/121/C
+121B,Lucky Transformation,strings,1500,1943,0,https://codeforces.com/problemset/problem/121/B
+121A,Lucky Sum,implementation,1100,5060,0,https://codeforces.com/problemset/problem/121/A
+120J,Minimum Sum,"divide and conquer, geometry, sortings",1900,670,0,https://codeforces.com/problemset/problem/120/J
+120I,Luck is in Numbers,greedy,2200,263,0,https://codeforces.com/problemset/problem/120/I
+120H,Brevity is Soul of Wit,graph matchings,1800,930,0,https://codeforces.com/problemset/problem/120/H
+120G,Boom,implementation,1800,613,0,https://codeforces.com/problemset/problem/120/G
+120F,Spiders,"dp, greedy, trees",1400,2367,0,https://codeforces.com/problemset/problem/120/F
+120E,Put Knight!,"games, math",1400,1994,0,https://codeforces.com/problemset/problem/120/E
+120D,Three Sons,brute force,1400,1560,0,https://codeforces.com/problemset/problem/120/D
+120C,Winnie-the-Pooh and honey,"implementation, math",1100,2596,0,https://codeforces.com/problemset/problem/120/C
+120B,Quiz League,implementation,1100,2395,0,https://codeforces.com/problemset/problem/120/B
+120A,Elevator,"brute force, implementation, math",1000,3115,0,https://codeforces.com/problemset/problem/120/A
+119E,Alternative Reality,geometry,2400,71,0,https://codeforces.com/problemset/problem/119/E
+119D,String Transformation,"hashing, strings",2500,311,0,https://codeforces.com/problemset/problem/119/D
+119C,Education Reform,dp,2000,628,0,https://codeforces.com/problemset/problem/119/C
+119B,Before Exam,"constructive algorithms, implementation, sortings",1900,908,0,https://codeforces.com/problemset/problem/119/B
+119A,Epic Game,implementation,800,19308,0,https://codeforces.com/problemset/problem/119/A
+118E,Bertown roads,"dfs and similar, graphs",2000,2163,0,https://codeforces.com/problemset/problem/118/E
+118D,Caesar's Legions,dp,1700,9273,0,https://codeforces.com/problemset/problem/118/D
+118C,Fancy Number,"brute force, greedy, sortings, strings",1900,1773,0,https://codeforces.com/problemset/problem/118/C
+118B,Present from Lena,"constructive algorithms, implementation",1000,14671,0,https://codeforces.com/problemset/problem/118/B
+118A,String Task,"implementation, strings",1000,80602,0,https://codeforces.com/problemset/problem/118/A
+117E,Tree or not Tree,"data structures, divide and conquer, implementation, trees",2900,157,0,https://codeforces.com/problemset/problem/117/E
+117D,Not Quick Transformation,"divide and conquer, math",2500,285,0,https://codeforces.com/problemset/problem/117/D
+117C,Cycle,"dfs and similar, graphs",2000,1728,0,https://codeforces.com/problemset/problem/117/C
+117B,Very Interesting Game,"brute force, number theory",1800,1302,0,https://codeforces.com/problemset/problem/117/B
+117A,Elevator,"implementation, math",1300,1713,0,https://codeforces.com/problemset/problem/117/A
+116B,Little Pigs and Wolves,"greedy, implementation",1100,7926,0,https://codeforces.com/problemset/problem/116/B
+116A,Tram,implementation,800,51046,0,https://codeforces.com/problemset/problem/116/A
+115E,Linear Kingdom Races,"data structures, dp",2400,574,0,https://codeforces.com/problemset/problem/115/E
+115D,Unambiguous Arithmetic Expression,"dp, expression parsing",2600,222,0,https://codeforces.com/problemset/problem/115/D
+115C,Plumber,math,2200,500,0,https://codeforces.com/problemset/problem/115/C
+115B,Lawnmower,"greedy, sortings",1500,1896,0,https://codeforces.com/problemset/problem/115/B
+115A,Party,"dfs and similar, graphs, trees",900,17560,0,https://codeforces.com/problemset/problem/115/A
+114B,PFAST Inc.,"bitmasks, brute force, graphs",1500,2193,0,https://codeforces.com/problemset/problem/114/B
+114A,Cifera,math,1000,8528,0,https://codeforces.com/problemset/problem/114/A
+113E,Sleeping,"combinatorics, implementation, math",2700,84,0,https://codeforces.com/problemset/problem/113/E
+113D,Museum,"math, matrices, probabilities",2700,335,0,https://codeforces.com/problemset/problem/113/D
+113C,Double Happiness,"brute force, math, number theory",2200,861,0,https://codeforces.com/problemset/problem/113/C
+113B,Petr#,"brute force, data structures, hashing, strings",2000,1720,0,https://codeforces.com/problemset/problem/113/B
+113A,Grammar Lessons,"implementation, strings",1600,1665,0,https://codeforces.com/problemset/problem/113/A
+112B,Petya and Square,"implementation, math",1200,2936,0,https://codeforces.com/problemset/problem/112/B
+112A,Petya and Strings,"implementation, strings",800,71656,0,https://codeforces.com/problemset/problem/112/A
+111E,Petya and Rectangle,,2900,44,0,https://codeforces.com/problemset/problem/111/E
+111D,Petya and Coloring,"combinatorics, dp",2300,418,0,https://codeforces.com/problemset/problem/111/D
+111C,Petya and Spiders,"bitmasks, dp, dsu",2100,924,0,https://codeforces.com/problemset/problem/111/C
+111B,Petya and Divisors,"binary search, data structures, number theory",1900,2567,0,https://codeforces.com/problemset/problem/111/B
+111A,Petya and Inequiations,greedy,1400,3379,0,https://codeforces.com/problemset/problem/111/A
+110B,Lucky String,"constructive algorithms, strings",1100,5772,0,https://codeforces.com/problemset/problem/110/B
+110A,Nearly Lucky Number,implementation,800,46724,0,https://codeforces.com/problemset/problem/110/A
+109E,Lucky Interval,"brute force, math",2700,64,0,https://codeforces.com/problemset/problem/109/E
+109D,Lucky Sorting,"constructive algorithms, sortings",2000,496,0,https://codeforces.com/problemset/problem/109/D
+109C,Lucky Tree,"dp, dsu, trees",1900,1906,0,https://codeforces.com/problemset/problem/109/C
+109B,Lucky Probability,"brute force, probabilities",1900,1008,0,https://codeforces.com/problemset/problem/109/B
+109A,Lucky Sum of Digits,"brute force, implementation",1000,9284,0,https://codeforces.com/problemset/problem/109/A
+108B,Datatypes,"math, sortings",1400,1732,0,https://codeforces.com/problemset/problem/108/B
+108A,Palindromic Times,"implementation, strings",1000,5604,0,https://codeforces.com/problemset/problem/108/A
+107E,Darts,"geometry, probabilities",2700,94,0,https://codeforces.com/problemset/problem/107/E
+107D,Crime Management,"dp, graphs, matrices",2400,281,0,https://codeforces.com/problemset/problem/107/D
+107C,Arrangement,"bitmasks, dp",2400,263,0,https://codeforces.com/problemset/problem/107/C
+107B,Basketball Team,"combinatorics, dp, math, probabilities",1600,2161,0,https://codeforces.com/problemset/problem/107/B
+107A,Dorm Water Supply,"dfs and similar, graphs",1400,3043,0,https://codeforces.com/problemset/problem/107/A
+106E,Space Rescuers,"geometry, ternary search",2100,537,0,https://codeforces.com/problemset/problem/106/E
+106D,Treasure Island,"brute force, implementation",1700,1015,0,https://codeforces.com/problemset/problem/106/D
+106C,Buns,dp,1700,3234,0,https://codeforces.com/problemset/problem/106/C
+106B,Choosing Laptop,"brute force, implementation",1000,3563,0,https://codeforces.com/problemset/problem/106/B
+106A,Card Game,implementation,1000,4739,0,https://codeforces.com/problemset/problem/106/A
+105E,Lift and Throw,brute force,2500,146,0,https://codeforces.com/problemset/problem/105/E
+105D,Entertaining Geodetics,"brute force, dsu, implementation",2700,108,0,https://codeforces.com/problemset/problem/105/D
+105C,Item World,"brute force, implementation, sortings",2200,220,0,https://codeforces.com/problemset/problem/105/C
+105B,Dark Assembly,"brute force, probabilities",1800,688,0,https://codeforces.com/problemset/problem/105/B
+105A,Transmigration,implementation,1700,1510,0,https://codeforces.com/problemset/problem/105/A
+104A,Blackjack,implementation,800,7774,0,https://codeforces.com/problemset/problem/104/A
+103E,Buying Sets,"flows, graph matchings",2900,337,0,https://codeforces.com/problemset/problem/103/E
+103D,Time to Raid Cowavans,"brute force, data structures, sortings",2100,1183,0,https://codeforces.com/problemset/problem/103/D
+103C,Russian Roulette,"constructive algorithms, greedy",1900,742,0,https://codeforces.com/problemset/problem/103/C
+103B,Cthulhu,"dfs and similar, dsu, graphs",1500,5347,0,https://codeforces.com/problemset/problem/103/B
+103A,Testing Pants for Sadness,"greedy, implementation, math",1100,3956,0,https://codeforces.com/problemset/problem/103/A
+102B,Sum of Digits,implementation,1000,9750,0,https://codeforces.com/problemset/problem/102/B
+102A,Clothes,brute force,1200,2117,0,https://codeforces.com/problemset/problem/102/A
+101E,Candies and Stones,"divide and conquer, dp",2500,294,0,https://codeforces.com/problemset/problem/101/E
+101D,Castle,"dp, greedy, probabilities, sortings, trees",2300,385,0,https://codeforces.com/problemset/problem/101/D
+101C,Vectors,"implementation, math",2000,490,0,https://codeforces.com/problemset/problem/101/C
+101B,Buses,"binary search, data structures, dp",1700,1477,0,https://codeforces.com/problemset/problem/101/B
+101A,Homework,greedy,1200,2570,0,https://codeforces.com/problemset/problem/101/A
+100J,Interval Coloring,"*special problem, greedy, math",2400,40,0,https://codeforces.com/problemset/problem/100/J
+100I,Rotation,"*special problem, geometry, math",1500,183,0,https://codeforces.com/problemset/problem/100/I
+100H,Battleship,"*special problem, dfs and similar, implementation",2100,54,0,https://codeforces.com/problemset/problem/100/H
+100G,Name the album,"*special problem, data structures, implementation",1800,77,0,https://codeforces.com/problemset/problem/100/G
+100F,Polynom,"*special problem, implementation",1800,107,0,https://codeforces.com/problemset/problem/100/F
+100E,Lamps in a Line,"*special problem, math",1600,131,0,https://codeforces.com/problemset/problem/100/E
+100D,World of Mouth,"*special problem, strings",1500,243,0,https://codeforces.com/problemset/problem/100/D
+100C,A+B,"*special problem, implementation",1400,342,0,https://codeforces.com/problemset/problem/100/C
+100B,Friendly Numbers,"*special problem, implementation",1500,210,0,https://codeforces.com/problemset/problem/100/B
+100A,Carpeting the Room,"*special problem, implementation",1100,447,0,https://codeforces.com/problemset/problem/100/A
+99B,Help Chef Gerasim,"implementation, sortings",1300,1984,0,https://codeforces.com/problemset/problem/99/B
+99A,Help Far Away Kingdom,strings,800,3958,0,https://codeforces.com/problemset/problem/99/A
+98E,Help Shrek and Donkey,"dp, games, math, probabilities",2700,176,0,https://codeforces.com/problemset/problem/98/E
+98D,Help Monks,constructive algorithms,2500,147,0,https://codeforces.com/problemset/problem/98/D
+98C,Help Greg the Dwarf,"geometry, ternary search",2500,237,0,https://codeforces.com/problemset/problem/98/C
+98B,Help King,"implementation, probabilities, trees",2200,68,0,https://codeforces.com/problemset/problem/98/B
+98A,Help Victoria the Wise,"brute force, implementation",1700,987,0,https://codeforces.com/problemset/problem/98/A
+97E,Leaders,"dfs and similar, dsu, graphs, trees",2200,185,0,https://codeforces.com/problemset/problem/97/E
+97D,Robot in Basement,"bitmasks, brute force, implementation",2700,142,0,https://codeforces.com/problemset/problem/97/D
+97C,Winning Strategy,"binary search, graphs, math, shortest paths",2400,234,0,https://codeforces.com/problemset/problem/97/C
+97B,Superset,"constructive algorithms, divide and conquer",2300,529,0,https://codeforces.com/problemset/problem/97/B
+97A,Domino,"brute force, implementation",2400,186,0,https://codeforces.com/problemset/problem/97/A
+96B,Lucky Numbers (easy),"binary search, bitmasks, brute force",1300,7107,0,https://codeforces.com/problemset/problem/96/B
+96A,Football,"implementation, strings",900,62804,0,https://codeforces.com/problemset/problem/96/A
+95E,Lucky Country,"dp, dsu, graphs",2500,722,0,https://codeforces.com/problemset/problem/95/E
+95D,Horse Races,"dp, math",2500,264,0,https://codeforces.com/problemset/problem/95/D
+95C,Volleyball,shortest paths,1900,1784,0,https://codeforces.com/problemset/problem/95/C
+95B,Lucky Numbers,"dp, greedy",1800,859,0,https://codeforces.com/problemset/problem/95/B
+95A,Hockey,"implementation, strings",1600,1315,0,https://codeforces.com/problemset/problem/95/A
+94B,Friends,"graphs, implementation, math",1300,2614,0,https://codeforces.com/problemset/problem/94/B
+94A,Restoring Password,"implementation, strings",900,6367,0,https://codeforces.com/problemset/problem/94/A
+93E,Lostborn,"dp, math, number theory",2600,291,0,https://codeforces.com/problemset/problem/93/E
+93D,Flags,"dp, math, matrices",2500,257,0,https://codeforces.com/problemset/problem/93/D
+93C,Azembler,"brute force, implementation",2500,253,0,https://codeforces.com/problemset/problem/93/C
+93B,End of Exams,greedy,1900,712,0,https://codeforces.com/problemset/problem/93/B
+93A,Frames,implementation,1700,1577,0,https://codeforces.com/problemset/problem/93/A
+92B,Binary Number,greedy,1300,3155,0,https://codeforces.com/problemset/problem/92/B
+92A,Chips,"implementation, math",800,10641,0,https://codeforces.com/problemset/problem/92/A
+91E,Igloo Skyscraper,"data structures, geometry",2500,450,0,https://codeforces.com/problemset/problem/91/E
+91D,Grocer's Problem,"constructive algorithms, graphs, greedy",2600,211,0,https://codeforces.com/problemset/problem/91/D
+91C,Ski Base,"combinatorics, dsu, graphs",2300,652,0,https://codeforces.com/problemset/problem/91/C
+91B,Queue,"binary search, data structures",1500,3738,0,https://codeforces.com/problemset/problem/91/B
+91A,Newspaper Headline,"greedy, strings",1500,2340,0,https://codeforces.com/problemset/problem/91/A
+90B,African Crossword,"implementation, strings",1100,3208,0,https://codeforces.com/problemset/problem/90/B
+90A,Cableway,"greedy, math",1000,2895,0,https://codeforces.com/problemset/problem/90/A
+89E,Fire and Ice,greedy,2900,54,0,https://codeforces.com/problemset/problem/89/E
+89D,Space mines,geometry,2500,194,0,https://codeforces.com/problemset/problem/89/D
+89C,Chip Play,"brute force, data structures, implementation",2300,475,0,https://codeforces.com/problemset/problem/89/C
+89B,Widget Library,"dp, expression parsing, graphs, implementation",2300,462,0,https://codeforces.com/problemset/problem/89/B
+89A,Robbery,greedy,1800,1182,0,https://codeforces.com/problemset/problem/89/A
+88B,Keyboard,implementation,1500,1900,0,https://codeforces.com/problemset/problem/88/B
+88A,Chord,"brute force, implementation",1200,2611,0,https://codeforces.com/problemset/problem/88/A
+87E,Mogohu-Rea Idol,geometry,2600,150,0,https://codeforces.com/problemset/problem/87/E
+87D,Beautiful Road,"dfs and similar, dp, dsu, graphs, implementation, sortings, trees",2300,578,0,https://codeforces.com/problemset/problem/87/D
+87C,Interesting Game,"dp, games, math",2000,1036,0,https://codeforces.com/problemset/problem/87/C
+87B,Vasya and Types,"implementation, strings",1800,941,0,https://codeforces.com/problemset/problem/87/B
+87A,Trains,"implementation, math",1500,3084,0,https://codeforces.com/problemset/problem/87/A
+86E,Long sequence,"brute force, math, matrices",2700,143,0,https://codeforces.com/problemset/problem/86/E
+86D,Powerful array,"data structures, implementation, math, two pointers",2200,6268,0,https://codeforces.com/problemset/problem/86/D
+86C,Genetic engineering,"dp, string suffix structures, trees",2500,422,0,https://codeforces.com/problemset/problem/86/C
+86B,Tetris revisited,"constructive algorithms, graph matchings, greedy, math",2200,286,0,https://codeforces.com/problemset/problem/86/B
+86A,Reflection,math,1600,875,0,https://codeforces.com/problemset/problem/86/A
+85E,Guard Towers,"binary search, dsu, geometry, graphs, sortings",2600,492,0,https://codeforces.com/problemset/problem/85/E
+85D,Sum of Medians,"binary search, brute force, data structures, implementation",2300,1235,0,https://codeforces.com/problemset/problem/85/D
+85C,Petya and Tree,"binary search, dfs and similar, probabilities, sortings, trees",2200,459,0,https://codeforces.com/problemset/problem/85/C
+85B,Embassy Queue,"data structures, greedy",1800,842,0,https://codeforces.com/problemset/problem/85/B
+85A,Domino,"constructive algorithms, implementation",1300,1406,0,https://codeforces.com/problemset/problem/85/A
+84C,Biathlon,"binary search, implementation",1700,1041,0,https://codeforces.com/problemset/problem/84/C
+84A,Toy Army,"math, number theory",900,8919,0,https://codeforces.com/problemset/problem/84/A
+83E,Two Subsequences,"bitmasks, dp",2800,269,0,https://codeforces.com/problemset/problem/83/E
+83D,Numbers,"dp, math, number theory",2400,538,0,https://codeforces.com/problemset/problem/83/D
+83C,Track,"graphs, greedy, shortest paths",2400,334,0,https://codeforces.com/problemset/problem/83/C
+83B,Doctor,"binary search, math, sortings",1800,1288,0,https://codeforces.com/problemset/problem/83/B
+83A,Magical Array,math,1300,3729,0,https://codeforces.com/problemset/problem/83/A
+82E,Corridor,geometry,2600,184,0,https://codeforces.com/problemset/problem/82/E
+82D,Two out of Three,dp,2000,1200,0,https://codeforces.com/problemset/problem/82/D
+82C,General Mobilization,"data structures, dfs and similar, sortings",2000,700,0,https://codeforces.com/problemset/problem/82/C
+82B,Sets,"constructive algorithms, hashing, implementation",1700,1546,0,https://codeforces.com/problemset/problem/82/B
+82A,Double Cola,"implementation, math",1100,21011,0,https://codeforces.com/problemset/problem/82/A
+81E,Pairs,"dfs and similar, dp, dsu, graphs, implementation, trees",2700,188,0,https://codeforces.com/problemset/problem/81/E
+81D,Polycarp's Picture Gallery,"constructive algorithms, greedy",2100,537,0,https://codeforces.com/problemset/problem/81/D
+81C,Average Score,"greedy, math, sortings",1700,1292,0,https://codeforces.com/problemset/problem/81/C
+81B,Sequence Formatting,"implementation, strings",1700,1591,0,https://codeforces.com/problemset/problem/81/B
+81A,Plug-in,implementation,1400,5261,0,https://codeforces.com/problemset/problem/81/A
+80B,Depression,"geometry, math",1200,3078,0,https://codeforces.com/problemset/problem/80/B
+80A,Panoramix's Prediction,brute force,800,16071,0,https://codeforces.com/problemset/problem/80/A
+79E,Security System,math,2900,61,0,https://codeforces.com/problemset/problem/79/E
+79D,Password,"bitmasks, dp, shortest paths",2800,486,0,https://codeforces.com/problemset/problem/79/D
+79C,Beaver,"data structures, dp, greedy, hashing, strings, two pointers",1800,1224,0,https://codeforces.com/problemset/problem/79/C
+79B,Colorful Field,"implementation, sortings",1400,3180,0,https://codeforces.com/problemset/problem/79/B
+79A,Bus Game,greedy,1200,2774,0,https://codeforces.com/problemset/problem/79/A
+78E,Evacuation,"flows, graphs, shortest paths",2300,337,0,https://codeforces.com/problemset/problem/78/E
+78D,Archer's Shot,"binary search, geometry, math, two pointers",2300,219,0,https://codeforces.com/problemset/problem/78/D
+78C,Beaver Game,"dp, games, number theory",2000,1226,0,https://codeforces.com/problemset/problem/78/C
+78B,Easter Eggs,"constructive algorithms, implementation",1200,5435,0,https://codeforces.com/problemset/problem/78/B
+78A,Haiku,"implementation, strings",800,5673,0,https://codeforces.com/problemset/problem/78/A
+77E,Martian Food,geometry,2800,245,0,https://codeforces.com/problemset/problem/77/E
+77D,Domino Carpet,"dp, implementation",2300,231,0,https://codeforces.com/problemset/problem/77/D
+77C,Beavermuncher-0xFF,"dfs and similar, dp, dsu, greedy, trees",2100,718,0,https://codeforces.com/problemset/problem/77/C
+77B,Falling Anvils,"math, probabilities",1800,1873,0,https://codeforces.com/problemset/problem/77/B
+77A,Heroes,"brute force, implementation",1400,1417,0,https://codeforces.com/problemset/problem/77/A
+76F,Tourist,"binary search, data structures, dp",2300,402,0,https://codeforces.com/problemset/problem/76/F
+76E,Points,"implementation, math",1700,1186,0,https://codeforces.com/problemset/problem/76/E
+76D,Plus and xor,"dp, greedy, math",1700,1289,0,https://codeforces.com/problemset/problem/76/D
+76C,Mutation,"bitmasks, dp, math",2700,124,0,https://codeforces.com/problemset/problem/76/C
+76B,Mice,"greedy, two pointers",2100,300,0,https://codeforces.com/problemset/problem/76/B
+76A,Gift,"dsu, graphs, sortings, trees",2200,683,0,https://codeforces.com/problemset/problem/76/A
+75E,Ship's Shortest Path,"geometry, shortest paths",2400,213,0,https://codeforces.com/problemset/problem/75/E
+75D,Big Maximum Sum,"data structures, dp, greedy, implementation, math, trees",2000,1077,0,https://codeforces.com/problemset/problem/75/D
+75C,Modified GCD,"binary search, number theory",1600,5604,0,https://codeforces.com/problemset/problem/75/C
+75B,Facetook Priority Wall,"expression parsing, implementation, strings",1500,1898,0,https://codeforces.com/problemset/problem/75/B
+75A,Life Without Zeros,implementation,1000,11871,0,https://codeforces.com/problemset/problem/75/A
+74E,Shift It!,constructive algorithms,2800,101,0,https://codeforces.com/problemset/problem/74/E
+74D,Hanger,data structures,2400,296,0,https://codeforces.com/problemset/problem/74/D
+74C,Chessboard Billiard,"dfs and similar, dsu, graphs, number theory",2100,675,0,https://codeforces.com/problemset/problem/74/C
+74B,Train,"dp, games, greedy",1500,1150,0,https://codeforces.com/problemset/problem/74/B
+74A,Room Leader,implementation,1000,3313,0,https://codeforces.com/problemset/problem/74/A
+73F,Plane of Tanks,"brute force, geometry",2900,51,0,https://codeforces.com/problemset/problem/73/F
+73E,Morrowindows,"math, number theory",2400,238,0,https://codeforces.com/problemset/problem/73/E
+73D,FreeDiv,"dfs and similar, graphs, greedy",2200,411,0,https://codeforces.com/problemset/problem/73/D
+73C,LionAge II,dp,1800,1238,0,https://codeforces.com/problemset/problem/73/C
+73B,Need For Brake,"binary search, greedy, sortings",2000,386,0,https://codeforces.com/problemset/problem/73/B
+73A,The Elder Trolls IV: Oblivon,"greedy, math",1600,1026,0,https://codeforces.com/problemset/problem/73/A
+72I,Goofy Numbers,"*special problem, implementation",1500,256,0,https://codeforces.com/problemset/problem/72/I
+72H,Reverse It!,"*special problem, implementation",1600,200,0,https://codeforces.com/problemset/problem/72/H
+72G,Fibonacci army,"*special problem, dp",1000,704,0,https://codeforces.com/problemset/problem/72/G
+72F,Oil,"*special problem, greedy, math",1900,81,0,https://codeforces.com/problemset/problem/72/F
+72E,Ali goes shopping,"*special problem, brute force, strings",1800,119,0,https://codeforces.com/problemset/problem/72/E
+72D,Perse-script,"*special problem, expression parsing",2300,50,0,https://codeforces.com/problemset/problem/72/D
+72C,Extraordinarily Nice Numbers,"*special problem, math",1200,331,0,https://codeforces.com/problemset/problem/72/C
+72B,INI-file,"*special problem, implementation",2200,47,0,https://codeforces.com/problemset/problem/72/B
+72A,"Goshtasp, Vishtasp and Eidi","*special problem, greedy, math",1800,127,0,https://codeforces.com/problemset/problem/72/A
+71E,Nuclear Fusion,"bitmasks, dp",2200,370,0,https://codeforces.com/problemset/problem/71/E
+71D,Solitaire,"brute force, implementation",2200,390,0,https://codeforces.com/problemset/problem/71/D
+71C,Round Table Knights,"dp, math, number theory",1600,3665,0,https://codeforces.com/problemset/problem/71/C
+71B,Progress Bar,"implementation, math",1300,2993,0,https://codeforces.com/problemset/problem/71/B
+71A,Way Too Long Words,strings,800,114573,0,https://codeforces.com/problemset/problem/71/A
+70E,Information Reform,"dp, implementation, trees",2700,287,0,https://codeforces.com/problemset/problem/70/E
+70D,Professor's task,"data structures, geometry",2700,492,0,https://codeforces.com/problemset/problem/70/D
+70C,Lucky Tickets,"binary search, data structures, sortings, two pointers",2200,438,0,https://codeforces.com/problemset/problem/70/C
+70B,Text Messaging,"expression parsing, greedy, strings",1600,1354,0,https://codeforces.com/problemset/problem/70/B
+70A,Cookies,math,1300,2526,0,https://codeforces.com/problemset/problem/70/A
+69E,Subsegments,"data structures, implementation",1800,2435,0,https://codeforces.com/problemset/problem/69/E
+69D,Dot,"dp, games",1900,596,0,https://codeforces.com/problemset/problem/69/D
+69C,Game,implementation,2000,472,0,https://codeforces.com/problemset/problem/69/C
+69B,Bets,"greedy, implementation",1200,2115,0,https://codeforces.com/problemset/problem/69/B
+69A,Young Physicist,"implementation, math",1000,56014,0,https://codeforces.com/problemset/problem/69/A
+68E,Contact,geometry,2900,44,0,https://codeforces.com/problemset/problem/68/E
+68D,Half-decay tree,"data structures, divide and conquer, dp, math, probabilities",2500,286,0,https://codeforces.com/problemset/problem/68/D
+68C,Synchrophasotron,brute force,2200,265,0,https://codeforces.com/problemset/problem/68/C
+68B,Energy exchange,binary search,1600,2101,0,https://codeforces.com/problemset/problem/68/B
+68A,Irrational problem,"implementation, number theory",1100,3258,0,https://codeforces.com/problemset/problem/68/A
+67E,Save the City!,geometry,2500,229,0,https://codeforces.com/problemset/problem/67/E
+67D,Optical Experiment,"binary search, data structures, dp",1900,930,0,https://codeforces.com/problemset/problem/67/D
+67C,Sequence of Balls,dp,2600,319,0,https://codeforces.com/problemset/problem/67/C
+67B,Restoration of the Permutation,greedy,1800,609,0,https://codeforces.com/problemset/problem/67/B
+67A,Partial Teacher,"dp, graphs, greedy, implementation",1800,1411,0,https://codeforces.com/problemset/problem/67/A
+66E,Petya and Post,"data structures, dp",2000,489,0,https://codeforces.com/problemset/problem/66/E
+66D,Petya and His Friends,"constructive algorithms, math, number theory",1700,1941,0,https://codeforces.com/problemset/problem/66/D
+66C,Petya and File System,"data structures, implementation",1800,801,0,https://codeforces.com/problemset/problem/66/C
+66B,Petya and Countryside,"brute force, implementation",1100,8450,0,https://codeforces.com/problemset/problem/66/B
+66A,Petya and Java,"implementation, strings",1300,4301,0,https://codeforces.com/problemset/problem/66/A
+65E,Harry Potter and Moving Staircases,"dfs and similar, implementation",2900,52,0,https://codeforces.com/problemset/problem/65/E
+65D,Harry Potter and the Sorting Hat,"brute force, dfs and similar, hashing",2200,352,0,https://codeforces.com/problemset/problem/65/D
+65C,Harry Potter and the Golden Snitch,"binary search, geometry",2100,674,0,https://codeforces.com/problemset/problem/65/C
+65B,Harry Potter and the History of Magic,"brute force, greedy, implementation",1700,1060,0,https://codeforces.com/problemset/problem/65/B
+65A,Harry Potter and Three Spells,"implementation, math",1800,1358,0,https://codeforces.com/problemset/problem/65/A
+64I,Sort the Table,"*special problem, sortings",2400,61,0,https://codeforces.com/problemset/problem/64/I
+64H,Table Bowling,"*special problem, sortings",2300,80,0,https://codeforces.com/problemset/problem/64/H
+64G,Path Canonization,*special problem,2200,91,0,https://codeforces.com/problemset/problem/64/G
+64F,Domain,"*special problem, expression parsing",2000,138,0,https://codeforces.com/problemset/problem/64/F
+64E,Prime Segment,"*special problem, brute force",1800,178,0,https://codeforces.com/problemset/problem/64/E
+64D,Presents,"*special problem, greedy",1800,223,0,https://codeforces.com/problemset/problem/64/D
+64C,Table,"*special problem, greedy, implementation, math",1600,250,0,https://codeforces.com/problemset/problem/64/C
+64B,Expression,"*special problem, expression parsing",1500,397,0,https://codeforces.com/problemset/problem/64/B
+64A,Factorial,"*special problem, implementation",1300,578,0,https://codeforces.com/problemset/problem/64/A
+63E,Sweets Game,"bitmasks, dfs and similar, dp, games, implementation",2000,490,0,https://codeforces.com/problemset/problem/63/E
+63D,Dividing Island,constructive algorithms,1900,755,0,https://codeforces.com/problemset/problem/63/D
+63C,Bulls and Cows,"brute force, implementation",1700,1122,0,https://codeforces.com/problemset/problem/63/C
+63B,Settlers' Training,implementation,1200,2891,0,https://codeforces.com/problemset/problem/63/B
+63A,Sinking Ship,"implementation, sortings, strings",900,6501,0,https://codeforces.com/problemset/problem/63/A
+62E,World Evil,"dp, flows",2700,136,0,https://codeforces.com/problemset/problem/62/E
+62D,Wormhouse,"dfs and similar, graphs",2300,268,0,https://codeforces.com/problemset/problem/62/D
+62C,Inquisition,"geometry, implementation, sortings",2300,212,0,https://codeforces.com/problemset/problem/62/C
+62B,Tyndex.Brome,"binary search, implementation",1800,1018,0,https://codeforces.com/problemset/problem/62/B
+62A,A Student's Dream,"greedy, math",1300,2484,0,https://codeforces.com/problemset/problem/62/A
+61E,Enemy is weak,"data structures, trees",1900,4552,0,https://codeforces.com/problemset/problem/61/E
+61D,Eternal Victory,"dfs and similar, graphs, greedy, shortest paths, trees",1800,3260,0,https://codeforces.com/problemset/problem/61/D
+61C,Capture Valerian,math,2000,539,0,https://codeforces.com/problemset/problem/61/C
+61B,Hard Work,strings,1300,2633,0,https://codeforces.com/problemset/problem/61/B
+61A,Ultra-Fast Mathematician,implementation,800,36971,0,https://codeforces.com/problemset/problem/61/A
+60E,Mushroom Gnomes,"math, matrices",2600,220,0,https://codeforces.com/problemset/problem/60/E
+60D,Savior,"brute force, dsu, math",2500,238,0,https://codeforces.com/problemset/problem/60/D
+60C,Mushroom Strife,"brute force, dfs and similar",2100,425,0,https://codeforces.com/problemset/problem/60/C
+60B,Serial Time!,"dfs and similar, dsu",1400,2869,0,https://codeforces.com/problemset/problem/60/B
+60A,Where Are My Flakes?,"implementation, two pointers",1300,2479,0,https://codeforces.com/problemset/problem/60/A
+59E,Shortest Path,"graphs, shortest paths",2000,1172,0,https://codeforces.com/problemset/problem/59/E
+59D,Team Arrangement,"constructive algorithms, greedy, implementation",2000,433,0,https://codeforces.com/problemset/problem/59/D
+59C,Title,expression parsing,1600,1329,0,https://codeforces.com/problemset/problem/59/C
+59B,Fortune Telling,"implementation, number theory",1200,3762,0,https://codeforces.com/problemset/problem/59/B
+59A,Word,"implementation, strings",800,46150,0,https://codeforces.com/problemset/problem/59/A
+58E,Expression,dp,2400,188,0,https://codeforces.com/problemset/problem/58/E
+58D,Calendar,"greedy, strings",2000,497,0,https://codeforces.com/problemset/problem/58/D
+58C,Trees,brute force,1800,1310,0,https://codeforces.com/problemset/problem/58/C
+58B,Coins,greedy,1300,6576,0,https://codeforces.com/problemset/problem/58/B
+58A,Chat room,"greedy, strings",1000,51700,0,https://codeforces.com/problemset/problem/58/A
+57E,Chess,"math, shortest paths",3000,137,0,https://codeforces.com/problemset/problem/57/E
+57D,Journey,"dp, math",2500,248,0,https://codeforces.com/problemset/problem/57/D
+57C,Array,"combinatorics, math",1900,1249,0,https://codeforces.com/problemset/problem/57/C
+57B,Martian Architecture,implementation,1600,813,0,https://codeforces.com/problemset/problem/57/B
+57A,Square Earth?,"dfs and similar, greedy, implementation",1300,1982,0,https://codeforces.com/problemset/problem/57/A
+56E,Domino Principle,"binary search, data structures, sortings",2200,1116,0,https://codeforces.com/problemset/problem/56/E
+56D,Changing a String,dp,2100,809,0,https://codeforces.com/problemset/problem/56/D
+56C,Corporation Mail,"data structures, expression parsing, implementation",1700,825,0,https://codeforces.com/problemset/problem/56/C
+56B,Spoilt Permutation,implementation,1300,2226,0,https://codeforces.com/problemset/problem/56/B
+56A,Bar,implementation,1000,4611,0,https://codeforces.com/problemset/problem/56/A
+55E,Very simple problem,"geometry, two pointers",2500,440,0,https://codeforces.com/problemset/problem/55/E
+55D,Beautiful numbers,"dp, number theory",2500,1725,0,https://codeforces.com/problemset/problem/55/D
+55C,Pie or die,games,1900,1042,0,https://codeforces.com/problemset/problem/55/C
+55B,Smallest number,brute force,1600,1419,0,https://codeforces.com/problemset/problem/55/B
+55A,Flea travel,"implementation, math",1200,2133,0,https://codeforces.com/problemset/problem/55/A
+54E,Vacuum Сleaner,geometry,2700,131,0,https://codeforces.com/problemset/problem/54/E
+54D,Writing a Song,"brute force, dp, strings",2100,312,0,https://codeforces.com/problemset/problem/54/D
+54C,First Digit Law,"dp, math, probabilities",2000,736,0,https://codeforces.com/problemset/problem/54/C
+54B,Cutting Jigsaw Puzzle,"hashing, implementation",1800,558,0,https://codeforces.com/problemset/problem/54/B
+54A,Presents,implementation,1300,1444,0,https://codeforces.com/problemset/problem/54/A
+53E,Dead Ends,"bitmasks, dp",2500,519,0,https://codeforces.com/problemset/problem/53/E
+53D,Physical Education,sortings,1500,1154,0,https://codeforces.com/problemset/problem/53/D
+53C,Little Frog,constructive algorithms,1200,3715,0,https://codeforces.com/problemset/problem/53/C
+53B,Blog Photo,"binary search, implementation",1700,847,0,https://codeforces.com/problemset/problem/53/B
+53A,Autocomplete,implementation,1100,2840,0,https://codeforces.com/problemset/problem/53/A
+52C,Circular RMQ,data structures,2200,3809,0,https://codeforces.com/problemset/problem/52/C
+52B,Right Triangles,combinatorics,1600,1194,0,https://codeforces.com/problemset/problem/52/B
+52A,123-sequence,implementation,900,3302,0,https://codeforces.com/problemset/problem/52/A
+51F,Caterpillar,"dfs and similar, dp, graphs, trees",2800,304,0,https://codeforces.com/problemset/problem/51/F
+51E,Pentagon,"combinatorics, graphs, matrices",2400,243,0,https://codeforces.com/problemset/problem/51/E
+51D,Geometrical problem,implementation,2200,319,0,https://codeforces.com/problemset/problem/51/D
+51C,Three Base Stations,"binary search, greedy",1800,969,0,https://codeforces.com/problemset/problem/51/C
+51B,bHTML Tables Analisys,expression parsing,1700,704,0,https://codeforces.com/problemset/problem/51/B
+51A,Cheaterius's Problem,implementation,1300,1333,0,https://codeforces.com/problemset/problem/51/A
+50E,Square Equation Roots,math,2300,259,0,https://codeforces.com/problemset/problem/50/E
+50D,Bombing,"binary search, dp, probabilities",2100,449,0,https://codeforces.com/problemset/problem/50/D
+50C,Happy Farm 5,geometry,2000,547,0,https://codeforces.com/problemset/problem/50/C
+50B,Choosing Symbol Pairs,strings,1500,3606,0,https://codeforces.com/problemset/problem/50/B
+50A,Domino piling,"greedy, math",800,76361,0,https://codeforces.com/problemset/problem/50/A
+49E,Common ancestor,dp,2300,436,0,https://codeforces.com/problemset/problem/49/E
+49D,Game,"brute force, dp, implementation",1800,1239,0,https://codeforces.com/problemset/problem/49/D
+49C,Disposition,"constructive algorithms, math",1700,1075,0,https://codeforces.com/problemset/problem/49/C
+49B,Sum,math,1500,1649,0,https://codeforces.com/problemset/problem/49/B
+49A,Sleuth,implementation,800,6716,0,https://codeforces.com/problemset/problem/49/A
+48H,Black and White,constructive algorithms,2800,79,0,https://codeforces.com/problemset/problem/48/H
+48G,Galaxy Union,"dp, trees, two pointers",2700,123,0,https://codeforces.com/problemset/problem/48/G
+48F,Snow sellers,"greedy, sortings",2800,69,0,https://codeforces.com/problemset/problem/48/F
+48E,Ivan the Fool VS Gorynych the Dragon,"dp, games, graphs",2100,353,0,https://codeforces.com/problemset/problem/48/E
+48D,Permutations,greedy,1500,1464,0,https://codeforces.com/problemset/problem/48/D
+48C,The Race,math,1800,559,0,https://codeforces.com/problemset/problem/48/C
+48B,Land Lot,"brute force, implementation",1200,1709,0,https://codeforces.com/problemset/problem/48/B
+48A,Rock-paper-scissors,"implementation, schedules",900,3161,0,https://codeforces.com/problemset/problem/48/A
+47E,Cannon,"data structures, geometry, sortings",2200,252,0,https://codeforces.com/problemset/problem/47/E
+47D,Safe,brute force,2200,462,0,https://codeforces.com/problemset/problem/47/D
+47C,Crossword,implementation,2000,449,0,https://codeforces.com/problemset/problem/47/C
+47B,Coins,implementation,1200,4878,0,https://codeforces.com/problemset/problem/47/B
+47A,Triangular numbers,"brute force, math",800,7396,0,https://codeforces.com/problemset/problem/47/A
+46G,Emperor's Problem,geometry,2500,64,0,https://codeforces.com/problemset/problem/46/G
+46F,Hercule Poirot Problem,"dsu, graphs",2300,241,0,https://codeforces.com/problemset/problem/46/F
+46E,Comb,"data structures, dp",1900,642,0,https://codeforces.com/problemset/problem/46/E
+46D,Parking Lot,"data structures, implementation",1800,773,0,https://codeforces.com/problemset/problem/46/D
+46C,Hamsters and Tigers,two pointers,1600,1518,0,https://codeforces.com/problemset/problem/46/C
+46B,T-shirts from Sponsor,implementation,1100,2118,0,https://codeforces.com/problemset/problem/46/B
+46A,Ball Game,"brute force, implementation",800,4976,0,https://codeforces.com/problemset/problem/46/A
+45J,Planting Trees,constructive algorithms,1800,583,0,https://codeforces.com/problemset/problem/45/J
+45I,TCMCF+++,greedy,1400,1107,0,https://codeforces.com/problemset/problem/45/I
+45H,Road Problem,graphs,2100,104,0,https://codeforces.com/problemset/problem/45/H
+45G,Prime Problem,number theory,2200,466,0,https://codeforces.com/problemset/problem/45/G
+45F,Goats and Wolves,greedy,2500,68,0,https://codeforces.com/problemset/problem/45/F
+45E,Director,"constructive algorithms, greedy",2000,399,0,https://codeforces.com/problemset/problem/45/E
+45D,Event Dates,"greedy, meet-in-the-middle, sortings",1900,975,0,https://codeforces.com/problemset/problem/45/D
+45C,Dancing Lessons,data structures,1900,571,0,https://codeforces.com/problemset/problem/45/C
+45B,School,"dp, dsu",2200,168,0,https://codeforces.com/problemset/problem/45/B
+45A,Codecraft III,implementation,900,2531,0,https://codeforces.com/problemset/problem/45/A
+44J,Triminoes,"constructive algorithms, greedy",2000,419,0,https://codeforces.com/problemset/problem/44/J
+44I,Toys,"brute force, combinatorics",2300,139,0,https://codeforces.com/problemset/problem/44/I
+44H,Phone Number,dp,1700,958,0,https://codeforces.com/problemset/problem/44/H
+44G,Shooting Gallery,"data structures, implementation",2500,121,0,https://codeforces.com/problemset/problem/44/G
+44F,BerPaint,"geometry, graphs",2700,43,0,https://codeforces.com/problemset/problem/44/F
+44E,Anfisa the Monkey,dp,1400,2397,0,https://codeforces.com/problemset/problem/44/E
+44D,Hyperdrive,math,1800,532,0,https://codeforces.com/problemset/problem/44/D
+44C,Holidays,implementation,1300,1475,0,https://codeforces.com/problemset/problem/44/C
+44B,Cola,implementation,1500,1213,0,https://codeforces.com/problemset/problem/44/B
+44A,Indian Summer,implementation,900,3135,0,https://codeforces.com/problemset/problem/44/A
+43E,Race,"brute force, implementation, two pointers",2300,272,0,https://codeforces.com/problemset/problem/43/E
+43D,Journey,"brute force, constructive algorithms, implementation",2000,839,0,https://codeforces.com/problemset/problem/43/D
+43C,Lucky Tickets,greedy,1300,2892,0,https://codeforces.com/problemset/problem/43/C
+43B,Letter,"implementation, strings",1100,6170,0,https://codeforces.com/problemset/problem/43/B
+43A,Football,strings,1000,17471,0,https://codeforces.com/problemset/problem/43/A
+42E,Baldman and the military,"dfs and similar, graphs, trees",2700,142,0,https://codeforces.com/problemset/problem/42/E
+42D,Strange town,"constructive algorithms, math",2300,287,0,https://codeforces.com/problemset/problem/42/D
+42C,Safe cracking,"brute force, constructive algorithms",2200,351,0,https://codeforces.com/problemset/problem/42/C
+42B,Game of chess unfinished,implementation,1700,689,0,https://codeforces.com/problemset/problem/42/B
+42A,Guilty --- to the kitchen!,"greedy, implementation",1400,1890,0,https://codeforces.com/problemset/problem/42/A
+41E,3-cycles,"constructive algorithms, graphs, greedy",1900,1234,0,https://codeforces.com/problemset/problem/41/E
+41D,Pawn,dp,1900,1051,0,https://codeforces.com/problemset/problem/41/D
+41C,Email address,"expression parsing, implementation",1300,2342,0,https://codeforces.com/problemset/problem/41/C
+41B,Martian Dollar,brute force,1400,2198,0,https://codeforces.com/problemset/problem/41/B
+41A,Translation,"implementation, strings",800,45407,0,https://codeforces.com/problemset/problem/41/A
+40E,Number Table,combinatorics,2500,359,0,https://codeforces.com/problemset/problem/40/E
+40D,Interesting Sequence,math,2600,86,0,https://codeforces.com/problemset/problem/40/D
+40C,Berland Square,"implementation, math",2300,189,0,https://codeforces.com/problemset/problem/40/C
+40B,Repaintings,math,1600,769,0,https://codeforces.com/problemset/problem/40/B
+40A,Find Color,"constructive algorithms, geometry, implementation, math",1300,1964,0,https://codeforces.com/problemset/problem/40/A
+39K,Testing,,2600,52,0,https://codeforces.com/problemset/problem/39/K
+39J,Spelling Check,"hashing, implementation, strings",1500,1515,0,https://codeforces.com/problemset/problem/39/J
+39I,Tram,,2500,85,0,https://codeforces.com/problemset/problem/39/I
+39H,Multiplication Table,implementation,1300,1461,0,https://codeforces.com/problemset/problem/39/H
+39G,Inverse Function,implementation,2400,82,0,https://codeforces.com/problemset/problem/39/G
+39F,Pacifist frogs,implementation,1300,967,0,https://codeforces.com/problemset/problem/39/F
+39E,What Has Dirichlet Got to Do with That?,"dp, games",2000,607,0,https://codeforces.com/problemset/problem/39/E
+39D,Cubical Planet,math,1100,2085,0,https://codeforces.com/problemset/problem/39/D
+39C,Moon Craters,"dp, sortings",2100,395,0,https://codeforces.com/problemset/problem/39/C
+39B,Company Income Growth,greedy,1300,1585,0,https://codeforces.com/problemset/problem/39/B
+39A,C*++ Calculations,"expression parsing, greedy",2000,508,0,https://codeforces.com/problemset/problem/39/A
+38H,The Great Marathon,dp,2400,158,0,https://codeforces.com/problemset/problem/38/H
+38G,Queue,data structures,2300,438,0,https://codeforces.com/problemset/problem/38/G
+38F,Smart Boy,"dp, games, strings",2100,263,0,https://codeforces.com/problemset/problem/38/F
+38E,Let's Go Rolling!,"dp, sortings",1800,1442,0,https://codeforces.com/problemset/problem/38/E
+38D,Vasya the Architect,implementation,1900,375,0,https://codeforces.com/problemset/problem/38/D
+38C,Blinds,brute force,1400,1483,0,https://codeforces.com/problemset/problem/38/C
+38B,Chess,"brute force, implementation, math",1200,2264,0,https://codeforces.com/problemset/problem/38/B
+38A,Army,implementation,800,11253,0,https://codeforces.com/problemset/problem/38/A
+37E,Trial for Chief,"graphs, greedy, shortest paths",2600,364,0,https://codeforces.com/problemset/problem/37/E
+37D,Lesson Timetable,"combinatorics, dp, math",2300,287,0,https://codeforces.com/problemset/problem/37/D
+37C,Old Berland Language,"data structures, greedy, trees",1900,846,0,https://codeforces.com/problemset/problem/37/C
+37B,Computer Game,"greedy, implementation",1800,697,0,https://codeforces.com/problemset/problem/37/B
+37A,Towers,sortings,1000,13958,0,https://codeforces.com/problemset/problem/37/A
+36E,Two Paths,"constructive algorithms, dsu, graphs, implementation",2600,250,0,https://codeforces.com/problemset/problem/36/E
+36D,New Game with a Chess Piece,games,2300,408,0,https://codeforces.com/problemset/problem/36/D
+36C,Bowls,"geometry, implementation",2200,216,0,https://codeforces.com/problemset/problem/36/C
+36B,Fractal,implementation,1600,976,0,https://codeforces.com/problemset/problem/36/B
+36A,Extra-terrestrial Intelligence,implementation,1300,1816,0,https://codeforces.com/problemset/problem/36/A
+35E,Parade,"data structures, sortings",2100,505,0,https://codeforces.com/problemset/problem/35/E
+35D,Animals,"dp, greedy",1700,1798,0,https://codeforces.com/problemset/problem/35/D
+35C,Fire Again,"brute force, dfs and similar, shortest paths",1500,3185,0,https://codeforces.com/problemset/problem/35/C
+35B,Warehouse,implementation,1700,782,0,https://codeforces.com/problemset/problem/35/B
+35A,Shell Game,implementation,1000,3653,0,https://codeforces.com/problemset/problem/35/A
+34E,Collisions,"brute force, implementation, math",2000,454,0,https://codeforces.com/problemset/problem/34/E
+34D,Road Map,"dfs and similar, graphs",1600,2827,0,https://codeforces.com/problemset/problem/34/D
+34C,Page Numbers,"expression parsing, implementation, sortings, strings",1300,2661,0,https://codeforces.com/problemset/problem/34/C
+34B,Sale,"greedy, sortings",900,17357,0,https://codeforces.com/problemset/problem/34/B
+34A,Reconnaissance 2,implementation,800,10800,0,https://codeforces.com/problemset/problem/34/A
+33E,Helper,,2600,87,0,https://codeforces.com/problemset/problem/33/E
+33D,Knights,"geometry, graphs, shortest paths, sortings",2000,789,0,https://codeforces.com/problemset/problem/33/D
+33C,Wonderful Randomized Sum,greedy,1800,1667,0,https://codeforces.com/problemset/problem/33/C
+33B,String Problem,shortest paths,1800,1885,0,https://codeforces.com/problemset/problem/33/B
+33A,What is for dinner?,"greedy, implementation",1200,2367,0,https://codeforces.com/problemset/problem/33/A
+32E,Hide-and-Seek,"geometry, implementation",2400,242,0,https://codeforces.com/problemset/problem/32/E
+32D,Constellation,implementation,1600,833,0,https://codeforces.com/problemset/problem/32/D
+32C,Flea,math,1700,1222,0,https://codeforces.com/problemset/problem/32/C
+32B,Borze,"expression parsing, implementation",800,15620,0,https://codeforces.com/problemset/problem/32/B
+32A,Reconnaissance,brute force,800,5190,0,https://codeforces.com/problemset/problem/32/A
+31E,TV Game,dp,2400,686,0,https://codeforces.com/problemset/problem/31/E
+31D,Chocolate,"dfs and similar, implementation",2000,636,0,https://codeforces.com/problemset/problem/31/D
+31C,Schedule,implementation,1700,1194,0,https://codeforces.com/problemset/problem/31/C
+31B,Sysadmin Bob,"greedy, implementation, strings",1500,2417,0,https://codeforces.com/problemset/problem/31/B
+31A,Worms Evolution,implementation,1200,5061,0,https://codeforces.com/problemset/problem/31/A
+30E,Tricky and Clever Password,"binary search, constructive algorithms, data structures, greedy, hashing, strings",2800,391,0,https://codeforces.com/problemset/problem/30/E
+30D,King's Problem?,"geometry, greedy",2600,302,0,https://codeforces.com/problemset/problem/30/D
+30C,Shooting Gallery,"dp, probabilities",1800,1202,0,https://codeforces.com/problemset/problem/30/C
+30B,Codeforces World Finals,implementation,1700,807,0,https://codeforces.com/problemset/problem/30/B
+30A,Accounting,"brute force, math",1400,2014,0,https://codeforces.com/problemset/problem/30/A
+29E,Quarrel,"graphs, shortest paths",2400,464,0,https://codeforces.com/problemset/problem/29/E
+29D,Ant on the Tree,"constructive algorithms, dfs and similar, trees",2000,1282,0,https://codeforces.com/problemset/problem/29/D
+29C,Mail Stamps,"data structures, dfs and similar, graphs, implementation",1700,2436,0,https://codeforces.com/problemset/problem/29/C
+29B,Traffic Lights,implementation,1500,1686,0,https://codeforces.com/problemset/problem/29/B
+29A,Spit Problem,brute force,1000,3845,0,https://codeforces.com/problemset/problem/29/A
+28E,DravDe saves the world,"geometry, math",2800,52,0,https://codeforces.com/problemset/problem/28/E
+28D,"Don't fear, DravDe is kind","binary search, data structures, dp, hashing",2400,404,0,https://codeforces.com/problemset/problem/28/D
+28C,Bath Queue,"combinatorics, dp, probabilities",2200,573,0,https://codeforces.com/problemset/problem/28/C
+28B,pSort,"dfs and similar, dsu, graphs",1600,2277,0,https://codeforces.com/problemset/problem/28/B
+28A,Bender Problem,implementation,1600,576,0,https://codeforces.com/problemset/problem/28/A
+27E,Number With The Given Amount Of Divisors,"brute force, dp, number theory",2000,2022,0,https://codeforces.com/problemset/problem/27/E
+27D,Ring Road 2,"2-sat, dfs and similar, dsu, graphs",2200,1433,0,https://codeforces.com/problemset/problem/27/D
+27C,Unordered Subsequence,"constructive algorithms, greedy",1900,1773,0,https://codeforces.com/problemset/problem/27/C
+27B,Tournament,"bitmasks, brute force, dfs and similar, greedy",1300,2713,0,https://codeforces.com/problemset/problem/27/B
+27A,Next Test,"implementation, sortings",1200,9030,0,https://codeforces.com/problemset/problem/27/A
+26E,Multithreading,constructive algorithms,2400,280,0,https://codeforces.com/problemset/problem/26/E
+26D,Tickets,"combinatorics, math, probabilities",2400,449,0,https://codeforces.com/problemset/problem/26/D
+26C,Parquet,"combinatorics, constructive algorithms, greedy, implementation",2000,531,0,https://codeforces.com/problemset/problem/26/C
+26B,Regular Bracket Sequence,greedy,1400,6314,0,https://codeforces.com/problemset/problem/26/B
+26A,Almost Prime,number theory,900,10737,0,https://codeforces.com/problemset/problem/26/A
+25E,Test,"hashing, strings",2200,1184,0,https://codeforces.com/problemset/problem/25/E
+25D,Roads not only in Berland,"dsu, graphs, trees",1900,4368,0,https://codeforces.com/problemset/problem/25/D
+25C,Roads in Berland,"graphs, shortest paths",1900,3117,0,https://codeforces.com/problemset/problem/25/C
+25B,Phone numbers,implementation,1100,5045,0,https://codeforces.com/problemset/problem/25/B
+25A,IQ test,brute force,1300,33601,0,https://codeforces.com/problemset/problem/25/A
+24E,Berland collider,binary search,2300,562,0,https://codeforces.com/problemset/problem/24/E
+24D,Broken robot,"dp, math, probabilities",2400,661,0,https://codeforces.com/problemset/problem/24/D
+24C,Sequence of points,"geometry, implementation, math",1800,902,0,https://codeforces.com/problemset/problem/24/C
+24B,F1 Champions,implementation,1500,1146,0,https://codeforces.com/problemset/problem/24/B
+24A,Ring road,graphs,1400,2845,0,https://codeforces.com/problemset/problem/24/A
+23E,Tree,dp,2500,395,0,https://codeforces.com/problemset/problem/23/E
+23D,Tetragon,"geometry, math",2600,258,0,https://codeforces.com/problemset/problem/23/D
+23C,Oranges and Apples,"constructive algorithms, sortings",2500,729,0,https://codeforces.com/problemset/problem/23/C
+23B,Party,"constructive algorithms, graphs, math",1600,1786,0,https://codeforces.com/problemset/problem/23/B
+23A,You're Given a String...,"brute force, greedy",1200,2723,0,https://codeforces.com/problemset/problem/23/A
+22E,Scheme,"dfs and similar, graphs, trees",2300,715,0,https://codeforces.com/problemset/problem/22/E
+22D,Segments,"greedy, sortings",1900,1574,0,https://codeforces.com/problemset/problem/22/D
+22C,System Administrator,graphs,1700,1682,0,https://codeforces.com/problemset/problem/22/C
+22B,Bargaining Table,"brute force, dp",1500,2595,0,https://codeforces.com/problemset/problem/22/B
+22A,Second Order Statistics,brute force,800,7993,0,https://codeforces.com/problemset/problem/22/A
+21D,Traveling Graph,"bitmasks, graph matchings, graphs",2400,436,0,https://codeforces.com/problemset/problem/21/D
+21C,Stripe 2,"binary search, dp, sortings",2000,1223,0,https://codeforces.com/problemset/problem/21/C
+21B,Intersection,"implementation, math",2000,904,0,https://codeforces.com/problemset/problem/21/B
+21A,Jabber ID,"implementation, strings",1900,1036,0,https://codeforces.com/problemset/problem/21/A
+20C,Dijkstra?,"graphs, shortest paths",1900,12068,0,https://codeforces.com/problemset/problem/20/C
+20B,Equation,math,2000,1944,0,https://codeforces.com/problemset/problem/20/B
+20A,BerOS file system,implementation,1700,3249,0,https://codeforces.com/problemset/problem/20/A
+19E,Fairy,"dfs and similar, divide and conquer, dsu",2900,777,0,https://codeforces.com/problemset/problem/19/E
+19D,Points,data structures,2800,988,0,https://codeforces.com/problemset/problem/19/D
+19C,Deletion of Repeats,"greedy, hashing, string suffix structures",2200,664,0,https://codeforces.com/problemset/problem/19/C
+19B,Checkout Assistant,dp,1900,1954,0,https://codeforces.com/problemset/problem/19/B
+19A,World Football Cup,implementation,1400,1655,0,https://codeforces.com/problemset/problem/19/A
+18E,Flag 2,dp,2000,601,0,https://codeforces.com/problemset/problem/18/E
+18D,Seller Bob,"brute force, dp, greedy",2000,752,0,https://codeforces.com/problemset/problem/18/D
+18C,Stripe,"data structures, implementation",1200,6426,0,https://codeforces.com/problemset/problem/18/C
+18B,Platforms,"brute force, math",1700,1371,0,https://codeforces.com/problemset/problem/18/B
+18A,Triangle,"brute force, geometry",1500,3408,0,https://codeforces.com/problemset/problem/18/A
+17E,Palisection,strings,2900,746,0,https://codeforces.com/problemset/problem/17/E
+17D,Notepad,number theory,2400,563,0,https://codeforces.com/problemset/problem/17/D
+17C,Balance,dp,2500,534,0,https://codeforces.com/problemset/problem/17/C
+17B,Hierarchy,"dfs and similar, dsu, greedy, shortest paths",1500,2220,0,https://codeforces.com/problemset/problem/17/B
+17A,Noldbach problem,"brute force, math, number theory",1000,6726,0,https://codeforces.com/problemset/problem/17/A
+16E,Fish,"bitmasks, dp, probabilities",1900,1794,0,https://codeforces.com/problemset/problem/16/E
+16D,Logging,"implementation, strings",1900,1040,0,https://codeforces.com/problemset/problem/16/D
+16C,Monitor,"binary search, number theory",1800,2701,0,https://codeforces.com/problemset/problem/16/C
+16B,Burglar and Matches,"greedy, implementation, sortings",900,6978,0,https://codeforces.com/problemset/problem/16/B
+16A,Flag,implementation,800,6864,0,https://codeforces.com/problemset/problem/16/A
+15E,Triangles,"combinatorics, dp",2600,349,0,https://codeforces.com/problemset/problem/15/E
+15D,Map,"data structures, implementation, sortings",2500,412,0,https://codeforces.com/problemset/problem/15/D
+15C,Industrial Nim,games,2000,1419,0,https://codeforces.com/problemset/problem/15/C
+15B,Laser,math,1800,866,0,https://codeforces.com/problemset/problem/15/B
+15A,Cottage Village,"implementation, sortings",1200,2116,0,https://codeforces.com/problemset/problem/15/A
+14E,Camels,dp,1900,766,0,https://codeforces.com/problemset/problem/14/E
+14D,Two Paths,"dfs and similar, dp, graphs, shortest paths, trees, two pointers",1900,2493,0,https://codeforces.com/problemset/problem/14/D
+14C,Four Segments,"brute force, constructive algorithms, geometry, implementation, math",1700,2016,0,https://codeforces.com/problemset/problem/14/C
+14B,Young Photographer,implementation,1000,3354,0,https://codeforces.com/problemset/problem/14/B
+14A,Letter,implementation,800,5340,0,https://codeforces.com/problemset/problem/14/A
+13E,Holes,"data structures, dsu",2700,2045,0,https://codeforces.com/problemset/problem/13/E
+13D,Triangles,"dp, geometry",2600,419,0,https://codeforces.com/problemset/problem/13/D
+13C,Sequence,"dp, sortings",2200,1748,0,https://codeforces.com/problemset/problem/13/C
+13B,Letter A,"geometry, implementation",2000,579,0,https://codeforces.com/problemset/problem/13/B
+13A,Numbers,"implementation, math",1000,4192,0,https://codeforces.com/problemset/problem/13/A
+12E,Start of the session,constructive algorithms,2100,633,0,https://codeforces.com/problemset/problem/12/E
+12D,Ball,"data structures, sortings",2400,1110,0,https://codeforces.com/problemset/problem/12/D
+12C,Fruits,"greedy, implementation, sortings",1100,3165,0,https://codeforces.com/problemset/problem/12/C
+12B,Correct Solution?,"implementation, sortings",1100,4474,0,https://codeforces.com/problemset/problem/12/B
+12A,Super Agent,implementation,800,5509,0,https://codeforces.com/problemset/problem/12/A
+11E,"Forward, march!","binary search, dp, greedy",2800,146,0,https://codeforces.com/problemset/problem/11/E
+11D,A Simple Task,"bitmasks, dp, graphs",2200,2040,0,https://codeforces.com/problemset/problem/11/D
+11C,How Many Squares?,implementation,2200,410,0,https://codeforces.com/problemset/problem/11/C
+11B,Jumping Jack,math,1600,2364,0,https://codeforces.com/problemset/problem/11/B
+11A,Increasing Sequence,"constructive algorithms, implementation, math",900,5680,0,https://codeforces.com/problemset/problem/11/A
+10E,Greedy Change,constructive algorithms,2600,391,0,https://codeforces.com/problemset/problem/10/E
+10D,LCIS,dp,2800,1769,0,https://codeforces.com/problemset/problem/10/D
+10C,Digital Root,number theory,2000,939,0,https://codeforces.com/problemset/problem/10/C
+10B,Cinema Cashier,"dp, implementation",1500,1164,0,https://codeforces.com/problemset/problem/10/B
+10A,Power Consumption Calculation,implementation,900,3025,0,https://codeforces.com/problemset/problem/10/A
+9E,Interestring graph and Apples,"dfs and similar, dsu, graphs",2300,493,0,https://codeforces.com/problemset/problem/9/E
+9D,How many trees?,"combinatorics, divide and conquer, dp",1900,1837,0,https://codeforces.com/problemset/problem/9/D
+9C,Hexadecimal's Numbers,"brute force, implementation, math",1200,7289,0,https://codeforces.com/problemset/problem/9/C
+9B,Running Student,"brute force, geometry, implementation",1200,2919,0,https://codeforces.com/problemset/problem/9/B
+9A,Die Roll,"math, probabilities",800,18674,0,https://codeforces.com/problemset/problem/9/A
+8E,Beads,"dp, graphs",2600,432,0,https://codeforces.com/problemset/problem/8/E
+8D,Two Friends,"binary search, geometry",2600,387,0,https://codeforces.com/problemset/problem/8/D
+8C,Looking for Order,"bitmasks, dp",2000,1935,0,https://codeforces.com/problemset/problem/8/C
+8B,Obsession with Robots,"constructive algorithms, graphs, implementation",1400,2343,0,https://codeforces.com/problemset/problem/8/B
+8A,Train and Peter,strings,1200,3317,0,https://codeforces.com/problemset/problem/8/A
+7E,Defining Macros,"dp, expression parsing, implementation",2600,439,0,https://codeforces.com/problemset/problem/7/E
+7D,Palindrome Degree,"hashing, strings",2200,2038,0,https://codeforces.com/problemset/problem/7/D
+7C,Line,"math, number theory",1800,2346,0,https://codeforces.com/problemset/problem/7/C
+7B,Memory Manager,implementation,1600,1616,0,https://codeforces.com/problemset/problem/7/B
+7A,Kalevitch and Chess,"brute force, constructive algorithms",1100,4289,0,https://codeforces.com/problemset/problem/7/A
+6E,Exposition,"binary search, data structures, dsu, trees, two pointers",1900,1876,0,https://codeforces.com/problemset/problem/6/E
+6D,Lizards and Basements 2,"brute force, dp",2600,1141,0,https://codeforces.com/problemset/problem/6/D
+6C,"Alice, Bob and Chocolate","greedy, two pointers",1200,6910,0,https://codeforces.com/problemset/problem/6/C
+6B,President's Office,implementation,1100,5710,0,https://codeforces.com/problemset/problem/6/B
+6A,Triangle,"brute force, geometry",900,10058,0,https://codeforces.com/problemset/problem/6/A
+5E,Bindian Signalizing,data structures,2400,1026,0,https://codeforces.com/problemset/problem/5/E
+5D,Follow Traffic Rules,"implementation, math",2100,963,0,https://codeforces.com/problemset/problem/5/D
+5C,Longest Regular Bracket Sequence,"constructive algorithms, data structures, dp, greedy, sortings, strings",1900,5893,0,https://codeforces.com/problemset/problem/5/C
+5B,Center Alignment,"implementation, strings",1200,3411,0,https://codeforces.com/problemset/problem/5/B
+5A,Chat Servers Outgoing Traffic,implementation,1000,5585,0,https://codeforces.com/problemset/problem/5/A
+4D,Mysterious Present,"dp, sortings",1700,5694,0,https://codeforces.com/problemset/problem/4/D
+4C,Registration System,"data structures, hashing, implementation",1300,29296,0,https://codeforces.com/problemset/problem/4/C
+4B,Before an Exam,"constructive algorithms, greedy",1200,11855,0,https://codeforces.com/problemset/problem/4/B
+4A,Watermelon,"brute force, math",800,158749,0,https://codeforces.com/problemset/problem/4/A
+3D,Least Cost Bracket Sequence,greedy,2600,1812,0,https://codeforces.com/problemset/problem/3/D
+3C,Tic-tac-toe,"brute force, games, implementation",1800,4314,0,https://codeforces.com/problemset/problem/3/C
+3B,Lorry,"greedy, sortings",1900,2611,0,https://codeforces.com/problemset/problem/3/B
+3A,Shortest path of the king,"greedy, shortest paths",1000,11149,0,https://codeforces.com/problemset/problem/3/A
+2C,Commentator problem,geometry,2600,1010,0,https://codeforces.com/problemset/problem/2/C
+2B,The least round way,"dp, math",2000,5646,0,https://codeforces.com/problemset/problem/2/B
+2A,Winner,"hashing, implementation",1500,12182,0,https://codeforces.com/problemset/problem/2/A
+1C,Ancient Berland Circus,"geometry, math",2100,3628,0,https://codeforces.com/problemset/problem/1/C
+1B,Spreadsheet,"implementation, math",1600,13172,0,https://codeforces.com/problemset/problem/1/B
+1A,Theatre Square,math,1000,117198,0,https://codeforces.com/problemset/problem/1/A
diff --git "a/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/Matrix-Freq.csv" "b/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/Matrix-Freq.csv"
new file mode 100644
index 0000000..dfe72e6
--- /dev/null
+++ "b/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/Matrix-Freq.csv"
@@ -0,0 +1,38 @@
+Tags/Difficult ,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,U
+implementation,688,494,260,184,116,55,19,13,3,3,4,1,2,0,0,0,0,0,0
+math,378,292,255,225,200,81,44,13,7,3,4,4,3,1,0,0,1,1,0
+greedy,263,337,295,240,172,79,25,7,5,6,2,2,2,1,0,0,0,0,0
+dp,56,152,215,289,299,153,50,15,4,4,1,1,0,0,0,0,0,0,0
+data structures,35,98,138,212,267,127,54,12,1,2,2,1,0,0,1,0,0,0,0
+brute force,236,220,151,129,97,54,15,6,4,1,0,0,0,0,0,0,0,0,0
+constructive algorithms,123,182,174,141,115,50,24,13,2,3,1,2,3,0,0,0,0,0,0
+graphs,34,77,105,157,148,87,29,6,5,2,2,1,1,2,0,0,0,0,0
+sortings,86,147,125,96,88,31,6,1,3,2,1,0,1,0,0,0,0,0,0
+binary search,41,108,111,118,123,47,9,6,2,2,0,2,0,1,1,0,0,0,0
+dfs and similar,34,84,99,136,116,57,17,6,3,1,0,2,0,1,0,0,0,0,0
+trees,19,30,64,113,134,78,25,5,1,2,1,2,0,0,0,0,0,0,0
+strings,106,110,64,56,60,32,10,8,1,3,1,1,0,0,0,0,0,0,0
+number theory,64,70,79,65,54,39,26,2,1,1,1,0,0,0,0,0,0,0,0
+combinatorics,14,46,65,61,83,37,18,6,2,0,1,0,0,0,0,0,0,0,0
+geometry,32,41,45,48,61,18,12,4,4,1,0,0,2,0,1,1,1,0,0
+bitmasks,8,38,41,57,60,35,24,2,0,0,0,0,0,0,0,0,0,0,0
+two pointers,23,54,57,58,44,19,7,1,0,0,0,0,0,0,0,0,0,0,0
+*special problem,37,38,36,31,25,20,22,16,12,5,1,1,0,0,0,0,0,0,3
+dsu,9,27,31,47,51,26,9,2,0,0,0,0,0,0,0,0,0,0,0
+shortest paths,6,26,25,41,40,15,5,0,1,0,0,0,0,0,0,0,0,0,0
+probabilities,4,18,20,44,34,21,7,3,0,0,0,0,0,0,0,0,0,0,0
+divide and conquer,0,9,20,25,47,30,14,1,0,1,0,0,2,0,0,0,0,0,0
+hashing,3,13,18,37,24,19,4,2,1,1,0,1,0,0,0,0,0,0,0
+games,12,20,27,18,16,11,5,3,0,0,0,0,0,0,0,0,0,1,0
+flows,2,6,7,12,26,15,10,3,2,1,1,1,0,1,1,0,0,0,0
+interactive,2,13,12,15,21,14,4,1,1,0,0,0,0,0,0,0,0,0,0
+matrices,3,5,9,15,26,16,4,1,1,0,1,0,0,0,0,0,0,0,0
+string suffix structures,0,2,7,14,19,12,8,1,1,0,0,0,0,0,0,0,0,0,0
+fft,1,0,1,4,18,8,8,3,3,0,0,0,0,0,0,0,0,0,0
+graph matchings,1,6,8,10,9,7,3,1,0,0,0,0,0,0,0,0,0,0,0
+ternary search,4,7,8,3,12,2,0,0,0,0,0,0,0,0,0,0,0,0,0
+expression parsing,3,10,7,4,5,2,0,1,0,0,0,0,0,0,0,0,0,0,0
+meet-in-the-middle,1,1,3,7,9,6,3,1,0,0,0,0,0,0,0,0,0,0,0
+2-sat,0,1,2,6,1,1,1,2,1,0,0,0,0,0,0,0,0,0,0
+chinese remainder theorem,1,1,0,3,3,1,0,1,0,0,0,0,0,0,0,0,0,0,0
+schedules,1,1,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0
diff --git "a/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/Matrix-Solved.csv" "b/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/Matrix-Solved.csv"
new file mode 100644
index 0000000..d1f78ef
--- /dev/null
+++ "b/\345\246\202\344\275\225AK/cf\345\210\206\346\236\220_2020_08_25/Matrix-Solved.csv"
@@ -0,0 +1,38 @@
+Tags/Difficult ,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,U
+implementation,7492735,3112325,1111990,478937,140942,50445,20110,15608,1917,3027,6305,2476,7699,0,0,0,0,0,0
+math,4291288,1930307,1102205,509849,197369,61857,22992,8524,4497,8164,5652,5730,7217,3266,0,0,851,5298,0
+greedy,2588235,2213619,1461599,654435,237723,71847,23352,4603,2809,4047,1797,3134,3982,1108,0,0,0,0,0
+dp,475530,788517,722013,511173,331914,117006,18808,6707,1990,2845,408,120,0,0,0,0,0,0,0
+data structures,213362,471099,457379,403845,277523,85529,18963,1561,201,242,1794,147,0,0,99,0,0,0,0
+brute force,2549642,1170052,550909,271651,133003,49516,7973,12171,1011,460,0,0,0,0,0,0,0,0,0
+constructive algorithms,970910,1097364,619570,357132,116579,52543,28506,12384,518,1377,703,1748,683,0,0,0,0,0,0
+graphs,198863,287015,269778,312807,170731,59068,14672,564,1693,2089,125,369,383,1380,0,0,0,0,0
+sortings,900585,1053384,558809,268411,130153,29744,9708,80,616,1045,1094,0,1750,0,0,0,0,0,0
+binary search,226727,578751,493498,262068,119882,31396,4912,4890,1028,2129,0,2601,0,272,99,0,0,0,0
+dfs and similar,213732,326225,311968,287893,154376,58461,10001,726,1932,1661,0,356,0,1108,0,0,0,0,0
+trees,93037,78775,198554,179304,135126,52219,11329,462,339,1751,408,356,0,0,0,0,0,0,0
+strings,1631561,662275,267725,107202,50002,24618,2865,6066,1976,1776,1036,1626,0,0,0,0,0,0,0
+number theory,661443,446608,304870,169677,57600,31239,9646,1401,35,6694,2891,0,0,0,0,0,0,0,0
+combinatorics,79965,249074,191999,101673,87843,23185,8853,4630,2624,0,1002,0,0,0,0,0,0,0,0
+geometry,232054,179910,103986,46852,21183,4668,1468,463,597,670,0,0,853,0,518,637,851,0,0
+bitmasks,51955,194737,106557,122779,68351,28647,10260,3148,0,0,0,0,0,0,0,0,0,0,0
+two pointers,154752,306301,311266,151721,63431,14918,4292,82,0,0,0,0,0,0,0,0,0,0,0
+*special problem,159097,92850,33516,30273,9604,5742,4978,7126,1259,482,1036,177,0,0,0,0,0,0,629
+dsu,65798,130060,78385,100549,59679,27861,7881,5202,0,0,0,0,0,0,0,0,0,0,0
+shortest paths,29661,133779,57316,93297,57007,9242,1107,0,94,0,0,0,0,0,0,0,0,0,0
+probabilities,25622,46675,27015,42575,21365,9479,1605,525,0,0,0,0,0,0,0,0,0,0,0
+divide and conquer,0,26919,28883,55055,32685,16068,8341,114,0,670,0,0,300,0,0,0,0,0,0
+hashing,21050,44271,58508,68632,18486,17056,1316,2828,1976,1515,0,236,0,0,0,0,0,0,0
+games,89713,140933,85732,32973,10929,4111,679,311,0,0,0,0,0,0,0,0,0,5298,0
+flows,280,11071,5366,14524,15038,5315,3162,372,1311,428,66,369,0,272,99,0,0,0,0
+interactive,7340,26355,19561,20136,14780,6641,1171,63,439,0,0,0,0,0,0,0,0,0,0
+matrices,6506,9169,14178,8883,27793,7235,1060,28,35,0,1183,0,0,0,0,0,0,0,0
+string suffix structures,0,10379,8429,31827,11203,4811,2022,310,461,0,0,0,0,0,0,0,0,0,0
+fft,49,0,1010,2206,11678,1338,3122,407,572,0,0,0,0,0,0,0,0,0,0
+graph matchings,184,75452,24862,4597,3164,2940,1446,930,0,0,0,0,0,0,0,0,0,0,0
+ternary search,15704,26890,37146,6043,16975,1372,0,0,0,0,0,0,0,0,0,0,0,0,0
+expression parsing,4938,38126,12986,2497,3718,192,0,179,0,0,0,0,0,0,0,0,0,0,0
+meet-in-the-middle,1060,5963,20438,11696,8359,4360,1813,28,0,0,0,0,0,0,0,0,0,0,0
+2-sat,0,2741,1941,8038,1529,357,708,317,371,0,0,0,0,0,0,0,0,0,0
+chinese remainder theorem,9425,3680,0,1444,3064,284,0,84,0,0,0,0,0,0,0,0,0,0,0
+schedules,3161,4376,6694,0,327,0,0,0,0,0,0,0,0,0,0,0,0,0,0
diff --git "a/\345\246\202\344\275\225AK/\346\234\200\345\260\217\350\264\271\347\224\250\346\265\201\347\256\227\346\263\225 - \345\274\240\346\230\206\347\216\256.pdf" "b/\345\246\202\344\275\225AK/\346\234\200\345\260\217\350\264\271\347\224\250\346\265\201\347\256\227\346\263\225 - \345\274\240\346\230\206\347\216\256.pdf"
new file mode 100644
index 0000000..7e3a284
Binary files /dev/null and "b/\345\246\202\344\275\225AK/\346\234\200\345\260\217\350\264\271\347\224\250\346\265\201\347\256\227\346\263\225 - \345\274\240\346\230\206\347\216\256.pdf" differ