right = generate(i + 1, ri);
+
+ // 组合构造左右子树
+ for (TreeNode leNode : left) {
+ for (TreeNode riNode : right) {
+ TreeNode root = new TreeNode(i);
+ root.left = leNode;
+ root.right = riNode;
+ res.add(root);
+ }
+ }
+ }
+ memo[le][ri] = res;
+ return res;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/editor/en/P968BinaryTreeCameras.java b/src/leetcode/editor/en/P968BinaryTreeCameras.java
new file mode 100644
index 0000000..4bde5ae
--- /dev/null
+++ b/src/leetcode/editor/en/P968BinaryTreeCameras.java
@@ -0,0 +1,112 @@
+//You are given the root of a binary tree. We install cameras on the tree nodes
+//where each camera at a node can monitor its parent, itself, and its immediate
+//children.
+//
+// Return the minimum number of cameras needed to monitor all nodes of the tree.
+//
+//
+//
+// Example 1:
+//
+//
+//Input: root = [0,0,null,0,0]
+//Output: 1
+//Explanation: One camera is enough to monitor all nodes if placed as shown.
+//
+//
+// Example 2:
+//
+//
+//Input: root = [0,0,null,0,null,0,null,null,0]
+//Output: 2
+//Explanation: At least two cameras are needed to monitor all nodes of the tree.
+// The above image shows one of the valid configurations of camera placement.
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [1, 1000].
+// Node.val == 0
+//
+// Related Topics Dynamic Programming Tree Depth-First Search Binary Tree 👍 375
+//2 👎 44
+
+
+package leetcode.editor.en;
+
+/**
+ * Binary Tree Cameras
+ *
+ * @author: eumes
+ * @date: 2022-06-18 00:47:34
+ */
+ public class P968BinaryTreeCameras {
+ public static void main(String[] args) {
+// Solution_P968 solution = new Solution_P968();
+ // TO TEST
+
+ }
+
+ }
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+class Solution_P968 {
+ // 节点的三种形态：0 未被monitor的，1 被monitor的，2 设置camera的
+ private static final Integer UNMONITORED = 0;
+ private static final Integer MONITORED = 1;
+ private static final Integer CAMERA = 2;
+
+ private int cameras;
+
+ public int minCameraCover(TreeNode root) {
+ cameras = 0;
+ setCamera(root, true);
+ return cameras;
+ }
+
+ // 采用自底向上遍历，返回值为root节点状态
+ private int setCamera(TreeNode root, boolean isRoot) {
+ if (root == null) {
+ // 空节点默认被monitor
+ return 1;
+ }
+
+ int left = setCamera(root.left, false);
+ int right = setCamera(root.right, false);
+
+ // 如果左右节点 有未被monitor的，则root节点需要设置camera
+ if (left == UNMONITORED || right == UNMONITORED) {
+ cameras++;
+ return CAMERA;
+ }
+
+ // 如果左右节点 有设置了camera的，则root节点被monitor了
+ if (left == CAMERA || right == CAMERA) {
+ return MONITORED;
+ }
+
+ // 剩下的情况：左右节点被monitor了，需要根据root是否有父节点 -> 来决定是自己设置camera还是交由父节点monitor
+ if (isRoot) {
+ cameras++;
+ return CAMERA;
+ }
+ return UNMONITORED;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/editor/en/P96UniqueBinarySearchTrees.java b/src/leetcode/editor/en/P96UniqueBinarySearchTrees.java
new file mode 100644
index 0000000..06aa77d
--- /dev/null
+++ b/src/leetcode/editor/en/P96UniqueBinarySearchTrees.java
@@ -0,0 +1,74 @@
+//Given an integer n, return the number of structurally unique BST's (binary
+//search trees) which has exactly n nodes of unique values from 1 to n.
+//
+//
+// Example 1:
+//
+//
+//Input: n = 3
+//Output: 5
+//
+//
+// Example 2:
+//
+//
+//Input: n = 1
+//Output: 1
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= n <= 19
+//
+// Related Topics Math Dynamic Programming Tree Binary Search Tree Binary Tree ?
+//? 7303 👎 298
+
+
+package leetcode.editor.en;
+
+/**
+ * Unique Binary Search Trees
+ *
+ * @author: eumes
+ * @date: 2022-06-04 00:01:40
+ */
+ public class P96UniqueBinarySearchTrees {
+ public static void main(String[] args) {
+// Solution_P96 solution = new Solution_P96();
+ // TO TEST
+
+ }
+
+ }
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_P96 {
+ // 记录[i, j]之间数字组成的BST个数
+ int[][] memo;
+ public int numTrees(int n) {
+ memo = new int[n + 1][n + 1];
+ return count(1, n);
+ }
+
+ // 计算[le, ri] 直接数字组成的BST个数
+ private int count(int le, int ri) {
+ if (le > ri) {
+ return 1;
+ }
+ if (memo[le][ri] != 0) {
+ return memo[le][ri];
+ }
+
+ int cnt = 0;
+ for (int i = le; i <= ri; i++) {
+ int left = count(le, i - 1);
+ int right = count(i + 1, ri);
+
+ cnt += left * right;
+ }
+ memo[le][ri] = cnt;
+ return cnt;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/editor/en/P97InterleavingString.java b/src/leetcode/editor/en/P97InterleavingString.java
new file mode 100644
index 0000000..6182029
--- /dev/null
+++ b/src/leetcode/editor/en/P97InterleavingString.java
@@ -0,0 +1,157 @@
+//Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of
+//s1 and s2.
+//
+// An interleaving of two strings s and t is a configuration where they are
+//divided into non-empty substrings such that:
+//
+//
+// s = s1 + s2 + ... + sn
+// t = t1 + t2 + ... + tm
+// |n - m| <= 1
+// The interleaving is s1 + t1 + s2 + t2 + s3 + t3 + ... or t1 + s1 + t2 + s2 +
+//t3 + s3 + ...
+//
+//
+// Note: a + b is the concatenation of strings a and b.
+//
+//
+// Example 1:
+//
+//
+//Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
+//Output: true
+//
+//
+// Example 2:
+//
+//
+//Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
+//Output: false
+//
+//
+// Example 3:
+//
+//
+//Input: s1 = "", s2 = "", s3 = ""
+//Output: true
+//
+//
+//
+// Constraints:
+//
+//
+// 0 <= s1.length, s2.length <= 100
+// 0 <= s3.length <= 200
+// s1, s2, and s3 consist of lowercase English letters.
+//
+//
+//
+// Follow up: Could you solve it using only O(s2.length) additional memory
+//space?
+// Related Topics String Dynamic Programming 👍 5058 👎 296
+
+
+package leetcode.editor.en;
+
+/**
+ * Interleaving String
+ *
+ * @author: eumes
+ * @date: 2022-07-08 00:06:55
+ */
+ public class P97InterleavingString {
+ public static void main(String[] args) {
+// Solution_P97 solution = new Solution_P97();
+ // TO TEST
+
+ }
+
+ }
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_P97 {
+
+ // 压缩一维dp
+ public boolean isInterleave(String s1, String s2, String s3) {
+ // 数量不相等
+ if (s1.length() + s2.length() != s3.length()) {
+ return false;
+ }
+ int m = s1.length(), n = s2.length();
+ boolean[] dp = new boolean[n + 1];
+ dp[0] = true;
+ for (int j = 1; j <= n; j++) {
+ dp[j] = dp[j - 1] && s2.charAt(j - 1) == s3.charAt(j - 1);
+ }
+
+ for (int i = 1; i <= m; i++) {
+ for (int j = 0; j <= n; j++) {
+ if (j == 0) {
+ dp[0] = dp[0] && s1.charAt(i - 1) == s3.charAt(i - 1);
+ } else {
+ dp[j] = dp[j] && s1.charAt(i - 1) == s3.charAt(i + j - 1)
+ || dp[j - 1] && s2.charAt(j - 1) == s3.charAt(i + j - 1);
+ }
+ }
+ }
+
+ return dp[n];
+ }
+
+ // 二维dp
+ public boolean isInterleave_dp2(String s1, String s2, String s3) {
+ // 数量不相等
+ if (s1.length() + s2.length() != s3.length()) {
+ return false;
+ }
+
+ int m = s1.length(), n = s2.length();
+ // dp[i][j]表示s1[0..i-1]与s2[0..j-1]能否满足s3[0..i+j-1]
+ boolean[][] dp = new boolean[m + 1][n + 1];
+ // base case
+ dp[0][0] = true;
+ for (int i = 1; i <= m; i++) {
+ dp[i][0] = dp[i - 1][0] && s1.charAt(i - 1) == s3.charAt(i - 1);
+ }
+ for (int j = 1; j <= n; j++) {
+ dp[0][j] = dp[0][j - 1] && s2.charAt(j - 1) == s3.charAt(j - 1);
+ }
+
+ // dp更新
+ for (int i = 1; i <= m; i++) {
+ for (int j = 1; j <= n; j++) {
+ dp[i][j] = dp[i - 1][j] && s1.charAt(i - 1) == s3.charAt(i + j - 1)
+ || dp[i][j - 1] && s2.charAt(j - 1) == s3.charAt(i + j - 1);
+ }
+ }
+ return dp[m][n];
+ }
+
+ // dfs
+ public boolean isInterleave_dfs(String s1, String s2, String s3) {
+ // 数量不相等
+ if (s1.length() + s2.length() != s3.length()) {
+ return false;
+ }
+
+ return dfs(s1, s2, s3, 0, 0, 0, new boolean[s1.length() + 1][s2.length() + 1]);
+ }
+
+ // s1的[0..i]与s2的[0..j]是否满足构成s3的[0..k]，其中invalid[i][j]为备忘录
+ private boolean dfs(String s1, String s2, String s3, int i, int j, int k, boolean[][] invalid) {
+ if (invalid[i][j]) {
+ return false;
+ }
+ if (k == s3.length()) {
+ return true;
+ }
+
+ // s1右移或s2右移，分别递归
+ boolean isvalid = i < s1.length() && s1.charAt(i) == s3.charAt(k) && dfs(s1, s2, s3, i + 1, j, k + 1, invalid)
+ || j < s2.length() && s2.charAt(j) == s3.charAt(k) && dfs(s1, s2, s3, i, j + 1, k + 1, invalid);
+
+ // 更新备忘录
+ invalid[i][j] = !isvalid;
+ return isvalid;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/editor/en/P98ValidateBinarySearchTree.java b/src/leetcode/editor/en/P98ValidateBinarySearchTree.java
new file mode 100644
index 0000000..5bd57f7
--- /dev/null
+++ b/src/leetcode/editor/en/P98ValidateBinarySearchTree.java
@@ -0,0 +1,94 @@
+//Given the root of a binary tree, determine if it is a valid binary search
+//tree (BST).
+//
+// A valid BST is defined as follows:
+//
+//
+// The left subtree of a node contains only nodes with keys less than the
+//node's key.
+// The right subtree of a node contains only nodes with keys greater than the
+//node's key.
+// Both the left and right subtrees must also be binary search trees.
+//
+//
+//
+// Example 1:
+//
+//
+//Input: root = [2,1,3]
+//Output: true
+//
+//
+// Example 2:
+//
+//
+//Input: root = [5,1,4,null,null,3,6]
+//Output: false
+//Explanation: The root node's value is 5 but its right child's value is 4.
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [1, 10⁴].
+// -2³¹ <= Node.val <= 2³¹ - 1
+//
+// Related Topics Tree Depth-First Search Binary Search Tree Binary Tree 👍 9908
+// 👎 894
+
+
+package leetcode.editor.en;
+
+/**
+ * Validate Binary Search Tree
+ *
+ * @author: eumes
+ * @date: 2022-06-01 23:50:39
+ */
+ public class P98ValidateBinarySearchTree {
+ public static void main(String[] args) {
+// Solution_P98 solution = new Solution_P98();
+ // TO TEST
+
+ }
+
+ }
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+class Solution_P98 {
+ public boolean isValidBST(TreeNode root) {
+ return validateBST(root, null, null);
+ }
+
+ // 验证 root是否在max和min之间；左子树的max为root，右子树的min为root，即root应大于左子树所有节点、小于右子树所有节点
+ private boolean validateBST(TreeNode root, TreeNode max, TreeNode min) {
+ if (root == null) {
+ return true;
+ }
+
+ if (max != null && root.val >= max.val) {
+ return false;
+ }
+ if (min != null && root.val <= min.val) {
+ return false;
+ }
+
+ return validateBST(root.left, root, min) && validateBST(root.right, max, root);
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/editor/en/P99RecoverBinarySearchTree.java b/src/leetcode/editor/en/P99RecoverBinarySearchTree.java
new file mode 100644
index 0000000..148a858
--- /dev/null
+++ b/src/leetcode/editor/en/P99RecoverBinarySearchTree.java
@@ -0,0 +1,115 @@
+//You are given the root of a binary search tree (BST), where the values of
+//exactly two nodes of the tree were swapped by mistake. Recover the tree without
+//changing its structure.
+//
+//
+// Example 1:
+//
+//
+//Input: root = [1,3,null,null,2]
+//Output: [3,1,null,null,2]
+//Explanation: 3 cannot be a left child of 1 because 3 > 1. Swapping 1 and 3
+//makes the BST valid.
+//
+//
+// Example 2:
+//
+//
+//Input: root = [3,1,4,null,null,2]
+//Output: [2,1,4,null,null,3]
+//Explanation: 2 cannot be in the right subtree of 3 because 2 < 3. Swapping 2
+//and 3 makes the BST valid.
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [2, 1000].
+// -2³¹ <= Node.val <= 2³¹ - 1
+//
+//
+//
+//Follow up: A solution using O(n) space is pretty straight-forward. Could you
+//devise a constant O(1) space solution? Related Topics Tree Depth-First Search
+//Binary Search Tree Binary Tree 👍 4879 👎 168
+
+
+package leetcode.editor.en;
+
+/**
+ * Recover Binary Search Tree
+ *
+ * @author: eumes
+ * @date: 2022-04-19 23:33:03
+ */
+ public class P99RecoverBinarySearchTree {
+ public static void main(String[] args) {
+// Solution_P99 solution = new Solution_P99();
+ // TO TEST
+
+ }
+
+ }
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+class Solution_P99 {
+ TreeNode first;
+ TreeNode second;
+ // prev应该比当前小
+ TreeNode prev;
+
+ public void recoverTree(TreeNode root) {
+ traverse(root);
+
+ int tmp = first.val;
+ first.val = second.val;
+ second.val = tmp;
+ }
+
+ public void traverse(TreeNode root) {
+ if (root == null) {
+ return ;
+ }
+
+ traverse(root.left);
+ //
+ if (first == null && prev != null && prev.val > root.val) {
+ first = prev;
+ }
+ if (first != null && prev != null && prev.val > root.val) {
+ second = root;
+ }
+
+ prev = root;
+ traverse(root.right);
+ }
+
+ class TreeNode {
+ int val;
+ TreeNode left;
+ TreeNode right;
+ TreeNode() {}
+ TreeNode(int val) { this.val = val; }
+ TreeNode(int val, TreeNode left, TreeNode right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/editor/en/TreeNode.java b/src/leetcode/editor/en/TreeNode.java
new file mode 100644
index 0000000..09b6a76
--- /dev/null
+++ b/src/leetcode/editor/en/TreeNode.java
@@ -0,0 +1,24 @@
+package leetcode.editor.en;
+
+/**
+ * @author: eumes
+ * @date: 2022/5/15
+ **/
+public class TreeNode {
+ int val;
+ TreeNode left;
+ TreeNode right;
+
+ TreeNode() {
+ }
+
+ TreeNode(int val) {
+ this.val = val;
+ }
+
+ TreeNode(int val, TreeNode left, TreeNode right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1011CapacityToShipPackagesWithinDDays.md b/src/leetcode/editor/en/doc/content/P1011CapacityToShipPackagesWithinDDays.md
new file mode 100644
index 0000000..ad5a862
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1011CapacityToShipPackagesWithinDDays.md
@@ -0,0 +1,52 @@
+A conveyor belt has packages that must be shipped from one port to another within days days.
+
+The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than the maximum weight capacity of the ship.
+
+Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within days days.
+
+
+Example 1:
+
+
+Input: weights = [1,2,3,4,5,6,7,8,9,10], days = 5
+Output: 15
+Explanation: A ship capacity of 15 is the minimum to ship all the packages in 5 days like this:
+1st day: 1, 2, 3, 4, 5
+2nd day: 6, 7
+3rd day: 8
+4th day: 9
+5th day: 10
+
+Note that the cargo must be shipped in the order given, so using a ship of capacity 14 and splitting the packages into parts like (2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.
+
+
+Example 2:
+
+
+Input: weights = [3,2,2,4,1,4], days = 3
+Output: 6
+Explanation: A ship capacity of 6 is the minimum to ship all the packages in 3 days like this:
+1st day: 3, 2
+2nd day: 2, 4
+3rd day: 1, 4
+
+
+Example 3:
+
+
+Input: weights = [1,2,3,1,1], days = 4
+Output: 3
+Explanation:
+1st day: 1
+2nd day: 2
+3rd day: 3
+4th day: 1, 1
+
+
+
+Constraints:
+
+
+ 1 <= days <= weights.length <= 5 * 1041 <= weights[i] <= 500
Related Topics
ArrayBinary SearchGreedy
👍 4200👎 99
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1048LongestStringChain.md b/src/leetcode/editor/en/doc/content/P1048LongestStringChain.md
new file mode 100644
index 0000000..7625c9e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1048LongestStringChain.md
@@ -0,0 +1,47 @@
+You are given an array of words where each word consists of lowercase English letters.
+
+wordA is a predecessor of wordB if and only if we can insert exactly one letter anywhere in wordA without changing the order of the other characters to make it equal to wordB.
+
+
+ - For example,
"abc" is a predecessor of "abac", while "cba" is not a predecessor of "bcad".
+
+
+A word chain is a sequence of words [word1, word2, ..., wordk] with k >= 1, where word1 is a predecessor of word2, word2 is a predecessor of word3, and so on. A single word is trivially a word chain with k == 1.
+
+Return the length of the longest possible word chain with words chosen from the given list of words.
+
+
+Example 1:
+
+
+Input: words = ["a","b","ba","bca","bda","bdca"]
+Output: 4
+Explanation: One of the longest word chains is ["a","ba","bda","bdca"].
+
+
+Example 2:
+
+
+Input: words = ["xbc","pcxbcf","xb","cxbc","pcxbc"]
+Output: 5
+Explanation: All the words can be put in a word chain ["xb", "xbc", "cxbc", "pcxbc", "pcxbcf"].
+
+
+Example 3:
+
+
+Input: words = ["abcd","dbqca"]
+Output: 1
+Explanation: The trivial word chain ["abcd"] is one of the longest word chains.
+["abcd","dbqca"] is not a valid word chain because the ordering of the letters is changed.
+
+
+
+Constraints:
+
+
+ 1 <= words.length <= 10001 <= words[i].length <= 16words[i] only consists of lowercase English letters.
+Related Topics
ArrayHash TableTwo PointersStringDynamic Programming
👍 4471👎 185
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P105ConstructBinaryTreeFromPreorderAndInorderTraversal.md b/src/leetcode/editor/en/doc/content/P105ConstructBinaryTreeFromPreorderAndInorderTraversal.md
new file mode 100644
index 0000000..a50ae1c
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P105ConstructBinaryTreeFromPreorderAndInorderTraversal.md
@@ -0,0 +1,30 @@
+Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.
+
+
+Example 1:
+
+
+Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
+Output: [3,9,20,null,null,15,7]
+
+
+Example 2:
+
+
+Input: preorder = [-1], inorder = [-1]
+Output: [-1]
+
+
+
+Constraints:
+
+
+ 1 <= preorder.length <= 3000inorder.length == preorder.length-3000 <= preorder[i], inorder[i] <= 3000preorder and inorder consist of unique values.- Each value of
inorder also appears in preorder.
+ preorder is guaranteed to be the preorder traversal of the tree.inorder is guaranteed to be the inorder traversal of the tree.
+Related Topics
ArrayHash TableDivide and ConquerTreeBinary Tree
👍 8497👎 231
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P106ConstructBinaryTreeFromInorderAndPostorderTraversal.md b/src/leetcode/editor/en/doc/content/P106ConstructBinaryTreeFromInorderAndPostorderTraversal.md
new file mode 100644
index 0000000..f4f11bb
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P106ConstructBinaryTreeFromInorderAndPostorderTraversal.md
@@ -0,0 +1,30 @@
+Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree.
+
+
+Example 1:
+
+
+Input: inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
+Output: [3,9,20,null,null,15,7]
+
+
+Example 2:
+
+
+Input: inorder = [-1], postorder = [-1]
+Output: [-1]
+
+
+
+Constraints:
+
+
+ 1 <= inorder.length <= 3000postorder.length == inorder.length-3000 <= inorder[i], postorder[i] <= 3000inorder and postorder consist of unique values.- Each value of
postorder also appears in inorder.
+ inorder is guaranteed to be the inorder traversal of the tree.postorder is guaranteed to be the postorder traversal of the tree.
+Related Topics
ArrayHash TableDivide and ConquerTreeBinary Tree
👍 4462👎 73
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1091ShortestPathInBinaryMatrix.md b/src/leetcode/editor/en/doc/content/P1091ShortestPathInBinaryMatrix.md
new file mode 100644
index 0000000..88370f6
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1091ShortestPathInBinaryMatrix.md
@@ -0,0 +1,43 @@
+Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1.
+
+A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that:
+
+
+ - All the visited cells of the path are
0.
+ - All the adjacent cells of the path are 8-directionally connected (i.e., they are different and they share an edge or a corner).
+
+
+The length of a clear path is the number of visited cells of this path.
+
+
+Example 1:
+
+
+Input: grid = [[0,1],[1,0]]
+Output: 2
+
+
+Example 2:
+
+
+Input: grid = [[0,0,0],[1,1,0],[1,1,0]]
+Output: 4
+
+
+Example 3:
+
+
+Input: grid = [[1,0,0],[1,1,0],[1,1,0]]
+Output: -1
+
+
+
+Constraints:
+
+
+ n == grid.lengthn == grid[i].length1 <= n <= 100grid[i][j] is 0 or 1
+Related Topics
ArrayBreadth-First SearchMatrix
👍 3130👎 141
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1094CarPooling.md b/src/leetcode/editor/en/doc/content/P1094CarPooling.md
new file mode 100644
index 0000000..abd7ae1
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1094CarPooling.md
@@ -0,0 +1,32 @@
+There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).
+
+You are given the integer capacity and an array trips where trips[i] = [numPassengersi, fromi, toi] indicates that the ith trip has numPassengersi passengers and the locations to pick them up and drop them off are fromi and toi respectively. The locations are given as the number of kilometers due east from the car's initial location.
+
+Return true if it is possible to pick up and drop off all passengers for all the given trips, or false otherwise.
+
+
+Example 1:
+
+
+Input: trips = [[2,1,5],[3,3,7]], capacity = 4
+Output: false
+
+
+Example 2:
+
+
+Input: trips = [[2,1,5],[3,3,7]], capacity = 5
+Output: true
+
+
+
+Constraints:
+
+
+ 1 <= trips.length <= 1000trips[i].length == 31 <= numPassengersi <= 1000 <= fromi < toi <= 10001 <= capacity <= 105
+Related Topics
ArraySortingHeap (Priority Queue)SimulationPrefix Sum
👍 3137👎 67
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1109CorporateFlightBookings.md b/src/leetcode/editor/en/doc/content/P1109CorporateFlightBookings.md
new file mode 100644
index 0000000..cbdf13f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1109CorporateFlightBookings.md
@@ -0,0 +1,46 @@
+There are n flights that are labeled from 1 to n.
+
+You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi] represents a booking for flights firsti through lasti (inclusive) with seatsi seats reserved for each flight in the range.
+
+Return an array answer of length n, where answer[i] is the total number of seats reserved for flight i.
+
+
+Example 1:
+
+
+Input: bookings = [[1,2,10],[2,3,20],[2,5,25]], n = 5
+Output: [10,55,45,25,25]
+Explanation:
+Flight labels: 1 2 3 4 5
+Booking 1 reserved: 10 10
+Booking 2 reserved: 20 20
+Booking 3 reserved: 25 25 25 25
+Total seats: 10 55 45 25 25
+Hence, answer = [10,55,45,25,25]
+
+
+Example 2:
+
+
+Input: bookings = [[1,2,10],[2,2,15]], n = 2
+Output: [10,25]
+Explanation:
+Flight labels: 1 2
+Booking 1 reserved: 10 10
+Booking 2 reserved: 15
+Total seats: 10 25
+Hence, answer = [10,25]
+
+
+
+
+Constraints:
+
+
+ 1 <= n <= 2 * 1041 <= bookings.length <= 2 * 104bookings[i].length == 31 <= firsti <= lasti <= n1 <= seatsi <= 104
+Related Topics
ArrayPrefix Sum
👍 1024👎 141
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1143LongestCommonSubsequence.md b/src/leetcode/editor/en/doc/content/P1143LongestCommonSubsequence.md
new file mode 100644
index 0000000..2478332
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1143LongestCommonSubsequence.md
@@ -0,0 +1,43 @@
+Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
+
+A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
+
+
+ - For example,
"ace" is a subsequence of "abcde".
+
+
+A common subsequence of two strings is a subsequence that is common to both strings.
+
+
+Example 1:
+
+
+Input: text1 = "abcde", text2 = "ace"
+Output: 3
+Explanation: The longest common subsequence is "ace" and its length is 3.
+
+
+Example 2:
+
+
+Input: text1 = "abc", text2 = "abc"
+Output: 3
+Explanation: The longest common subsequence is "abc" and its length is 3.
+
+
+Example 3:
+
+
+Input: text1 = "abc", text2 = "def"
+Output: 0
+Explanation: There is no such common subsequence, so the result is 0.
+
+
+
+Constraints:
+
+
+ 1 <= text1.length, text2.length <= 1000text1 and text2 consist of only lowercase English characters.
+Related Topics
StringDynamic Programming
👍 6855👎 74
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P114FlattenBinaryTreeToLinkedList.md b/src/leetcode/editor/en/doc/content/P114FlattenBinaryTreeToLinkedList.md
new file mode 100644
index 0000000..dd011f3
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P114FlattenBinaryTreeToLinkedList.md
@@ -0,0 +1,39 @@
+Given the root of a binary tree, flatten the tree into a "linked list":
+
+
+ - The "linked list" should use the same
TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null.
+ - The "linked list" should be in the same order as a pre-order traversal of the binary tree.
+
+
+
+Example 1:
+
+
+Input: root = [1,2,5,3,4,null,6]
+Output: [1,null,2,null,3,null,4,null,5,null,6]
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+Example 3:
+
+
+Input: root = [0]
+Output: [0]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 2000].
+ -100 <= Node.val <= 100
+
+
+Follow up: Can you flatten the tree in-place (with O(1) extra space)?Related Topics
Linked ListStackTreeDepth-First SearchBinary Tree
👍 7098👎 464
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P116PopulatingNextRightPointersInEachNode.md b/src/leetcode/editor/en/doc/content/P116PopulatingNextRightPointersInEachNode.md
new file mode 100644
index 0000000..0cfe573
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P116PopulatingNextRightPointersInEachNode.md
@@ -0,0 +1,47 @@
+You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
+
+
+struct Node {
+ int val;
+ Node *left;
+ Node *right;
+ Node *next;
+}
+
+
+Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
+
+Initially, all next pointers are set to NULL.
+
+
+Example 1:
+
+
+Input: root = [1,2,3,4,5,6,7]
+Output: [1,#,2,3,#,4,5,6,7,#]
+Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 212 - 1].
+ -1000 <= Node.val <= 1000
+
+
+Follow-up:
+
+
+ - You may only use constant extra space.
+ - The recursive approach is fine. You may assume implicit stack space does not count as extra space for this problem.
+
+Related Topics
Linked ListTreeDepth-First SearchBreadth-First SearchBinary Tree
👍 6551👎 229
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P117PopulatingNextRightPointersInEachNodeIi.md b/src/leetcode/editor/en/doc/content/P117PopulatingNextRightPointersInEachNodeIi.md
new file mode 100644
index 0000000..b451388
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P117PopulatingNextRightPointersInEachNodeIi.md
@@ -0,0 +1,47 @@
+Given a binary tree
+
+
+struct Node {
+ int val;
+ Node *left;
+ Node *right;
+ Node *next;
+}
+
+
+Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
+
+Initially, all next pointers are set to NULL.
+
+
+Example 1:
+
+
+Input: root = [1,2,3,4,5,null,7]
+Output: [1,#,2,3,#,4,5,7,#]
+Explanation: Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 6000].
+ -100 <= Node.val <= 100
+
+
+Follow-up:
+
+
+ - You may only use constant extra space.
+ - The recursive approach is fine. You may assume implicit stack space does not count as extra space for this problem.
+
+Related Topics
Linked ListTreeDepth-First SearchBreadth-First SearchBinary Tree
👍 4164👎 247
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1192CriticalConnectionsInANetwork.md b/src/leetcode/editor/en/doc/content/P1192CriticalConnectionsInANetwork.md
new file mode 100644
index 0000000..7ab265d
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1192CriticalConnectionsInANetwork.md
@@ -0,0 +1,33 @@
+There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between servers ai and bi. Any server can reach other servers directly or indirectly through the network.
+
+A critical connection is a connection that, if removed, will make some servers unable to reach some other server.
+
+Return all critical connections in the network in any order.
+
+
+Example 1:
+
+
+Input: n = 4, connections = [[0,1],[1,2],[2,0],[1,3]]
+Output: [[1,3]]
+Explanation: [[3,1]] is also accepted.
+
+
+Example 2:
+
+
+Input: n = 2, connections = [[0,1]]
+Output: [[0,1]]
+
+
+
+Constraints:
+
+
+ 2 <= n <= 105n - 1 <= connections.length <= 1050 <= ai, bi <= n - 1ai != bi- There are no repeated connections.
+
+Related Topics
Depth-First SearchGraphBiconnected Component
👍 4178👎 151
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1202SmallestStringWithSwaps.md b/src/leetcode/editor/en/doc/content/P1202SmallestStringWithSwaps.md
new file mode 100644
index 0000000..e9061c6
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1202SmallestStringWithSwaps.md
@@ -0,0 +1,48 @@
+You are given a string s, and an array of pairs of indices in the string pairs where pairs[i] = [a, b] indicates 2 indices(0-indexed) of the string.
+
+You can swap the characters at any pair of indices in the given pairs any number of times.
+
+Return the lexicographically smallest string that s can be changed to after using the swaps.
+
+
+Example 1:
+
+
+Input: s = "dcab", pairs = [[0,3],[1,2]]
+Output: "bacd"
+Explaination:
+Swap s[0] and s[3], s = "bcad"
+Swap s[1] and s[2], s = "bacd"
+
+
+Example 2:
+
+
+Input: s = "dcab", pairs = [[0,3],[1,2],[0,2]]
+Output: "abcd"
+Explaination:
+Swap s[0] and s[3], s = "bcad"
+Swap s[0] and s[2], s = "acbd"
+Swap s[1] and s[2], s = "abcd"
+
+Example 3:
+
+
+Input: s = "cba", pairs = [[0,1],[1,2]]
+Output: "abc"
+Explaination:
+Swap s[0] and s[1], s = "bca"
+Swap s[1] and s[2], s = "bac"
+Swap s[0] and s[1], s = "abc"
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 10^50 <= pairs.length <= 10^50 <= pairs[i][0], pairs[i][1] < s.lengths only contains lower case English letters.
+Related Topics
Hash TableStringDepth-First SearchBreadth-First SearchUnion Find
👍 2263👎 67
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1209RemoveAllAdjacentDuplicatesInStringIi.md b/src/leetcode/editor/en/doc/content/P1209RemoveAllAdjacentDuplicatesInStringIi.md
new file mode 100644
index 0000000..f136ac9
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1209RemoveAllAdjacentDuplicatesInStringIi.md
@@ -0,0 +1,40 @@
+You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together.
+
+We repeatedly make k duplicate removals on s until we no longer can.
+
+Return the final string after all such duplicate removals have been made. It is guaranteed that the answer is unique.
+
+
+Example 1:
+
+
+Input: s = "abcd", k = 2
+Output: "abcd"
+Explanation: There's nothing to delete.
+
+Example 2:
+
+
+Input: s = "deeedbbcccbdaa", k = 3
+Output: "aa"
+Explanation:
+First delete "eee" and "ccc", get "ddbbbdaa"
+Then delete "bbb", get "dddaa"
+Finally delete "ddd", get "aa"
+
+Example 3:
+
+
+Input: s = "pbbcggttciiippooaais", k = 2
+Output: "ps"
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 1052 <= k <= 104s only contains lower case English letters.
+Related Topics
StringStack
👍 3404👎 65
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P120Triangle.md b/src/leetcode/editor/en/doc/content/P120Triangle.md
new file mode 100644
index 0000000..648d7e9
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P120Triangle.md
@@ -0,0 +1,37 @@
+Given a triangle array, return the minimum path sum from top to bottom.
+
+For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row.
+
+
+Example 1:
+
+
+Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
+Output: 11
+Explanation: The triangle looks like:
+ 2
+ 3 4
+ 6 5 7
+4 1 8 3
+The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).
+
+
+Example 2:
+
+
+Input: triangle = [[-10]]
+Output: -10
+
+
+
+Constraints:
+
+
+ 1 <= triangle.length <= 200triangle[0].length == 1triangle[i].length == triangle[i - 1].length + 1-104 <= triangle[i][j] <= 104
+
+
+Follow up: Could you do this using only O(n) extra space, where n is the total number of rows in the triangle?Related Topics
ArrayDynamic Programming
👍 5924👎 408
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1268SearchSuggestionsSystem.md b/src/leetcode/editor/en/doc/content/P1268SearchSuggestionsSystem.md
new file mode 100644
index 0000000..26faf78
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1268SearchSuggestionsSystem.md
@@ -0,0 +1,50 @@
+You are given an array of strings products and a string searchWord.
+
+Design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with searchWord. If there are more than three products with a common prefix return the three lexicographically minimums products.
+
+Return a list of lists of the suggested products after each character of searchWord is typed.
+
+
+Example 1:
+
+
+Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
+Output: [
+["mobile","moneypot","monitor"],
+["mobile","moneypot","monitor"],
+["mouse","mousepad"],
+["mouse","mousepad"],
+["mouse","mousepad"]
+]
+Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
+After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
+After typing mou, mous and mouse the system suggests ["mouse","mousepad"]
+
+
+Example 2:
+
+
+Input: products = ["havana"], searchWord = "havana"
+Output: [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]
+
+
+Example 3:
+
+
+Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
+Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]
+
+
+
+Constraints:
+
+
+ 1 <= products.length <= 10001 <= products[i].length <= 30001 <= sum(products[i].length) <= 2 * 104- All the strings of
products are unique.
+ products[i] consists of lowercase English letters.1 <= searchWord.length <= 1000searchWord consists of lowercase English letters.
+Related Topics
ArrayStringTrie
👍 3003👎 151
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P128LongestConsecutiveSequence.md b/src/leetcode/editor/en/doc/content/P128LongestConsecutiveSequence.md
new file mode 100644
index 0000000..88b5c5b
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P128LongestConsecutiveSequence.md
@@ -0,0 +1,28 @@
+Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
+
+You must write an algorithm that runs in O(n) time.
+
+
+Example 1:
+
+
+Input: nums = [100,4,200,1,3,2]
+Output: 4
+Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
+
+
+Example 2:
+
+
+Input: nums = [0,3,7,2,5,8,4,6,0,1]
+Output: 9
+
+
+
+Constraints:
+
+
+ 0 <= nums.length <= 105-109 <= nums[i] <= 109
+Related Topics
ArrayHash TableUnion Find
👍 11374👎 489
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1302DeepestLeavesSum.md b/src/leetcode/editor/en/doc/content/P1302DeepestLeavesSum.md
new file mode 100644
index 0000000..7a8802b
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1302DeepestLeavesSum.md
@@ -0,0 +1,24 @@
+Given the root of a binary tree, return the sum of values of its deepest leaves.
+
+Example 1:
+
+
+Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
+Output: 15
+
+
+Example 2:
+
+
+Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]
+Output: 19
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[1, 104].
+ 1 <= Node.val <= 100
+Related Topics
TreeDepth-First SearchBreadth-First SearchBinary Tree
👍 2954👎 81
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1354ConstructTargetArrayWithMultipleSums.md b/src/leetcode/editor/en/doc/content/P1354ConstructTargetArrayWithMultipleSums.md
new file mode 100644
index 0000000..749c9b5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1354ConstructTargetArrayWithMultipleSums.md
@@ -0,0 +1,47 @@
+You are given an array target of n integers. From a starting array arr consisting of n 1's, you may perform the following procedure :
+
+
+ - let
x be the sum of all elements currently in your array.
+ - choose index
i, such that 0 <= i < n and set the value of arr at index i to x.
+ - You may repeat this procedure as many times as needed.
+
+
+Return true if it is possible to construct the target array from arr, otherwise, return false.
+
+
+Example 1:
+
+
+Input: target = [9,3,5]
+Output: true
+Explanation: Start with arr = [1, 1, 1]
+[1, 1, 1], sum = 3 choose index 1
+[1, 3, 1], sum = 5 choose index 2
+[1, 3, 5], sum = 9 choose index 0
+[9, 3, 5] Done
+
+
+Example 2:
+
+
+Input: target = [1,1,1,2]
+Output: false
+Explanation: Impossible to create target array from [1,1,1,1].
+
+
+Example 3:
+
+
+Input: target = [8,5]
+Output: true
+
+
+
+Constraints:
+
+
+ n == target.length1 <= n <= 5 * 1041 <= target[i] <= 109
+Related Topics
ArrayHeap (Priority Queue)
👍 1489👎 116
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P135Candy.md b/src/leetcode/editor/en/doc/content/P135Candy.md
new file mode 100644
index 0000000..7641bb4
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P135Candy.md
@@ -0,0 +1,38 @@
+There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.
+
+You are giving candies to these children subjected to the following requirements:
+
+
+ - Each child must have at least one candy.
+ - Children with a higher rating get more candies than their neighbors.
+
+
+Return the minimum number of candies you need to have to distribute the candies to the children.
+
+
+Example 1:
+
+
+Input: ratings = [1,0,2]
+Output: 5
+Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.
+
+
+Example 2:
+
+
+Input: ratings = [1,2,2]
+Output: 4
+Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
+The third child gets 1 candy because it satisfies the above two conditions.
+
+
+
+Constraints:
+
+
+ n == ratings.length1 <= n <= 2 * 1040 <= ratings[i] <= 2 * 104
+Related Topics
ArrayGreedy
👍 3981👎 293
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1379FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.md b/src/leetcode/editor/en/doc/content/P1379FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.md
new file mode 100644
index 0000000..322d19e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1379FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.md
@@ -0,0 +1,43 @@
+Given two binary trees original and cloned and given a reference to a node target in the original tree.
+
+The cloned tree is a copy of the original tree.
+
+Return a reference to the same node in the cloned tree.
+
+Note that you are not allowed to change any of the two trees or the target node and the answer must be a reference to a node in the cloned tree.
+
+
+Example 1:
+
+
+Input: tree = [7,4,3,null,null,6,19], target = 3
+Output: 3
+Explanation: In all examples the original and cloned trees are shown. The target node is a green node from the original tree. The answer is the yellow node from the cloned tree.
+
+
+Example 2:
+
+
+Input: tree = [7], target = 7
+Output: 7
+
+
+Example 3:
+
+
+Input: tree = [8,null,6,null,5,null,4,null,3,null,2,null,1], target = 4
+Output: 4
+
+
+
+Constraints:
+
+
+ - The number of nodes in the
tree is in the range [1, 104].
+ - The values of the nodes of the
tree are unique.
+ target node is a node from the original tree and is not null.
+
+
+Follow up: Could you solve the problem if repeated values on the tree are allowed?
+Related Topics
TreeDepth-First SearchBreadth-First SearchBinary Tree
👍 1080👎 1398
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1396DesignUndergroundSystem.md b/src/leetcode/editor/en/doc/content/P1396DesignUndergroundSystem.md
new file mode 100644
index 0000000..b3b145b
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1396DesignUndergroundSystem.md
@@ -0,0 +1,90 @@
+An underground railway system is keeping track of customer travel times between different stations. They are using this data to calculate the average time it takes to travel from one station to another.
+
+Implement the UndergroundSystem class:
+
+
+ void checkIn(int id, string stationName, int t)
+
+
+ - A customer with a card ID equal to
id, checks in at the station stationName at time t.
+ - A customer can only be checked into one place at a time.
+
+ void checkOut(int id, string stationName, int t)
+
+ - A customer with a card ID equal to
id, checks out from the station stationName at time t.
+
+ double getAverageTime(string startStation, string endStation)
+
+ - Returns the average time it takes to travel from
startStation to endStation.
+ - The average time is computed from all the previous traveling times from
startStation to endStation that happened directly, meaning a check in at startStation followed by a check out from endStation.
+ - The time it takes to travel from
startStation to endStation may be different from the time it takes to travel from endStation to startStation.
+ - There will be at least one customer that has traveled from
startStation to endStation before getAverageTime is called.
+
+
+
+You may assume all calls to the checkIn and checkOut methods are consistent. If a customer checks in at time t1 then checks out at time t2, then t1 < t2. All events happen in chronological order.
+
+
+Example 1:
+
+
+Input
+["UndergroundSystem","checkIn","checkIn","checkIn","checkOut","checkOut","checkOut","getAverageTime","getAverageTime","checkIn","getAverageTime","checkOut","getAverageTime"]
+[[],[45,"Leyton",3],[32,"Paradise",8],[27,"Leyton",10],[45,"Waterloo",15],[27,"Waterloo",20],[32,"Cambridge",22],["Paradise","Cambridge"],["Leyton","Waterloo"],[10,"Leyton",24],["Leyton","Waterloo"],[10,"Waterloo",38],["Leyton","Waterloo"]]
+
+Output
+[null,null,null,null,null,null,null,14.00000,11.00000,null,11.00000,null,12.00000]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(45, "Leyton", 3);
+undergroundSystem.checkIn(32, "Paradise", 8);
+undergroundSystem.checkIn(27, "Leyton", 10);
+undergroundSystem.checkOut(45, "Waterloo", 15); // Customer 45 "Leyton" -> "Waterloo" in 15-3 = 12
+undergroundSystem.checkOut(27, "Waterloo", 20); // Customer 27 "Leyton" -> "Waterloo" in 20-10 = 10
+undergroundSystem.checkOut(32, "Cambridge", 22); // Customer 32 "Paradise" -> "Cambridge" in 22-8 = 14
+undergroundSystem.getAverageTime("Paradise", "Cambridge"); // return 14.00000. One trip "Paradise" -> "Cambridge", (14) / 1 = 14
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000. Two trips "Leyton" -> "Waterloo", (10 + 12) / 2 = 11
+undergroundSystem.checkIn(10, "Leyton", 24);
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 11.00000
+undergroundSystem.checkOut(10, "Waterloo", 38); // Customer 10 "Leyton" -> "Waterloo" in 38-24 = 14
+undergroundSystem.getAverageTime("Leyton", "Waterloo"); // return 12.00000. Three trips "Leyton" -> "Waterloo", (10 + 12 + 14) / 3 = 12
+
+
+Example 2:
+
+
+Input
+["UndergroundSystem","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime","checkIn","checkOut","getAverageTime"]
+[[],[10,"Leyton",3],[10,"Paradise",8],["Leyton","Paradise"],[5,"Leyton",10],[5,"Paradise",16],["Leyton","Paradise"],[2,"Leyton",21],[2,"Paradise",30],["Leyton","Paradise"]]
+
+Output
+[null,null,null,5.00000,null,null,5.50000,null,null,6.66667]
+
+Explanation
+UndergroundSystem undergroundSystem = new UndergroundSystem();
+undergroundSystem.checkIn(10, "Leyton", 3);
+undergroundSystem.checkOut(10, "Paradise", 8); // Customer 10 "Leyton" -> "Paradise" in 8-3 = 5
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.00000, (5) / 1 = 5
+undergroundSystem.checkIn(5, "Leyton", 10);
+undergroundSystem.checkOut(5, "Paradise", 16); // Customer 5 "Leyton" -> "Paradise" in 16-10 = 6
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 5.50000, (5 + 6) / 2 = 5.5
+undergroundSystem.checkIn(2, "Leyton", 21);
+undergroundSystem.checkOut(2, "Paradise", 30); // Customer 2 "Leyton" -> "Paradise" in 30-21 = 9
+undergroundSystem.getAverageTime("Leyton", "Paradise"); // return 6.66667, (5 + 6 + 9) / 3 = 6.66667
+
+
+
+Constraints:
+
+
+ 1 <= id, t <= 1061 <= stationName.length, startStation.length, endStation.length <= 10- All strings consist of uppercase and lowercase English letters and digits.
+ - There will be at most
2 * 104 calls in total to checkIn, checkOut, and getAverageTime.
+ - Answers within
10-5 of the actual value will be accepted.
+
+Related Topics
Hash TableStringDesign
👍 1767👎 91
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P141LinkedListCycle.md b/src/leetcode/editor/en/doc/content/P141LinkedListCycle.md
new file mode 100644
index 0000000..ee5b9f6
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P141LinkedListCycle.md
@@ -0,0 +1,43 @@
+Given head, the head of a linked list, determine if the linked list has a cycle in it.
+
+There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter.
+
+Return true if there is a cycle in the linked list. Otherwise, return false.
+
+
+Example 1:
+
+
+Input: head = [3,2,0,-4], pos = 1
+Output: true
+Explanation: There is a cycle in the linked list, where the tail connects to the 1st node (0-indexed).
+
+
+Example 2:
+
+
+Input: head = [1,2], pos = 0
+Output: true
+Explanation: There is a cycle in the linked list, where the tail connects to the 0th node.
+
+
+Example 3:
+
+
+Input: head = [1], pos = -1
+Output: false
+Explanation: There is no cycle in the linked list.
+
+
+
+Constraints:
+
+
+ - The number of the nodes in the list is in the range
[0, 104].
+ -105 <= Node.val <= 105pos is -1 or a valid index in the linked-list.
+
+
+Follow up: Can you solve it using O(1) (i.e. constant) memory?
+Related Topics
Hash TableLinked ListTwo Pointers
👍 7979👎 785
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1423MaximumPointsYouCanObtainFromCards.md b/src/leetcode/editor/en/doc/content/P1423MaximumPointsYouCanObtainFromCards.md
new file mode 100644
index 0000000..6c09405
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1423MaximumPointsYouCanObtainFromCards.md
@@ -0,0 +1,42 @@
+There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints.
+
+In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k cards.
+
+Your score is the sum of the points of the cards you have taken.
+
+Given the integer array cardPoints and the integer k, return the maximum score you can obtain.
+
+
+Example 1:
+
+
+Input: cardPoints = [1,2,3,4,5,6,1], k = 3
+Output: 12
+Explanation: After the first step, your score will always be 1. However, choosing the rightmost card first will maximize your total score. The optimal strategy is to take the three cards on the right, giving a final score of 1 + 6 + 5 = 12.
+
+
+Example 2:
+
+
+Input: cardPoints = [2,2,2], k = 2
+Output: 4
+Explanation: Regardless of which two cards you take, your score will always be 4.
+
+
+Example 3:
+
+
+Input: cardPoints = [9,7,7,9,7,7,9], k = 7
+Output: 55
+Explanation: You have to take all the cards. Your score is the sum of points of all cards.
+
+
+
+Constraints:
+
+
+ 1 <= cardPoints.length <= 1051 <= cardPoints[i] <= 1041 <= k <= cardPoints.length
+Related Topics
ArraySliding WindowPrefix Sum
👍 3636👎 136
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P142LinkedListCycleIi.md b/src/leetcode/editor/en/doc/content/P142LinkedListCycleIi.md
new file mode 100644
index 0000000..7ee2b7c
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P142LinkedListCycleIi.md
@@ -0,0 +1,43 @@
+Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null.
+
+There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to (0-indexed). It is -1 if there is no cycle. Note that pos is not passed as a parameter.
+
+Do not modify the linked list.
+
+
+Example 1:
+
+
+Input: head = [3,2,0,-4], pos = 1
+Output: tail connects to node index 1
+Explanation: There is a cycle in the linked list, where tail connects to the second node.
+
+
+Example 2:
+
+
+Input: head = [1,2], pos = 0
+Output: tail connects to node index 0
+Explanation: There is a cycle in the linked list, where tail connects to the first node.
+
+
+Example 3:
+
+
+Input: head = [1], pos = -1
+Output: no cycle
+Explanation: There is no cycle in the linked list.
+
+
+
+Constraints:
+
+
+ - The number of the nodes in the list is in the range
[0, 104].
+ -105 <= Node.val <= 105pos is -1 or a valid index in the linked-list.
+
+
+Follow up: Can you solve it using O(1) (i.e. constant) memory?
+Related Topics
Hash TableLinked ListTwo Pointers
👍 7171👎 471
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1461CheckIfAStringContainsAllBinaryCodesOfSizeK.md b/src/leetcode/editor/en/doc/content/P1461CheckIfAStringContainsAllBinaryCodesOfSizeK.md
new file mode 100644
index 0000000..e1b153e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1461CheckIfAStringContainsAllBinaryCodesOfSizeK.md
@@ -0,0 +1,36 @@
+Given a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false.
+
+
+Example 1:
+
+
+Input: s = "00110110", k = 2
+Output: true
+Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indices 0, 1, 3 and 2 respectively.
+
+
+Example 2:
+
+
+Input: s = "0110", k = 1
+Output: true
+Explanation: The binary codes of length 1 are "0" and "1", it is clear that both exist as a substring.
+
+
+Example 3:
+
+
+Input: s = "0110", k = 2
+Output: false
+Explanation: The binary code "00" is of length 2 and does not exist in the array.
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 5 * 105s[i] is either '0' or '1'.1 <= k <= 20
+Related Topics
Hash TableStringBit ManipulationRolling HashHash Function
👍 1589👎 78
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1465MaximumAreaOfAPieceOfCakeAfterHorizontalAndVerticalCuts.md b/src/leetcode/editor/en/doc/content/P1465MaximumAreaOfAPieceOfCakeAfterHorizontalAndVerticalCuts.md
new file mode 100644
index 0000000..7f3cc08
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1465MaximumAreaOfAPieceOfCakeAfterHorizontalAndVerticalCuts.md
@@ -0,0 +1,46 @@
+You are given a rectangular cake of size h x w and two arrays of integers horizontalCuts and verticalCuts where:
+
+
+ horizontalCuts[i] is the distance from the top of the rectangular cake to the ith horizontal cut and similarly, andverticalCuts[j] is the distance from the left of the rectangular cake to the jth vertical cut.
+
+Return the maximum area of a piece of cake after you cut at each horizontal and vertical position provided in the arrays horizontalCuts and verticalCuts. Since the answer can be a large number, return this modulo 109 + 7.
+
+
+Example 1:
+
+
+Input: h = 5, w = 4, horizontalCuts = [1,2,4], verticalCuts = [1,3]
+Output: 4
+Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green piece of cake has the maximum area.
+
+
+Example 2:
+
+
+Input: h = 5, w = 4, horizontalCuts = [3,1], verticalCuts = [1]
+Output: 6
+Explanation: The figure above represents the given rectangular cake. Red lines are the horizontal and vertical cuts. After you cut the cake, the green and yellow pieces of cake have the maximum area.
+
+
+Example 3:
+
+
+Input: h = 5, w = 4, horizontalCuts = [3], verticalCuts = [3]
+Output: 9
+
+
+
+Constraints:
+
+
+ 2 <= h, w <= 1091 <= horizontalCuts.length <= min(h - 1, 105)1 <= verticalCuts.length <= min(w - 1, 105)1 <= horizontalCuts[i] < h1 <= verticalCuts[i] < w- All the elements in
horizontalCuts are distinct.
+ - All the elements in
verticalCuts are distinct.
+
+Related Topics
ArrayGreedySorting
👍 2058👎 309
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1473PaintHouseIii.md b/src/leetcode/editor/en/doc/content/P1473PaintHouseIii.md
new file mode 100644
index 0000000..885fc05
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1473PaintHouseIii.md
@@ -0,0 +1,59 @@
+There is a row of m houses in a small city, each house must be painted with one of the n colors (labeled from 1 to n), some houses that have been painted last summer should not be painted again.
+
+A neighborhood is a maximal group of continuous houses that are painted with the same color.
+
+
+ - For example:
houses = [1,2,2,3,3,2,1,1] contains 5 neighborhoods [{1}, {2,2}, {3,3}, {2}, {1,1}].
+
+
+Given an array houses, an m x n matrix cost and an integer target where:
+
+
+ houses[i]: is the color of the house i, and 0 if the house is not painted yet.cost[i][j]: is the cost of paint the house i with the color j + 1.
+
+Return the minimum cost of painting all the remaining houses in such a way that there are exactly target neighborhoods. If it is not possible, return -1.
+
+
+Example 1:
+
+
+Input: houses = [0,0,0,0,0], cost = [[1,10],[10,1],[10,1],[1,10],[5,1]], m = 5, n = 2, target = 3
+Output: 9
+Explanation: Paint houses of this way [1,2,2,1,1]
+This array contains target = 3 neighborhoods, [{1}, {2,2}, {1,1}].
+Cost of paint all houses (1 + 1 + 1 + 1 + 5) = 9.
+
+
+Example 2:
+
+
+Input: houses = [0,2,1,2,0], cost = [[1,10],[10,1],[10,1],[1,10],[5,1]], m = 5, n = 2, target = 3
+Output: 11
+Explanation: Some houses are already painted, Paint the houses of this way [2,2,1,2,2]
+This array contains target = 3 neighborhoods, [{2,2}, {1}, {2,2}].
+Cost of paint the first and last house (10 + 1) = 11.
+
+
+Example 3:
+
+
+Input: houses = [3,1,2,3], cost = [[1,1,1],[1,1,1],[1,1,1],[1,1,1]], m = 4, n = 3, target = 3
+Output: -1
+Explanation: Houses are already painted with a total of 4 neighborhoods [{3},{1},{2},{3}] different of target = 3.
+
+
+
+Constraints:
+
+
+ m == houses.length == cost.lengthn == cost[i].length1 <= m <= 1001 <= n <= 201 <= target <= m0 <= houses[i] <= n1 <= cost[i][j] <= 104
+Related Topics
ArrayDynamic Programming
👍 1707👎 126
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1501CountriesYouCanSafelyInvestIn.md b/src/leetcode/editor/en/doc/content/P1501CountriesYouCanSafelyInvestIn.md
new file mode 100644
index 0000000..90f5667
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1501CountriesYouCanSafelyInvestIn.md
@@ -0,0 +1 @@
+null
👍 175👎 22
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P151ReverseWordsInAString.md b/src/leetcode/editor/en/doc/content/P151ReverseWordsInAString.md
new file mode 100644
index 0000000..3436a73
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P151ReverseWordsInAString.md
@@ -0,0 +1,44 @@
+Given an input string s, reverse the order of the words.
+
+A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.
+
+Return a string of the words in reverse order concatenated by a single space.
+
+Note that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separating the words. Do not include any extra spaces.
+
+
+Example 1:
+
+
+Input: s = "the sky is blue"
+Output: "blue is sky the"
+
+
+Example 2:
+
+
+Input: s = " hello world "
+Output: "world hello"
+Explanation: Your reversed string should not contain leading or trailing spaces.
+
+
+Example 3:
+
+
+Input: s = "a good example"
+Output: "example good a"
+Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 104s contains English letters (upper-case and lower-case), digits, and spaces ' '.- There is at least one word in
s.
+
+
+
+Follow-up: If the string data type is mutable in your language, can you solve it in-place with O(1) extra space?
+Related Topics
Two PointersString
👍 3014👎 3857
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1584MinCostToConnectAllPoints.md b/src/leetcode/editor/en/doc/content/P1584MinCostToConnectAllPoints.md
new file mode 100644
index 0000000..bc723f8
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1584MinCostToConnectAllPoints.md
@@ -0,0 +1,34 @@
+You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].
+
+The cost of connecting two points [xi, yi] and [xj, yj] is the manhattan distance between them: |xi - xj| + |yi - yj|, where |val| denotes the absolute value of val.
+
+Return the minimum cost to make all points connected. All points are connected if there is exactly one simple path between any two points.
+
+
+Example 1:
+
+
+Input: points = [[0,0],[2,2],[3,10],[5,2],[7,0]]
+Output: 20
+Explanation:
+
+We can connect the points as shown above to get the minimum cost of 20.
+Notice that there is a unique path between every pair of points.
+
+
+Example 2:
+
+
+Input: points = [[3,12],[-2,5],[-4,1]]
+Output: 18
+
+
+
+Constraints:
+
+
+ 1 <= points.length <= 1000-106 <= xi, yi <= 106- All pairs
(xi, yi) are distinct.
+
+Related Topics
ArrayUnion FindMinimum Spanning Tree
👍 1948👎 60
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P15ThreeSum.md b/src/leetcode/editor/en/doc/content/P15ThreeSum.md
new file mode 100644
index 0000000..b9e55ad
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P15ThreeSum.md
@@ -0,0 +1,23 @@
+Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
+
+Notice that the solution set must not contain duplicate triplets.
+
+
+Example 1:
+Input: nums = [-1,0,1,2,-1,-4]
+Output: [[-1,-1,2],[-1,0,1]]
+
Example 2:
+Input: nums = []
+Output: []
+
Example 3:
+Input: nums = [0]
+Output: []
+
+
+Constraints:
+
+
+ 0 <= nums.length <= 3000-105 <= nums[i] <= 105
+Related Topics
ArrayTwo PointersSorting
👍 17243👎 1658
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P160IntersectionOfTwoLinkedLists.md b/src/leetcode/editor/en/doc/content/P160IntersectionOfTwoLinkedLists.md
new file mode 100644
index 0000000..3d2d1f1
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P160IntersectionOfTwoLinkedLists.md
@@ -0,0 +1,66 @@
+Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.
+
+For example, the following two linked lists begin to intersect at node c1:
+
+The test cases are generated such that there are no cycles anywhere in the entire linked structure.
+
+Note that the linked lists must retain their original structure after the function returns.
+
+Custom Judge:
+
+The inputs to the judge are given as follows (your program is not given these inputs):
+
+
+ intersectVal - The value of the node where the intersection occurs. This is 0 if there is no intersected node.listA - The first linked list.listB - The second linked list.skipA - The number of nodes to skip ahead in listA (starting from the head) to get to the intersected node.skipB - The number of nodes to skip ahead in listB (starting from the head) to get to the intersected node.
+
+The judge will then create the linked structure based on these inputs and pass the two heads, headA and headB to your program. If you correctly return the intersected node, then your solution will be accepted.
+
+
+Example 1:
+
+
+Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5], skipA = 2, skipB = 3
+Output: Intersected at '8'
+Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect).
+From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,6,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.
+
+
+Example 2:
+
+
+Input: intersectVal = 2, listA = [1,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
+Output: Intersected at '2'
+Explanation: The intersected node's value is 2 (note that this must not be 0 if the two lists intersect).
+From the head of A, it reads as [1,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.
+
+
+Example 3:
+
+
+Input: intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
+Output: No intersection
+Explanation: From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values.
+Explanation: The two lists do not intersect, so return null.
+
+
+
+Constraints:
+
+
+ - The number of nodes of
listA is in the m.
+ - The number of nodes of
listB is in the n.
+ 1 <= m, n <= 3 * 1041 <= Node.val <= 1050 <= skipA < m0 <= skipB < nintersectVal is 0 if listA and listB do not intersect.intersectVal == listA[skipA] == listB[skipB] if listA and listB intersect.
+
+
+Follow up: Could you write a solution that runs in O(m + n) time and use only O(1) memory?Related Topics
Hash TableLinked ListTwo Pointers
👍 8684👎 872
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1631PathWithMinimumEffort.md b/src/leetcode/editor/en/doc/content/P1631PathWithMinimumEffort.md
new file mode 100644
index 0000000..96f1032
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1631PathWithMinimumEffort.md
@@ -0,0 +1,45 @@
+You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed). You can move up, down, left, or right, and you wish to find a route that requires the minimum effort.
+
+A route's effort is the maximum absolute difference in heights between two consecutive cells of the route.
+
+Return the minimum effort required to travel from the top-left cell to the bottom-right cell.
+
+
+Example 1:
+
+
+
+
+Input: heights = [[1,2,2],[3,8,2],[5,3,5]]
+Output: 2
+Explanation: The route of [1,3,5,3,5] has a maximum absolute difference of 2 in consecutive cells.
+This is better than the route of [1,2,2,2,5], where the maximum absolute difference is 3.
+
+
+Example 2:
+
+
+
+
+Input: heights = [[1,2,3],[3,8,4],[5,3,5]]
+Output: 1
+Explanation: The route of [1,2,3,4,5] has a maximum absolute difference of 1 in consecutive cells, which is better than route [1,3,5,3,5].
+
+
+Example 3:
+
+
+Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]]
+Output: 0
+Explanation: This route does not require any effort.
+
+
+
+Constraints:
+
+
+ rows == heights.lengthcolumns == heights[i].length1 <= rows, columns <= 1001 <= heights[i][j] <= 106
Related Topics
ArrayBinary SearchDepth-First SearchBreadth-First SearchUnion FindHeap (Priority Queue)Matrix
👍 2780👎 116
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1641CountSortedVowelStrings.md b/src/leetcode/editor/en/doc/content/P1641CountSortedVowelStrings.md
new file mode 100644
index 0000000..0d8147c
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1641CountSortedVowelStrings.md
@@ -0,0 +1,37 @@
+Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted.
+
+A string s is lexicographically sorted if for all valid i, s[i] is the same as or comes before s[i+1] in the alphabet.
+
+
+Example 1:
+
+
+Input: n = 1
+Output: 5
+Explanation: The 5 sorted strings that consist of vowels only are ["a","e","i","o","u"].
+
+
+Example 2:
+
+
+Input: n = 2
+Output: 15
+Explanation: The 15 sorted strings that consist of vowels only are
+["aa","ae","ai","ao","au","ee","ei","eo","eu","ii","io","iu","oo","ou","uu"].
+Note that "ea" is not a valid string since 'e' comes after 'a' in the alphabet.
+
+
+Example 3:
+
+
+Input: n = 33
+Output: 66045
+
+
+
+Constraints:
+
+
+Related Topics
Dynamic Programming
👍 2539👎 58
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1642FurthestBuildingYouCanReach.md b/src/leetcode/editor/en/doc/content/P1642FurthestBuildingYouCanReach.md
new file mode 100644
index 0000000..760c23d
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1642FurthestBuildingYouCanReach.md
@@ -0,0 +1,51 @@
+You are given an integer array heights representing the heights of buildings, some bricks, and some ladders.
+
+You start your journey from building 0 and move to the next building by possibly using bricks or ladders.
+
+While moving from building i to building i+1 (0-indexed),
+
+
+ - If the current building's height is greater than or equal to the next building's height, you do not need a ladder or bricks.
+ - If the current building's height is less than the next building's height, you can either use one ladder or
(h[i+1] - h[i]) bricks.
+
+
+Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.
+
+
+Example 1:
+
+
+Input: heights = [4,2,7,6,9,14,12], bricks = 5, ladders = 1
+Output: 4
+Explanation: Starting at building 0, you can follow these steps:
+- Go to building 1 without using ladders nor bricks since 4 >= 2.
+- Go to building 2 using 5 bricks. You must use either bricks or ladders because 2 < 7.
+- Go to building 3 without using ladders nor bricks since 7 >= 6.
+- Go to building 4 using your only ladder. You must use either bricks or ladders because 6 < 9.
+It is impossible to go beyond building 4 because you do not have any more bricks or ladders.
+
+
+Example 2:
+
+
+Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
+Output: 7
+
+
+Example 3:
+
+
+Input: heights = [14,3,19,3], bricks = 17, ladders = 0
+Output: 3
+
+
+
+Constraints:
+
+
+ 1 <= heights.length <= 1051 <= heights[i] <= 1060 <= bricks <= 1090 <= ladders <= heights.length
+Related Topics
ArrayGreedyHeap (Priority Queue)
👍 2987👎 71
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1647MinimumDeletionsToMakeCharacterFrequenciesUnique.md b/src/leetcode/editor/en/doc/content/P1647MinimumDeletionsToMakeCharacterFrequenciesUnique.md
new file mode 100644
index 0000000..2c791ea
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1647MinimumDeletionsToMakeCharacterFrequenciesUnique.md
@@ -0,0 +1,40 @@
+A string s is called good if there are no two different characters in s that have the same frequency.
+
+Given a string s, return the minimum number of characters you need to delete to make s good.
+
+The frequency of a character in a string is the number of times it appears in the string. For example, in the string "aab", the frequency of 'a' is 2, while the frequency of 'b' is 1.
+
+
+Example 1:
+
+
+Input: s = "aab"
+Output: 0
+Explanation: s is already good.
+
+
+Example 2:
+
+
+Input: s = "aaabbbcc"
+Output: 2
+Explanation: You can delete two 'b's resulting in the good string "aaabcc".
+Another way it to delete one 'b' and one 'c' resulting in the good string "aaabbc".
+
+Example 3:
+
+
+Input: s = "ceabaacb"
+Output: 2
+Explanation: You can delete both 'c's resulting in the good string "eabaab".
+Note that we only care about characters that are still in the string at the end (i.e. frequency of 0 is ignored).
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 105s contains only lowercase English letters.
+Related Topics
StringGreedySorting
👍 2382👎 42
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1658MinimumOperationsToReduceXToZero.md b/src/leetcode/editor/en/doc/content/P1658MinimumOperationsToReduceXToZero.md
new file mode 100644
index 0000000..2698585
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1658MinimumOperationsToReduceXToZero.md
@@ -0,0 +1,37 @@
+You are given an integer array nums and an integer x. In one operation, you can either remove the leftmost or the rightmost element from the array nums and subtract its value from x. Note that this modifies the array for future operations.
+
+Return the minimum number of operations to reduce x to exactly 0 if it is possible, otherwise, return -1.
+
+
+Example 1:
+
+
+Input: nums = [1,1,4,2,3], x = 5
+Output: 2
+Explanation: The optimal solution is to remove the last two elements to reduce x to zero.
+
+
+Example 2:
+
+
+Input: nums = [5,6,7,8,9], x = 4
+Output: -1
+
+
+Example 3:
+
+
+Input: nums = [3,2,20,1,1,3], x = 10
+Output: 5
+Explanation: The optimal solution is to remove the last three elements and the first two elements (5 operations in total) to reduce x to zero.
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 1041 <= x <= 109
+Related Topics
ArrayHash TableBinary SearchSliding WindowPrefix Sum
👍 2989👎 63
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1679MaxNumberOfKSumPairs.md b/src/leetcode/editor/en/doc/content/P1679MaxNumberOfKSumPairs.md
new file mode 100644
index 0000000..942e5a9
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1679MaxNumberOfKSumPairs.md
@@ -0,0 +1,35 @@
+You are given an integer array nums and an integer k.
+
+In one operation, you can pick two numbers from the array whose sum equals k and remove them from the array.
+
+Return the maximum number of operations you can perform on the array.
+
+
+Example 1:
+
+
+Input: nums = [1,2,3,4], k = 5
+Output: 2
+Explanation: Starting with nums = [1,2,3,4]:
+- Remove numbers 1 and 4, then nums = [2,3]
+- Remove numbers 2 and 3, then nums = []
+There are no more pairs that sum up to 5, hence a total of 2 operations.
+
+Example 2:
+
+
+Input: nums = [3,1,3,4,3], k = 6
+Output: 1
+Explanation: Starting with nums = [3,1,3,4,3]:
+- Remove the first two 3's, then nums = [1,4,3]
+There are no more pairs that sum up to 6, hence a total of 1 operation.
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 1091 <= k <= 109
+Related Topics
ArrayHash TableTwo PointersSorting
👍 1464👎 34
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P167TwoSumIiInputArrayIsSorted.md b/src/leetcode/editor/en/doc/content/P167TwoSumIiInputArrayIsSorted.md
new file mode 100644
index 0000000..f0b83a3
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P167TwoSumIiInputArrayIsSorted.md
@@ -0,0 +1,44 @@
+Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.
+
+Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.
+
+The tests are generated such that there is exactly one solution. You may not use the same element twice.
+
+Your solution must use only constant extra space.
+
+
+Example 1:
+
+
+Input: numbers = [2,7,11,15], target = 9
+Output: [1,2]
+Explanation: The sum of 2 and 7 is 9. Therefore, index1 = 1, index2 = 2. We return [1, 2].
+
+
+Example 2:
+
+
+Input: numbers = [2,3,4], target = 6
+Output: [1,3]
+Explanation: The sum of 2 and 4 is 6. Therefore index1 = 1, index2 = 3. We return [1, 3].
+
+
+Example 3:
+
+
+Input: numbers = [-1,0], target = -1
+Output: [1,2]
+Explanation: The sum of -1 and 0 is -1. Therefore index1 = 1, index2 = 2. We return [1, 2].
+
+
+
+Constraints:
+
+
+ 2 <= numbers.length <= 3 * 104-1000 <= numbers[i] <= 1000numbers is sorted in non-decreasing order.-1000 <= target <= 1000- The tests are generated such that there is exactly one solution.
+
+Related Topics
ArrayTwo PointersBinary Search
👍 5339👎 935
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1689PartitioningIntoMinimumNumberOfDeciBinaryNumbers.md b/src/leetcode/editor/en/doc/content/P1689PartitioningIntoMinimumNumberOfDeciBinaryNumbers.md
new file mode 100644
index 0000000..0504913
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1689PartitioningIntoMinimumNumberOfDeciBinaryNumbers.md
@@ -0,0 +1,36 @@
+A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For example, 101 and 1100 are deci-binary, while 112 and 3001 are not.
+
+Given a string n that represents a positive decimal integer, return the minimum number of positive deci-binary numbers needed so that they sum up to n.
+
+
+Example 1:
+
+
+Input: n = "32"
+Output: 3
+Explanation: 10 + 11 + 11 = 32
+
+
+Example 2:
+
+
+Input: n = "82734"
+Output: 8
+
+
+Example 3:
+
+
+Input: n = "27346209830709182346"
+Output: 9
+
+
+
+Constraints:
+
+
+ 1 <= n.length <= 105n consists of only digits.n does not contain any leading zeros and represents a positive integer.
+Related Topics
StringGreedy
👍 1436👎 971
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1695MaximumErasureValue.md b/src/leetcode/editor/en/doc/content/P1695MaximumErasureValue.md
new file mode 100644
index 0000000..6522a18
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1695MaximumErasureValue.md
@@ -0,0 +1,31 @@
+You are given an array of positive integers nums and want to erase a subarray containing unique elements. The score you get by erasing the subarray is equal to the sum of its elements.
+
+Return the maximum score you can get by erasing exactly one subarray.
+
+An array b is called to be a subarray of a if it forms a contiguous subsequence of a, that is, if it is equal to a[l],a[l+1],...,a[r] for some (l,r).
+
+
+Example 1:
+
+
+Input: nums = [4,2,4,5,6]
+Output: 17
+Explanation: The optimal subarray here is [2,4,5,6].
+
+
+Example 2:
+
+
+Input: nums = [5,2,1,2,5,2,1,2,5]
+Output: 8
+Explanation: The optimal subarray here is [5,2,1] or [1,2,5].
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 104
+Related Topics
ArrayHash TableSliding Window
👍 1808👎 31
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P173BinarySearchTreeIterator.md b/src/leetcode/editor/en/doc/content/P173BinarySearchTreeIterator.md
new file mode 100644
index 0000000..709ca96
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P173BinarySearchTreeIterator.md
@@ -0,0 +1,51 @@
+Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):
+
+
+ BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.boolean hasNext() Returns true if there exists a number in the traversal to the right of the pointer, otherwise returns false.int next() Moves the pointer to the right, then returns the number at the pointer.
+
+Notice that by initializing the pointer to a non-existent smallest number, the first call to next() will return the smallest element in the BST.
+
+You may assume that next() calls will always be valid. That is, there will be at least a next number in the in-order traversal when next() is called.
+
+
+Example 1:
+
+
+Input
+["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
+[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]
+Output
+[null, 3, 7, true, 9, true, 15, true, 20, false]
+
+Explanation
+BSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);
+bSTIterator.next(); // return 3
+bSTIterator.next(); // return 7
+bSTIterator.hasNext(); // return True
+bSTIterator.next(); // return 9
+bSTIterator.hasNext(); // return True
+bSTIterator.next(); // return 15
+bSTIterator.hasNext(); // return True
+bSTIterator.next(); // return 20
+bSTIterator.hasNext(); // return False
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[1, 105].
+ 0 <= Node.val <= 106- At most
105 calls will be made to hasNext, and next.
+
+
+
+Follow up:
+
+
+ - Could you implement
next() and hasNext() to run in average O(1) time and use O(h) memory, where h is the height of the tree?
+
+Related Topics
StackTreeDesignBinary Search TreeBinary TreeIterator
👍 5726👎 384
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P1793MaximumScoreOfAGoodSubarray.md b/src/leetcode/editor/en/doc/content/P1793MaximumScoreOfAGoodSubarray.md
new file mode 100644
index 0000000..ddf2084
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P1793MaximumScoreOfAGoodSubarray.md
@@ -0,0 +1,32 @@
+You are given an array of integers nums (0-indexed) and an integer k.
+
+The score of a subarray (i, j) is defined as min(nums[i], nums[i+1], ..., nums[j]) * (j - i + 1). A good subarray is a subarray where i <= k <= j.
+
+Return the maximum possible score of a good subarray.
+
+
+Example 1:
+
+
+Input: nums = [1,4,3,7,4,5], k = 3
+Output: 15
+Explanation: The optimal subarray is (1, 5) with a score of min(4,3,7,4,5) * (5-1+1) = 3 * 5 = 15.
+
+
+Example 2:
+
+
+Input: nums = [5,5,4,5,4,1,1,1], k = 0
+Output: 20
+Explanation: The optimal subarray is (0, 4) with a score of min(5,5,4,5,4) * (4-0+1) = 4 * 5 = 20.
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1051 <= nums[i] <= 2 * 1040 <= k < nums.length
+Related Topics
ArrayTwo PointersBinary SearchStackMonotonic Stack
👍 653👎 26
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P17LetterCombinationsOfAPhoneNumber.md b/src/leetcode/editor/en/doc/content/P17LetterCombinationsOfAPhoneNumber.md
new file mode 100644
index 0000000..a3de52f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P17LetterCombinationsOfAPhoneNumber.md
@@ -0,0 +1,36 @@
+Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
+
+A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.
+
+
+
+
+Example 1:
+
+
+Input: digits = "23"
+Output: ["ad","ae","af","bd","be","bf","cd","ce","cf"]
+
+
+Example 2:
+
+
+Input: digits = ""
+Output: []
+
+
+Example 3:
+
+
+Input: digits = "2"
+Output: ["a","b","c"]
+
+
+
+Constraints:
+
+
+ 0 <= digits.length <= 4digits[i] is a digit in the range ['2', '9'].
+Related Topics
Hash TableStringBacktracking
👍 10285👎 684
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P18FourSum.md b/src/leetcode/editor/en/doc/content/P18FourSum.md
new file mode 100644
index 0000000..007a6e5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P18FourSum.md
@@ -0,0 +1,34 @@
+Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:
+
+
+ 0 <= a, b, c, d < na, b, c, and d are distinct.nums[a] + nums[b] + nums[c] + nums[d] == target
+
+You may return the answer in any order.
+
+
+Example 1:
+
+
+Input: nums = [1,0,-1,0,-2,2], target = 0
+Output: [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]
+
+
+Example 2:
+
+
+Input: nums = [2,2,2,2,2], target = 8
+Output: [[2,2,2,2]]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 200-109 <= nums[i] <= 109-109 <= target <= 109
+Related Topics
ArrayTwo PointersSorting
👍 6011👎 686
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P191NumberOf1Bits.md b/src/leetcode/editor/en/doc/content/P191NumberOf1Bits.md
new file mode 100644
index 0000000..877a519
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P191NumberOf1Bits.md
@@ -0,0 +1,43 @@
+Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight).
+
+Note:
+
+
+ - Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned.
+ - In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 3, the input represents the signed integer.
-3.
+
+
+
+Example 1:
+
+
+Input: n = 00000000000000000000000000001011
+Output: 3
+Explanation: The input binary string 00000000000000000000000000001011 has a total of three '1' bits.
+
+
+Example 2:
+
+
+Input: n = 00000000000000000000000010000000
+Output: 1
+Explanation: The input binary string 00000000000000000000000010000000 has a total of one '1' bit.
+
+
+Example 3:
+
+
+Input: n = 11111111111111111111111111111101
+Output: 31
+Explanation: The input binary string 11111111111111111111111111111101 has a total of thirty one '1' bits.
+
+
+
+Constraints:
+
+
+ - The input must be a binary string of length
32.
+
+
+
+Follow up: If this function is called many times, how would you optimize it?Related Topics
Bit Manipulation
👍 3433👎 836
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P199BinaryTreeRightSideView.md b/src/leetcode/editor/en/doc/content/P199BinaryTreeRightSideView.md
new file mode 100644
index 0000000..a744ba6
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P199BinaryTreeRightSideView.md
@@ -0,0 +1,32 @@
+Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
+
+
+Example 1:
+
+
+Input: root = [1,2,3,null,5,null,4]
+Output: [1,3,4]
+
+
+Example 2:
+
+
+Input: root = [1,null,3]
+Output: [1,3]
+
+
+Example 3:
+
+
+Input: root = []
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 100].
+ -100 <= Node.val <= 100
+Related Topics
TreeDepth-First SearchBreadth-First SearchBinary Tree
👍 7586👎 429
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P19RemoveNthNodeFromEndOfList.md b/src/leetcode/editor/en/doc/content/P19RemoveNthNodeFromEndOfList.md
new file mode 100644
index 0000000..c2263b4
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P19RemoveNthNodeFromEndOfList.md
@@ -0,0 +1,37 @@
+Given the head of a linked list, remove the nth node from the end of the list and return its head.
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4,5], n = 2
+Output: [1,2,3,5]
+
+
+Example 2:
+
+
+Input: head = [1], n = 1
+Output: []
+
+
+Example 3:
+
+
+Input: head = [1,2], n = 1
+Output: [1]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is
sz.
+ 1 <= sz <= 300 <= Node.val <= 1001 <= n <= sz
+
+
+Follow up: Could you do this in one pass?
+Related Topics
Linked ListTwo Pointers
👍 9788👎 467
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P215KthLargestElementInAnArray.md b/src/leetcode/editor/en/doc/content/P215KthLargestElementInAnArray.md
new file mode 100644
index 0000000..90d2bcd
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P215KthLargestElementInAnArray.md
@@ -0,0 +1,20 @@
+Given an integer array nums and an integer k, return the kth largest element in the array.
+
+Note that it is the kth largest element in the sorted order, not the kth distinct element.
+
+
+Example 1:
+Input: nums = [3,2,1,5,6,4], k = 2
+Output: 5
+
Example 2:
+Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
+Output: 4
+
+
+Constraints:
+
+
+ 1 <= k <= nums.length <= 104-104 <= nums[i] <= 104
+Related Topics
ArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect
👍 9534👎 499
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P216CombinationSumIii.md b/src/leetcode/editor/en/doc/content/P216CombinationSumIii.md
new file mode 100644
index 0000000..25c6431
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P216CombinationSumIii.md
@@ -0,0 +1,48 @@
+Find all valid combinations of k numbers that sum up to n such that the following conditions are true:
+
+
+ - Only numbers
1 through 9 are used.
+ - Each number is used at most once.
+
+
+Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in any order.
+
+
+Example 1:
+
+
+Input: k = 3, n = 7
+Output: [[1,2,4]]
+Explanation:
+1 + 2 + 4 = 7
+There are no other valid combinations.
+
+Example 2:
+
+
+Input: k = 3, n = 9
+Output: [[1,2,6],[1,3,5],[2,3,4]]
+Explanation:
+1 + 2 + 6 = 9
+1 + 3 + 5 = 9
+2 + 3 + 4 = 9
+There are no other valid combinations.
+
+
+Example 3:
+
+
+Input: k = 4, n = 1
+Output: []
+Explanation: There are no valid combinations.
+Using 4 different numbers in the range [1,9], the smallest sum we can get is 1+2+3+4 = 10 and since 10 > 1, there are no valid combination.
+
+
+
+Constraints:
+
+
+ 2 <= k <= 91 <= n <= 60
+Related Topics
ArrayBacktracking
👍 3401👎 82
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P21MergeTwoSortedLists.md b/src/leetcode/editor/en/doc/content/P21MergeTwoSortedLists.md
new file mode 100644
index 0000000..41fe00c
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P21MergeTwoSortedLists.md
@@ -0,0 +1,37 @@
+You are given the heads of two sorted linked lists list1 and list2.
+
+Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.
+
+Return the head of the merged linked list.
+
+
+Example 1:
+
+
+Input: list1 = [1,2,4], list2 = [1,3,4]
+Output: [1,1,2,3,4,4]
+
+
+Example 2:
+
+
+Input: list1 = [], list2 = []
+Output: []
+
+
+Example 3:
+
+
+Input: list1 = [], list2 = [0]
+Output: [0]
+
+
+
+Constraints:
+
+
+ - The number of nodes in both lists is in the range
[0, 50].
+ -100 <= Node.val <= 100- Both
list1 and list2 are sorted in non-decreasing order.
+
+Related Topics
Linked ListRecursion
👍 11972👎 1099
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P222CountCompleteTreeNodes.md b/src/leetcode/editor/en/doc/content/P222CountCompleteTreeNodes.md
new file mode 100644
index 0000000..eb064f7
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P222CountCompleteTreeNodes.md
@@ -0,0 +1,37 @@
+Given the root of a complete binary tree, return the number of the nodes in the tree.
+
+According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h.
+
+Design an algorithm that runs in less than O(n) time complexity.
+
+
+Example 1:
+
+
+Input: root = [1,2,3,4,5,6]
+Output: 6
+
+
+Example 2:
+
+
+Input: root = []
+Output: 0
+
+
+Example 3:
+
+
+Input: root = [1]
+Output: 1
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 5 * 104].
+ 0 <= Node.val <= 5 * 104- The tree is guaranteed to be complete.
+
+Related Topics
Binary SearchTreeDepth-First SearchBinary Tree
👍 5094👎 316
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P225ImplementStackUsingQueues.md b/src/leetcode/editor/en/doc/content/P225ImplementStackUsingQueues.md
new file mode 100644
index 0000000..b039ce5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P225ImplementStackUsingQueues.md
@@ -0,0 +1,49 @@
+Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).
+
+Implement the MyStack class:
+
+
+ void push(int x) Pushes element x to the top of the stack.int pop() Removes the element on the top of the stack and returns it.int top() Returns the element on the top of the stack.boolean empty() Returns true if the stack is empty, false otherwise.
+
+Notes:
+
+
+ - You must use only standard operations of a queue, which means that only
push to back, peek/pop from front, size and is empty operations are valid.
+ - Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue's standard operations.
+
+
+
+Example 1:
+
+
+Input
+["MyStack", "push", "push", "top", "pop", "empty"]
+[[], [1], [2], [], [], []]
+Output
+[null, null, null, 2, 2, false]
+
+Explanation
+MyStack myStack = new MyStack();
+myStack.push(1);
+myStack.push(2);
+myStack.top(); // return 2
+myStack.pop(); // return 2
+myStack.empty(); // return False
+
+
+
+Constraints:
+
+
+ 1 <= x <= 9- At most
100 calls will be made to push, pop, top, and empty.
+ - All the calls to
pop and top are valid.
+
+
+
+Follow-up: Can you implement the stack using only one queue?
+Related Topics
StackDesignQueue
👍 2057👎 782
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P232ImplementQueueUsingStacks.md b/src/leetcode/editor/en/doc/content/P232ImplementQueueUsingStacks.md
new file mode 100644
index 0000000..9171944
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P232ImplementQueueUsingStacks.md
@@ -0,0 +1,49 @@
+Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).
+
+Implement the MyQueue class:
+
+
+ void push(int x) Pushes element x to the back of the queue.int pop() Removes the element from the front of the queue and returns it.int peek() Returns the element at the front of the queue.boolean empty() Returns true if the queue is empty, false otherwise.
+
+Notes:
+
+
+ - You must use only standard operations of a stack, which means only
push to top, peek/pop from top, size, and is empty operations are valid.
+ - Depending on your language, the stack may not be supported natively. You may simulate a stack using a list or deque (double-ended queue) as long as you use only a stack's standard operations.
+
+
+
+Example 1:
+
+
+Input
+["MyQueue", "push", "push", "peek", "pop", "empty"]
+[[], [1], [2], [], [], []]
+Output
+[null, null, null, 1, 1, false]
+
+Explanation
+MyQueue myQueue = new MyQueue();
+myQueue.push(1); // queue is: [1]
+myQueue.push(2); // queue is: [1, 2] (leftmost is front of the queue)
+myQueue.peek(); // return 1
+myQueue.pop(); // return 1, queue is [2]
+myQueue.empty(); // return false
+
+
+
+Constraints:
+
+
+ 1 <= x <= 9- At most
100 calls will be made to push, pop, peek, and empty.
+ - All the calls to
pop and peek are valid.
+
+
+
+Follow-up: Can you implement the queue such that each operation is amortized O(1) time complexity? In other words, performing n operations will take overall O(n) time even if one of those operations may take longer.
+Related Topics
StackDesignQueue
👍 3256👎 219
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P236LowestCommonAncestorOfABinaryTree.md b/src/leetcode/editor/en/doc/content/P236LowestCommonAncestorOfABinaryTree.md
new file mode 100644
index 0000000..1dd1731
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P236LowestCommonAncestorOfABinaryTree.md
@@ -0,0 +1,39 @@
+Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
+
+According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
+
+
+Example 1:
+
+
+Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
+Output: 3
+Explanation: The LCA of nodes 5 and 1 is 3.
+
+
+Example 2:
+
+
+Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 4
+Output: 5
+Explanation: The LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.
+
+
+Example 3:
+
+
+Input: root = [1,2], p = 1, q = 2
+Output: 1
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[2, 105].
+ -109 <= Node.val <= 109- All
Node.val are unique.
+ p != qp and q will exist in the tree.
+Related Topics
TreeDepth-First SearchBinary Tree
👍 10172👎 283
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P23MergeKSortedLists.md b/src/leetcode/editor/en/doc/content/P23MergeKSortedLists.md
new file mode 100644
index 0000000..d91aedb
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P23MergeKSortedLists.md
@@ -0,0 +1,46 @@
+You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
+
+Merge all the linked-lists into one sorted linked-list and return it.
+
+
+Example 1:
+
+
+Input: lists = [[1,4,5],[1,3,4],[2,6]]
+Output: [1,1,2,3,4,4,5,6]
+Explanation: The linked-lists are:
+[
+ 1->4->5,
+ 1->3->4,
+ 2->6
+]
+merging them into one sorted list:
+1->1->2->3->4->4->5->6
+
+
+Example 2:
+
+
+Input: lists = []
+Output: []
+
+
+Example 3:
+
+
+Input: lists = [[]]
+Output: []
+
+
+
+Constraints:
+
+
+ k == lists.length0 <= k <= 1040 <= lists[i].length <= 500-104 <= lists[i][j] <= 104lists[i] is sorted in ascending order.- The sum of
lists[i].length will not exceed 104.
+
+Related Topics
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
👍 12019👎 469
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P25ReverseNodesInKGroup.md b/src/leetcode/editor/en/doc/content/P25ReverseNodesInKGroup.md
new file mode 100644
index 0000000..08c26b4
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P25ReverseNodesInKGroup.md
@@ -0,0 +1,33 @@
+Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
+
+k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is.
+
+You may not alter the values in the list's nodes, only nodes themselves may be changed.
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4,5], k = 2
+Output: [2,1,4,3,5]
+
+
+Example 2:
+
+
+Input: head = [1,2,3,4,5], k = 3
+Output: [3,2,1,4,5]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is
n.
+ 1 <= k <= n <= 50000 <= Node.val <= 1000
+
+
+Follow-up: Can you solve the problem in O(1) extra memory space?
+Related Topics
Linked ListRecursion
👍 6996👎 487
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P268MissingNumber.md b/src/leetcode/editor/en/doc/content/P268MissingNumber.md
new file mode 100644
index 0000000..1e7f3a5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P268MissingNumber.md
@@ -0,0 +1,40 @@
+Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
+
+
+Example 1:
+
+
+Input: nums = [3,0,1]
+Output: 2
+Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
+
+
+Example 2:
+
+
+Input: nums = [0,1]
+Output: 2
+Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.
+
+
+Example 3:
+
+
+Input: nums = [9,6,4,2,3,5,7,0,1]
+Output: 8
+Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.
+
+
+
+Constraints:
+
+
+ n == nums.length1 <= n <= 1040 <= nums[i] <= n- All the numbers of
nums are unique.
+
+
+
+Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?
+Related Topics
ArrayHash TableMathBit ManipulationSorting
👍 6026👎 2878
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P26RemoveDuplicatesFromSortedArray.md b/src/leetcode/editor/en/doc/content/P26RemoveDuplicatesFromSortedArray.md
new file mode 100644
index 0000000..db651d1
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P26RemoveDuplicatesFromSortedArray.md
@@ -0,0 +1,54 @@
+Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.
+
+Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.
+
+Return k after placing the final result in the first k slots of nums.
+
+Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
+
+Custom Judge:
+
+The judge will test your solution with the following code:
+
+
+int[] nums = [...]; // Input array
+int[] expectedNums = [...]; // The expected answer with correct length
+
+int k = removeDuplicates(nums); // Calls your implementation
+
+assert k == expectedNums.length;
+for (int i = 0; i < k; i++) {
+ assert nums[i] == expectedNums[i];
+}
+
+
+If all assertions pass, then your solution will be accepted.
+
+
+Example 1:
+
+
+Input: nums = [1,1,2]
+Output: 2, nums = [1,2,_]
+Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+
+
+Example 2:
+
+
+Input: nums = [0,0,1,1,1,2,2,3,3,4]
+Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
+Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 3 * 104-100 <= nums[i] <= 100nums is sorted in non-decreasing order.
+Related Topics
ArrayTwo Pointers
👍 6528👎 10111
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P27RemoveElement.md b/src/leetcode/editor/en/doc/content/P27RemoveElement.md
new file mode 100644
index 0000000..7cb4268
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P27RemoveElement.md
@@ -0,0 +1,58 @@
+Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.
+
+Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.
+
+Return k after placing the final result in the first k slots of nums.
+
+Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
+
+Custom Judge:
+
+The judge will test your solution with the following code:
+
+
+int[] nums = [...]; // Input array
+int val = ...; // Value to remove
+int[] expectedNums = [...]; // The expected answer with correct length.
+ // It is sorted with no values equaling val.
+
+int k = removeElement(nums, val); // Calls your implementation
+
+assert k == expectedNums.length;
+sort(nums, 0, k); // Sort the first k elements of nums
+for (int i = 0; i < actualLength; i++) {
+ assert nums[i] == expectedNums[i];
+}
+
+
+If all assertions pass, then your solution will be accepted.
+
+
+Example 1:
+
+
+Input: nums = [3,2,2,3], val = 3
+Output: 2, nums = [2,2,_,_]
+Explanation: Your function should return k = 2, with the first two elements of nums being 2.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+
+
+Example 2:
+
+
+Input: nums = [0,1,2,2,3,0,4,2], val = 2
+Output: 5, nums = [0,1,4,0,3,_,_,_]
+Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.
+Note that the five elements can be returned in any order.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+
+
+
+Constraints:
+
+
+ 0 <= nums.length <= 1000 <= nums[i] <= 500 <= val <= 100
+Related Topics
ArrayTwo Pointers
👍 3536👎 5226
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P284PeekingIterator.md b/src/leetcode/editor/en/doc/content/P284PeekingIterator.md
new file mode 100644
index 0000000..760d8e9
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P284PeekingIterator.md
@@ -0,0 +1,44 @@
+Design an iterator that supports the peek operation on an existing iterator in addition to the hasNext and the next operations.
+
+Implement the PeekingIterator class:
+
+
+ PeekingIterator(Iterator<int> nums) Initializes the object with the given integer iterator iterator.int next() Returns the next element in the array and moves the pointer to the next element.boolean hasNext() Returns true if there are still elements in the array.int peek() Returns the next element in the array without moving the pointer.
+
+Note: Each language may have a different implementation of the constructor and Iterator, but they all support the int next() and boolean hasNext() functions.
+
+
+Example 1:
+
+
+Input
+["PeekingIterator", "next", "peek", "next", "next", "hasNext"]
+[[[1, 2, 3]], [], [], [], [], []]
+Output
+[null, 1, 2, 2, 3, false]
+
+Explanation
+PeekingIterator peekingIterator = new PeekingIterator([1, 2, 3]); // [1,2,3]
+peekingIterator.next(); // return 1, the pointer moves to the next element [1,2,3].
+peekingIterator.peek(); // return 2, the pointer does not move [1,2,3].
+peekingIterator.next(); // return 2, the pointer moves to the next element [1,2,3]
+peekingIterator.next(); // return 3, the pointer moves to the next element [1,2,3]
+peekingIterator.hasNext(); // return False
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 10001 <= nums[i] <= 1000- All the calls to
next and peek are valid.
+ - At most
1000 calls will be made to next, hasNext, and peek.
+
+
+
+Follow up: How would you extend your design to be generic and work with all types, not just integer?Related Topics
ArrayDesignIterator
👍 1415👎 874
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P28ImplementStrstr.md b/src/leetcode/editor/en/doc/content/P28ImplementStrstr.md
new file mode 100644
index 0000000..41b9812
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P28ImplementStrstr.md
@@ -0,0 +1,33 @@
+Implement strStr().
+
+Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
+
+Clarification:
+
+What should we return when needle is an empty string? This is a great question to ask during an interview.
+
+For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().
+
+
+Example 1:
+
+
+Input: haystack = "hello", needle = "ll"
+Output: 2
+
+
+Example 2:
+
+
+Input: haystack = "aaaaa", needle = "bba"
+Output: -1
+
+
+
+Constraints:
+
+
+ 1 <= haystack.length, needle.length <= 104haystack and needle consist of only lowercase English characters.
+Related Topics
Two PointersStringString Matching
👍 3885👎 3597
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P297SerializeAndDeserializeBinaryTree.md b/src/leetcode/editor/en/doc/content/P297SerializeAndDeserializeBinaryTree.md
new file mode 100644
index 0000000..f51302e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P297SerializeAndDeserializeBinaryTree.md
@@ -0,0 +1,29 @@
+Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
+
+Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
+
+Clarification: The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
+
+
+Example 1:
+
+
+Input: root = [1,2,3,null,null,4,5]
+Output: [1,2,3,null,null,4,5]
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 104].
+ -1000 <= Node.val <= 1000
+Related Topics
StringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree
👍 6699👎 258
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P29DivideTwoIntegers.md b/src/leetcode/editor/en/doc/content/P29DivideTwoIntegers.md
new file mode 100644
index 0000000..04c440f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P29DivideTwoIntegers.md
@@ -0,0 +1,33 @@
+Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.
+
+The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2.
+
+Return the quotient after dividing dividend by divisor.
+
+Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For this problem, if the quotient is strictly greater than 231 - 1, then return 231 - 1, and if the quotient is strictly less than -231, then return -231.
+
+
+Example 1:
+
+
+Input: dividend = 10, divisor = 3
+Output: 3
+Explanation: 10/3 = 3.33333.. which is truncated to 3.
+
+
+Example 2:
+
+
+Input: dividend = 7, divisor = -3
+Output: -2
+Explanation: 7/-3 = -2.33333.. which is truncated to -2.
+
+
+
+Constraints:
+
+
+ -231 <= dividend, divisor <= 231 - 1divisor != 0
+Related Topics
MathBit Manipulation
👍 3020👎 10470
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P300LongestIncreasingSubsequence.md b/src/leetcode/editor/en/doc/content/P300LongestIncreasingSubsequence.md
new file mode 100644
index 0000000..37583fb
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P300LongestIncreasingSubsequence.md
@@ -0,0 +1,38 @@
+Given an integer array nums, return the length of the longest strictly increasing subsequence.
+
+A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example, [3,6,2,7] is a subsequence of the array [0,3,1,6,2,2,7].
+
+
+Example 1:
+
+
+Input: nums = [10,9,2,5,3,7,101,18]
+Output: 4
+Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
+
+
+Example 2:
+
+
+Input: nums = [0,1,0,3,2,3]
+Output: 4
+
+
+Example 3:
+
+
+Input: nums = [7,7,7,7,7,7,7]
+Output: 1
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 2500-104 <= nums[i] <= 104
+
+
+Follow up: Can you come up with an algorithm that runs in O(n log(n)) time complexity?
+Related Topics
ArrayBinary SearchDynamic Programming
👍 11975👎 235
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P303RangeSumQueryImmutable.md b/src/leetcode/editor/en/doc/content/P303RangeSumQueryImmutable.md
new file mode 100644
index 0000000..67b5eb2
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P303RangeSumQueryImmutable.md
@@ -0,0 +1,40 @@
+Given an integer array nums, handle multiple queries of the following type:
+
+
+ - Calculate the sum of the elements of
nums between indices left and right inclusive where left <= right.
+
+
+Implement the NumArray class:
+
+
+ NumArray(int[] nums) Initializes the object with the integer array nums.int sumRange(int left, int right) Returns the sum of the elements of nums between indices left and right inclusive (i.e. nums[left] + nums[left + 1] + ... + nums[right]).
+
+
+Example 1:
+
+
+Input
+["NumArray", "sumRange", "sumRange", "sumRange"]
+[[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]
+Output
+[null, 1, -1, -3]
+
+Explanation
+NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
+numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1
+numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1
+numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 104-105 <= nums[i] <= 1050 <= left <= right < nums.length- At most
104 calls will be made to sumRange.
+
+Related Topics
ArrayDesignPrefix Sum
👍 1951👎 1649
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P304RangeSumQuery2dImmutable.md b/src/leetcode/editor/en/doc/content/P304RangeSumQuery2dImmutable.md
new file mode 100644
index 0000000..26a9161
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P304RangeSumQuery2dImmutable.md
@@ -0,0 +1,43 @@
+Given a 2D matrix matrix, handle multiple queries of the following type:
+
+
+ - Calculate the sum of the elements of
matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
+
+
+Implement the NumMatrix class:
+
+
+ NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix.int sumRegion(int row1, int col1, int row2, int col2) Returns the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
+
+
+Example 1:
+
+
+Input
+["NumMatrix", "sumRegion", "sumRegion", "sumRegion"]
+[[[[3, 0, 1, 4, 2], [5, 6, 3, 2, 1], [1, 2, 0, 1, 5], [4, 1, 0, 1, 7], [1, 0, 3, 0, 5]]], [2, 1, 4, 3], [1, 1, 2, 2], [1, 2, 2, 4]]
+Output
+[null, 8, 11, 12]
+
+Explanation
+NumMatrix numMatrix = new NumMatrix([[3, 0, 1, 4, 2], [5, 6, 3, 2, 1], [1, 2, 0, 1, 5], [4, 1, 0, 1, 7], [1, 0, 3, 0, 5]]);
+numMatrix.sumRegion(2, 1, 4, 3); // return 8 (i.e sum of the red rectangle)
+numMatrix.sumRegion(1, 1, 2, 2); // return 11 (i.e sum of the green rectangle)
+numMatrix.sumRegion(1, 2, 2, 4); // return 12 (i.e sum of the blue rectangle)
+
+
+
+Constraints:
+
+
+ m == matrix.lengthn == matrix[i].length1 <= m, n <= 200-105 <= matrix[i][j] <= 1050 <= row1 <= row2 < m0 <= col1 <= col2 < n- At most
104 calls will be made to sumRegion.
+
+Related Topics
ArrayDesignMatrixPrefix Sum
👍 2533👎 245
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P315CountOfSmallerNumbersAfterSelf.md b/src/leetcode/editor/en/doc/content/P315CountOfSmallerNumbersAfterSelf.md
new file mode 100644
index 0000000..ed51056
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P315CountOfSmallerNumbersAfterSelf.md
@@ -0,0 +1,37 @@
+You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].
+
+
+Example 1:
+
+
+Input: nums = [5,2,6,1]
+Output: [2,1,1,0]
+Explanation:
+To the right of 5 there are 2 smaller elements (2 and 1).
+To the right of 2 there is only 1 smaller element (1).
+To the right of 6 there is 1 smaller element (1).
+To the right of 1 there is 0 smaller element.
+
+
+Example 2:
+
+
+Input: nums = [-1]
+Output: [0]
+
+
+Example 3:
+
+
+Input: nums = [-1,-1]
+Output: [0,0]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 105-104 <= nums[i] <= 104
+Related Topics
ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set
👍 5613👎 159
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P318MaximumProductOfWordLengths.md b/src/leetcode/editor/en/doc/content/P318MaximumProductOfWordLengths.md
new file mode 100644
index 0000000..98812cc
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P318MaximumProductOfWordLengths.md
@@ -0,0 +1,36 @@
+Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words exist, return 0.
+
+
+Example 1:
+
+
+Input: words = ["abcw","baz","foo","bar","xtfn","abcdef"]
+Output: 16
+Explanation: The two words can be "abcw", "xtfn".
+
+
+Example 2:
+
+
+Input: words = ["a","ab","abc","d","cd","bcd","abcd"]
+Output: 4
+Explanation: The two words can be "ab", "cd".
+
+
+Example 3:
+
+
+Input: words = ["a","aa","aaa","aaaa"]
+Output: 0
+Explanation: No such pair of words.
+
+
+
+Constraints:
+
+
+ 2 <= words.length <= 10001 <= words[i].length <= 1000words[i] consists only of lowercase English letters.
+Related Topics
ArrayStringBit Manipulation
👍 2577👎 104
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P322CoinChange.md b/src/leetcode/editor/en/doc/content/P322CoinChange.md
new file mode 100644
index 0000000..da8b793
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P322CoinChange.md
@@ -0,0 +1,38 @@
+You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
+
+Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.
+
+You may assume that you have an infinite number of each kind of coin.
+
+
+Example 1:
+
+
+Input: coins = [1,2,5], amount = 11
+Output: 3
+Explanation: 11 = 5 + 5 + 1
+
+
+Example 2:
+
+
+Input: coins = [2], amount = 3
+Output: -1
+
+
+Example 3:
+
+
+Input: coins = [1], amount = 0
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= coins.length <= 121 <= coins[i] <= 231 - 10 <= amount <= 104
+Related Topics
ArrayDynamic ProgrammingBreadth-First Search
👍 10991👎 266
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P329LongestIncreasingPathInAMatrix.md b/src/leetcode/editor/en/doc/content/P329LongestIncreasingPathInAMatrix.md
new file mode 100644
index 0000000..8946050
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P329LongestIncreasingPathInAMatrix.md
@@ -0,0 +1,38 @@
+Given an m x n integers matrix, return the length of the longest increasing path in matrix.
+
+From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonally or move outside the boundary (i.e., wrap-around is not allowed).
+
+
+Example 1:
+
+
+Input: matrix = [[9,9,4],[6,6,8],[2,1,1]]
+Output: 4
+Explanation: The longest increasing path is [1, 2, 6, 9].
+
+
+Example 2:
+
+
+Input: matrix = [[3,4,5],[3,2,6],[2,2,1]]
+Output: 4
+Explanation: The longest increasing path is [3, 4, 5, 6]. Moving diagonally is not allowed.
+
+
+Example 3:
+
+
+Input: matrix = [[1]]
+Output: 1
+
+
+
+Constraints:
+
+
+ m == matrix.lengthn == matrix[i].length1 <= m, n <= 2000 <= matrix[i][j] <= 231 - 1
+Related Topics
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraphTopological SortMemoization
👍 5858👎 96
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P32LongestValidParentheses.md b/src/leetcode/editor/en/doc/content/P32LongestValidParentheses.md
new file mode 100644
index 0000000..4e7ac34
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P32LongestValidParentheses.md
@@ -0,0 +1,34 @@
+Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
+
+
+Example 1:
+
+
+Input: s = "(()"
+Output: 2
+Explanation: The longest valid parentheses substring is "()".
+
+
+Example 2:
+
+
+Input: s = ")()())"
+Output: 4
+Explanation: The longest valid parentheses substring is "()()".
+
+
+Example 3:
+
+
+Input: s = ""
+Output: 0
+
+
+
+Constraints:
+
+
+ 0 <= s.length <= 3 * 104s[i] is '(', or ')'.
+Related Topics
StringDynamic ProgrammingStack
👍 8455👎 282
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P341FlattenNestedListIterator.md b/src/leetcode/editor/en/doc/content/P341FlattenNestedListIterator.md
new file mode 100644
index 0000000..c97f5b2
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P341FlattenNestedListIterator.md
@@ -0,0 +1,47 @@
+You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists. Implement an iterator to flatten it.
+
+Implement the NestedIterator class:
+
+
+ NestedIterator(List<NestedInteger> nestedList) Initializes the iterator with the nested list nestedList.int next() Returns the next integer in the nested list.boolean hasNext() Returns true if there are still some integers in the nested list and false otherwise.
+
+Your code will be tested with the following pseudocode:
+
+
+initialize iterator with nestedList
+res = []
+while iterator.hasNext()
+ append iterator.next() to the end of res
+return res
+
+
+If res matches the expected flattened list, then your code will be judged as correct.
+
+
+Example 1:
+
+
+Input: nestedList = [[1,1],2,[1,1]]
+Output: [1,1,2,1,1]
+Explanation: By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,1,2,1,1].
+
+
+Example 2:
+
+
+Input: nestedList = [1,[4,[6]]]
+Output: [1,4,6]
+Explanation: By calling next repeatedly until hasNext returns false, the order of elements returned by next should be: [1,4,6].
+
+
+
+Constraints:
+
+
+ 1 <= nestedList.length <= 500- The values of the integers in the nested list is in the range
[-106, 106].
+
+Related Topics
StackTreeDepth-First SearchDesignQueueIterator
👍 3556👎 1248
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P354RussianDollEnvelopes.md b/src/leetcode/editor/en/doc/content/P354RussianDollEnvelopes.md
new file mode 100644
index 0000000..9a09eb3
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P354RussianDollEnvelopes.md
@@ -0,0 +1,33 @@
+You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope.
+
+One envelope can fit into another if and only if both the width and height of one envelope are greater than the other envelope's width and height.
+
+Return the maximum number of envelopes you can Russian doll (i.e., put one inside the other).
+
+Note: You cannot rotate an envelope.
+
+
+Example 1:
+
+
+Input: envelopes = [[5,4],[6,4],[6,7],[2,3]]
+Output: 3
+Explanation: The maximum number of envelopes you can Russian doll is 3 ([2,3] => [5,4] => [6,7]).
+
+
+Example 2:
+
+
+Input: envelopes = [[1,1],[1,1],[1,1]]
+Output: 1
+
+
+
+Constraints:
+
+
+ 1 <= envelopes.length <= 105envelopes[i].length == 21 <= wi, hi <= 105
+Related Topics
ArrayBinary SearchDynamic ProgrammingSorting
👍 3748👎 86
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P376WiggleSubsequence.md b/src/leetcode/editor/en/doc/content/P376WiggleSubsequence.md
new file mode 100644
index 0000000..00a9c76
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P376WiggleSubsequence.md
@@ -0,0 +1,47 @@
+A wiggle sequence is a sequence where the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with one element and a sequence with two non-equal elements are trivially wiggle sequences.
+
+
+ - For example,
[1, 7, 4, 9, 2, 5] is a wiggle sequence because the differences (6, -3, 5, -7, 3) alternate between positive and negative.
+ - In contrast,
[1, 4, 7, 2, 5] and [1, 7, 4, 5, 5] are not wiggle sequences. The first is not because its first two differences are positive, and the second is not because its last difference is zero.
+
+
+A subsequence is obtained by deleting some elements (possibly zero) from the original sequence, leaving the remaining elements in their original order.
+
+Given an integer array nums, return the length of the longest wiggle subsequence of nums.
+
+
+Example 1:
+
+
+Input: nums = [1,7,4,9,2,5]
+Output: 6
+Explanation: The entire sequence is a wiggle sequence with differences (6, -3, 5, -7, 3).
+
+
+Example 2:
+
+
+Input: nums = [1,17,5,10,13,15,10,5,16,8]
+Output: 7
+Explanation: There are several subsequences that achieve this length.
+One is [1, 17, 10, 13, 10, 16, 8] with differences (16, -7, 3, -3, 6, -8).
+
+
+Example 3:
+
+
+Input: nums = [1,2,3,4,5,6,7,8,9]
+Output: 2
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 10000 <= nums[i] <= 1000
+
+
+Follow up: Could you solve this in O(n) time?
+Related Topics
ArrayDynamic ProgrammingGreedy
👍 3494👎 117
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P380InsertDeleteGetrandomO1.md b/src/leetcode/editor/en/doc/content/P380InsertDeleteGetrandomO1.md
new file mode 100644
index 0000000..2b1cc4e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P380InsertDeleteGetrandomO1.md
@@ -0,0 +1,41 @@
+Implement the RandomizedSet class:
+
+
+ RandomizedSet() Initializes the RandomizedSet object.bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.
+
+You must implement the functions of the class such that each function works in average O(1) time complexity.
+
+
+Example 1:
+
+
+Input
+["RandomizedSet", "insert", "remove", "insert", "getRandom", "remove", "insert", "getRandom"]
+[[], [1], [2], [2], [], [1], [2], []]
+Output
+[null, true, false, true, 2, true, false, 2]
+
+Explanation
+RandomizedSet randomizedSet = new RandomizedSet();
+randomizedSet.insert(1); // Inserts 1 to the set. Returns true as 1 was inserted successfully.
+randomizedSet.remove(2); // Returns false as 2 does not exist in the set.
+randomizedSet.insert(2); // Inserts 2 to the set, returns true. Set now contains [1,2].
+randomizedSet.getRandom(); // getRandom() should return either 1 or 2 randomly.
+randomizedSet.remove(1); // Removes 1 from the set, returns true. Set now contains [2].
+randomizedSet.insert(2); // 2 was already in the set, so return false.
+randomizedSet.getRandom(); // Since 2 is the only number in the set, getRandom() will always return 2.
+
+
+
+Constraints:
+
+
+ -231 <= val <= 231 - 1- At most
2 * 105 calls will be made to insert, remove, and getRandom.
+ - There will be at least one element in the data structure when
getRandom is called.
+
+Related Topics
ArrayHash TableMathDesignRandomized
👍 5413👎 290
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P382LinkedListRandomNode.md b/src/leetcode/editor/en/doc/content/P382LinkedListRandomNode.md
new file mode 100644
index 0000000..4e58ad3
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P382LinkedListRandomNode.md
@@ -0,0 +1,46 @@
+Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.
+
+Implement the Solution class:
+
+
+ Solution(ListNode head) Initializes the object with the head of the singly-linked list head.int getRandom() Chooses a node randomly from the list and returns its value. All the nodes of the list should be equally likely to be chosen.
+
+
+Example 1:
+
+
+Input
+["Solution", "getRandom", "getRandom", "getRandom", "getRandom", "getRandom"]
+[[[1, 2, 3]], [], [], [], [], []]
+Output
+[null, 1, 3, 2, 2, 3]
+
+Explanation
+Solution solution = new Solution([1, 2, 3]);
+solution.getRandom(); // return 1
+solution.getRandom(); // return 3
+solution.getRandom(); // return 2
+solution.getRandom(); // return 2
+solution.getRandom(); // return 3
+// getRandom() should return either 1, 2, or 3 randomly. Each element should have equal probability of returning.
+
+
+
+Constraints:
+
+
+ - The number of nodes in the linked list will be in the range
[1, 104].
+ -104 <= Node.val <= 104- At most
104 calls will be made to getRandom.
+
+
+
+Follow up:
+
+
+ - What if the linked list is extremely large and its length is unknown to you?
+ - Could you solve this efficiently without using extra space?
+
+Related Topics
Linked ListMathReservoir SamplingRandomized
👍 1728👎 436
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P383RansomNote.md b/src/leetcode/editor/en/doc/content/P383RansomNote.md
new file mode 100644
index 0000000..86430d5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P383RansomNote.md
@@ -0,0 +1,23 @@
+Given two strings ransomNote and magazine, return true if ransomNote can be constructed from magazine and false otherwise.
+
+Each letter in magazine can only be used once in ransomNote.
+
+
+Example 1:
+Input: ransomNote = "a", magazine = "b"
+Output: false
+
Example 2:
+Input: ransomNote = "aa", magazine = "ab"
+Output: false
+
Example 3:
+Input: ransomNote = "aa", magazine = "aab"
+Output: true
+
+
+Constraints:
+
+
+ 1 <= ransomNote.length, magazine.length <= 105ransomNote and magazine consist of lowercase English letters.
+Related Topics
Hash TableStringCounting
👍 1646👎 297
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P399EvaluateDivision.md b/src/leetcode/editor/en/doc/content/P399EvaluateDivision.md
new file mode 100644
index 0000000..f4fdba3
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P399EvaluateDivision.md
@@ -0,0 +1,49 @@
+You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable.
+
+You are also given some queries, where queries[j] = [Cj, Dj] represents the jth query where you must find the answer for Cj / Dj = ?.
+
+Return the answers to all queries. If a single answer cannot be determined, return -1.0.
+
+Note: The input is always valid. You may assume that evaluating the queries will not result in division by zero and that there is no contradiction.
+
+
+Example 1:
+
+
+Input: equations = [["a","b"],["b","c"]], values = [2.0,3.0], queries = [["a","c"],["b","a"],["a","e"],["a","a"],["x","x"]]
+Output: [6.00000,0.50000,-1.00000,1.00000,-1.00000]
+Explanation:
+Given: a / b = 2.0, b / c = 3.0
+queries are: a / c = ?, b / a = ?, a / e = ?, a / a = ?, x / x = ?
+return: [6.0, 0.5, -1.0, 1.0, -1.0 ]
+
+
+Example 2:
+
+
+Input: equations = [["a","b"],["b","c"],["bc","cd"]], values = [1.5,2.5,5.0], queries = [["a","c"],["c","b"],["bc","cd"],["cd","bc"]]
+Output: [3.75000,0.40000,5.00000,0.20000]
+
+
+Example 3:
+
+
+Input: equations = [["a","b"]], values = [0.5], queries = [["a","b"],["b","a"],["a","c"],["x","y"]]
+Output: [0.50000,2.00000,-1.00000,-1.00000]
+
+
+
+Constraints:
+
+
+ 1 <= equations.length <= 20equations[i].length == 21 <= Ai.length, Bi.length <= 5values.length == equations.length0.0 < values[i] <= 20.01 <= queries.length <= 20queries[i].length == 21 <= Cj.length, Dj.length <= 5Ai, Bi, Cj, Dj consist of lower case English letters and digits.
+Related Topics
ArrayDepth-First SearchBreadth-First SearchUnion FindGraphShortest Path
👍 5529👎 467
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P3LongestSubstringWithoutRepeatingCharacters.md b/src/leetcode/editor/en/doc/content/P3LongestSubstringWithoutRepeatingCharacters.md
new file mode 100644
index 0000000..f9b4423
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P3LongestSubstringWithoutRepeatingCharacters.md
@@ -0,0 +1,36 @@
+Given a string s, find the length of the longest substring without repeating characters.
+
+
+Example 1:
+
+
+Input: s = "abcabcbb"
+Output: 3
+Explanation: The answer is "abc", with the length of 3.
+
+
+Example 2:
+
+
+Input: s = "bbbbb"
+Output: 1
+Explanation: The answer is "b", with the length of 1.
+
+
+Example 3:
+
+
+Input: s = "pwwkew"
+Output: 3
+Explanation: The answer is "wke", with the length of 3.
+Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
+
+
+
+Constraints:
+
+
+ 0 <= s.length <= 5 * 104s consists of English letters, digits, symbols and spaces.
+Related Topics
Hash TableStringSliding Window
👍 23437👎 1053
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P406QueueReconstructionByHeight.md b/src/leetcode/editor/en/doc/content/P406QueueReconstructionByHeight.md
new file mode 100644
index 0000000..18f09e5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P406QueueReconstructionByHeight.md
@@ -0,0 +1,37 @@
+You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or equal to hi.
+
+Reconstruct and return the queue that is represented by the input array people. The returned queue should be formatted as an array queue, where queue[j] = [hj, kj] is the attributes of the jth person in the queue (queue[0] is the person at the front of the queue).
+
+
+Example 1:
+
+
+Input: people = [[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]
+Output: [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]]
+Explanation:
+Person 0 has height 5 with no other people taller or the same height in front.
+Person 1 has height 7 with no other people taller or the same height in front.
+Person 2 has height 5 with two persons taller or the same height in front, which is person 0 and 1.
+Person 3 has height 6 with one person taller or the same height in front, which is person 1.
+Person 4 has height 4 with four people taller or the same height in front, which are people 0, 1, 2, and 3.
+Person 5 has height 7 with one person taller or the same height in front, which is person 1.
+Hence [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]] is the reconstructed queue.
+
+
+Example 2:
+
+
+Input: people = [[6,0],[5,0],[4,0],[3,2],[2,2],[1,4]]
+Output: [[4,0],[5,0],[2,2],[3,2],[1,4],[6,0]]
+
+
+
+Constraints:
+
+
+ 1 <= people.length <= 20000 <= hi <= 1060 <= ki < people.length- It is guaranteed that the queue can be reconstructed.
+
+Related Topics
ArrayGreedyBinary Indexed TreeSegment TreeSorting
👍 5731👎 608
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P410SplitArrayLargestSum.md b/src/leetcode/editor/en/doc/content/P410SplitArrayLargestSum.md
new file mode 100644
index 0000000..8d93148
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P410SplitArrayLargestSum.md
@@ -0,0 +1,39 @@
+Given an array nums which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays.
+
+Write an algorithm to minimize the largest sum among these m subarrays.
+
+
+Example 1:
+
+
+Input: nums = [7,2,5,10,8], m = 2
+Output: 18
+Explanation:
+There are four ways to split nums into two subarrays.
+The best way is to split it into [7,2,5] and [10,8],
+where the largest sum among the two subarrays is only 18.
+
+
+Example 2:
+
+
+Input: nums = [1,2,3,4,5], m = 2
+Output: 9
+
+
+Example 3:
+
+
+Input: nums = [1,4,4], m = 3
+Output: 4
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 10000 <= nums[i] <= 1061 <= m <= min(50, nums.length)
+Related Topics
ArrayBinary SearchDynamic ProgrammingGreedy
👍 5849👎 150
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P416PartitionEqualSubsetSum.md b/src/leetcode/editor/en/doc/content/P416PartitionEqualSubsetSum.md
new file mode 100644
index 0000000..be4f609
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P416PartitionEqualSubsetSum.md
@@ -0,0 +1,27 @@
+Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
+
+
+Example 1:
+
+
+Input: nums = [1,5,11,5]
+Output: true
+Explanation: The array can be partitioned as [1, 5, 5] and [11].
+
+
+Example 2:
+
+
+Input: nums = [1,2,3,5]
+Output: false
+Explanation: The array cannot be partitioned into equal sum subsets.
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 2001 <= nums[i] <= 100
+Related Topics
ArrayDynamic Programming
👍 7894👎 126
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P438FindAllAnagramsInAString.md b/src/leetcode/editor/en/doc/content/P438FindAllAnagramsInAString.md
new file mode 100644
index 0000000..6551688
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P438FindAllAnagramsInAString.md
@@ -0,0 +1,34 @@
+Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order.
+
+An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
+
+
+Example 1:
+
+
+Input: s = "cbaebabacd", p = "abc"
+Output: [0,6]
+Explanation:
+The substring with start index = 0 is "cba", which is an anagram of "abc".
+The substring with start index = 6 is "bac", which is an anagram of "abc".
+
+
+Example 2:
+
+
+Input: s = "abab", p = "ab"
+Output: [0,1,2]
+Explanation:
+The substring with start index = 0 is "ab", which is an anagram of "ab".
+The substring with start index = 1 is "ba", which is an anagram of "ab".
+The substring with start index = 2 is "ab", which is an anagram of "ab".
+
+
+
+Constraints:
+
+
+ 1 <= s.length, p.length <= 3 * 104s and p consist of lowercase English letters.
+Related Topics
Hash TableStringSliding Window
👍 7285👎 251
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P449SerializeAndDeserializeBst.md b/src/leetcode/editor/en/doc/content/P449SerializeAndDeserializeBst.md
new file mode 100644
index 0000000..aa8b3c7
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P449SerializeAndDeserializeBst.md
@@ -0,0 +1,23 @@
+Serialization is converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
+
+Design an algorithm to serialize and deserialize a binary search tree. There is no restriction on how your serialization/deserialization algorithm should work. You need to ensure that a binary search tree can be serialized to a string, and this string can be deserialized to the original tree structure.
+
+The encoded string should be as compact as possible.
+
+
+Example 1:
+Input: root = [2,1,3]
+Output: [2,1,3]
+
Example 2:
+Input: root = []
+Output: []
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 104].
+ 0 <= Node.val <= 104- The input tree is guaranteed to be a binary search tree.
+
+Related Topics
StringTreeDepth-First SearchBreadth-First SearchDesignBinary Search TreeBinary Tree
👍 2704👎 133
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P450DeleteNodeInABst.md b/src/leetcode/editor/en/doc/content/P450DeleteNodeInABst.md
new file mode 100644
index 0000000..a680743
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P450DeleteNodeInABst.md
@@ -0,0 +1,50 @@
+Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.
+
+Basically, the deletion can be divided into two stages:
+
+
+ - Search for a node to remove.
+ - If the node is found, delete the node.
+
+
+
+Example 1:
+
+
+Input: root = [5,3,6,2,4,null,7], key = 3
+Output: [5,4,6,2,null,null,7]
+Explanation: Given key to delete is 3. So we find the node with value 3 and delete it.
+One valid answer is [5,4,6,2,null,null,7], shown in the above BST.
+Please notice that another valid answer is [5,2,6,null,4,null,7] and it's also accepted.
+
+
+
+Example 2:
+
+
+Input: root = [5,3,6,2,4,null,7], key = 0
+Output: [5,3,6,2,4,null,7]
+Explanation: The tree does not contain a node with value = 0.
+
+
+Example 3:
+
+
+Input: root = [], key = 0
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 104].
+ -105 <= Node.val <= 105- Each node has a unique value.
+ root is a valid binary search tree.-105 <= key <= 105
+
+
+Follow up: Could you solve it with time complexity O(height of tree)?
+Related Topics
TreeBinary Search TreeBinary Tree
👍 5443👎 161
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P454FourSumIi.md b/src/leetcode/editor/en/doc/content/P454FourSumIi.md
new file mode 100644
index 0000000..1aee85f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P454FourSumIi.md
@@ -0,0 +1,38 @@
+Given four integer arrays nums1, nums2, nums3, and nums4 all of length n, return the number of tuples (i, j, k, l) such that:
+
+
+ 0 <= i, j, k, l < nnums1[i] + nums2[j] + nums3[k] + nums4[l] == 0
+
+
+Example 1:
+
+
+Input: nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2]
+Output: 2
+Explanation:
+The two tuples are:
+1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0
+2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0
+
+
+Example 2:
+
+
+Input: nums1 = [0], nums2 = [0], nums3 = [0], nums4 = [0]
+Output: 1
+
+
+
+Constraints:
+
+
+ n == nums1.lengthn == nums2.lengthn == nums3.lengthn == nums4.length1 <= n <= 200-228 <= nums1[i], nums2[i], nums3[i], nums4[i] <= 228
+Related Topics
ArrayHash Table
👍 3758👎 112
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P456One32Pattern.md b/src/leetcode/editor/en/doc/content/P456One32Pattern.md
new file mode 100644
index 0000000..cfe7bc5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P456One32Pattern.md
@@ -0,0 +1,38 @@
+Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k and nums[i] < nums[k] < nums[j].
+
+Return true if there is a 132 pattern in nums, otherwise, return false.
+
+
+Example 1:
+
+
+Input: nums = [1,2,3,4]
+Output: false
+Explanation: There is no 132 pattern in the sequence.
+
+
+Example 2:
+
+
+Input: nums = [3,1,4,2]
+Output: true
+Explanation: There is a 132 pattern in the sequence: [1, 4, 2].
+
+
+Example 3:
+
+
+Input: nums = [-1,3,2,0]
+Output: true
+Explanation: There are three 132 patterns in the sequence: [-1, 3, 2], [-1, 3, 0] and [-1, 2, 0].
+
+
+
+Constraints:
+
+
+ n == nums.length1 <= n <= 2 * 105-109 <= nums[i] <= 109
+Related Topics
ArrayBinary SearchStackMonotonic StackOrdered Set
👍 4164👎 221
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P459RepeatedSubstringPattern.md b/src/leetcode/editor/en/doc/content/P459RepeatedSubstringPattern.md
new file mode 100644
index 0000000..bf26580
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P459RepeatedSubstringPattern.md
@@ -0,0 +1,34 @@
+Given a string s, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
+
+
+Example 1:
+
+
+Input: s = "abab"
+Output: true
+Explanation: It is the substring "ab" twice.
+
+
+Example 2:
+
+
+Input: s = "aba"
+Output: false
+
+
+Example 3:
+
+
+Input: s = "abcabcabcabc"
+Output: true
+Explanation: It is the substring "abc" four times or the substring "abcabc" twice.
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 104s consists of lowercase English letters.
+Related Topics
StringString Matching
👍 3273👎 313
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P462MinimumMovesToEqualArrayElementsIi.md b/src/leetcode/editor/en/doc/content/P462MinimumMovesToEqualArrayElementsIi.md
new file mode 100644
index 0000000..7991447
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P462MinimumMovesToEqualArrayElementsIi.md
@@ -0,0 +1,33 @@
+Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
+
+In one move, you can increment or decrement an element of the array by 1.
+
+Test cases are designed so that the answer will fit in a 32-bit integer.
+
+
+Example 1:
+
+
+Input: nums = [1,2,3]
+Output: 2
+Explanation:
+Only two moves are needed (remember each move increments or decrements one element):
+[1,2,3] => [2,2,3] => [2,2,2]
+
+
+Example 2:
+
+
+Input: nums = [1,10,2,9]
+Output: 16
+
+
+
+Constraints:
+
+
+ n == nums.length1 <= nums.length <= 105-109 <= nums[i] <= 109
+Related Topics
ArrayMathSorting
👍 2352👎 95
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P46Permutations.md b/src/leetcode/editor/en/doc/content/P46Permutations.md
new file mode 100644
index 0000000..9726adb
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P46Permutations.md
@@ -0,0 +1,22 @@
+Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
+
+
+Example 1:
+Input: nums = [1,2,3]
+Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
+
Example 2:
+Input: nums = [0,1]
+Output: [[0,1],[1,0]]
+
Example 3:
+Input: nums = [1]
+Output: [[1]]
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 6-10 <= nums[i] <= 10- All the integers of
nums are unique.
+
+Related Topics
ArrayBacktracking
👍 10730👎 192
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P474OnesAndZeroes.md b/src/leetcode/editor/en/doc/content/P474OnesAndZeroes.md
new file mode 100644
index 0000000..69f31a4
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P474OnesAndZeroes.md
@@ -0,0 +1,35 @@
+You are given an array of binary strings strs and two integers m and n.
+
+Return the size of the largest subset of strs such that there are at most m 0's and n 1's in the subset.
+
+A set x is a subset of a set y if all elements of x are also elements of y.
+
+
+Example 1:
+
+
+Input: strs = ["10","0001","111001","1","0"], m = 5, n = 3
+Output: 4
+Explanation: The largest subset with at most 5 0's and 3 1's is {"10", "0001", "1", "0"}, so the answer is 4.
+Other valid but smaller subsets include {"0001", "1"} and {"10", "1", "0"}.
+{"111001"} is an invalid subset because it contains 4 1's, greater than the maximum of 3.
+
+
+Example 2:
+
+
+Input: strs = ["10","0","1"], m = 1, n = 1
+Output: 2
+Explanation: The largest subset is {"0", "1"}, so the answer is 2.
+
+
+
+Constraints:
+
+
+ 1 <= strs.length <= 6001 <= strs[i].length <= 100strs[i] consists only of digits '0' and '1'.1 <= m, n <= 100
+Related Topics
ArrayStringDynamic Programming
👍 3606👎 366
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P47PermutationsIi.md b/src/leetcode/editor/en/doc/content/P47PermutationsIi.md
new file mode 100644
index 0000000..9b44eee
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P47PermutationsIi.md
@@ -0,0 +1,28 @@
+Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.
+
+
+Example 1:
+
+
+Input: nums = [1,1,2]
+Output:
+[[1,1,2],
+ [1,2,1],
+ [2,1,1]]
+
+
+Example 2:
+
+
+Input: nums = [1,2,3]
+Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 8-10 <= nums[i] <= 10
+Related Topics
ArrayBacktracking
👍 5468👎 96
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P48RotateImage.md b/src/leetcode/editor/en/doc/content/P48RotateImage.md
new file mode 100644
index 0000000..198c349
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P48RotateImage.md
@@ -0,0 +1,28 @@
+You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
+
+You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
+
+
+Example 1:
+
+
+Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
+Output: [[7,4,1],[8,5,2],[9,6,3]]
+
+
+Example 2:
+
+
+Input: matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
+Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]
+
+
+
+Constraints:
+
+
+ n == matrix.length == matrix[i].length1 <= n <= 20-1000 <= matrix[i][j] <= 1000
+Related Topics
ArrayMathMatrix
👍 9058👎 481
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P493ReversePairs.md b/src/leetcode/editor/en/doc/content/P493ReversePairs.md
new file mode 100644
index 0000000..7e7b0d3
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P493ReversePairs.md
@@ -0,0 +1,20 @@
+Given an integer array nums, return the number of reverse pairs in the array.
+
+A reverse pair is a pair (i, j) where 0 <= i < j < nums.length and nums[i] > 2 * nums[j].
+
+
+Example 1:
+Input: nums = [1,3,2,3,1]
+Output: 2
+
Example 2:
+Input: nums = [2,4,3,5,1]
+Output: 3
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 5 * 104-231 <= nums[i] <= 231 - 1
+Related Topics
ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set
👍 3051👎 186
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P49GroupAnagrams.md b/src/leetcode/editor/en/doc/content/P49GroupAnagrams.md
new file mode 100644
index 0000000..38686c5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P49GroupAnagrams.md
@@ -0,0 +1,26 @@
+//Given an array of strings strs, group the anagrams together. You can return
+//the answer in any order.
+//
+// An Anagram is a word or phrase formed by rearranging the letters of a
+//different word or phrase, typically using all the original letters exactly once.
+//
+//
+// Example 1:
+// Input: strs = ["eat","tea","tan","ate","nat","bat"]
+//Output: [["bat"],["nat","tan"],["ate","eat","tea"]]
+// Example 2:
+// Input: strs = [""]
+//Output: [[""]]
+// Example 3:
+// Input: strs = ["a"]
+//Output: [["a"]]
+//
+//
+// Constraints:
+//
+//
+// 1 <= strs.length <= 10⁴
+// 0 <= strs[i].length <= 100
+// strs[i] consists of lowercase English letters.
+//
+// Related Topics Hash Table String Sorting 👍 8945 👎 308
diff --git a/src/leetcode/editor/en/doc/content/P518CoinChange2.md b/src/leetcode/editor/en/doc/content/P518CoinChange2.md
new file mode 100644
index 0000000..cd05fa4
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P518CoinChange2.md
@@ -0,0 +1,46 @@
+You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
+
+Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return 0.
+
+You may assume that you have an infinite number of each kind of coin.
+
+The answer is guaranteed to fit into a signed 32-bit integer.
+
+
+Example 1:
+
+
+Input: amount = 5, coins = [1,2,5]
+Output: 4
+Explanation: there are four ways to make up the amount:
+5=5
+5=2+2+1
+5=2+1+1+1
+5=1+1+1+1+1
+
+
+Example 2:
+
+
+Input: amount = 3, coins = [2]
+Output: 0
+Explanation: the amount of 3 cannot be made up just with coins of 2.
+
+
+Example 3:
+
+
+Input: amount = 10, coins = [10]
+Output: 1
+
+
+
+Constraints:
+
+
+ 1 <= coins.length <= 3001 <= coins[i] <= 5000- All the values of
coins are unique.
+ 0 <= amount <= 5000
+Related Topics
ArrayDynamic Programming
👍 5477👎 107
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P51NQueens.md b/src/leetcode/editor/en/doc/content/P51NQueens.md
new file mode 100644
index 0000000..ef7453f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P51NQueens.md
@@ -0,0 +1,29 @@
+The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
+
+Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.
+
+Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.
+
+
+Example 1:
+
+
+Input: n = 4
+Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]
+Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above
+
+
+Example 2:
+
+
+Input: n = 1
+Output: [["Q"]]
+
+
+
+Constraints:
+
+
+Related Topics
ArrayBacktracking
👍 6703👎 169
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P528RandomPickWithWeight.md b/src/leetcode/editor/en/doc/content/P528RandomPickWithWeight.md
new file mode 100644
index 0000000..53f455e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P528RandomPickWithWeight.md
@@ -0,0 +1,60 @@
+You are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index.
+
+You need to implement the function pickIndex(), which randomly picks an index in the range [0, w.length - 1] (inclusive) and returns it. The probability of picking an index i is w[i] / sum(w).
+
+
+ - For example, if
w = [1, 3], the probability of picking index 0 is 1 / (1 + 3) = 0.25 (i.e., 25%), and the probability of picking index 1 is 3 / (1 + 3) = 0.75 (i.e., 75%).
+
+
+
+Example 1:
+
+
+Input
+["Solution","pickIndex"]
+[[[1]],[]]
+Output
+[null,0]
+
+Explanation
+Solution solution = new Solution([1]);
+solution.pickIndex(); // return 0. The only option is to return 0 since there is only one element in w.
+
+
+Example 2:
+
+
+Input
+["Solution","pickIndex","pickIndex","pickIndex","pickIndex","pickIndex"]
+[[[1,3]],[],[],[],[],[]]
+Output
+[null,1,1,1,1,0]
+
+Explanation
+Solution solution = new Solution([1, 3]);
+solution.pickIndex(); // return 1. It is returning the second element (index = 1) that has a probability of 3/4.
+solution.pickIndex(); // return 1
+solution.pickIndex(); // return 1
+solution.pickIndex(); // return 1
+solution.pickIndex(); // return 0. It is returning the first element (index = 0) that has a probability of 1/4.
+
+Since this is a randomization problem, multiple answers are allowed.
+All of the following outputs can be considered correct:
+[null,1,1,1,1,0]
+[null,1,1,1,1,1]
+[null,1,1,1,0,0]
+[null,1,1,1,0,1]
+[null,1,0,1,0,0]
+......
+and so on.
+
+
+
+Constraints:
+
+
+ 1 <= w.length <= 1041 <= w[i] <= 105pickIndex will be called at most 104 times.
+Related Topics
MathBinary SearchPrefix SumRandomized
👍 741👎 287
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P52NQueensIi.md b/src/leetcode/editor/en/doc/content/P52NQueensIi.md
new file mode 100644
index 0000000..6a19d35
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P52NQueensIi.md
@@ -0,0 +1,27 @@
+The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
+
+Given an integer n, return the number of distinct solutions to the n-queens puzzle.
+
+
+Example 1:
+
+
+Input: n = 4
+Output: 2
+Explanation: There are two distinct solutions to the 4-queens puzzle as shown.
+
+
+Example 2:
+
+
+Input: n = 1
+Output: 1
+
+
+
+Constraints:
+
+
+Related Topics
Backtracking
👍 2314👎 221
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P535EncodeAndDecodeTinyurl.md b/src/leetcode/editor/en/doc/content/P535EncodeAndDecodeTinyurl.md
new file mode 100644
index 0000000..99b3394
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P535EncodeAndDecodeTinyurl.md
@@ -0,0 +1,35 @@
+Note: This is a companion problem to the System Design problem: Design TinyURL.
+
+TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http://tinyurl.com/4e9iAk. Design a class to encode a URL and decode a tiny URL.
+
+There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.
+
+Implement the Solution class:
+
+
+ Solution() Initializes the object of the system.String encode(String longUrl) Returns a tiny URL for the given longUrl.String decode(String shortUrl) Returns the original long URL for the given shortUrl. It is guaranteed that the given shortUrl was encoded by the same object.
+
+
+Example 1:
+
+
+Input: url = "https://leetcode.com/problems/design-tinyurl"
+Output: "https://leetcode.com/problems/design-tinyurl"
+
+Explanation:
+Solution obj = new Solution();
+string tiny = obj.encode(url); // returns the encoded tiny url.
+string ans = obj.decode(tiny); // returns the original url after deconding it.
+
+
+
+Constraints:
+
+
+ 1 <= url.length <= 104url is guranteed to be a valid URL.
+Related Topics
Hash TableStringDesignHash Function
👍 1440👎 2783
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P545BoundaryOfBinaryTree.md b/src/leetcode/editor/en/doc/content/P545BoundaryOfBinaryTree.md
new file mode 100644
index 0000000..c2b91f7
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P545BoundaryOfBinaryTree.md
@@ -0,0 +1 @@
+nullRelated Topics
TreeDepth-First SearchBinary Tree
👍 1067👎 1726
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P567PermutationInString.md b/src/leetcode/editor/en/doc/content/P567PermutationInString.md
new file mode 100644
index 0000000..abae4b1
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P567PermutationInString.md
@@ -0,0 +1,28 @@
+Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
+
+In other words, return true if one of s1's permutations is the substring of s2.
+
+
+Example 1:
+
+
+Input: s1 = "ab", s2 = "eidbaooo"
+Output: true
+Explanation: s2 contains one permutation of s1 ("ba").
+
+
+Example 2:
+
+
+Input: s1 = "ab", s2 = "eidboaoo"
+Output: false
+
+
+
+Constraints:
+
+
+ 1 <= s1.length, s2.length <= 104s1 and s2 consist of lowercase English letters.
+Related Topics
Hash TableTwo PointersStringSliding Window
👍 5820👎 171
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P581ShortestUnsortedContinuousSubarray.md b/src/leetcode/editor/en/doc/content/P581ShortestUnsortedContinuousSubarray.md
new file mode 100644
index 0000000..40a985e
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P581ShortestUnsortedContinuousSubarray.md
@@ -0,0 +1,37 @@
+Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.
+
+Return the shortest such subarray and output its length.
+
+
+Example 1:
+
+
+Input: nums = [2,6,4,8,10,9,15]
+Output: 5
+Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
+
+
+Example 2:
+
+
+Input: nums = [1,2,3,4]
+Output: 0
+
+
+Example 3:
+
+
+Input: nums = [1]
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 104-105 <= nums[i] <= 105
+
+
+Follow up: Can you solve it in O(n) time complexity?Related Topics
ArrayTwo PointersStackGreedySortingMonotonic Stack
👍 5881👎 217
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P583DeleteOperationForTwoStrings.md b/src/leetcode/editor/en/doc/content/P583DeleteOperationForTwoStrings.md
new file mode 100644
index 0000000..1880d33
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P583DeleteOperationForTwoStrings.md
@@ -0,0 +1,28 @@
+Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same.
+
+In one step, you can delete exactly one character in either string.
+
+
+Example 1:
+
+
+Input: word1 = "sea", word2 = "eat"
+Output: 2
+Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
+
+
+Example 2:
+
+
+Input: word1 = "leetcode", word2 = "etco"
+Output: 4
+
+
+
+Constraints:
+
+
+ 1 <= word1.length, word2.length <= 500word1 and word2 consist of only lowercase English letters.
+Related Topics
StringDynamic Programming
👍 3791👎 58
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P5LongestPalindromicSubstring.md b/src/leetcode/editor/en/doc/content/P5LongestPalindromicSubstring.md
new file mode 100644
index 0000000..cad0041
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P5LongestPalindromicSubstring.md
@@ -0,0 +1,26 @@
+Given a string s, return the longest palindromic substring in s.
+
+
+Example 1:
+
+
+Input: s = "babad"
+Output: "bab"
+Explanation: "aba" is also a valid answer.
+
+
+Example 2:
+
+
+Input: s = "cbbd"
+Output: "bb"
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 1000s consist of only digits and English letters.
+Related Topics
StringDynamic Programming
👍 18757👎 1091
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P630CourseScheduleIii.md b/src/leetcode/editor/en/doc/content/P630CourseScheduleIii.md
new file mode 100644
index 0000000..e3ef36f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P630CourseScheduleIii.md
@@ -0,0 +1,42 @@
+There are n different online courses numbered from 1 to n. You are given an array courses where courses[i] = [durationi, lastDayi] indicate that the ith course should be taken continuously for durationi days and must be finished before or on lastDayi.
+
+You will start on the 1st day and you cannot take two or more courses simultaneously.
+
+Return the maximum number of courses that you can take.
+
+
+Example 1:
+
+
+Input: courses = [[100,200],[200,1300],[1000,1250],[2000,3200]]
+Output: 3
+Explanation:
+There are totally 4 courses, but you can take 3 courses at most:
+First, take the 1st course, it costs 100 days so you will finish it on the 100th day, and ready to take the next course on the 101st day.
+Second, take the 3rd course, it costs 1000 days so you will finish it on the 1100th day, and ready to take the next course on the 1101st day.
+Third, take the 2nd course, it costs 200 days so you will finish it on the 1300th day.
+The 4th course cannot be taken now, since you will finish it on the 3300th day, which exceeds the closed date.
+
+
+Example 2:
+
+
+Input: courses = [[1,2]]
+Output: 1
+
+
+Example 3:
+
+
+Input: courses = [[3,2],[4,3]]
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= courses.length <= 1041 <= durationi, lastDayi <= 104
+Related Topics
ArrayGreedyHeap (Priority Queue)
👍 2792👎 76
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P63UniquePathsIi.md b/src/leetcode/editor/en/doc/content/P63UniquePathsIi.md
new file mode 100644
index 0000000..e2cfdc4
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P63UniquePathsIi.md
@@ -0,0 +1,37 @@
+You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m-1][n-1]). The robot can only move either down or right at any point in time.
+
+An obstacle and space are marked as 1 or 0 respectively in grid. A path that the robot takes cannot include any square that is an obstacle.
+
+Return the number of possible unique paths that the robot can take to reach the bottom-right corner.
+
+The testcases are generated so that the answer will be less than or equal to 2 * 109.
+
+
+Example 1:
+
+
+Input: obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]
+Output: 2
+Explanation: There is one obstacle in the middle of the 3x3 grid above.
+There are two ways to reach the bottom-right corner:
+1. Right -> Right -> Down -> Down
+2. Down -> Down -> Right -> Right
+
+
+Example 2:
+
+
+Input: obstacleGrid = [[0,1],[0,0]]
+Output: 1
+
+
+
+Constraints:
+
+
+ m == obstacleGrid.lengthn == obstacleGrid[i].length1 <= m, n <= 100obstacleGrid[i][j] is 0 or 1.
+Related Topics
ArrayDynamic ProgrammingMatrix
👍 5015👎 383
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P647PalindromicSubstrings.md b/src/leetcode/editor/en/doc/content/P647PalindromicSubstrings.md
new file mode 100644
index 0000000..8308047
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P647PalindromicSubstrings.md
@@ -0,0 +1,31 @@
+Given a string s, return the number of palindromic substrings in it.
+
+A string is a palindrome when it reads the same backward as forward.
+
+A substring is a contiguous sequence of characters within the string.
+
+
+Example 1:
+
+
+Input: s = "abc"
+Output: 3
+Explanation: Three palindromic strings: "a", "b", "c".
+
+
+Example 2:
+
+
+Input: s = "aaa"
+Output: 6
+Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 1000s consists of lowercase English letters.
+Related Topics
StringDynamic Programming
👍 6876👎 158
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P652FindDuplicateSubtrees.md b/src/leetcode/editor/en/doc/content/P652FindDuplicateSubtrees.md
new file mode 100644
index 0000000..32d27d2
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P652FindDuplicateSubtrees.md
@@ -0,0 +1,36 @@
+Given the root of a binary tree, return all duplicate subtrees.
+
+For each kind of duplicate subtrees, you only need to return the root node of any one of them.
+
+Two trees are duplicate if they have the same structure with the same node values.
+
+
+Example 1:
+
+
+Input: root = [1,2,3,4,null,2,4,null,null,4]
+Output: [[2,4],[4]]
+
+
+Example 2:
+
+
+Input: root = [2,1,1]
+Output: [[1]]
+
+
+Example 3:
+
+
+Input: root = [2,2,2,3,null,3,null]
+Output: [[2,3],[3]]
+
+
+
+Constraints:
+
+
+ - The number of the nodes in the tree will be in the range
[1, 10^4]
+ -200 <= Node.val <= 200
+Related Topics
Hash TableTreeDepth-First SearchBinary Tree
👍 3277👎 301
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P654MaximumBinaryTree.md b/src/leetcode/editor/en/doc/content/P654MaximumBinaryTree.md
new file mode 100644
index 0000000..4530fdb
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P654MaximumBinaryTree.md
@@ -0,0 +1,44 @@
+You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorithm:
+
+
+ - Create a root node whose value is the maximum value in
nums.
+ - Recursively build the left subtree on the subarray prefix to the left of the maximum value.
+ - Recursively build the right subtree on the subarray suffix to the right of the maximum value.
+
+
+Return the maximum binary tree built from nums.
+
+
+Example 1:
+
+
+Input: nums = [3,2,1,6,0,5]
+Output: [6,3,5,null,2,0,null,null,1]
+Explanation: The recursive calls are as follow:
+- The largest value in [3,2,1,6,0,5] is 6. Left prefix is [3,2,1] and right suffix is [0,5].
+ - The largest value in [3,2,1] is 3. Left prefix is [] and right suffix is [2,1].
+ - Empty array, so no child.
+ - The largest value in [2,1] is 2. Left prefix is [] and right suffix is [1].
+ - Empty array, so no child.
+ - Only one element, so child is a node with value 1.
+ - The largest value in [0,5] is 5. Left prefix is [0] and right suffix is [].
+ - Only one element, so child is a node with value 0.
+ - Empty array, so no child.
+
+
+Example 2:
+
+
+Input: nums = [3,2,1]
+Output: [3,null,2,null,1]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 10000 <= nums[i] <= 1000- All integers in
nums are unique.
+
+Related Topics
ArrayDivide and ConquerStackTreeMonotonic StackBinary Tree
👍 3686👎 296
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P665NonDecreasingArray.md b/src/leetcode/editor/en/doc/content/P665NonDecreasingArray.md
new file mode 100644
index 0000000..86ba29d
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P665NonDecreasingArray.md
@@ -0,0 +1,30 @@
+Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element.
+
+We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2).
+
+
+Example 1:
+
+
+Input: nums = [4,2,3]
+Output: true
+Explanation: You could modify the first 4 to 1 to get a non-decreasing array.
+
+
+Example 2:
+
+
+Input: nums = [4,2,1]
+Output: false
+Explanation: You can't get a non-decreasing array by modify at most one element.
+
+
+
+Constraints:
+
+
+ n == nums.length1 <= n <= 104-105 <= nums[i] <= 105
+
👍 4223👎 684
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P703KthLargestElementInAStream.md b/src/leetcode/editor/en/doc/content/P703KthLargestElementInAStream.md
new file mode 100644
index 0000000..43e3dab
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P703KthLargestElementInAStream.md
@@ -0,0 +1,40 @@
+Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.
+
+Implement KthLargest class:
+
+
+ KthLargest(int k, int[] nums) Initializes the object with the integer k and the stream of integers nums.int add(int val) Appends the integer val to the stream and returns the element representing the kth largest element in the stream.
+
+
+Example 1:
+
+
+Input
+["KthLargest", "add", "add", "add", "add", "add"]
+[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
+Output
+[null, 4, 5, 5, 8, 8]
+
+Explanation
+KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
+kthLargest.add(3); // return 4
+kthLargest.add(5); // return 5
+kthLargest.add(10); // return 5
+kthLargest.add(9); // return 8
+kthLargest.add(4); // return 8
+
+
+
+Constraints:
+
+
+ 1 <= k <= 1040 <= nums.length <= 104-104 <= nums[i] <= 104-104 <= val <= 104- At most
104 calls will be made to add.
+ - It is guaranteed that there will be at least
k elements in the array when you search for the kth element.
+
+Related Topics
TreeDesignBinary Search TreeHeap (Priority Queue)Binary TreeData Stream
👍 2989👎 1773
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P704BinarySearch.md b/src/leetcode/editor/en/doc/content/P704BinarySearch.md
new file mode 100644
index 0000000..25f1706
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P704BinarySearch.md
@@ -0,0 +1,31 @@
+Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
+
+You must write an algorithm with O(log n) runtime complexity.
+
+
+Example 1:
+
+
+Input: nums = [-1,0,3,5,9,12], target = 9
+Output: 4
+Explanation: 9 exists in nums and its index is 4
+
+
+Example 2:
+
+
+Input: nums = [-1,0,3,5,9,12], target = 2
+Output: -1
+Explanation: 2 does not exist in nums so return -1
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 104-104 < nums[i], target < 104- All the integers in
nums are unique.
+ nums is sorted in ascending order.
+Related Topics
ArrayBinary Search
👍 4750👎 111
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P712MinimumAsciiDeleteSumForTwoStrings.md b/src/leetcode/editor/en/doc/content/P712MinimumAsciiDeleteSumForTwoStrings.md
new file mode 100644
index 0000000..044b0b6
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P712MinimumAsciiDeleteSumForTwoStrings.md
@@ -0,0 +1,33 @@
+Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal.
+
+
+Example 1:
+
+
+Input: s1 = "sea", s2 = "eat"
+Output: 231
+Explanation: Deleting "s" from "sea" adds the ASCII value of "s" (115) to the sum.
+Deleting "t" from "eat" adds 116 to the sum.
+At the end, both strings are equal, and 115 + 116 = 231 is the minimum sum possible to achieve this.
+
+
+Example 2:
+
+
+Input: s1 = "delete", s2 = "leet"
+Output: 403
+Explanation: Deleting "dee" from "delete" to turn the string into "let",
+adds 100[d] + 101[e] + 101[e] to the sum.
+Deleting "e" from "leet" adds 101[e] to the sum.
+At the end, both strings are equal to "let", and the answer is 100+101+101+101 = 403.
+If instead we turned both strings into "lee" or "eet", we would get answers of 433 or 417, which are higher.
+
+
+
+Constraints:
+
+
+ 1 <= s1.length, s2.length <= 1000s1 and s2 consist of lowercase English letters.
+Related Topics
StringDynamic Programming
👍 2042👎 66
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P72EditDistance.md b/src/leetcode/editor/en/doc/content/P72EditDistance.md
new file mode 100644
index 0000000..e082c23
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P72EditDistance.md
@@ -0,0 +1,43 @@
+Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
+
+You have the following three operations permitted on a word:
+
+
+ - Insert a character
+ - Delete a character
+ - Replace a character
+
+
+
+Example 1:
+
+
+Input: word1 = "horse", word2 = "ros"
+Output: 3
+Explanation:
+horse -> rorse (replace 'h' with 'r')
+rorse -> rose (remove 'r')
+rose -> ros (remove 'e')
+
+
+Example 2:
+
+
+Input: word1 = "intention", word2 = "execution"
+Output: 5
+Explanation:
+intention -> inention (remove 't')
+inention -> enention (replace 'i' with 'e')
+enention -> exention (replace 'n' with 'x')
+exention -> exection (replace 'n' with 'c')
+exection -> execution (insert 'u')
+
+
+
+Constraints:
+
+
+ 0 <= word1.length, word2.length <= 500word1 and word2 consist of lowercase English letters.
+Related Topics
StringDynamic Programming
👍 8911👎 103
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P743NetworkDelayTime.md b/src/leetcode/editor/en/doc/content/P743NetworkDelayTime.md
new file mode 100644
index 0000000..8f8b850
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P743NetworkDelayTime.md
@@ -0,0 +1,39 @@
+You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target.
+
+We will send a signal from a given node k. Return the time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.
+
+
+Example 1:
+
+
+Input: times = [[2,1,1],[2,3,1],[3,4,1]], n = 4, k = 2
+Output: 2
+
+
+Example 2:
+
+
+Input: times = [[1,2,1]], n = 2, k = 1
+Output: 1
+
+
+Example 3:
+
+
+Input: times = [[1,2,1]], n = 2, k = 2
+Output: -1
+
+
+
+Constraints:
+
+
+ 1 <= k <= n <= 1001 <= times.length <= 6000times[i].length == 31 <= ui, vi <= nui != vi0 <= wi <= 100- All the pairs
(ui, vi) are unique. (i.e., no multiple edges.)
+
+Related Topics
Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)Shortest Path
👍 4552👎 296
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P745PrefixAndSuffixSearch.md b/src/leetcode/editor/en/doc/content/P745PrefixAndSuffixSearch.md
new file mode 100644
index 0000000..7d62a1c
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P745PrefixAndSuffixSearch.md
@@ -0,0 +1,35 @@
+Design a special dictionary with some words that searchs the words in it by a prefix and a suffix.
+
+Implement the WordFilter class:
+
+
+ WordFilter(string[] words) Initializes the object with the words in the dictionary.f(string prefix, string suffix) Returns the index of the word in the dictionary, which has the prefix prefix and the suffix suffix. If there is more than one valid index, return the largest of them. If there is no such word in the dictionary, return -1.
+
+
+Example 1:
+
+
+Input
+["WordFilter", "f"]
+[[["apple"]], ["a", "e"]]
+Output
+[null, 0]
+
+Explanation
+WordFilter wordFilter = new WordFilter(["apple"]);
+wordFilter.f("a", "e"); // return 0, because the word at index 0 has prefix = "a" and suffix = 'e".
+
+
+
+Constraints:
+
+
+ 1 <= words.length <= 150001 <= words[i].length <= 101 <= prefix.length, suffix.length <= 10words[i], prefix and suffix consist of lower-case English letters only.- At most
15000 calls will be made to the function f.
+
+Related Topics
StringDesignTrie
👍 1716👎 413
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P785IsGraphBipartite.md b/src/leetcode/editor/en/doc/content/P785IsGraphBipartite.md
new file mode 100644
index 0000000..2e4c450
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P785IsGraphBipartite.md
@@ -0,0 +1,41 @@
+There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array graph, where graph[u] is an array of nodes that node u is adjacent to. More formally, for each v in graph[u], there is an undirected edge between node u and node v. The graph has the following properties:
+
+
+ - There are no self-edges (
graph[u] does not contain u).
+ - There are no parallel edges (
graph[u] does not contain duplicate values).
+ - If
v is in graph[u], then u is in graph[v] (the graph is undirected).
+ - The graph may not be connected, meaning there may be two nodes
u and v such that there is no path between them.
+
+
+A graph is bipartite if the nodes can be partitioned into two independent sets A and B such that every edge in the graph connects a node in set A and a node in set B.
+
+Return true if and only if it is bipartite.
+
+
+Example 1:
+
+
+Input: graph = [[1,2,3],[0,2],[0,1,3],[0,2]]
+Output: false
+Explanation: There is no way to partition the nodes into two independent sets such that every edge connects a node in one and a node in the other.
+
+Example 2:
+
+
+Input: graph = [[1,3],[0,2],[1,3],[0,2]]
+Output: true
+Explanation: We can partition the nodes into two sets: {0, 2} and {1, 3}.
+
+
+Constraints:
+
+
+ graph.length == n1 <= n <= 1000 <= graph[u].length < n0 <= graph[u][i] <= n - 1graph[u] does not contain u.- All the values of
graph[u] are unique.
+ - If
graph[u] contains v, then graph[v] contains u.
+
+Related Topics
Depth-First SearchBreadth-First SearchUnion FindGraph
👍 4453👎 269
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P820ShortEncodingOfWords.md b/src/leetcode/editor/en/doc/content/P820ShortEncodingOfWords.md
new file mode 100644
index 0000000..e1fcb15
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P820ShortEncodingOfWords.md
@@ -0,0 +1,39 @@
+A valid encoding of an array of words is any reference string s and array of indices indices such that:
+
+
+ words.length == indices.length- The reference string
s ends with the '#' character.
+ - For each index
indices[i], the substring of s starting from indices[i] and up to (but not including) the next '#' character is equal to words[i].
+
+
+Given an array of words, return the length of the shortest reference string s possible of any valid encoding of words.
+
+
+Example 1:
+
+
+Input: words = ["time", "me", "bell"]
+Output: 10
+Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
+words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
+words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "time#bell#"
+words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#bell#"
+
+
+Example 2:
+
+
+Input: words = ["t"]
+Output: 2
+Explanation: A valid encoding would be s = "t#" and indices = [0].
+
+
+
+Constraints:
+
+
+ 1 <= words.length <= 20001 <= words[i].length <= 7words[i] consists of only lowercase letters.
+Related Topics
ArrayHash TableStringTrie
👍 1281👎 501
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P83RemoveDuplicatesFromSortedList.md b/src/leetcode/editor/en/doc/content/P83RemoveDuplicatesFromSortedList.md
new file mode 100644
index 0000000..a363a6f
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P83RemoveDuplicatesFromSortedList.md
@@ -0,0 +1,26 @@
+Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
+
+
+Example 1:
+
+
+Input: head = [1,1,2]
+Output: [1,2]
+
+
+Example 2:
+
+
+Input: head = [1,1,2,3,3]
+Output: [1,2,3]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is in the range
[0, 300].
+ -100 <= Node.val <= 100- The list is guaranteed to be sorted in ascending order.
+
+Related Topics
Linked List
👍 4729👎 184
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P870AdvantageShuffle.md b/src/leetcode/editor/en/doc/content/P870AdvantageShuffle.md
new file mode 100644
index 0000000..0f771d2
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P870AdvantageShuffle.md
@@ -0,0 +1,21 @@
+You are given two integer arrays nums1 and nums2 both of the same length. The advantage of nums1 with respect to nums2 is the number of indices i for which nums1[i] > nums2[i].
+
+Return any permutation of nums1 that maximizes its advantage with respect to nums2.
+
+
+Example 1:
+Input: nums1 = [2,7,11,15], nums2 = [1,10,4,11]
+Output: [2,11,7,15]
+
Example 2:
+Input: nums1 = [12,24,8,32], nums2 = [13,25,32,11]
+Output: [24,32,8,12]
+
+
+Constraints:
+
+
+ 1 <= nums1.length <= 105nums2.length == nums1.length0 <= nums1[i], nums2[i] <= 109
+Related Topics
ArrayGreedySorting
👍 1237👎 79
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P875KokoEatingBananas.md b/src/leetcode/editor/en/doc/content/P875KokoEatingBananas.md
new file mode 100644
index 0000000..135496b
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P875KokoEatingBananas.md
@@ -0,0 +1,39 @@
+Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours.
+
+Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them instead and will not eat any more bananas during this hour.
+
+Koko likes to eat slowly but still wants to finish eating all the bananas before the guards return.
+
+Return the minimum integer k such that she can eat all the bananas within h hours.
+
+
+Example 1:
+
+
+Input: piles = [3,6,7,11], h = 8
+Output: 4
+
+
+Example 2:
+
+
+Input: piles = [30,11,23,4,20], h = 5
+Output: 30
+
+
+Example 3:
+
+
+Input: piles = [30,11,23,4,20], h = 6
+Output: 23
+
+
+
+Constraints:
+
+
+ 1 <= piles.length <= 104piles.length <= h <= 1091 <= piles[i] <= 109
+Related Topics
ArrayBinary Search
👍 4092👎 184
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P876MiddleOfTheLinkedList.md b/src/leetcode/editor/en/doc/content/P876MiddleOfTheLinkedList.md
new file mode 100644
index 0000000..6d4e141
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P876MiddleOfTheLinkedList.md
@@ -0,0 +1,29 @@
+Given the head of a singly linked list, return the middle node of the linked list.
+
+If there are two middle nodes, return the second middle node.
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4,5]
+Output: [3,4,5]
+Explanation: The middle node of the list is node 3.
+
+
+Example 2:
+
+
+Input: head = [1,2,3,4,5,6]
+Output: [4,5,6]
+Explanation: Since the list has two middle nodes with values 3 and 4, we return the second one.
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is in the range
[1, 100].
+ 1 <= Node.val <= 100
+Related Topics
Linked ListTwo Pointers
👍 5239👎 132
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P889ConstructBinaryTreeFromPreorderAndPostorderTraversal.md b/src/leetcode/editor/en/doc/content/P889ConstructBinaryTreeFromPreorderAndPostorderTraversal.md
new file mode 100644
index 0000000..692d502
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P889ConstructBinaryTreeFromPreorderAndPostorderTraversal.md
@@ -0,0 +1,32 @@
+Given two integer arrays, preorder and postorder where preorder is the preorder traversal of a binary tree of distinct values and postorder is the postorder traversal of the same tree, reconstruct and return the binary tree.
+
+If there exist multiple answers, you can return any of them.
+
+
+Example 1:
+
+
+Input: preorder = [1,2,4,5,3,6,7], postorder = [4,5,2,6,7,3,1]
+Output: [1,2,3,4,5,6,7]
+
+
+Example 2:
+
+
+Input: preorder = [1], postorder = [1]
+Output: [1]
+
+
+
+Constraints:
+
+
+ 1 <= preorder.length <= 301 <= preorder[i] <= preorder.length- All the values of
preorder are unique.
+ postorder.length == preorder.length1 <= postorder[i] <= postorder.length- All the values of
postorder are unique.
+ - It is guaranteed that
preorder and postorder are the preorder traversal and postorder traversal of the same binary tree.
+
+Related Topics
ArrayHash TableDivide and ConquerTreeBinary Tree
👍 1902👎 86
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P897IncreasingOrderSearchTree.md b/src/leetcode/editor/en/doc/content/P897IncreasingOrderSearchTree.md
new file mode 100644
index 0000000..53581f9
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P897IncreasingOrderSearchTree.md
@@ -0,0 +1,24 @@
+Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.
+
+
+Example 1:
+
+
+Input: root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
+Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
+
+
+Example 2:
+
+
+Input: root = [5,1,7]
+Output: [1,null,5,null,7]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the given tree will be in the range
[1, 100].
+ 0 <= Node.val <= 1000
Related Topics
StackTreeDepth-First SearchBinary Search TreeBinary Tree
👍 2965👎 620
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P905SortArrayByParity.md b/src/leetcode/editor/en/doc/content/P905SortArrayByParity.md
new file mode 100644
index 0000000..0cef581
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P905SortArrayByParity.md
@@ -0,0 +1,28 @@
+Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers.
+
+Return any array that satisfies this condition.
+
+
+Example 1:
+
+
+Input: nums = [3,1,2,4]
+Output: [2,4,3,1]
+Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
+
+
+Example 2:
+
+
+Input: nums = [0]
+Output: [0]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 50000 <= nums[i] <= 5000
+Related Topics
ArrayTwo PointersSorting
👍 3039👎 116
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P912SortAnArray.md b/src/leetcode/editor/en/doc/content/P912SortAnArray.md
new file mode 100644
index 0000000..e25dcc6
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P912SortAnArray.md
@@ -0,0 +1,18 @@
+Given an array of integers nums, sort the array in ascending order.
+
+
+Example 1:
+Input: nums = [5,2,3,1]
+Output: [1,2,3,5]
+
Example 2:
+Input: nums = [5,1,1,2,0,0]
+Output: [0,0,1,1,2,5]
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 5 * 104-5 * 104 <= nums[i] <= 5 * 104
+Related Topics
ArrayDivide and ConquerSortingHeap (Priority Queue)Merge SortBucket SortRadix SortCounting Sort
👍 2194👎 530
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P931MinimumFallingPathSum.md b/src/leetcode/editor/en/doc/content/P931MinimumFallingPathSum.md
new file mode 100644
index 0000000..3b4e1c8
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P931MinimumFallingPathSum.md
@@ -0,0 +1,30 @@
+Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.
+
+A falling path starts at any element in the first row and chooses the element in the next row that is either directly below or diagonally left/right. Specifically, the next element from position (row, col) will be (row + 1, col - 1), (row + 1, col), or (row + 1, col + 1).
+
+
+Example 1:
+
+
+Input: matrix = [[2,1,3],[6,5,4],[7,8,9]]
+Output: 13
+Explanation: There are two falling paths with a minimum sum as shown.
+
+
+Example 2:
+
+
+Input: matrix = [[-19,57],[-40,-5]]
+Output: -59
+Explanation: The falling path with a minimum sum is shown.
+
+
+
+Constraints:
+
+
+ n == matrix.length == matrix[i].length1 <= n <= 100-100 <= matrix[i][j] <= 100
+Related Topics
ArrayDynamic ProgrammingMatrix
👍 2527👎 95
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P95UniqueBinarySearchTreesIi.md b/src/leetcode/editor/en/doc/content/P95UniqueBinarySearchTreesIi.md
new file mode 100644
index 0000000..cf00bbd
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P95UniqueBinarySearchTreesIi.md
@@ -0,0 +1,24 @@
+Given an integer n, return all the structurally unique BST's (binary search trees), which has exactly n nodes of unique values from 1 to n. Return the answer in any order.
+
+
+Example 1:
+
+
+Input: n = 3
+Output: [[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
+
+
+Example 2:
+
+
+Input: n = 1
+Output: [[1]]
+
+
+
+Constraints:
+
+
+Related Topics
Dynamic ProgrammingBacktrackingTreeBinary Search TreeBinary Tree
👍 4786👎 319
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P968BinaryTreeCameras.md b/src/leetcode/editor/en/doc/content/P968BinaryTreeCameras.md
new file mode 100644
index 0000000..7133593
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P968BinaryTreeCameras.md
@@ -0,0 +1,29 @@
+You are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate children.
+
+Return the minimum number of cameras needed to monitor all nodes of the tree.
+
+
+Example 1:
+
+
+Input: root = [0,0,null,0,0]
+Output: 1
+Explanation: One camera is enough to monitor all nodes if placed as shown.
+
+
+Example 2:
+
+
+Input: root = [0,0,null,0,null,0,null,null,0]
+Output: 2
+Explanation: At least two cameras are needed to monitor all nodes of the tree. The above image shows one of the valid configurations of camera placement.
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[1, 1000].
+ Node.val == 0
+Related Topics
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
👍 3752👎 44
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P96UniqueBinarySearchTrees.md b/src/leetcode/editor/en/doc/content/P96UniqueBinarySearchTrees.md
new file mode 100644
index 0000000..8d172f5
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P96UniqueBinarySearchTrees.md
@@ -0,0 +1,24 @@
+Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.
+
+
+Example 1:
+
+
+Input: n = 3
+Output: 5
+
+
+Example 2:
+
+
+Input: n = 1
+Output: 1
+
+
+
+Constraints:
+
+
+Related Topics
MathDynamic ProgrammingTreeBinary Search TreeBinary Tree
👍 7303👎 298
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P97InterleavingString.md b/src/leetcode/editor/en/doc/content/P97InterleavingString.md
new file mode 100644
index 0000000..b8d9626
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P97InterleavingString.md
@@ -0,0 +1,47 @@
+Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.
+
+An interleaving of two strings s and t is a configuration where they are divided into non-empty substrings such that:
+
+
+ s = s1 + s2 + ... + snt = t1 + t2 + ... + tm|n - m| <= 1- The interleaving is
s1 + t1 + s2 + t2 + s3 + t3 + ... or t1 + s1 + t2 + s2 + t3 + s3 + ...
+
+
+Note: a + b is the concatenation of strings a and b.
+
+
+Example 1:
+
+
+Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
+Output: true
+
+
+Example 2:
+
+
+Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
+Output: false
+
+
+Example 3:
+
+
+Input: s1 = "", s2 = "", s3 = ""
+Output: true
+
+
+
+Constraints:
+
+
+ 0 <= s1.length, s2.length <= 1000 <= s3.length <= 200s1, s2, and s3 consist of lowercase English letters.
+
+
+Follow up: Could you solve it using only O(s2.length) additional memory space?
+Related Topics
StringDynamic Programming
👍 5058👎 296
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P98ValidateBinarySearchTree.md b/src/leetcode/editor/en/doc/content/P98ValidateBinarySearchTree.md
new file mode 100644
index 0000000..372cf7b
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P98ValidateBinarySearchTree.md
@@ -0,0 +1,34 @@
+Given the root of a binary tree, determine if it is a valid binary search tree (BST).
+
+A valid BST is defined as follows:
+
+
+ - The left subtree of a node contains only nodes with keys less than the node's key.
+ - The right subtree of a node contains only nodes with keys greater than the node's key.
+ - Both the left and right subtrees must also be binary search trees.
+
+
+
+Example 1:
+
+
+Input: root = [2,1,3]
+Output: true
+
+
+Example 2:
+
+
+Input: root = [5,1,4,null,null,3,6]
+Output: false
+Explanation: The root node's value is 5 but its right child's value is 4.
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[1, 104].
+ -231 <= Node.val <= 231 - 1
+Related Topics
TreeDepth-First SearchBinary Search TreeBinary Tree
👍 9908👎 894
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/content/P99RecoverBinarySearchTree.md b/src/leetcode/editor/en/doc/content/P99RecoverBinarySearchTree.md
new file mode 100644
index 0000000..285c47c
--- /dev/null
+++ b/src/leetcode/editor/en/doc/content/P99RecoverBinarySearchTree.md
@@ -0,0 +1,29 @@
+You are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changing its structure.
+
+
+Example 1:
+
+
+Input: root = [1,3,null,null,2]
+Output: [3,1,null,null,2]
+Explanation: 3 cannot be a left child of 1 because 3 > 1. Swapping 1 and 3 makes the BST valid.
+
+
+Example 2:
+
+
+Input: root = [3,1,4,null,null,2]
+Output: [2,1,4,null,null,3]
+Explanation: 2 cannot be in the right subtree of 3 because 2 < 3. Swapping 2 and 3 makes the BST valid.
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[2, 1000].
+ -231 <= Node.val <= 231 - 1
+
+
+Follow up: A solution using O(n) space is pretty straight-forward. Could you devise a constant O(1) space solution?Related Topics
TreeDepth-First SearchBinary Search TreeBinary Tree
👍 4879👎 168
\ No newline at end of file
diff --git a/src/leetcode/editor/en/doc/submission/P518CoinChange2737541656.txt b/src/leetcode/editor/en/doc/submission/P518CoinChange2737541656.txt
new file mode 100644
index 0000000..4b91674
--- /dev/null
+++ b/src/leetcode/editor/en/doc/submission/P518CoinChange2737541656.txt
@@ -0,0 +1,27 @@
+class Solution {
+ public int change(int amount, int[] coins) {
+ // dp[i+1][j+1]表示使用前i种硬币，得到金额j的总共装法数量
+ int n = coins.length;
+ int[][] dp = new int[n + 1][amount + 1];
+
+ // base case，第一列 金额为0 --> 装法为1
+ for (int i = 0; i <= n; i++) {
+ dp[i][0] = 1;
+ }
+
+ // dp更新
+ for (int i = 1; i <= n; i++) {
+ for (int j = 1; j <= amount; j++) {
+ if (j - coins[i - 1] >= 0) {
+ dp[i][j] = dp[i - 1][j] + dp[i][j - coins[i - 1]];
+ } else {
+ dp[i][j] = dp[i - 1][j];
+ }
+ }
+ }
+ return dp[n][amount];
+ }
+}
+
+//runtime:6 ms
+//memory:49 MB
diff --git a/src/leetcode/stack/One_One_Nine_Zero.java b/src/leetcode/stack/One_One_Nine_Zero.java
new file mode 100644
index 0000000..6e14d32
--- /dev/null
+++ b/src/leetcode/stack/One_One_Nine_Zero.java
@@ -0,0 +1,117 @@
+package leetcode.stack;
+
+/**
+ * @author eumes
+ * @date 2020/10/13
+ */
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Stack;
+
+/**
+ * title: Reverse Substrings Between Each Pair of Parentheses
+ * link: https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/
+ * description: You are given a string s that consists of lower case English letters and brackets.
+ *
+ * Reverse the strings in each pair of matching parentheses, starting from the innermost one.
+ *
+ * Your result should not contain any brackets.
+ *
+ * examples: Input: s = "(abcd)"
+ * Output: "dcba"
+ */
+public class One_One_Nine_Zero {
+
+ public static void main(String[] args) {
+ One_One_Nine_Zero solution = new One_One_Nine_Zero();
+ String s1 = "(abcd)";
+ String s2 = "(u(love)i)";
+ String s3 = "(ed(et(oc))el)";
+ String s4 = "a(bcdefghijkl(mno)p)q";
+
+ System.out.println(solution.reverseParentheses_2(s1));
+ System.out.println(solution.reverseParentheses_2(s2));
+ System.out.println(solution.reverseParentheses_2(s3));
+ System.out.println(solution.reverseParentheses_2(s4));
+ }
+
+ public String reverseParentheses(String s) {
+ s = "(" + s + ")";
+ Stack stack = new Stack<>();
+
+ String result = "";
+ for (int i = 0; i < s.length(); i++) {
+ while (i < s.length() && s.charAt(i) != ')') {
+ stack.push(s.charAt(i++));
+ }
+ while (!stack.empty() && stack.peek() != '(') {
+ result += stack.pop();
+ }
+ if (!stack.empty() && stack.peek() == '(') {
+ stack.pop();
+ }
+ if (stack.empty()){
+ return result;
+ }
+ for (int j = 0; j < result.length(); j++) {
+ stack.push(result.charAt(j));
+ }
+ result = "";
+ }
+
+ return result;
+ }
+
+ public String reverseParentheses_1(String s) {
+ Stack stack = new Stack<>();
+ StringBuilder stringBuilder = new StringBuilder();
+
+ for (char ch : s.toCharArray()) {
+ if (ch == '(') {
+ stack.push(stringBuilder);
+ stringBuilder = new StringBuilder();
+ } else if (ch == ')') {
+ stringBuilder = stack.pop().append(stringBuilder.reverse());
+ }else {
+ stringBuilder.append(ch);
+ }
+ }
+
+ return stringBuilder.toString();
+ }
+
+ /**
+ * link: https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/discuss/742862/Java-Straightforward-Stack-vs-O(n)
+ * @param s
+ * @return
+ */
+ public String reverseParentheses_2(String s) {
+ Stack stack = new Stack<>();
+ Map pair = new HashMap<>();
+ StringBuilder stringBuilder = new StringBuilder();
+
+ // 遍历获取()的配对信息
+ for (int i = 0; i < s.length(); i++) {
+ char ch = s.charAt(i);
+ if (ch == '(') {
+ stack.push(i);
+ } else if (ch == ')') {
+ pair.put(stack.peek(), i);
+ pair.put(i, stack.pop());
+ }
+ }
+
+ // 遍历获取结果
+ for (int i = 0, step = 1; i < s.length(); i += step) {
+ if (s.charAt(i) == '(' || s.charAt(i) == ')') {
+ i = pair.get(i);
+ step = -step;
+ } else {
+ stringBuilder.append(s.charAt(i));
+ }
+ }
+
+ return stringBuilder.toString();
+ }
+}
diff --git a/src/leetcode/stack/leetcode/editor/cn/P3LongestSubstringWithoutRepeatingCharacters.java b/src/leetcode/stack/leetcode/editor/cn/P3LongestSubstringWithoutRepeatingCharacters.java
new file mode 100644
index 0000000..38f3b48
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/P3LongestSubstringWithoutRepeatingCharacters.java
@@ -0,0 +1,88 @@
+//Given a string s, find the length of the longest substring without repeating c
+//haracters.
+//
+//
+// Example 1:
+//
+//
+//Input: s = "abcabcbb"
+//Output: 3
+//Explanation: The answer is "abc", with the length of 3.
+//
+//
+// Example 2:
+//
+//
+//Input: s = "bbbbb"
+//Output: 1
+//Explanation: The answer is "b", with the length of 1.
+//
+//
+// Example 3:
+//
+//
+//Input: s = "pwwkew"
+//Output: 3
+//Explanation: The answer is "wke", with the length of 3.
+//Notice that the answer must be a substring, "pwke" is a subsequence and not a
+//substring.
+//
+//
+// Example 4:
+//
+//
+//Input: s = ""
+//Output: 0
+//
+//
+//
+// Constraints:
+//
+//
+// 0 <= s.length <= 5 * 104
+// s consists of English letters, digits, symbols and spaces.
+//
+// Related Topics 哈希表 字符串 滑动窗口
+// 👍 5809 👎 0
+
+
+package leetcode.stack.leetcode.editor.cn;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * @author: eumes
+ * @date: 2021-07-27 00:36:59
+ * @title: Longest Substring Without Repeating Characters
+ */
+public class P3LongestSubstringWithoutRepeatingCharacters {
+
+ public static void main(String[] args) {
+ Solution_4 solution4 = new Solution_4();
+ // TO TEST
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_3 {
+ public int lengthOfLongestSubstring(String s) {
+ if (s == null || s.length() == 0) {
+ return 0;
+ }
+
+ int len = 0;
+ Map map = new HashMap<>();
+ for (int i = 0, j = 0; j < s.length(); j++) {
+ if (map.containsKey(s.charAt(j))) {
+ i = Math.max(map.get(s.charAt(j)) + 1, i);
+ }
+ map.put(s.charAt(j), j);
+ len = Math.max(len, j - i + 1);
+ }
+ return len;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/cn/P3LongestSubstringWithoutRepeatingCharacters200141786.txt b/src/leetcode/stack/leetcode/editor/cn/P3LongestSubstringWithoutRepeatingCharacters200141786.txt
new file mode 100644
index 0000000..79e7561
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/P3LongestSubstringWithoutRepeatingCharacters200141786.txt
@@ -0,0 +1,21 @@
+class Solution {
+ public int lengthOfLongestSubstring(String s) {
+ if (s == null || s.length() == 0) {
+ return 0;
+ }
+
+ int len = 0;
+ Map map = new HashMap<>();
+ for (int i = 0, j = 0; j < s.length(); j++) {
+ if (map.containsKey(s.charAt(j))) {
+ i = Math.max(map.get(s.charAt(j)) + 1, i);
+ }
+ map.put(s.charAt(j), j);
+ len = Math.max(len, j - i + 1);
+ }
+ return len;
+ }
+}
+
+//runtime:4 ms
+//memory:38.1 MB
diff --git a/src/leetcode/stack/leetcode/editor/cn/P4MedianOfTwoSortedArrays.java b/src/leetcode/stack/leetcode/editor/cn/P4MedianOfTwoSortedArrays.java
new file mode 100644
index 0000000..6dd0bb4
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/P4MedianOfTwoSortedArrays.java
@@ -0,0 +1,98 @@
+//Given two sorted arrays nums1 and nums2 of size m and n respectively, return t
+//he median of the two sorted arrays.
+//
+// The overall run time complexity should be O(log (m+n)).
+//
+//
+// Example 1:
+//
+//
+//Input: nums1 = [1,3], nums2 = [2]
+//Output: 2.00000
+//Explanation: merged array = [1,2,3] and median is 2.
+//
+//
+// Example 2:
+//
+//
+//Input: nums1 = [1,2], nums2 = [3,4]
+//Output: 2.50000
+//Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+//
+//
+// Example 3:
+//
+//
+//Input: nums1 = [0,0], nums2 = [0,0]
+//Output: 0.00000
+//
+//
+// Example 4:
+//
+//
+//Input: nums1 = [], nums2 = [1]
+//Output: 1.00000
+//
+//
+// Example 5:
+//
+//
+//Input: nums1 = [2], nums2 = []
+//Output: 2.00000
+//
+//
+//
+// Constraints:
+//
+//
+// nums1.length == m
+// nums2.length == n
+// 0 <= m <= 1000
+// 0 <= n <= 1000
+// 1 <= m + n <= 2000
+// -106 <= nums1[i], nums2[i] <= 106
+//
+// Related Topics 数组 二分查找 分治
+// 👍 4288 👎 0
+
+
+package leetcode.stack.leetcode.editor.cn;
+
+/**
+ * @author: eumes
+ * @date: 2021-07-27 00:51:02
+ * @title: Median of Two Sorted Arrays
+ */
+public class P4MedianOfTwoSortedArrays {
+
+ public static void main(String[] args) {
+ Solution_4 solution4 = new Solution_4();
+ // TO TEST
+ int[] num1 = {1, 3};
+ int[] num2 = {2};
+ System.out.println(solution4.findMedianSortedArrays(num1, num2) == 2.0);
+
+ num1 = new int[] {1, 2};
+ num2 = new int[] {3, 4};
+ System.out.println(solution4.findMedianSortedArrays(num1, num2) == 2.5);
+
+ num1 = new int[] {0, 0};
+ num2 = new int[] {0, 0};
+ System.out.println(solution4.findMedianSortedArrays(num1, num2) == 0.0);
+
+ num1 = new int[] {};
+ num2 = new int[] {1};
+ System.out.println(solution4.findMedianSortedArrays(num1, num2) == 1.0);
+ System.out.println(solution4.findMedianSortedArrays(num2, num1) == 1.0);
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_4 {
+ public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+
+ return 0.0;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/cn/P4MedianOfTwoSortedArrays.md b/src/leetcode/stack/leetcode/editor/cn/P4MedianOfTwoSortedArrays.md
new file mode 100644
index 0000000..b0fe332
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/P4MedianOfTwoSortedArrays.md
@@ -0,0 +1,54 @@
+Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
+
+The overall run time complexity should be O(log (m+n)).
+
+
+Example 1:
+
+
+Input: nums1 = [1,3], nums2 = [2]
+Output: 2.00000
+Explanation: merged array = [1,2,3] and median is 2.
+
+
+Example 2:
+
+
+Input: nums1 = [1,2], nums2 = [3,4]
+Output: 2.50000
+Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+
+
+Example 3:
+
+
+Input: nums1 = [0,0], nums2 = [0,0]
+Output: 0.00000
+
+
+Example 4:
+
+
+Input: nums1 = [], nums2 = [1]
+Output: 1.00000
+
+
+Example 5:
+
+
+Input: nums1 = [2], nums2 = []
+Output: 2.00000
+
+
+
+Constraints:
+
+
+ nums1.length == mnums2.length == n0 <= m <= 10000 <= n <= 10001 <= m + n <= 2000-106 <= nums1[i], nums2[i] <= 106
+\n👍 4288👎 0
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/cn/P5LongestPalindromicSubstring.java b/src/leetcode/stack/leetcode/editor/cn/P5LongestPalindromicSubstring.java
new file mode 100644
index 0000000..358c70f
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/P5LongestPalindromicSubstring.java
@@ -0,0 +1,83 @@
+//Given a string s, return the longest palindromic substring in s.
+//
+//
+// Example 1:
+//
+//
+//Input: s = "babad"
+//Output: "bab"
+//Note: "aba" is also a valid answer.
+//
+//
+// Example 2:
+//
+//
+//Input: s = "cbbd"
+//Output: "bb"
+//
+//
+// Example 3:
+//
+//
+//Input: s = "a"
+//Output: "a"
+//
+//
+// Example 4:
+//
+//
+//Input: s = "ac"
+//Output: "a"
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= s.length <= 1000
+// s consist of only digits and English letters (lower-case and/or upper-case),
+//
+//
+// Related Topics 字符串 动态规划
+// 👍 3870 👎 0
+
+
+package leetcode.stack.leetcode.editor.cn;
+
+/**
+ * @author: eumes
+ * @date: 2021-07-27 01:02:34
+ * @title: Longest Palindromic Substring
+ */
+public class P5LongestPalindromicSubstring {
+
+ public static void main(String[] args) {
+ Solution solution = new Solution();
+ // TO TEST
+ String s = "babad";
+ // bab / aba
+ System.out.println(solution.longestPalindrome(s));
+
+ // bb
+ s = "cbbd";
+ System.out.println(solution.longestPalindrome(s));
+
+ // a
+ s = "a";
+ System.out.println(solution.longestPalindrome(s));
+
+ // a
+ s = "ac";
+ System.out.println(solution.longestPalindrome(s));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+ public String longestPalindrome(String s) {
+
+ return "";
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/cn/P5LongestPalindromicSubstring.md b/src/leetcode/stack/leetcode/editor/cn/P5LongestPalindromicSubstring.md
new file mode 100644
index 0000000..68bfff1
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/P5LongestPalindromicSubstring.md
@@ -0,0 +1,40 @@
+Given a string s, return the longest palindromic substring in s.
+
+
+Example 1:
+
+
+Input: s = "babad"
+Output: "bab"
+Note: "aba" is also a valid answer.
+
+
+Example 2:
+
+
+Input: s = "cbbd"
+Output: "bb"
+
+
+Example 3:
+
+
+Input: s = "a"
+Output: "a"
+
+
+Example 4:
+
+
+Input: s = "ac"
+Output: "a"
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 1000s consist of only digits and English letters (lower-case and/or upper-case),
+\n👍 3870👎 0
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/cn/all.json b/src/leetcode/stack/leetcode/editor/cn/all.json
new file mode 100644
index 0000000..f347677
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/all.json
@@ -0,0 +1 @@
+[{"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":"[1]Two Sum","frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","title":"Two Sum","titleSlug":"two-sum"},{"articleLive":2,"formTitle":"[2]Add Two Numbers","frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","title":"Remove Element","titleSlug":"remove-element"},{"articleLive":2,"formTitle":"[28]Implement strStr()","frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"[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":"[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":"[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":"ac","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":"ac","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":1,"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":"ac","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":"ac","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":"ac","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":1,"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":"ac","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":1,"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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"ac","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":"","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":"","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":"[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":"[面试题 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/src/leetcode/stack/leetcode/editor/cn/doc/all.json b/src/leetcode/stack/leetcode/editor/cn/doc/all.json
new file mode 100644
index 0000000..832ab99
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/doc/all.json
@@ -0,0 +1 @@
+[{"acceptance":0.42479064703548064,"acs":41748,"articleLive":2,"columnArticles":507,"formTitle":"[397]Integer Replacement","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":98279,"title":"Integer Replacement","titleSlug":"integer-replacement"},{"acceptance":0.5218469201258157,"acs":2691366,"articleLive":2,"columnArticles":14897,"formTitle":"[1]Two Sum","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"","submitted":5157386,"title":"Two Sum","titleSlug":"two-sum"},{"acceptance":0.4101711379367232,"acs":1066616,"articleLive":2,"columnArticles":7555,"formTitle":"[2]Add Two Numbers","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"","submitted":2600417,"title":"Add Two Numbers","titleSlug":"add-two-numbers"},{"acceptance":0.3821391747033306,"acs":1332376,"articleLive":2,"columnArticles":7945,"formTitle":"[3]Longest Substring Without Repeating Characters","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"","submitted":3486625,"title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4097631828228607,"acs":551531,"articleLive":2,"columnArticles":4108,"formTitle":"[4]Median of Two Sorted Arrays","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"","submitted":1345975,"title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.357253437096561,"acs":789220,"articleLive":2,"columnArticles":4258,"formTitle":"[5]Longest Palindromic Substring","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"","submitted":2209132,"title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5085742985165802,"acs":323023,"articleLive":2,"columnArticles":2633,"formTitle":"[6]ZigZag Conversion","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"","submitted":635154,"title":"ZigZag Conversion","titleSlug":"zigzag-conversion"},{"acceptance":0.35128531876817093,"acs":886263,"articleLive":2,"columnArticles":5532,"formTitle":"[7]Reverse Integer","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"","submitted":2522915,"title":"Reverse Integer","titleSlug":"reverse-integer"},{"acceptance":0.21724408858518593,"acs":368023,"articleLive":2,"columnArticles":2834,"formTitle":"[8]String to Integer (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1694053,"title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5822246254615608,"acs":817246,"articleLive":2,"columnArticles":5175,"formTitle":"[9]Palindrome Number","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1403661,"title":"Palindrome Number","titleSlug":"palindrome-number"},{"acceptance":0.3156065204057698,"acs":216632,"articleLive":2,"columnArticles":1298,"formTitle":"[10]Regular Expression Matching","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","submitted":686399,"title":"Regular Expression Matching","titleSlug":"regular-expression-matching"},{"acceptance":0.6243534082085717,"acs":570915,"articleLive":2,"columnArticles":3231,"formTitle":"[11]Container With Most Water","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"","submitted":914410,"title":"Container With Most Water","titleSlug":"container-with-most-water"},{"acceptance":0.6640349347878426,"acs":239955,"articleLive":2,"columnArticles":1869,"formTitle":"[12]Integer to Roman","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","submitted":361359,"title":"Integer to Roman","titleSlug":"integer-to-roman"},{"acceptance":0.6310281582400686,"acs":495778,"articleLive":2,"columnArticles":4063,"formTitle":"[13]Roman to Integer","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","submitted":785667,"title":"Roman to Integer","titleSlug":"roman-to-integer"},{"acceptance":0.41233685648471563,"acs":662855,"articleLive":2,"columnArticles":4140,"formTitle":"[14]Longest Common Prefix","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1607557,"title":"Longest Common Prefix","titleSlug":"longest-common-prefix"},{"acceptance":0.3389131727959099,"acs":707041,"articleLive":2,"columnArticles":3330,"formTitle":"[15]3Sum","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","submitted":2086201,"title":"3Sum","titleSlug":"3sum"},{"acceptance":0.45848549519157483,"acs":276707,"articleLive":2,"columnArticles":1516,"formTitle":"[16]3Sum Closest","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":603524,"title":"3Sum Closest","titleSlug":"3sum-closest"},{"acceptance":0.574015255799856,"acs":363618,"articleLive":2,"columnArticles":3287,"formTitle":"[17]Letter Combinations of a Phone Number","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","submitted":633464,"title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39515181342466577,"acs":236055,"articleLive":2,"columnArticles":1633,"formTitle":"[18]4Sum","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":597378,"title":"4Sum","titleSlug":"4sum"},{"acceptance":0.4311052194413914,"acs":565213,"articleLive":2,"columnArticles":4215,"formTitle":"[19]Remove Nth Node From End of List","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"","submitted":1311079,"title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4453193671841225,"acs":837444,"articleLive":2,"columnArticles":5918,"formTitle":"[20]Valid Parentheses","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"","submitted":1880547,"title":"Valid Parentheses","titleSlug":"valid-parentheses"},{"acceptance":0.6672842079663697,"acs":768271,"articleLive":2,"columnArticles":3712,"formTitle":"[21]Merge Two Sorted Lists","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"","submitted":1151340,"title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7726773830244702,"acs":377337,"articleLive":2,"columnArticles":2822,"formTitle":"[22]Generate Parentheses","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","submitted":488350,"title":"Generate Parentheses","titleSlug":"generate-parentheses"},{"acceptance":0.5610710690557681,"acs":348355,"articleLive":2,"columnArticles":2238,"formTitle":"[23]Merge k Sorted Lists","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"","submitted":620875,"title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7039198256282359,"acs":338130,"articleLive":2,"columnArticles":2659,"formTitle":"[24]Swap Nodes in Pairs","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"","submitted":480353,"title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6578246853137499,"acs":245885,"articleLive":2,"columnArticles":2322,"formTitle":"[25]Reverse Nodes in k-Group","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"","submitted":373785,"title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5372925461884128,"acs":869248,"articleLive":2,"columnArticles":4809,"formTitle":"[26]Remove Duplicates from Sorted Array","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"","submitted":1617830,"title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5962796341106831,"acs":517975,"articleLive":2,"columnArticles":4355,"formTitle":"[27]Remove Element","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"","submitted":868678,"title":"Remove Element","titleSlug":"remove-element"},{"acceptance":0.4038834888757757,"acs":500324,"articleLive":2,"columnArticles":3411,"formTitle":"[28]Implement strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"","submitted":1238783,"title":"Implement strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2197554319440092,"acs":134638,"articleLive":2,"columnArticles":1063,"formTitle":"[29]Divide Two Integers","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":612672,"title":"Divide Two Integers","titleSlug":"divide-two-integers"},{"acceptance":0.3604777184209179,"acs":84483,"articleLive":2,"columnArticles":637,"formTitle":"[30]Substring with Concatenation of All Words","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"","submitted":234364,"title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3727249493714293,"acs":230429,"articleLive":2,"columnArticles":1858,"formTitle":"[31]Next Permutation","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","submitted":618228,"title":"Next Permutation","titleSlug":"next-permutation"},{"acceptance":0.35698336183016355,"acs":203357,"articleLive":2,"columnArticles":1379,"formTitle":"[32]Longest Valid Parentheses","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":569654,"title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4290047690804075,"acs":393735,"articleLive":2,"columnArticles":2608,"formTitle":"[33]Search in Rotated Sorted Array","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"","submitted":917787,"title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4228559087455223,"acs":373967,"articleLive":2,"columnArticles":3561,"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":884384,"title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46099455417484553,"acs":561998,"articleLive":2,"columnArticles":4254,"formTitle":"[35]Search Insert Position","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","submitted":1219099,"title":"Search Insert Position","titleSlug":"search-insert-position"},{"acceptance":0.6387638676190365,"acs":218562,"articleLive":2,"columnArticles":1548,"formTitle":"[36]Valid Sudoku","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"","submitted":342164,"title":"Valid Sudoku","titleSlug":"valid-sudoku"},{"acceptance":0.670618162367912,"acs":107824,"articleLive":2,"columnArticles":911,"formTitle":"[37]Sudoku Solver","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":160783,"title":"Sudoku Solver","titleSlug":"sudoku-solver"},{"acceptance":0.5966044069133333,"acs":248123,"articleLive":2,"columnArticles":2636,"formTitle":"[38]Count and Say","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":415892,"title":"Count and Say","titleSlug":"count-and-say"},{"acceptance":0.7272844436120962,"acs":361160,"articleLive":2,"columnArticles":2094,"formTitle":"[39]Combination Sum","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","submitted":496587,"title":"Combination Sum","titleSlug":"combination-sum"},{"acceptance":0.6184951240494928,"acs":214243,"articleLive":2,"columnArticles":1474,"formTitle":"[40]Combination Sum II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","submitted":346394,"title":"Combination Sum II","titleSlug":"combination-sum-ii"},{"acceptance":0.41996603205304006,"acs":174574,"articleLive":2,"columnArticles":1487,"formTitle":"[41]First Missing Positive","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"","submitted":415686,"title":"First Missing Positive","titleSlug":"first-missing-positive"},{"acceptance":0.5872347779271427,"acs":353402,"articleLive":2,"columnArticles":2615,"formTitle":"[42]Trapping Rain Water","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","submitted":601807,"title":"Trapping Rain Water","titleSlug":"trapping-rain-water"},{"acceptance":0.44893342113402573,"acs":179981,"articleLive":2,"columnArticles":1213,"formTitle":"[43]Multiply Strings","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"","submitted":400908,"title":"Multiply Strings","titleSlug":"multiply-strings"},{"acceptance":0.3281686364753457,"acs":88131,"articleLive":2,"columnArticles":575,"formTitle":"[44]Wildcard Matching","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":268554,"title":"Wildcard Matching","titleSlug":"wildcard-matching"},{"acceptance":0.43265393634323196,"acs":223991,"articleLive":2,"columnArticles":1779,"formTitle":"[45]Jump Game II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"","submitted":517714,"title":"Jump Game II","titleSlug":"jump-game-ii"},{"acceptance":0.7836739553567731,"acs":454161,"articleLive":2,"columnArticles":2920,"formTitle":"[46]Permutations","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","submitted":579528,"title":"Permutations","titleSlug":"permutations"},{"acceptance":0.6397655508317167,"acs":232494,"articleLive":2,"columnArticles":1590,"formTitle":"[47]Permutations II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"","submitted":363405,"title":"Permutations II","titleSlug":"permutations-ii"},{"acceptance":0.7354782431795134,"acs":238609,"articleLive":2,"columnArticles":1991,"formTitle":"[48]Rotate Image","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","submitted":324427,"title":"Rotate Image","titleSlug":"rotate-image"},{"acceptance":0.6661645696733416,"acs":248105,"articleLive":2,"columnArticles":1405,"formTitle":"[49]Group Anagrams","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":372438,"title":"Group Anagrams","titleSlug":"group-anagrams"},{"acceptance":0.37585105041363054,"acs":229483,"articleLive":2,"columnArticles":1356,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","submitted":610569,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.737486427795874,"acs":163014,"articleLive":2,"columnArticles":1623,"formTitle":"[51]N-Queens","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","submitted":221040,"title":"N-Queens","titleSlug":"n-queens"},{"acceptance":0.8217533571307156,"acs":77350,"articleLive":2,"columnArticles":631,"formTitle":"[52]N-Queens II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":94128,"title":"N-Queens II","titleSlug":"n-queens-ii"},{"acceptance":0.5532920324644957,"acs":747710,"articleLive":2,"columnArticles":4021,"formTitle":"[53]Maximum Subarray","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","submitted":1351384,"title":"Maximum Subarray","titleSlug":"maximum-subarray"},{"acceptance":0.4822483926656504,"acs":200570,"articleLive":2,"columnArticles":2123,"formTitle":"[54]Spiral Matrix","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":415906,"title":"Spiral Matrix","titleSlug":"spiral-matrix"},{"acceptance":0.43324237022474243,"acs":354355,"articleLive":2,"columnArticles":2710,"formTitle":"[55]Jump Game","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","submitted":817914,"title":"Jump Game","titleSlug":"jump-game"},{"acceptance":0.47209745166972383,"acs":324034,"articleLive":2,"columnArticles":2492,"formTitle":"[56]Merge Intervals","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":686371,"title":"Merge Intervals","titleSlug":"merge-intervals"},{"acceptance":0.4122484173265866,"acs":90841,"articleLive":2,"columnArticles":969,"formTitle":"[57]Insert Interval","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":220355,"title":"Insert Interval","titleSlug":"insert-interval"},{"acceptance":0.3809571573108188,"acs":262065,"articleLive":2,"columnArticles":2815,"formTitle":"[58]Length of Last Word","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":687912,"title":"Length of Last Word","titleSlug":"length-of-last-word"},{"acceptance":0.7862519218853983,"acs":137050,"articleLive":2,"columnArticles":1675,"formTitle":"[59]Spiral Matrix II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":174308,"title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5254829671971273,"acs":93217,"articleLive":2,"columnArticles":997,"formTitle":"[60]Permutation Sequence","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":177393,"title":"Permutation Sequence","titleSlug":"permutation-sequence"},{"acceptance":0.4177984029196373,"acs":206979,"articleLive":2,"columnArticles":2108,"formTitle":"[61]Rotate List","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"","submitted":495404,"title":"Rotate List","titleSlug":"rotate-list"},{"acceptance":0.6636396860202752,"acs":334124,"articleLive":2,"columnArticles":2569,"formTitle":"[62]Unique Paths","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","submitted":503472,"title":"Unique Paths","titleSlug":"unique-paths"},{"acceptance":0.3935209631428873,"acs":193765,"articleLive":2,"columnArticles":1837,"formTitle":"[63]Unique Paths II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":492388,"title":"Unique Paths II","titleSlug":"unique-paths-ii"},{"acceptance":0.6889875438073856,"acs":284474,"articleLive":2,"columnArticles":2194,"formTitle":"[64]Minimum Path Sum","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","submitted":412887,"title":"Minimum Path Sum","titleSlug":"minimum-path-sum"},{"acceptance":0.2704733070258992,"acs":47705,"articleLive":2,"columnArticles":661,"formTitle":"[65]Valid Number","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","submitted":176376,"title":"Valid Number","titleSlug":"valid-number"},{"acceptance":0.4638014361232767,"acs":401044,"articleLive":2,"columnArticles":3677,"formTitle":"[66]Plus One","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"","submitted":864689,"title":"Plus One","titleSlug":"plus-one"},{"acceptance":0.5415419913511456,"acs":204874,"articleLive":2,"columnArticles":1879,"formTitle":"[67]Add Binary","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":378316,"title":"Add Binary","titleSlug":"add-binary"},{"acceptance":0.5232770669820449,"acs":38936,"articleLive":2,"columnArticles":596,"formTitle":"[68]Text Justification","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":74408,"title":"Text Justification","titleSlug":"text-justification"},{"acceptance":0.39106024842243586,"acs":411867,"articleLive":2,"columnArticles":2077,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1053206,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5314915341085924,"acs":618198,"articleLive":2,"columnArticles":3806,"formTitle":"[70]Climbing Stairs","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","submitted":1163138,"title":"Climbing Stairs","titleSlug":"climbing-stairs"},{"acceptance":0.42209294355529664,"acs":98530,"articleLive":2,"columnArticles":881,"formTitle":"[71]Simplify Path","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"","submitted":233432,"title":"Simplify Path","titleSlug":"simplify-path"},{"acceptance":0.6144092840093127,"acs":188161,"articleLive":2,"columnArticles":1311,"formTitle":"[72]Edit Distance","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","submitted":306247,"title":"Edit Distance","titleSlug":"edit-distance"},{"acceptance":0.60661022924693,"acs":142810,"articleLive":2,"columnArticles":1053,"formTitle":"[73]Set Matrix Zeroes","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","submitted":235423,"title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4641817048496863,"acs":181703,"articleLive":2,"columnArticles":1827,"formTitle":"[74]Search a 2D Matrix","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","submitted":391448,"title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5979431229131216,"acs":288495,"articleLive":2,"columnArticles":1986,"formTitle":"[75]Sort Colors","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":482479,"title":"Sort Colors","titleSlug":"sort-colors"},{"acceptance":0.42858485307340244,"acs":200675,"articleLive":2,"columnArticles":1370,"formTitle":"[76]Minimum Window Substring","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":468227,"title":"Minimum Window Substring","titleSlug":"minimum-window-substring"},{"acceptance":0.7698442267544564,"acs":239691,"articleLive":2,"columnArticles":1417,"formTitle":"[77]Combinations","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","submitted":311350,"title":"Combinations","titleSlug":"combinations"},{"acceptance":0.8017446165051236,"acs":332441,"articleLive":2,"columnArticles":2175,"formTitle":"[78]Subsets","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","submitted":414647,"title":"Subsets","titleSlug":"subsets"},{"acceptance":0.45924070407929646,"acs":238700,"articleLive":2,"columnArticles":1502,"formTitle":"[79]Word Search","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","submitted":519771,"title":"Word Search","titleSlug":"word-search"},{"acceptance":0.6172826152274503,"acs":154083,"articleLive":2,"columnArticles":1374,"formTitle":"[80]Remove Duplicates from Sorted Array II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"","submitted":249615,"title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41456056484454973,"acs":129995,"articleLive":2,"columnArticles":1035,"formTitle":"[81]Search in Rotated Sorted Array II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"","submitted":313573,"title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308990606991723,"acs":194205,"articleLive":2,"columnArticles":1767,"formTitle":"[82]Remove Duplicates from Sorted List II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"","submitted":365804,"title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5379160142984238,"acs":337382,"articleLive":2,"columnArticles":2075,"formTitle":"[83]Remove Duplicates from Sorted List","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"","submitted":627202,"title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4338746787281563,"acs":193289,"articleLive":2,"columnArticles":1238,"formTitle":"[84]Largest Rectangle in Histogram","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","submitted":445495,"title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5157738587444058,"acs":102917,"articleLive":2,"columnArticles":726,"formTitle":"[85]Maximal Rectangle","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","submitted":199539,"title":"Maximal Rectangle","titleSlug":"maximal-rectangle"},{"acceptance":0.6323380145131724,"acs":125220,"articleLive":2,"columnArticles":1159,"formTitle":"[86]Partition List","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"","submitted":198027,"title":"Partition List","titleSlug":"partition-list"},{"acceptance":0.4854191705027325,"acs":42813,"articleLive":2,"columnArticles":320,"formTitle":"[87]Scramble String","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"","submitted":88198,"title":"Scramble String","titleSlug":"scramble-string"},{"acceptance":0.5185986969679087,"acs":500915,"articleLive":2,"columnArticles":3507,"formTitle":"[88]Merge Sorted Array","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"","submitted":965901,"title":"Merge Sorted Array","titleSlug":"merge-sorted-array"},{"acceptance":0.7119421293377203,"acs":62102,"articleLive":2,"columnArticles":506,"formTitle":"[89]Gray Code","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","submitted":87229,"title":"Gray Code","titleSlug":"gray-code"},{"acceptance":0.6338439504596417,"acs":146932,"articleLive":2,"columnArticles":1296,"formTitle":"[90]Subsets II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","submitted":231811,"title":"Subsets II","titleSlug":"subsets-ii"},{"acceptance":0.31156501205969456,"acs":172321,"articleLive":2,"columnArticles":1593,"formTitle":"[91]Decode Ways","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"","submitted":553082,"title":"Decode Ways","titleSlug":"decode-ways"},{"acceptance":0.5495940311608515,"acs":225405,"articleLive":2,"columnArticles":2122,"formTitle":"[92]Reverse Linked List II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"","submitted":410130,"title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5438446809988194,"acs":164457,"articleLive":2,"columnArticles":1430,"formTitle":"[93]Restore IP Addresses","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","submitted":302397,"title":"Restore IP Addresses","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557629797512898,"acs":608232,"articleLive":2,"columnArticles":2493,"formTitle":"[94]Binary Tree Inorder Traversal","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"","submitted":804792,"title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7047544225250837,"acs":105852,"articleLive":2,"columnArticles":657,"formTitle":"[95]Unique Binary Search Trees II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":150197,"title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699400676732531,"acs":175281,"articleLive":2,"columnArticles":1387,"formTitle":"[96]Unique Binary Search Trees","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":250616,"title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4547854004025266,"acs":65304,"articleLive":2,"columnArticles":577,"formTitle":"[97]Interleaving String","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":143593,"title":"Interleaving String","titleSlug":"interleaving-string"},{"acceptance":0.3512786407538834,"acs":373699,"articleLive":2,"columnArticles":2077,"formTitle":"[98]Validate Binary Search Tree","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","submitted":1063825,"title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree"},{"acceptance":0.610102441237573,"acs":76649,"articleLive":2,"columnArticles":626,"formTitle":"[99]Recover Binary Search Tree","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":125633,"title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6003697583703543,"acs":265959,"articleLive":2,"columnArticles":1981,"formTitle":"[100]Same Tree","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":442992,"title":"Same Tree","titleSlug":"same-tree"},{"acceptance":0.5655325068595276,"acs":441492,"articleLive":2,"columnArticles":2406,"formTitle":"[101]Symmetric Tree","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":780666,"title":"Symmetric Tree","titleSlug":"symmetric-tree"},{"acceptance":0.6419572294406174,"acs":426535,"articleLive":2,"columnArticles":2691,"formTitle":"[102]Binary Tree Level Order Traversal","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","submitted":664429,"title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715963023085788,"acs":184509,"articleLive":2,"columnArticles":1671,"formTitle":"[103]Binary Tree Zigzag Level Order Traversal","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"","submitted":322796,"title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7664105847800493,"acs":548786,"articleLive":2,"columnArticles":2711,"formTitle":"[104]Maximum Depth of Binary Tree","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":716047,"title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7055040359030532,"acs":265357,"articleLive":2,"columnArticles":1532,"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":376124,"title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7212704269899842,"acs":142298,"articleLive":2,"columnArticles":948,"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":197288,"title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6997174447174447,"acs":170871,"articleLive":2,"columnArticles":1386,"formTitle":"[107]Binary Tree Level Order Traversal II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":244200,"title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7606646955350126,"acs":203242,"articleLive":2,"columnArticles":1259,"formTitle":"[108]Convert Sorted Array to Binary Search Tree","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","submitted":267190,"title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7624305108662784,"acs":98336,"articleLive":2,"columnArticles":764,"formTitle":"[109]Convert Sorted List to Binary Search Tree","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"","submitted":128977,"title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.564199420769549,"acs":272734,"articleLive":2,"columnArticles":1555,"formTitle":"[110]Balanced Binary Tree","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","submitted":483400,"title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree"},{"acceptance":0.4886146665723782,"acs":290199,"articleLive":2,"columnArticles":1910,"formTitle":"[111]Minimum Depth of Binary Tree","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":593922,"title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263527476275505,"acs":288585,"articleLive":2,"columnArticles":1803,"formTitle":"[112]Path Sum","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":548273,"title":"Path Sum","titleSlug":"path-sum"},{"acceptance":0.6274797099739081,"acs":191429,"articleLive":2,"columnArticles":1345,"formTitle":"[113]Path Sum II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":305076,"title":"Path Sum II","titleSlug":"path-sum-ii"},{"acceptance":0.7263435517162297,"acs":190026,"articleLive":2,"columnArticles":1428,"formTitle":"[114]Flatten Binary Tree to Linked List","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":261620,"title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5212609211605699,"acs":65449,"articleLive":2,"columnArticles":714,"formTitle":"[115]Distinct Subsequences","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":125559,"title":"Distinct Subsequences","titleSlug":"distinct-subsequences"},{"acceptance":0.7054292791094572,"acs":174016,"articleLive":2,"columnArticles":1324,"formTitle":"[116]Populating Next Right Pointers in Each Node","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","submitted":246681,"title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6179424986665989,"acs":97321,"articleLive":2,"columnArticles":826,"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":157492,"title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7344085275035973,"acs":232737,"articleLive":2,"columnArticles":1876,"formTitle":"[118]Pascal's Triangle","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","submitted":316904,"title":"Pascal's Triangle","titleSlug":"pascals-triangle"},{"acceptance":0.671146477279109,"acs":155359,"articleLive":2,"columnArticles":1285,"formTitle":"[119]Pascal's Triangle II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"","submitted":231483,"title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.682169340412026,"acs":189141,"articleLive":2,"columnArticles":1664,"formTitle":"[120]Triangle","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","submitted":277264,"title":"Triangle","titleSlug":"triangle"},{"acceptance":0.5733319348363997,"acs":601279,"articleLive":2,"columnArticles":3617,"formTitle":"[121]Best Time to Buy and Sell Stock","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"","submitted":1048745,"title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.69087708084529,"acs":492880,"articleLive":2,"columnArticles":2802,"formTitle":"[122]Best Time to Buy and Sell Stock II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"","submitted":713412,"title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5389951256092989,"acs":138000,"articleLive":2,"columnArticles":859,"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":256032,"title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4456609915789584,"acs":170304,"articleLive":2,"columnArticles":1156,"formTitle":"[124]Binary Tree Maximum Path Sum","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","submitted":382138,"title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47190486617378086,"acs":293102,"articleLive":2,"columnArticles":1927,"formTitle":"[125]Valid Palindrome","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":621104,"title":"Valid Palindrome","titleSlug":"valid-palindrome"},{"acceptance":0.39707013818360876,"acs":38706,"articleLive":2,"columnArticles":344,"formTitle":"[126]Word Ladder II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":97479,"title":"Word Ladder II","titleSlug":"word-ladder-ii"},{"acceptance":0.470001974275916,"acs":128554,"articleLive":2,"columnArticles":686,"formTitle":"[127]Word Ladder","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":273518,"title":"Word Ladder","titleSlug":"word-ladder"},{"acceptance":0.5437545554607986,"acs":184267,"articleLive":2,"columnArticles":1222,"formTitle":"[128]Longest Consecutive Sequence","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":338879,"title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6844974647645239,"acs":127437,"articleLive":2,"columnArticles":1173,"formTitle":"[129]Sum Root to Leaf Numbers","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":186176,"title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44723008491710475,"acs":137144,"articleLive":2,"columnArticles":1248,"formTitle":"[130]Surrounded Regions","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","submitted":306652,"title":"Surrounded Regions","titleSlug":"surrounded-regions"},{"acceptance":0.722967130227779,"acs":142131,"articleLive":2,"columnArticles":943,"formTitle":"[131]Palindrome Partitioning","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":196594,"title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923928344163983,"acs":51070,"articleLive":2,"columnArticles":455,"formTitle":"[132]Palindrome Partitioning II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":103718,"title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6776527188481954,"acs":76343,"articleLive":2,"columnArticles":539,"formTitle":"[133]Clone Graph","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","submitted":112658,"title":"Clone Graph","titleSlug":"clone-graph"},{"acceptance":0.5712504996754796,"acs":132902,"articleLive":2,"columnArticles":1014,"formTitle":"[134]Gas Station","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","submitted":232651,"title":"Gas Station","titleSlug":"gas-station"},{"acceptance":0.4858578732293709,"acs":106055,"articleLive":2,"columnArticles":847,"formTitle":"[135]Candy","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":218284,"title":"Candy","titleSlug":"candy"},{"acceptance":0.719242589205743,"acs":536414,"articleLive":2,"columnArticles":2423,"formTitle":"[136]Single Number","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","submitted":745804,"title":"Single Number","titleSlug":"single-number"},{"acceptance":0.7201404509793164,"acs":105008,"articleLive":2,"columnArticles":793,"formTitle":"[137]Single Number II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","submitted":145816,"title":"Single Number II","titleSlug":"single-number-ii"},{"acceptance":0.6618774480811508,"acs":118623,"articleLive":2,"columnArticles":890,"formTitle":"[138]Copy List with Random Pointer","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"","submitted":179222,"title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5177874400909136,"acs":209590,"articleLive":2,"columnArticles":1315,"formTitle":"[139]Word Break","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","submitted":404780,"title":"Word Break","titleSlug":"word-break"},{"acceptance":0.49707944962272527,"acs":55996,"articleLive":2,"columnArticles":581,"formTitle":"[140]Word Break II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":112650,"title":"Word Break II","titleSlug":"word-break-ii"},{"acceptance":0.5127131711437468,"acs":566929,"articleLive":2,"columnArticles":2917,"formTitle":"[141]Linked List Cycle","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"","submitted":1105743,"title":"Linked List Cycle","titleSlug":"linked-list-cycle"},{"acceptance":0.5533168391505091,"acs":319136,"articleLive":2,"columnArticles":1861,"formTitle":"[142]Linked List Cycle II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"","submitted":576769,"title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6235837353549276,"acs":135723,"articleLive":2,"columnArticles":1142,"formTitle":"[143]Reorder List","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"","submitted":217650,"title":"Reorder List","titleSlug":"reorder-list"},{"acceptance":0.7042520832673236,"acs":444538,"articleLive":2,"columnArticles":1982,"formTitle":"[144]Binary Tree Preorder Traversal","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"","submitted":631220,"title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.751799453383436,"acs":324312,"articleLive":2,"columnArticles":1679,"formTitle":"[145]Binary Tree Postorder Traversal","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"","submitted":431381,"title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5250817026046182,"acs":250161,"articleLive":2,"columnArticles":1461,"formTitle":"[146]LRU Cache","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":476423,"title":"LRU Cache","titleSlug":"lru-cache"},{"acceptance":0.6825793223101391,"acs":103864,"articleLive":2,"columnArticles":807,"formTitle":"[147]Insertion Sort List","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"","submitted":152164,"title":"Insertion Sort List","titleSlug":"insertion-sort-list"},{"acceptance":0.6666676638376925,"acs":222853,"articleLive":2,"columnArticles":1318,"formTitle":"[148]Sort List","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"","submitted":334279,"title":"Sort List","titleSlug":"sort-list"},{"acceptance":0.34621984668401434,"acs":49229,"articleLive":2,"columnArticles":531,"formTitle":"[149]Max Points on a Line","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","submitted":142190,"title":"Max Points on a Line","titleSlug":"max-points-on-a-line"},{"acceptance":0.5344707666462694,"acs":140623,"articleLive":2,"columnArticles":1106,"formTitle":"[150]Evaluate Reverse Polish Notation","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"","submitted":263107,"title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48699706385312813,"acs":181122,"articleLive":2,"columnArticles":1511,"formTitle":"[151]Reverse Words in a String","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":371916,"title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42192428514067437,"acs":196499,"articleLive":2,"columnArticles":1314,"formTitle":"[152]Maximum Product Subarray","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":465721,"title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray"},{"acceptance":0.5674116999890996,"acs":223832,"articleLive":2,"columnArticles":1564,"formTitle":"[153]Find Minimum in Rotated Sorted Array","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"","submitted":394479,"title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5315420718454553,"acs":118123,"articleLive":2,"columnArticles":931,"formTitle":"[154]Find Minimum in Rotated Sorted Array II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"","submitted":222227,"title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5741448177946048,"acs":303292,"articleLive":2,"columnArticles":1669,"formTitle":"[155]Min Stack","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"","submitted":528250,"title":"Min Stack","titleSlug":"min-stack"},{"acceptance":0.7241700279242942,"acs":7002,"articleLive":2,"columnArticles":127,"formTitle":"[156]Binary Tree Upside Down","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9669,"title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5362238792230507,"acs":5825,"articleLive":2,"columnArticles":84,"formTitle":"[157]Read N Characters Given Read4","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10863,"title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5927547770700637,"acs":2978,"articleLive":2,"columnArticles":70,"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":5024,"title":"Read N Characters Given Read4 II - Call multiple times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5482125603864735,"acs":17022,"articleLive":2,"columnArticles":204,"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":31050,"title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6164221278237048,"acs":357989,"articleLive":2,"columnArticles":2086,"formTitle":"[160]Intersection of Two Linked Lists","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"","submitted":580753,"title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33640008440599284,"acs":7971,"articleLive":2,"columnArticles":110,"formTitle":"[161]One Edit Distance","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":23695,"title":"One Edit Distance","titleSlug":"one-edit-distance"},{"acceptance":0.49642888224884685,"acs":171124,"articleLive":2,"columnArticles":1151,"formTitle":"[162]Find Peak Element","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","submitted":344710,"title":"Find Peak Element","titleSlug":"find-peak-element"},{"acceptance":0.32901319544706714,"acs":9799,"articleLive":2,"columnArticles":150,"formTitle":"[163]Missing Ranges","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":29783,"title":"Missing Ranges","titleSlug":"missing-ranges"},{"acceptance":0.609349833431707,"acs":60910,"articleLive":2,"columnArticles":506,"formTitle":"[164]Maximum Gap","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":99959,"title":"Maximum Gap","titleSlug":"maximum-gap"},{"acceptance":0.5198848163899092,"acs":89729,"articleLive":2,"columnArticles":951,"formTitle":"[165]Compare Version Numbers","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":172594,"title":"Compare Version Numbers","titleSlug":"compare-version-numbers"},{"acceptance":0.3309394006966498,"acs":43039,"articleLive":2,"columnArticles":387,"formTitle":"[166]Fraction to Recurring Decimal","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":130051,"title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867990217128871,"acs":318386,"articleLive":2,"columnArticles":2093,"formTitle":"[167]Two Sum II - Input Array Is Sorted","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"","submitted":542581,"title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43315026426905245,"acs":88017,"articleLive":2,"columnArticles":778,"formTitle":"[168]Excel Sheet Column Title","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","submitted":203202,"title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6649404067884441,"acs":410614,"articleLive":2,"columnArticles":2299,"formTitle":"[169]Majority Element","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":617520,"title":"Majority Element","titleSlug":"majority-element"},{"acceptance":0.42047890535917903,"acs":9219,"articleLive":2,"columnArticles":91,"formTitle":"[170]Two Sum III - Data structure design","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":21925,"title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7176179844881209,"acs":111215,"articleLive":2,"columnArticles":945,"formTitle":"[171]Excel Sheet Column Number","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","submitted":154978,"title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number"},{"acceptance":0.442569790393834,"acs":94170,"articleLive":2,"columnArticles":613,"formTitle":"[172]Factorial Trailing Zeroes","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":212780,"title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8048996671029713,"acs":78097,"articleLive":2,"columnArticles":658,"formTitle":"[173]Binary Search Tree Iterator","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"","submitted":97027,"title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4802153693171483,"acs":39600,"articleLive":2,"columnArticles":420,"formTitle":"[174]Dungeon Game","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":82463,"title":"Dungeon Game","titleSlug":"dungeon-game"},{"acceptance":0.7381548840828333,"acs":319703,"articleLive":2,"columnArticles":1530,"formTitle":"[175]Combine Two Tables","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":433111,"title":"Combine Two Tables","titleSlug":"combine-two-tables"},{"acceptance":0.35523564376738626,"acs":263317,"articleLive":2,"columnArticles":1062,"formTitle":"[176]Second Highest Salary","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":741246,"title":"Second Highest Salary","titleSlug":"second-highest-salary"},{"acceptance":0.46301011204683906,"acs":134754,"articleLive":2,"columnArticles":532,"formTitle":"[177]Nth Highest Salary","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":291039,"title":"Nth Highest Salary","titleSlug":"nth-highest-salary"},{"acceptance":0.6035159812967461,"acs":125716,"articleLive":2,"columnArticles":691,"formTitle":"[178]Rank Scores","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":208306,"title":"Rank Scores","titleSlug":"rank-scores"},{"acceptance":0.409532301207749,"acs":126310,"articleLive":2,"columnArticles":1007,"formTitle":"[179]Largest Number","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"","submitted":308425,"title":"Largest Number","titleSlug":"largest-number"},{"acceptance":0.48587388491946054,"acs":91939,"articleLive":2,"columnArticles":534,"formTitle":"[180]Consecutive Numbers","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":189224,"title":"Consecutive Numbers","titleSlug":"consecutive-numbers"},{"acceptance":0.6991670710011322,"acs":172918,"articleLive":2,"columnArticles":704,"formTitle":"[181]Employees Earning More Than Their Managers","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":247320,"title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7952412237570563,"acs":190038,"articleLive":2,"columnArticles":624,"formTitle":"[182]Duplicate Emails","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":238969,"title":"Duplicate Emails","titleSlug":"duplicate-emails"},{"acceptance":0.6750531447158359,"acs":158142,"articleLive":2,"columnArticles":578,"formTitle":"[183]Customers Who Never Order","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":234266,"title":"Customers Who Never Order","titleSlug":"customers-who-never-order"},{"acceptance":0.4795910198708484,"acs":107837,"articleLive":2,"columnArticles":706,"formTitle":"[184]Department Highest Salary","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":224852,"title":"Department Highest Salary","titleSlug":"department-highest-salary"},{"acceptance":0.4990089891689523,"acs":74775,"articleLive":2,"columnArticles":660,"formTitle":"[185]Department Top Three Salaries","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":149847,"title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries"},{"acceptance":0.7591206292049654,"acs":8011,"articleLive":2,"columnArticles":123,"formTitle":"[186]Reverse Words in a String II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10553,"title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5214290511046941,"acs":77646,"articleLive":2,"columnArticles":567,"formTitle":"[187]Repeated DNA Sequences","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":148910,"title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3950616250601603,"acs":94398,"articleLive":2,"columnArticles":734,"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":238945,"title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4479567597094793,"acs":373944,"articleLive":2,"columnArticles":1873,"formTitle":"[189]Rotate Array","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","submitted":834777,"title":"Rotate Array","titleSlug":"rotate-array"},{"acceptance":0.7003800707648357,"acs":138760,"articleLive":2,"columnArticles":867,"formTitle":"[190]Reverse Bits","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","submitted":198121,"title":"Reverse Bits","titleSlug":"reverse-bits"},{"acceptance":0.7499709373183583,"acs":199991,"articleLive":2,"columnArticles":1259,"formTitle":"[191]Number of 1 Bits","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","submitted":266665,"title":"Number of 1 Bits","titleSlug":"number-of-1-bits"},{"acceptance":0.3569543792719758,"acs":22456,"articleLive":2,"columnArticles":178,"formTitle":"[192]Word Frequency","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":62910,"title":"Word Frequency","titleSlug":"word-frequency"},{"acceptance":0.3260008958729313,"acs":26928,"articleLive":2,"columnArticles":144,"formTitle":"[193]Valid Phone Numbers","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":82601,"title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers"},{"acceptance":0.345977869357822,"acs":10662,"articleLive":2,"columnArticles":72,"formTitle":"[194]Transpose File","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30817,"title":"Transpose File","titleSlug":"transpose-file"},{"acceptance":0.43702414360650305,"acs":36908,"articleLive":2,"columnArticles":150,"formTitle":"[195]Tenth Line","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":84453,"title":"Tenth Line","titleSlug":"tenth-line"},{"acceptance":0.6650932807901432,"acs":106665,"articleLive":2,"columnArticles":420,"formTitle":"[196]Delete Duplicate Emails","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":160376,"title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5336477261130418,"acs":99354,"articleLive":2,"columnArticles":537,"formTitle":"[197]Rising Temperature","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":186179,"title":"Rising Temperature","titleSlug":"rising-temperature"},{"acceptance":0.518411378817388,"acs":416303,"articleLive":2,"columnArticles":2862,"formTitle":"[198]House Robber","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","submitted":803036,"title":"House Robber","titleSlug":"house-robber"},{"acceptance":0.6528294396354567,"acs":151288,"articleLive":2,"columnArticles":1674,"formTitle":"[199]Binary Tree Right Side View","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","submitted":231742,"title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5610166828294307,"acs":353468,"articleLive":2,"columnArticles":2229,"formTitle":"[200]Number of Islands","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","submitted":630049,"title":"Number of Islands","titleSlug":"number-of-islands"},{"acceptance":0.5258615431534004,"acs":51729,"articleLive":2,"columnArticles":338,"formTitle":"[201]Bitwise AND of Numbers Range","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","submitted":98370,"title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6201209474559624,"acs":181195,"articleLive":2,"columnArticles":1475,"formTitle":"[202]Happy Number","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"","submitted":292193,"title":"Happy Number","titleSlug":"happy-number"},{"acceptance":0.5192897977583345,"acs":253429,"articleLive":2,"columnArticles":1772,"formTitle":"[203]Remove Linked List Elements","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"","submitted":488030,"title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37732693755920516,"acs":174865,"articleLive":2,"columnArticles":752,"formTitle":"[204]Count Primes","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":463431,"title":"Count Primes","titleSlug":"count-primes"},{"acceptance":0.49954255881686405,"acs":119032,"articleLive":2,"columnArticles":914,"formTitle":"[205]Isomorphic Strings","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","submitted":238282,"title":"Isomorphic Strings","titleSlug":"isomorphic-strings"},{"acceptance":0.7235762668096856,"acs":764967,"articleLive":2,"columnArticles":7603,"formTitle":"[206]Reverse Linked List","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"","submitted":1057203,"title":"Reverse Linked List","titleSlug":"reverse-linked-list"},{"acceptance":0.5418774411353002,"acs":151361,"articleLive":2,"columnArticles":991,"formTitle":"[207]Course Schedule","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":279327,"title":"Course Schedule","titleSlug":"course-schedule"},{"acceptance":0.7170362785935355,"acs":154066,"articleLive":2,"columnArticles":1041,"formTitle":"[208]Implement Trie (Prefix Tree)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"","submitted":214865,"title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4750545674391312,"acs":213728,"articleLive":2,"columnArticles":1486,"formTitle":"[209]Minimum Size Subarray Sum","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"","submitted":449902,"title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5448259731072685,"acs":95502,"articleLive":2,"columnArticles":719,"formTitle":"[210]Course Schedule II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":175289,"title":"Course Schedule II","titleSlug":"course-schedule-ii"},{"acceptance":0.5110675031265569,"acs":50264,"articleLive":2,"columnArticles":546,"formTitle":"[211]Design Add and Search Words Data Structure","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":98351,"title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46491278402570574,"acs":64820,"articleLive":2,"columnArticles":586,"formTitle":"[212]Word Search II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":139424,"title":"Word Search II","titleSlug":"word-search-ii"},{"acceptance":0.43387822196940845,"acs":180010,"articleLive":2,"columnArticles":1644,"formTitle":"[213]House Robber II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"","submitted":414886,"title":"House Robber II","titleSlug":"house-robber-ii"},{"acceptance":0.37304122398907485,"acs":32233,"articleLive":2,"columnArticles":324,"formTitle":"[214]Shortest Palindrome","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":86406,"title":"Shortest Palindrome","titleSlug":"shortest-palindrome"},{"acceptance":0.6464007072178634,"acs":469433,"articleLive":2,"columnArticles":2432,"formTitle":"[215]Kth Largest Element in an Array","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","submitted":726226,"title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7363509739747364,"acs":107318,"articleLive":2,"columnArticles":1096,"formTitle":"[216]Combination Sum III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":145743,"title":"Combination Sum III","titleSlug":"combination-sum-iii"},{"acceptance":0.5556439882536982,"acs":404920,"articleLive":2,"columnArticles":1901,"formTitle":"[217]Contains Duplicate","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","submitted":728740,"title":"Contains Duplicate","titleSlug":"contains-duplicate"},{"acceptance":0.5421397198972404,"acs":32710,"articleLive":2,"columnArticles":289,"formTitle":"[218]The Skyline Problem","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","submitted":60335,"title":"The Skyline Problem","titleSlug":"the-skyline-problem"},{"acceptance":0.4230044179424184,"acs":116907,"articleLive":2,"columnArticles":958,"formTitle":"[219]Contains Duplicate II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":276373,"title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2868574761345215,"acs":66890,"articleLive":2,"columnArticles":439,"formTitle":"[220]Contains Duplicate III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"","submitted":233182,"title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47956367844037145,"acs":147544,"articleLive":2,"columnArticles":1051,"formTitle":"[221]Maximal Square","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":307663,"title":"Maximal Square","titleSlug":"maximal-square"},{"acceptance":0.7832638386057776,"acs":125482,"articleLive":2,"columnArticles":930,"formTitle":"[222]Count Complete Tree Nodes","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":160204,"title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5244185325311667,"acs":42276,"articleLive":2,"columnArticles":525,"formTitle":"[223]Rectangle Area","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":80615,"title":"Rectangle Area","titleSlug":"rectangle-area"},{"acceptance":0.41770186335403725,"acs":74244,"articleLive":2,"columnArticles":676,"formTitle":"[224]Basic Calculator","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","submitted":177744,"title":"Basic Calculator","titleSlug":"basic-calculator"},{"acceptance":0.6743652199931741,"acs":144242,"articleLive":2,"columnArticles":4808,"formTitle":"[225]Implement Stack using Queues","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"","submitted":213893,"title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7882941307626101,"acs":328803,"articleLive":2,"columnArticles":1980,"formTitle":"[226]Invert Binary Tree","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","submitted":417107,"title":"Invert Binary Tree","titleSlug":"invert-binary-tree"},{"acceptance":0.4379035485753138,"acs":90812,"articleLive":2,"columnArticles":724,"formTitle":"[227]Basic Calculator II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","submitted":207379,"title":"Basic Calculator II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5776747876231205,"acs":59705,"articleLive":2,"columnArticles":684,"formTitle":"[228]Summary Ranges","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":103354,"title":"Summary Ranges","titleSlug":"summary-ranges"},{"acceptance":0.5340013986336425,"acs":69488,"articleLive":2,"columnArticles":650,"formTitle":"[229]Majority Element II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":130127,"title":"Majority Element II","titleSlug":"majority-element-ii"},{"acceptance":0.7522667696064349,"acs":167593,"articleLive":2,"columnArticles":1143,"formTitle":"[230]Kth Smallest Element in a BST","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"","submitted":222784,"title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5046569418900136,"acs":179726,"articleLive":2,"columnArticles":1298,"formTitle":"[231]Power of Two","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","submitted":356135,"title":"Power of Two","titleSlug":"power-of-two"},{"acceptance":0.6897854008133028,"acs":171322,"articleLive":2,"columnArticles":1345,"formTitle":"[232]Implement Queue using Stacks","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"","submitted":248370,"title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47684862459113087,"acs":35571,"articleLive":2,"columnArticles":430,"formTitle":"[233]Number of Digit One","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","submitted":74596,"title":"Number of Digit One","titleSlug":"number-of-digit-one"},{"acceptance":0.4997081047072275,"acs":330405,"articleLive":2,"columnArticles":2087,"formTitle":"[234]Palindrome Linked List","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"","submitted":661196,"title":"Palindrome Linked List","titleSlug":"palindrome-linked-list"},{"acceptance":0.6668801861300702,"acs":181150,"articleLive":2,"columnArticles":1047,"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":271638,"title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6817109530737822,"acs":275975,"articleLive":2,"columnArticles":1486,"formTitle":"[236]Lowest Common Ancestor of a Binary Tree","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":404827,"title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8565261301973673,"acs":250187,"articleLive":2,"columnArticles":1315,"formTitle":"[237]Delete Node in a Linked List","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"","submitted":292095,"title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7239878273372793,"acs":147026,"articleLive":2,"columnArticles":922,"formTitle":"[238]Product of Array Except Self","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":203078,"title":"Product of Array Except Self","titleSlug":"product-of-array-except-self"},{"acceptance":0.49659565700705305,"acs":207283,"articleLive":2,"columnArticles":1422,"formTitle":"[239]Sliding Window Maximum","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","submitted":417408,"title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum"},{"acceptance":0.49544438070037816,"acs":211582,"articleLive":2,"columnArticles":1079,"formTitle":"[240]Search a 2D Matrix II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":427055,"title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7351821047102084,"acs":33589,"articleLive":2,"columnArticles":302,"formTitle":"[241]Different Ways to Add Parentheses","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":45688,"title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6464108941571158,"acs":312912,"articleLive":2,"columnArticles":1808,"formTitle":"[242]Valid Anagram","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","submitted":484076,"title":"Valid Anagram","titleSlug":"valid-anagram"},{"acceptance":0.656260985727343,"acs":9334,"articleLive":2,"columnArticles":112,"formTitle":"[243]Shortest Word Distance","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":14223,"title":"Shortest Word Distance","titleSlug":"shortest-word-distance"},{"acceptance":0.5553497942386831,"acs":5398,"articleLive":2,"columnArticles":62,"formTitle":"[244]Shortest Word Distance II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9720,"title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5986850756081525,"acs":4553,"articleLive":2,"columnArticles":62,"formTitle":"[245]Shortest Word Distance III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7605,"title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47603112840466927,"acs":6117,"articleLive":2,"columnArticles":109,"formTitle":"[246]Strobogrammatic Number","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12850,"title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"},{"acceptance":0.5257959340237821,"acs":5483,"articleLive":2,"columnArticles":95,"formTitle":"[247]Strobogrammatic Number II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":10428,"title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4666328771751985,"acs":2762,"articleLive":2,"columnArticles":53,"formTitle":"[248]Strobogrammatic Number III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5919,"title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.640321914981428,"acs":6206,"articleLive":2,"columnArticles":110,"formTitle":"[249]Group Shifted Strings","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9692,"title":"Group Shifted Strings","titleSlug":"group-shifted-strings"},{"acceptance":0.6363513330626607,"acs":4702,"articleLive":2,"columnArticles":82,"formTitle":"[250]Count Univalue Subtrees","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7389,"title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5472013366750209,"acs":3930,"articleLive":2,"columnArticles":72,"formTitle":"[251]Flatten 2D Vector","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":7182,"title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector"},{"acceptance":0.5641465452786207,"acs":12827,"articleLive":2,"columnArticles":166,"formTitle":"[252]Meeting Rooms","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":22737,"title":"Meeting Rooms","titleSlug":"meeting-rooms"},{"acceptance":0.5038691651672738,"acs":34445,"articleLive":2,"columnArticles":367,"formTitle":"[253]Meeting Rooms II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":68361,"title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5689158609339642,"acs":5531,"articleLive":2,"columnArticles":80,"formTitle":"[254]Factor Combinations","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9722,"title":"Factor Combinations","titleSlug":"factor-combinations"},{"acceptance":0.4766533587918764,"acs":5492,"articleLive":2,"columnArticles":65,"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":11522,"title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6449034668881046,"acs":12426,"articleLive":2,"columnArticles":193,"formTitle":"[256]Paint House","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":19268,"title":"Paint House","titleSlug":"paint-house"},{"acceptance":0.6849044315190549,"acs":151431,"articleLive":2,"columnArticles":1117,"formTitle":"[257]Binary Tree Paths","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","submitted":221098,"title":"Binary Tree Paths","titleSlug":"binary-tree-paths"},{"acceptance":0.6917183633343503,"acs":81620,"articleLive":2,"columnArticles":686,"formTitle":"[258]Add Digits","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":117996,"title":"Add Digits","titleSlug":"add-digits"},{"acceptance":0.5636159880463205,"acs":7544,"articleLive":2,"columnArticles":88,"formTitle":"[259]3Sum Smaller","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":13385,"title":"3Sum Smaller","titleSlug":"3sum-smaller"},{"acceptance":0.741766659371402,"acs":77953,"articleLive":2,"columnArticles":688,"formTitle":"[260]Single Number III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","submitted":105091,"title":"Single Number III","titleSlug":"single-number-iii"},{"acceptance":0.4964650859256037,"acs":9129,"articleLive":2,"columnArticles":125,"formTitle":"[261]Graph Valid Tree","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":18388,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"},{"acceptance":0.43234475869254646,"acs":40250,"articleLive":2,"columnArticles":386,"formTitle":"[262]Trips and Users","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":93097,"title":"Trips and Users","titleSlug":"trips-and-users"},{"acceptance":0.5145059650697483,"acs":110059,"articleLive":2,"columnArticles":865,"formTitle":"[263]Ugly Number","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"","submitted":213912,"title":"Ugly Number","titleSlug":"ugly-number"},{"acceptance":0.5802517855654059,"acs":104396,"articleLive":2,"columnArticles":644,"formTitle":"[264]Ugly Number II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":179915,"title":"Ugly Number II","titleSlug":"ugly-number-ii"},{"acceptance":0.5960280939694841,"acs":7383,"articleLive":2,"columnArticles":166,"formTitle":"[265]Paint House II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":12387,"title":"Paint House II","titleSlug":"paint-house-ii"},{"acceptance":0.6773422562141491,"acs":7085,"articleLive":2,"columnArticles":106,"formTitle":"[266]Palindrome Permutation","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10460,"title":"Palindrome Permutation","titleSlug":"palindrome-permutation"},{"acceptance":0.4485514485514486,"acs":3592,"articleLive":2,"columnArticles":78,"formTitle":"[267]Palindrome Permutation II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":8008,"title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6503026250016888,"acs":192539,"articleLive":2,"columnArticles":1502,"formTitle":"[268]Missing Number","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","submitted":296076,"title":"Missing Number","titleSlug":"missing-number"},{"acceptance":0.3415069989079718,"acs":6880,"articleLive":2,"columnArticles":112,"formTitle":"[269]Alien Dictionary","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":20146,"title":"Alien Dictionary","titleSlug":"alien-dictionary"},{"acceptance":0.5571985266641755,"acs":10438,"articleLive":2,"columnArticles":144,"formTitle":"[270]Closest Binary Search Tree Value","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":18733,"title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.558695652173913,"acs":2827,"articleLive":2,"columnArticles":47,"formTitle":"[271]Encode and Decode Strings","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":5060,"title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6462488967343336,"acs":3661,"articleLive":2,"columnArticles":79,"formTitle":"[272]Closest Binary Search Tree Value II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5665,"title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3672309979089512,"acs":29153,"articleLive":2,"columnArticles":355,"formTitle":"[273]Integer to English Words","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":79386,"title":"Integer to English Words","titleSlug":"integer-to-english-words"},{"acceptance":0.4399388763758785,"acs":55277,"articleLive":2,"columnArticles":578,"formTitle":"[274]H-Index","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","submitted":125647,"title":"H-Index","titleSlug":"h-index"},{"acceptance":0.46153709620163297,"acs":52006,"articleLive":2,"columnArticles":426,"formTitle":"[275]H-Index II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","submitted":112680,"title":"H-Index II","titleSlug":"h-index-ii"},{"acceptance":0.4966339033257035,"acs":7377,"articleLive":2,"columnArticles":135,"formTitle":"[276]Paint Fence","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14854,"title":"Paint Fence","titleSlug":"paint-fence"},{"acceptance":0.5715933669790916,"acs":7928,"articleLive":2,"columnArticles":89,"formTitle":"[277]Find the Celebrity","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13870,"title":"Find the Celebrity","titleSlug":"find-the-celebrity"},{"acceptance":0.45298540678035343,"acs":210674,"articleLive":2,"columnArticles":1201,"formTitle":"[278]First Bad Version","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","submitted":465079,"title":"First Bad Version","titleSlug":"first-bad-version"},{"acceptance":0.6342324196773212,"acs":214753,"articleLive":2,"columnArticles":1270,"formTitle":"[279]Perfect Squares","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","submitted":338603,"title":"Perfect Squares","titleSlug":"perfect-squares"},{"acceptance":0.6843267108167771,"acs":5890,"articleLive":2,"columnArticles":74,"formTitle":"[280]Wiggle Sort","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8607,"title":"Wiggle Sort","titleSlug":"wiggle-sort"},{"acceptance":0.7608456891817683,"acs":2771,"articleLive":2,"columnArticles":69,"formTitle":"[281]Zigzag Iterator","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3642,"title":"Zigzag Iterator","titleSlug":"zigzag-iterator"},{"acceptance":0.4849518703545754,"acs":19900,"articleLive":2,"columnArticles":168,"formTitle":"[282]Expression Add Operators","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":41035,"title":"Expression Add Operators","titleSlug":"expression-add-operators"},{"acceptance":0.6402375980940872,"acs":539356,"articleLive":2,"columnArticles":3575,"formTitle":"[283]Move Zeroes","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","submitted":842431,"title":"Move Zeroes","titleSlug":"move-zeroes"},{"acceptance":0.7705002111868702,"acs":25539,"articleLive":2,"columnArticles":216,"formTitle":"[284]Peeking Iterator","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":33146,"title":"Peeking Iterator","titleSlug":"peeking-iterator"},{"acceptance":0.6346182578813686,"acs":8495,"articleLive":2,"columnArticles":111,"formTitle":"[285]Inorder Successor in BST","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":13386,"title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5129194630872483,"acs":12228,"articleLive":2,"columnArticles":161,"formTitle":"[286]Walls and Gates","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":23840,"title":"Walls and Gates","titleSlug":"walls-and-gates"},{"acceptance":0.6566983306558637,"acs":188039,"articleLive":2,"columnArticles":1283,"formTitle":"[287]Find the Duplicate Number","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":286340,"title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43974132863021753,"acs":3740,"articleLive":2,"columnArticles":59,"formTitle":"[288]Unique Word Abbreviation","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8505,"title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation"},{"acceptance":0.753681651148012,"acs":54556,"articleLive":2,"columnArticles":842,"formTitle":"[289]Game of Life","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":72386,"title":"Game of Life","titleSlug":"game-of-life"},{"acceptance":0.45541990771259067,"acs":86359,"articleLive":2,"columnArticles":1151,"formTitle":"[290]Word Pattern","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":189625,"title":"Word Pattern","titleSlug":"word-pattern"},{"acceptance":0.5267538644470868,"acs":2658,"articleLive":2,"columnArticles":57,"formTitle":"[291]Word Pattern II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":5046,"title":"Word Pattern II","titleSlug":"word-pattern-ii"},{"acceptance":0.7081161130308101,"acs":117628,"articleLive":2,"columnArticles":788,"formTitle":"[292]Nim Game","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":166114,"title":"Nim Game","titleSlug":"nim-game"},{"acceptance":0.7130156966245312,"acs":5133,"articleLive":2,"columnArticles":85,"formTitle":"[293]Flip Game","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":7199,"title":"Flip Game","titleSlug":"flip-game"},{"acceptance":0.5805123513266239,"acs":3807,"articleLive":2,"columnArticles":56,"formTitle":"[294]Flip Game II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6558,"title":"Flip Game II","titleSlug":"flip-game-ii"},{"acceptance":0.5220532586391192,"acs":66910,"articleLive":2,"columnArticles":521,"formTitle":"[295]Find Median from Data Stream","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","submitted":128167,"title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6208462825723166,"acs":2597,"articleLive":2,"columnArticles":47,"formTitle":"[296]Best Meeting Point","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4183,"title":"Best Meeting Point","titleSlug":"best-meeting-point"},{"acceptance":0.562044124945483,"acs":112116,"articleLive":2,"columnArticles":800,"formTitle":"[297]Serialize and Deserialize Binary Tree","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","submitted":199479,"title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5800198259720234,"acs":5266,"articleLive":2,"columnArticles":83,"formTitle":"[298]Binary Tree Longest Consecutive Sequence","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":9079,"title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5640128448454211,"acs":62703,"articleLive":2,"columnArticles":717,"formTitle":"[299]Bulls and Cows","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":111173,"title":"Bulls and Cows","titleSlug":"bulls-and-cows"},{"acceptance":0.5192875247856866,"acs":383929,"articleLive":2,"columnArticles":2118,"formTitle":"[300]Longest Increasing Subsequence","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","submitted":739338,"title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5469101903557214,"acs":53181,"articleLive":2,"columnArticles":383,"formTitle":"[301]Remove Invalid Parentheses","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":97239,"title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.65739608801956,"acs":2151,"articleLive":2,"columnArticles":40,"formTitle":"[302]Smallest Rectangle Enclosing Black Pixels","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3272,"title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7285054739228777,"acs":133020,"articleLive":2,"columnArticles":819,"formTitle":"[303]Range Sum Query - Immutable","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":182593,"title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5522073990285448,"acs":66393,"articleLive":2,"columnArticles":594,"formTitle":"[304]Range Sum Query 2D - Immutable","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":120232,"title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3904442581726739,"acs":4658,"articleLive":2,"columnArticles":69,"formTitle":"[305]Number of Islands II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11930,"title":"Number of Islands II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33760585946440835,"acs":17700,"articleLive":2,"columnArticles":269,"formTitle":"[306]Additive Number","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":52428,"title":"Additive Number","titleSlug":"additive-number"},{"acceptance":0.5347217772081598,"acs":25033,"articleLive":2,"columnArticles":245,"formTitle":"[307]Range Sum Query - Mutable","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"","submitted":46815,"title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6173641798804264,"acs":2375,"articleLive":2,"columnArticles":46,"formTitle":"[308]Range Sum Query 2D - Mutable","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3847,"title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6142251530852567,"acs":126488,"articleLive":2,"columnArticles":999,"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":205931,"title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.38084511673791516,"acs":23163,"articleLive":2,"columnArticles":223,"formTitle":"[310]Minimum Height Trees","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":60820,"title":"Minimum Height Trees","titleSlug":"minimum-height-trees"},{"acceptance":0.7625150180216259,"acs":3808,"articleLive":2,"columnArticles":45,"formTitle":"[311]Sparse Matrix Multiplication","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4994,"title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6840028861372311,"acs":58775,"articleLive":2,"columnArticles":396,"formTitle":"[312]Burst Balloons","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":85928,"title":"Burst Balloons","titleSlug":"burst-balloons"},{"acceptance":0.6217951563031675,"acs":42029,"articleLive":2,"columnArticles":364,"formTitle":"[313]Super Ugly Number","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","submitted":67593,"title":"Super Ugly Number","titleSlug":"super-ugly-number"},{"acceptance":0.547945205479452,"acs":5080,"articleLive":2,"columnArticles":92,"formTitle":"[314]Binary Tree Vertical Order Traversal","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":9271,"title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4174595508331321,"acs":51861,"articleLive":2,"columnArticles":487,"formTitle":"[315]Count of Smaller Numbers After Self","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","submitted":124230,"title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.476429199648197,"acs":70421,"articleLive":2,"columnArticles":562,"formTitle":"[316]Remove Duplicate Letters","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"","submitted":147810,"title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48282619907168645,"acs":4681,"articleLive":2,"columnArticles":67,"formTitle":"[317]Shortest Distance from All Buildings","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":9695,"title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7366488348898359,"acs":48747,"articleLive":2,"columnArticles":477,"formTitle":"[318]Maximum Product of Word Lengths","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":66174,"title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5698943998470948,"acs":47707,"articleLive":2,"columnArticles":439,"formTitle":"[319]Bulb Switcher","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","submitted":83712,"title":"Bulb Switcher","titleSlug":"bulb-switcher"},{"acceptance":0.6809668989547039,"acs":3127,"articleLive":2,"columnArticles":54,"formTitle":"[320]Generalized Abbreviation","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4592,"title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"},{"acceptance":0.4238729094914518,"acs":27322,"articleLive":2,"columnArticles":237,"formTitle":"[321]Create Maximum Number","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":64458,"title":"Create Maximum Number","titleSlug":"create-maximum-number"},{"acceptance":0.4466377348083733,"acs":325527,"articleLive":2,"columnArticles":1912,"formTitle":"[322]Coin Change","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","submitted":728839,"title":"Coin Change","titleSlug":"coin-change"},{"acceptance":0.6329264985082723,"acs":11668,"articleLive":2,"columnArticles":158,"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":18435,"title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784644700729512,"acs":26614,"articleLive":2,"columnArticles":179,"formTitle":"[324]Wiggle Sort II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":70321,"title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5374686853283956,"acs":9869,"articleLive":2,"columnArticles":117,"formTitle":"[325]Maximum Size Subarray Sum Equals k","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":18362,"title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045743091859597,"acs":140530,"articleLive":2,"columnArticles":608,"formTitle":"[326]Power of Three","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":278512,"title":"Power of Three","titleSlug":"power-of-three"},{"acceptance":0.4194541961979201,"acs":25330,"articleLive":2,"columnArticles":210,"formTitle":"[327]Count of Range Sum","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":60388,"title":"Count of Range Sum","titleSlug":"count-of-range-sum"},{"acceptance":0.6550058426351018,"acs":133969,"articleLive":2,"columnArticles":1105,"formTitle":"[328]Odd Even Linked List","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"","submitted":204531,"title":"Odd Even Linked List","titleSlug":"odd-even-linked-list"},{"acceptance":0.4885738625555179,"acs":59072,"articleLive":2,"columnArticles":518,"formTitle":"[329]Longest Increasing Path in a Matrix","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":120907,"title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5324923759356807,"acs":19207,"articleLive":2,"columnArticles":152,"formTitle":"[330]Patching Array","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36070,"title":"Patching Array","titleSlug":"patching-array"},{"acceptance":0.47912647178449635,"acs":45942,"articleLive":2,"columnArticles":516,"formTitle":"[331]Verify Preorder Serialization of a Binary Tree","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"","submitted":95887,"title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44856086811280294,"acs":41626,"articleLive":2,"columnArticles":341,"formTitle":"[332]Reconstruct Itinerary","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":92799,"title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4694840109423639,"acs":4977,"articleLive":2,"columnArticles":83,"formTitle":"[333]Largest BST Subtree","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10601,"title":"Largest BST Subtree","titleSlug":"largest-bst-subtree"},{"acceptance":0.41130310055539804,"acs":49321,"articleLive":2,"columnArticles":322,"formTitle":"[334]Increasing Triplet Subsequence","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":119914,"title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.4306502118253822,"acs":16366,"articleLive":2,"columnArticles":146,"formTitle":"[335]Self Crossing","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":38003,"title":"Self Crossing","titleSlug":"self-crossing"},{"acceptance":0.40143401060385014,"acs":22563,"articleLive":2,"columnArticles":195,"formTitle":"[336]Palindrome Pairs","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":56206,"title":"Palindrome Pairs","titleSlug":"palindrome-pairs"},{"acceptance":0.6072374149689932,"acs":137382,"articleLive":2,"columnArticles":973,"formTitle":"[337]House Robber III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":226241,"title":"House Robber III","titleSlug":"house-robber-iii"},{"acceptance":0.7868756332795437,"acs":167743,"articleLive":2,"columnArticles":1439,"formTitle":"[338]Counting Bits","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":213176,"title":"Counting Bits","titleSlug":"counting-bits"},{"acceptance":0.8136734693877551,"acs":3987,"articleLive":2,"columnArticles":63,"formTitle":"[339]Nested List Weight Sum","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4900,"title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4958859659288446,"acs":12837,"articleLive":2,"columnArticles":195,"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":25887,"title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270355698491352,"acs":52673,"articleLive":2,"columnArticles":500,"formTitle":"[341]Flatten Nested List Iterator","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"","submitted":72449,"title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5169770744806251,"acs":89908,"articleLive":2,"columnArticles":792,"formTitle":"[342]Power of Four","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","submitted":173911,"title":"Power of Four","titleSlug":"power-of-four"},{"acceptance":0.6081051025422195,"acs":117568,"articleLive":2,"columnArticles":1109,"formTitle":"[343]Integer Break","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","submitted":193335,"title":"Integer Break","titleSlug":"integer-break"},{"acceptance":0.7719345427757932,"acs":396102,"articleLive":2,"columnArticles":2109,"formTitle":"[344]Reverse String","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","submitted":513129,"title":"Reverse String","titleSlug":"reverse-string"},{"acceptance":0.53937581399836,"acs":111818,"articleLive":2,"columnArticles":1066,"formTitle":"[345]Reverse Vowels of a String","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"","submitted":207310,"title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7067234228334425,"acs":12950,"articleLive":2,"columnArticles":143,"formTitle":"[346]Moving Average from Data Stream","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":18324,"title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6230354210649777,"acs":215136,"articleLive":2,"columnArticles":1596,"formTitle":"[347]Top K Frequent Elements","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":345303,"title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6000685009704304,"acs":5256,"articleLive":2,"columnArticles":81,"formTitle":"[348]Design Tic-Tac-Toe","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8759,"title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7383107039926095,"acs":226970,"articleLive":2,"columnArticles":1598,"formTitle":"[349]Intersection of Two Arrays","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"","submitted":307418,"title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5512169303485853,"acs":268694,"articleLive":2,"columnArticles":1508,"formTitle":"[350]Intersection of Two Arrays II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"","submitted":487456,"title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5922602961841963,"acs":5479,"articleLive":2,"columnArticles":102,"formTitle":"[351]Android Unlock Patterns","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9251,"title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns"},{"acceptance":0.6790818120783912,"acs":21241,"articleLive":2,"columnArticles":349,"formTitle":"[352]Data Stream as Disjoint Intervals","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":31279,"title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4275388507408746,"acs":2366,"articleLive":2,"columnArticles":51,"formTitle":"[353]Design Snake Game","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5534,"title":"Design Snake Game","titleSlug":"design-snake-game"},{"acceptance":0.4560587223247812,"acs":72631,"articleLive":2,"columnArticles":563,"formTitle":"[354]Russian Doll Envelopes","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":159258,"title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40824134104316334,"acs":27958,"articleLive":2,"columnArticles":463,"formTitle":"[355]Design Twitter","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":68484,"title":"Design Twitter","titleSlug":"design-twitter"},{"acceptance":0.35279133941838253,"acs":1662,"articleLive":2,"columnArticles":43,"formTitle":"[356]Line Reflection","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4711,"title":"Line Reflection","titleSlug":"line-reflection"},{"acceptance":0.5206217109288949,"acs":25524,"articleLive":2,"columnArticles":403,"formTitle":"[357]Count Numbers with Unique Digits","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":49026,"title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3519523190952854,"acs":4606,"articleLive":2,"columnArticles":60,"formTitle":"[358]Rearrange String k Distance Apart","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":13087,"title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7284003421727973,"acs":5109,"articleLive":2,"columnArticles":60,"formTitle":"[359]Logger Rate Limiter","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":7014,"title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter"},{"acceptance":0.6045627376425855,"acs":3021,"articleLive":2,"columnArticles":64,"formTitle":"[360]Sort Transformed Array","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4997,"title":"Sort Transformed Array","titleSlug":"sort-transformed-array"},{"acceptance":0.5657059110893992,"acs":3474,"articleLive":2,"columnArticles":67,"formTitle":"[361]Bomb Enemy","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":6141,"title":"Bomb Enemy","titleSlug":"bomb-enemy"},{"acceptance":0.688867376573088,"acs":3558,"articleLive":2,"columnArticles":63,"formTitle":"[362]Design Hit Counter","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":5165,"title":"Design Hit Counter","titleSlug":"design-hit-counter"},{"acceptance":0.48871577166032065,"acs":33500,"articleLive":2,"columnArticles":219,"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":68547,"title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7273402674591382,"acs":1958,"articleLive":2,"columnArticles":48,"formTitle":"[364]Nested List Weight Sum II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2692,"title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3676191480388022,"acs":34865,"articleLive":2,"columnArticles":491,"formTitle":"[365]Water and Jug Problem","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":94840,"title":"Water and Jug Problem","titleSlug":"water-and-jug-problem"},{"acceptance":0.7667452036351396,"acs":4556,"articleLive":2,"columnArticles":121,"formTitle":"[366]Find Leaves of Binary Tree","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5942,"title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4476850876929094,"acs":119052,"articleLive":2,"columnArticles":958,"formTitle":"[367]Valid Perfect Square","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":265928,"title":"Valid Perfect Square","titleSlug":"valid-perfect-square"},{"acceptance":0.45869113019361035,"acs":43000,"articleLive":2,"columnArticles":458,"formTitle":"[368]Largest Divisible Subset","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"","submitted":93745,"title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset"},{"acceptance":0.6195224350564157,"acs":4722,"articleLive":2,"columnArticles":135,"formTitle":"[369]Plus One Linked List","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7622,"title":"Plus One Linked List","titleSlug":"plus-one-linked-list"},{"acceptance":0.731717422829915,"acs":3532,"articleLive":2,"columnArticles":57,"formTitle":"[370]Range Addition","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4827,"title":"Range Addition","titleSlug":"range-addition"},{"acceptance":0.6130957703657337,"acs":82275,"articleLive":2,"columnArticles":511,"formTitle":"[371]Sum of Two Integers","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"","submitted":134196,"title":"Sum of Two Integers","titleSlug":"sum-of-two-integers"},{"acceptance":0.5099887690160978,"acs":14985,"articleLive":2,"columnArticles":141,"formTitle":"[372]Super Pow","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":29383,"title":"Super Pow","titleSlug":"super-pow"},{"acceptance":0.4121327374726633,"acs":21672,"articleLive":2,"columnArticles":224,"formTitle":"[373]Find K Pairs with Smallest Sums","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","submitted":52585,"title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5167553820676603,"acs":87373,"articleLive":2,"columnArticles":594,"formTitle":"[374]Guess Number Higher or Lower","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","submitted":169080,"title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.5978878097967415,"acs":33798,"articleLive":2,"columnArticles":271,"formTitle":"[375]Guess Number Higher or Lower II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":56529,"title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46588846701197834,"acs":80861,"articleLive":2,"columnArticles":858,"formTitle":"[376]Wiggle Subsequence","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":173563,"title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"},{"acceptance":0.5109381541958251,"acs":68339,"articleLive":2,"columnArticles":580,"formTitle":"[377]Combination Sum IV","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"","submitted":133752,"title":"Combination Sum IV","titleSlug":"combination-sum-iv"},{"acceptance":0.6393564586626987,"acs":82500,"articleLive":2,"columnArticles":583,"formTitle":"[378]Kth Smallest Element in a Sorted Matrix","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","submitted":129036,"title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6342910101946246,"acs":3422,"articleLive":2,"columnArticles":73,"formTitle":"[379]Design Phone Directory","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":5395,"title":"Design Phone Directory","titleSlug":"design-phone-directory"},{"acceptance":0.5048031261024124,"acs":37205,"articleLive":2,"columnArticles":237,"formTitle":"[380]Insert Delete GetRandom O(1)","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","submitted":73702,"title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.43990492972175554,"acs":21470,"articleLive":2,"columnArticles":178,"formTitle":"[381]Insert Delete GetRandom O(1) - Duplicates allowed","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48806,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6344916344916345,"acs":16762,"articleLive":2,"columnArticles":131,"formTitle":"[382]Linked List Random Node","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":26418,"title":"Linked List Random Node","titleSlug":"linked-list-random-node"},{"acceptance":0.6083175919057197,"acs":79543,"articleLive":2,"columnArticles":871,"formTitle":"[383]Ransom Note","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","submitted":130759,"title":"Ransom Note","titleSlug":"ransom-note"},{"acceptance":0.5803215582078936,"acs":55477,"articleLive":2,"columnArticles":210,"formTitle":"[384]Shuffle an Array","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","submitted":95597,"title":"Shuffle an Array","titleSlug":"shuffle-an-array"},{"acceptance":0.4190628621888625,"acs":7593,"articleLive":2,"columnArticles":86,"formTitle":"[385]Mini Parser","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"","submitted":18119,"title":"Mini Parser","titleSlug":"mini-parser"},{"acceptance":0.7504865209762323,"acs":23524,"articleLive":2,"columnArticles":251,"formTitle":"[386]Lexicographical Numbers","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":31345,"title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"},{"acceptance":0.5370123480303464,"acs":236845,"articleLive":2,"columnArticles":1303,"formTitle":"[387]First Unique Character in a String","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","submitted":441042,"title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5329054273643159,"acs":6559,"articleLive":2,"columnArticles":120,"formTitle":"[388]Longest Absolute File Path","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":12308,"title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6902580687743384,"acs":104581,"articleLive":2,"columnArticles":1033,"formTitle":"[389]Find the Difference","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":151510,"title":"Find the Difference","titleSlug":"find-the-difference"},{"acceptance":0.46711486015094816,"acs":7365,"articleLive":2,"columnArticles":101,"formTitle":"[390]Elimination Game","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15767,"title":"Elimination Game","titleSlug":"elimination-game"},{"acceptance":0.47114133117903145,"acs":20995,"articleLive":2,"columnArticles":192,"formTitle":"[391]Perfect Rectangle","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":44562,"title":"Perfect Rectangle","titleSlug":"perfect-rectangle"},{"acceptance":0.5154973345120416,"acs":153944,"articleLive":2,"columnArticles":1672,"formTitle":"[392]Is Subsequence","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":298632,"title":"Is Subsequence","titleSlug":"is-subsequence"},{"acceptance":0.39160053135324774,"acs":11497,"articleLive":2,"columnArticles":132,"formTitle":"[393]UTF-8 Validation","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":29359,"title":"UTF-8 Validation","titleSlug":"utf-8-validation"},{"acceptance":0.5532144062151243,"acs":127891,"articleLive":2,"columnArticles":1361,"formTitle":"[394]Decode String","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"","submitted":231178,"title":"Decode String","titleSlug":"decode-string"},{"acceptance":0.5200197534689609,"acs":53704,"articleLive":2,"columnArticles":443,"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":103273,"title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4335520735681443,"acs":9712,"articleLive":2,"columnArticles":157,"formTitle":"[396]Rotate Function","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":22401,"title":"Rotate Function","titleSlug":"rotate-function"},{"acceptance":0.6604558453938816,"acs":15242,"articleLive":2,"columnArticles":128,"formTitle":"[398]Random Pick Index","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":23078,"title":"Random Pick Index","titleSlug":"random-pick-index"},{"acceptance":0.5913298865820318,"acs":43691,"articleLive":2,"columnArticles":546,"formTitle":"[399]Evaluate Division","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":73886,"title":"Evaluate Division","titleSlug":"evaluate-division"},{"acceptance":0.4187283907165483,"acs":20225,"articleLive":2,"columnArticles":209,"formTitle":"[400]Nth Digit","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","submitted":48301,"title":"Nth Digit","titleSlug":"nth-digit"},{"acceptance":0.6150194457135852,"acs":55190,"articleLive":2,"columnArticles":667,"formTitle":"[401]Binary Watch","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":89737,"title":"Binary Watch","titleSlug":"binary-watch"},{"acceptance":0.32694010376215477,"acs":84191,"articleLive":2,"columnArticles":608,"formTitle":"[402]Remove K Digits","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"","submitted":257512,"title":"Remove K Digits","titleSlug":"remove-k-digits"},{"acceptance":0.4554040384390927,"acs":46821,"articleLive":2,"columnArticles":469,"formTitle":"[403]Frog Jump","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"","submitted":102812,"title":"Frog Jump","titleSlug":"frog-jump"},{"acceptance":0.5867313792180991,"acs":107471,"articleLive":2,"columnArticles":1194,"formTitle":"[404]Sum of Left Leaves","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","submitted":183169,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5609312822949457,"acs":47222,"articleLive":2,"columnArticles":476,"formTitle":"[405]Convert a Number to Hexadecimal","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":84185,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7385511338568781,"acs":125550,"articleLive":2,"columnArticles":828,"formTitle":"[406]Queue Reconstruction by Height","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":169995,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.57878439559924,"acs":24673,"articleLive":2,"columnArticles":246,"formTitle":"[407]Trapping Rain Water II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":42629,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3285061632617878,"acs":3811,"articleLive":2,"columnArticles":83,"formTitle":"[408]Valid Word Abbreviation","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":11601,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5562232383422585,"acs":99505,"articleLive":2,"columnArticles":1381,"formTitle":"[409]Longest Palindrome","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":178894,"title":"Longest Palindrome","titleSlug":"longest-palindrome"},{"acceptance":0.5670110230986539,"acs":40945,"articleLive":2,"columnArticles":337,"formTitle":"[410]Split Array Largest Sum","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":72212,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"},{"acceptance":0.5005382131324004,"acs":930,"articleLive":2,"columnArticles":24,"formTitle":"[411]Minimum Unique Word Abbreviation","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1858,"title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7091772537240736,"acs":104832,"articleLive":2,"columnArticles":605,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":147822,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6889699955622776,"acs":76074,"articleLive":2,"columnArticles":985,"formTitle":"[413]Arithmetic Slices","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","submitted":110417,"title":"Arithmetic Slices","titleSlug":"arithmetic-slices"},{"acceptance":0.3933547000229238,"acs":90944,"articleLive":2,"columnArticles":1175,"formTitle":"[414]Third Maximum Number","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","submitted":231201,"title":"Third Maximum Number","titleSlug":"third-maximum-number"},{"acceptance":0.5396035532159895,"acs":157452,"articleLive":2,"columnArticles":1141,"formTitle":"[415]Add Strings","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":291792,"title":"Add Strings","titleSlug":"add-strings"},{"acceptance":0.5087276187655458,"acs":185506,"articleLive":2,"columnArticles":1060,"formTitle":"[416]Partition Equal Subset Sum","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","submitted":364647,"title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.48554808516248105,"acs":29465,"articleLive":2,"columnArticles":343,"formTitle":"[417]Pacific Atlantic Water Flow","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","submitted":60684,"title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36503896930173374,"acs":2295,"articleLive":2,"columnArticles":35,"formTitle":"[418]Sentence Screen Fitting","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6287,"title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7537600559636236,"acs":12930,"articleLive":2,"columnArticles":170,"formTitle":"[419]Battleships in a Board","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":17154,"title":"Battleships in a Board","titleSlug":"battleships-in-a-board"},{"acceptance":0.21003758567322572,"acs":2850,"articleLive":2,"columnArticles":53,"formTitle":"[420]Strong Password Checker","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13569,"title":"Strong Password Checker","titleSlug":"strong-password-checker"},{"acceptance":0.6219824433065106,"acs":34010,"articleLive":2,"columnArticles":313,"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":54680,"title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.427694825117611,"acs":2091,"articleLive":2,"columnArticles":51,"formTitle":"[422]Valid Word Square","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4889,"title":"Valid Word Square","titleSlug":"valid-word-square"},{"acceptance":0.5686513537790324,"acs":8863,"articleLive":2,"columnArticles":143,"formTitle":"[423]Reconstruct Original Digits from English","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":15586,"title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5318793957800512,"acs":53239,"articleLive":2,"columnArticles":465,"formTitle":"[424]Longest Repeating Character Replacement","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":100096,"title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6183649748159628,"acs":1596,"articleLive":2,"columnArticles":35,"formTitle":"[425]Word Squares","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2581,"title":"Word Squares","titleSlug":"word-squares"},{"acceptance":0.6730528200537154,"acs":7518,"articleLive":2,"columnArticles":121,"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":11170,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6157261529647665,"acs":4299,"articleLive":2,"columnArticles":70,"formTitle":"[427]Construct Quad Tree","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6982,"title":"Construct Quad Tree","titleSlug":"construct-quad-tree"},{"acceptance":0.6592661836877776,"acs":2821,"articleLive":2,"columnArticles":54,"formTitle":"[428]Serialize and Deserialize N-ary Tree","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4279,"title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.702226668315218,"acs":62475,"articleLive":2,"columnArticles":506,"formTitle":"[429]N-ary Tree Level Order Traversal","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"","submitted":88967,"title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5878800499791753,"acs":45168,"articleLive":2,"columnArticles":682,"formTitle":"[430]Flatten a Multilevel Doubly Linked List","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"","submitted":76832,"title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7236533957845434,"acs":927,"articleLive":2,"columnArticles":30,"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":1281,"title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.381155486622722,"acs":6881,"articleLive":2,"columnArticles":92,"formTitle":"[432]All O`one Data Structure","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18053,"title":"All O`one Data Structure","titleSlug":"all-oone-data-structure"},{"acceptance":0.5318757860114153,"acs":16494,"articleLive":2,"columnArticles":228,"formTitle":"[433]Minimum Genetic Mutation","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":31011,"title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.39913483663138516,"acs":65049,"articleLive":2,"columnArticles":895,"formTitle":"[434]Number of Segments in a String","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":162975,"title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5069055854502168,"acs":103905,"articleLive":2,"columnArticles":914,"formTitle":"[435]Non-overlapping Intervals","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":204979,"title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48960252698078444,"acs":9300,"articleLive":2,"columnArticles":156,"formTitle":"[436]Find Right Interval","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","submitted":18995,"title":"Find Right Interval","titleSlug":"find-right-interval"},{"acceptance":0.5741165225548938,"acs":129740,"articleLive":2,"columnArticles":1059,"formTitle":"[437]Path Sum III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":225982,"title":"Path Sum III","titleSlug":"path-sum-iii"},{"acceptance":0.5210973542151945,"acs":103578,"articleLive":2,"columnArticles":904,"formTitle":"[438]Find All Anagrams in a String","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"","submitted":198769,"title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5927556533920352,"acs":2962,"articleLive":2,"columnArticles":70,"formTitle":"[439]Ternary Expression Parser","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4997,"title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser"},{"acceptance":0.38124473602553305,"acs":17201,"articleLive":2,"columnArticles":126,"formTitle":"[440]K-th Smallest in Lexicographical Order","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":45118,"title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45883013451253674,"acs":79273,"articleLive":2,"columnArticles":757,"formTitle":"[441]Arranging Coins","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","submitted":172772,"title":"Arranging Coins","titleSlug":"arranging-coins"},{"acceptance":0.697697896749522,"acs":45612,"articleLive":2,"columnArticles":460,"formTitle":"[442]Find All Duplicates in an Array","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":65375,"title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47729334718991767,"acs":57868,"articleLive":2,"columnArticles":702,"formTitle":"[443]String Compression","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":121242,"title":"String Compression","titleSlug":"string-compression"},{"acceptance":0.25251955740362253,"acs":3583,"articleLive":2,"columnArticles":56,"formTitle":"[444]Sequence Reconstruction","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":14189,"title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"},{"acceptance":0.5895600534604627,"acs":85577,"articleLive":2,"columnArticles":959,"formTitle":"[445]Add Two Numbers II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"","submitted":145154,"title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5503344387611714,"acs":19582,"articleLive":2,"columnArticles":177,"formTitle":"[446]Arithmetic Slices II - Subsequence","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","submitted":35582,"title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6634162109743286,"acs":49256,"articleLive":2,"columnArticles":380,"formTitle":"[447]Number of Boomerangs","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":74246,"title":"Number of Boomerangs","titleSlug":"number-of-boomerangs"},{"acceptance":0.649684834006612,"acs":145226,"articleLive":2,"columnArticles":1145,"formTitle":"[448]Find All Numbers Disappeared in an Array","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":223533,"title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5603933068828705,"acs":16243,"articleLive":2,"columnArticles":145,"formTitle":"[449]Serialize and Deserialize BST","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":28985,"title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4887923849629337,"acs":66858,"articleLive":2,"columnArticles":669,"formTitle":"[450]Delete Node in a BST","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":136782,"title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7120633324956019,"acs":84999,"articleLive":2,"columnArticles":980,"formTitle":"[451]Sort Characters By Frequency","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"","submitted":119370,"title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5083606914009967,"acs":102819,"articleLive":2,"columnArticles":895,"formTitle":"[452]Minimum Number of Arrows to Burst Balloons","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","submitted":202256,"title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6113083412044426,"acs":56307,"articleLive":2,"columnArticles":677,"formTitle":"[453]Minimum Moves to Equal Array Elements","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":92109,"title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6057986088539297,"acs":83871,"articleLive":2,"columnArticles":522,"formTitle":"[454]4Sum II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":138447,"title":"4Sum II","titleSlug":"4sum-ii"},{"acceptance":0.576145591026501,"acs":161489,"articleLive":2,"columnArticles":1320,"formTitle":"[455]Assign Cookies","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":280292,"title":"Assign Cookies","titleSlug":"assign-cookies"},{"acceptance":0.36273730245502434,"acs":58392,"articleLive":2,"columnArticles":468,"formTitle":"[456]132 Pattern","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"","submitted":160976,"title":"132 Pattern","titleSlug":"132-pattern"},{"acceptance":0.43547596046667164,"acs":29301,"articleLive":2,"columnArticles":336,"formTitle":"[457]Circular Array Loop","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","submitted":67285,"title":"Circular Array Loop","titleSlug":"circular-array-loop"},{"acceptance":0.615531453362256,"acs":7094,"articleLive":2,"columnArticles":70,"formTitle":"[458]Poor Pigs","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11525,"title":"Poor Pigs","titleSlug":"poor-pigs"},{"acceptance":0.509952542952598,"acs":83493,"articleLive":2,"columnArticles":675,"formTitle":"[459]Repeated Substring Pattern","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":163727,"title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43617726491529585,"acs":35531,"articleLive":2,"columnArticles":415,"formTitle":"[460]LFU Cache","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":81460,"title":"LFU Cache","titleSlug":"lfu-cache"},{"acceptance":0.8129210467870891,"acs":175695,"articleLive":2,"columnArticles":1402,"formTitle":"[461]Hamming Distance","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","submitted":216128,"title":"Hamming Distance","titleSlug":"hamming-distance"},{"acceptance":0.6082210680084402,"acs":14989,"articleLive":2,"columnArticles":143,"formTitle":"[462]Minimum Moves to Equal Array Elements II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":24644,"title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7073113062972336,"acs":80770,"articleLive":2,"columnArticles":967,"formTitle":"[463]Island Perimeter","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":114193,"title":"Island Perimeter","titleSlug":"island-perimeter"},{"acceptance":0.3553248797022062,"acs":11741,"articleLive":2,"columnArticles":114,"formTitle":"[464]Can I Win","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":33043,"title":"Can I Win","titleSlug":"can-i-win"},{"acceptance":0.5311800447713464,"acs":1661,"articleLive":2,"columnArticles":26,"formTitle":"[465]Optimal Account Balancing","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3127,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing"},{"acceptance":0.37333418148277725,"acs":11738,"articleLive":2,"columnArticles":181,"formTitle":"[466]Count The Repetitions","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31441,"title":"Count The Repetitions","titleSlug":"count-the-repetitions"},{"acceptance":0.44257852199583797,"acs":9145,"articleLive":2,"columnArticles":118,"formTitle":"[467]Unique Substrings in Wraparound String","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":20663,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2523971157902811,"acs":26323,"articleLive":2,"columnArticles":309,"formTitle":"[468]Validate IP Address","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":104292,"title":"Validate IP Address","titleSlug":"validate-ip-address"},{"acceptance":0.4340953993790573,"acs":1538,"articleLive":2,"columnArticles":21,"formTitle":"[469]Convex Polygon","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3543,"title":"Convex Polygon","titleSlug":"convex-polygon"},{"acceptance":0.5472072606282222,"acs":66443,"articleLive":2,"columnArticles":343,"formTitle":"[470]Implement Rand10() Using Rand7()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":121422,"title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6100337268128162,"acs":1447,"articleLive":2,"columnArticles":25,"formTitle":"[471]Encode String with Shortest Length","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2372,"title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3935309973045822,"acs":6862,"articleLive":2,"columnArticles":84,"formTitle":"[472]Concatenated Words","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":17437,"title":"Concatenated Words","titleSlug":"concatenated-words"},{"acceptance":0.4210685980812256,"acs":22208,"articleLive":2,"columnArticles":189,"formTitle":"[473]Matchsticks to Square","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":52742,"title":"Matchsticks to Square","titleSlug":"matchsticks-to-square"},{"acceptance":0.6136126713447745,"acs":78875,"articleLive":2,"columnArticles":635,"formTitle":"[474]Ones and Zeroes","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","submitted":128542,"title":"Ones and Zeroes","titleSlug":"ones-and-zeroes"},{"acceptance":0.337101230846521,"acs":22814,"articleLive":2,"columnArticles":264,"formTitle":"[475]Heaters","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":67677,"title":"Heaters","titleSlug":"heaters"},{"acceptance":0.7131224897394816,"acs":64984,"articleLive":2,"columnArticles":870,"formTitle":"[476]Number Complement","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":91126,"title":"Number Complement","titleSlug":"number-complement"},{"acceptance":0.603562418775323,"acs":39476,"articleLive":2,"columnArticles":334,"formTitle":"[477]Total Hamming Distance","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","submitted":65405,"title":"Total Hamming Distance","titleSlug":"total-hamming-distance"},{"acceptance":0.4435406121957098,"acs":7361,"articleLive":2,"columnArticles":51,"formTitle":"[478]Generate Random Point in a Circle","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":16596,"title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.42506305588742865,"acs":3202,"articleLive":2,"columnArticles":28,"formTitle":"[479]Largest Palindrome Product","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7533,"title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product"},{"acceptance":0.4476068807748299,"acs":30132,"articleLive":2,"columnArticles":411,"formTitle":"[480]Sliding Window Median","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","submitted":67318,"title":"Sliding Window Median","titleSlug":"sliding-window-median"},{"acceptance":0.5450966028751946,"acs":5953,"articleLive":2,"columnArticles":103,"formTitle":"[481]Magical String","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10921,"title":"Magical String","titleSlug":"magical-string"},{"acceptance":0.47234162576860156,"acs":41866,"articleLive":2,"columnArticles":448,"formTitle":"[482]License Key Formatting","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":88635,"title":"License Key Formatting","titleSlug":"license-key-formatting"},{"acceptance":0.5917833800186741,"acs":15845,"articleLive":2,"columnArticles":119,"formTitle":"[483]Smallest Good Base","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","submitted":26775,"title":"Smallest Good Base","titleSlug":"smallest-good-base"},{"acceptance":0.6365925304238355,"acs":1517,"articleLive":2,"columnArticles":36,"formTitle":"[484]Find Permutation","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2383,"title":"Find Permutation","titleSlug":"find-permutation"},{"acceptance":0.6077585386737704,"acs":127763,"articleLive":2,"columnArticles":1039,"formTitle":"[485]Max Consecutive Ones","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":210220,"title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865224523019622,"acs":47557,"articleLive":2,"columnArticles":408,"formTitle":"[486]Predict the Winner","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","submitted":81083,"title":"Predict the Winner","titleSlug":"predict-the-winner"},{"acceptance":0.5770088290377241,"acs":6470,"articleLive":2,"columnArticles":120,"formTitle":"[487]Max Consecutive Ones II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":11213,"title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5290322580645161,"acs":17302,"articleLive":2,"columnArticles":172,"formTitle":"[488]Zuma Game","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":32705,"title":"Zuma Game","titleSlug":"zuma-game"},{"acceptance":0.7257401315789473,"acs":1765,"articleLive":2,"columnArticles":24,"formTitle":"[489]Robot Room Cleaner","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2432,"title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner"},{"acceptance":0.48624418286339993,"acs":7105,"articleLive":2,"columnArticles":83,"formTitle":"[490]The Maze","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14612,"title":"The Maze","titleSlug":"the-maze"},{"acceptance":0.5431474816267592,"acs":50403,"articleLive":2,"columnArticles":427,"formTitle":"[491]Increasing Subsequences","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","submitted":92798,"title":"Increasing Subsequences","titleSlug":"increasing-subsequences"},{"acceptance":0.6057269018995436,"acs":44994,"articleLive":2,"columnArticles":430,"formTitle":"[492]Construct the Rectangle","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":74281,"title":"Construct the Rectangle","titleSlug":"construct-the-rectangle"},{"acceptance":0.3463214527609871,"acs":27100,"articleLive":2,"columnArticles":273,"formTitle":"[493]Reverse Pairs","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":78251,"title":"Reverse Pairs","titleSlug":"reverse-pairs"},{"acceptance":0.492230276975382,"acs":159838,"articleLive":2,"columnArticles":1087,"formTitle":"[494]Target Sum","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","submitted":324722,"title":"Target Sum","titleSlug":"target-sum"},{"acceptance":0.6073454312472911,"acs":64460,"articleLive":2,"columnArticles":926,"formTitle":"[495]Teemo Attacking","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":106134,"title":"Teemo Attacking","titleSlug":"teemo-attacking"},{"acceptance":0.7051566322691872,"acs":141520,"articleLive":2,"columnArticles":1447,"formTitle":"[496]Next Greater Element I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"","submitted":200693,"title":"Next Greater Element I","titleSlug":"next-greater-element-i"},{"acceptance":0.4040597472232861,"acs":3165,"articleLive":2,"columnArticles":36,"formTitle":"[497]Random Point in Non-overlapping Rectangles","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7833,"title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4742490372272144,"acs":46180,"articleLive":2,"columnArticles":473,"formTitle":"[498]Diagonal Traverse","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":97375,"title":"Diagonal Traverse","titleSlug":"diagonal-traverse"},{"acceptance":0.3762022533663094,"acs":2738,"articleLive":2,"columnArticles":50,"formTitle":"[499]The Maze III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7278,"title":"The Maze III","titleSlug":"the-maze-iii"},{"acceptance":0.7439695424179298,"acs":51784,"articleLive":2,"columnArticles":759,"formTitle":"[500]Keyboard Row","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":69605,"title":"Keyboard Row","titleSlug":"keyboard-row"},{"acceptance":0.5152672319555648,"acs":69761,"articleLive":2,"columnArticles":572,"formTitle":"[501]Find Mode in Binary Search Tree","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":135388,"title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44129283674440745,"acs":29669,"articleLive":2,"columnArticles":360,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":67232,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6383532024310425,"acs":109235,"articleLive":2,"columnArticles":1032,"formTitle":"[503]Next Greater Element II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"","submitted":171120,"title":"Next Greater Element II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5035715953125729,"acs":32358,"articleLive":2,"columnArticles":344,"formTitle":"[504]Base 7","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":64257,"title":"Base 7","titleSlug":"base-7"},{"acceptance":0.48827642945290006,"acs":5935,"articleLive":2,"columnArticles":71,"formTitle":"[505]The Maze II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":12155,"title":"The Maze II","titleSlug":"the-maze-ii"},{"acceptance":0.5613583365720949,"acs":23110,"articleLive":2,"columnArticles":312,"formTitle":"[506]Relative Ranks","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":41168,"title":"Relative Ranks","titleSlug":"relative-ranks"},{"acceptance":0.4167301192909336,"acs":31196,"articleLive":2,"columnArticles":249,"formTitle":"[507]Perfect Number","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":74859,"title":"Perfect Number","titleSlug":"perfect-number"},{"acceptance":0.6776727466382639,"acs":15270,"articleLive":2,"columnArticles":217,"formTitle":"[508]Most Frequent Subtree Sum","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":22533,"title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6720784681932181,"acs":267707,"articleLive":2,"columnArticles":1589,"formTitle":"[509]Fibonacci Number","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":398327,"title":"Fibonacci Number","titleSlug":"fibonacci-number"},{"acceptance":0.6072772898368883,"acs":3388,"articleLive":2,"columnArticles":55,"formTitle":"[510]Inorder Successor in BST II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5579,"title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7303770031624205,"acs":20555,"articleLive":2,"columnArticles":115,"formTitle":"[511]Game Play Analysis I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":28143,"title":"Game Play Analysis I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5379335260115607,"acs":19357,"articleLive":2,"columnArticles":155,"formTitle":"[512]Game Play Analysis II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":35984,"title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.731347603573261,"acs":55589,"articleLive":2,"columnArticles":621,"formTitle":"[513]Find Bottom Left Tree Value","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":76009,"title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.49915376574244613,"acs":20055,"articleLive":2,"columnArticles":246,"formTitle":"[514]Freedom Trail","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40178,"title":"Freedom Trail","titleSlug":"freedom-trail"},{"acceptance":0.6463651798116994,"acs":41878,"articleLive":2,"columnArticles":454,"formTitle":"[515]Find Largest Value in Each Tree Row","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":64790,"title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6562236187974861,"acs":90948,"articleLive":2,"columnArticles":652,"formTitle":"[516]Longest Palindromic Subsequence","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","submitted":138593,"title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5090354376906829,"acs":19521,"articleLive":2,"columnArticles":170,"formTitle":"[517]Super Washing Machines","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":38349,"title":"Super Washing Machines","titleSlug":"super-washing-machines"},{"acceptance":0.6606862564055215,"acs":114489,"articleLive":2,"columnArticles":717,"formTitle":"[518]Coin Change 2","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","submitted":173288,"title":"Coin Change 2","titleSlug":"coin-change-2"},{"acceptance":0.39961121910580394,"acs":2878,"articleLive":2,"columnArticles":39,"formTitle":"[519]Random Flip Matrix","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":7202,"title":"Random Flip Matrix","titleSlug":"random-flip-matrix"},{"acceptance":0.5764685645480347,"acs":67026,"articleLive":2,"columnArticles":1033,"formTitle":"[520]Detect Capital","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":116270,"title":"Detect Capital","titleSlug":"detect-capital"},{"acceptance":0.7130214573575864,"acs":26185,"articleLive":2,"columnArticles":264,"formTitle":"[521]Longest Uncommon Subsequence I","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":36724,"title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3608984175599796,"acs":7070,"articleLive":2,"columnArticles":113,"formTitle":"[522]Longest Uncommon Subsequence II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19590,"title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2753946825810568,"acs":70788,"articleLive":2,"columnArticles":617,"formTitle":"[523]Continuous Subarray Sum","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","submitted":257042,"title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49645314911345284,"acs":74954,"articleLive":2,"columnArticles":778,"formTitle":"[524]Longest Word in Dictionary through Deleting","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":150979,"title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5365895576255456,"acs":46833,"articleLive":2,"columnArticles":530,"formTitle":"[525]Contiguous Array","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","submitted":87279,"title":"Contiguous Array","titleSlug":"contiguous-array"},{"acceptance":0.7347308879725383,"acs":34032,"articleLive":2,"columnArticles":393,"formTitle":"[526]Beautiful Arrangement","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","submitted":46319,"title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"},{"acceptance":0.5785857429144002,"acs":2021,"articleLive":2,"columnArticles":30,"formTitle":"[527]Word Abbreviation","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3493,"title":"Word Abbreviation","titleSlug":"word-abbreviation"},{"acceptance":0.4781575473082001,"acs":32596,"articleLive":2,"columnArticles":264,"formTitle":"[528]Random Pick with Weight","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":68170,"title":"Random Pick with Weight","titleSlug":"random-pick-with-weight"},{"acceptance":0.644065911366056,"acs":40533,"articleLive":2,"columnArticles":468,"formTitle":"[529]Minesweeper","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":62933,"title":"Minesweeper","titleSlug":"minesweeper"},{"acceptance":0.6215095610522771,"acs":83043,"articleLive":2,"columnArticles":673,"formTitle":"[530]Minimum Absolute Difference in BST","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","submitted":133615,"title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6610732679847151,"acs":3979,"articleLive":2,"columnArticles":78,"formTitle":"[531]Lonely Pixel I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":6019,"title":"Lonely Pixel I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3770605187319885,"acs":26168,"articleLive":2,"columnArticles":286,"formTitle":"[532]K-diff Pairs in an Array","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":69400,"title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5288431555971312,"acs":1696,"articleLive":2,"columnArticles":35,"formTitle":"[533]Lonely Pixel II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3207,"title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6744719319133924,"acs":15295,"articleLive":2,"columnArticles":146,"formTitle":"[534]Game Play Analysis III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":22677,"title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8434028859130074,"acs":16249,"articleLive":2,"columnArticles":106,"formTitle":"[535]Encode and Decode TinyURL","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19266,"title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5414832925835371,"acs":3322,"articleLive":2,"columnArticles":52,"formTitle":"[536]Construct Binary Tree from String","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":6135,"title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7129689807976366,"acs":12067,"articleLive":2,"columnArticles":182,"formTitle":"[537]Complex Number Multiplication","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16925,"title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication"},{"acceptance":0.7058469807882287,"acs":115034,"articleLive":2,"columnArticles":889,"formTitle":"[538]Convert BST to Greater Tree","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":162973,"title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5985989210081327,"acs":14868,"articleLive":2,"columnArticles":207,"formTitle":"[539]Minimum Time Difference","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":24838,"title":"Minimum Time Difference","titleSlug":"minimum-time-difference"},{"acceptance":0.5813175757060466,"acs":41023,"articleLive":2,"columnArticles":435,"formTitle":"[540]Single Element in a Sorted Array","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","submitted":70569,"title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6052736031878215,"acs":77771,"articleLive":2,"columnArticles":838,"formTitle":"[541]Reverse String II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","submitted":128489,"title":"Reverse String II","titleSlug":"reverse-string-ii"},{"acceptance":0.4577119909890056,"acs":74770,"articleLive":2,"columnArticles":688,"formTitle":"[542]01 Matrix","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","submitted":163356,"title":"01 Matrix","titleSlug":"01-matrix"},{"acceptance":0.5548328670764111,"acs":158068,"articleLive":2,"columnArticles":1285,"formTitle":"[543]Diameter of Binary Tree","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":284893,"title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7139401270033263,"acs":2361,"articleLive":2,"columnArticles":55,"formTitle":"[544]Output Contest Matches","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3307,"title":"Output Contest Matches","titleSlug":"output-contest-matches"},{"acceptance":0.42140073225463565,"acs":3568,"articleLive":2,"columnArticles":80,"formTitle":"[545]Boundary of Binary Tree","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8467,"title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6277024249897246,"acs":15272,"articleLive":2,"columnArticles":123,"formTitle":"[546]Remove Boxes","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24330,"title":"Remove Boxes","titleSlug":"remove-boxes"},{"acceptance":0.6186962716952674,"acs":170642,"articleLive":2,"columnArticles":1202,"formTitle":"[547]Number of Provinces","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","submitted":275809,"title":"Number of Provinces","titleSlug":"number-of-provinces"},{"acceptance":0.3546325878594249,"acs":1665,"articleLive":2,"columnArticles":40,"formTitle":"[548]Split Array with Equal Sum","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4695,"title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4880034275921165,"acs":2278,"articleLive":2,"columnArticles":53,"formTitle":"[549]Binary Tree Longest Consecutive Sequence II","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4668,"title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43811343979786854,"acs":13525,"articleLive":2,"columnArticles":190,"formTitle":"[550]Game Play Analysis IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":30871,"title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5673095986631547,"acs":60090,"articleLive":2,"columnArticles":770,"formTitle":"[551]Student Attendance Record I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","submitted":105921,"title":"Student Attendance Record I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5776176707588757,"acs":24372,"articleLive":2,"columnArticles":289,"formTitle":"[552]Student Attendance Record II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","submitted":42194,"title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6063651591289783,"acs":6154,"articleLive":2,"columnArticles":92,"formTitle":"[553]Optimal Division","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10149,"title":"Optimal Division","titleSlug":"optimal-division"},{"acceptance":0.5037976868634559,"acs":46696,"articleLive":2,"columnArticles":490,"formTitle":"[554]Brick Wall","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","submitted":92688,"title":"Brick Wall","titleSlug":"brick-wall"},{"acceptance":0.34446130500758726,"acs":1135,"articleLive":2,"columnArticles":24,"formTitle":"[555]Split Concatenated Strings","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3295,"title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings"},{"acceptance":0.3282862175991947,"acs":15654,"articleLive":2,"columnArticles":233,"formTitle":"[556]Next Greater Element III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":47684,"title":"Next Greater Element III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7439638744944255,"acs":175295,"articleLive":2,"columnArticles":1456,"formTitle":"[557]Reverse Words in a String III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","submitted":235623,"title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5035851258962815,"acs":3020,"articleLive":2,"columnArticles":40,"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":5997,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7285188634247166,"acs":64149,"articleLive":2,"columnArticles":571,"formTitle":"[559]Maximum Depth of N-ary Tree","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":88054,"title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4459667504734901,"acs":161060,"articleLive":2,"columnArticles":984,"formTitle":"[560]Subarray Sum Equals K","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":361148,"title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7755020147469445,"acs":92764,"articleLive":2,"columnArticles":774,"formTitle":"[561]Array Partition I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":119618,"title":"Array Partition I","titleSlug":"array-partition-i"},{"acceptance":0.46926727630512793,"acs":4054,"articleLive":2,"columnArticles":68,"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":8639,"title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6541588422484848,"acs":58175,"articleLive":2,"columnArticles":584,"formTitle":"[563]Binary Tree Tilt","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":88931,"title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt"},{"acceptance":0.18028091650973008,"acs":4595,"articleLive":2,"columnArticles":82,"formTitle":"[564]Find the Closest Palindrome","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","submitted":25488,"title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6088843398157625,"acs":14872,"articleLive":2,"columnArticles":145,"formTitle":"[565]Array Nesting","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":24425,"title":"Array Nesting","titleSlug":"array-nesting"},{"acceptance":0.6831983622298313,"acs":75421,"articleLive":2,"columnArticles":710,"formTitle":"[566]Reshape the Matrix","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","submitted":110394,"title":"Reshape the Matrix","titleSlug":"reshape-the-matrix"},{"acceptance":0.43273917351401664,"acs":129714,"articleLive":2,"columnArticles":1178,"formTitle":"[567]Permutation in String","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"","submitted":299751,"title":"Permutation in String","titleSlug":"permutation-in-string"},{"acceptance":0.5069958847736625,"acs":1232,"articleLive":2,"columnArticles":26,"formTitle":"[568]Maximum Vacation Days","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2430,"title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days"},{"acceptance":0.5656789989708033,"acs":10443,"articleLive":2,"columnArticles":165,"formTitle":"[569]Median Employee Salary","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":18461,"title":"Median Employee Salary","titleSlug":"median-employee-salary"},{"acceptance":0.6618760180128389,"acs":13816,"articleLive":2,"columnArticles":117,"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":20874,"title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4822814714816065,"acs":7145,"articleLive":2,"columnArticles":97,"formTitle":"[571]Find Median Given Frequency of Numbers","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14815,"title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4726017288635884,"acs":89662,"articleLive":2,"columnArticles":778,"formTitle":"[572]Subtree of Another Tree","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","submitted":189720,"title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6637390213299874,"acs":1058,"articleLive":2,"columnArticles":34,"formTitle":"[573]Squirrel Simulation","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1594,"title":"Squirrel Simulation","titleSlug":"squirrel-simulation"},{"acceptance":0.6483388945306833,"acs":13407,"articleLive":2,"columnArticles":120,"formTitle":"[574]Winning Candidate","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":20679,"title":"Winning Candidate","titleSlug":"winning-candidate"},{"acceptance":0.7128853887399463,"acs":85090,"articleLive":2,"columnArticles":826,"formTitle":"[575]Distribute Candies","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":119360,"title":"Distribute Candies","titleSlug":"distribute-candies"},{"acceptance":0.4680389459202032,"acs":26535,"articleLive":2,"columnArticles":287,"formTitle":"[576]Out of Boundary Paths","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","submitted":56694,"title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7002724795640327,"acs":16191,"articleLive":2,"columnArticles":90,"formTitle":"[577]Employee Bonus","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":23121,"title":"Employee Bonus","titleSlug":"employee-bonus"},{"acceptance":0.4887102052264971,"acs":10454,"articleLive":2,"columnArticles":117,"formTitle":"[578]Get Highest Answer Rate Question","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":21391,"title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40957393483709276,"acs":8171,"articleLive":2,"columnArticles":135,"formTitle":"[579]Find Cumulative Salary of an Employee","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":19950,"title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5219045760562006,"acs":10698,"articleLive":2,"columnArticles":84,"formTitle":"[580]Count Student Number in Departments","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":20498,"title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40528073865740194,"acs":102887,"articleLive":2,"columnArticles":890,"formTitle":"[581]Shortest Unsorted Continuous Subarray","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"","submitted":253866,"title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.41377730957724546,"acs":9034,"articleLive":2,"columnArticles":140,"formTitle":"[582]Kill Process","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21833,"title":"Kill Process","titleSlug":"kill-process"},{"acceptance":0.6228860347532981,"acs":53590,"articleLive":2,"columnArticles":511,"formTitle":"[583]Delete Operation for Two Strings","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","submitted":86035,"title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7748823933611713,"acs":14660,"articleLive":2,"columnArticles":65,"formTitle":"[584]Find Customer Referee","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":18919,"title":"Find Customer Referee","titleSlug":"find-customer-referee"},{"acceptance":0.5852328713131446,"acs":8909,"articleLive":2,"columnArticles":107,"formTitle":"[585]Investments in 2016","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":15223,"title":"Investments in 2016","titleSlug":"investments-in-2016"},{"acceptance":0.7449126511806489,"acs":15521,"articleLive":2,"columnArticles":91,"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":20836,"title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38823939975571453,"acs":2225,"articleLive":2,"columnArticles":38,"formTitle":"[587]Erect the Fence","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5731,"title":"Erect the Fence","titleSlug":"erect-the-fence"},{"acceptance":0.42248677248677247,"acs":1597,"articleLive":2,"columnArticles":29,"formTitle":"[588]Design In-Memory File System","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3780,"title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7458334012153598,"acs":91560,"articleLive":2,"columnArticles":587,"formTitle":"[589]N-ary Tree Preorder Traversal","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":122762,"title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7622965249333975,"acs":64953,"articleLive":2,"columnArticles":483,"formTitle":"[590]N-ary Tree Postorder Traversal","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":85207,"title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3405836505347109,"acs":1879,"articleLive":2,"columnArticles":41,"formTitle":"[591]Tag Validator","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","submitted":5517,"title":"Tag Validator","titleSlug":"tag-validator"},{"acceptance":0.5251734168717834,"acs":4694,"articleLive":2,"columnArticles":116,"formTitle":"[592]Fraction Addition and Subtraction","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8938,"title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44159197934072614,"acs":8721,"articleLive":2,"columnArticles":142,"formTitle":"[593]Valid Square","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19749,"title":"Valid Square","titleSlug":"valid-square"},{"acceptance":0.5194275744052612,"acs":30961,"articleLive":2,"columnArticles":289,"formTitle":"[594]Longest Harmonious Subsequence","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":59606,"title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7967823625800685,"acs":106976,"articleLive":2,"columnArticles":248,"formTitle":"[595]Big Countries","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":134260,"title":"Big Countries","titleSlug":"big-countries"},{"acceptance":0.42589108811815796,"acs":85122,"articleLive":2,"columnArticles":304,"formTitle":"[596]Classes More Than 5 Students","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":199868,"title":"Classes More Than 5 Students","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44239314858204737,"acs":10951,"articleLive":2,"columnArticles":86,"formTitle":"[597]Friend Requests I: Overall Acceptance Rate","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":24754,"title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5717799424704362,"acs":41147,"articleLive":2,"columnArticles":483,"formTitle":"[598]Range Addition II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":71963,"title":"Range Addition II","titleSlug":"range-addition-ii"},{"acceptance":0.5219538121281739,"acs":30444,"articleLive":2,"columnArticles":294,"formTitle":"[599]Minimum Index Sum of Two Lists","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","submitted":58327,"title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4815564663473409,"acs":19504,"articleLive":2,"columnArticles":234,"formTitle":"[600]Non-negative Integers without Consecutive Ones","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":40502,"title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5037063022390336,"acs":33025,"articleLive":2,"columnArticles":391,"formTitle":"[601]Human Traffic of Stadium","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":65564,"title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6225199131064446,"acs":8597,"articleLive":2,"columnArticles":94,"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":13810,"title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6704713904536022,"acs":13569,"articleLive":2,"columnArticles":118,"formTitle":"[603]Consecutive Available Seats","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":20238,"title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats"},{"acceptance":0.3740648379052369,"acs":2550,"articleLive":2,"columnArticles":60,"formTitle":"[604]Design Compressed String Iterator","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6817,"title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33300938091812615,"acs":113418,"articleLive":2,"columnArticles":1303,"formTitle":"[605]Can Place Flowers","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":340585,"title":"Can Place Flowers","titleSlug":"can-place-flowers"},{"acceptance":0.5689371629632463,"acs":29752,"articleLive":2,"columnArticles":326,"formTitle":"[606]Construct String from Binary Tree","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":52294,"title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6632439335887612,"acs":12983,"articleLive":2,"columnArticles":92,"formTitle":"[607]Sales Person","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":19575,"title":"Sales Person","titleSlug":"sales-person"},{"acceptance":0.6448350589934987,"acs":8034,"articleLive":2,"columnArticles":106,"formTitle":"[608]Tree Node","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":12459,"title":"Tree Node","titleSlug":"tree-node"},{"acceptance":0.4839010397992112,"acs":6748,"articleLive":2,"columnArticles":104,"formTitle":"[609]Find Duplicate File in System","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13945,"title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6637817834546974,"acs":11121,"articleLive":2,"columnArticles":77,"formTitle":"[610]Triangle Judgement","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":16754,"title":"Triangle Judgement","titleSlug":"triangle-judgement"},{"acceptance":0.5321219524609355,"acs":52273,"articleLive":2,"columnArticles":409,"formTitle":"[611]Valid Triangle Number","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","submitted":98235,"title":"Valid Triangle Number","titleSlug":"valid-triangle-number"},{"acceptance":0.6664972469292673,"acs":7868,"articleLive":2,"columnArticles":69,"formTitle":"[612]Shortest Distance in a Plane","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11805,"title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8157964484495097,"acs":12312,"articleLive":2,"columnArticles":85,"formTitle":"[613]Shortest Distance in a Line","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":15092,"title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3489849246231156,"acs":8681,"articleLive":2,"columnArticles":71,"formTitle":"[614]Second Degree Follower","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":24875,"title":"Second Degree Follower","titleSlug":"second-degree-follower"},{"acceptance":0.4230537569643126,"acs":5619,"articleLive":2,"columnArticles":94,"formTitle":"[615]Average Salary: Departments VS Company","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":13282,"title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4661349372384937,"acs":3565,"articleLive":2,"columnArticles":61,"formTitle":"[616]Add Bold Tag in String","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7648,"title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7873456380294782,"acs":201603,"articleLive":2,"columnArticles":1328,"formTitle":"[617]Merge Two Binary Trees","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","submitted":256054,"title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6202450855246362,"acs":4859,"articleLive":2,"columnArticles":48,"formTitle":"[618]Students Report By Geography","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7834,"title":"Students Report By Geography","titleSlug":"students-report-by-geography"},{"acceptance":0.4642774208530072,"acs":11996,"articleLive":2,"columnArticles":82,"formTitle":"[619]Biggest Single Number","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":25838,"title":"Biggest Single Number","titleSlug":"biggest-single-number"},{"acceptance":0.7730456710563183,"acs":96565,"articleLive":2,"columnArticles":325,"formTitle":"[620]Not Boring Movies","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":124915,"title":"Not Boring Movies","titleSlug":"not-boring-movies"},{"acceptance":0.572459666006227,"acs":80900,"articleLive":2,"columnArticles":519,"formTitle":"[621]Task Scheduler","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":141320,"title":"Task Scheduler","titleSlug":"task-scheduler"},{"acceptance":0.43893180734382453,"acs":69033,"articleLive":2,"columnArticles":442,"formTitle":"[622]Design Circular Queue","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","submitted":157275,"title":"Design Circular Queue","titleSlug":"design-circular-queue"},{"acceptance":0.5458074901756546,"acs":11528,"articleLive":2,"columnArticles":197,"formTitle":"[623]Add One Row to Tree","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21121,"title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42306252339947586,"acs":2260,"articleLive":2,"columnArticles":54,"formTitle":"[624]Maximum Distance in Arrays","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5342,"title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3432715551974214,"acs":2556,"articleLive":2,"columnArticles":55,"formTitle":"[625]Minimum Factorization","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7446,"title":"Minimum Factorization","titleSlug":"minimum-factorization"},{"acceptance":0.6839118825100133,"acs":47127,"articleLive":2,"columnArticles":371,"formTitle":"[626]Exchange Seats","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":68908,"title":"Exchange Seats","titleSlug":"exchange-seats"},{"acceptance":0.8086719973621301,"acs":88290,"articleLive":2,"columnArticles":356,"formTitle":"[627]Swap Salary","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":109179,"title":"Swap Salary","titleSlug":"swap-salary"},{"acceptance":0.5242377379384081,"acs":82374,"articleLive":2,"columnArticles":786,"formTitle":"[628]Maximum Product of Three Numbers","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"","submitted":157131,"title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.5217009213323883,"acs":18403,"articleLive":2,"columnArticles":171,"formTitle":"[629]K Inverse Pairs Array","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":35275,"title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.37107654568768467,"acs":6656,"articleLive":2,"columnArticles":76,"formTitle":"[630]Course Schedule III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17937,"title":"Course Schedule III","titleSlug":"course-schedule-iii"},{"acceptance":0.2903981264637002,"acs":1116,"articleLive":2,"columnArticles":36,"formTitle":"[631]Design Excel Sum Formula","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3843,"title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5984372081439512,"acs":19223,"articleLive":2,"columnArticles":243,"formTitle":"[632]Smallest Range Covering Elements from K Lists","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32122,"title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3961900623511423,"acs":96647,"articleLive":2,"columnArticles":785,"formTitle":"[633]Sum of Square Numbers","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"","submitted":243941,"title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44188250157927983,"acs":1399,"articleLive":2,"columnArticles":22,"formTitle":"[634]Find the Derangement of An Array","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3166,"title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.553820555484449,"acs":4327,"articleLive":2,"columnArticles":70,"formTitle":"[635]Design Log Storage System","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7813,"title":"Design Log Storage System","titleSlug":"design-log-storage-system"},{"acceptance":0.5553097345132744,"acs":10291,"articleLive":2,"columnArticles":115,"formTitle":"[636]Exclusive Time of Functions","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"","submitted":18532,"title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6901932562180758,"acs":78642,"articleLive":2,"columnArticles":679,"formTitle":"[637]Average of Levels in Binary Tree","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":113942,"title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6472170062823098,"acs":27919,"articleLive":2,"columnArticles":269,"formTitle":"[638]Shopping Offers","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":43137,"title":"Shopping Offers","titleSlug":"shopping-offers"},{"acceptance":0.37662121099829543,"acs":20327,"articleLive":2,"columnArticles":274,"formTitle":"[639]Decode Ways II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":53972,"title":"Decode Ways II","titleSlug":"decode-ways-ii"},{"acceptance":0.42593374534566814,"acs":11096,"articleLive":2,"columnArticles":218,"formTitle":"[640]Solve the Equation","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26051,"title":"Solve the Equation","titleSlug":"solve-the-equation"},{"acceptance":0.5321613778010371,"acs":22371,"articleLive":2,"columnArticles":252,"formTitle":"[641]Design Circular Deque","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":42038,"title":"Design Circular Deque","titleSlug":"design-circular-deque"},{"acceptance":0.4949513836948392,"acs":2647,"articleLive":2,"columnArticles":59,"formTitle":"[642]Design Search Autocomplete System","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5348,"title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4489750142736739,"acs":66055,"articleLive":2,"columnArticles":593,"formTitle":"[643]Maximum Average Subarray I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":147124,"title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4052667578659371,"acs":1185,"articleLive":2,"columnArticles":25,"formTitle":"[644]Maximum Average Subarray II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2924,"title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43131031367689876,"acs":70662,"articleLive":2,"columnArticles":719,"formTitle":"[645]Set Mismatch","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","submitted":163831,"title":"Set Mismatch","titleSlug":"set-mismatch"},{"acceptance":0.5790780229873644,"acs":23327,"articleLive":2,"columnArticles":214,"formTitle":"[646]Maximum Length of Pair Chain","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":40283,"title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6575148854273171,"acs":131190,"articleLive":2,"columnArticles":967,"formTitle":"[647]Palindromic Substrings","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":199524,"title":"Palindromic Substrings","titleSlug":"palindromic-substrings"},{"acceptance":0.5874600429701828,"acs":22421,"articleLive":2,"columnArticles":294,"formTitle":"[648]Replace Words","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":38166,"title":"Replace Words","titleSlug":"replace-words"},{"acceptance":0.4813894169063053,"acs":29630,"articleLive":2,"columnArticles":311,"formTitle":"[649]Dota2 Senate","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":61551,"title":"Dota2 Senate","titleSlug":"dota2-senate"},{"acceptance":0.5674940458049733,"acs":50276,"articleLive":2,"columnArticles":665,"formTitle":"[650]2 Keys Keyboard","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":88593,"title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard"},{"acceptance":0.5846501128668171,"acs":3885,"articleLive":2,"columnArticles":66,"formTitle":"[651]4 Keys Keyboard","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6645,"title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard"},{"acceptance":0.5711631242665276,"acs":35042,"articleLive":2,"columnArticles":248,"formTitle":"[652]Find Duplicate Subtrees","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":61352,"title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6001970469943585,"acs":44471,"articleLive":2,"columnArticles":444,"formTitle":"[653]Two Sum IV - Input is a BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":74094,"title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8099231219706692,"acs":65002,"articleLive":2,"columnArticles":657,"formTitle":"[654]Maximum Binary Tree","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":80257,"title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree"},{"acceptance":0.5998285679299578,"acs":9797,"articleLive":2,"columnArticles":146,"formTitle":"[655]Print Binary Tree","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16333,"title":"Print Binary Tree","titleSlug":"print-binary-tree"},{"acceptance":0.3100358422939068,"acs":865,"articleLive":2,"columnArticles":25,"formTitle":"[656]Coin Path","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2790,"title":"Coin Path","titleSlug":"coin-path"},{"acceptance":0.7830436824800375,"acs":83355,"articleLive":2,"columnArticles":641,"formTitle":"[657]Robot Return to Origin","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":106450,"title":"Robot Return to Origin","titleSlug":"robot-return-to-origin"},{"acceptance":0.45505045681724127,"acs":28589,"articleLive":2,"columnArticles":253,"formTitle":"[658]Find K Closest Elements","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":62826,"title":"Find K Closest Elements","titleSlug":"find-k-closest-elements"},{"acceptance":0.5416752843846949,"acs":28809,"articleLive":2,"columnArticles":264,"formTitle":"[659]Split Array into Consecutive Subsequences","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":53185,"title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6565934065934066,"acs":717,"articleLive":2,"columnArticles":24,"formTitle":"[660]Remove 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1092,"title":"Remove 9","titleSlug":"remove-9"},{"acceptance":0.5620805918360666,"acs":17171,"articleLive":2,"columnArticles":217,"formTitle":"[661]Image Smoother","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":30549,"title":"Image Smoother","titleSlug":"image-smoother"},{"acceptance":0.40934517054936254,"acs":30662,"articleLive":2,"columnArticles":289,"formTitle":"[662]Maximum Width of Binary Tree","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":74905,"title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46405892811785626,"acs":1827,"articleLive":2,"columnArticles":37,"formTitle":"[663]Equal Tree Partition","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3937,"title":"Equal Tree Partition","titleSlug":"equal-tree-partition"},{"acceptance":0.6540814235958674,"acs":22348,"articleLive":2,"columnArticles":192,"formTitle":"[664]Strange Printer","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","submitted":34167,"title":"Strange Printer","titleSlug":"strange-printer"},{"acceptance":0.27090750009741305,"acs":76478,"articleLive":2,"columnArticles":960,"formTitle":"[665]Non-decreasing Array","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":282303,"title":"Non-decreasing Array","titleSlug":"non-decreasing-array"},{"acceptance":0.6200625177607275,"acs":2182,"articleLive":2,"columnArticles":79,"formTitle":"[666]Path Sum IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3519,"title":"Path Sum IV","titleSlug":"path-sum-iv"},{"acceptance":0.6235107826873775,"acs":8269,"articleLive":2,"columnArticles":126,"formTitle":"[667]Beautiful Arrangement II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13262,"title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5111079963557362,"acs":7293,"articleLive":2,"columnArticles":77,"formTitle":"[668]Kth Smallest Number in Multiplication Table","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14269,"title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6647644508422874,"acs":38791,"articleLive":2,"columnArticles":324,"formTitle":"[669]Trim a Binary Search Tree","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":58353,"title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45339605998235816,"acs":20046,"articleLive":2,"columnArticles":299,"formTitle":"[670]Maximum Swap","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":44213,"title":"Maximum Swap","titleSlug":"maximum-swap"},{"acceptance":0.48553887646829197,"acs":54728,"articleLive":2,"columnArticles":685,"formTitle":"[671]Second Minimum Node In a Binary Tree","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"","submitted":112716,"title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5502593579139212,"acs":3925,"articleLive":2,"columnArticles":45,"formTitle":"[672]Bulb Switcher II","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7133,"title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4359567292953182,"acs":49771,"articleLive":2,"columnArticles":424,"formTitle":"[673]Number of Longest Increasing Subsequence","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","submitted":114165,"title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5002305066484334,"acs":96571,"articleLive":2,"columnArticles":806,"formTitle":"[674]Longest Continuous Increasing Subsequence","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":193053,"title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40026631158455395,"acs":3006,"articleLive":2,"columnArticles":49,"formTitle":"[675]Cut Off Trees for Golf Event","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7510,"title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.592013361676283,"acs":7798,"articleLive":2,"columnArticles":140,"formTitle":"[676]Implement Magic Dictionary","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":13172,"title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6661824734306623,"acs":36231,"articleLive":2,"columnArticles":545,"formTitle":"[677]Map Sum Pairs","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":54386,"title":"Map Sum Pairs","titleSlug":"map-sum-pairs"},{"acceptance":0.3856785100727357,"acs":45124,"articleLive":2,"columnArticles":488,"formTitle":"[678]Valid Parenthesis String","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":116999,"title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5406162464985994,"acs":26634,"articleLive":2,"columnArticles":266,"formTitle":"[679]24 Game","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":49266,"title":"24 Game","titleSlug":"24-game"},{"acceptance":0.4015514477662971,"acs":90433,"articleLive":2,"columnArticles":855,"formTitle":"[680]Valid Palindrome II","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":225209,"title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5068391866913123,"acs":2742,"articleLive":2,"columnArticles":65,"formTitle":"[681]Next Closest Time","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5410,"title":"Next Closest Time","titleSlug":"next-closest-time"},{"acceptance":0.693329034527229,"acs":47310,"articleLive":2,"columnArticles":526,"formTitle":"[682]Baseball Game","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"","submitted":68236,"title":"Baseball Game","titleSlug":"baseball-game"},{"acceptance":0.43575418994413406,"acs":2340,"articleLive":2,"columnArticles":53,"formTitle":"[683]K Empty Slots","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5370,"title":"K Empty Slots","titleSlug":"k-empty-slots"},{"acceptance":0.666545508969233,"acs":62350,"articleLive":2,"columnArticles":633,"formTitle":"[684]Redundant Connection","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":93542,"title":"Redundant Connection","titleSlug":"redundant-connection"},{"acceptance":0.4301812631975079,"acs":20576,"articleLive":2,"columnArticles":259,"formTitle":"[685]Redundant Connection II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":47831,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35713712267180475,"acs":17794,"articleLive":2,"columnArticles":207,"formTitle":"[686]Repeated String Match","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":49824,"title":"Repeated String Match","titleSlug":"repeated-string-match"},{"acceptance":0.44259421560035056,"acs":39390,"articleLive":2,"columnArticles":277,"formTitle":"[687]Longest Univalue Path","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":88998,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path"},{"acceptance":0.5126112304387849,"acs":8353,"articleLive":2,"columnArticles":109,"formTitle":"[688]Knight Probability in Chessboard","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16295,"title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.49035576510930134,"acs":3432,"articleLive":2,"columnArticles":72,"formTitle":"[689]Maximum Sum of 3 Non-Overlapping Subarrays","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6999,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6482915458525215,"acs":57014,"articleLive":2,"columnArticles":578,"formTitle":"[690]Employee Importance","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"","submitted":87945,"title":"Employee Importance","titleSlug":"employee-importance"},{"acceptance":0.48882609812483946,"acs":3806,"articleLive":2,"columnArticles":53,"formTitle":"[691]Stickers to Spell Word","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7786,"title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5763586041507544,"acs":70178,"articleLive":2,"columnArticles":764,"formTitle":"[692]Top K Frequent Words","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","submitted":121761,"title":"Top K Frequent Words","titleSlug":"top-k-frequent-words"},{"acceptance":0.6088402289230213,"acs":26915,"articleLive":2,"columnArticles":300,"formTitle":"[693]Binary Number with Alternating Bits","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":44207,"title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.537059686888454,"acs":4391,"articleLive":2,"columnArticles":87,"formTitle":"[694]Number of Distinct Islands","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":8176,"title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6668150814702539,"acs":140778,"articleLive":2,"columnArticles":1401,"formTitle":"[695]Max Area of Island","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","submitted":211120,"title":"Max Area of Island","titleSlug":"max-area-of-island"},{"acceptance":0.6326111097984547,"acs":53548,"articleLive":2,"columnArticles":482,"formTitle":"[696]Count Binary Substrings","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":84646,"title":"Count Binary Substrings","titleSlug":"count-binary-substrings"},{"acceptance":0.6043284746604248,"acs":68161,"articleLive":2,"columnArticles":869,"formTitle":"[697]Degree of an Array","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":112788,"title":"Degree of an Array","titleSlug":"degree-of-an-array"},{"acceptance":0.44789500309145075,"acs":31874,"articleLive":2,"columnArticles":230,"formTitle":"[698]Partition to K Equal Sum Subsets","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":71164,"title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47868249456612605,"acs":2863,"articleLive":2,"columnArticles":43,"formTitle":"[699]Falling Squares","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5981,"title":"Falling Squares","titleSlug":"falling-squares"},{"acceptance":0.7618241662910263,"acs":89573,"articleLive":2,"columnArticles":571,"formTitle":"[700]Search in a Binary Search Tree","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":117577,"title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7224136112771118,"acs":82202,"articleLive":2,"columnArticles":613,"formTitle":"[701]Insert into a Binary Search Tree","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":113788,"title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7432562620423893,"acs":4629,"articleLive":2,"columnArticles":81,"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":6228,"title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.513358526684049,"acs":62217,"articleLive":2,"columnArticles":571,"formTitle":"[703]Kth Largest Element in a Stream","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":121196,"title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5515551596325381,"acs":334960,"articleLive":2,"columnArticles":1639,"formTitle":"[704]Binary Search","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","submitted":607301,"title":"Binary Search","titleSlug":"binary-search"},{"acceptance":0.643732501032726,"acs":70125,"articleLive":2,"columnArticles":447,"formTitle":"[705]Design HashSet","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"","submitted":108935,"title":"Design HashSet","titleSlug":"design-hashset"},{"acceptance":0.6427053119862619,"acs":61379,"articleLive":2,"columnArticles":403,"formTitle":"[706]Design HashMap","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","submitted":95501,"title":"Design HashMap","titleSlug":"design-hashmap"},{"acceptance":0.324189789811874,"acs":70533,"articleLive":2,"columnArticles":476,"formTitle":"[707]Design Linked List","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"","submitted":217567,"title":"Design Linked List","titleSlug":"design-linked-list"},{"acceptance":0.3435700575815739,"acs":2506,"articleLive":2,"columnArticles":54,"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":7294,"title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.757362255420274,"acs":72344,"articleLive":2,"columnArticles":531,"formTitle":"[709]To Lower Case","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":95521,"title":"To Lower Case","titleSlug":"to-lower-case"},{"acceptance":0.35615123792463693,"acs":5567,"articleLive":2,"columnArticles":68,"formTitle":"[710]Random Pick with Blacklist","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":15631,"title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.560663149962321,"acs":744,"articleLive":2,"columnArticles":26,"formTitle":"[711]Number of Distinct Islands II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1327,"title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6745221040139024,"acs":15914,"articleLive":2,"columnArticles":182,"formTitle":"[712]Minimum ASCII Delete Sum for Two Strings","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":23593,"title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.42145248925954004,"acs":26683,"articleLive":2,"columnArticles":237,"formTitle":"[713]Subarray Product Less Than K","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","submitted":63312,"title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.72412235989573,"acs":105837,"articleLive":2,"columnArticles":722,"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":146159,"title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40891757113523025,"acs":2788,"articleLive":2,"columnArticles":47,"formTitle":"[715]Range Module","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6818,"title":"Range Module","titleSlug":"range-module"},{"acceptance":0.46332544633254463,"acs":4308,"articleLive":2,"columnArticles":81,"formTitle":"[716]Max Stack","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":9298,"title":"Max Stack","titleSlug":"max-stack"},{"acceptance":0.511428887799168,"acs":32331,"articleLive":2,"columnArticles":399,"formTitle":"[717]1-bit and 2-bit Characters","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":63217,"title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5647593131751378,"acs":89036,"articleLive":2,"columnArticles":611,"formTitle":"[718]Maximum Length of Repeated Subarray","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":157653,"title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37500989785414524,"acs":9472,"articleLive":2,"columnArticles":90,"formTitle":"[719]Find K-th Smallest Pair Distance","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":25258,"title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4844223998582848,"acs":21877,"articleLive":2,"columnArticles":294,"formTitle":"[720]Longest Word in Dictionary","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":45161,"title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4697759125821522,"acs":29664,"articleLive":2,"columnArticles":343,"formTitle":"[721]Accounts Merge","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":63145,"title":"Accounts Merge","titleSlug":"accounts-merge"},{"acceptance":0.32304437114941814,"acs":5191,"articleLive":2,"columnArticles":75,"formTitle":"[722]Remove Comments","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16069,"title":"Remove Comments","titleSlug":"remove-comments"},{"acceptance":0.7228541882109617,"acs":1398,"articleLive":2,"columnArticles":41,"formTitle":"[723]Candy Crush","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1934,"title":"Candy Crush","titleSlug":"candy-crush"},{"acceptance":0.46626659392616837,"acs":143584,"articleLive":2,"columnArticles":894,"formTitle":"[724]Find Pivot Index","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":307944,"title":"Find Pivot Index","titleSlug":"find-pivot-index"},{"acceptance":0.608891396886539,"acs":49635,"articleLive":2,"columnArticles":628,"formTitle":"[725]Split Linked List in Parts","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"","submitted":81517,"title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5523997304514937,"acs":22133,"articleLive":2,"columnArticles":403,"formTitle":"[726]Number of Atoms","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","submitted":40067,"title":"Number of Atoms","titleSlug":"number-of-atoms"},{"acceptance":0.40977742448330684,"acs":3093,"articleLive":2,"columnArticles":50,"formTitle":"[727]Minimum Window Subsequence","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7548,"title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7598049980236287,"acs":34600,"articleLive":2,"columnArticles":319,"formTitle":"[728]Self Dividing Numbers","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":45538,"title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers"},{"acceptance":0.5160583520728824,"acs":8950,"articleLive":2,"columnArticles":108,"formTitle":"[729]My Calendar I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":17343,"title":"My Calendar I","titleSlug":"my-calendar-i"},{"acceptance":0.4929251036838253,"acs":4041,"articleLive":2,"columnArticles":51,"formTitle":"[730]Count Different Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8198,"title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.503793626707132,"acs":4316,"articleLive":2,"columnArticles":47,"formTitle":"[731]My Calendar II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8567,"title":"My Calendar II","titleSlug":"my-calendar-ii"},{"acceptance":0.6131561008861622,"acs":3598,"articleLive":2,"columnArticles":56,"formTitle":"[732]My Calendar III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5868,"title":"My Calendar III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804677628285108,"acs":73042,"articleLive":2,"columnArticles":622,"formTitle":"[733]Flood Fill","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","submitted":125833,"title":"Flood Fill","titleSlug":"flood-fill"},{"acceptance":0.4793461453501215,"acs":2170,"articleLive":2,"columnArticles":39,"formTitle":"[734]Sentence Similarity","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4527,"title":"Sentence Similarity","titleSlug":"sentence-similarity"},{"acceptance":0.4091097383066477,"acs":22715,"articleLive":2,"columnArticles":290,"formTitle":"[735]Asteroid Collision","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"","submitted":55523,"title":"Asteroid Collision","titleSlug":"asteroid-collision"},{"acceptance":0.46799181525869626,"acs":1601,"articleLive":2,"columnArticles":46,"formTitle":"[736]Parse Lisp Expression","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3421,"title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression"},{"acceptance":0.46305644791188616,"acs":4036,"articleLive":2,"columnArticles":68,"formTitle":"[737]Sentence Similarity II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8716,"title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5014280218691349,"acs":43014,"articleLive":2,"columnArticles":606,"formTitle":"[738]Monotone Increasing Digits","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":85783,"title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6815469398064044,"acs":223972,"articleLive":2,"columnArticles":1593,"formTitle":"[739]Daily Temperatures","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"","submitted":328623,"title":"Daily Temperatures","titleSlug":"daily-temperatures"},{"acceptance":0.6285227348675563,"acs":56425,"articleLive":2,"columnArticles":634,"formTitle":"[740]Delete and Earn","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":89774,"title":"Delete and Earn","titleSlug":"delete-and-earn"},{"acceptance":0.3699432381295612,"acs":4106,"articleLive":2,"columnArticles":47,"formTitle":"[741]Cherry Pickup","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11099,"title":"Cherry Pickup","titleSlug":"cherry-pickup"},{"acceptance":0.49573690621193667,"acs":1628,"articleLive":2,"columnArticles":47,"formTitle":"[742]Closest Leaf in a Binary Tree","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3284,"title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5234640749739674,"acs":60324,"articleLive":2,"columnArticles":541,"formTitle":"[743]Network Delay Time","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","submitted":115240,"title":"Network Delay Time","titleSlug":"network-delay-time"},{"acceptance":0.45895378277475,"acs":42780,"articleLive":2,"columnArticles":385,"formTitle":"[744]Find Smallest Letter Greater Than Target","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":93212,"title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3995053371517834,"acs":3069,"articleLive":2,"columnArticles":57,"formTitle":"[745]Prefix and Suffix Search","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7682,"title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5941009647237528,"acs":147059,"articleLive":2,"columnArticles":1386,"formTitle":"[746]Min Cost Climbing Stairs","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":247532,"title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4185367880890431,"acs":46327,"articleLive":2,"columnArticles":420,"formTitle":"[747]Largest Number At Least Twice of Others","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":110688,"title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6006878282288423,"acs":12925,"articleLive":2,"columnArticles":185,"formTitle":"[748]Shortest Completing Word","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":21517,"title":"Shortest Completing Word","titleSlug":"shortest-completing-word"},{"acceptance":0.5015311330384484,"acs":1474,"articleLive":2,"columnArticles":33,"formTitle":"[749]Contain Virus","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2939,"title":"Contain Virus","titleSlug":"contain-virus"},{"acceptance":0.7209059233449477,"acs":2069,"articleLive":2,"columnArticles":43,"formTitle":"[750]Number Of Corner Rectangles","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2870,"title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.4994815070860698,"acs":1445,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP to CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2893,"title":"IP to CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5301551961233711,"acs":72864,"articleLive":2,"columnArticles":612,"formTitle":"[752]Open the Lock","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","submitted":137439,"title":"Open the Lock","titleSlug":"open-the-lock"},{"acceptance":0.5939929328621908,"acs":3362,"articleLive":2,"columnArticles":43,"formTitle":"[753]Cracking the Safe","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5660,"title":"Cracking the Safe","titleSlug":"cracking-the-safe"},{"acceptance":0.4315910636739392,"acs":8249,"articleLive":2,"columnArticles":96,"formTitle":"[754]Reach a Number","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19113,"title":"Reach a Number","titleSlug":"reach-a-number"},{"acceptance":0.4976129269188395,"acs":1355,"articleLive":2,"columnArticles":32,"formTitle":"[755]Pour Water","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2723,"title":"Pour Water","titleSlug":"pour-water"},{"acceptance":0.5612485276796231,"acs":4765,"articleLive":2,"columnArticles":69,"formTitle":"[756]Pyramid Transition Matrix","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8490,"title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.42141078838174273,"acs":2539,"articleLive":2,"columnArticles":38,"formTitle":"[757]Set Intersection Size At Least Two","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6025,"title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46419720881700793,"acs":3559,"articleLive":2,"columnArticles":70,"formTitle":"[758]Bold Words in String","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7667,"title":"Bold Words in String","titleSlug":"bold-words-in-string"},{"acceptance":0.6678795898114456,"acs":2019,"articleLive":2,"columnArticles":48,"formTitle":"[759]Employee Free Time","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":3023,"title":"Employee Free Time","titleSlug":"employee-free-time"},{"acceptance":0.8391608391608392,"acs":4080,"articleLive":2,"columnArticles":94,"formTitle":"[760]Find Anagram Mappings","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4862,"title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings"},{"acceptance":0.5913185913185913,"acs":2166,"articleLive":2,"columnArticles":36,"formTitle":"[761]Special Binary String","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3663,"title":"Special Binary String","titleSlug":"special-binary-string"},{"acceptance":0.7009220645062555,"acs":18320,"articleLive":2,"columnArticles":152,"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":26137,"title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7625492714469198,"acs":86088,"articleLive":2,"columnArticles":1029,"formTitle":"[763]Partition Labels","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":112895,"title":"Partition Labels","titleSlug":"partition-labels"},{"acceptance":0.49500172354360567,"acs":4308,"articleLive":2,"columnArticles":56,"formTitle":"[764]Largest Plus Sign","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8703,"title":"Largest Plus Sign","titleSlug":"largest-plus-sign"},{"acceptance":0.66484769870734,"acs":29728,"articleLive":2,"columnArticles":452,"formTitle":"[765]Couples Holding Hands","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":44714,"title":"Couples Holding Hands","titleSlug":"couples-holding-hands"},{"acceptance":0.7079070003039206,"acs":55902,"articleLive":2,"columnArticles":645,"formTitle":"[766]Toeplitz Matrix","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":78968,"title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"},{"acceptance":0.47771952817824376,"acs":40824,"articleLive":2,"columnArticles":502,"formTitle":"[767]Reorganize String","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":85456,"title":"Reorganize String","titleSlug":"reorganize-string"},{"acceptance":0.5090581342947273,"acs":5648,"articleLive":2,"columnArticles":84,"formTitle":"[768]Max Chunks To Make Sorted II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":11095,"title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5863328346387398,"acs":13325,"articleLive":2,"columnArticles":161,"formTitle":"[769]Max Chunks To Make Sorted","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":22726,"title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5576407506702413,"acs":1248,"articleLive":2,"columnArticles":26,"formTitle":"[770]Basic Calculator IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2238,"title":"Basic Calculator IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8511283057330425,"acs":155319,"articleLive":2,"columnArticles":1148,"formTitle":"[771]Jewels and Stones","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":182486,"title":"Jewels and Stones","titleSlug":"jewels-and-stones"},{"acceptance":0.49692225853028343,"acs":6539,"articleLive":2,"columnArticles":130,"formTitle":"[772]Basic Calculator III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":13159,"title":"Basic Calculator III","titleSlug":"basic-calculator-iii"},{"acceptance":0.711249182472204,"acs":23925,"articleLive":2,"columnArticles":343,"formTitle":"[773]Sliding Puzzle","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":33638,"title":"Sliding Puzzle","titleSlug":"sliding-puzzle"},{"acceptance":0.5887380593262946,"acs":1171,"articleLive":2,"columnArticles":22,"formTitle":"[774]Minimize Max Distance to Gas Station","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1989,"title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4594547053649956,"acs":5224,"articleLive":2,"columnArticles":84,"formTitle":"[775]Global and Local Inversions","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11370,"title":"Global and Local Inversions","titleSlug":"global-and-local-inversions"},{"acceptance":0.5652039555006181,"acs":1829,"articleLive":2,"columnArticles":39,"formTitle":"[776]Split BST","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3236,"title":"Split BST","titleSlug":"split-bst"},{"acceptance":0.3251093417068521,"acs":5798,"articleLive":2,"columnArticles":64,"formTitle":"[777]Swap Adjacent in LR String","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17834,"title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5932495264336146,"acs":24115,"articleLive":2,"columnArticles":352,"formTitle":"[778]Swim in Rising Water","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":40649,"title":"Swim in Rising Water","titleSlug":"swim-in-rising-water"},{"acceptance":0.43618516503445776,"acs":19241,"articleLive":2,"columnArticles":240,"formTitle":"[779]K-th Symbol in Grammar","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44112,"title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2868576242628475,"acs":3405,"articleLive":2,"columnArticles":53,"formTitle":"[780]Reaching Points","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11870,"title":"Reaching Points","titleSlug":"reaching-points"},{"acceptance":0.6151959753927215,"acs":43901,"articleLive":2,"columnArticles":671,"formTitle":"[781]Rabbits in Forest","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":71361,"title":"Rabbits in Forest","titleSlug":"rabbits-in-forest"},{"acceptance":0.4117647058823529,"acs":1547,"articleLive":2,"columnArticles":32,"formTitle":"[782]Transform to Chessboard","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3757,"title":"Transform to Chessboard","titleSlug":"transform-to-chessboard"},{"acceptance":0.59632803555795,"acs":70839,"articleLive":2,"columnArticles":688,"formTitle":"[783]Minimum Distance Between BST Nodes","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"","submitted":118792,"title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6899533291392957,"acs":47159,"articleLive":2,"columnArticles":532,"formTitle":"[784]Letter Case Permutation","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":68351,"title":"Letter Case Permutation","titleSlug":"letter-case-permutation"},{"acceptance":0.5145822914506666,"acs":42187,"articleLive":2,"columnArticles":422,"formTitle":"[785]Is Graph Bipartite?","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","submitted":81983,"title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite"},{"acceptance":0.47948141005035894,"acs":4475,"articleLive":2,"columnArticles":58,"formTitle":"[786]K-th Smallest Prime Fraction","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9333,"title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.390094175717455,"acs":43783,"articleLive":2,"columnArticles":418,"formTitle":"[787]Cheapest Flights Within K Stops","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":112237,"title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6087934293722704,"acs":18679,"articleLive":2,"columnArticles":193,"formTitle":"[788]Rotated Digits","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30682,"title":"Rotated Digits","titleSlug":"rotated-digits"},{"acceptance":0.6921559602866724,"acs":21054,"articleLive":2,"columnArticles":300,"formTitle":"[789]Escape The Ghosts","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","submitted":30418,"title":"Escape The Ghosts","titleSlug":"escape-the-ghosts"},{"acceptance":0.45017258657165127,"acs":4043,"articleLive":2,"columnArticles":70,"formTitle":"[790]Domino and Tromino Tiling","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8981,"title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6953777829720096,"acs":11900,"articleLive":2,"columnArticles":210,"formTitle":"[791]Custom Sort String","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17113,"title":"Custom Sort String","titleSlug":"custom-sort-string"},{"acceptance":0.4662513990948465,"acs":9581,"articleLive":2,"columnArticles":104,"formTitle":"[792]Number of Matching Subsequences","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":20549,"title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39329517579721995,"acs":5291,"articleLive":2,"columnArticles":70,"formTitle":"[793]Preimage Size of Factorial Zeroes Function","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":13453,"title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3417456268221574,"acs":7502,"articleLive":2,"columnArticles":107,"formTitle":"[794]Valid Tic-Tac-Toe State","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21952,"title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5312264388037196,"acs":8455,"articleLive":2,"columnArticles":93,"formTitle":"[795]Number of Subarrays with Bounded Maximum","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15916,"title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5353347047227222,"acs":24983,"articleLive":2,"columnArticles":308,"formTitle":"[796]Rotate String","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":46668,"title":"Rotate String","titleSlug":"rotate-string"},{"acceptance":0.7910417304356698,"acs":46518,"articleLive":2,"columnArticles":573,"formTitle":"[797]All Paths From Source to Target","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","submitted":58806,"title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46833013435700577,"acs":1464,"articleLive":2,"columnArticles":36,"formTitle":"[798]Smallest Rotation with Highest Score","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3126,"title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.41002075303883784,"acs":5532,"articleLive":2,"columnArticles":71,"formTitle":"[799]Champagne Tower","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13492,"title":"Champagne Tower","titleSlug":"champagne-tower"},{"acceptance":0.7094499294781382,"acs":1509,"articleLive":2,"columnArticles":36,"formTitle":"[800]Similar RGB Color","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2127,"title":"Similar RGB Color","titleSlug":"similar-rgb-color"},{"acceptance":0.4194927169450537,"acs":7459,"articleLive":2,"columnArticles":88,"formTitle":"[801]Minimum Swaps To Make Sequences Increasing","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17781,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5767710109180602,"acs":31802,"articleLive":2,"columnArticles":335,"formTitle":"[802]Find Eventual Safe States","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","submitted":55138,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4802168021680217,"acs":12404,"articleLive":2,"columnArticles":125,"formTitle":"[803]Bricks Falling When Hit","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25830,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7728018623110975,"acs":40501,"articleLive":2,"columnArticles":412,"formTitle":"[804]Unique Morse Code Words","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":52408,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"},{"acceptance":0.2911020065132892,"acs":2771,"articleLive":2,"columnArticles":41,"formTitle":"[805]Split Array With Same Average","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9519,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"},{"acceptance":0.6556654634100605,"acs":13986,"articleLive":2,"columnArticles":161,"formTitle":"[806]Number of Lines To Write String","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":21331,"title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8469326980345444,"acs":17064,"articleLive":2,"columnArticles":233,"formTitle":"[807]Max Increase to Keep City Skyline","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":20148,"title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4810948982852274,"acs":4517,"articleLive":2,"columnArticles":43,"formTitle":"[808]Soup Servings","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9389,"title":"Soup Servings","titleSlug":"soup-servings"},{"acceptance":0.4197520661157025,"acs":5079,"articleLive":2,"columnArticles":93,"formTitle":"[809]Expressive Words","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12100,"title":"Expressive Words","titleSlug":"expressive-words"},{"acceptance":0.732241394411842,"acs":16720,"articleLive":2,"columnArticles":135,"formTitle":"[810]Chalkboard XOR Game","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","submitted":22834,"title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7050530860390326,"acs":16004,"articleLive":2,"columnArticles":202,"formTitle":"[811]Subdomain Visit Count","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22699,"title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"},{"acceptance":0.6306849927366186,"acs":11288,"articleLive":2,"columnArticles":104,"formTitle":"[812]Largest Triangle Area","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17898,"title":"Largest Triangle Area","titleSlug":"largest-triangle-area"},{"acceptance":0.5510497991359053,"acs":7270,"articleLive":2,"columnArticles":86,"formTitle":"[813]Largest Sum of Averages","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13193,"title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999852616064849,"acs":23747,"articleLive":2,"columnArticles":371,"formTitle":"[814]Binary Tree Pruning","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":33925,"title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning"},{"acceptance":0.43306000095164077,"acs":27304,"articleLive":2,"columnArticles":321,"formTitle":"[815]Bus Routes","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","submitted":63049,"title":"Bus Routes","titleSlug":"bus-routes"},{"acceptance":0.5134089024053082,"acs":3714,"articleLive":2,"columnArticles":66,"formTitle":"[816]Ambiguous Coordinates","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7234,"title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5924721984602224,"acs":13852,"articleLive":2,"columnArticles":171,"formTitle":"[817]Linked List Components","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"","submitted":23380,"title":"Linked List Components","titleSlug":"linked-list-components"},{"acceptance":0.4331823986996401,"acs":3731,"articleLive":2,"columnArticles":45,"formTitle":"[818]Race Car","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8613,"title":"Race Car","titleSlug":"race-car"},{"acceptance":0.4210497135464794,"acs":22783,"articleLive":2,"columnArticles":260,"formTitle":"[819]Most Common Word","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":54110,"title":"Most Common Word","titleSlug":"most-common-word"},{"acceptance":0.5089259054840256,"acs":56247,"articleLive":2,"columnArticles":616,"formTitle":"[820]Short Encoding of Words","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":110521,"title":"Short Encoding of Words","titleSlug":"short-encoding-of-words"},{"acceptance":0.6929192480523279,"acs":26060,"articleLive":2,"columnArticles":352,"formTitle":"[821]Shortest Distance to a Character","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":37609,"title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5041974479516454,"acs":3003,"articleLive":2,"columnArticles":42,"formTitle":"[822]Card Flipping Game","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5956,"title":"Card Flipping Game","titleSlug":"card-flipping-game"},{"acceptance":0.4285119378123265,"acs":3087,"articleLive":2,"columnArticles":55,"formTitle":"[823]Binary Trees With Factors","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7204,"title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6155726380672358,"acs":17377,"articleLive":2,"columnArticles":244,"formTitle":"[824]Goat Latin","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28229,"title":"Goat Latin","titleSlug":"goat-latin"},{"acceptance":0.39381280343231345,"acs":6976,"articleLive":2,"columnArticles":95,"formTitle":"[825]Friends Of Appropriate Ages","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17714,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37704317567876927,"acs":8235,"articleLive":2,"columnArticles":120,"formTitle":"[826]Most Profit Assigning Work","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":21841,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3891545788704004,"acs":9846,"articleLive":2,"columnArticles":189,"formTitle":"[827]Making A Large Island","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":25301,"title":"Making A Large Island","titleSlug":"making-a-large-island"},{"acceptance":0.49548482605477423,"acs":3347,"articleLive":2,"columnArticles":55,"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":6755,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3668895643363728,"acs":9053,"articleLive":2,"columnArticles":106,"formTitle":"[829]Consecutive Numbers Sum","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":24675,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5430068011718305,"acs":52455,"articleLive":2,"columnArticles":590,"formTitle":"[830]Positions of Large Groups","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":96601,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"},{"acceptance":0.4069005295999161,"acs":7760,"articleLive":2,"columnArticles":74,"formTitle":"[831]Masking Personal Information","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19071,"title":"Masking Personal Information","titleSlug":"masking-personal-information"},{"acceptance":0.7959718986738081,"acs":86788,"articleLive":2,"columnArticles":936,"formTitle":"[832]Flipping an Image","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":109034,"title":"Flipping an Image","titleSlug":"flipping-an-image"},{"acceptance":0.4336325745431228,"acs":5410,"articleLive":2,"columnArticles":81,"formTitle":"[833]Find And Replace in String","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12476,"title":"Find And Replace in String","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5277626565051715,"acs":13573,"articleLive":2,"columnArticles":133,"formTitle":"[834]Sum of Distances in Tree","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25718,"title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5750130005200208,"acs":4423,"articleLive":2,"columnArticles":50,"formTitle":"[835]Image Overlap","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7692,"title":"Image Overlap","titleSlug":"image-overlap"},{"acceptance":0.480064095341821,"acs":38348,"articleLive":2,"columnArticles":663,"formTitle":"[836]Rectangle Overlap","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":79881,"title":"Rectangle Overlap","titleSlug":"rectangle-overlap"},{"acceptance":0.39661414615400176,"acs":19609,"articleLive":2,"columnArticles":246,"formTitle":"[837]New 21 Game","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49441,"title":"New 21 Game","titleSlug":"new-21-game"},{"acceptance":0.500499367467874,"acs":7517,"articleLive":2,"columnArticles":130,"formTitle":"[838]Push Dominoes","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15019,"title":"Push Dominoes","titleSlug":"push-dominoes"},{"acceptance":0.5741536091940405,"acs":19384,"articleLive":2,"columnArticles":275,"formTitle":"[839]Similar String Groups","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33761,"title":"Similar String Groups","titleSlug":"similar-string-groups"},{"acceptance":0.3606306022959585,"acs":9173,"articleLive":2,"columnArticles":115,"formTitle":"[840]Magic Squares In Grid","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25436,"title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6585298228994582,"acs":57003,"articleLive":2,"columnArticles":562,"formTitle":"[841]Keys and Rooms","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","submitted":86561,"title":"Keys and Rooms","titleSlug":"keys-and-rooms"},{"acceptance":0.4876012016905138,"acs":28728,"articleLive":2,"columnArticles":323,"formTitle":"[842]Split Array into Fibonacci Sequence","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58917,"title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3824830817282665,"acs":2939,"articleLive":2,"columnArticles":35,"formTitle":"[843]Guess the Word","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7684,"title":"Guess the Word","titleSlug":"guess-the-word"},{"acceptance":0.5091197672813751,"acs":95909,"articleLive":2,"columnArticles":1040,"formTitle":"[844]Backspace String Compare","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"","submitted":188382,"title":"Backspace String Compare","titleSlug":"backspace-string-compare"},{"acceptance":0.42139903250222127,"acs":38416,"articleLive":2,"columnArticles":567,"formTitle":"[845]Longest Mountain in Array","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":91163,"title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5131037592289918,"acs":9104,"articleLive":2,"columnArticles":128,"formTitle":"[846]Hand of Straights","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17743,"title":"Hand of Straights","titleSlug":"hand-of-straights"},{"acceptance":0.6795000358140534,"acs":18973,"articleLive":2,"columnArticles":159,"formTitle":"[847]Shortest Path Visiting All Nodes","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","submitted":27922,"title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4491606257153758,"acs":9418,"articleLive":2,"columnArticles":101,"formTitle":"[848]Shifting Letters","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20968,"title":"Shifting Letters","titleSlug":"shifting-letters"},{"acceptance":0.4272708246128087,"acs":16332,"articleLive":2,"columnArticles":194,"formTitle":"[849]Maximize Distance to Closest Person","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38224,"title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44971570717839376,"acs":2531,"articleLive":2,"columnArticles":43,"formTitle":"[850]Rectangle Area II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5628,"title":"Rectangle Area II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4883299584354684,"acs":4582,"articleLive":2,"columnArticles":76,"formTitle":"[851]Loud and Rich","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9383,"title":"Loud and Rich","titleSlug":"loud-and-rich"},{"acceptance":0.7153516989715352,"acs":87431,"articleLive":2,"columnArticles":759,"formTitle":"[852]Peak Index in a Mountain Array","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","submitted":122221,"title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38628678322181453,"acs":10738,"articleLive":2,"columnArticles":132,"formTitle":"[853]Car Fleet","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":27798,"title":"Car Fleet","titleSlug":"car-fleet"},{"acceptance":0.3604368932038835,"acs":4455,"articleLive":2,"columnArticles":71,"formTitle":"[854]K-Similar Strings","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12360,"title":"K-Similar Strings","titleSlug":"k-similar-strings"},{"acceptance":0.4093774625689519,"acs":5195,"articleLive":2,"columnArticles":60,"formTitle":"[855]Exam Room","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":12690,"title":"Exam Room","titleSlug":"exam-room"},{"acceptance":0.6283013205282113,"acs":16748,"articleLive":2,"columnArticles":223,"formTitle":"[856]Score of Parentheses","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"","submitted":26656,"title":"Score of Parentheses","titleSlug":"score-of-parentheses"},{"acceptance":0.4690660321237359,"acs":3154,"articleLive":2,"columnArticles":50,"formTitle":"[857]Minimum Cost to Hire K Workers","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6724,"title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5541270728526179,"acs":2974,"articleLive":2,"columnArticles":50,"formTitle":"[858]Mirror Reflection","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5367,"title":"Mirror Reflection","titleSlug":"mirror-reflection"},{"acceptance":0.3044073965611011,"acs":29105,"articleLive":2,"columnArticles":387,"formTitle":"[859]Buddy Strings","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":95612,"title":"Buddy Strings","titleSlug":"buddy-strings"},{"acceptance":0.5869307601151177,"acs":93609,"articleLive":2,"columnArticles":805,"formTitle":"[860]Lemonade Change","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":159489,"title":"Lemonade Change","titleSlug":"lemonade-change"},{"acceptance":0.8089097303634232,"acs":31740,"articleLive":2,"columnArticles":447,"formTitle":"[861]Score After Flipping Matrix","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":39238,"title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19515307588839198,"acs":16975,"articleLive":2,"columnArticles":134,"formTitle":"[862]Shortest Subarray with Sum at Least K","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":86983,"title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6040187164000796,"acs":36403,"articleLive":2,"columnArticles":569,"formTitle":"[863]All Nodes Distance K in Binary Tree","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","submitted":60268,"title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45771578029642546,"acs":3150,"articleLive":2,"columnArticles":45,"formTitle":"[864]Shortest Path to Get All Keys","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6882,"title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6619316203606991,"acs":9506,"articleLive":2,"columnArticles":135,"formTitle":"[865]Smallest Subtree with all the Deepest Nodes","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14361,"title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22471812411234457,"acs":7753,"articleLive":2,"columnArticles":91,"formTitle":"[866]Prime Palindrome","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":34501,"title":"Prime Palindrome","titleSlug":"prime-palindrome"},{"acceptance":0.6697144031230737,"acs":84747,"articleLive":2,"columnArticles":762,"formTitle":"[867]Transpose Matrix","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":126542,"title":"Transpose Matrix","titleSlug":"transpose-matrix"},{"acceptance":0.6246281975014872,"acs":16800,"articleLive":2,"columnArticles":243,"formTitle":"[868]Binary Gap","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26896,"title":"Binary Gap","titleSlug":"binary-gap"},{"acceptance":0.6431600221922803,"acs":32459,"articleLive":2,"columnArticles":459,"formTitle":"[869]Reordered Power of 2","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":50468,"title":"Reordered Power of 2","titleSlug":"reordered-power-of-2"},{"acceptance":0.43325604504802917,"acs":15696,"articleLive":2,"columnArticles":204,"formTitle":"[870]Advantage Shuffle","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","submitted":36228,"title":"Advantage Shuffle","titleSlug":"advantage-shuffle"},{"acceptance":0.34376605143307193,"acs":10039,"articleLive":2,"columnArticles":133,"formTitle":"[871]Minimum Number of Refueling Stops","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":29203,"title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519727486894327,"acs":61438,"articleLive":2,"columnArticles":734,"formTitle":"[872]Leaf-Similar Trees","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","submitted":94234,"title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees"},{"acceptance":0.5158503292114983,"acs":16061,"articleLive":2,"columnArticles":117,"formTitle":"[873]Length of Longest Fibonacci Subsequence","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":31135,"title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41759566729917774,"acs":21127,"articleLive":2,"columnArticles":236,"formTitle":"[874]Walking Robot Simulation","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":50592,"title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation"},{"acceptance":0.48097313796095875,"acs":48219,"articleLive":2,"columnArticles":383,"formTitle":"[875]Koko Eating Bananas","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":100253,"title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas"},{"acceptance":0.7060910978864512,"acs":166939,"articleLive":2,"columnArticles":1771,"formTitle":"[876]Middle of the Linked List","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"","submitted":236427,"title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7575359708327004,"acs":69813,"articleLive":2,"columnArticles":493,"formTitle":"[877]Stone Game","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","submitted":92158,"title":"Stone Game","titleSlug":"stone-game"},{"acceptance":0.28168926094833513,"acs":4509,"articleLive":2,"columnArticles":64,"formTitle":"[878]Nth Magical Number","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16007,"title":"Nth Magical Number","titleSlug":"nth-magical-number"},{"acceptance":0.5534599177539727,"acs":21803,"articleLive":2,"columnArticles":185,"formTitle":"[879]Profitable Schemes","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","submitted":39394,"title":"Profitable Schemes","titleSlug":"profitable-schemes"},{"acceptance":0.2540524973257632,"acs":6175,"articleLive":2,"columnArticles":81,"formTitle":"[880]Decoded String at Index","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"","submitted":24306,"title":"Decoded String at Index","titleSlug":"decoded-string-at-index"},{"acceptance":0.5376068091158595,"acs":48383,"articleLive":2,"columnArticles":589,"formTitle":"[881]Boats to Save People","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":89997,"title":"Boats to Save People","titleSlug":"boats-to-save-people"},{"acceptance":0.48813472824700177,"acs":1913,"articleLive":2,"columnArticles":32,"formTitle":"[882]Reachable Nodes In Subdivided Graph","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3919,"title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6913290513833992,"acs":11194,"articleLive":2,"columnArticles":117,"formTitle":"[883]Projection Area of 3D Shapes","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16192,"title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6620986558874757,"acs":20147,"articleLive":2,"columnArticles":263,"formTitle":"[884]Uncommon Words from Two Sentences","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":30429,"title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6965342349957735,"acs":4944,"articleLive":2,"columnArticles":74,"formTitle":"[885]Spiral Matrix III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7098,"title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4344137581262391,"acs":9422,"articleLive":2,"columnArticles":126,"formTitle":"[886]Possible Bipartition","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":21689,"title":"Possible Bipartition","titleSlug":"possible-bipartition"},{"acceptance":0.2909696226852619,"acs":52701,"articleLive":2,"columnArticles":350,"formTitle":"[887]Super Egg Drop","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":181122,"title":"Super Egg Drop","titleSlug":"super-egg-drop"},{"acceptance":0.6405945053295301,"acs":55471,"articleLive":2,"columnArticles":465,"formTitle":"[888]Fair Candy Swap","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":86593,"title":"Fair Candy Swap","titleSlug":"fair-candy-swap"},{"acceptance":0.6764693561224917,"acs":16148,"articleLive":2,"columnArticles":157,"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":23871,"title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7264523406655387,"acs":9016,"articleLive":2,"columnArticles":128,"formTitle":"[890]Find and Replace Pattern","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12411,"title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33072118114707555,"acs":2912,"articleLive":2,"columnArticles":39,"formTitle":"[891]Sum of Subsequence Widths","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8805,"title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6381411594973233,"acs":33616,"articleLive":2,"columnArticles":686,"formTitle":"[892]Surface Area of 3D Shapes","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52678,"title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7254485049833888,"acs":10918,"articleLive":2,"columnArticles":108,"formTitle":"[893]Groups of Special-Equivalent Strings","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15050,"title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.775824677548225,"acs":13594,"articleLive":2,"columnArticles":127,"formTitle":"[894]All Possible Full Binary Trees","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17522,"title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5537379824939016,"acs":7718,"articleLive":2,"columnArticles":88,"formTitle":"[895]Maximum Frequency Stack","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13938,"title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5852443536575965,"acs":60739,"articleLive":2,"columnArticles":728,"formTitle":"[896]Monotonic Array","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":103784,"title":"Monotonic Array","titleSlug":"monotonic-array"},{"acceptance":0.743433726448339,"acs":63290,"articleLive":2,"columnArticles":729,"formTitle":"[897]Increasing Order Search Tree","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"","submitted":85132,"title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33835046500244736,"acs":5530,"articleLive":2,"columnArticles":38,"formTitle":"[898]Bitwise ORs of Subarrays","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16344,"title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5396254495845219,"acs":4351,"articleLive":2,"columnArticles":51,"formTitle":"[899]Orderly Queue","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8063,"title":"Orderly Queue","titleSlug":"orderly-queue"},{"acceptance":0.49679576483700194,"acs":3566,"articleLive":2,"columnArticles":53,"formTitle":"[900]RLE Iterator","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7178,"title":"RLE Iterator","titleSlug":"rle-iterator"},{"acceptance":0.547739651416122,"acs":20113,"articleLive":2,"columnArticles":245,"formTitle":"[901]Online Stock Span","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"","submitted":36720,"title":"Online Stock Span","titleSlug":"online-stock-span"},{"acceptance":0.3333333333333333,"acs":3478,"articleLive":2,"columnArticles":81,"formTitle":"[902]Numbers At Most N Given Digit Set","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10434,"title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5343783398646241,"acs":3000,"articleLive":2,"columnArticles":43,"formTitle":"[903]Valid Permutations for DI Sequence","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5614,"title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45134591435961297,"acs":23558,"articleLive":2,"columnArticles":318,"formTitle":"[904]Fruit Into Baskets","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":52195,"title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets"},{"acceptance":0.7001668350682614,"acs":59594,"articleLive":2,"columnArticles":621,"formTitle":"[905]Sort Array By Parity","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":85114,"title":"Sort Array By Parity","titleSlug":"sort-array-by-parity"},{"acceptance":0.2799208704253215,"acs":2264,"articleLive":2,"columnArticles":41,"formTitle":"[906]Super Palindromes","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8088,"title":"Super Palindromes","titleSlug":"super-palindromes"},{"acceptance":0.3205649988029686,"acs":12051,"articleLive":2,"columnArticles":134,"formTitle":"[907]Sum of Subarray Minimums","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"","submitted":37593,"title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6984601390422974,"acs":21500,"articleLive":2,"columnArticles":200,"formTitle":"[908]Smallest Range I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":30782,"title":"Smallest Range I","titleSlug":"smallest-range-i"},{"acceptance":0.4592663172939495,"acs":16388,"articleLive":2,"columnArticles":197,"formTitle":"[909]Snakes and Ladders","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","submitted":35683,"title":"Snakes and Ladders","titleSlug":"snakes-and-ladders"},{"acceptance":0.32029121653358383,"acs":6819,"articleLive":2,"columnArticles":71,"formTitle":"[910]Smallest Range II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21290,"title":"Smallest Range II","titleSlug":"smallest-range-ii"},{"acceptance":0.42822966507177035,"acs":4833,"articleLive":2,"columnArticles":72,"formTitle":"[911]Online Election","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":11286,"title":"Online Election","titleSlug":"online-election"},{"acceptance":0.558413263845661,"acs":245799,"articleLive":2,"columnArticles":1116,"formTitle":"[912]Sort an Array","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","submitted":440174,"title":"Sort an Array","titleSlug":"sort-an-array"},{"acceptance":0.4004460665044607,"acs":1975,"articleLive":2,"columnArticles":34,"formTitle":"[913]Cat and Mouse","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4932,"title":"Cat and Mouse","titleSlug":"cat-and-mouse"},{"acceptance":0.3888332185131834,"acs":49668,"articleLive":2,"columnArticles":627,"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":127736,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4694161038463381,"acs":9800,"articleLive":2,"columnArticles":122,"formTitle":"[915]Partition Array into Disjoint Intervals","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20877,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4449306584085095,"acs":6609,"articleLive":2,"columnArticles":77,"formTitle":"[916]Word Subsets","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14854,"title":"Word Subsets","titleSlug":"word-subsets"},{"acceptance":0.5683252359412521,"acs":30531,"articleLive":2,"columnArticles":449,"formTitle":"[917]Reverse Only Letters","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":53721,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters"},{"acceptance":0.3568479414887342,"acs":24200,"articleLive":2,"columnArticles":249,"formTitle":"[918]Maximum Sum Circular Subarray","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":67816,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6411056620597414,"acs":5752,"articleLive":2,"columnArticles":106,"formTitle":"[919]Complete Binary Tree Inserter","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8972,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.483092988562904,"acs":1943,"articleLive":2,"columnArticles":20,"formTitle":"[920]Number of Music Playlists","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4022,"title":"Number of Music Playlists","titleSlug":"number-of-music-playlists"},{"acceptance":0.741285458295297,"acs":21925,"articleLive":2,"columnArticles":326,"formTitle":"[921]Minimum Add to Make Parentheses Valid","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"","submitted":29577,"title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140540921587518,"acs":91164,"articleLive":2,"columnArticles":842,"formTitle":"[922]Sort Array By Parity II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"","submitted":127671,"title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.34111855886049436,"acs":6514,"articleLive":2,"columnArticles":87,"formTitle":"[923]3Sum With Multiplicity","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19096,"title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35856573705179284,"acs":6570,"articleLive":2,"columnArticles":94,"formTitle":"[924]Minimize Malware Spread","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":18323,"title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread"},{"acceptance":0.3875462924394696,"acs":51172,"articleLive":2,"columnArticles":689,"formTitle":"[925]Long Pressed Name","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":132041,"title":"Long Pressed Name","titleSlug":"long-pressed-name"},{"acceptance":0.5286987001606543,"acs":7240,"articleLive":2,"columnArticles":131,"formTitle":"[926]Flip String to Monotone Increasing","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13694,"title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3385436523065192,"acs":3552,"articleLive":2,"columnArticles":72,"formTitle":"[927]Three Equal Parts","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10492,"title":"Three Equal Parts","titleSlug":"three-equal-parts"},{"acceptance":0.42168011738811445,"acs":2299,"articleLive":2,"columnArticles":43,"formTitle":"[928]Minimize Malware Spread II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5452,"title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6446732867475787,"acs":26293,"articleLive":2,"columnArticles":235,"formTitle":"[929]Unique Email Addresses","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40785,"title":"Unique Email Addresses","titleSlug":"unique-email-addresses"},{"acceptance":0.5448765598064179,"acs":34452,"articleLive":2,"columnArticles":350,"formTitle":"[930]Binary Subarrays With Sum","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","submitted":63229,"title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.668088615874641,"acs":23492,"articleLive":2,"columnArticles":299,"formTitle":"[931]Minimum Falling Path Sum","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":35163,"title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6358073009321853,"acs":8935,"articleLive":2,"columnArticles":83,"formTitle":"[932]Beautiful Array","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14053,"title":"Beautiful Array","titleSlug":"beautiful-array"},{"acceptance":0.725257642927054,"acs":37791,"articleLive":2,"columnArticles":328,"formTitle":"[933]Number of Recent Calls","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":52107,"title":"Number of Recent Calls","titleSlug":"number-of-recent-calls"},{"acceptance":0.4713115525845024,"acs":25029,"articleLive":2,"columnArticles":283,"formTitle":"[934]Shortest Bridge","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":53105,"title":"Shortest Bridge","titleSlug":"shortest-bridge"},{"acceptance":0.47739261492087415,"acs":6335,"articleLive":2,"columnArticles":84,"formTitle":"[935]Knight Dialer","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13270,"title":"Knight Dialer","titleSlug":"knight-dialer"},{"acceptance":0.37994785494192934,"acs":1603,"articleLive":2,"columnArticles":28,"formTitle":"[936]Stamping The Sequence","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4219,"title":"Stamping The Sequence","titleSlug":"stamping-the-sequence"},{"acceptance":0.588105520090124,"acs":12529,"articleLive":2,"columnArticles":132,"formTitle":"[937]Reorder Data in Log Files","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":21304,"title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.819219144619716,"acs":98933,"articleLive":2,"columnArticles":815,"formTitle":"[938]Range Sum of BST","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"","submitted":120765,"title":"Range Sum of BST","titleSlug":"range-sum-of-bst"},{"acceptance":0.4558719141888162,"acs":5780,"articleLive":2,"columnArticles":64,"formTitle":"[939]Minimum Area Rectangle","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12679,"title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4216503267973856,"acs":5161,"articleLive":2,"columnArticles":67,"formTitle":"[940]Distinct Subsequences II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":12240,"title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39270497376809876,"acs":62951,"articleLive":2,"columnArticles":626,"formTitle":"[941]Valid Mountain Array","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":160301,"title":"Valid Mountain Array","titleSlug":"valid-mountain-array"},{"acceptance":0.7303218911102729,"acs":23233,"articleLive":2,"columnArticles":221,"formTitle":"[942]DI String Match","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31812,"title":"DI String Match","titleSlug":"di-string-match"},{"acceptance":0.45519962859795726,"acs":1961,"articleLive":2,"columnArticles":45,"formTitle":"[943]Find the Shortest Superstring","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4308,"title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6877734796118967,"acs":21691,"articleLive":2,"columnArticles":185,"formTitle":"[944]Delete Columns to Make Sorted","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":31538,"title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4847917200113203,"acs":35973,"articleLive":2,"columnArticles":542,"formTitle":"[945]Minimum Increment to Make Array Unique","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":74203,"title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6262775983363568,"acs":28309,"articleLive":2,"columnArticles":319,"formTitle":"[946]Validate Stack Sequences","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"","submitted":45202,"title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences"},{"acceptance":0.6124009453635479,"acs":26430,"articleLive":2,"columnArticles":342,"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":43158,"title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39243565246712375,"acs":6983,"articleLive":2,"columnArticles":102,"formTitle":"[948]Bag of Tokens","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17794,"title":"Bag of Tokens","titleSlug":"bag-of-tokens"},{"acceptance":0.3718521087079017,"acs":8579,"articleLive":2,"columnArticles":122,"formTitle":"[949]Largest Time for Given Digits","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23071,"title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7762753534111863,"acs":10104,"articleLive":2,"columnArticles":157,"formTitle":"[950]Reveal Cards In Increasing Order","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13016,"title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6652873563218391,"acs":11576,"articleLive":2,"columnArticles":175,"formTitle":"[951]Flip Equivalent Binary Trees","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":17400,"title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3550276243093923,"acs":3213,"articleLive":2,"columnArticles":62,"formTitle":"[952]Largest Component Size by Common Factor","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9050,"title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5512606290148899,"acs":14846,"articleLive":2,"columnArticles":176,"formTitle":"[953]Verifying an Alien Dictionary","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":26931,"title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30229665865185307,"acs":7292,"articleLive":2,"columnArticles":107,"formTitle":"[954]Array of Doubled Pairs","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24122,"title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.33021868787276343,"acs":3322,"articleLive":2,"columnArticles":52,"formTitle":"[955]Delete Columns to Make Sorted II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10060,"title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4389421557264777,"acs":4166,"articleLive":2,"columnArticles":52,"formTitle":"[956]Tallest Billboard","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9491,"title":"Tallest Billboard","titleSlug":"tallest-billboard"},{"acceptance":0.36025723792024633,"acs":14509,"articleLive":2,"columnArticles":142,"formTitle":"[957]Prison Cells After N Days","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":40274,"title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5367379690007517,"acs":26422,"articleLive":2,"columnArticles":251,"formTitle":"[958]Check Completeness of a Binary Tree","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":49227,"title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7431921189646776,"acs":19841,"articleLive":2,"columnArticles":306,"formTitle":"[959]Regions Cut By Slashes","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26697,"title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5565757493923845,"acs":2061,"articleLive":2,"columnArticles":34,"formTitle":"[960]Delete Columns to Make Sorted III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3703,"title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6764531382031966,"acs":37625,"articleLive":2,"columnArticles":318,"formTitle":"[961]N-Repeated Element in Size 2N Array","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":55621,"title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4453593990633938,"acs":14170,"articleLive":2,"columnArticles":141,"formTitle":"[962]Maximum Width Ramp","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":31817,"title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp"},{"acceptance":0.5078230635503187,"acs":2629,"articleLive":2,"columnArticles":33,"formTitle":"[963]Minimum Area Rectangle II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5177,"title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43829296424452135,"acs":1520,"articleLive":2,"columnArticles":28,"formTitle":"[964]Least Operators to Express Number","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3468,"title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6838684027432661,"acs":34402,"articleLive":2,"columnArticles":408,"formTitle":"[965]Univalued Binary Tree","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":50305,"title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree"},{"acceptance":0.40550928891736066,"acs":3165,"articleLive":2,"columnArticles":51,"formTitle":"[966]Vowel Spellchecker","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7805,"title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"},{"acceptance":0.46773436583362665,"acs":7973,"articleLive":2,"columnArticles":161,"formTitle":"[967]Numbers With Same Consecutive Differences","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17046,"title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5,"acs":26191,"articleLive":2,"columnArticles":343,"formTitle":"[968]Binary Tree Cameras","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":52382,"title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras"},{"acceptance":0.6482461137787906,"acs":15930,"articleLive":2,"columnArticles":201,"formTitle":"[969]Pancake Sorting","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":24574,"title":"Pancake Sorting","titleSlug":"pancake-sorting"},{"acceptance":0.41344217886297907,"acs":11294,"articleLive":2,"columnArticles":129,"formTitle":"[970]Powerful Integers","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27317,"title":"Powerful Integers","titleSlug":"powerful-integers"},{"acceptance":0.4436416184971098,"acs":7061,"articleLive":2,"columnArticles":111,"formTitle":"[971]Flip Binary Tree To Match Preorder Traversal","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15916,"title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40675883256528417,"acs":1324,"articleLive":2,"columnArticles":28,"formTitle":"[972]Equal Rational Numbers","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3255,"title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers"},{"acceptance":0.6416964005102512,"acs":69420,"articleLive":2,"columnArticles":648,"formTitle":"[973]K Closest Points to Origin","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","submitted":108182,"title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4666819409608335,"acs":38701,"articleLive":2,"columnArticles":396,"formTitle":"[974]Subarray Sums Divisible by K","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":82928,"title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44753388291183455,"acs":3203,"articleLive":2,"columnArticles":47,"formTitle":"[975]Odd Even Jump","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7157,"title":"Odd Even Jump","titleSlug":"odd-even-jump"},{"acceptance":0.5972252686992762,"acs":54455,"articleLive":2,"columnArticles":512,"formTitle":"[976]Largest Perimeter Triangle","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":91180,"title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7057858036960749,"acs":195653,"articleLive":2,"columnArticles":1492,"formTitle":"[977]Squares of a Sorted Array","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","submitted":277213,"title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47317941525515156,"acs":43859,"articleLive":2,"columnArticles":605,"formTitle":"[978]Longest Turbulent Subarray","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":92690,"title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7135522777279766,"acs":8756,"articleLive":2,"columnArticles":139,"formTitle":"[979]Distribute Coins in Binary Tree","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12271,"title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7359539408378003,"acs":14828,"articleLive":2,"columnArticles":223,"formTitle":"[980]Unique Paths III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20148,"title":"Unique Paths III","titleSlug":"unique-paths-iii"},{"acceptance":0.5315180993816147,"acs":21746,"articleLive":2,"columnArticles":318,"formTitle":"[981]Time Based Key-Value Store","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","submitted":40913,"title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store"},{"acceptance":0.5482191210164549,"acs":2632,"articleLive":2,"columnArticles":30,"formTitle":"[982]Triples with Bitwise AND Equal To Zero","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4801,"title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6337711285887353,"acs":32958,"articleLive":2,"columnArticles":458,"formTitle":"[983]Minimum Cost For Tickets","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52003,"title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4191143447408605,"acs":9332,"articleLive":2,"columnArticles":150,"formTitle":"[984]String Without AAA or BBB","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22266,"title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6013203005324969,"acs":16487,"articleLive":2,"columnArticles":190,"formTitle":"[985]Sum of Even Numbers After Queries","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27418,"title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6804719537638793,"acs":28375,"articleLive":2,"columnArticles":271,"formTitle":"[986]Interval List Intersections","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","submitted":41699,"title":"Interval List Intersections","titleSlug":"interval-list-intersections"},{"acceptance":0.5331613192730537,"acs":23763,"articleLive":2,"columnArticles":421,"formTitle":"[987]Vertical Order Traversal of a Binary Tree","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"","submitted":44570,"title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4999486600266968,"acs":9738,"articleLive":2,"columnArticles":116,"formTitle":"[988]Smallest String Starting From Leaf","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":19478,"title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47056611035303175,"acs":53797,"articleLive":2,"columnArticles":605,"formTitle":"[989]Add to Array-Form of Integer","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":114324,"title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5057773877431622,"acs":34580,"articleLive":2,"columnArticles":517,"formTitle":"[990]Satisfiability of Equality Equations","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":68370,"title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.521179593721145,"acs":9031,"articleLive":2,"columnArticles":114,"formTitle":"[991]Broken Calculator","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17328,"title":"Broken Calculator","titleSlug":"broken-calculator"},{"acceptance":0.4541535681343298,"acs":24126,"articleLive":2,"columnArticles":278,"formTitle":"[992]Subarrays with K Different Integers","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53123,"title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5573528625648153,"acs":52132,"articleLive":2,"columnArticles":822,"formTitle":"[993]Cousins in Binary Tree","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","submitted":93535,"title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5099216620077993,"acs":59104,"articleLive":2,"columnArticles":1467,"formTitle":"[994]Rotting Oranges","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","submitted":115908,"title":"Rotting Oranges","titleSlug":"rotting-oranges"},{"acceptance":0.5404875871134148,"acs":21793,"articleLive":2,"columnArticles":253,"formTitle":"[995]Minimum Number of K Consecutive Bit Flips","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":40321,"title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49566267706160094,"acs":4514,"articleLive":2,"columnArticles":94,"formTitle":"[996]Number of Squareful Arrays","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9107,"title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5099913466018772,"acs":38308,"articleLive":2,"columnArticles":413,"formTitle":"[997]Find the Town Judge","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":75115,"title":"Find the Town Judge","titleSlug":"find-the-town-judge"},{"acceptance":0.6164877360708408,"acs":7867,"articleLive":2,"columnArticles":119,"formTitle":"[998]Maximum Binary Tree II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12761,"title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6906760639253008,"acs":30771,"articleLive":2,"columnArticles":577,"formTitle":"[999]Available Captures for Rook","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44552,"title":"Available Captures for Rook","titleSlug":"available-captures-for-rook"},{"acceptance":0.4105297867663223,"acs":3735,"articleLive":2,"columnArticles":41,"formTitle":"[1000]Minimum Cost to Merge Stones","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9098,"title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2962962962962963,"acs":2192,"articleLive":2,"columnArticles":56,"formTitle":"[1001]Grid Illumination","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7398,"title":"Grid Illumination","titleSlug":"grid-illumination"},{"acceptance":0.7329915772585982,"acs":58481,"articleLive":2,"columnArticles":615,"formTitle":"[1002]Find Common Characters","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":79784,"title":"Find Common Characters","titleSlug":"find-common-characters"},{"acceptance":0.5789327404113397,"acs":12498,"articleLive":2,"columnArticles":189,"formTitle":"[1003]Check If Word Is Valid After Substitutions","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"","submitted":21588,"title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5962170217089443,"acs":70418,"articleLive":2,"columnArticles":737,"formTitle":"[1004]Max Consecutive Ones III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":118108,"title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5288461538461539,"acs":28215,"articleLive":2,"columnArticles":444,"formTitle":"[1005]Maximize Sum Of Array After K Negations","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":53352,"title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6271172134376231,"acs":44578,"articleLive":2,"columnArticles":608,"formTitle":"[1006]Clumsy Factorial","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"","submitted":71084,"title":"Clumsy Factorial","titleSlug":"clumsy-factorial"},{"acceptance":0.46558473912734,"acs":6541,"articleLive":2,"columnArticles":86,"formTitle":"[1007]Minimum Domino Rotations For Equal Row","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14049,"title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7224285999600559,"acs":18086,"articleLive":2,"columnArticles":234,"formTitle":"[1008]Construct Binary Search Tree from Preorder Traversal","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":25035,"title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5885720306244293,"acs":16759,"articleLive":2,"columnArticles":233,"formTitle":"[1009]Complement of Base 10 Integer","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":28474,"title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4546001347319796,"acs":18895,"articleLive":2,"columnArticles":250,"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":41564,"title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6256465885236187,"acs":62290,"articleLive":2,"columnArticles":599,"formTitle":"[1011]Capacity To Ship Packages Within D Days","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"","submitted":99561,"title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33612821057100406,"acs":3167,"articleLive":2,"columnArticles":67,"formTitle":"[1012]Numbers With Repeated Digits","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9422,"title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39559603278986855,"acs":47824,"articleLive":2,"columnArticles":930,"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":120891,"title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5537125441648462,"acs":41060,"articleLive":2,"columnArticles":478,"formTitle":"[1014]Best Sightseeing Pair","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":74154,"title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35661583866207575,"acs":5075,"articleLive":2,"columnArticles":43,"formTitle":"[1015]Smallest Integer Divisible by K","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14231,"title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5825253295565965,"acs":5347,"articleLive":2,"columnArticles":84,"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":9179,"title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5606527093596059,"acs":3642,"articleLive":2,"columnArticles":57,"formTitle":"[1017]Convert to Base -2","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6496,"title":"Convert to Base -2","titleSlug":"convert-to-base-2"},{"acceptance":0.5156881415764782,"acs":44409,"articleLive":2,"columnArticles":381,"formTitle":"[1018]Binary Prefix Divisible By 5","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":86116,"title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5998164821930378,"acs":20918,"articleLive":2,"columnArticles":274,"formTitle":"[1019]Next Greater Node In Linked List","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"","submitted":34874,"title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5444725103455689,"acs":10131,"articleLive":2,"columnArticles":154,"formTitle":"[1020]Number of Enclaves","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":18607,"title":"Number of Enclaves","titleSlug":"number-of-enclaves"},{"acceptance":0.7827605048176233,"acs":58736,"articleLive":2,"columnArticles":670,"formTitle":"[1021]Remove Outermost Parentheses","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"","submitted":75037,"title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7057465720388617,"acs":20485,"articleLive":2,"columnArticles":276,"formTitle":"[1022]Sum of Root To Leaf Binary Numbers","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":29026,"title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5651538461538461,"acs":7347,"articleLive":2,"columnArticles":166,"formTitle":"[1023]Camelcase Matching","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13000,"title":"Camelcase Matching","titleSlug":"camelcase-matching"},{"acceptance":0.5560887529687347,"acs":34185,"articleLive":2,"columnArticles":392,"formTitle":"[1024]Video Stitching","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":61474,"title":"Video Stitching","titleSlug":"video-stitching"},{"acceptance":0.7094613349123814,"acs":76680,"articleLive":2,"columnArticles":658,"formTitle":"[1025]Divisor Game","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":108082,"title":"Divisor Game","titleSlug":"divisor-game"},{"acceptance":0.6724431075071933,"acs":10283,"articleLive":2,"columnArticles":178,"formTitle":"[1026]Maximum Difference Between Node and Ancestor","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15292,"title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43321084204905935,"acs":13793,"articleLive":2,"columnArticles":124,"formTitle":"[1027]Longest Arithmetic Subsequence","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","submitted":31839,"title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.732283185840708,"acs":20687,"articleLive":2,"columnArticles":432,"formTitle":"[1028]Recover a Tree From Preorder Traversal","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28250,"title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.658106977098075,"acs":17299,"articleLive":2,"columnArticles":187,"formTitle":"[1029]Two City Scheduling","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":26286,"title":"Two City Scheduling","titleSlug":"two-city-scheduling"},{"acceptance":0.710278101061335,"acs":40890,"articleLive":2,"columnArticles":449,"formTitle":"[1030]Matrix Cells in Distance Order","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57569,"title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5696758217019361,"acs":5061,"articleLive":2,"columnArticles":79,"formTitle":"[1031]Maximum Sum of Two Non-Overlapping Subarrays","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8884,"title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.40081460250414847,"acs":2657,"articleLive":2,"columnArticles":44,"formTitle":"[1032]Stream of Characters","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6629,"title":"Stream of Characters","titleSlug":"stream-of-characters"},{"acceptance":0.3915759915759916,"acs":11156,"articleLive":2,"columnArticles":169,"formTitle":"[1033]Moving Stones Until Consecutive","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28490,"title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4362533321077305,"acs":4746,"articleLive":2,"columnArticles":100,"formTitle":"[1034]Coloring A Border","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10879,"title":"Coloring A Border","titleSlug":"coloring-a-border"},{"acceptance":0.6363934087148373,"acs":36921,"articleLive":2,"columnArticles":401,"formTitle":"[1035]Uncrossed Lines","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","submitted":58016,"title":"Uncrossed Lines","titleSlug":"uncrossed-lines"},{"acceptance":0.2994828815977175,"acs":3359,"articleLive":2,"columnArticles":57,"formTitle":"[1036]Escape a Large Maze","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11216,"title":"Escape a Large Maze","titleSlug":"escape-a-large-maze"},{"acceptance":0.4390962240098466,"acs":9989,"articleLive":2,"columnArticles":120,"formTitle":"[1037]Valid Boomerang","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22749,"title":"Valid Boomerang","titleSlug":"valid-boomerang"},{"acceptance":0.7942642642642642,"acs":26449,"articleLive":2,"columnArticles":336,"formTitle":"[1038]Binary Search Tree to Greater Sum Tree","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":33300,"title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5558605872523276,"acs":4657,"articleLive":2,"columnArticles":63,"formTitle":"[1039]Minimum Score Triangulation of Polygon","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8378,"title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.522644054731162,"acs":2712,"articleLive":2,"columnArticles":31,"formTitle":"[1040]Moving Stones Until Consecutive II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5189,"title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48449742181745126,"acs":7235,"articleLive":2,"columnArticles":118,"formTitle":"[1041]Robot Bounded In Circle","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14933,"title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5328634282122654,"acs":11869,"articleLive":2,"columnArticles":156,"formTitle":"[1042]Flower Planting With No Adjacent","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22274,"title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6900812165197857,"acs":7987,"articleLive":2,"columnArticles":103,"formTitle":"[1043]Partition Array for Maximum Sum","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11574,"title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.2092822933535472,"acs":6074,"articleLive":2,"columnArticles":77,"formTitle":"[1044]Longest Duplicate Substring","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":29023,"title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring"},{"acceptance":0.641532402434658,"acs":8959,"articleLive":2,"columnArticles":108,"formTitle":"[1045]Customers Who Bought All Products","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13965,"title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6585974250444381,"acs":67063,"articleLive":2,"columnArticles":941,"formTitle":"[1046]Last Stone Weight","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":101827,"title":"Last Stone Weight","titleSlug":"last-stone-weight"},{"acceptance":0.7245766292865269,"acs":111458,"articleLive":2,"columnArticles":1012,"formTitle":"[1047]Remove All Adjacent Duplicates In String","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"","submitted":153825,"title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4596965178493115,"acs":10482,"articleLive":2,"columnArticles":147,"formTitle":"[1048]Longest String Chain","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":22802,"title":"Longest String Chain","titleSlug":"longest-string-chain"},{"acceptance":0.64779362428084,"acs":45376,"articleLive":2,"columnArticles":427,"formTitle":"[1049]Last Stone Weight II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","submitted":70047,"title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7598233995584989,"acs":12047,"articleLive":2,"columnArticles":58,"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":15855,"title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7548035765243033,"acs":31741,"articleLive":2,"columnArticles":377,"formTitle":"[1051]Height Checker","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":42052,"title":"Height Checker","titleSlug":"height-checker"},{"acceptance":0.5811871691947,"acs":49083,"articleLive":2,"columnArticles":761,"formTitle":"[1052]Grumpy Bookstore Owner","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":84453,"title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45852551984877127,"acs":6064,"articleLive":2,"columnArticles":98,"formTitle":"[1053]Previous Permutation With One Swap","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13225,"title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37799750496696394,"acs":8181,"articleLive":2,"columnArticles":111,"formTitle":"[1054]Distant Barcodes","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21643,"title":"Distant Barcodes","titleSlug":"distant-barcodes"},{"acceptance":0.5893799085687492,"acs":5028,"articleLive":2,"columnArticles":94,"formTitle":"[1055]Shortest Way to Form String","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":8531,"title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4123465617923966,"acs":3460,"articleLive":2,"columnArticles":68,"formTitle":"[1056]Confusing Number","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8391,"title":"Confusing Number","titleSlug":"confusing-number"},{"acceptance":0.4685859949017844,"acs":3125,"articleLive":2,"columnArticles":41,"formTitle":"[1057]Campus Bikes","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6669,"title":"Campus Bikes","titleSlug":"campus-bikes"},{"acceptance":0.3439939561823218,"acs":1366,"articleLive":2,"columnArticles":33,"formTitle":"[1058]Minimize Rounding Error to Meet Target","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3971,"title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3634415186772811,"acs":2374,"articleLive":2,"columnArticles":38,"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":6532,"title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.525674499564839,"acs":4832,"articleLive":2,"columnArticles":72,"formTitle":"[1060]Missing Element in Sorted Array","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":9192,"title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6082430422774591,"acs":2863,"articleLive":2,"columnArticles":63,"formTitle":"[1061]Lexicographically Smallest Equivalent String","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4707,"title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5448098974049487,"acs":3611,"articleLive":2,"columnArticles":51,"formTitle":"[1062]Longest Repeating Substring","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6628,"title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring"},{"acceptance":0.7120765832106039,"acs":1934,"articleLive":2,"columnArticles":41,"formTitle":"[1063]Number of Valid Subarrays","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2716,"title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6492015309489244,"acs":4919,"articleLive":2,"columnArticles":70,"formTitle":"[1064]Fixed Point","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7577,"title":"Fixed Point","titleSlug":"fixed-point"},{"acceptance":0.5435622317596567,"acs":2533,"articleLive":2,"columnArticles":70,"formTitle":"[1065]Index Pairs of a String","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4660,"title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4791619734174364,"acs":2127,"articleLive":2,"columnArticles":43,"formTitle":"[1066]Campus Bikes II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4439,"title":"Campus Bikes II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42194513715710724,"acs":846,"articleLive":2,"columnArticles":26,"formTitle":"[1067]Digit Count in Range","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":2005,"title":"Digit Count in Range","titleSlug":"digit-count-in-range"},{"acceptance":0.8648188976377953,"acs":13729,"articleLive":2,"columnArticles":66,"formTitle":"[1068]Product Sales Analysis I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15875,"title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8185073369374429,"acs":11658,"articleLive":2,"columnArticles":57,"formTitle":"[1069]Product Sales Analysis II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":14243,"title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4817735716789345,"acs":8247,"articleLive":2,"columnArticles":72,"formTitle":"[1070]Product Sales Analysis III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":17118,"title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.586791536128935,"acs":35025,"articleLive":2,"columnArticles":678,"formTitle":"[1071]Greatest Common Divisor of Strings","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","submitted":59689,"title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5835881753312946,"acs":3435,"articleLive":2,"columnArticles":56,"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":5886,"title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.336873235649953,"acs":2506,"articleLive":2,"columnArticles":55,"formTitle":"[1073]Adding Two Negabinary Numbers","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7439,"title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6686598159619034,"acs":18675,"articleLive":2,"columnArticles":191,"formTitle":"[1074]Number of Submatrices That Sum to Target","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","submitted":27929,"title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6947361149488809,"acs":10057,"articleLive":2,"columnArticles":75,"formTitle":"[1075]Project Employees I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":14476,"title":"Project Employees I","titleSlug":"project-employees-i"},{"acceptance":0.4962935678438234,"acs":10779,"articleLive":2,"columnArticles":91,"formTitle":"[1076]Project Employees II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":21719,"title":"Project Employees II","titleSlug":"project-employees-ii"},{"acceptance":0.7215872725610314,"acs":7892,"articleLive":2,"columnArticles":88,"formTitle":"[1077]Project Employees III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10937,"title":"Project Employees III","titleSlug":"project-employees-iii"},{"acceptance":0.6212370286653652,"acs":12093,"articleLive":2,"columnArticles":194,"formTitle":"[1078]Occurrences After Bigram","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19466,"title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7356343518169244,"acs":11701,"articleLive":2,"columnArticles":194,"formTitle":"[1079]Letter Tile Possibilities","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15906,"title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4946512146200134,"acs":4439,"articleLive":2,"columnArticles":98,"formTitle":"[1080]Insufficient Nodes in Root to Leaf Paths","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8974,"title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5715134412594682,"acs":15392,"articleLive":2,"columnArticles":157,"formTitle":"[1081]Smallest Subsequence of Distinct Characters","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"","submitted":26932,"title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7615550208940104,"acs":12028,"articleLive":2,"columnArticles":96,"formTitle":"[1082]Sales Analysis I","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15794,"title":"Sales Analysis I","titleSlug":"sales-analysis-i"},{"acceptance":0.5282616928612005,"acs":11159,"articleLive":2,"columnArticles":103,"formTitle":"[1083]Sales Analysis II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":21124,"title":"Sales Analysis II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5370803282765482,"acs":10798,"articleLive":2,"columnArticles":101,"formTitle":"[1084]Sales Analysis III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":20105,"title":"Sales Analysis III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731937172774869,"acs":3692,"articleLive":2,"columnArticles":74,"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":4775,"title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6874671571203363,"acs":5233,"articleLive":2,"columnArticles":82,"formTitle":"[1086]High Five","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7612,"title":"High Five","titleSlug":"high-five"},{"acceptance":0.5357347055460263,"acs":1874,"articleLive":2,"columnArticles":54,"formTitle":"[1087]Brace Expansion","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3498,"title":"Brace Expansion","titleSlug":"brace-expansion"},{"acceptance":0.4552332912988651,"acs":1083,"articleLive":2,"columnArticles":35,"formTitle":"[1088]Confusing Number II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2379,"title":"Confusing Number II","titleSlug":"confusing-number-ii"},{"acceptance":0.5846906491680337,"acs":19959,"articleLive":2,"columnArticles":297,"formTitle":"[1089]Duplicate Zeros","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":34136,"title":"Duplicate Zeros","titleSlug":"duplicate-zeros"},{"acceptance":0.5474867904078038,"acs":4041,"articleLive":2,"columnArticles":85,"formTitle":"[1090]Largest Values From Labels","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7381,"title":"Largest Values From Labels","titleSlug":"largest-values-from-labels"},{"acceptance":0.37903407526101,"acs":30278,"articleLive":2,"columnArticles":307,"formTitle":"[1091]Shortest Path in Binary Matrix","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","submitted":79882,"title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4887298747763864,"acs":2732,"articleLive":2,"columnArticles":52,"formTitle":"[1092]Shortest Common Supersequence ","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5590,"title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3736317435496482,"acs":3823,"articleLive":2,"columnArticles":62,"formTitle":"[1093]Statistics from a Large Sample","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10232,"title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.601304347826087,"acs":29043,"articleLive":2,"columnArticles":404,"formTitle":"[1094]Car Pooling","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":48300,"title":"Car Pooling","titleSlug":"car-pooling"},{"acceptance":0.3725855204954291,"acs":20215,"articleLive":2,"columnArticles":392,"formTitle":"[1095]Find in Mountain Array","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":54256,"title":"Find in Mountain Array","titleSlug":"find-in-mountain-array"},{"acceptance":0.5438707633829585,"acs":1717,"articleLive":2,"columnArticles":49,"formTitle":"[1096]Brace Expansion II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3157,"title":"Brace Expansion II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5222813567400111,"acs":6575,"articleLive":2,"columnArticles":119,"formTitle":"[1097]Game Play Analysis V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":12589,"title":"Game Play Analysis V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4747767169695103,"acs":7708,"articleLive":2,"columnArticles":105,"formTitle":"[1098]Unpopular Books","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":16235,"title":"Unpopular Books","titleSlug":"unpopular-books"},{"acceptance":0.5822857142857143,"acs":5095,"articleLive":2,"columnArticles":95,"formTitle":"[1099]Two Sum Less Than K","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8750,"title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7014556797504549,"acs":5397,"articleLive":2,"columnArticles":106,"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":7694,"title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6696380334954078,"acs":2479,"articleLive":2,"columnArticles":60,"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":3702,"title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37047931011431245,"acs":5542,"articleLive":2,"columnArticles":70,"formTitle":"[1102]Path With Maximum Minimum Value","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14959,"title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.637000070536785,"acs":36123,"articleLive":2,"columnArticles":1110,"formTitle":"[1103]Distribute Candies to People","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":56708,"title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609176049668526,"acs":28924,"articleLive":2,"columnArticles":677,"formTitle":"[1104]Path In Zigzag Labelled Binary Tree","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","submitted":38012,"title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5596476331988962,"acs":5273,"articleLive":2,"columnArticles":70,"formTitle":"[1105]Filling Bookcase Shelves","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9422,"title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5797582680302829,"acs":4365,"articleLive":2,"columnArticles":129,"formTitle":"[1106]Parsing A Boolean Expression","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7529,"title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4107341003328856,"acs":7033,"articleLive":2,"columnArticles":95,"formTitle":"[1107]New Users Daily Count","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":17123,"title":"New Users Daily Count","titleSlug":"new-users-daily-count"},{"acceptance":0.8398124730121522,"acs":68071,"articleLive":2,"columnArticles":697,"formTitle":"[1108]Defanging an IP Address","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":81055,"title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5796138199736435,"acs":60696,"articleLive":2,"columnArticles":607,"formTitle":"[1109]Corporate Flight Bookings","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":104718,"title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6299578284311109,"acs":11801,"articleLive":2,"columnArticles":213,"formTitle":"[1110]Delete Nodes And Return Forest","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":18733,"title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713788741302973,"acs":24391,"articleLive":2,"columnArticles":404,"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":31620,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6472694717994628,"acs":7953,"articleLive":2,"columnArticles":92,"formTitle":"[1112]Highest Grade For Each Student","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":12287,"title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5406370943733254,"acs":7264,"articleLive":2,"columnArticles":51,"formTitle":"[1113]Reported Posts","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":13436,"title":"Reported Posts","titleSlug":"reported-posts"},{"acceptance":0.6536094470895786,"acs":79758,"articleLive":2,"columnArticles":589,"formTitle":"[1114]Print in Order","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":122027,"title":"Print in Order","titleSlug":"print-in-order"},{"acceptance":0.5615230561888328,"acs":44581,"articleLive":2,"columnArticles":484,"formTitle":"[1115]Print FooBar Alternately","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":79393,"title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately"},{"acceptance":0.5207125470236778,"acs":23531,"articleLive":2,"columnArticles":375,"formTitle":"[1116]Print Zero Even Odd","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":45190,"title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd"},{"acceptance":0.5220905801330687,"acs":17891,"articleLive":2,"columnArticles":258,"formTitle":"[1117]Building H2O","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":34268,"title":"Building H2O","titleSlug":"building-h2o"},{"acceptance":0.6410323253388946,"acs":2459,"articleLive":2,"columnArticles":39,"formTitle":"[1118]Number of Days in a Month","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3836,"title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662701261409086,"acs":8447,"articleLive":2,"columnArticles":149,"formTitle":"[1119]Remove Vowels from a String","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9751,"title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.611446456516879,"acs":2735,"articleLive":2,"columnArticles":50,"formTitle":"[1120]Maximum Average Subtree","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4473,"title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree"},{"acceptance":0.5785420944558521,"acs":1127,"articleLive":2,"columnArticles":19,"formTitle":"[1121]Divide Array Into Increasing Sequences","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1948,"title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068860905016872,"acs":66407,"articleLive":2,"columnArticles":883,"formTitle":"[1122]Relative Sort Array","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":93943,"title":"Relative Sort Array","titleSlug":"relative-sort-array"},{"acceptance":0.7038802475330322,"acs":8417,"articleLive":2,"columnArticles":108,"formTitle":"[1123]Lowest Common Ancestor of Deepest Leaves","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11958,"title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3196790642596486,"acs":13228,"articleLive":2,"columnArticles":141,"formTitle":"[1124]Longest Well-Performing Interval","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","submitted":41379,"title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49448123620309054,"acs":3136,"articleLive":2,"columnArticles":51,"formTitle":"[1125]Smallest Sufficient Team","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6342,"title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6917381974248927,"acs":6447,"articleLive":2,"columnArticles":97,"formTitle":"[1126]Active Businesses","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":9320,"title":"Active Businesses","titleSlug":"active-businesses"},{"acceptance":0.42202748456482775,"acs":4238,"articleLive":2,"columnArticles":77,"formTitle":"[1127]User Purchase Platform","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":10042,"title":"User Purchase Platform","titleSlug":"user-purchase-platform"},{"acceptance":0.5448581174250672,"acs":37538,"articleLive":2,"columnArticles":484,"formTitle":"[1128]Number of Equivalent Domino Pairs","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68895,"title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3823511922459416,"acs":6430,"articleLive":2,"columnArticles":118,"formTitle":"[1129]Shortest Path with Alternating Colors","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16817,"title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6306788915215824,"acs":6122,"articleLive":2,"columnArticles":110,"formTitle":"[1130]Minimum Cost Tree From Leaf Values","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","submitted":9707,"title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4557891705069124,"acs":3165,"articleLive":2,"columnArticles":48,"formTitle":"[1131]Maximum of Absolute Value Expression","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6944,"title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39095200629425647,"acs":4969,"articleLive":2,"columnArticles":56,"formTitle":"[1132]Reported Posts II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12710,"title":"Reported Posts II","titleSlug":"reported-posts-ii"},{"acceptance":0.6486025176018775,"acs":3040,"articleLive":2,"columnArticles":65,"formTitle":"[1133]Largest Unique Number","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4687,"title":"Largest Unique Number","titleSlug":"largest-unique-number"},{"acceptance":0.7775383141762452,"acs":3247,"articleLive":2,"columnArticles":55,"formTitle":"[1134]Armstrong Number","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4176,"title":"Armstrong Number","titleSlug":"armstrong-number"},{"acceptance":0.5383936451897617,"acs":6710,"articleLive":2,"columnArticles":76,"formTitle":"[1135]Connecting Cities With Minimum Cost","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":12463,"title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.571781238131409,"acs":3011,"articleLive":2,"columnArticles":54,"formTitle":"[1136]Parallel Courses","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":5266,"title":"Parallel Courses","titleSlug":"parallel-courses"},{"acceptance":0.6092359502090856,"acs":87560,"articleLive":2,"columnArticles":917,"formTitle":"[1137]N-th Tribonacci Number","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","submitted":143721,"title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43448893790061344,"acs":6304,"articleLive":2,"columnArticles":142,"formTitle":"[1138]Alphabet Board Path","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14509,"title":"Alphabet Board Path","titleSlug":"alphabet-board-path"},{"acceptance":0.4794050343249428,"acs":9637,"articleLive":2,"columnArticles":156,"formTitle":"[1139]Largest 1-Bordered Square","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20102,"title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6521373903304089,"acs":6987,"articleLive":2,"columnArticles":98,"formTitle":"[1140]Stone Game II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10714,"title":"Stone Game II","titleSlug":"stone-game-ii"},{"acceptance":0.5094422700587085,"acs":10413,"articleLive":2,"columnArticles":69,"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":20440,"title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3712985219659387,"acs":7260,"articleLive":2,"columnArticles":52,"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":19553,"title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6379332316285031,"acs":175209,"articleLive":2,"columnArticles":1166,"formTitle":"[1143]Longest Common Subsequence","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","submitted":274651,"title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence"},{"acceptance":0.4424976779532213,"acs":10481,"articleLive":2,"columnArticles":148,"formTitle":"[1144]Decrease Elements To Make Array Zigzag","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","submitted":23686,"title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.47057610339612266,"acs":6845,"articleLive":2,"columnArticles":109,"formTitle":"[1145]Binary Tree Coloring Game","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14546,"title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28904718337472224,"acs":4423,"articleLive":2,"columnArticles":65,"formTitle":"[1146]Snapshot Array","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":15302,"title":"Snapshot Array","titleSlug":"snapshot-array"},{"acceptance":0.5630939809926082,"acs":4266,"articleLive":2,"columnArticles":86,"formTitle":"[1147]Longest Chunked Palindrome Decomposition","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7576,"title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7139977210973792,"acs":8146,"articleLive":2,"columnArticles":38,"formTitle":"[1148]Article Views I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":11409,"title":"Article Views I","titleSlug":"article-views-i"},{"acceptance":0.44268588889759464,"acs":5650,"articleLive":2,"columnArticles":48,"formTitle":"[1149]Article Views II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12763,"title":"Article Views II","titleSlug":"article-views-ii"},{"acceptance":0.6036950936008809,"acs":4934,"articleLive":2,"columnArticles":88,"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":8173,"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.49069592341615575,"acs":4562,"articleLive":2,"columnArticles":67,"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":9297,"title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3927321668909825,"acs":1459,"articleLive":2,"columnArticles":33,"formTitle":"[1152]Analyze User Website Visit Pattern","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3715,"title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37026737967914436,"acs":1731,"articleLive":2,"columnArticles":24,"formTitle":"[1153]String Transforms Into Another String","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4675,"title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5719023213747362,"acs":15176,"articleLive":2,"columnArticles":233,"formTitle":"[1154]Day of the Year","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":26536,"title":"Day of the Year","titleSlug":"day-of-the-year"},{"acceptance":0.4789478619654914,"acs":10215,"articleLive":2,"columnArticles":131,"formTitle":"[1155]Number of Dice Rolls With Target Sum","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":21328,"title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43072838891654225,"acs":5192,"articleLive":2,"columnArticles":93,"formTitle":"[1156]Swap For Longest Repeated Character Substring","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12054,"title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3211178216808271,"acs":3137,"articleLive":2,"columnArticles":49,"formTitle":"[1157]Online Majority Element In Subarray","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9769,"title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5519623836484022,"acs":5752,"articleLive":2,"columnArticles":62,"formTitle":"[1158]Market Analysis I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":10421,"title":"Market Analysis I","titleSlug":"market-analysis-i"},{"acceptance":0.4913730255164034,"acs":4044,"articleLive":2,"columnArticles":87,"formTitle":"[1159]Market Analysis II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":8230,"title":"Market Analysis II","titleSlug":"market-analysis-ii"},{"acceptance":0.6871378646965747,"acs":60363,"articleLive":2,"columnArticles":917,"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":87847,"title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6330805134189031,"acs":10851,"articleLive":2,"columnArticles":181,"formTitle":"[1161]Maximum Level Sum of a Binary Tree","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17140,"title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.47035639614525004,"acs":39144,"articleLive":2,"columnArticles":501,"formTitle":"[1162]As Far from Land as Possible","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":83222,"title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26782967878015557,"acs":6095,"articleLive":2,"columnArticles":104,"formTitle":"[1163]Last Substring in Lexicographical Order","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22757,"title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.607783520826999,"acs":5997,"articleLive":2,"columnArticles":87,"formTitle":"[1164]Product Price at a Given Date","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9867,"title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8380549223922718,"acs":7721,"articleLive":2,"columnArticles":116,"formTitle":"[1165]Single-Row Keyboard","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9213,"title":"Single-Row Keyboard","titleSlug":"single-row-keyboard"},{"acceptance":0.4821398340951414,"acs":2848,"articleLive":2,"columnArticles":50,"formTitle":"[1166]Design File System","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5907,"title":"Design File System","titleSlug":"design-file-system"},{"acceptance":0.44286740927057133,"acs":2465,"articleLive":2,"columnArticles":36,"formTitle":"[1167]Minimum Cost to Connect Sticks","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5566,"title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.569391304347826,"acs":1637,"articleLive":2,"columnArticles":29,"formTitle":"[1168]Optimize Water Distribution in a Village","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2875,"title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32245582956505525,"acs":6917,"articleLive":2,"columnArticles":82,"formTitle":"[1169]Invalid Transactions","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21451,"title":"Invalid Transactions","titleSlug":"invalid-transactions"},{"acceptance":0.6171562971509719,"acs":13907,"articleLive":2,"columnArticles":220,"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":22534,"title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47537602673967927,"acs":13369,"articleLive":2,"columnArticles":162,"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":28123,"title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2659795960857797,"acs":2555,"articleLive":2,"columnArticles":55,"formTitle":"[1172]Dinner Plate Stacks","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9606,"title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7574919728861934,"acs":8493,"articleLive":2,"columnArticles":80,"formTitle":"[1173]Immediate Food Delivery I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":11212,"title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6183289060613378,"acs":5121,"articleLive":2,"columnArticles":64,"formTitle":"[1174]Immediate Food Delivery II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":8282,"title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4919981710105167,"acs":7532,"articleLive":2,"columnArticles":121,"formTitle":"[1175]Prime Arrangements","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":15309,"title":"Prime Arrangements","titleSlug":"prime-arrangements"},{"acceptance":0.4525659374361071,"acs":4427,"articleLive":2,"columnArticles":64,"formTitle":"[1176]Diet Plan Performance","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9782,"title":"Diet Plan Performance","titleSlug":"diet-plan-performance"},{"acceptance":0.2675161950221616,"acs":6277,"articleLive":2,"columnArticles":98,"formTitle":"[1177]Can Make Palindrome from Substring","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23464,"title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4620905682715075,"acs":18735,"articleLive":2,"columnArticles":184,"formTitle":"[1178]Number of Valid Words for Each Puzzle","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40544,"title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.636791324455785,"acs":31944,"articleLive":2,"columnArticles":194,"formTitle":"[1179]Reformat Department Table","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":50164,"title":"Reformat Department Table","titleSlug":"reformat-department-table"},{"acceptance":0.7770747140423461,"acs":3193,"articleLive":2,"columnArticles":72,"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":4109,"title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3743818001978239,"acs":1514,"articleLive":2,"columnArticles":29,"formTitle":"[1181]Before and After Puzzle","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4044,"title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle"},{"acceptance":0.409253304751697,"acs":2291,"articleLive":2,"columnArticles":43,"formTitle":"[1182]Shortest Distance to Target Color","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5598,"title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6014558689717925,"acs":661,"articleLive":2,"columnArticles":17,"formTitle":"[1183]Maximum Number of Ones","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1099,"title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5845379727943372,"acs":13708,"articleLive":2,"columnArticles":269,"formTitle":"[1184]Distance Between Bus Stops","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":23451,"title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6024953598680141,"acs":11686,"articleLive":2,"columnArticles":213,"formTitle":"[1185]Day of the Week","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":19396,"title":"Day of the Week","titleSlug":"day-of-the-week"},{"acceptance":0.39503246418633414,"acs":7666,"articleLive":2,"columnArticles":112,"formTitle":"[1186]Maximum Subarray Sum with One Deletion","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19406,"title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44299370482629985,"acs":1900,"articleLive":2,"columnArticles":34,"formTitle":"[1187]Make Array Strictly Increasing","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4289,"title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.698550140958518,"acs":3469,"articleLive":2,"columnArticles":67,"formTitle":"[1188]Design Bounded Blocking Queue","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4966,"title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6462028741506824,"acs":21494,"articleLive":2,"columnArticles":337,"formTitle":"[1189]Maximum Number of Balloons","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":33262,"title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6507485474362781,"acs":46032,"articleLive":2,"columnArticles":623,"formTitle":"[1190]Reverse Substrings Between Each Pair of Parentheses","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","submitted":70737,"title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2665006770628576,"acs":6101,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K-Concatenation Maximum Sum","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22893,"title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5003354203935599,"acs":4475,"articleLive":2,"columnArticles":53,"formTitle":"[1192]Critical Connections in a Network","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8944,"title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6053770086526576,"acs":5877,"articleLive":2,"columnArticles":74,"formTitle":"[1193]Monthly Transactions I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9708,"title":"Monthly Transactions I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5080060216231012,"acs":3712,"articleLive":2,"columnArticles":66,"formTitle":"[1194]Tournament Winners","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":7307,"title":"Tournament Winners","titleSlug":"tournament-winners"},{"acceptance":0.6378598997382547,"acs":14378,"articleLive":2,"columnArticles":274,"formTitle":"[1195]Fizz Buzz Multithreaded","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":22541,"title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.693221659524737,"acs":3559,"articleLive":2,"columnArticles":61,"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":5134,"title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3728863838623554,"acs":5028,"articleLive":2,"columnArticles":62,"formTitle":"[1197]Minimum Knight Moves","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13484,"title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves"},{"acceptance":0.743455497382199,"acs":3976,"articleLive":2,"columnArticles":60,"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":5348,"title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4403028538147932,"acs":756,"articleLive":2,"columnArticles":19,"formTitle":"[1199]Minimum Time to Build Blocks","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1717,"title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6834790987251704,"acs":18443,"articleLive":2,"columnArticles":260,"formTitle":"[1200]Minimum Absolute Difference","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26984,"title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24857835924762398,"acs":6251,"articleLive":2,"columnArticles":89,"formTitle":"[1201]Ugly Number III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25147,"title":"Ugly Number III","titleSlug":"ugly-number-iii"},{"acceptance":0.5026816097055777,"acs":27181,"articleLive":2,"columnArticles":301,"formTitle":"[1202]Smallest String With Swaps","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54072,"title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6195955192863297,"acs":12224,"articleLive":2,"columnArticles":144,"formTitle":"[1203]Sort Items by Groups Respecting Dependencies","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19729,"title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7274195552242515,"acs":5855,"articleLive":2,"columnArticles":84,"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":8049,"title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4688598694123556,"acs":5601,"articleLive":2,"columnArticles":84,"formTitle":"[1205]Monthly Transactions II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11946,"title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6097560975609756,"acs":7400,"articleLive":2,"columnArticles":92,"formTitle":"[1206]Design Skiplist","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12136,"title":"Design Skiplist","titleSlug":"design-skiplist"},{"acceptance":0.7304572138044094,"acs":60598,"articleLive":2,"columnArticles":838,"formTitle":"[1207]Unique Number of Occurrences","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82959,"title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4977043252138228,"acs":48997,"articleLive":2,"columnArticles":625,"formTitle":"[1208]Get Equal Substrings Within Budget","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":98446,"title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5271775265957447,"acs":12686,"articleLive":2,"columnArticles":162,"formTitle":"[1209]Remove All Adjacent Duplicates in String II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","submitted":24064,"title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4514838279426476,"acs":2708,"articleLive":2,"columnArticles":56,"formTitle":"[1210]Minimum Moves to Reach Target with Rotations","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5998,"title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6586546628163751,"acs":7755,"articleLive":2,"columnArticles":65,"formTitle":"[1211]Queries Quality and Percentage","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11774,"title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5112826023248999,"acs":5234,"articleLive":2,"columnArticles":100,"formTitle":"[1212]Team Scores in Football Tournament","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":10237,"title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7750159337157425,"acs":6080,"articleLive":2,"columnArticles":128,"formTitle":"[1213]Intersection of Three Sorted Arrays","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7845,"title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6378683157511823,"acs":3507,"articleLive":2,"columnArticles":73,"formTitle":"[1214]Two Sum BSTs","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5498,"title":"Two Sum BSTs","titleSlug":"two-sum-bsts"},{"acceptance":0.41243523316062175,"acs":1990,"articleLive":2,"columnArticles":41,"formTitle":"[1215]Stepping Numbers","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4825,"title":"Stepping Numbers","titleSlug":"stepping-numbers"},{"acceptance":0.5380530973451327,"acs":1520,"articleLive":2,"columnArticles":38,"formTitle":"[1216]Valid Palindrome III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2825,"title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6945944268602992,"acs":22384,"articleLive":2,"columnArticles":363,"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":32226,"title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.5136693901783947,"acs":36338,"articleLive":2,"columnArticles":356,"formTitle":"[1218]Longest Arithmetic Subsequence of Given Difference","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":70742,"title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6292729656146012,"acs":12481,"articleLive":2,"columnArticles":177,"formTitle":"[1219]Path with Maximum Gold","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19834,"title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5288689691537042,"acs":4012,"articleLive":2,"columnArticles":78,"formTitle":"[1220]Count Vowels Permutation","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7586,"title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation"},{"acceptance":0.8437068374859976,"acs":77578,"articleLive":2,"columnArticles":1122,"formTitle":"[1221]Split a String in Balanced Strings","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":91949,"title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6725516322451699,"acs":6057,"articleLive":2,"columnArticles":134,"formTitle":"[1222]Queens That Can Attack the King","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9006,"title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4761576626240353,"acs":3455,"articleLive":2,"columnArticles":60,"formTitle":"[1223]Dice Roll Simulation","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7256,"title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation"},{"acceptance":0.3282890252215406,"acs":4816,"articleLive":2,"columnArticles":71,"formTitle":"[1224]Maximum Equal Frequency","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14670,"title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5371132449321749,"acs":3524,"articleLive":2,"columnArticles":85,"formTitle":"[1225]Report Contiguous Dates","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6561,"title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"},{"acceptance":0.5959689169499757,"acs":12271,"articleLive":2,"columnArticles":138,"formTitle":"[1226]The Dining Philosophers","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":20590,"title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"},{"acceptance":0.6640654982729948,"acs":10382,"articleLive":2,"columnArticles":163,"formTitle":"[1227]Airplane Seat Assignment Probability","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15634,"title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5401885175664096,"acs":3152,"articleLive":2,"columnArticles":55,"formTitle":"[1228]Missing Number In Arithmetic Progression","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5835,"title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4261119081779053,"acs":2673,"articleLive":2,"columnArticles":51,"formTitle":"[1229]Meeting Scheduler","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":6273,"title":"Meeting Scheduler","titleSlug":"meeting-scheduler"},{"acceptance":0.4981250937453127,"acs":3321,"articleLive":2,"columnArticles":67,"formTitle":"[1230]Toss Strange Coins","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6667,"title":"Toss Strange Coins","titleSlug":"toss-strange-coins"},{"acceptance":0.5675029868578255,"acs":3325,"articleLive":2,"columnArticles":45,"formTitle":"[1231]Divide Chocolate","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5859,"title":"Divide Chocolate","titleSlug":"divide-chocolate"},{"acceptance":0.4691634495170841,"acs":34149,"articleLive":2,"columnArticles":425,"formTitle":"[1232]Check If It Is a Straight Line","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72787,"title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4850330664810303,"acs":8361,"articleLive":2,"columnArticles":121,"formTitle":"[1233]Remove Sub-Folders from the Filesystem","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17238,"title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34622976707461506,"acs":6139,"articleLive":2,"columnArticles":93,"formTitle":"[1234]Replace the Substring for Balanced String","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17731,"title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46664836673071647,"acs":6800,"articleLive":2,"columnArticles":118,"formTitle":"[1235]Maximum Profit in Job Scheduling","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":14572,"title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5664335664335665,"acs":1215,"articleLive":2,"columnArticles":33,"formTitle":"[1236]Web Crawler","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2145,"title":"Web Crawler","titleSlug":"web-crawler"},{"acceptance":0.7107975375250744,"acs":10276,"articleLive":2,"columnArticles":137,"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":14457,"title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6617314414970183,"acs":3218,"articleLive":2,"columnArticles":76,"formTitle":"[1238]Circular Permutation in Binary Representation","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4863,"title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49079293498684706,"acs":35262,"articleLive":2,"columnArticles":388,"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":71847,"title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4949171686746988,"acs":2629,"articleLive":2,"columnArticles":40,"formTitle":"[1240]Tiling a Rectangle with the Fewest Squares","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5312,"title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5938447814451383,"acs":6657,"articleLive":2,"columnArticles":68,"formTitle":"[1241]Number of Comments per Post","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":11210,"title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4686725663716814,"acs":1324,"articleLive":2,"columnArticles":21,"formTitle":"[1242]Web Crawler Multithreaded","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2825,"title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.539119804400978,"acs":2646,"articleLive":2,"columnArticles":60,"formTitle":"[1243]Array Transformation","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4908,"title":"Array Transformation","titleSlug":"array-transformation"},{"acceptance":0.6217113059966817,"acs":2623,"articleLive":2,"columnArticles":43,"formTitle":"[1244]Design A Leaderboard","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":4219,"title":"Design A Leaderboard","titleSlug":"design-a-leaderboard"},{"acceptance":0.5108164689462665,"acs":3660,"articleLive":2,"columnArticles":66,"formTitle":"[1245]Tree Diameter","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":7165,"title":"Tree Diameter","titleSlug":"tree-diameter"},{"acceptance":0.4827138451550073,"acs":2974,"articleLive":2,"columnArticles":42,"formTitle":"[1246]Palindrome Removal","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6161,"title":"Palindrome Removal","titleSlug":"palindrome-removal"},{"acceptance":0.6198519515477793,"acs":9211,"articleLive":2,"columnArticles":160,"formTitle":"[1247]Minimum Swaps to Make Strings Equal","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":14860,"title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.560528292438658,"acs":35820,"articleLive":2,"columnArticles":492,"formTitle":"[1248]Count Number of Nice Subarrays","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":63904,"title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5763619487350358,"acs":24217,"articleLive":2,"columnArticles":338,"formTitle":"[1249]Minimum Remove to Make Valid Parentheses","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"","submitted":42017,"title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5632415041222602,"acs":2801,"articleLive":2,"columnArticles":41,"formTitle":"[1250]Check If It Is a Good Array","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4973,"title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7736636971046771,"acs":8337,"articleLive":2,"columnArticles":99,"formTitle":"[1251]Average Selling Price","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10776,"title":"Average Selling Price","titleSlug":"average-selling-price"},{"acceptance":0.7491109748620478,"acs":18327,"articleLive":2,"columnArticles":323,"formTitle":"[1252]Cells with Odd Values in a Matrix","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24465,"title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39448063831344704,"acs":5389,"articleLive":2,"columnArticles":83,"formTitle":"[1253]Reconstruct a 2-Row Binary Matrix","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13661,"title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6016855008619039,"acs":15707,"articleLive":2,"columnArticles":250,"formTitle":"[1254]Number of Closed Islands","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"","submitted":26105,"title":"Number of Closed Islands","titleSlug":"number-of-closed-islands"},{"acceptance":0.6839424141749724,"acs":3088,"articleLive":2,"columnArticles":68,"formTitle":"[1255]Maximum Score Words Formed by Letters","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4515,"title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6705078958600086,"acs":1571,"articleLive":2,"columnArticles":38,"formTitle":"[1256]Encode Number","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2343,"title":"Encode Number","titleSlug":"encode-number"},{"acceptance":0.5667468430547203,"acs":1885,"articleLive":2,"columnArticles":41,"formTitle":"[1257]Smallest Common Region","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3326,"title":"Smallest Common Region","titleSlug":"smallest-common-region"},{"acceptance":0.5543905635648755,"acs":1269,"articleLive":2,"columnArticles":44,"formTitle":"[1258]Synonymous Sentences","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2289,"title":"Synonymous Sentences","titleSlug":"synonymous-sentences"},{"acceptance":0.48240363897534116,"acs":2015,"articleLive":2,"columnArticles":45,"formTitle":"[1259]Handshakes That Don't Cross","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4177,"title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6040337711069418,"acs":12878,"articleLive":2,"columnArticles":261,"formTitle":"[1260]Shift 2D Grid","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":21320,"title":"Shift 2D Grid","titleSlug":"shift-2d-grid"},{"acceptance":0.7279690034240404,"acs":8079,"articleLive":2,"columnArticles":107,"formTitle":"[1261]Find Elements in a Contaminated Binary Tree","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11098,"title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5266092440206106,"acs":13695,"articleLive":2,"columnArticles":202,"formTitle":"[1262]Greatest Sum Divisible by Three","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26006,"title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4243270695784662,"acs":3342,"articleLive":2,"columnArticles":61,"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":7876,"title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5668264407535392,"acs":5085,"articleLive":2,"columnArticles":89,"formTitle":"[1264]Page Recommendations","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8971,"title":"Page Recommendations","titleSlug":"page-recommendations"},{"acceptance":0.9224633056796426,"acs":2891,"articleLive":2,"columnArticles":75,"formTitle":"[1265]Print Immutable Linked List in Reverse","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":3134,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8241953082378615,"acs":30215,"articleLive":2,"columnArticles":459,"formTitle":"[1266]Minimum Time Visiting All Points","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36660,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.608013608013608,"acs":9651,"articleLive":2,"columnArticles":153,"formTitle":"[1267]Count Servers that Communicate","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15873,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"},{"acceptance":0.585305448541552,"acs":8508,"articleLive":2,"columnArticles":149,"formTitle":"[1268]Search Suggestions System","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":14536,"title":"Search Suggestions System","titleSlug":"search-suggestions-system"},{"acceptance":0.4910837207042322,"acs":30320,"articleLive":2,"columnArticles":322,"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":61741,"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.8031067961165048,"acs":6204,"articleLive":2,"columnArticles":87,"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":7725,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5083333333333333,"acs":2501,"articleLive":2,"columnArticles":43,"formTitle":"[1271]Hexspeak","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4920,"title":"Hexspeak","titleSlug":"hexspeak"},{"acceptance":0.5208070617906684,"acs":1652,"articleLive":2,"columnArticles":33,"formTitle":"[1272]Remove Interval","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3172,"title":"Remove Interval","titleSlug":"remove-interval"},{"acceptance":0.5457604306864065,"acs":1622,"articleLive":2,"columnArticles":48,"formTitle":"[1273]Delete Tree Nodes","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2972,"title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes"},{"acceptance":0.6057347670250897,"acs":1014,"articleLive":2,"columnArticles":25,"formTitle":"[1274]Number of Ships in a Rectangle","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1674,"title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5446905537459283,"acs":8361,"articleLive":2,"columnArticles":173,"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":15350,"title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5026296018031555,"acs":6690,"articleLive":2,"columnArticles":100,"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":13310,"title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7262573937323193,"acs":19768,"articleLive":2,"columnArticles":244,"formTitle":"[1277]Count Square Submatrices with All Ones","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":27219,"title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6014701182486417,"acs":3764,"articleLive":2,"columnArticles":60,"formTitle":"[1278]Palindrome Partitioning III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6258,"title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6227636086791016,"acs":1636,"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":2627,"title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5071622976650909,"acs":7081,"articleLive":2,"columnArticles":72,"formTitle":"[1280]Students and Examinations","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13962,"title":"Students and Examinations","titleSlug":"students-and-examinations"},{"acceptance":0.8311086995840116,"acs":45952,"articleLive":2,"columnArticles":625,"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":55290,"title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8102319669526533,"acs":12749,"articleLive":2,"columnArticles":239,"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":15735,"title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4189775191144585,"acs":7343,"articleLive":2,"columnArticles":102,"formTitle":"[1283]Find the Smallest Divisor Given a Threshold","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":17526,"title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6650160930923495,"acs":2686,"articleLive":2,"columnArticles":61,"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":4039,"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.8131945669430235,"acs":4610,"articleLive":2,"columnArticles":64,"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":5669,"title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.649706457925636,"acs":4980,"articleLive":2,"columnArticles":99,"formTitle":"[1286]Iterator for Combination","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7665,"title":"Iterator for Combination","titleSlug":"iterator-for-combination"},{"acceptance":0.6016342822714265,"acs":15977,"articleLive":2,"columnArticles":223,"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":26556,"title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5637190900098912,"acs":14248,"articleLive":2,"columnArticles":178,"formTitle":"[1288]Remove Covered Intervals","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":25275,"title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals"},{"acceptance":0.6241197183098591,"acs":7090,"articleLive":2,"columnArticles":107,"formTitle":"[1289]Minimum Falling Path Sum II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":11360,"title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8082612254443405,"acs":55298,"articleLive":2,"columnArticles":720,"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":68416,"title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5188314478018043,"acs":7246,"articleLive":2,"columnArticles":164,"formTitle":"[1291]Sequential Digits","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13966,"title":"Sequential Digits","titleSlug":"sequential-digits"},{"acceptance":0.4732841661649609,"acs":6289,"articleLive":2,"columnArticles":98,"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":13288,"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.3634950248756219,"acs":14028,"articleLive":2,"columnArticles":130,"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":38592,"title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6558143717960249,"acs":7292,"articleLive":2,"columnArticles":80,"formTitle":"[1294]Weather Type in Each Country","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":11119,"title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8077285579641847,"acs":48849,"articleLive":2,"columnArticles":647,"formTitle":"[1295]Find Numbers with Even Number of Digits","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":60477,"title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4531893004115226,"acs":7929,"articleLive":2,"columnArticles":128,"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":17496,"title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4598735742751134,"acs":6693,"articleLive":2,"columnArticles":95,"formTitle":"[1297]Maximum Number of Occurrences of a Substring","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14554,"title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.597922192749779,"acs":2705,"articleLive":2,"columnArticles":93,"formTitle":"[1298]Maximum Candies You Can Get from Boxes","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4524,"title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7874199776445483,"acs":30996,"articleLive":2,"columnArticles":444,"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":39364,"title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4651635451886183,"acs":24489,"articleLive":2,"columnArticles":372,"formTitle":"[1300]Sum of Mutated Array Closest to Target","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":52646,"title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3626259478549912,"acs":3491,"articleLive":2,"columnArticles":85,"formTitle":"[1301]Number of Paths with Max Score","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":9627,"title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8202624839948783,"acs":20500,"articleLive":2,"columnArticles":304,"formTitle":"[1302]Deepest Leaves Sum","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24992,"title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8244876040454667,"acs":9212,"articleLive":2,"columnArticles":88,"formTitle":"[1303]Find the Team Size","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":11173,"title":"Find the Team Size","titleSlug":"find-the-team-size"},{"acceptance":0.7226731421728428,"acs":21725,"articleLive":2,"columnArticles":395,"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":30062,"title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7485056130631287,"acs":15402,"articleLive":2,"columnArticles":232,"formTitle":"[1305]All Elements in Two Binary Search Trees","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20577,"title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5751749912900262,"acs":18160,"articleLive":2,"columnArticles":280,"formTitle":"[1306]Jump Game III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":31573,"title":"Jump Game III","titleSlug":"jump-game-iii"},{"acceptance":0.3300509934939335,"acs":1877,"articleLive":2,"columnArticles":57,"formTitle":"[1307]Verbal Arithmetic Puzzle","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5687,"title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7514216084484159,"acs":5550,"articleLive":2,"columnArticles":61,"formTitle":"[1308]Running Total for Different Genders","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7386,"title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7543197263803136,"acs":16982,"articleLive":2,"columnArticles":294,"formTitle":"[1309]Decrypt String from Alphabet to Integer Mapping","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22513,"title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7138220075229603,"acs":37385,"articleLive":2,"columnArticles":503,"formTitle":"[1310]XOR Queries of a Subarray","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"","submitted":52373,"title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3823098441454642,"acs":5740,"articleLive":2,"columnArticles":90,"formTitle":"[1311]Get Watched Videos by Your Friends","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15014,"title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.666586955222096,"acs":11150,"articleLive":2,"columnArticles":155,"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":16727,"title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8322147651006712,"acs":35464,"articleLive":2,"columnArticles":550,"formTitle":"[1313]Decompress Run-Length Encoded List","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42614,"title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7445187554521663,"acs":12802,"articleLive":2,"columnArticles":211,"formTitle":"[1314]Matrix Block Sum","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":17195,"title":"Matrix Block Sum","titleSlug":"matrix-block-sum"},{"acceptance":0.8097437792559744,"acs":13147,"articleLive":2,"columnArticles":272,"formTitle":"[1315]Sum of Nodes with Even-Valued Grandparent","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16236,"title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4398593917163381,"acs":2878,"articleLive":2,"columnArticles":61,"formTitle":"[1316]Distinct Echo Substrings","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6543,"title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6143713983300012,"acs":10448,"articleLive":2,"columnArticles":197,"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":17006,"title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6559577063847092,"acs":6452,"articleLive":2,"columnArticles":115,"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":9836,"title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6172815382210411,"acs":31590,"articleLive":2,"columnArticles":520,"formTitle":"[1319]Number of Operations to Make Network Connected","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":51176,"title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5893764434180139,"acs":2552,"articleLive":2,"columnArticles":60,"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":4330,"title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.617152017098584,"acs":4620,"articleLive":2,"columnArticles":84,"formTitle":"[1321]Restaurant Growth","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7486,"title":"Restaurant Growth","titleSlug":"restaurant-growth"},{"acceptance":0.5951261222744763,"acs":5568,"articleLive":2,"columnArticles":65,"formTitle":"[1322]Ads Performance","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":9356,"title":"Ads Performance","titleSlug":"ads-performance"},{"acceptance":0.7541037622813324,"acs":25175,"articleLive":2,"columnArticles":494,"formTitle":"[1323]Maximum 69 Number","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":33384,"title":"Maximum 69 Number","titleSlug":"maximum-69-number"},{"acceptance":0.5879629629629629,"acs":6096,"articleLive":2,"columnArticles":121,"formTitle":"[1324]Print Words Vertically","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10368,"title":"Print Words Vertically","titleSlug":"print-words-vertically"},{"acceptance":0.7300764192139738,"acs":10700,"articleLive":2,"columnArticles":190,"formTitle":"[1325]Delete Leaves With a Given Value","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14656,"title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47235940736020393,"acs":5930,"articleLive":2,"columnArticles":95,"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":12554,"title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.689161554192229,"acs":5729,"articleLive":2,"columnArticles":56,"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":8313,"title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.464469696969697,"acs":6131,"articleLive":2,"columnArticles":123,"formTitle":"[1328]Break a Palindrome","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13200,"title":"Break a Palindrome","titleSlug":"break-a-palindrome"},{"acceptance":0.7708288712786464,"acs":7198,"articleLive":2,"columnArticles":164,"formTitle":"[1329]Sort the Matrix Diagonally","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9338,"title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.38089212274596645,"acs":1204,"articleLive":2,"columnArticles":31,"formTitle":"[1330]Reverse Subarray To Maximize Array Value","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3161,"title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5340549902576315,"acs":12334,"articleLive":2,"columnArticles":211,"formTitle":"[1331]Rank Transform of an Array","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":23095,"title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6895070422535211,"acs":9791,"articleLive":2,"columnArticles":138,"formTitle":"[1332]Remove Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"","submitted":14200,"title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5476969074091377,"acs":5862,"articleLive":2,"columnArticles":123,"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":10703,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4943276609943277,"acs":5926,"articleLive":2,"columnArticles":94,"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":11988,"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.5899886602948323,"acs":3642,"articleLive":2,"columnArticles":60,"formTitle":"[1335]Minimum Difficulty of a Job Schedule","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6173,"title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42548887390424817,"acs":1893,"articleLive":2,"columnArticles":50,"formTitle":"[1336]Number of Transactions per Visit","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4449,"title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7047389558232932,"acs":39483,"articleLive":2,"columnArticles":633,"formTitle":"[1337]The K Weakest Rows in a Matrix","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"","submitted":56025,"title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6390930951563036,"acs":9302,"articleLive":2,"columnArticles":138,"formTitle":"[1338]Reduce Array Size to The Half","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"","submitted":14555,"title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.399058845454969,"acs":8565,"articleLive":2,"columnArticles":138,"formTitle":"[1339]Maximum Product of Splitted Binary Tree","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":21463,"title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5739185750636132,"acs":4511,"articleLive":2,"columnArticles":100,"formTitle":"[1340]Jump Game V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7860,"title":"Jump Game V","titleSlug":"jump-game-v"},{"acceptance":0.4681950702358866,"acs":3533,"articleLive":2,"columnArticles":51,"formTitle":"[1341]Movie Rating","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7546,"title":"Movie Rating","titleSlug":"movie-rating"},{"acceptance":0.8191546589817483,"acs":42637,"articleLive":2,"columnArticles":644,"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":52050,"title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5466046667504504,"acs":13048,"articleLive":2,"columnArticles":221,"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":23871,"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.5967832957110609,"acs":6345,"articleLive":2,"columnArticles":124,"formTitle":"[1344]Angle Between Hands of a Clock","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10632,"title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3653693891223582,"acs":5999,"articleLive":2,"columnArticles":113,"formTitle":"[1345]Jump Game IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":16419,"title":"Jump Game IV","titleSlug":"jump-game-iv"},{"acceptance":0.4336123289491165,"acs":16319,"articleLive":2,"columnArticles":276,"formTitle":"[1346]Check If N and Its Double Exist","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":37635,"title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7420627638098733,"acs":8087,"articleLive":2,"columnArticles":123,"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":10898,"title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30654440848615605,"acs":3410,"articleLive":2,"columnArticles":54,"formTitle":"[1348]Tweet Counts Per Frequency","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11124,"title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5047589806570464,"acs":3288,"articleLive":2,"columnArticles":96,"formTitle":"[1349]Maximum Students Taking Exam","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6514,"title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8474444010924698,"acs":8688,"articleLive":2,"columnArticles":88,"formTitle":"[1350]Students With Invalid Departments","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":10252,"title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7536829553076789,"acs":30338,"articleLive":2,"columnArticles":553,"formTitle":"[1351]Count Negative Numbers in a Sorted Matrix","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":40253,"title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44655750386797316,"acs":6927,"articleLive":2,"columnArticles":75,"formTitle":"[1352]Product of the Last K Numbers","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15512,"title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2862063192135665,"acs":11966,"articleLive":2,"columnArticles":161,"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":41809,"title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2814970002856871,"acs":2956,"articleLive":2,"columnArticles":72,"formTitle":"[1354]Construct Target Array With Multiple Sums","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10501,"title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6628496646491084,"acs":4052,"articleLive":2,"columnArticles":62,"formTitle":"[1355]Activity Participants","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":6113,"title":"Activity Participants","titleSlug":"activity-participants"},{"acceptance":0.7312160626341709,"acs":46324,"articleLive":2,"columnArticles":513,"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":63352,"title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5319254658385093,"acs":4282,"articleLive":2,"columnArticles":44,"formTitle":"[1357]Apply Discount Every n Orders","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8050,"title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4947962888261396,"acs":6133,"articleLive":2,"columnArticles":116,"formTitle":"[1358]Number of Substrings Containing All Three Characters","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12395,"title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5512139605462822,"acs":2906,"articleLive":2,"columnArticles":69,"formTitle":"[1359]Count All Valid Pickup and Delivery Options","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5272,"title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5060165739584516,"acs":8915,"articleLive":2,"columnArticles":145,"formTitle":"[1360]Number of Days Between Two Dates","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17618,"title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.3999897161661868,"acs":7779,"articleLive":2,"columnArticles":207,"formTitle":"[1361]Validate Binary Tree Nodes","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":19448,"title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5282841571133245,"acs":5622,"articleLive":2,"columnArticles":71,"formTitle":"[1362]Closest Divisors","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10642,"title":"Closest Divisors","titleSlug":"closest-divisors"},{"acceptance":0.3658330991851644,"acs":5208,"articleLive":2,"columnArticles":100,"formTitle":"[1363]Largest Multiple of Three","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14236,"title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6859380828049235,"acs":3678,"articleLive":2,"columnArticles":69,"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":5362,"title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8246838702294444,"acs":86478,"articleLive":2,"columnArticles":1102,"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":104862,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5394385026737968,"acs":7263,"articleLive":2,"columnArticles":143,"formTitle":"[1366]Rank Teams by Votes","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13464,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4183553125335049,"acs":15608,"articleLive":2,"columnArticles":229,"formTitle":"[1367]Linked List in Binary Tree","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"","submitted":37308,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5311443066516347,"acs":3769,"articleLive":2,"columnArticles":93,"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":7096,"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.6037696335078534,"acs":2883,"articleLive":2,"columnArticles":44,"formTitle":"[1369]Get the Second Most Recent Activity","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4775,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7902720688980232,"acs":48450,"articleLive":2,"columnArticles":580,"formTitle":"[1370]Increasing Decreasing String","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61308,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5804341361879275,"acs":21472,"articleLive":2,"columnArticles":277,"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":36993,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5151680953249438,"acs":8474,"articleLive":2,"columnArticles":169,"formTitle":"[1372]Longest ZigZag Path in a Binary Tree","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16449,"title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4055902468034493,"acs":8184,"articleLive":2,"columnArticles":176,"formTitle":"[1373]Maximum Sum BST in Binary Tree","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":20178,"title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7401740174017402,"acs":17269,"articleLive":2,"columnArticles":230,"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":23331,"title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.577630467277572,"acs":8888,"articleLive":2,"columnArticles":175,"formTitle":"[1375]Bulb Switcher III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15387,"title":"Bulb Switcher III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.505731405496939,"acs":7765,"articleLive":2,"columnArticles":158,"formTitle":"[1376]Time Needed to Inform All Employees","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15354,"title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3283435397293415,"acs":4343,"articleLive":2,"columnArticles":132,"formTitle":"[1377]Frog Position After T Seconds","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13227,"title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8627632492478593,"acs":7456,"articleLive":2,"columnArticles":63,"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":8642,"title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8381102362204724,"acs":10644,"articleLive":2,"columnArticles":167,"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":12700,"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.7290140120838154,"acs":17013,"articleLive":2,"columnArticles":257,"formTitle":"[1380]Lucky Numbers in a Matrix","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":23337,"title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7325491132740193,"acs":12268,"articleLive":2,"columnArticles":168,"formTitle":"[1381]Design a Stack With Increment Operation","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"","submitted":16747,"title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6985628954994382,"acs":11812,"articleLive":2,"columnArticles":181,"formTitle":"[1382]Balance a Binary Search Tree","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16909,"title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3249408819029072,"acs":4672,"articleLive":2,"columnArticles":88,"formTitle":"[1383]Maximum Performance of a Team","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14378,"title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.542063492063492,"acs":2049,"articleLive":2,"columnArticles":47,"formTitle":"[1384]Total Sales Amount by Year","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3780,"title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6997271148598363,"acs":14103,"articleLive":2,"columnArticles":209,"formTitle":"[1385]Find the Distance Value Between Two Arrays","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":20155,"title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3155869459327813,"acs":6479,"articleLive":2,"columnArticles":132,"formTitle":"[1386]Cinema Seat Allocation","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20530,"title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6937931034482758,"acs":10060,"articleLive":2,"columnArticles":181,"formTitle":"[1387]Sort Integers by The Power Value","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14500,"title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5432037013880205,"acs":4344,"articleLive":2,"columnArticles":54,"formTitle":"[1388]Pizza With 3n Slices","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7997,"title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8311117578579744,"acs":28557,"articleLive":2,"columnArticles":489,"formTitle":"[1389]Create Target Array in the Given Order","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":34360,"title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3620506839147492,"acs":6829,"articleLive":2,"columnArticles":120,"formTitle":"[1390]Four Divisors","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":18862,"title":"Four Divisors","titleSlug":"four-divisors"},{"acceptance":0.40025906735751293,"acs":6798,"articleLive":2,"columnArticles":207,"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":16984,"title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40843414801391,"acs":8339,"articleLive":2,"columnArticles":148,"formTitle":"[1392]Longest Happy Prefix","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":20417,"title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix"},{"acceptance":0.8565392354124749,"acs":4257,"articleLive":2,"columnArticles":66,"formTitle":"[1393]Capital Gain/Loss","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4970,"title":"Capital Gain/Loss","titleSlug":"capital-gainloss"},{"acceptance":0.6650712293660963,"acs":17647,"articleLive":2,"columnArticles":285,"formTitle":"[1394]Find Lucky Integer in an Array","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":26534,"title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7462717374477528,"acs":14462,"articleLive":2,"columnArticles":213,"formTitle":"[1395]Count Number of Teams","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19379,"title":"Count Number of Teams","titleSlug":"count-number-of-teams"},{"acceptance":0.41015143830157236,"acs":11321,"articleLive":2,"columnArticles":152,"formTitle":"[1396]Design Underground System","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":27602,"title":"Design Underground System","titleSlug":"design-underground-system"},{"acceptance":0.38025659301496795,"acs":1067,"articleLive":2,"columnArticles":37,"formTitle":"[1397]Find All Good Strings","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2806,"title":"Find All Good Strings","titleSlug":"find-all-good-strings"},{"acceptance":0.7582562747688243,"acs":4592,"articleLive":2,"columnArticles":73,"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":6056,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6706264244768285,"acs":9710,"articleLive":2,"columnArticles":156,"formTitle":"[1399]Count Largest Group","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14479,"title":"Count Largest Group","titleSlug":"count-largest-group"},{"acceptance":0.6062614725678156,"acs":5945,"articleLive":2,"columnArticles":100,"formTitle":"[1400]Construct K Palindrome Strings","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":9806,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41884435190005204,"acs":4023,"articleLive":2,"columnArticles":92,"formTitle":"[1401]Circle and Rectangle Overlapping","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9605,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7531342603145658,"acs":9912,"articleLive":2,"columnArticles":179,"formTitle":"[1402]Reducing Dishes","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13161,"title":"Reducing Dishes","titleSlug":"reducing-dishes"},{"acceptance":0.6893047112462006,"acs":21771,"articleLive":2,"columnArticles":366,"formTitle":"[1403]Minimum Subsequence in Non-Increasing Order","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31584,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.49432923964834574,"acs":7366,"articleLive":2,"columnArticles":155,"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":14901,"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.5094649494338318,"acs":5894,"articleLive":2,"columnArticles":144,"formTitle":"[1405]Longest Happy String","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11569,"title":"Longest Happy String","titleSlug":"longest-happy-string"},{"acceptance":0.5689753212782895,"acs":5003,"articleLive":2,"columnArticles":82,"formTitle":"[1406]Stone Game III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8793,"title":"Stone Game III","titleSlug":"stone-game-iii"},{"acceptance":0.6680906999671377,"acs":6099,"articleLive":2,"columnArticles":71,"formTitle":"[1407]Top Travellers","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":9129,"title":"Top Travellers","titleSlug":"top-travellers"},{"acceptance":0.6152885001561873,"acs":13788,"articleLive":2,"columnArticles":207,"formTitle":"[1408]String Matching in an Array","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":22409,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8069783263679657,"acs":8303,"articleLive":2,"columnArticles":136,"formTitle":"[1409]Queries on a Permutation With Key","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10289,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4757861635220126,"acs":7565,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML Entity Parser","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"","submitted":15900,"title":"HTML Entity Parser","titleSlug":"html-entity-parser"},{"acceptance":0.5508598482211238,"acs":7912,"articleLive":2,"columnArticles":145,"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":14363,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5525525525525525,"acs":2944,"articleLive":2,"columnArticles":72,"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":5328,"title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6934529257428763,"acs":11365,"articleLive":2,"columnArticles":235,"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":16389,"title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6039540816326531,"acs":7576,"articleLive":2,"columnArticles":151,"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":12544,"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.6860323886639677,"acs":6778,"articleLive":2,"columnArticles":183,"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":9880,"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.4108077521573065,"acs":2904,"articleLive":2,"columnArticles":54,"formTitle":"[1416]Restore The Array","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7069,"title":"Restore The Array","titleSlug":"restore-the-array"},{"acceptance":0.5202422821414615,"acs":13313,"articleLive":2,"columnArticles":185,"formTitle":"[1417]Reformat The String","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":25590,"title":"Reformat The String","titleSlug":"reformat-the-string"},{"acceptance":0.7321677931073004,"acs":26216,"articleLive":2,"columnArticles":417,"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":35806,"title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41983582709891937,"acs":8081,"articleLive":2,"columnArticles":158,"formTitle":"[1419]Minimum Number of Frogs Croaking","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19248,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.6009592326139088,"acs":2506,"articleLive":2,"columnArticles":46,"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":4170,"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.7448056709850892,"acs":3047,"articleLive":2,"columnArticles":39,"formTitle":"[1421]NPV Queries","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"lock","submitted":4091,"title":"NPV Queries","titleSlug":"npv-queries"},{"acceptance":0.54085,"acs":10817,"articleLive":2,"columnArticles":197,"formTitle":"[1422]Maximum Score After Splitting a String","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20000,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.553489308331914,"acs":35746,"articleLive":2,"columnArticles":523,"formTitle":"[1423]Maximum Points You Can Obtain from Cards","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"","submitted":64583,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.40086107921928815,"acs":6983,"articleLive":2,"columnArticles":152,"formTitle":"[1424]Diagonal Traverse II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17420,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.442550925309546,"acs":3324,"articleLive":2,"columnArticles":72,"formTitle":"[1425]Constrained Subsequence Sum","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7511,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7096040054619936,"acs":1559,"articleLive":2,"columnArticles":50,"formTitle":"[1426]Counting Elements","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2197,"title":"Counting Elements","titleSlug":"counting-elements"},{"acceptance":0.6535639412997903,"acs":1247,"articleLive":2,"columnArticles":48,"formTitle":"[1427]Perform String Shifts","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1908,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"},{"acceptance":0.5857461024498887,"acs":1052,"articleLive":2,"columnArticles":21,"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":1796,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5027624309392266,"acs":1274,"articleLive":2,"columnArticles":43,"formTitle":"[1429]First Unique Number","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2534,"title":"First Unique Number","titleSlug":"first-unique-number"},{"acceptance":0.5789877300613497,"acs":755,"articleLive":2,"columnArticles":27,"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":1304,"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.8461300276540995,"acs":79246,"articleLive":2,"columnArticles":1041,"formTitle":"[1431]Kids With the Greatest Number of Candies","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":93657,"title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3962747778537252,"acs":4638,"articleLive":2,"columnArticles":100,"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":11704,"title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6410389610389611,"acs":6170,"articleLive":2,"columnArticles":108,"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":9625,"title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46687072380266476,"acs":2593,"articleLive":2,"columnArticles":46,"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":5554,"title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6220212460522538,"acs":4333,"articleLive":2,"columnArticles":48,"formTitle":"[1435]Create a Session Bar Chart","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6966,"title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8215757796826555,"acs":45047,"articleLive":2,"columnArticles":653,"formTitle":"[1436]Destination City","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":54830,"title":"Destination City","titleSlug":"destination-city"},{"acceptance":0.585604999461265,"acs":10870,"articleLive":2,"columnArticles":181,"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":18562,"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.4825905591949657,"acs":33666,"articleLive":2,"columnArticles":473,"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":69761,"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.5650981524249422,"acs":3915,"articleLive":2,"columnArticles":60,"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":6928,"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.7014925373134329,"acs":2820,"articleLive":2,"columnArticles":40,"formTitle":"[1440]Evaluate Boolean Expression","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":4020,"title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.64932420572231,"acs":18496,"articleLive":2,"columnArticles":379,"formTitle":"[1441]Build an Array With Stack Operations","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"","submitted":28485,"title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7918490463338852,"acs":34915,"articleLive":2,"columnArticles":377,"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":44093,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4120785317968417,"acs":5793,"articleLive":2,"columnArticles":143,"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":14058,"title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5253871789845128,"acs":2680,"articleLive":2,"columnArticles":62,"formTitle":"[1444]Number of Ways of Cutting a Pizza","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5101,"title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8562996132709139,"acs":4207,"articleLive":2,"columnArticles":56,"formTitle":"[1445]Apples & Oranges","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4913,"title":"Apples & Oranges","titleSlug":"apples-oranges"},{"acceptance":0.5760324866079143,"acs":13334,"articleLive":2,"columnArticles":223,"formTitle":"[1446]Consecutive Characters","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":23148,"title":"Consecutive Characters","titleSlug":"consecutive-characters"},{"acceptance":0.6156497060612204,"acs":6074,"articleLive":2,"columnArticles":75,"formTitle":"[1447]Simplified Fractions","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9866,"title":"Simplified Fractions","titleSlug":"simplified-fractions"},{"acceptance":0.7134946677604594,"acs":10437,"articleLive":2,"columnArticles":170,"formTitle":"[1448]Count Good Nodes in Binary Tree","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":14628,"title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6279350698376746,"acs":16634,"articleLive":2,"columnArticles":208,"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":26490,"title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8030119098395616,"acs":24475,"articleLive":2,"columnArticles":347,"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":30479,"title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5260603609524291,"acs":10406,"articleLive":2,"columnArticles":158,"formTitle":"[1451]Rearrange Words in a Sentence","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19781,"title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49905185918047656,"acs":6053,"articleLive":2,"columnArticles":92,"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":12129,"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.3674500329453108,"acs":1673,"articleLive":2,"columnArticles":33,"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":4553,"title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3971353185073502,"acs":5268,"articleLive":2,"columnArticles":83,"formTitle":"[1454]Active Users","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":13265,"title":"Active Users","titleSlug":"active-users"},{"acceptance":0.6319519334463103,"acs":12306,"articleLive":2,"columnArticles":210,"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":19473,"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.5270552079903413,"acs":14406,"articleLive":2,"columnArticles":218,"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":27333,"title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6298202488861576,"acs":8199,"articleLive":2,"columnArticles":141,"formTitle":"[1457]Pseudo-Palindromic Paths in a Binary Tree","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13018,"title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44326048067200746,"acs":5699,"articleLive":2,"columnArticles":91,"formTitle":"[1458]Max Dot Product of Two Subsequences","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12857,"title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5987103174603174,"acs":2414,"articleLive":2,"columnArticles":50,"formTitle":"[1459]Rectangles Area","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":4032,"title":"Rectangles Area","titleSlug":"rectangles-area"},{"acceptance":0.74331147076865,"acs":15753,"articleLive":2,"columnArticles":316,"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":21193,"title":"Make Two Arrays Equal by Reversing Sub-arrays","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5040059469728256,"acs":6102,"articleLive":2,"columnArticles":88,"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":12107,"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.43011938749026735,"acs":6629,"articleLive":2,"columnArticles":129,"formTitle":"[1462]Course Schedule IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":15412,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"},{"acceptance":0.593311758360302,"acs":2750,"articleLive":2,"columnArticles":66,"formTitle":"[1463]Cherry Pickup II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4635,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7668183976095395,"acs":27459,"articleLive":2,"columnArticles":389,"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":35809,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3123989730911857,"acs":6571,"articleLive":2,"columnArticles":83,"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":21034,"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.4844821231109473,"acs":6572,"articleLive":2,"columnArticles":126,"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":13565,"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.6184402332361516,"acs":1697,"articleLive":2,"columnArticles":49,"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":2744,"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.7002473577692827,"acs":3114,"articleLive":2,"columnArticles":53,"formTitle":"[1468]Calculate Salaries","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4447,"title":"Calculate Salaries","titleSlug":"calculate-salaries"},{"acceptance":0.8007994670219853,"acs":2404,"articleLive":2,"columnArticles":90,"formTitle":"[1469]Find All The Lonely Nodes","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":3002,"title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8424774369630618,"acs":54328,"articleLive":2,"columnArticles":736,"formTitle":"[1470]Shuffle the Array","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":64486,"title":"Shuffle the Array","titleSlug":"shuffle-the-array"},{"acceptance":0.5455987311657414,"acs":7568,"articleLive":2,"columnArticles":108,"formTitle":"[1471]The k Strongest Values in an Array","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13871,"title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6213805309734514,"acs":8777,"articleLive":2,"columnArticles":141,"formTitle":"[1472]Design Browser History","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":14125,"title":"Design Browser History","titleSlug":"design-browser-history"},{"acceptance":0.6732818499503861,"acs":15606,"articleLive":2,"columnArticles":168,"formTitle":"[1473]Paint House III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23179,"title":"Paint House III","titleSlug":"paint-house-iii"},{"acceptance":0.7202821869488536,"acs":2042,"articleLive":2,"columnArticles":66,"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":2835,"title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.721999818032936,"acs":15871,"articleLive":2,"columnArticles":242,"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":21982,"title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8660696249410814,"acs":12862,"articleLive":2,"columnArticles":121,"formTitle":"[1476]Subrectangle Queries","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14851,"title":"Subrectangle Queries","titleSlug":"subrectangle-queries"},{"acceptance":0.2904164800716525,"acs":5188,"articleLive":2,"columnArticles":100,"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":17864,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5819126819126819,"acs":2799,"articleLive":2,"columnArticles":58,"formTitle":"[1478]Allocate Mailboxes","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4810,"title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"},{"acceptance":0.5697451356536037,"acs":2079,"articleLive":2,"columnArticles":42,"formTitle":"[1479]Sales by Day of the Week","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3649,"title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8693191676788169,"acs":130264,"articleLive":2,"columnArticles":1312,"formTitle":"[1480]Running Sum of 1d Array","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":149846,"title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5148148148148148,"acs":10425,"articleLive":2,"columnArticles":150,"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":20250,"title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5871332626369742,"acs":31559,"articleLive":2,"columnArticles":412,"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":53751,"title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30107620964213844,"acs":3441,"articleLive":2,"columnArticles":72,"formTitle":"[1483]Kth Ancestor of a Tree Node","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11429,"title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8089233753637245,"acs":834,"articleLive":2,"columnArticles":25,"formTitle":"[1484]Clone Binary Tree With Random Pointer","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":1031,"title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.658311345646438,"acs":3992,"articleLive":2,"columnArticles":47,"formTitle":"[1485]Group Sold Products By The Date","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":6064,"title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8584219294986276,"acs":71619,"articleLive":2,"columnArticles":695,"formTitle":"[1486]XOR Operation in an Array","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"","submitted":83431,"title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31267549930789007,"acs":7906,"articleLive":2,"columnArticles":107,"formTitle":"[1487]Making File Names Unique","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25285,"title":"Making File Names Unique","titleSlug":"making-file-names-unique"},{"acceptance":0.23980168193799423,"acs":7642,"articleLive":2,"columnArticles":115,"formTitle":"[1488]Avoid Flood in The City","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":31868,"title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6898655452230054,"acs":11647,"articleLive":2,"columnArticles":125,"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":16883,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8554873892297206,"acs":1255,"articleLive":2,"columnArticles":31,"formTitle":"[1490]Clone N-ary Tree","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1467,"title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree"},{"acceptance":0.671242369245999,"acs":20342,"articleLive":2,"columnArticles":303,"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":30305,"title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6568128069856285,"acs":7221,"articleLive":2,"columnArticles":84,"formTitle":"[1492]The kth Factor of n","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10994,"title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5692894280762565,"acs":8212,"articleLive":2,"columnArticles":158,"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":14425,"title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.373348192962904,"acs":2345,"articleLive":2,"columnArticles":37,"formTitle":"[1494]Parallel Courses II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6281,"title":"Parallel Courses II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5417156286721504,"acs":4149,"articleLive":2,"columnArticles":41,"formTitle":"[1495]Friendly Movies Streamed Last Month","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7659,"title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5366704374057315,"acs":11386,"articleLive":2,"columnArticles":171,"formTitle":"[1496]Path Crossing","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21216,"title":"Path Crossing","titleSlug":"path-crossing"},{"acceptance":0.3924809298946604,"acs":8644,"articleLive":2,"columnArticles":117,"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":22024,"title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3349502487562189,"acs":5386,"articleLive":2,"columnArticles":69,"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":16080,"title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3757496740547588,"acs":2882,"articleLive":2,"columnArticles":63,"formTitle":"[1499]Max Value of Equation","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7670,"title":"Max Value of Equation","titleSlug":"max-value-of-equation"},{"acceptance":0.29482874412357285,"acs":878,"articleLive":2,"columnArticles":29,"formTitle":"[1500]Design a File Sharing System","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2978,"title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5930200222469411,"acs":4265,"articleLive":2,"columnArticles":62,"formTitle":"[1501]Countries You Can Safely Invest In","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":7192,"title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7162400220203688,"acs":26021,"articleLive":2,"columnArticles":310,"formTitle":"[1502]Can Make Arithmetic Progression From Sequence","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":36330,"title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5144154236188904,"acs":8725,"articleLive":2,"columnArticles":89,"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":16961,"title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5972006220839814,"acs":7680,"articleLive":2,"columnArticles":136,"formTitle":"[1504]Count Submatrices With All Ones","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12860,"title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36223277909738716,"acs":3355,"articleLive":2,"columnArticles":74,"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":9262,"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.8328804347826086,"acs":613,"articleLive":2,"columnArticles":18,"formTitle":"[1506]Find Root of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":736,"title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5888603456328818,"acs":10086,"articleLive":2,"columnArticles":134,"formTitle":"[1507]Reformat Date","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17128,"title":"Reformat Date","titleSlug":"reformat-date"},{"acceptance":0.5532329495128432,"acs":6246,"articleLive":2,"columnArticles":55,"formTitle":"[1508]Range Sum of Sorted Subarray Sums","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11290,"title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5503430185633575,"acs":5455,"articleLive":2,"columnArticles":80,"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":9912,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5784758323194337,"acs":5230,"articleLive":2,"columnArticles":64,"formTitle":"[1510]Stone Game IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9041,"title":"Stone Game IV","titleSlug":"stone-game-iv"},{"acceptance":0.6819727891156463,"acs":4411,"articleLive":2,"columnArticles":65,"formTitle":"[1511]Customer Order Frequency","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6468,"title":"Customer Order Frequency","titleSlug":"customer-order-frequency"},{"acceptance":0.84835670091389,"acs":59782,"articleLive":2,"columnArticles":758,"formTitle":"[1512]Number of Good Pairs","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":70468,"title":"Number of Good Pairs","titleSlug":"number-of-good-pairs"},{"acceptance":0.3811087044808447,"acs":11261,"articleLive":2,"columnArticles":155,"formTitle":"[1513]Number of Substrings With Only 1s","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29548,"title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3305568590646019,"acs":8453,"articleLive":2,"columnArticles":146,"formTitle":"[1514]Path with Maximum Probability","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":25572,"title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3436971235194585,"acs":3250,"articleLive":2,"columnArticles":61,"formTitle":"[1515]Best Position for a Service Centre","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9456,"title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5855421686746988,"acs":243,"articleLive":2,"columnArticles":13,"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":415,"title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7089789431863329,"acs":3569,"articleLive":2,"columnArticles":38,"formTitle":"[1517]Find Users With Valid E-Mails","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":5034,"title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6735787017394994,"acs":25402,"articleLive":2,"columnArticles":402,"formTitle":"[1518]Water Bottles","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37712,"title":"Water Bottles","titleSlug":"water-bottles"},{"acceptance":0.29893599957226114,"acs":5591,"articleLive":2,"columnArticles":124,"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":18703,"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.33468374281233665,"acs":2561,"articleLive":2,"columnArticles":72,"formTitle":"[1520]Maximum Number of Non-Overlapping Substrings","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7652,"title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3903318903318903,"acs":2705,"articleLive":2,"columnArticles":53,"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":6930,"title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.708706265256306,"acs":871,"articleLive":2,"columnArticles":30,"formTitle":"[1522]Diameter of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1229,"title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5765379908777395,"acs":10365,"articleLive":2,"columnArticles":174,"formTitle":"[1523]Count Odd Numbers in an Interval Range","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17978,"title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4326705463950857,"acs":5353,"articleLive":2,"columnArticles":106,"formTitle":"[1524]Number of Sub-arrays With Odd Sum","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12372,"title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6611326975156011,"acs":5615,"articleLive":2,"columnArticles":113,"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":8493,"title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6189668174962293,"acs":3283,"articleLive":2,"columnArticles":51,"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":5304,"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.49677079214445763,"acs":3769,"articleLive":2,"columnArticles":40,"formTitle":"[1527]Patients With a Condition","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7587,"title":"Patients With a Condition","titleSlug":"patients-with-a-condition"},{"acceptance":0.7843955650014084,"acs":30633,"articleLive":2,"columnArticles":362,"formTitle":"[1528]Shuffle String","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39053,"title":"Shuffle String","titleSlug":"shuffle-string"},{"acceptance":0.6922842794095267,"acs":9098,"articleLive":2,"columnArticles":137,"formTitle":"[1529]Bulb Switcher IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13142,"title":"Bulb Switcher IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.569216,"acs":8894,"articleLive":2,"columnArticles":149,"formTitle":"[1530]Number of Good Leaf Nodes Pairs","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15625,"title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3436026936026936,"acs":2041,"articleLive":2,"columnArticles":35,"formTitle":"[1531]String Compression II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5940,"title":"String Compression II","titleSlug":"string-compression-ii"},{"acceptance":0.6215113782739373,"acs":2895,"articleLive":2,"columnArticles":51,"formTitle":"[1532]The Most Recent Three Orders","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4658,"title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6003683241252302,"acs":326,"articleLive":2,"columnArticles":19,"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":543,"title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7885537578989826,"acs":17595,"articleLive":2,"columnArticles":165,"formTitle":"[1534]Count Good Triplets","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":22313,"title":"Count Good Triplets","titleSlug":"count-good-triplets"},{"acceptance":0.4535498871179701,"acs":13460,"articleLive":2,"columnArticles":184,"formTitle":"[1535]Find the Winner of an Array Game","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29677,"title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44211640211640213,"acs":4178,"articleLive":2,"columnArticles":81,"formTitle":"[1536]Minimum Swaps to Arrange a Binary Grid","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9450,"title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36651438647110685,"acs":4573,"articleLive":2,"columnArticles":92,"formTitle":"[1537]Get the Maximum Score","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12477,"title":"Get the Maximum Score","titleSlug":"get-the-maximum-score"},{"acceptance":0.6073059360730594,"acs":133,"articleLive":2,"columnArticles":7,"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":219,"title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5398917024007012,"acs":17249,"articleLive":2,"columnArticles":255,"formTitle":"[1539]Kth Missing Positive Number","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":31949,"title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31809145129224653,"acs":4960,"articleLive":2,"columnArticles":89,"formTitle":"[1540]Can Convert String in K Moves","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15593,"title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4614249889364213,"acs":6256,"articleLive":2,"columnArticles":96,"formTitle":"[1541]Minimum Insertions to Balance a Parentheses String","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"","submitted":13558,"title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3865242893668221,"acs":2570,"articleLive":2,"columnArticles":49,"formTitle":"[1542]Find Longest Awesome Substring","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6649,"title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5547522482807266,"acs":3146,"articleLive":2,"columnArticles":45,"formTitle":"[1543]Fix Product Name Format","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5671,"title":"Fix Product Name Format","titleSlug":"fix-product-name-format"},{"acceptance":0.5491814260068059,"acs":20496,"articleLive":2,"columnArticles":326,"formTitle":"[1544]Make The String Great","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"","submitted":37321,"title":"Make The String Great","titleSlug":"make-the-string-great"},{"acceptance":0.5544676530316217,"acs":7645,"articleLive":2,"columnArticles":102,"formTitle":"[1545]Find Kth Bit in Nth Binary String","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13788,"title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.41678442455644527,"acs":5309,"articleLive":2,"columnArticles":80,"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":12738,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5368393647487634,"acs":4124,"articleLive":2,"columnArticles":73,"formTitle":"[1547]Minimum Cost to Cut a Stick","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7682,"title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7064393939393939,"acs":373,"articleLive":2,"columnArticles":14,"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":528,"title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6682889344262295,"acs":2609,"articleLive":2,"columnArticles":51,"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":3904,"title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6571910891387575,"acs":21801,"articleLive":2,"columnArticles":295,"formTitle":"[1550]Three Consecutive Odds","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":33173,"title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds"},{"acceptance":0.8172795430203499,"acs":11446,"articleLive":2,"columnArticles":159,"formTitle":"[1551]Minimum Operations to Make Array Equal","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14005,"title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5117332460161537,"acs":9377,"articleLive":2,"columnArticles":126,"formTitle":"[1552]Magnetic Force Between Two Balls","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18324,"title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2957556197695801,"acs":7881,"articleLive":2,"columnArticles":123,"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":26647,"title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7021791767554479,"acs":580,"articleLive":2,"columnArticles":20,"formTitle":"[1554]Strings Differ by One Character","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":826,"title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43766541301016854,"acs":3142,"articleLive":2,"columnArticles":60,"formTitle":"[1555]Bank Account Summary","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":7179,"title":"Bank Account Summary","titleSlug":"bank-account-summary"},{"acceptance":0.5767876898320426,"acs":11470,"articleLive":2,"columnArticles":178,"formTitle":"[1556]Thousand Separator","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":19886,"title":"Thousand Separator","titleSlug":"thousand-separator"},{"acceptance":0.7706825469537334,"acs":8412,"articleLive":2,"columnArticles":120,"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":10915,"title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6232041203578206,"acs":4598,"articleLive":2,"columnArticles":73,"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":7378,"title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3713748391566861,"acs":3752,"articleLive":2,"columnArticles":70,"formTitle":"[1559]Detect Cycles in 2D Grid","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10103,"title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5720676911106789,"acs":8823,"articleLive":2,"columnArticles":92,"formTitle":"[1560]Most Visited Sector in a Circular Track","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15423,"title":"Most Visited Sector in a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7793518338831749,"acs":12048,"articleLive":2,"columnArticles":177,"formTitle":"[1561]Maximum Number of Coins You Can Get","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15459,"title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30985001442169025,"acs":4297,"articleLive":2,"columnArticles":89,"formTitle":"[1562]Find Latest Group of Size M","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13868,"title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3803939962476548,"acs":4055,"articleLive":2,"columnArticles":66,"formTitle":"[1563]Stone Game V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10660,"title":"Stone Game V","titleSlug":"stone-game-v"},{"acceptance":0.556078431372549,"acs":709,"articleLive":2,"columnArticles":25,"formTitle":"[1564]Put Boxes Into the Warehouse I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1275,"title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.72840790842872,"acs":3500,"articleLive":2,"columnArticles":46,"formTitle":"[1565]Unique Orders and Customers Per Month","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4805,"title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4453647833241909,"acs":8119,"articleLive":2,"columnArticles":123,"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":18230,"title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.40432469997059844,"acs":15127,"articleLive":2,"columnArticles":240,"formTitle":"[1567]Maximum Length of Subarray With Positive Product","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":37413,"title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4581169955001731,"acs":2647,"articleLive":2,"columnArticles":48,"formTitle":"[1568]Minimum Number of Days to Disconnect Island","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5778,"title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47496070065124635,"acs":2115,"articleLive":2,"columnArticles":47,"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":4453,"title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8917112299465241,"acs":2001,"articleLive":2,"columnArticles":40,"formTitle":"[1570]Dot Product of Two Sparse Vectors","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":2244,"title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7580304311073541,"acs":3587,"articleLive":2,"columnArticles":46,"formTitle":"[1571]Warehouse Manager","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4732,"title":"Warehouse Manager","titleSlug":"warehouse-manager"},{"acceptance":0.8049372557087019,"acs":19564,"articleLive":2,"columnArticles":330,"formTitle":"[1572]Matrix Diagonal Sum","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":24305,"title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29667205169628436,"acs":4591,"articleLive":2,"columnArticles":66,"formTitle":"[1573]Number of Ways to Split a String","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15475,"title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3301680058436815,"acs":4972,"articleLive":2,"columnArticles":86,"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":15059,"title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5968526100307062,"acs":4665,"articleLive":2,"columnArticles":71,"formTitle":"[1575]Count All Possible Routes","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7816,"title":"Count All Possible Routes","titleSlug":"count-all-possible-routes"},{"acceptance":0.47705659200748324,"acs":18360,"articleLive":2,"columnArticles":260,"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":38486,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3268314099347717,"acs":5211,"articleLive":2,"columnArticles":82,"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":15944,"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.5830370215436101,"acs":11150,"articleLive":2,"columnArticles":209,"formTitle":"[1578]Minimum Deletion Cost to Avoid Repeating Letters","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19124,"title":"Minimum Deletion Cost to Avoid Repeating Letters","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6194632919112601,"acs":16251,"articleLive":2,"columnArticles":297,"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":26234,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6369426751592356,"acs":300,"articleLive":2,"columnArticles":21,"formTitle":"[1580]Put Boxes Into the Warehouse II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":471,"title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8042201435718948,"acs":3697,"articleLive":2,"columnArticles":53,"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":4597,"title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6699330945461918,"acs":9913,"articleLive":2,"columnArticles":115,"formTitle":"[1582]Special Positions in a Binary Matrix","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14797,"title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6851581863245371,"acs":18798,"articleLive":2,"columnArticles":244,"formTitle":"[1583]Count Unhappy Friends","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27436,"title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends"},{"acceptance":0.663519313304721,"acs":27055,"articleLive":2,"columnArticles":340,"formTitle":"[1584]Min Cost to Connect All Points","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":40775,"title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4302075876879026,"acs":2404,"articleLive":2,"columnArticles":42,"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":5588,"title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.622154779969651,"acs":410,"articleLive":2,"columnArticles":23,"formTitle":"[1586]Binary Search Tree Iterator II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":659,"title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8287841191066998,"acs":3674,"articleLive":2,"columnArticles":44,"formTitle":"[1587]Bank Account Summary II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4433,"title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8388777102882825,"acs":44609,"articleLive":2,"columnArticles":710,"formTitle":"[1588]Sum of All Odd Length Subarrays","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":53177,"title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29438734008725875,"acs":3981,"articleLive":2,"columnArticles":57,"formTitle":"[1589]Maximum Sum Obtained of Any Permutation","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13523,"title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2716233489561142,"acs":3825,"articleLive":2,"columnArticles":58,"formTitle":"[1590]Make Sum Divisible by P","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14082,"title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5803134182174339,"acs":1185,"articleLive":2,"columnArticles":33,"formTitle":"[1591]Strange Printer II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2042,"title":"Strange Printer II","titleSlug":"strange-printer-ii"},{"acceptance":0.44495821727019497,"acs":7987,"articleLive":2,"columnArticles":126,"formTitle":"[1592]Rearrange Spaces Between Words","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17950,"title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5379982793232004,"acs":5628,"articleLive":2,"columnArticles":93,"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":10461,"title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3135068153655514,"acs":4301,"articleLive":2,"columnArticles":101,"formTitle":"[1594]Maximum Non Negative Product in a Matrix","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13719,"title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4678163711440369,"acs":1926,"articleLive":2,"columnArticles":39,"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":4117,"title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7528483786152498,"acs":2577,"articleLive":2,"columnArticles":44,"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":3423,"title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6703296703296703,"acs":305,"articleLive":2,"columnArticles":21,"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":455,"title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6716619652092148,"acs":11429,"articleLive":2,"columnArticles":151,"formTitle":"[1598]Crawler Log Folder","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"","submitted":17016,"title":"Crawler Log Folder","titleSlug":"crawler-log-folder"},{"acceptance":0.4204484497371527,"acs":3919,"articleLive":2,"columnArticles":70,"formTitle":"[1599]Maximum Profit of Operating a Centennial Wheel","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9321,"title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6772096710265557,"acs":17086,"articleLive":2,"columnArticles":209,"formTitle":"[1600]Throne Inheritance","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25230,"title":"Throne Inheritance","titleSlug":"throne-inheritance"},{"acceptance":0.4919158361018826,"acs":2221,"articleLive":2,"columnArticles":40,"formTitle":"[1601]Maximum Number of Achievable Transfer Requests","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4515,"title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7704280155642024,"acs":792,"articleLive":2,"columnArticles":31,"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":1028,"title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443499905384357,"acs":58006,"articleLive":2,"columnArticles":465,"formTitle":"[1603]Design Parking System","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"","submitted":68699,"title":"Design Parking System","titleSlug":"design-parking-system"},{"acceptance":0.41636039063320385,"acs":3965,"articleLive":2,"columnArticles":66,"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":9523,"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.739613327848622,"acs":3596,"articleLive":2,"columnArticles":72,"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":4862,"title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3433808553971487,"acs":1686,"articleLive":2,"columnArticles":36,"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":4910,"title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5416666666666666,"acs":3042,"articleLive":2,"columnArticles":42,"formTitle":"[1607]Sellers With No Sales","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5616,"title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6381381381381381,"acs":10200,"articleLive":2,"columnArticles":168,"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":15984,"title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5117819821050474,"acs":7493,"articleLive":2,"columnArticles":137,"formTitle":"[1609]Even Odd Tree","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14641,"title":"Even Odd Tree","titleSlug":"even-odd-tree"},{"acceptance":0.27171592313743115,"acs":2418,"articleLive":2,"columnArticles":41,"formTitle":"[1610]Maximum Number of Visible Points","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8899,"title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6096045197740113,"acs":2158,"articleLive":2,"columnArticles":58,"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":3540,"title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7338461538461538,"acs":477,"articleLive":2,"columnArticles":22,"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":650,"title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7305699481865285,"acs":1833,"articleLive":2,"columnArticles":37,"formTitle":"[1613]Find the Missing IDs","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2509,"title":"Find the Missing IDs","titleSlug":"find-the-missing-ids"},{"acceptance":0.8224421822958202,"acs":17532,"articleLive":2,"columnArticles":294,"formTitle":"[1614]Maximum Nesting Depth of the Parentheses","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":21317,"title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49882607910420806,"acs":5524,"articleLive":2,"columnArticles":67,"formTitle":"[1615]Maximal Network Rank","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11074,"title":"Maximal Network Rank","titleSlug":"maximal-network-rank"},{"acceptance":0.2762656359048693,"acs":5146,"articleLive":2,"columnArticles":95,"formTitle":"[1616]Split Two Strings to Make Palindrome","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18627,"title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6226153312521678,"acs":1795,"articleLive":2,"columnArticles":34,"formTitle":"[1617]Count Subtrees With Max Distance Between Cities","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2883,"title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5728476821192053,"acs":346,"articleLive":2,"columnArticles":18,"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":604,"title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6731120982492814,"acs":7728,"articleLive":2,"columnArticles":134,"formTitle":"[1619]Mean of Array After Removing Some Elements","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11481,"title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3745449250036406,"acs":2572,"articleLive":2,"columnArticles":44,"formTitle":"[1620]Coordinate With Maximum Network Quality","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6867,"title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44305019305019305,"acs":1836,"articleLive":2,"columnArticles":37,"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":4144,"title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.1531207133058985,"acs":2679,"articleLive":2,"columnArticles":58,"formTitle":"[1622]Fancy Sequence","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":17496,"title":"Fancy Sequence","titleSlug":"fancy-sequence"},{"acceptance":0.7850141581354825,"acs":3604,"articleLive":2,"columnArticles":48,"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":4591,"title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6204525067277983,"acs":12450,"articleLive":2,"columnArticles":217,"formTitle":"[1624]Largest Substring Between Two Equal Characters","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":20066,"title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5446638883855771,"acs":3006,"articleLive":2,"columnArticles":69,"formTitle":"[1625]Lexicographically Smallest String After Applying Operations","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5519,"title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38775117777136814,"acs":4033,"articleLive":2,"columnArticles":86,"formTitle":"[1626]Best Team With No Conflicts","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10401,"title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38442785311595307,"acs":2523,"articleLive":2,"columnArticles":40,"formTitle":"[1627]Graph Connectivity With Threshold","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6563,"title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8330134357005758,"acs":434,"articleLive":2,"columnArticles":19,"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":521,"title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5247619617941194,"acs":8763,"articleLive":2,"columnArticles":102,"formTitle":"[1629]Slowest Key","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":16699,"title":"Slowest Key","titleSlug":"slowest-key"},{"acceptance":0.7670391623879996,"acs":7619,"articleLive":2,"columnArticles":119,"formTitle":"[1630]Arithmetic Subarrays","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9933,"title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4938001458789205,"acs":26403,"articleLive":2,"columnArticles":309,"formTitle":"[1631]Path With Minimum Effort","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":53469,"title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31970896640273916,"acs":1494,"articleLive":2,"columnArticles":27,"formTitle":"[1632]Rank Transform of a Matrix","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4673,"title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6567198177676538,"acs":2883,"articleLive":2,"columnArticles":30,"formTitle":"[1633]Percentage of Users Attended a Contest","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4390,"title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5361702127659574,"acs":504,"articleLive":2,"columnArticles":27,"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":940,"title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5471215351812366,"acs":1283,"articleLive":2,"columnArticles":36,"formTitle":"[1635]Hopper Company Queries I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2345,"title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7058955223880597,"acs":9459,"articleLive":2,"columnArticles":189,"formTitle":"[1636]Sort Array by Increasing Frequency","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":13400,"title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.806910569105691,"acs":5558,"articleLive":2,"columnArticles":74,"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":6888,"title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7131541046567451,"acs":2971,"articleLive":2,"columnArticles":52,"formTitle":"[1638]Count Substrings That Differ by One Character","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4166,"title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.3965259059598682,"acs":1324,"articleLive":2,"columnArticles":30,"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":3339,"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.6558346389043311,"acs":12977,"articleLive":2,"columnArticles":222,"formTitle":"[1640]Check Array Formation Through Concatenation","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19787,"title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7720210499937351,"acs":12323,"articleLive":2,"columnArticles":283,"formTitle":"[1641]Count Sorted Vowel Strings","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15962,"title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45203917359806817,"acs":6739,"articleLive":2,"columnArticles":109,"formTitle":"[1642]Furthest Building You Can Reach","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14908,"title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4537847830317182,"acs":2332,"articleLive":2,"columnArticles":49,"formTitle":"[1643]Kth Smallest Instructions","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5139,"title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5455717970765263,"acs":1269,"articleLive":2,"columnArticles":26,"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":2326,"title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4087038789025544,"acs":864,"articleLive":2,"columnArticles":25,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":2114,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5348743508625321,"acs":35843,"articleLive":2,"columnArticles":363,"formTitle":"[1646]Get Maximum in Generated Array","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","submitted":67012,"title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5166621511785424,"acs":7628,"articleLive":2,"columnArticles":115,"formTitle":"[1647]Minimum Deletions to Make Character Frequencies Unique","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14764,"title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27762281109561443,"acs":3583,"articleLive":2,"columnArticles":93,"formTitle":"[1648]Sell Diminishing-Valued Colored Balls","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12906,"title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474115931461903,"acs":2601,"articleLive":2,"columnArticles":67,"formTitle":"[1649]Create Sorted Array through Instructions","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5486,"title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7944664031620553,"acs":1608,"articleLive":2,"columnArticles":31,"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":2024,"title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.670265780730897,"acs":807,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1204,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6509384318540606,"acs":7422,"articleLive":2,"columnArticles":180,"formTitle":"[1652]Defuse the Bomb","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11402,"title":"Defuse the Bomb","titleSlug":"defuse-the-bomb"},{"acceptance":0.510666143174977,"acs":3902,"articleLive":2,"columnArticles":90,"formTitle":"[1653]Minimum Deletions to Make String Balanced","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7641,"title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27790349660559166,"acs":3807,"articleLive":2,"columnArticles":51,"formTitle":"[1654]Minimum Jumps to Reach Home","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":13699,"title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38156947444204464,"acs":2120,"articleLive":2,"columnArticles":33,"formTitle":"[1655]Distribute Repeating Integers","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5556,"title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7826338639652677,"acs":8112,"articleLive":2,"columnArticles":97,"formTitle":"[1656]Design an Ordered Stream","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10365,"title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46479570780024765,"acs":5631,"articleLive":2,"columnArticles":77,"formTitle":"[1657]Determine if Two Strings Are Close","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12115,"title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.30182158775272916,"acs":9345,"articleLive":2,"columnArticles":154,"formTitle":"[1658]Minimum Operations to Reduce X to Zero","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":30962,"title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4167675544794189,"acs":1377,"articleLive":2,"columnArticles":25,"formTitle":"[1659]Maximize Grid Happiness","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3304,"title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7461406518010292,"acs":435,"articleLive":2,"columnArticles":24,"formTitle":"[1660]Correct a Binary Tree","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":583,"title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7296459033341949,"acs":2823,"articleLive":2,"columnArticles":57,"formTitle":"[1661]Average Time of Process per Machine","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3869,"title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8127128263337117,"acs":21480,"articleLive":2,"columnArticles":297,"formTitle":"[1662]Check If Two String Arrays are Equivalent","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":26430,"title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5722505462490896,"acs":7857,"articleLive":2,"columnArticles":135,"formTitle":"[1663]Smallest String With A Given Numeric Value","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13730,"title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5478166370282553,"acs":5545,"articleLive":2,"columnArticles":109,"formTitle":"[1664]Ways to Make a Fair Array","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10122,"title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6595031055900621,"acs":5309,"articleLive":2,"columnArticles":84,"formTitle":"[1665]Minimum Initial Energy to Finish Tasks","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8050,"title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6939313984168866,"acs":263,"articleLive":2,"columnArticles":14,"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":379,"title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6037493579866461,"acs":2351,"articleLive":2,"columnArticles":34,"formTitle":"[1667]Fix Names in a Table","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3894,"title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44259689448587847,"acs":7240,"articleLive":2,"columnArticles":133,"formTitle":"[1668]Maximum Repeating Substring","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":16358,"title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7579646264576243,"acs":13585,"articleLive":2,"columnArticles":254,"formTitle":"[1669]Merge In Between Linked Lists","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"","submitted":17923,"title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5254451464675474,"acs":4574,"articleLive":2,"columnArticles":80,"formTitle":"[1670]Design Front Middle Back Queue","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"","submitted":8705,"title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4671549045716822,"acs":2105,"articleLive":2,"columnArticles":44,"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":4506,"title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8497093649085038,"acs":39469,"articleLive":2,"columnArticles":455,"formTitle":"[1672]Richest Customer Wealth","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":46450,"title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth"},{"acceptance":0.3576164997484794,"acs":7820,"articleLive":2,"columnArticles":172,"formTitle":"[1673]Find the Most Competitive Subsequence","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"","submitted":21867,"title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36648171859439466,"acs":2576,"articleLive":2,"columnArticles":54,"formTitle":"[1674]Minimum Moves to Make Array Complementary","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7029,"title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4346499678869621,"acs":2707,"articleLive":2,"columnArticles":44,"formTitle":"[1675]Minimize Deviation in Array","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6228,"title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7707112970711297,"acs":921,"articleLive":2,"columnArticles":23,"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":1195,"title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38184691011235955,"acs":2175,"articleLive":2,"columnArticles":37,"formTitle":"[1677]Product's Worth Over Invoices","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5696,"title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8281546654318129,"acs":17884,"articleLive":2,"columnArticles":295,"formTitle":"[1678]Goal Parser Interpretation","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21595,"title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4978519955654102,"acs":7185,"articleLive":2,"columnArticles":116,"formTitle":"[1679]Max Number of K-Sum Pairs","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14432,"title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46824995789119084,"acs":5560,"articleLive":2,"columnArticles":73,"formTitle":"[1680]Concatenation of Consecutive Binary Numbers","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11874,"title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3854828462515883,"acs":2427,"articleLive":2,"columnArticles":50,"formTitle":"[1681]Minimum Incompatibility","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6296,"title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"},{"acceptance":0.5261584454409567,"acs":352,"articleLive":2,"columnArticles":17,"formTitle":"[1682]Longest Palindromic Subsequence II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":669,"title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8979839689094,"acs":3697,"articleLive":2,"columnArticles":40,"formTitle":"[1683]Invalid Tweets","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":4117,"title":"Invalid Tweets","titleSlug":"invalid-tweets"},{"acceptance":0.8271587678829395,"acs":17750,"articleLive":2,"columnArticles":365,"formTitle":"[1684]Count the Number of Consistent Strings","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":21459,"title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6044142614601019,"acs":3916,"articleLive":2,"columnArticles":90,"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":6479,"title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47265429001505266,"acs":2826,"articleLive":2,"columnArticles":50,"formTitle":"[1686]Stone Game VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5979,"title":"Stone Game VI","titleSlug":"stone-game-vi"},{"acceptance":0.40137429264349234,"acs":993,"articleLive":2,"columnArticles":24,"formTitle":"[1687]Delivering Boxes from Storage to Ports","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2474,"title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.805937697659709,"acs":20387,"articleLive":2,"columnArticles":276,"formTitle":"[1688]Count of Matches in Tournament","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":25296,"title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8657462644167945,"acs":15238,"articleLive":2,"columnArticles":203,"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":17601,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5193718477762495,"acs":4531,"articleLive":2,"columnArticles":108,"formTitle":"[1690]Stone Game VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8724,"title":"Stone Game VII","titleSlug":"stone-game-vii"},{"acceptance":0.48997641509433965,"acs":2493,"articleLive":2,"columnArticles":63,"formTitle":"[1691]Maximum Height by Stacking Cuboids ","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5088,"title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6555183946488294,"acs":196,"articleLive":2,"columnArticles":13,"formTitle":"[1692]Count Ways to Distribute Candies","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":299,"title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8031651829871415,"acs":2436,"articleLive":2,"columnArticles":36,"formTitle":"[1693]Daily Leads and Partners","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":3033,"title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6356927471829869,"acs":8011,"articleLive":2,"columnArticles":139,"formTitle":"[1694]Reformat Phone Number","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12602,"title":"Reformat Phone Number","titleSlug":"reformat-phone-number"},{"acceptance":0.4693534844668346,"acs":6708,"articleLive":2,"columnArticles":138,"formTitle":"[1695]Maximum Erasure Value","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":14292,"title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value"},{"acceptance":0.39689753378173664,"acs":6550,"articleLive":2,"columnArticles":118,"formTitle":"[1696]Jump Game VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":16503,"title":"Jump Game VI","titleSlug":"jump-game-vi"},{"acceptance":0.5296191819464033,"acs":2253,"articleLive":2,"columnArticles":44,"formTitle":"[1697]Checking Existence of Edge Length Limited Paths","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4254,"title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5089641434262948,"acs":511,"articleLive":2,"columnArticles":17,"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":1004,"title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8060187067913787,"acs":1982,"articleLive":2,"columnArticles":44,"formTitle":"[1699]Number of Calls Between Two Persons","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2459,"title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7069508355534028,"acs":8757,"articleLive":2,"columnArticles":191,"formTitle":"[1700]Number of Students Unable to Eat Lunch","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":12387,"title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6135061802833887,"acs":4070,"articleLive":2,"columnArticles":83,"formTitle":"[1701]Average Waiting Time","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6634,"title":"Average Waiting Time","titleSlug":"average-waiting-time"},{"acceptance":0.47795497185741087,"acs":3057,"articleLive":2,"columnArticles":68,"formTitle":"[1702]Maximum Binary String After Change","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6396,"title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3879334648999154,"acs":1376,"articleLive":2,"columnArticles":25,"formTitle":"[1703]Minimum Adjacent Swaps for K Consecutive Ones","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3547,"title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7805180319742223,"acs":12596,"articleLive":2,"columnArticles":196,"formTitle":"[1704]Determine if String Halves Are Alike","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16138,"title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3477008114783018,"acs":5913,"articleLive":2,"columnArticles":123,"formTitle":"[1705]Maximum Number of Eaten Apples","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":17006,"title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5891635981062598,"acs":4480,"articleLive":2,"columnArticles":112,"formTitle":"[1706]Where Will the Ball Fall","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7604,"title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5026159626391377,"acs":14314,"articleLive":2,"columnArticles":151,"formTitle":"[1707]Maximum XOR With an Element From Array","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28479,"title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7015558698727016,"acs":992,"articleLive":2,"columnArticles":25,"formTitle":"[1708]Largest Subarray Length K","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1414,"title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7115298340062809,"acs":1586,"articleLive":2,"columnArticles":39,"formTitle":"[1709]Biggest Window Between Visits","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2229,"title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits"},{"acceptance":0.694389625035241,"acs":12315,"articleLive":2,"columnArticles":196,"formTitle":"[1710]Maximum Units on a Truck","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":17735,"title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.358885182293515,"acs":30338,"articleLive":2,"columnArticles":361,"formTitle":"[1711]Count Good Meals","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"","submitted":84534,"title":"Count Good Meals","titleSlug":"count-good-meals"},{"acceptance":0.26336233685518956,"acs":6780,"articleLive":2,"columnArticles":107,"formTitle":"[1712]Ways to Split Array Into Three Subarrays","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":25744,"title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4943749804142772,"acs":15776,"articleLive":2,"columnArticles":171,"formTitle":"[1713]Minimum Operations to Make a Subsequence","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"","submitted":31911,"title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6361323155216285,"acs":250,"articleLive":2,"columnArticles":10,"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":393,"title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7303413885692367,"acs":1904,"articleLive":2,"columnArticles":37,"formTitle":"[1715]Count Apples and Oranges","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2607,"title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6703906310193389,"acs":8701,"articleLive":2,"columnArticles":198,"formTitle":"[1716]Calculate Money in Leetcode Bank","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12979,"title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43587307619228577,"acs":2294,"articleLive":2,"columnArticles":50,"formTitle":"[1717]Maximum Score From Removing Substrings","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5263,"title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.49206725076959507,"acs":2078,"articleLive":2,"columnArticles":50,"formTitle":"[1718]Construct the Lexicographically Largest Valid Sequence","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4223,"title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.37285223367697595,"acs":651,"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":1746,"title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8690773297838907,"acs":47011,"articleLive":2,"columnArticles":494,"formTitle":"[1720]Decode XORed Array","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"","submitted":54093,"title":"Decode XORed Array","titleSlug":"decode-xored-array"},{"acceptance":0.6459915140687807,"acs":11571,"articleLive":2,"columnArticles":178,"formTitle":"[1721]Swapping Nodes in a Linked List","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"","submitted":17912,"title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5169564284181155,"acs":4817,"articleLive":2,"columnArticles":114,"formTitle":"[1722]Minimize Hamming Distance After Swap Operations","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9318,"title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5057596546344383,"acs":23665,"articleLive":2,"columnArticles":176,"formTitle":"[1723]Find Minimum Time to Finish All Jobs","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"","submitted":46791,"title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5674418604651162,"acs":366,"articleLive":2,"columnArticles":13,"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":645,"title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7887133504127526,"acs":11083,"articleLive":2,"columnArticles":152,"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":14052,"title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.48391763104152485,"acs":5687,"articleLive":2,"columnArticles":109,"formTitle":"[1726]Tuple with Same Product","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11752,"title":"Tuple with Same Product","titleSlug":"tuple-with-same-product"},{"acceptance":0.5774856203779787,"acs":3514,"articleLive":2,"columnArticles":84,"formTitle":"[1727]Largest Submatrix With Rearrangements","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6085,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3616887208569628,"acs":1148,"articleLive":2,"columnArticles":26,"formTitle":"[1728]Cat and Mouse II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3174,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.620116156282999,"acs":2349,"articleLive":2,"columnArticles":24,"formTitle":"[1729]Find Followers Count","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3788,"title":"Find Followers Count","titleSlug":"find-followers-count"},{"acceptance":0.5293685756240822,"acs":721,"articleLive":2,"columnArticles":24,"formTitle":"[1730]Shortest Path to Get Food","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1362,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4613604812586765,"acs":1994,"articleLive":2,"columnArticles":29,"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":4322,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7889358481044597,"acs":12507,"articleLive":2,"columnArticles":216,"formTitle":"[1732]Find the Highest Altitude","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15853,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4643380046015478,"acs":2220,"articleLive":2,"columnArticles":55,"formTitle":"[1733]Minimum Number of People to Teach","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4781,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231901587873485,"acs":28101,"articleLive":2,"columnArticles":368,"formTitle":"[1734]Decode XORed Permutation","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"","submitted":38857,"title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation"},{"acceptance":0.4907749077490775,"acs":1064,"articleLive":2,"columnArticles":26,"formTitle":"[1735]Count Ways to Make Array With Product","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2168,"title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44861337683523655,"acs":28875,"articleLive":2,"columnArticles":355,"formTitle":"[1736]Latest Time by Replacing Hidden Digits","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"","submitted":64365,"title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31741153015451073,"acs":3821,"articleLive":2,"columnArticles":106,"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":12038,"title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537171030106594,"acs":28640,"articleLive":2,"columnArticles":388,"formTitle":"[1738]Find Kth Largest XOR Coordinate Value","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"","submitted":43811,"title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47214126521515515,"acs":2754,"articleLive":2,"columnArticles":58,"formTitle":"[1739]Building Boxes","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5833,"title":"Building Boxes","titleSlug":"building-boxes"},{"acceptance":0.7047930283224401,"acs":647,"articleLive":2,"columnArticles":21,"formTitle":"[1740]Find Distance in a Binary Tree","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":918,"title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8423626787057938,"acs":2239,"articleLive":2,"columnArticles":32,"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":2658,"title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7095837366892546,"acs":8796,"articleLive":2,"columnArticles":132,"formTitle":"[1742]Maximum Number of Balls in a Box","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12396,"title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6964643506673653,"acs":22594,"articleLive":2,"columnArticles":332,"formTitle":"[1743]Restore the Array From Adjacent Pairs","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"","submitted":32441,"title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3628317455459055,"acs":28450,"articleLive":2,"columnArticles":369,"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":78411,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4841335540838852,"acs":3509,"articleLive":2,"columnArticles":73,"formTitle":"[1745]Palindrome Partitioning IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7248,"title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5843270868824532,"acs":1029,"articleLive":2,"columnArticles":42,"formTitle":"[1746]Maximum Subarray Sum After One Operation","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1761,"title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6991321118611379,"acs":1450,"articleLive":2,"columnArticles":35,"formTitle":"[1747]Leetflex Banned Accounts","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":2074,"title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7449470051762386,"acs":12089,"articleLive":2,"columnArticles":239,"formTitle":"[1748]Sum of Unique Elements","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":16228,"title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5314222712238148,"acs":3856,"articleLive":2,"columnArticles":89,"formTitle":"[1749]Maximum Absolute Sum of Any Subarray","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7256,"title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45744111349036404,"acs":3418,"articleLive":2,"columnArticles":81,"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":7472,"title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47169425710198243,"acs":2308,"articleLive":2,"columnArticles":35,"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":4893,"title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6753516734807012,"acs":9746,"articleLive":2,"columnArticles":115,"formTitle":"[1752]Check if Array Is Sorted and Rotated","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14431,"title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6290306378704169,"acs":6262,"articleLive":2,"columnArticles":133,"formTitle":"[1753]Maximum Score From Removing Stones","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9955,"title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4231404958677686,"acs":4352,"articleLive":2,"columnArticles":93,"formTitle":"[1754]Largest Merge Of Two Strings","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10285,"title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4150800655655025,"acs":3292,"articleLive":2,"columnArticles":57,"formTitle":"[1755]Closest Subsequence Sum","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7931,"title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8010471204188482,"acs":459,"articleLive":2,"columnArticles":15,"formTitle":"[1756]Design Most Recently Used Queue","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":573,"title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9216680755142294,"acs":3271,"articleLive":2,"columnArticles":34,"formTitle":"[1757]Recyclable and Low Fat Products","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3549,"title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6414964818946285,"acs":7476,"articleLive":2,"columnArticles":115,"formTitle":"[1758]Minimum Changes To Make Alternating Binary String","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11654,"title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.432081973159231,"acs":4765,"articleLive":2,"columnArticles":99,"formTitle":"[1759]Count Number of Homogenous Substrings","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11028,"title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.542789715563284,"acs":4370,"articleLive":2,"columnArticles":79,"formTitle":"[1760]Minimum Limit of Balls in a Bag","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8051,"title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43648365802608274,"acs":2711,"articleLive":2,"columnArticles":42,"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":6211,"title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7114142139267767,"acs":991,"articleLive":2,"columnArticles":23,"formTitle":"[1762]Buildings With an Ocean View","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":1393,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6053497942386832,"acs":4413,"articleLive":2,"columnArticles":86,"formTitle":"[1763]Longest Nice Substring","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":7290,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring"},{"acceptance":0.47275578204625635,"acs":2412,"articleLive":2,"columnArticles":61,"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":5102,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5476327944572749,"acs":3794,"articleLive":2,"columnArticles":89,"formTitle":"[1765]Map of Highest Peak","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6928,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"},{"acceptance":0.3812354613595244,"acs":1475,"articleLive":2,"columnArticles":28,"formTitle":"[1766]Tree of Coprimes","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3869,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"},{"acceptance":0.7962003454231433,"acs":922,"articleLive":2,"columnArticles":23,"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":1158,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7607073430739324,"acs":12131,"articleLive":2,"columnArticles":213,"formTitle":"[1768]Merge Strings Alternately","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15947,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"},{"acceptance":0.8561818032652392,"acs":10436,"articleLive":2,"columnArticles":180,"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":12189,"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.3718016587259573,"acs":4214,"articleLive":2,"columnArticles":105,"formTitle":"[1770]Maximum Score from Performing Multiplication Operations","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11334,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36749498379379536,"acs":2381,"articleLive":2,"columnArticles":48,"formTitle":"[1771]Maximize Palindrome Length From Subsequences","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6479,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5080862533692723,"acs":377,"articleLive":2,"columnArticles":11,"formTitle":"[1772]Sort Features by Popularity","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":742,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"},{"acceptance":0.842832469775475,"acs":16592,"articleLive":2,"columnArticles":206,"formTitle":"[1773]Count Items Matching a Rule","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19686,"title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5473927334103225,"acs":6162,"articleLive":2,"columnArticles":92,"formTitle":"[1774]Closest Dessert Cost","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11257,"title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost"},{"acceptance":0.4751219512195122,"acs":4383,"articleLive":2,"columnArticles":94,"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":9225,"title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4593657086223984,"acs":1854,"articleLive":2,"columnArticles":43,"formTitle":"[1776]Car Fleet II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4036,"title":"Car Fleet II","titleSlug":"car-fleet-ii"},{"acceptance":0.7844049247606019,"acs":5734,"articleLive":2,"columnArticles":63,"formTitle":"[1777]Product's Price for Each Store","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":7310,"title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store"},{"acceptance":0.5067750677506775,"acs":187,"articleLive":2,"columnArticles":10,"formTitle":"[1778]Shortest Path in a Hidden Grid","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":369,"title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6474883823854836,"acs":5852,"articleLive":2,"columnArticles":73,"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":9038,"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.6690958779321339,"acs":5876,"articleLive":2,"columnArticles":117,"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":8782,"title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5227159880834161,"acs":4211,"articleLive":2,"columnArticles":61,"formTitle":"[1781]Sum of Beauty of All Substrings","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8056,"title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29339039467427486,"acs":1234,"articleLive":2,"columnArticles":34,"formTitle":"[1782]Count Pairs Of Nodes","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4206,"title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7964071856287425,"acs":1330,"articleLive":2,"columnArticles":30,"formTitle":"[1783]Grand Slam Titles","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1670,"title":"Grand Slam Titles","titleSlug":"grand-slam-titles"},{"acceptance":0.42230836679126865,"acs":9151,"articleLive":2,"columnArticles":109,"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":21669,"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.3519883764731206,"acs":6541,"articleLive":2,"columnArticles":66,"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":18583,"title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34411130707427,"acs":3512,"articleLive":2,"columnArticles":92,"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":10206,"title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6528989508558807,"acs":11824,"articleLive":2,"columnArticles":61,"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":18110,"title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6523929471032746,"acs":259,"articleLive":2,"columnArticles":17,"formTitle":"[1788]Maximize the Beauty of the Garden","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":397,"title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7127615921214608,"acs":1737,"articleLive":2,"columnArticles":33,"formTitle":"[1789]Primary Department for Each Employee","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2437,"title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6393691810754323,"acs":13460,"articleLive":2,"columnArticles":151,"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":21052,"title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8090624761614158,"acs":10606,"articleLive":2,"columnArticles":145,"formTitle":"[1791]Find Center of Star Graph","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":13109,"title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5139323612489503,"acs":6732,"articleLive":2,"columnArticles":108,"formTitle":"[1792]Maximum Average Pass Ratio","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13099,"title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.417047342192691,"acs":4017,"articleLive":2,"columnArticles":96,"formTitle":"[1793]Maximum Score of a Good Subarray","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9632,"title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5683890577507599,"acs":187,"articleLive":2,"columnArticles":9,"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":329,"title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7857412297246322,"acs":2083,"articleLive":2,"columnArticles":31,"formTitle":"[1795]Rearrange Products Table","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2651,"title":"Rearrange Products Table","titleSlug":"rearrange-products-table"},{"acceptance":0.49141572421310803,"acs":7213,"articleLive":2,"columnArticles":127,"formTitle":"[1796]Second Largest Digit in a String","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"","submitted":14678,"title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5690410327339788,"acs":4937,"articleLive":2,"columnArticles":77,"formTitle":"[1797]Design Authentication Manager","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"","submitted":8676,"title":"Design Authentication Manager","titleSlug":"design-authentication-manager"},{"acceptance":0.523629799803085,"acs":3191,"articleLive":2,"columnArticles":52,"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":6094,"title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5181701581872595,"acs":2424,"articleLive":2,"columnArticles":34,"formTitle":"[1799]Maximize Score After N Operations","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4678,"title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6815013404825737,"acs":10168,"articleLive":2,"columnArticles":161,"formTitle":"[1800]Maximum Ascending Subarray Sum","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"","submitted":14920,"title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3814699331848552,"acs":4282,"articleLive":2,"columnArticles":112,"formTitle":"[1801]Number of Orders in the Backlog","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"","submitted":11225,"title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2632317929308345,"acs":4312,"articleLive":2,"columnArticles":108,"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":16381,"title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4085919757759273,"acs":2159,"articleLive":2,"columnArticles":55,"formTitle":"[1803]Count Pairs With XOR in a Range","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"","submitted":5284,"title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5839572192513369,"acs":546,"articleLive":2,"columnArticles":33,"formTitle":"[1804]Implement Trie II (Prefix Tree)","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":935,"title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4822923108637394,"acs":11698,"articleLive":2,"columnArticles":156,"formTitle":"[1805]Number of Different Integers in a String","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":24255,"title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6638453764527539,"acs":5255,"articleLive":2,"columnArticles":81,"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":7916,"title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5842763549731983,"acs":5886,"articleLive":2,"columnArticles":90,"formTitle":"[1807]Evaluate the Bracket Pairs of a String","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10074,"title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2686360243148128,"acs":2519,"articleLive":2,"columnArticles":47,"formTitle":"[1808]Maximize Number of Nice Divisors","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9377,"title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6270913770913771,"acs":1949,"articleLive":2,"columnArticles":34,"formTitle":"[1809]Ad-Free Sessions","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":3108,"title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"},{"acceptance":0.6170886075949367,"acs":195,"articleLive":2,"columnArticles":8,"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":316,"title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6791720569210866,"acs":1050,"articleLive":2,"columnArticles":30,"formTitle":"[1811]Find Interview Candidates","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1546,"title":"Find Interview Candidates","titleSlug":"find-interview-candidates"},{"acceptance":0.7925395075339948,"acs":8626,"articleLive":2,"columnArticles":208,"formTitle":"[1812]Determine Color of a Chessboard Square","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"","submitted":10884,"title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.506439358843695,"acs":5466,"articleLive":2,"columnArticles":78,"formTitle":"[1813]Sentence Similarity III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"","submitted":10793,"title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34859220585493195,"acs":3739,"articleLive":2,"columnArticles":85,"formTitle":"[1814]Count Nice Pairs in an Array","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"","submitted":10726,"title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29617780771173596,"acs":1759,"articleLive":2,"columnArticles":40,"formTitle":"[1815]Maximum Number of Groups Getting Fresh Donuts","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5939,"title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7512464995560413,"acs":10999,"articleLive":2,"columnArticles":169,"formTitle":"[1816]Truncate Sentence","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"","submitted":14641,"title":"Truncate Sentence","titleSlug":"truncate-sentence"},{"acceptance":0.7010591048855483,"acs":6156,"articleLive":2,"columnArticles":103,"formTitle":"[1817]Finding the Users Active Minutes","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"","submitted":8781,"title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3730028970541835,"acs":26008,"articleLive":2,"columnArticles":340,"formTitle":"[1818]Minimum Absolute Sum Difference","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"","submitted":69726,"title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.37830446672743845,"acs":2490,"articleLive":2,"columnArticles":34,"formTitle":"[1819]Number of Different Subsequences GCDs","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6582,"title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5060728744939271,"acs":125,"articleLive":2,"columnArticles":9,"formTitle":"[1820]Maximum Number of Accepted Invitations","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":247,"title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.899932157394844,"acs":2653,"articleLive":2,"columnArticles":24,"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":2948,"title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8056033808107685,"acs":20588,"articleLive":2,"columnArticles":206,"formTitle":"[1822]Sign of the Product of an Array","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":25556,"title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7183809819763829,"acs":9247,"articleLive":2,"columnArticles":116,"formTitle":"[1823]Find the Winner of the Circular Game","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":12872,"title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6525311203319502,"acs":7863,"articleLive":2,"columnArticles":157,"formTitle":"[1824]Minimum Sideway Jumps","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12050,"title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2850037040956715,"acs":2693,"articleLive":2,"columnArticles":51,"formTitle":"[1825]Finding MK Average","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9449,"title":"Finding MK Average","titleSlug":"finding-mk-average"},{"acceptance":0.43323863636363635,"acs":305,"articleLive":2,"columnArticles":23,"formTitle":"[1826]Faulty Sensor","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":704,"title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"acceptance":0.7933035364228025,"acs":10117,"articleLive":2,"columnArticles":148,"formTitle":"[1827]Minimum Operations to Make the Array Increasing","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"","submitted":12753,"title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8674214368849857,"acs":8198,"articleLive":2,"columnArticles":105,"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":9451,"title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6856617647058824,"acs":4103,"articleLive":2,"columnArticles":86,"formTitle":"[1829]Maximum XOR for Each Query","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"","submitted":5984,"title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4872364039955605,"acs":878,"articleLive":2,"columnArticles":21,"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":1802,"title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7388114453411592,"acs":1007,"articleLive":2,"columnArticles":27,"formTitle":"[1831]Maximum Transaction Each Day","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1363,"title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8234267767825986,"acs":14158,"articleLive":2,"columnArticles":222,"formTitle":"[1832]Check if the Sentence Is Pangram","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"","submitted":17194,"title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6842522746714363,"acs":43994,"articleLive":2,"columnArticles":391,"formTitle":"[1833]Maximum Ice Cream Bars","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"","submitted":64295,"title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35450231736923415,"acs":6425,"articleLive":2,"columnArticles":136,"formTitle":"[1834]Single-Threaded CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18124,"title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5124965287420161,"acs":3691,"articleLive":2,"columnArticles":62,"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":7202,"title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7288135593220338,"acs":516,"articleLive":2,"columnArticles":31,"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":708,"title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7954236959472561,"acs":8204,"articleLive":2,"columnArticles":98,"formTitle":"[1837]Sum of Digits in Base K","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"","submitted":10314,"title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42918742534160764,"acs":29462,"articleLive":2,"columnArticles":313,"formTitle":"[1838]Frequency of the Most Frequent Element","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"","submitted":68646,"title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5683731896261367,"acs":6750,"articleLive":2,"columnArticles":130,"formTitle":"[1839]Longest Substring Of All Vowels in Order","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"","submitted":11876,"title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.39260969976905313,"acs":2040,"articleLive":2,"columnArticles":47,"formTitle":"[1840]Maximum Building Height","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"","submitted":5196,"title":"Maximum Building Height","titleSlug":"maximum-building-height"},{"acceptance":0.5311163895486936,"acs":1118,"articleLive":2,"columnArticles":35,"formTitle":"[1841]League Statistics","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":2105,"title":"League Statistics","titleSlug":"league-statistics"},{"acceptance":0.6649214659685864,"acs":127,"articleLive":2,"columnArticles":13,"formTitle":"[1842]Next Palindrome Using Same Digits","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":191,"title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5131386861313869,"acs":703,"articleLive":2,"columnArticles":25,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1370,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7982893027284539,"acs":7373,"articleLive":2,"columnArticles":121,"formTitle":"[1844]Replace All Digits with Characters","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9236,"title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5163963963963965,"acs":7165,"articleLive":2,"columnArticles":64,"formTitle":"[1845]Seat Reservation Manager","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":13875,"title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager"},{"acceptance":0.633338654868064,"acs":27770,"articleLive":2,"columnArticles":379,"formTitle":"[1846]Maximum Element After Decreasing and Rearranging","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"","submitted":43847,"title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36168947055324213,"acs":2432,"articleLive":2,"columnArticles":45,"formTitle":"[1847]Closest Room","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6724,"title":"Closest Room","titleSlug":"closest-room"},{"acceptance":0.6831258411843876,"acs":8121,"articleLive":2,"columnArticles":106,"formTitle":"[1848]Minimum Distance to the Target Element","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11888,"title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3281616763038873,"acs":5732,"articleLive":2,"columnArticles":110,"formTitle":"[1849]Splitting a String Into Descending Consecutive Values","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17467,"title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6105184817663111,"acs":2461,"articleLive":2,"columnArticles":50,"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":4031,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40412290937378453,"acs":2078,"articleLive":2,"columnArticles":50,"formTitle":"[1851]Minimum Interval to Include Each Query","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5142,"title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6839237057220708,"acs":251,"articleLive":2,"columnArticles":13,"formTitle":"[1852]Distinct Numbers in Each Subarray","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":367,"title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6439232409381663,"acs":1208,"articleLive":2,"columnArticles":21,"formTitle":"[1853]Convert Date Format","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1876,"title":"Convert Date Format","titleSlug":"convert-date-format"},{"acceptance":0.7798907805974944,"acs":12139,"articleLive":2,"columnArticles":129,"formTitle":"[1854]Maximum Population Year","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"","submitted":15565,"title":"Maximum Population Year","titleSlug":"maximum-population-year"},{"acceptance":0.6725237618809404,"acs":10755,"articleLive":2,"columnArticles":104,"formTitle":"[1855]Maximum Distance Between a Pair of Values","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"","submitted":15992,"title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35597243491577335,"acs":4649,"articleLive":2,"columnArticles":84,"formTitle":"[1856]Maximum Subarray Min-Product","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"","submitted":13060,"title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45686584883260783,"acs":2309,"articleLive":2,"columnArticles":34,"formTitle":"[1857]Largest Color Value in a Directed Graph","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5054,"title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6333907056798623,"acs":368,"articleLive":2,"columnArticles":20,"formTitle":"[1858]Longest Word With All Prefixes","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":581,"title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7679958570688762,"acs":7415,"articleLive":2,"columnArticles":154,"formTitle":"[1859]Sorting the Sentence","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"","submitted":9655,"title":"Sorting the Sentence","titleSlug":"sorting-the-sentence"},{"acceptance":0.7692868867408353,"acs":4218,"articleLive":2,"columnArticles":74,"formTitle":"[1860]Incremental Memory Leak","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"","submitted":5483,"title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak"},{"acceptance":0.6211878009630819,"acs":3483,"articleLive":2,"columnArticles":71,"formTitle":"[1861]Rotating the Box","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"","submitted":5607,"title":"Rotating the Box","titleSlug":"rotating-the-box"},{"acceptance":0.3124578215683628,"acs":2315,"articleLive":2,"columnArticles":44,"formTitle":"[1862]Sum of Floored Pairs","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"","submitted":7409,"title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8933609681085779,"acs":13362,"articleLive":2,"columnArticles":155,"formTitle":"[1863]Sum of All Subset XOR Totals","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14957,"title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3903807961315949,"acs":4521,"articleLive":2,"columnArticles":109,"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":11581,"title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5112174974185676,"acs":5446,"articleLive":2,"columnArticles":65,"formTitle":"[1865]Finding Pairs With a Certain Sum","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"","submitted":10653,"title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.603399433427762,"acs":2343,"articleLive":2,"columnArticles":50,"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":3883,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7372448979591837,"acs":578,"articleLive":2,"columnArticles":16,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":784,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5311475409836065,"acs":324,"articleLive":2,"columnArticles":17,"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":610,"title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7789404839764552,"acs":13101,"articleLive":2,"columnArticles":147,"formTitle":"[1869]Longer Contiguous Segments of Ones than Zeros","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"","submitted":16819,"title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4512611975483263,"acs":7657,"articleLive":2,"columnArticles":72,"formTitle":"[1870]Minimum Speed to Arrive on Time","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"","submitted":16968,"title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27517736825665967,"acs":6167,"articleLive":2,"columnArticles":129,"formTitle":"[1871]Jump Game VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"","submitted":22411,"title":"Jump Game VII","titleSlug":"jump-game-vii"},{"acceptance":0.6226905311778291,"acs":2157,"articleLive":2,"columnArticles":31,"formTitle":"[1872]Stone Game VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3464,"title":"Stone Game VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8153274814314653,"acs":2415,"articleLive":2,"columnArticles":36,"formTitle":"[1873]Calculate Special Bonus","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2962,"title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus"},{"acceptance":0.8808988764044944,"acs":392,"articleLive":2,"columnArticles":22,"formTitle":"[1874]Minimize Product Sum of Two Arrays","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":445,"title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7432432432432432,"acs":495,"articleLive":2,"columnArticles":21,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":666,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7268953462967009,"acs":6654,"articleLive":2,"columnArticles":107,"formTitle":"[1876]Substrings of Size Three with Distinct Characters","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"","submitted":9154,"title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8196763888528167,"acs":31560,"articleLive":2,"columnArticles":406,"formTitle":"[1877]Minimize Maximum Pair Sum in Array","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"","submitted":38503,"title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.43079922027290446,"acs":2210,"articleLive":2,"columnArticles":58,"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":5130,"title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41499243897170013,"acs":1921,"articleLive":2,"columnArticles":39,"formTitle":"[1879]Minimum XOR Sum of Two Arrays","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4629,"title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7692459145501083,"acs":7814,"articleLive":2,"columnArticles":107,"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":10158,"title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3549212486495707,"acs":6242,"articleLive":2,"columnArticles":63,"formTitle":"[1881]Maximum Value after Insertion","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"","submitted":17587,"title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2799852832965416,"acs":3805,"articleLive":2,"columnArticles":115,"formTitle":"[1882]Process Tasks Using Servers","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"","submitted":13590,"title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3769689229459344,"acs":1771,"articleLive":2,"columnArticles":28,"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":4698,"title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6899686520376176,"acs":2201,"articleLive":2,"columnArticles":40,"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":3190,"title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5221088435374149,"acs":307,"articleLive":2,"columnArticles":15,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":588,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5714285714285714,"acs":5616,"articleLive":2,"columnArticles":81,"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":9828,"title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6466585662211422,"acs":5322,"articleLive":2,"columnArticles":69,"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":8230,"title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.32129234911375365,"acs":2864,"articleLive":2,"columnArticles":68,"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":8914,"title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2706979026125353,"acs":2207,"articleLive":2,"columnArticles":42,"formTitle":"[1889]Minimum Space Wasted From Packaging","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8153,"title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7247939124920736,"acs":1143,"articleLive":2,"columnArticles":22,"formTitle":"[1890]The Latest Login in 2020","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1577,"title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.34672731867576445,"acs":1372,"articleLive":2,"columnArticles":23,"formTitle":"[1891]Cutting Ribbons","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":3957,"title":"Cutting Ribbons","titleSlug":"cutting-ribbons"},{"acceptance":0.3595064498037016,"acs":641,"articleLive":2,"columnArticles":16,"formTitle":"[1892]Page Recommendations II","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1783,"title":"Page Recommendations II","titleSlug":"page-recommendations-ii"},{"acceptance":0.5910444448554572,"acs":31956,"articleLive":2,"columnArticles":419,"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":54067,"title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4573882618784396,"acs":37649,"articleLive":2,"columnArticles":520,"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":82313,"title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5348022033049574,"acs":2136,"articleLive":2,"columnArticles":41,"formTitle":"[1895]Largest Magic Square","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"","submitted":3994,"title":"Largest Magic Square","titleSlug":"largest-magic-square"},{"acceptance":0.5067055393586006,"acs":869,"articleLive":2,"columnArticles":31,"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":1715,"title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5347766378544309,"acs":6620,"articleLive":2,"columnArticles":84,"formTitle":"[1897]Redistribute Characters to Make All Strings Equal","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"","submitted":12379,"title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3119094045297735,"acs":4159,"articleLive":2,"columnArticles":63,"formTitle":"[1898]Maximum Number of Removable Characters","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"","submitted":13334,"title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6325788865025607,"acs":3829,"articleLive":2,"columnArticles":44,"formTitle":"[1899]Merge Triplets to Form Target Triplet","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6053,"title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4406040268456376,"acs":1313,"articleLive":2,"columnArticles":36,"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":2980,"title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6317460317460317,"acs":1194,"articleLive":2,"columnArticles":41,"formTitle":"[1901]Find a Peak Element II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1890,"title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4794520547945205,"acs":105,"articleLive":2,"columnArticles":5,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":219,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6412665824384081,"acs":8121,"articleLive":2,"columnArticles":108,"formTitle":"[1903]Largest Odd Number in String","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":12664,"title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2861947714416756,"acs":3744,"articleLive":2,"columnArticles":72,"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":13082,"title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5825439063331559,"acs":5473,"articleLive":2,"columnArticles":123,"formTitle":"[1905]Count Sub Islands","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":9395,"title":"Count Sub Islands","titleSlug":"count-sub-islands"},{"acceptance":0.4257799671592775,"acs":2593,"articleLive":2,"columnArticles":57,"formTitle":"[1906]Minimum Absolute Difference Queries","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6090,"title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5729468599033817,"acs":593,"articleLive":2,"columnArticles":20,"formTitle":"[1907]Count Salary Categories","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":1035,"title":"Count Salary Categories","titleSlug":"count-salary-categories"},{"acceptance":0.6678321678321678,"acs":191,"articleLive":2,"columnArticles":9,"formTitle":"[1908]Game of Nim","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":286,"title":"Game of Nim","titleSlug":"game-of-nim"},{"acceptance":0.323062015503876,"acs":5001,"articleLive":2,"columnArticles":78,"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":15480,"title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.67426597582038,"acs":3904,"articleLive":2,"columnArticles":64,"formTitle":"[1910]Remove All Occurrences of a Substring","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"","submitted":5790,"title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5648249027237354,"acs":3629,"articleLive":2,"columnArticles":74,"formTitle":"[1911]Maximum Alternating Subsequence Sum","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"","submitted":6425,"title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.25655191953534495,"acs":1811,"articleLive":2,"columnArticles":40,"formTitle":"[1912]Design Movie Rental System","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":7059,"title":"Design Movie Rental System","titleSlug":"design-movie-rental-system"},{"acceptance":0.8322743412446272,"acs":8907,"articleLive":2,"columnArticles":98,"formTitle":"[1913]Maximum Product Difference Between Two Pairs","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"","submitted":10702,"title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4434340732816261,"acs":3316,"articleLive":2,"columnArticles":70,"formTitle":"[1914]Cyclically Rotating a Grid","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7478,"title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39464214314274293,"acs":2961,"articleLive":2,"columnArticles":60,"formTitle":"[1915]Number of Wonderful Substrings","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"","submitted":7503,"title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5540968764146673,"acs":1224,"articleLive":2,"columnArticles":18,"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":2209,"title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28978622327790976,"acs":366,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":1263,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5230414746543779,"acs":227,"articleLive":2,"columnArticles":6,"formTitle":"[1918]Kth Smallest Subarray Sum","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":434,"title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.39280125195618154,"acs":502,"articleLive":2,"columnArticles":15,"formTitle":"[1919]Leetcodify Similar Friends","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1278,"title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9012532411408816,"acs":12513,"articleLive":2,"columnArticles":114,"formTitle":"[1920]Build Array from Permutation","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"","submitted":13884,"title":"Build Array from Permutation","titleSlug":"build-array-from-permutation"},{"acceptance":0.3466682879377432,"acs":5702,"articleLive":2,"columnArticles":93,"formTitle":"[1921]Eliminate Maximum Number of Monsters","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"","submitted":16448,"title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36261483562371877,"acs":4776,"articleLive":2,"columnArticles":80,"formTitle":"[1922]Count Good Numbers","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13171,"title":"Count Good Numbers","titleSlug":"count-good-numbers"},{"acceptance":0.23801396431342126,"acs":1534,"articleLive":2,"columnArticles":32,"formTitle":"[1923]Longest Common Subpath","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6445,"title":"Longest Common Subpath","titleSlug":"longest-common-subpath"},{"acceptance":0.3793103448275862,"acs":66,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":174,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6911899463280534,"acs":5280,"articleLive":2,"columnArticles":68,"formTitle":"[1925]Count Square Sum Triples","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"","submitted":7639,"title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples"},{"acceptance":0.34556159420289856,"acs":3815,"articleLive":2,"columnArticles":64,"formTitle":"[1926]Nearest Exit from Entrance in Maze","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"","submitted":11040,"title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41526350317078503,"acs":1899,"articleLive":2,"columnArticles":38,"formTitle":"[1927]Sum Game","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"","submitted":4573,"title":"Sum Game","titleSlug":"sum-game"},{"acceptance":0.40628099173553717,"acs":2458,"articleLive":2,"columnArticles":42,"formTitle":"[1928]Minimum Cost to Reach Destination in Time","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"","submitted":6050,"title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9013570254974745,"acs":14812,"articleLive":2,"columnArticles":130,"formTitle":"[1929]Concatenation of Array","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":16433,"title":"Concatenation of Array","titleSlug":"concatenation-of-array"},{"acceptance":0.4831698240866035,"acs":5713,"articleLive":2,"columnArticles":104,"formTitle":"[1930]Unique Length-3 Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11824,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5628006413682523,"acs":2106,"articleLive":2,"columnArticles":65,"formTitle":"[1931]Painting a Grid With Three Different Colors","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3742,"title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3332379862700229,"acs":1165,"articleLive":2,"columnArticles":36,"formTitle":"[1932]Merge BSTs to Create Single BST","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3496,"title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5363540569020021,"acs":509,"articleLive":2,"columnArticles":26,"formTitle":"[1933]Check if String Is Decomposable Into Value-Equal Substrings","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":949,"title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7489711934156379,"acs":364,"articleLive":2,"columnArticles":14,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":486,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7368475028202236,"acs":7185,"articleLive":2,"columnArticles":101,"formTitle":"[1935]Maximum Number of Words You Can Type","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9751,"title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45144950124688277,"acs":5793,"articleLive":2,"columnArticles":68,"formTitle":"[1936]Add Minimum Number of Rungs","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12832,"title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24578746349135025,"acs":3282,"articleLive":2,"columnArticles":64,"formTitle":"[1937]Maximum Number of Points with Cost","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13353,"title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3495693495693496,"acs":1177,"articleLive":2,"columnArticles":42,"formTitle":"[1938]Maximum Genetic Difference Query","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3367,"title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6300904977375565,"acs":557,"articleLive":2,"columnArticles":16,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":884,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7828571428571428,"acs":411,"articleLive":2,"columnArticles":27,"formTitle":"[1940]Longest Common Subsequence Between Sorted Arrays","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":525,"title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7684568513532662,"acs":5423,"articleLive":2,"columnArticles":94,"formTitle":"[1941]Check if All Characters Have Equal Number of Occurrences","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"","submitted":7057,"title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3983473242392445,"acs":3037,"articleLive":2,"columnArticles":71,"formTitle":"[1942]The Number of the Smallest Unoccupied Chair","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"","submitted":7624,"title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4123775786622213,"acs":1979,"articleLive":2,"columnArticles":55,"formTitle":"[1943]Describe the Painting","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"","submitted":4799,"title":"Describe the Painting","titleSlug":"describe-the-painting"},{"acceptance":0.5789049919484702,"acs":2157,"articleLive":2,"columnArticles":59,"formTitle":"[1944]Number of Visible People in a Queue","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3726,"title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6598123756277836,"acs":6963,"articleLive":2,"columnArticles":83,"formTitle":"[1945]Sum of Digits of String After Convert","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"","submitted":10553,"title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30552311029534457,"acs":5493,"articleLive":2,"columnArticles":83,"formTitle":"[1946]Largest Number After Mutating Substring","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"","submitted":17979,"title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5447643979057591,"acs":4162,"articleLive":2,"columnArticles":92,"formTitle":"[1947]Maximum Compatibility Score Sum","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"","submitted":7640,"title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5182144689584403,"acs":1010,"articleLive":2,"columnArticles":20,"formTitle":"[1948]Delete Duplicate Folders in System","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1949,"title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5159744408945687,"acs":323,"articleLive":2,"columnArticles":15,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":626,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5296167247386759,"acs":152,"articleLive":2,"columnArticles":7,"formTitle":"[1950]Maximum of Minimum Values in All Subarrays","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":287,"title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6956521739130435,"acs":416,"articleLive":2,"columnArticles":14,"formTitle":"[1951]All the Pairs With the Maximum Number of Common Followers","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":598,"title":"All the Pairs With the Maximum Number of Common Followers","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5439601309134187,"acs":7313,"articleLive":2,"columnArticles":81,"formTitle":"[1952]Three Divisors","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"","submitted":13444,"title":"Three Divisors","titleSlug":"three-divisors"},{"acceptance":0.330668658946582,"acs":4426,"articleLive":2,"columnArticles":84,"formTitle":"[1953]Maximum Number of Weeks for Which You Can Work","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"","submitted":13385,"title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.47876964226011365,"acs":4296,"articleLive":2,"columnArticles":70,"formTitle":"[1954]Minimum Garden Perimeter to Collect Enough Apples","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"","submitted":8973,"title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49637748467397363,"acs":2672,"articleLive":2,"columnArticles":42,"formTitle":"[1955]Count Number of Special Subsequences","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5383,"title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.42597402597402595,"acs":164,"articleLive":2,"columnArticles":13,"formTitle":"[1956]Minimum Time For K Virus Variants to Spread","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":385,"title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6072120038722169,"acs":5018,"articleLive":2,"columnArticles":60,"formTitle":"[1957]Delete Characters to Make Fancy String","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8264,"title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4260267194458189,"acs":2583,"articleLive":2,"columnArticles":47,"formTitle":"[1958]Check if Move is Legal","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6063,"title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4191096634093377,"acs":1544,"articleLive":2,"columnArticles":32,"formTitle":"[1959]Minimum Total Space Wasted With K Resizing Operations","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3684,"title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28486140724946696,"acs":668,"articleLive":2,"columnArticles":20,"formTitle":"[1960]Maximum Product of the Length of Two Palindromic Substrings","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2345,"title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5369476148668423,"acs":7339,"articleLive":2,"columnArticles":68,"formTitle":"[1961]Check If String Is a Prefix of Array","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13668,"title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4343147511582723,"acs":5812,"articleLive":2,"columnArticles":79,"formTitle":"[1962]Remove Stones to Minimize the Total","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13382,"title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6173319046343424,"acs":4609,"articleLive":2,"columnArticles":57,"formTitle":"[1963]Minimum Number of Swaps to Make the String Balanced","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7466,"title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3874251497005988,"acs":3235,"articleLive":2,"columnArticles":47,"formTitle":"[1964]Find the Longest Valid Obstacle Course at Each Position","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8350,"title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7554904831625183,"acs":516,"articleLive":2,"columnArticles":17,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":683,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7532467532467533,"acs":58,"articleLive":2,"columnArticles":7,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":77,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7805334581188582,"acs":6672,"articleLive":2,"columnArticles":65,"formTitle":"[1967]Number of Strings That Appear as Substrings in Word","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":8548,"title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3604572459953373,"acs":4793,"articleLive":2,"columnArticles":69,"formTitle":"[1968]Array With Elements Not Equal to Average of Neighbors","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13297,"title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2807582938388626,"acs":2962,"articleLive":2,"columnArticles":43,"formTitle":"[1969]Minimum Non-Zero Product of the Array Elements","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10550,"title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4803675856307435,"acs":2300,"articleLive":2,"columnArticles":51,"formTitle":"[1970]Last Day Where You Can Still Cross","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4788,"title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5536512667660208,"acs":743,"articleLive":2,"columnArticles":23,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":1342,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4283121597096189,"acs":236,"articleLive":2,"columnArticles":10,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":551,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5902777777777778,"acs":85,"articleLive":2,"columnArticles":10,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":144,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.735897435897436,"acs":4305,"articleLive":2,"columnArticles":58,"formTitle":"[1974]Minimum Time to Type Word Using Special Typewriter","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"","submitted":5850,"title":"Minimum Time to Type Word Using Special Typewriter","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3853664565566679,"acs":3118,"articleLive":2,"columnArticles":47,"formTitle":"[1975]Maximum Matrix Sum","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"","submitted":8091,"title":"Maximum Matrix Sum","titleSlug":"maximum-matrix-sum"},{"acceptance":0.29448775817261663,"acs":2153,"articleLive":2,"columnArticles":47,"formTitle":"[1976]Number of Ways to Arrive at Destination","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"","submitted":7311,"title":"Number of Ways to Arrive at Destination","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.25031486146095716,"acs":795,"articleLive":2,"columnArticles":16,"formTitle":"[1977]Number of Ways to Separate Numbers","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3176,"title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5317139001349528,"acs":394,"articleLive":2,"columnArticles":13,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":741,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.799057492931197,"acs":8478,"articleLive":2,"columnArticles":107,"formTitle":"[1979]Find Greatest Common Divisor of Array","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"","submitted":10610,"title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5845396641574986,"acs":6057,"articleLive":2,"columnArticles":102,"formTitle":"[1980]Find Unique Binary String","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"","submitted":10362,"title":"Find Unique Binary String","titleSlug":"find-unique-binary-string"},{"acceptance":0.3008392511297611,"acs":4660,"articleLive":2,"columnArticles":85,"formTitle":"[1981]Minimize the Difference Between Target and Chosen Elements","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15490,"title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4656448202959831,"acs":881,"articleLive":2,"columnArticles":19,"formTitle":"[1982]Find Array Given Subset Sums","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1892,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6568627450980392,"acs":67,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":102,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5804031879981247,"acs":6190,"articleLive":2,"columnArticles":67,"formTitle":"[1984]Minimum Difference Between Highest and Lowest of K Scores","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"","submitted":10665,"title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41306266548984993,"acs":6084,"articleLive":2,"columnArticles":87,"formTitle":"[1985]Find the Kth Largest Integer in the Array","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"","submitted":14729,"title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2812083518436251,"acs":3798,"articleLive":2,"columnArticles":79,"formTitle":"[1986]Minimum Number of Work Sessions to Finish the Tasks","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"","submitted":13506,"title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46801134572959346,"acs":1485,"articleLive":2,"columnArticles":26,"formTitle":"[1987]Number of Unique Good Subsequences","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3173,"title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6551724137931034,"acs":285,"articleLive":2,"columnArticles":8,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":435,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.5048543689320388,"acs":52,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":103,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5700934579439252,"acs":305,"articleLive":2,"columnArticles":9,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":535,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6607303010890455,"acs":5157,"articleLive":2,"columnArticles":72,"formTitle":"[1991]Find the Middle Index in Array","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"","submitted":7805,"title":"Find the Middle Index in Array","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5962744725337389,"acs":3137,"articleLive":2,"columnArticles":62,"formTitle":"[1992]Find All Groups of Farmland","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"","submitted":5261,"title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3870640713706407,"acs":1909,"articleLive":2,"columnArticles":43,"formTitle":"[1993]Operations on Tree","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4932,"title":"Operations on Tree","titleSlug":"operations-on-tree"},{"acceptance":0.3716508210890233,"acs":1290,"articleLive":2,"columnArticles":38,"formTitle":"[1994]The Number of Good Subsets","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"","submitted":3471,"title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5589247511859362,"acs":6009,"articleLive":2,"columnArticles":47,"formTitle":"[1995]Count Special Quadruplets","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"","submitted":10751,"title":"Count Special Quadruplets","titleSlug":"count-special-quadruplets"},{"acceptance":0.2536392795460153,"acs":5140,"articleLive":2,"columnArticles":98,"formTitle":"[1996]The Number of Weak Characters in the Game","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"","submitted":20265,"title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3409055787358986,"acs":2206,"articleLive":2,"columnArticles":37,"formTitle":"[1997]First Day Where You Have Been in All the Rooms","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"","submitted":6471,"title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4218905472636816,"acs":1696,"articleLive":2,"columnArticles":34,"formTitle":"[1998]GCD Sort of an Array","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4020,"title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6283185840707964,"acs":71,"articleLive":2,"columnArticles":7,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":113,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.771480619370509,"acs":7623,"articleLive":2,"columnArticles":106,"formTitle":"[2000]Reverse Prefix of Word","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"","submitted":9881,"title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.36052567829457366,"acs":5953,"articleLive":2,"columnArticles":130,"formTitle":"[2001]Number of Pairs of Interchangeable Rectangles","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"","submitted":16512,"title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5757716049382716,"acs":3731,"articleLive":2,"columnArticles":88,"formTitle":"[2002]Maximum Product of the Length of Two Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6480,"title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39541892706449666,"acs":1968,"articleLive":2,"columnArticles":41,"formTitle":"[2003]Smallest Missing Genetic Value in Each Subtree","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4977,"title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.4094488188976378,"acs":156,"articleLive":2,"columnArticles":8,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":381,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6595744680851063,"acs":31,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":47,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8673886028759098,"acs":4886,"articleLive":2,"columnArticles":65,"formTitle":"[2006]Count Number of Pairs With Absolute Difference K","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":5633,"title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.3151041666666667,"acs":3267,"articleLive":2,"columnArticles":62,"formTitle":"[2007]Find Original Array From Doubled Array","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":10368,"title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4196646873908488,"acs":2403,"articleLive":2,"columnArticles":43,"formTitle":"[2008]Maximum Earnings From Taxi","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5726,"title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.42139800285306706,"acs":1477,"articleLive":2,"columnArticles":41,"formTitle":"[2009]Minimum Number of Operations to Make Array Continuous","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3505,"title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6556603773584906,"acs":139,"articleLive":2,"columnArticles":8,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":212,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.8885739206279982,"acs":8150,"articleLive":2,"columnArticles":81,"formTitle":"[2011]Final Value of Variable After Performing Operations","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"","submitted":9172,"title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3619220908113473,"acs":4376,"articleLive":2,"columnArticles":78,"formTitle":"[2012]Sum of Beauty in the Array","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"","submitted":12091,"title":"Sum of Beauty in the Array","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3365141411818809,"acs":2927,"articleLive":2,"columnArticles":52,"formTitle":"[2013]Detect Squares","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"","submitted":8698,"title":"Detect Squares","titleSlug":"detect-squares"},{"acceptance":0.5258315640481246,"acs":1486,"articleLive":2,"columnArticles":25,"formTitle":"[2014]Longest Subsequence Repeated k Times","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2826,"title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.75,"acs":66,"articleLive":2,"columnArticles":3,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":88,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5526484310676059,"acs":6041,"articleLive":2,"columnArticles":82,"formTitle":"[2016]Maximum Difference Between Increasing Elements","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"","submitted":10931,"title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3521480379393714,"acs":3787,"articleLive":2,"columnArticles":98,"formTitle":"[2017]Grid Game","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"","submitted":10754,"title":"Grid Game","titleSlug":"grid-game"},{"acceptance":0.4099800399201597,"acs":2054,"articleLive":2,"columnArticles":52,"formTitle":"[2018]Check if Word Can Be Placed In Crossword","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5010,"title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3531808210592291,"acs":1127,"articleLive":2,"columnArticles":34,"formTitle":"[2019]The Score of Students Solving Math Expression","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3191,"title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7578947368421053,"acs":216,"articleLive":2,"columnArticles":8,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":285,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.675,"acs":81,"articleLive":2,"columnArticles":6,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":120,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6572970960536113,"acs":3531,"articleLive":2,"columnArticles":44,"formTitle":"[2022]Convert 1D Array Into 2D Array","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"","submitted":5372,"title":"Convert 1D Array Into 2D Array","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7481463173504695,"acs":3027,"articleLive":2,"columnArticles":51,"formTitle":"[2023]Number of Pairs of Strings With Concatenation Equal to Target","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"","submitted":4046,"title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4880447358272271,"acs":2531,"articleLive":2,"columnArticles":65,"formTitle":"[2024]Maximize the Confusion of an Exam","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5186,"title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.25929689087583824,"acs":1276,"articleLive":2,"columnArticles":42,"formTitle":"[2025]Maximum Number of Ways to Partition an Array","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4921,"title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8792270531400966,"acs":364,"articleLive":2,"columnArticles":13,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":414,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5567216981132076,"acs":4721,"articleLive":2,"columnArticles":51,"formTitle":"[2027]Minimum Moves to Convert String","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"","submitted":8480,"title":"Minimum Moves to Convert String","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4266749637004771,"acs":4114,"articleLive":2,"columnArticles":61,"formTitle":"[2028]Find Missing Observations","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"","submitted":9642,"title":"Find Missing Observations","titleSlug":"find-missing-observations"},{"acceptance":0.2317111459968603,"acs":2214,"articleLive":2,"columnArticles":68,"formTitle":"[2029]Stone Game IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"","submitted":9555,"title":"Stone Game IX","titleSlug":"stone-game-ix"},{"acceptance":0.34417952314165495,"acs":1227,"articleLive":2,"columnArticles":40,"formTitle":"[2030]Smallest K-Length Subsequence With Occurrences of a Letter","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3565,"title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6049382716049383,"acs":49,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":81,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6620132255694342,"acs":6307,"articleLive":2,"columnArticles":98,"formTitle":"[2032]Two Out of Three","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"","submitted":9527,"title":"Two Out of Three","titleSlug":"two-out-of-three"},{"acceptance":0.3928801398215436,"acs":4271,"articleLive":2,"columnArticles":86,"formTitle":"[2033]Minimum Operations to Make a Uni-Value Grid","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"","submitted":10871,"title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3030359820089955,"acs":3234,"articleLive":2,"columnArticles":68,"formTitle":"[2034]Stock Price Fluctuation ","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"","submitted":10672,"title":"Stock Price Fluctuation ","titleSlug":"stock-price-fluctuation"},{"acceptance":0.3157983761840325,"acs":1867,"articleLive":2,"columnArticles":44,"formTitle":"[2035]Partition Array Into Two Arrays to Minimize Sum Difference","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5912,"title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.504424778761062,"acs":57,"articleLive":2,"columnArticles":7,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":113,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8307692307692308,"acs":3402,"articleLive":2,"columnArticles":51,"formTitle":"[2037]Minimum Number of Moves to Seat Everyone","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"","submitted":4095,"title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5023360442983215,"acs":2903,"articleLive":2,"columnArticles":62,"formTitle":"[2038]Remove Colored Pieces if Both Neighbors are the Same Color","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"","submitted":5779,"title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.3547357926221336,"acs":1779,"articleLive":2,"columnArticles":44,"formTitle":"[2039]The Time When the Network Becomes Idle","frequency":0.0,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"","submitted":5015,"title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.3167570825798674,"acs":1051,"articleLive":2,"columnArticles":20,"formTitle":"[2040]Kth Smallest Product of Two Sorted Arrays","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3318,"title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6711711711711712,"acs":149,"articleLive":2,"columnArticles":8,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"lock","submitted":222,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6700542005420054,"acs":6923,"articleLive":2,"columnArticles":105,"formTitle":"[2042]Check if Numbers Are Ascending in a Sentence","frequency":0.0,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"","submitted":10332,"title":"Check if Numbers Are Ascending in a Sentence","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5928254037065135,"acs":5470,"articleLive":2,"columnArticles":65,"formTitle":"[2043]Simple Bank System","frequency":0.0,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"","submitted":9227,"title":"Simple Bank System","titleSlug":"simple-bank-system"},{"acceptance":0.7431390687634906,"acs":4820,"articleLive":2,"columnArticles":95,"formTitle":"[2044]Count Number of Maximum Bitwise-OR Subsets","frequency":0.0,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"","submitted":6486,"title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.3284276918456225,"acs":2187,"articleLive":2,"columnArticles":60,"formTitle":"[2045]Second Minimum Time to Reach Destination","frequency":0.0,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"","submitted":6659,"title":"Second Minimum Time to Reach Destination","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.6759776536312849,"acs":121,"articleLive":2,"columnArticles":16,"formTitle":"[2046]Sort Linked List Already Sorted Using Absolute Values","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"lock","submitted":179,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.28264452719614186,"acs":4630,"articleLive":2,"columnArticles":101,"formTitle":"[2047]Number of Valid Words in a Sentence","frequency":0.0,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"","submitted":16381,"title":"Number of Valid Words in a Sentence","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4103411513859275,"acs":3849,"articleLive":2,"columnArticles":88,"formTitle":"[2048]Next Greater Numerically Balanced Number","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"","submitted":9380,"title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.39104346553490416,"acs":2672,"articleLive":2,"columnArticles":90,"formTitle":"[2049]Count Nodes With the Highest Score","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":6833,"title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5569285083848191,"acs":1893,"articleLive":2,"columnArticles":61,"formTitle":"[2050]Parallel Courses III","frequency":0.0,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3399,"title":"Parallel Courses III","titleSlug":"parallel-courses-iii"},{"acceptance":0.73125,"acs":117,"articleLive":2,"columnArticles":6,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"lock","submitted":160,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5192307692307693,"acs":27,"articleLive":2,"columnArticles":5,"formTitle":"[2052]Minimum Cost to Separate Sentence Into Rows","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"lock","submitted":52,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7576784579538234,"acs":3577,"articleLive":2,"columnArticles":56,"formTitle":"[2053]Kth Distinct String in an Array","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":4721,"title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3231890270038577,"acs":2262,"articleLive":2,"columnArticles":55,"formTitle":"[2054]Two Best Non-Overlapping Events","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":6999,"title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3845201238390093,"acs":1863,"articleLive":2,"columnArticles":61,"formTitle":"[2055]Plates Between Candles","frequency":0.0,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":4845,"title":"Plates Between Candles","titleSlug":"plates-between-candles"},{"acceptance":0.6027253668763103,"acs":575,"articleLive":2,"columnArticles":14,"formTitle":"[2056]Number of Valid Move Combinations On Chessboard","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":954,"title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7773522975929978,"acs":5684,"articleLive":2,"columnArticles":35,"formTitle":"[2057]Smallest Index With Equal Value","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":7312,"title":"Smallest Index With Equal Value","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5711586158025275,"acs":4836,"articleLive":2,"columnArticles":66,"formTitle":"[2058]Find the Minimum and Maximum Number of Nodes Between Critical Points","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":8467,"title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.41957165641376165,"acs":3683,"articleLive":2,"columnArticles":91,"formTitle":"[2059]Minimum Operations to Convert Number","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":8778,"title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.3457382953181273,"acs":864,"articleLive":2,"columnArticles":18,"formTitle":"[2060]Check if an Original String Exists Given Two Encoded Strings","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2499,"title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5555555555555556,"acs":40,"articleLive":2,"columnArticles":5,"formTitle":"[2061]Number of Spaces Cleaning Robot Cleaned","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"lock","submitted":72,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6058173203474598,"acs":4603,"articleLive":2,"columnArticles":86,"formTitle":"[2062]Count Vowel Substrings of a String","frequency":0.0,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"","submitted":7598,"title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.47388757322697245,"acs":3802,"articleLive":2,"columnArticles":94,"formTitle":"[2063]Vowels of All Substrings","frequency":0.0,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"","submitted":8023,"title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.4074641414844729,"acs":2926,"articleLive":2,"columnArticles":58,"formTitle":"[2064]Minimized Maximum of Products Distributed to Any Store","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"","submitted":7181,"title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5348557692307693,"acs":1780,"articleLive":2,"columnArticles":53,"formTitle":"[2065]Maximum Path Quality of a Graph","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"","submitted":3328,"title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8690476190476191,"acs":73,"articleLive":2,"columnArticles":5,"formTitle":"[2066]Account Balance","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"lock","submitted":84,"title":"Account Balance","titleSlug":"account-balance"},{"acceptance":0.391304347826087,"acs":27,"articleLive":2,"columnArticles":4,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"lock","submitted":69,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7426718547341116,"acs":2863,"articleLive":2,"columnArticles":50,"formTitle":"[2068]Check Whether Two Strings are Almost Equivalent","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"","submitted":3855,"title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.17828037725483015,"acs":1947,"articleLive":2,"columnArticles":71,"formTitle":"[2069]Walking Robot Simulation II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"","submitted":10921,"title":"Walking Robot Simulation II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.41425777004998915,"acs":1906,"articleLive":2,"columnArticles":67,"formTitle":"[2070]Most Beautiful Item for Each Query","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":4601,"title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.3465982028241335,"acs":810,"articleLive":2,"columnArticles":23,"formTitle":"[2071]Maximum Number of Tasks You Can Assign","frequency":0.0,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":2337,"title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.8350515463917526,"acs":81,"articleLive":2,"columnArticles":5,"formTitle":"[2072]The Winner University","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"lock","submitted":97,"title":"The Winner University","titleSlug":"the-winner-university"},{"acceptance":0.6151079136690647,"acs":5130,"articleLive":2,"columnArticles":81,"formTitle":"[2073]Time Needed to Buy Tickets","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":8340,"title":"Time Needed to Buy Tickets","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.40068655303030304,"acs":3385,"articleLive":2,"columnArticles":97,"formTitle":"[2074]Reverse Nodes in Even Length Groups","frequency":0.0,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":8448,"title":"Reverse Nodes in Even Length Groups","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.4546726792100762,"acs":2924,"articleLive":2,"columnArticles":61,"formTitle":"[2075]Decode the Slanted Ciphertext","frequency":0.0,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":6431,"title":"Decode the Slanted Ciphertext","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.48451688009313154,"acs":2081,"articleLive":2,"columnArticles":64,"formTitle":"[2076]Process Restricted Friend Requests","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":4295,"title":"Process Restricted Friend Requests","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.5,"acs":13,"articleLive":2,"columnArticles":2,"formTitle":"[5945]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"5945","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"lock","submitted":26,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.8451081930830405,"acs":82251,"articleLive":2,"columnArticles":635,"formTitle":"[LCP 01]Guess Numbers","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":97326,"title":"Guess Numbers","titleSlug":"guess-numbers"},{"acceptance":0.6909619554504238,"acs":14021,"articleLive":2,"columnArticles":244,"formTitle":"[LCP 02]Deep Dark Fraction","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20292,"title":"Deep Dark Fraction","titleSlug":"deep-dark-fraction"},{"acceptance":0.22066761091758222,"acs":11529,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 03]Programmable Robot","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":52246,"title":"Programmable Robot","titleSlug":"programmable-robot"},{"acceptance":0.3800226372382569,"acs":2686,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 04]Broken Board Dominoes","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7068,"title":"Broken Board Dominoes","titleSlug":"broken-board-dominoes"},{"acceptance":0.20028585040495475,"acs":2102,"articleLive":2,"columnArticles":51,"formTitle":"[LCP 05]Coin Bonus","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10495,"title":"Coin Bonus","titleSlug":"coin-bonus"},{"acceptance":0.8394591041412339,"acs":44697,"articleLive":2,"columnArticles":676,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":53245,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7679856115107914,"acs":40138,"articleLive":2,"columnArticles":484,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"","submitted":52264,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2911505412342372,"acs":5218,"articleLive":2,"columnArticles":106,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17922,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2767562664907652,"acs":6713,"articleLive":2,"columnArticles":111,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24256,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5932257043368154,"acs":1874,"articleLive":2,"columnArticles":37,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3159,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6908772271443872,"acs":7096,"articleLive":2,"columnArticles":72,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10271,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4132439744220364,"acs":6721,"articleLive":2,"columnArticles":109,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16264,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.61198738170347,"acs":9506,"articleLive":2,"columnArticles":85,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15533,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21226199543031227,"acs":2787,"articleLive":2,"columnArticles":42,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13130,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5792207792207792,"acs":892,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1540,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30842911877394635,"acs":644,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2088,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7977402614464955,"acs":24288,"articleLive":2,"columnArticles":257,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":30446,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2882351064169246,"acs":18066,"articleLive":2,"columnArticles":238,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"","submitted":62678,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163190823774766,"acs":19806,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38360,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3152155392741523,"acs":1850,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5869,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3243839646929018,"acs":882,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2719,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33437442586808747,"acs":9100,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"","submitted":27215,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.34113501950421543,"acs":2711,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7947,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2828313253012048,"acs":939,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3320,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.338276440962507,"acs":1209,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3574,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3385964912280702,"acs":579,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1710,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32657773217034375,"acs":1273,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3898,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2852684144818976,"acs":10968,"articleLive":2,"columnArticles":184,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"","submitted":38448,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18961553425529656,"acs":5361,"articleLive":2,"columnArticles":129,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"","submitted":28273,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3513319365459443,"acs":5869,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"","submitted":16705,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2533220243143907,"acs":1792,"articleLive":2,"columnArticles":36,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7074,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4095486758672137,"acs":1098,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2681,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22249804624649475,"acs":4840,"articleLive":2,"columnArticles":87,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":21753,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4890710382513661,"acs":2506,"articleLive":2,"columnArticles":63,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5124,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.4037958115183246,"acs":1234,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3056,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26623586429725365,"acs":824,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"","submitted":3095,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19790906880622416,"acs":814,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4113,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5679723502304147,"acs":493,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":868,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5096864644404793,"acs":3999,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"","submitted":7846,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.24194177788183877,"acs":3100,"articleLive":2,"columnArticles":69,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"","submitted":12813,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.423728813559322,"acs":1350,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3186,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20125666412795126,"acs":1057,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"","submitted":5252,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.4027640671273445,"acs":408,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1013,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8260371959942775,"acs":2887,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"","submitted":3495,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.19574982722874915,"acs":1133,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"","submitted":5788,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3757776856076317,"acs":906,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"","submitted":2411,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.36088273474686283,"acs":834,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2311,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1613588110403397,"acs":304,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1884,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.2294072363356428,"acs":298,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1299,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5421496904895892,"acs":4817,"articleLive":2,"columnArticles":106,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":8885,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6834788807699163,"acs":3835,"articleLive":2,"columnArticles":75,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":5611,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.412303664921466,"acs":1890,"articleLive":2,"columnArticles":61,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4584,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6783363992641765,"acs":424062,"articleLive":2,"columnArticles":2894,"formTitle":"[剑指 Offer 03]数组中重复的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":625150,"title":"数组中重复的数字 LCOF","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4033458166405388,"acs":277873,"articleLive":2,"columnArticles":2206,"formTitle":"[剑指 Offer 04]二维数组中的查找 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":688920,"title":"二维数组中的查找 LCOF","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7603069201767146,"acs":309949,"articleLive":2,"columnArticles":2043,"formTitle":"[剑指 Offer 05]替换空格 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":407663,"title":"替换空格 LCOF","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7502953800710759,"acs":325133,"articleLive":2,"columnArticles":2220,"formTitle":"[剑指 Offer 06]从尾到头打印链表 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"","submitted":433340,"title":"从尾到头打印链表 LCOF","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6985462324898328,"acs":197873,"articleLive":2,"columnArticles":1497,"formTitle":"[剑指 Offer 07]重建二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":283264,"title":"重建二叉树 LCOF","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7140158303464755,"acs":286863,"articleLive":2,"columnArticles":1787,"formTitle":"[剑指 Offer 09]用两个栈实现队列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"","submitted":401760,"title":"用两个栈实现队列 LCOF","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.36059636205701995,"acs":278966,"articleLive":2,"columnArticles":1917,"formTitle":"[剑指 Offer 10- I]斐波那契数列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","submitted":773624,"title":"斐波那契数列 LCOF","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44511173274033616,"acs":207970,"articleLive":2,"columnArticles":1374,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":467231,"title":"青蛙跳台阶问题 LCOF","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49250583569244305,"acs":277661,"articleLive":2,"columnArticles":1700,"formTitle":"[剑指 Offer 11]旋转数组的最小数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":563772,"title":"旋转数组的最小数字 LCOF","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45233129431981955,"acs":181094,"articleLive":2,"columnArticles":1196,"formTitle":"[剑指 Offer 12]矩阵中的路径 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":400357,"title":"矩阵中的路径 LCOF","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5273986503627784,"acs":187101,"articleLive":2,"columnArticles":1783,"formTitle":"[剑指 Offer 13]机器人的运动范围 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":354762,"title":"机器人的运动范围 LCOF","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5697033233441042,"acs":165202,"articleLive":2,"columnArticles":1357,"formTitle":"[剑指 Offer 14- I]剪绳子 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":289979,"title":"剪绳子 LCOF","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3128261268820379,"acs":86869,"articleLive":2,"columnArticles":507,"formTitle":"[剑指 Offer 14- II]剪绳子 II LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":277691,"title":"剪绳子 II LCOF","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7475150537324613,"acs":207564,"articleLive":2,"columnArticles":1299,"formTitle":"[剑指 Offer 15]二进制中1的个数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"","submitted":277672,"title":"二进制中1的个数 LCOF","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3406959097474904,"acs":130431,"articleLive":2,"columnArticles":797,"formTitle":"[剑指 Offer 16]数值的整数次方 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":382837,"title":"数值的整数次方 LCOF","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7775069395389559,"acs":156296,"articleLive":2,"columnArticles":1158,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":201022,"title":"打印从1到最大的n位数 LCOF","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968433196250956,"acs":199699,"articleLive":2,"columnArticles":1528,"formTitle":"[剑指 Offer 18]删除链表的节点 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"","submitted":334592,"title":"删除链表的节点 LCOF","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3780529364989208,"acs":69888,"articleLive":2,"columnArticles":464,"formTitle":"[剑指 Offer 19]正则表达式匹配 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":184863,"title":"正则表达式匹配 LCOF","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24375808186399506,"acs":80681,"articleLive":2,"columnArticles":893,"formTitle":"[剑指 Offer 20]表示数值的字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":330988,"title":"表示数值的字符串 LCOF","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.643941884162777,"acs":205695,"articleLive":2,"columnArticles":1714,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":319431,"title":"调整数组顺序使奇数位于偶数前面 LCOF","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7984261518859646,"acs":273845,"articleLive":2,"columnArticles":2521,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"","submitted":342981,"title":"链表中倒数第k个节点 LCOF","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426137458172504,"acs":312252,"articleLive":2,"columnArticles":1922,"formTitle":"[剑指 Offer 24]反转链表 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"","submitted":420477,"title":"反转链表 LCOF","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7278670823117857,"acs":196832,"articleLive":2,"columnArticles":1237,"formTitle":"[剑指 Offer 25]合并两个排序的链表 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":270423,"title":"合并两个排序的链表 LCOF","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4658555706497346,"acs":155688,"articleLive":2,"columnArticles":1259,"formTitle":"[剑指 Offer 26]树的子结构 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":334198,"title":"树的子结构 LCOF","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7924306828374216,"acs":203203,"articleLive":2,"columnArticles":1475,"formTitle":"[剑指 Offer 27]二叉树的镜像 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":256430,"title":"二叉树的镜像 LCOF","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5794900583100938,"acs":160003,"articleLive":2,"columnArticles":1162,"formTitle":"[剑指 Offer 28]对称的二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":276110,"title":"对称的二叉树 LCOF","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43949237874487723,"acs":152067,"articleLive":2,"columnArticles":1529,"formTitle":"[剑指 Offer 29]顺时针打印矩阵 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":346006,"title":"顺时针打印矩阵 LCOF","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5638095579150925,"acs":157441,"articleLive":2,"columnArticles":1044,"formTitle":"[剑指 Offer 30]包含min函数的栈 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"","submitted":279245,"title":"包含min函数的栈 LCOF","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.616083520566213,"acs":118731,"articleLive":2,"columnArticles":988,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":192719,"title":"栈的压入、弹出序列 LCOF","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6425597156645818,"acs":147524,"articleLive":2,"columnArticles":1036,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":229588,"title":"从上到下打印二叉树 LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6869659021621876,"acs":146468,"articleLive":2,"columnArticles":1161,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":213210,"title":"从上到下打印二叉树 II LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5885294733869572,"acs":129214,"articleLive":2,"columnArticles":1219,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":219554,"title":"从上到下打印二叉树 III LCOF","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.552850837582612,"acs":119371,"articleLive":2,"columnArticles":1001,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":215919,"title":"二叉搜索树的后序遍历序列 LCOF","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5780238187649378,"acs":141480,"articleLive":2,"columnArticles":911,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":244765,"title":"二叉树中和为某一值的路径 LCOF","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7188216539645798,"acs":131668,"articleLive":2,"columnArticles":903,"formTitle":"[剑指 Offer 35]复杂链表的复制 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"","submitted":183172,"title":"复杂链表的复制 LCOF","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545479214474065,"acs":110957,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":169517,"title":"二叉搜索树与双向链表 LCOF","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5620958704836678,"acs":80758,"articleLive":2,"columnArticles":576,"formTitle":"[剑指 Offer 37]序列化二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"","submitted":143673,"title":"序列化二叉树 LCOF","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5796977443503123,"acs":164633,"articleLive":2,"columnArticles":1149,"formTitle":"[剑指 Offer 38]字符串的排列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"","submitted":283998,"title":"字符串的排列 LCOF","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6920622366999202,"acs":176761,"articleLive":2,"columnArticles":1065,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"","submitted":255412,"title":"数组中出现次数超过一半的数字 LCOF","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5707224459784243,"acs":260024,"articleLive":2,"columnArticles":1861,"formTitle":"[剑指 Offer 40]最小的k个数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":455605,"title":"最小的k个数 LCOF","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5815692016191543,"acs":67526,"articleLive":2,"columnArticles":497,"formTitle":"[剑指 Offer 41]数据流中的中位数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":116110,"title":"数据流中的中位数 LCOF","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6060841665500423,"acs":233860,"articleLive":2,"columnArticles":1568,"formTitle":"[剑指 Offer 42]连续子数组的最大和 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"","submitted":385854,"title":"连续子数组的最大和 LCOF","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4876612397651931,"acs":51340,"articleLive":2,"columnArticles":527,"formTitle":"[剑指 Offer 43]1～n整数中1出现的次数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":105278,"title":"1～n整数中1出现的次数 LCOF","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41705036176966853,"acs":58332,"articleLive":2,"columnArticles":487,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":139868,"title":"数字序列中某一位的数字 LCOF","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5597679159177104,"acs":116158,"articleLive":2,"columnArticles":857,"formTitle":"[剑指 Offer 45]把数组排成最小的数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":207511,"title":"把数组排成最小的数 LCOF","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5334687624883442,"acs":128152,"articleLive":2,"columnArticles":1507,"formTitle":"[剑指 Offer 46]把数字翻译成字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":240224,"title":"把数字翻译成字符串 LCOF","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6891065733114566,"acs":127258,"articleLive":2,"columnArticles":1047,"formTitle":"[剑指 Offer 47]礼物的最大价值 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":184671,"title":"礼物的最大价值 LCOF","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46447677688214684,"acs":161055,"articleLive":2,"columnArticles":1099,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":346745,"title":"最长不含重复字符的子字符串 LCOF","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6511207851493321,"acs":92284,"articleLive":2,"columnArticles":536,"formTitle":"[剑指 Offer 49]丑数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":141731,"title":"丑数 LCOF","titleSlug":"chou-shu-lcof"},{"acceptance":0.6158190406651864,"acs":165308,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":268436,"title":"第一个只出现一次的字符 LCOF","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48345685905460045,"acs":107369,"articleLive":2,"columnArticles":882,"formTitle":"[剑指 Offer 51]数组中的逆序对 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":222086,"title":"数组中的逆序对 LCOF","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6505049791651952,"acs":184210,"articleLive":2,"columnArticles":1085,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"","submitted":283180,"title":"两个链表的第一个公共节点 LCOF","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5365594628212426,"acs":203605,"articleLive":2,"columnArticles":1674,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"","submitted":379464,"title":"在排序数组中查找数字 LCOF","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4477359540144632,"acs":181098,"articleLive":2,"columnArticles":1552,"formTitle":"[剑指 Offer 53 - II]缺失的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":404475,"title":"缺失的数字 LCOF","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7583397570505834,"acs":171177,"articleLive":2,"columnArticles":1199,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":225726,"title":"二叉搜索树的第k大节点 LCOF","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.790210890108442,"acs":185890,"articleLive":2,"columnArticles":1314,"formTitle":"[剑指 Offer 55 - I]二叉树的深度 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":235241,"title":"二叉树的深度 LCOF","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.589219444682597,"acs":144324,"articleLive":2,"columnArticles":970,"formTitle":"[剑指 Offer 55 - II]平衡二叉树 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":244941,"title":"平衡二叉树 LCOF","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6965140241403396,"acs":120662,"articleLive":2,"columnArticles":1068,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":173237,"title":"数组中数字出现的次数 LCOF","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8018776493986971,"acs":95150,"articleLive":2,"columnArticles":727,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":118659,"title":"数组中数字出现的次数 II LCOF","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6676438272903663,"acs":142799,"articleLive":2,"columnArticles":884,"formTitle":"[剑指 Offer 57]和为s的两个数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":213885,"title":"和为s的两个数字 LCOF","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7080889659606804,"acs":145365,"articleLive":2,"columnArticles":1903,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":205292,"title":"和为s的连续正数序列 LCOF","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44244081373294697,"acs":137865,"articleLive":2,"columnArticles":1028,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":311601,"title":"翻转单词顺序 LCOF","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8583008489174657,"acs":221724,"articleLive":2,"columnArticles":1877,"formTitle":"[剑指 Offer 58 - II]左旋转字符串 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":258329,"title":"左旋转字符串 LCOF","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.444117808937654,"acs":137176,"articleLive":2,"columnArticles":1234,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":308873,"title":"滑动窗口的最大值 LCOF","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47522274790460867,"acs":98939,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 59 - II]队列的最大值 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"","submitted":208195,"title":"队列的最大值 LCOF","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5632268039541425,"acs":68485,"articleLive":2,"columnArticles":607,"formTitle":"[剑指 Offer 60]n个骰子的点数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":121594,"title":"n个骰子的点数 LCOF","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4601561097027735,"acs":110183,"articleLive":2,"columnArticles":1031,"formTitle":"[剑指 Offer 61]扑克牌中的顺子 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":239447,"title":"扑克牌中的顺子 LCOF","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6554676078216374,"acs":114775,"articleLive":2,"columnArticles":788,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":175104,"title":"圆圈中最后剩下的数字 LCOF","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6347015853630956,"acs":140323,"articleLive":2,"columnArticles":1003,"formTitle":"[剑指 Offer 63]股票的最大利润 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":221085,"title":"股票的最大利润 LCOF","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8564482959476005,"acs":144094,"articleLive":2,"columnArticles":1337,"formTitle":"[剑指 Offer 64]求1+2+…+n LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":168246,"title":"求1+2+…+n LCOF","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5861639212286351,"acs":75723,"articleLive":2,"columnArticles":525,"formTitle":"[剑指 Offer 65]不用加减乘除做加法 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":129184,"title":"不用加减乘除做加法 LCOF","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.597517305386906,"acs":77256,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 66]构建乘积数组 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":129295,"title":"构建乘积数组 LCOF","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2872353513105939,"acs":72379,"articleLive":2,"columnArticles":586,"formTitle":"[剑指 Offer 67]把字符串转换成整数 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":251985,"title":"把字符串转换成整数 LCOF","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6945006437373552,"acs":124608,"articleLive":2,"columnArticles":720,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":179421,"title":"二叉搜索树的最近公共祖先 LCOF","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006067554758405,"acs":123435,"articleLive":2,"columnArticles":719,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先 LCOF","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":176183,"title":"二叉树的最近公共祖先 LCOF","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20707748212799917,"acs":12195,"articleLive":2,"columnArticles":142,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":58891,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5627134430301148,"acs":10875,"articleLive":2,"columnArticles":155,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":19326,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7814542952173414,"acs":13627,"articleLive":2,"columnArticles":184,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":17438,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6976916888421313,"acs":11274,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":16159,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7123964175106722,"acs":8511,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":11947,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6568466636047503,"acs":10011,"articleLive":2,"columnArticles":123,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":15241,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4483147218522692,"acs":8752,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":19522,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.499742518738914,"acs":8734,"articleLive":2,"columnArticles":119,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":17477,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5552600703949941,"acs":7099,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":12785,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44194332899722866,"acs":7814,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":17681,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5589887640449438,"acs":5771,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":10324,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.666635106987313,"acs":7041,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":10562,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6569043383057342,"acs":4800,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":7307,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5030233984751555,"acs":5740,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":11411,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6313594662218516,"acs":4542,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":7194,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.48741238735517095,"acs":6815,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":13982,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5151675019783698,"acs":3906,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":7582,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5193792342839136,"acs":6593,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":12694,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4724462936231638,"acs":5564,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":11777,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7163196776359974,"acs":5333,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":7445,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5318889641164523,"acs":7856,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":14770,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.533011178388449,"acs":9155,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":17176,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7050307259660452,"acs":6769,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":9601,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7711094025598119,"acs":17050,"articleLive":2,"columnArticles":155,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":22111,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.604352020580984,"acs":5638,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":9329,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6605746883583351,"acs":6253,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":9466,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6130106851037084,"acs":9753,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":15910,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6296582351805368,"acs":3261,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":5179,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2981896551724138,"acs":3459,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":11600,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.548828125,"acs":3091,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":5632,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5493808517064331,"acs":3638,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":6622,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.594935145151328,"acs":4816,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":8095,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7784169807577862,"acs":3924,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":5041,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5736408012119172,"acs":3408,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":5941,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6696595585484474,"acs":3580,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":5346,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5656154628687691,"acs":3892,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":6881,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.44006227296315514,"acs":4240,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":9635,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.776788455634019,"acs":5060,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":6514,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5070400742689154,"acs":3277,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":6463,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5817382307294361,"acs":2249,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":3866,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7809903047091413,"acs":4511,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":5776,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8368526339186486,"acs":3765,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":4499,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.658168574401665,"acs":2530,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":3844,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6475286317058468,"acs":4297,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":6636,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8067095767505363,"acs":4136,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":5127,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7238944630248978,"acs":3896,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":5382,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6847439544807966,"acs":3851,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":5624,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6997525433049216,"acs":2545,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":3637,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7578646329837941,"acs":3975,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":5245,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6068049124219851,"acs":3014,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":4967,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4147717558557018,"acs":2426,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":5849,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7459969661216922,"acs":4426,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":5933,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6417816813048933,"acs":4092,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":6376,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8584544758990054,"acs":3366,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":3921,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8876231527093597,"acs":2883,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":3248,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7213571545648254,"acs":4401,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":6101,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35925992455541583,"acs":2000,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":5567,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.606687898089172,"acs":1905,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":3140,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6260869565217392,"acs":2952,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":4715,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6786018755328218,"acs":3184,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":4692,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5318501170960187,"acs":2271,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":4270,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7691193511008111,"acs":2655,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":3452,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7181208053691275,"acs":2033,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":2831,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6268602540834846,"acs":1727,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":2755,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6387893269613699,"acs":1604,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":2511,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6460952380952381,"acs":1696,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":2625,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6743295019157088,"acs":1584,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":2349,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5064142483497323,"acs":4066,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":8029,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7224726085942964,"acs":37190,"articleLive":2,"columnArticles":388,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":51476,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6531892645521088,"acs":3748,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":5738,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5070378479824835,"acs":1621,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":3197,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4179409600130837,"acs":5111,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":12229,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5264253017062006,"acs":2530,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":4806,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5641941243304658,"acs":3476,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":6161,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7180552669852482,"acs":3456,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":4813,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.684570531509307,"acs":6105,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":8918,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5882030479114132,"acs":5365,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":9121,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6395759717314488,"acs":4163,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":6509,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8544093178036606,"acs":4108,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":4808,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8203381276810497,"acs":3251,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":3963,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7859688917692806,"acs":4851,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":6172,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6488919667590027,"acs":3748,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":5776,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8653921186110027,"acs":4436,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":5126,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6859363153904473,"acs":3619,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":5276,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8532128119473374,"acs":4342,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":5089,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7613695765812859,"acs":2913,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":3826,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6456026058631922,"acs":2973,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":4605,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7409128177097568,"acs":5422,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":7318,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6171792152704135,"acs":3492,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":5658,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5021814006888634,"acs":2187,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":4355,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7820134228187919,"acs":2913,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":3725,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6769886363636364,"acs":2383,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":3520,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5764304013663536,"acs":2025,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":3513,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5890608132421734,"acs":1637,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":2779,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6480007077140835,"acs":7325,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":11304,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.500143061516452,"acs":1748,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":3495,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5381996974281392,"acs":1423,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":2644,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7727787209960385,"acs":2731,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":3534,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7041161264664944,"acs":3541,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":5029,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7513321492007105,"acs":2538,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":3378,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4882743005013747,"acs":3019,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":6183,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5949080622347949,"acs":2103,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":3535,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49476850640857967,"acs":3783,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":7646,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5864714086471409,"acs":1682,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":2868,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6978337050015929,"acs":4381,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":6278,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5551304347826087,"acs":1596,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":2875,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5444915254237288,"acs":1542,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":2832,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.6064073226544623,"acs":1060,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1748,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6028708133971292,"acs":1638,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":2717,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8343558282208589,"acs":2312,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":2771,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6950301204819277,"acs":923,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":1328,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5634837355718783,"acs":1611,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":2859,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5914093006744764,"acs":1666,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":2817,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4319526627218935,"acs":803,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1859,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.3163894023413432,"acs":1027,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":3246,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6427649505234476,"acs":4482,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":6973,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6260061919504644,"acs":1011,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":1615,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7131868131868132,"acs":1298,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1820,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.47634543178973715,"acs":3806,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":7990,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7181626811649074,"acs":94842,"articleLive":2,"columnArticles":1589,"formTitle":"[面试题 01.01]Is Unique LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":132062,"title":"Is Unique LCCI","titleSlug":"is-unique-lcci"},{"acceptance":0.6444972624251942,"acs":60740,"articleLive":2,"columnArticles":1145,"formTitle":"[面试题 01.02]Check Permutation LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":94244,"title":"Check Permutation LCCI","titleSlug":"check-permutation-lcci"},{"acceptance":0.5786230581350658,"acs":46670,"articleLive":2,"columnArticles":506,"formTitle":"[面试题 01.03]String to URL LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":80657,"title":"String to URL LCCI","titleSlug":"string-to-url-lcci"},{"acceptance":0.5501529250992386,"acs":42271,"articleLive":2,"columnArticles":805,"formTitle":"[面试题 01.04]Palindrome Permutation LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":76835,"title":"Palindrome Permutation LCCI","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33009075963773965,"acs":33933,"articleLive":2,"columnArticles":579,"formTitle":"[面试题 01.05]One Away LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":102799,"title":"One Away LCCI","titleSlug":"one-away-lcci"},{"acceptance":0.47104177650963,"acs":75939,"articleLive":2,"columnArticles":1194,"formTitle":"[面试题 01.06]Compress String LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":161215,"title":"Compress String LCCI","titleSlug":"compress-string-lcci"},{"acceptance":0.7511428413304555,"acs":67862,"articleLive":2,"columnArticles":982,"formTitle":"[面试题 01.07]Rotate Matrix LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":90345,"title":"Rotate Matrix LCCI","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219853340575774,"acs":45803,"articleLive":2,"columnArticles":512,"formTitle":"[面试题 01.08]Zero Matrix LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":73640,"title":"Zero Matrix LCCI","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5494794972705345,"acs":34626,"articleLive":2,"columnArticles":437,"formTitle":"[面试题 01.09]String Rotation LCCI","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":63016,"title":"String Rotation LCCI","titleSlug":"string-rotation-lcci"},{"acceptance":0.6807298435306961,"acs":65476,"articleLive":2,"columnArticles":704,"formTitle":"[面试题 02.01]Remove Duplicate Node LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"","submitted":96185,"title":"Remove Duplicate Node LCCI","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800899299383038,"acs":67140,"articleLive":2,"columnArticles":965,"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":86067,"title":"Kth Node From End of List LCCI","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8549107142857143,"acs":73153,"articleLive":2,"columnArticles":696,"formTitle":"[面试题 02.03]Delete Middle Node LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"","submitted":85568,"title":"Delete Middle Node LCCI","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6516173502043228,"acs":26470,"articleLive":2,"columnArticles":376,"formTitle":"[面试题 02.04]Partition List LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"","submitted":40622,"title":"Partition List LCCI","titleSlug":"partition-list-lcci"},{"acceptance":0.4666127122943493,"acs":38629,"articleLive":2,"columnArticles":538,"formTitle":"[面试题 02.05]Sum Lists LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"","submitted":82786,"title":"Sum Lists LCCI","titleSlug":"sum-lists-lcci"},{"acceptance":0.4838321516627933,"acs":41013,"articleLive":2,"columnArticles":520,"formTitle":"[面试题 02.06]Palindrome Linked List LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"","submitted":84767,"title":"Palindrome Linked List LCCI","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6837678612955738,"acs":52925,"articleLive":2,"columnArticles":468,"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":77402,"title":"Intersection of Two Linked Lists LCCI","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5336055747040311,"acs":28486,"articleLive":2,"columnArticles":293,"formTitle":"[面试题 02.08]Linked List Cycle LCCI","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"","submitted":53384,"title":"Linked List Cycle LCCI","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5365381066617457,"acs":11630,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 03.01]Three in One LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":21676,"title":"Three in One LCCI","titleSlug":"three-in-one-lcci"},{"acceptance":0.6134132668237878,"acs":26808,"articleLive":2,"columnArticles":304,"formTitle":"[面试题 03.02]Min Stack LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"","submitted":43703,"title":"Min Stack LCCI","titleSlug":"min-stack-lcci"},{"acceptance":0.3877229800629591,"acs":8868,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 03.03]Stack of Plates LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":22872,"title":"Stack of Plates LCCI","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7131084593572778,"acs":24143,"articleLive":2,"columnArticles":349,"formTitle":"[面试题 03.04]Implement Queue using Stacks LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"","submitted":33856,"title":"Implement Queue using Stacks LCCI","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5420507929779944,"acs":15346,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 03.05]Sort of Stacks LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":28311,"title":"Sort of Stacks LCCI","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5890924229808493,"acs":11320,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 03.06]Animal Shelter LCCI","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":19216,"title":"Animal Shelter LCCI","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5320218265364733,"acs":18525,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 04.01]Route Between Nodes LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":34820,"title":"Route Between Nodes LCCI","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894106691499269,"acs":35604,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 04.02]Minimum Height Tree LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":45102,"title":"Minimum Height Tree LCCI","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8070392700016294,"acs":24764,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 04.03]List of Depth LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":30685,"title":"List of Depth LCCI","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5856608715130003,"acs":33990,"articleLive":2,"columnArticles":389,"formTitle":"[面试题 04.04]Check Balance LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":58037,"title":"Check Balance LCCI","titleSlug":"check-balance-lcci"},{"acceptance":0.3522337457787744,"acs":26389,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 04.05]Legal Binary Search Tree LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":74919,"title":"Legal Binary Search Tree LCCI","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5920511520477719,"acs":21019,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.06]Successor LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":35502,"title":"Successor LCCI","titleSlug":"successor-lcci"},{"acceptance":0.7163787089095909,"acs":17456,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 04.08]First Common Ancestor LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":24367,"title":"First Common Ancestor LCCI","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47607556536127965,"acs":6905,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 04.09]BST Sequences LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14504,"title":"BST Sequences LCCI","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7162861749978783,"acs":16880,"articleLive":2,"columnArticles":268,"formTitle":"[面试题 04.10]Check SubTree LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":23566,"title":"Check SubTree LCCI","titleSlug":"check-subtree-lcci"},{"acceptance":0.4867665816326531,"acs":18318,"articleLive":2,"columnArticles":268,"formTitle":"[面试题 04.12]Paths with Sum LCCI","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":37632,"title":"Paths with Sum LCCI","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5046063012164707,"acs":9914,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 05.01]Insert Into Bits LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":19647,"title":"Insert Into Bits LCCI","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6927446423960754,"acs":8049,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 05.02]Bianry Number to String LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11619,"title":"Bianry Number to String LCCI","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38349416968234823,"acs":11445,"articleLive":2,"columnArticles":242,"formTitle":"[面试题 05.03]Reverse Bits LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":29844,"title":"Reverse Bits LCCI","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3830997641182184,"acs":5522,"articleLive":2,"columnArticles":141,"formTitle":"[面试题 05.04]Closed Number LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":14414,"title":"Closed Number LCCI","titleSlug":"closed-number-lcci"},{"acceptance":0.5289489698339563,"acs":12169,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 05.06]Convert Integer LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":23006,"title":"Convert Integer LCCI","titleSlug":"convert-integer-lcci"},{"acceptance":0.7049131923940002,"acs":11937,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 05.07]Exchange LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16934,"title":"Exchange LCCI","titleSlug":"exchange-lcci"},{"acceptance":0.5529776858282843,"acs":3742,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 05.08]Draw Line LCCI","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6767,"title":"Draw Line LCCI","titleSlug":"draw-line-lcci"},{"acceptance":0.3635193982581156,"acs":44076,"articleLive":2,"columnArticles":484,"formTitle":"[面试题 08.01]Three Steps Problem LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":121248,"title":"Three Steps Problem LCCI","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36098629521455855,"acs":12854,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 08.02]Robot in a Grid LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":35608,"title":"Robot in a Grid LCCI","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6755889750038495,"acs":52650,"articleLive":2,"columnArticles":438,"formTitle":"[面试题 08.03]Magic Index LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":77932,"title":"Magic Index LCCI","titleSlug":"magic-index-lcci"},{"acceptance":0.8203770467177407,"acs":21845,"articleLive":2,"columnArticles":339,"formTitle":"[面试题 08.04]Power Set LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":26628,"title":"Power Set LCCI","titleSlug":"power-set-lcci"},{"acceptance":0.6779327023557161,"acs":22706,"articleLive":2,"columnArticles":508,"formTitle":"[面试题 08.05]Recursive Mulitply LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":33493,"title":"Recursive Mulitply LCCI","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.655651441801726,"acs":24920,"articleLive":2,"columnArticles":272,"formTitle":"[面试题 08.06]Hanota LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":38008,"title":"Hanota LCCI","titleSlug":"hanota-lcci"},{"acceptance":0.8138112848302882,"acs":22226,"articleLive":2,"columnArticles":327,"formTitle":"[面试题 08.07]Permutation I LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":27311,"title":"Permutation I LCCI","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185689090450995,"acs":17112,"articleLive":2,"columnArticles":249,"formTitle":"[面试题 08.08]Permutation II LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"","submitted":23814,"title":"Permutation II LCCI","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8145649978358102,"acs":22583,"articleLive":2,"columnArticles":369,"formTitle":"[面试题 08.09]Bracket LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":27724,"title":"Bracket LCCI","titleSlug":"bracket-lcci"},{"acceptance":0.557973557973558,"acs":14307,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.10]Color Fill LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":25641,"title":"Color Fill LCCI","titleSlug":"color-fill-lcci"},{"acceptance":0.49460768208893396,"acs":34626,"articleLive":2,"columnArticles":337,"formTitle":"[面试题 08.11]Coin LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":70007,"title":"Coin LCCI","titleSlug":"coin-lcci"},{"acceptance":0.7608922515001304,"acs":17499,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 08.12]Eight Queens LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22998,"title":"Eight Queens LCCI","titleSlug":"eight-queens-lcci"},{"acceptance":0.5016056967327562,"acs":7185,"articleLive":2,"columnArticles":94,"formTitle":"[面试题 08.13]Pile Box LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14324,"title":"Pile Box LCCI","titleSlug":"pile-box-lcci"},{"acceptance":0.5358106450821682,"acs":4369,"articleLive":2,"columnArticles":78,"formTitle":"[面试题 08.14]Boolean Evaluation LCCI","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"","submitted":8154,"title":"Boolean Evaluation LCCI","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5552182780974998,"acs":57982,"articleLive":2,"columnArticles":2389,"formTitle":"[面试题 10.01]Sorted Merge LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":104431,"title":"Sorted Merge LCCI","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7398184339931912,"acs":35205,"articleLive":2,"columnArticles":432,"formTitle":"[面试题 10.02]Group Anagrams LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"","submitted":47586,"title":"Group Anagrams LCCI","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39382862971778304,"acs":13899,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 10.03]Search Rotate Array LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":35292,"title":"Search Rotate Array LCCI","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5544142219300409,"acs":20240,"articleLive":2,"columnArticles":264,"formTitle":"[面试题 10.05]Sparse Array Search LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":36507,"title":"Sparse Array Search LCCI","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4543215707442143,"acs":13467,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 10.09]Sorted Matrix Search LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":29642,"title":"Sorted Matrix Search LCCI","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6242846479223687,"acs":5018,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 10.10]Rank from Stream LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8038,"title":"Rank from Stream LCCI","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.666255347153669,"acs":8099,"articleLive":2,"columnArticles":105,"formTitle":"[面试题 10.11]Peaks and Valleys LCCI","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12156,"title":"Peaks and Valleys LCCI","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8290122874831086,"acs":26380,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 16.01]Swap Numbers LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":31821,"title":"Swap Numbers LCCI","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7633910988578181,"acs":15506,"articleLive":2,"columnArticles":205,"formTitle":"[面试题 16.02]Words Frequency LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":20312,"title":"Words Frequency LCCI","titleSlug":"words-frequency-lcci"},{"acceptance":0.44185940422425984,"acs":9686,"articleLive":2,"columnArticles":234,"formTitle":"[面试题 16.03]Intersection LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21921,"title":"Intersection LCCI","titleSlug":"intersection-lcci"},{"acceptance":0.45951739343459086,"acs":7503,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.04]Tic-Tac-Toe LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":16328,"title":"Tic-Tac-Toe LCCI","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4621492635563235,"acs":11233,"articleLive":2,"columnArticles":131,"formTitle":"[面试题 16.05]Factorial Zeros LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":24306,"title":"Factorial Zeros LCCI","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4230023758909591,"acs":13531,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 16.06]Smallest Difference LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":31988,"title":"Smallest Difference LCCI","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7317152454220393,"acs":20259,"articleLive":2,"columnArticles":303,"formTitle":"[面试题 16.07]Maximum LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":27687,"title":"Maximum LCCI","titleSlug":"maximum-lcci"},{"acceptance":0.376270126621854,"acs":2407,"articleLive":2,"columnArticles":65,"formTitle":"[面试题 16.08]English Int LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6397,"title":"English Int LCCI","titleSlug":"english-int-lcci"},{"acceptance":0.5471607314725698,"acs":2274,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 16.09]Operations LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4156,"title":"Operations LCCI","titleSlug":"operations-lcci"},{"acceptance":0.6798017192696242,"acs":10834,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.10]Living People LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15937,"title":"Living People LCCI","titleSlug":"living-people-lcci"},{"acceptance":0.44077127843462627,"acs":50999,"articleLive":2,"columnArticles":595,"formTitle":"[面试题 16.11]Diving Board LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":115704,"title":"Diving Board LCCI","titleSlug":"diving-board-lcci"},{"acceptance":0.42651888341543515,"acs":2078,"articleLive":2,"columnArticles":57,"formTitle":"[面试题 16.13]Bisect Squares LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4872,"title":"Bisect Squares LCCI","titleSlug":"bisect-squares-lcci"},{"acceptance":0.550754357697378,"acs":3760,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.14]Best Line LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6827,"title":"Best Line LCCI","titleSlug":"best-line-lcci"},{"acceptance":0.5028598920190304,"acs":9407,"articleLive":2,"columnArticles":240,"formTitle":"[面试题 16.15]Master Mind LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":18707,"title":"Master Mind LCCI","titleSlug":"master-mind-lcci"},{"acceptance":0.4543977249644526,"acs":15659,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 16.16]Sub Sort LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":34461,"title":"Sub Sort LCCI","titleSlug":"sub-sort-lcci"},{"acceptance":0.5991932217121253,"acs":35501,"articleLive":2,"columnArticles":386,"formTitle":"[面试题 16.17]Contiguous Sequence LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":59248,"title":"Contiguous Sequence LCCI","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34367947084981343,"acs":15380,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 16.18]Pattern Matching LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44751,"title":"Pattern Matching LCCI","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6129505694493366,"acs":20882,"articleLive":2,"columnArticles":373,"formTitle":"[面试题 16.19]Pond Sizes LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34068,"title":"Pond Sizes LCCI","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7228358793576185,"acs":9227,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 16.20]T9 LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12765,"title":"T9 LCCI","titleSlug":"t9-lcci"},{"acceptance":0.4632781534157146,"acs":9935,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.21]Sum Swap LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":21445,"title":"Sum Swap LCCI","titleSlug":"sum-swap-lcci"},{"acceptance":0.5880670208418471,"acs":2878,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.22]Langtons Ant LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4894,"title":"Langtons Ant LCCI","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4735211621384016,"acs":11311,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 16.24]Pairs With Sum LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23887,"title":"Pairs With Sum LCCI","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5450243926316305,"acs":33404,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 16.25]LRU Cache LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":61289,"title":"LRU Cache LCCI","titleSlug":"lru-cache-lcci"},{"acceptance":0.38874248432902647,"acs":15194,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.26]Calculator LCCI","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":39085,"title":"Calculator LCCI","titleSlug":"calculator-lcci"},{"acceptance":0.5967726759503199,"acs":12685,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 17.01]Add Without Plus LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":21256,"title":"Add Without Plus LCCI","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6398930504532313,"acs":29437,"articleLive":2,"columnArticles":476,"formTitle":"[面试题 17.04]Missing Number LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":46003,"title":"Missing Number LCCI","titleSlug":"missing-number-lcci"},{"acceptance":0.3896279289621176,"acs":5770,"articleLive":2,"columnArticles":100,"formTitle":"[面试题 17.05]Find Longest Subarray LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14809,"title":"Find Longest Subarray LCCI","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45200295366438986,"acs":4897,"articleLive":2,"columnArticles":116,"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":10834,"title":"Number Of 2s In Range LCCI","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41132903579755864,"acs":8997,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 17.07]Baby Names LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21873,"title":"Baby Names LCCI","titleSlug":"baby-names-lcci"},{"acceptance":0.2718249563976534,"acs":8572,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 17.08]Circus Tower LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":31535,"title":"Circus Tower LCCI","titleSlug":"circus-tower-lcci"},{"acceptance":0.5488291544311422,"acs":14578,"articleLive":2,"columnArticles":156,"formTitle":"[面试题 17.09]Get Kth Magic Number LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":26562,"title":"Get Kth Magic Number LCCI","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705512710654099,"acs":67915,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 17.10]Find Majority Element LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"","submitted":119034,"title":"Find Majority Element LCCI","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6872264959233497,"acs":14919,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 17.11]Find Closest LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21709,"title":"Find Closest LCCI","titleSlug":"find-closest-lcci"},{"acceptance":0.6332287482039703,"acs":21595,"articleLive":2,"columnArticles":300,"formTitle":"[面试题 17.12]BiNode LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":34103,"title":"BiNode LCCI","titleSlug":"binode-lcci"},{"acceptance":0.5517607973421927,"acs":24912,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 17.13]Re-Space LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45150,"title":"Re-Space LCCI","titleSlug":"re-space-lcci"},{"acceptance":0.5966581520835538,"acs":78951,"articleLive":2,"columnArticles":771,"formTitle":"[面试题 17.14]Smallest K LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","submitted":132322,"title":"Smallest K LCCI","titleSlug":"smallest-k-lcci"},{"acceptance":0.40469568591941013,"acs":6257,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 17.15]Longest Word LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":15461,"title":"Longest Word LCCI","titleSlug":"longest-word-lcci"},{"acceptance":0.5176061911148505,"acs":62135,"articleLive":2,"columnArticles":1154,"formTitle":"[面试题 17.16]The Masseuse LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":120043,"title":"The Masseuse LCCI","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44741208585344966,"acs":8359,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 17.17]Multi Search LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":18683,"title":"Multi Search LCCI","titleSlug":"multi-search-lcci"},{"acceptance":0.4448895434462445,"acs":7552,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 17.18]Shortest Supersequence LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16975,"title":"Shortest Supersequence LCCI","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5783117049980727,"acs":9002,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 17.19]Missing Two LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15566,"title":"Missing Two LCCI","titleSlug":"missing-two-lcci"},{"acceptance":0.5734510793383796,"acs":4091,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 17.20]Continuous Median LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7134,"title":"Continuous Median LCCI","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358502078869323,"acs":44809,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 17.21]Volume of Histogram LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":70471,"title":"Volume of Histogram LCCI","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3776295326184824,"acs":9227,"articleLive":2,"columnArticles":157,"formTitle":"[面试题 17.22]Word Transformer LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":24434,"title":"Word Transformer LCCI","titleSlug":"word-transformer-lcci"},{"acceptance":0.3772626230549381,"acs":4752,"articleLive":2,"columnArticles":105,"formTitle":"[面试题 17.23]Max Black Square LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12596,"title":"Max Black Square LCCI","titleSlug":"max-black-square-lcci"},{"acceptance":0.522337383845604,"acs":11692,"articleLive":2,"columnArticles":127,"formTitle":"[面试题 17.24]Max Submatrix LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":22384,"title":"Max Submatrix LCCI","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5042042042042042,"acs":1679,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]Word Rectangle LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3330,"title":"Word Rectangle LCCI","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34388584388584387,"acs":3639,"articleLive":2,"columnArticles":58,"formTitle":"[面试题 17.26]Sparse Similarity LCCI","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10582,"title":"Sparse Similarity LCCI","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/hua-jie-suan-fa-3-wu-zhong-fu-zi-fu-de-zui-chang-z.md b/src/leetcode/stack/leetcode/editor/cn/doc/hua-jie-suan-fa-3-wu-zhong-fu-zi-fu-de-zui-chang-z.md
new file mode 100644
index 0000000..8e7346f
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/doc/hua-jie-suan-fa-3-wu-zhong-fu-zi-fu-de-zui-chang-z.md
@@ -0,0 +1,35 @@
+### 思路
+
+- 标签：滑动窗口
+- 暴力解法时间复杂度较高，会达到 *O(n^2)*，故而采取滑动窗口的方法降低时间复杂度
+- 定义一个 map 数据结构存储 (k, v)，其中 key 值为字符，value 值为字符位置 +1，加 1 表示从字符位置后一个才开始不重复
+- 我们定义不重复子串的开始位置为 start，结束位置为 end
+- 随着 end 不断遍历向后，会遇到与 [start, end] 区间内字符相同的情况，此时将字符作为 key 值，获取其 value 值，并更新 start，此时 [start, end] 区间内不存在重复字符
+- 无论是否更新 start，都会更新其 map 数据结构和结果 ans。
+- 时间复杂度：*O(n)*
+
+### 代码
+
+```Java []
+class Solution {
+ public int lengthOfLongestSubstring(String s) {
+ int n = s.length(), ans = 0;
+ Map map = new HashMap<>();
+ for (int end = 0, start = 0; end < n; end++) {
+ char alpha = s.charAt(end);
+ if (map.containsKey(alpha)) {
+ start = Math.max(map.get(alpha), start);
+ }
+ ans = Math.max(ans, end - start + 1);
+ map.put(s.charAt(end), end + 1);
+ }
+ return ans;
+ }
+}
+```
+
+### 画解
+
+        
+
+想看大鹏画解更多高频面试题，欢迎阅读大鹏的 LeetBook：[《画解剑指 Offer 》](https://leetcode-cn.com/leetbook/detail/illustrate-lcof/)，O(∩_∩)O
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__Sigma_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__Sigma_.png
new file mode 100644
index 0000000..3c101e1
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__Sigma_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p___mleq_n,i_0,j=_m+n+1__2-ileq__n+n+1__2-i__n+n+1__2=n__.png b/src/leetcode/stack/leetcode/editor/cn/doc/p___mleq_n,i_0,j=_m+n+1__2-ileq__n+n+1__2-i__n+n+1__2=n__.png
new file mode 100644
index 0000000..0f71896
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p___mleq_n,i_0,j=_m+n+1__2-ileq__n+n+1__2-i__n+n+1__2=n__.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p___mleq_n,i_m,j=_m+n+1__2-igeq_m+m+1__2-i__m+m+1__2-m=0__.png b/src/leetcode/stack/leetcode/editor/cn/doc/p___mleq_n,i_m,j=_m+n+1__2-igeq_m+m+1__2-i__m+m+1__2-m=0__.png
new file mode 100644
index 0000000..0e9d0f2
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p___mleq_n,i_m,j=_m+n+1__2-igeq_m+m+1__2-i__m+m+1__2-m=0__.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{_a_bcabcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{_a_bcabcbb}_.png
new file mode 100644
index 0000000..c6f46bc
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{_a_bcabcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{_abc_abcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{_abc_abcbb}_.png
new file mode 100644
index 0000000..ec9722e
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{_abc_abcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{a_b_cabcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{a_b_cabcbb}_.png
new file mode 100644
index 0000000..b87e512
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{a_b_cabcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{a_bca_bcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{a_bca_bcbb}_.png
new file mode 100644
index 0000000..6ccade9
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{a_bca_bcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{ab_c_abcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{ab_c_abcbb}_.png
new file mode 100644
index 0000000..8149e35
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{ab_c_abcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{ab_cab_cbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{ab_cab_cbb}_.png
new file mode 100644
index 0000000..b5b99a0
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{ab_cab_cbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abc_a_bcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abc_a_bcbb}_.png
new file mode 100644
index 0000000..ad36157
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abc_a_bcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abc_abc_bb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abc_abc_bb}_.png
new file mode 100644
index 0000000..f271575
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abc_abc_bb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abca_b_cbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abca_b_cbb}_.png
new file mode 100644
index 0000000..97d7881
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abca_b_cbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abca_bc_bb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abca_bc_bb}_.png
new file mode 100644
index 0000000..37fa224
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abca_bc_bb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcab_c_bb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcab_c_bb}_.png
new file mode 100644
index 0000000..aed21b1
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcab_c_bb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcab_cb_b}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcab_cb_b}_.png
new file mode 100644
index 0000000..38f46fb
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcab_cb_b}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabc_b_b}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabc_b_b}_.png
new file mode 100644
index 0000000..0eb7b4c
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabc_b_b}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabcb_b_}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabcb_b_}_.png
new file mode 100644
index 0000000..b32d93c
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabcb_b_}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabcbb}_.png b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabcbb}_.png
new file mode 100644
index 0000000..a439515
Binary files /dev/null and b/src/leetcode/stack/leetcode/editor/cn/doc/p__texttt{abcabcbb}_.png differ
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/wu-zhong-fu-zi-fu-de-zui-chang-zi-chuan-by-leetc-2.md b/src/leetcode/stack/leetcode/editor/cn/doc/wu-zhong-fu-zi-fu-de-zui-chang-zi-chuan-by-leetc-2.md
new file mode 100644
index 0000000..48d5ff9
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/doc/wu-zhong-fu-zi-fu-de-zui-chang-zi-chuan-by-leetc-2.md
@@ -0,0 +1,172 @@
+### 📺 视频题解
+
+
+### 📖 文字题解
+#### 方法一：滑动窗口
+
+**思路和算法**
+
+我们先用一个例子考虑如何在较优的时间复杂度内通过本题。
+
+我们不妨以示例一中的字符串  为例，找出**从每一个字符开始的，不包含重复字符的最长子串**，那么其中最长的那个字符串即为答案。对于示例一中的字符串，我们列举出这些结果，其中括号中表示选中的字符以及最长的字符串：
+
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  ；
+- 以  开始的最长字符串为  。
+
+发现了什么？如果我们依次递增地枚举子串的起始位置，那么子串的结束位置也是递增的！这里的原因在于，假设我们选择字符串中的第 *k* 个字符作为起始位置，并且得到了不包含重复字符的最长子串的结束位置为 *r_k*。那么当我们选择第 *k+1* 个字符作为起始位置时，首先从 *k+1* 到 *r_k* 的字符显然是不重复的，并且由于少了原本的第 *k* 个字符，我们可以尝试继续增大 *r_k*，直到右侧出现了重复字符为止。
+
+这样一来，我们就可以使用「滑动窗口」来解决这个问题了：
+
+- 我们使用两个指针表示字符串中的某个子串（或窗口）的左右边界，其中左指针代表着上文中「枚举子串的起始位置」，而右指针即为上文中的 *r_k*；
+
+- 在每一步的操作中，我们会将左指针向右移动一格，表示 **我们开始枚举下一个字符作为起始位置**，然后我们可以不断地向右移动右指针，但需要保证这两个指针对应的子串中没有重复的字符。在移动结束后，这个子串就对应着 **以左指针开始的，不包含重复字符的最长子串**。我们记录下这个子串的长度；
+
+- 在枚举结束后，我们找到的最长的子串的长度即为答案。
+
+**判断重复字符**
+
+在上面的流程中，我们还需要使用一种数据结构来判断 **是否有重复的字符**，常用的数据结构为哈希集合（即 `C++` 中的 `std::unordered_set`，`Java` 中的 `HashSet`，`Python` 中的 `set`, `JavaScript` 中的 `Set`）。在左指针向右移动的时候，我们从哈希集合中移除一个字符，在右指针向右移动的时候，我们往哈希集合中添加一个字符。
+
+至此，我们就完美解决了本题。
+
+```C++ [sol1-C++]
+class Solution {
+public:
+ int lengthOfLongestSubstring(string s) {
+ // 哈希集合，记录每个字符是否出现过
+ unordered_set occ;
+ int n = s.size();
+ // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动
+ int rk = -1, ans = 0;
+ // 枚举左指针的位置，初始值隐性地表示为 -1
+ for (int i = 0; i < n; ++i) {
+ if (i != 0) {
+ // 左指针向右移动一格，移除一个字符
+ occ.erase(s[i - 1]);
+ }
+ while (rk + 1 < n && !occ.count(s[rk + 1])) {
+ // 不断地移动右指针
+ occ.insert(s[rk + 1]);
+ ++rk;
+ }
+ // 第 i 到 rk 个字符是一个极长的无重复字符子串
+ ans = max(ans, rk - i + 1);
+ }
+ return ans;
+ }
+};
+```
+
+```Java [sol1-Java]
+class Solution {
+ public int lengthOfLongestSubstring(String s) {
+ // 哈希集合，记录每个字符是否出现过
+ Set occ = new HashSet();
+ int n = s.length();
+ // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动
+ int rk = -1, ans = 0;
+ for (int i = 0; i < n; ++i) {
+ if (i != 0) {
+ // 左指针向右移动一格，移除一个字符
+ occ.remove(s.charAt(i - 1));
+ }
+ while (rk + 1 < n && !occ.contains(s.charAt(rk + 1))) {
+ // 不断地移动右指针
+ occ.add(s.charAt(rk + 1));
+ ++rk;
+ }
+ // 第 i 到 rk 个字符是一个极长的无重复字符子串
+ ans = Math.max(ans, rk - i + 1);
+ }
+ return ans;
+ }
+}
+```
+
+```Python [sol1-Python3]
+class Solution:
+ def lengthOfLongestSubstring(self, s: str) -> int:
+ # 哈希集合，记录每个字符是否出现过
+ occ = set()
+ n = len(s)
+ # 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动
+ rk, ans = -1, 0
+ for i in range(n):
+ if i != 0:
+ # 左指针向右移动一格，移除一个字符
+ occ.remove(s[i - 1])
+ while rk + 1 < n and s[rk + 1] not in occ:
+ # 不断地移动右指针
+ occ.add(s[rk + 1])
+ rk += 1
+ # 第 i 到 rk 个字符是一个极长的无重复字符子串
+ ans = max(ans, rk - i + 1)
+ return ans
+```
+
+```JavaScript [sol1-JavaScript]
+var lengthOfLongestSubstring = function(s) {
+ // 哈希集合，记录每个字符是否出现过
+ const occ = new Set();
+ const n = s.length;
+ // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动
+ let rk = -1, ans = 0;
+ for (let i = 0; i < n; ++i) {
+ if (i != 0) {
+ // 左指针向右移动一格，移除一个字符
+ occ.delete(s.charAt(i - 1));
+ }
+ while (rk + 1 < n && !occ.has(s.charAt(rk + 1))) {
+ // 不断地移动右指针
+ occ.add(s.charAt(rk + 1));
+ ++rk;
+ }
+ // 第 i 到 rk 个字符是一个极长的无重复字符子串
+ ans = Math.max(ans, rk - i + 1);
+ }
+ return ans;
+};
+```
+
+```golang [sol1-Golang]
+func lengthOfLongestSubstring(s string) int {
+ // 哈希集合，记录每个字符是否出现过
+ m := map[byte]int{}
+ n := len(s)
+ // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动
+ rk, ans := -1, 0
+ for i := 0; i < n; i++ {
+ if i != 0 {
+ // 左指针向右移动一格，移除一个字符
+ delete(m, s[i-1])
+ }
+ for rk + 1 < n && m[s[rk+1]] == 0 {
+ // 不断地移动右指针
+ m[s[rk+1]]++
+ rk++
+ }
+ // 第 i 到 rk 个字符是一个极长的无重复字符子串
+ ans = max(ans, rk - i + 1)
+ }
+ return ans
+}
+
+func max(x, y int) int {
+ if x < y {
+ return y
+ }
+ return x
+}
+```
+
+**复杂度分析**
+
+- 时间复杂度：*O(N)*，其中 *N* 是字符串的长度。左指针和右指针分别会遍历整个字符串一次。
+
+- 空间复杂度： ，其中  表示字符集（即字符串中可以出现的字符）， 表示字符集的大小。在本题中没有明确说明字符集，因此可以默认为所有 ASCII 码在 *[0, 128)* 内的字符，即  。我们需要用到哈希集合来存储出现过的字符，而字符最多有  个，因此空间复杂度为  。
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/cn/doc/xiang-xi-tong-su-de-si-lu-fen-xi-duo-jie-fa-by-w-2.md b/src/leetcode/stack/leetcode/editor/cn/doc/xiang-xi-tong-su-de-si-lu-fen-xi-duo-jie-fa-by-w-2.md
new file mode 100644
index 0000000..6a8f8ae
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/cn/doc/xiang-xi-tong-su-de-si-lu-fen-xi-duo-jie-fa-by-w-2.md
@@ -0,0 +1,346 @@
+### 解法一
+
+简单粗暴，先将两个数组合并，两个有序数组的合并也是归并排序中的一部分。然后根据奇数，还是偶数，返回中位数。
+
+### 代码
+
+``` [-Java]
+public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+ int[] nums;
+ int m = nums1.length;
+ int n = nums2.length;
+ nums = new int[m + n];
+ if (m == 0) {
+ if (n % 2 == 0) {
+ return (nums2[n / 2 - 1] + nums2[n / 2]) / 2.0;
+ } else {
+
+ return nums2[n / 2];
+ }
+ }
+ if (n == 0) {
+ if (m % 2 == 0) {
+ return (nums1[m / 2 - 1] + nums1[m / 2]) / 2.0;
+ } else {
+ return nums1[m / 2];
+ }
+ }
+
+ int count = 0;
+ int i = 0, j = 0;
+ while (count != (m + n)) {
+ if (i == m) {
+ while (j != n) {
+ nums[count++] = nums2[j++];
+ }
+ break;
+ }
+ if (j == n) {
+ while (i != m) {
+ nums[count++] = nums1[i++];
+ }
+ break;
+ }
+
+ if (nums1[i] < nums2[j]) {
+ nums[count++] = nums1[i++];
+ } else {
+ nums[count++] = nums2[j++];
+ }
+ }
+
+ if (count % 2 == 0) {
+ return (nums[count / 2 - 1] + nums[count / 2]) / 2.0;
+ } else {
+ return nums[count / 2];
+ }
+}
+```
+
+时间复杂度：遍历全部数组 *(m+n)*
+
+空间复杂度：开辟了一个数组，保存合并后的两个数组 *O(m+n)*
+
+### 解法二
+
+其实，我们不需要将两个数组真的合并，我们只需要找到中位数在哪里就可以了。
+
+开始的思路是写一个循环，然后里边判断是否到了中位数的位置，到了就返回结果，但这里对偶数和奇数的分类会很麻烦。当其中一个数组遍历完后，出了 `for` 循环对边界的判断也会分几种情况。总体来说，虽然复杂度不影响，但代码会看起来很乱。
+
+
+
+首先是怎么将奇数和偶数的情况合并一下。
+
+用 `len` 表示合并后数组的长度，如果是奇数，我们需要知道第 `（len+1）/2` 个数就可以了，如果遍历的话需要遍历 `int(len/2 ) + 1` 次。如果是偶数，我们需要知道第 `len/2`和 `len/2+1` 个数，也是需要遍历 `len/2+1` 次。所以遍历的话，奇数和偶数都是 `len/2+1` 次。
+
+
+
+返回中位数的话，奇数需要最后一次遍历的结果就可以了，偶数需要最后一次和上一次遍历的结果。所以我们用两个变量 `left` 和 `right`，`right` 保存当前循环的结果，在每次循环前将 `right` 的值赋给 `left`。这样在最后一次循环的时候，`left` 将得到 `right` 的值，也就是上一次循环的结果，接下来 `right` 更新为最后一次的结果。
+
+
+
+循环中该怎么写，什么时候 `A` 数组后移，什么时候 `B` 数组后移。用 `aStart` 和 `bStart` 分别表示当前指向 `A` 数组和 `B` 数组的位置。如果 `aStart` 还没有到最后并且此时 `A` 位置的数字小于 `B` 位置的数组，那么就可以后移了。也就是`aStart`＜`m&&A[aStart]`< `B[bStart]`。
+
+但如果 `B` 数组此刻已经没有数字了，继续取数字 `B[ bStart ]`，则会越界，所以判断下 `bStart` 是否大于数组长度了，这样 `||` 后边的就不会执行了，也就不会导致错误了，所以增加为 `aStart`＜`m&&(bStart) `>= `n||A[aStart]`<`B[bStart]) `。
+
+### 代码
+
+``` java [-Java]
+public double findMedianSortedArrays(int[] A, int[] B) {
+ int m = A.length;
+ int n = B.length;
+ int len = m + n;
+ int left = -1, right = -1;
+ int aStart = 0, bStart = 0;
+ for (int i = 0; i <= len / 2; i++) {
+ left = right;
+ if (aStart < m && (bStart >= n || A[aStart] < B[bStart])) {
+ right = A[aStart++];
+ } else {
+ right = B[bStart++];
+ }
+ }
+ if ((len & 1) == 0)
+ return (left + right) / 2.0;
+ else
+ return right;
+}
+```
+
+时间复杂度：遍历 `len/2+1` 次，`len=m+n`，所以时间复杂度依旧是 *O(m+n)*。
+
+空间复杂度：我们申请了常数个变量，也就是 `m`，`n`，`len`，`left`，`right`，`aStart`，`bStart` 以及 `i`。
+
+总共 8 个变量，所以空间复杂度是 *O(1）*。
+
+### 解法三
+
+上边的两种思路，时间复杂度都达不到题目的要求 *O(log(m+n)*。看到 `log`，很明显，我们只有用到二分的方法才能达到。我们不妨用另一种思路，题目是求中位数，其实就是求第 `k` 小数的一种特殊情况，而求第 `k` 小数有一种算法。
+
+解法二中，我们一次遍历就相当于去掉不可能是中位数的一个值，也就是一个一个排除。由于数列是有序的，其实我们完全可以一半儿一半儿的排除。假设我们要找第 `k` 小数，我们可以每次循环排除掉 `k/2` 个数。看下边一个例子。
+
+假设我们要找第 7 小的数字。
+
+
+
+
+
+我们比较两个数组的第 `k/2` 个数字，如果 `k` 是奇数，向下取整。也就是比较第 *3* 个数字，上边数组中的 *4* 和下边数组中的 *3*，如果哪个小，就表明该数组的前 `k/2` 个数字都不是第 `k` 小数字，所以可以排除。也就是 *1*，*2*，*3* 这三个数字不可能是第 *7* 小的数字，我们可以把它排除掉。将 *1349* 和 *45678910* 两个数组作为新的数组进行比较。
+
+更一般的情况 `A[1]` ，`A[2]` ，`A[3]`，`A[k/2]` ... ，`B[1]`，`B[2]`，`B[3]`，`B[k/2]` ... ，如果 `A[k/2]`<`B[k/2]` ，那么`A[1]`，`A[2]`，`A[3]`，`A[k/2]`都不可能是第 `k` 小的数字。
+
+`A` 数组中比 `A[k/2]` 小的数有 `k/2-1` 个，`B` 数组中，`B[k/2]` 比 `A[k/2]` 小，假设 `B[k/2]` 前边的数字都比 `A[k/2]` 小，也只有 `k/2-1` 个，所以比 `A[k/2]` 小的数字最多有 `k/1-1+k/2-1=k-2`个，所以 `A[k/2]` 最多是第 `k-1` 小的数。而比 `A[k/2]` 小的数更不可能是第 `k` 小的数了，所以可以把它们排除。
+
+橙色的部分表示已经去掉的数字。
+
+
+
+
+由于我们已经排除掉了 3 个数字，就是这 3 个数字一定在最前边，所以在两个新数组中，我们只需要找第 7 - 3 = 4 小的数字就可以了，也就是 k = 4。此时两个数组，比较第 2 个数字，3 < 5，所以我们可以把小的那个数组中的 1 ，3 排除掉了。
+
+
+
+
+我们又排除掉 2 个数字，所以现在找第 4 - 2 = 2 小的数字就可以了。此时比较两个数组中的第 k / 2 = 1 个数，4 == 4，怎么办呢？由于两个数相等，所以我们无论去掉哪个数组中的都行，因为去掉 1 个总会保留 1 个的，所以没有影响。为了统一，我们就假设 4 > 4 吧，所以此时将下边的 4 去掉。
+
+
+
+
+由于又去掉 1 个数字，此时我们要找第 1 小的数字，所以只需判断两个数组中第一个数字哪个小就可以了，也就是 4。
+
+所以第 7 小的数字是 4。
+
+我们每次都是取 `k/2` 的数进行比较，有时候可能会遇到数组长度小于 `k/2`的时候。
+
+
+
+
+此时 k / 2 等于 3，而上边的数组长度是 2，我们此时将箭头指向它的末尾就可以了。这样的话，由于 2 < 3，所以就会导致上边的数组 1，2 都被排除。造成下边的情况。
+
+
+
+
+由于 2 个元素被排除，所以此时 k = 5，又由于上边的数组已经空了，我们只需要返回下边的数组的第 5 个数字就可以了。
+
+从上边可以看到，无论是找第奇数个还是第偶数个数字，对我们的算法并没有影响，而且在算法进行中，k 的值都有可能从奇数变为偶数，最终都会变为 1 或者由于一个数组空了，直接返回结果。
+
+所以我们采用递归的思路，为了防止数组长度小于 `k/2`，所以每次比较 `min(k/2`，`len`(数组) 对应的数字，把小的那个对应的数组的数字排除，将两个新数组进入递归，并且 `k` 要减去排除的数字的个数。递归出口就是当 `k=1` 或者其中一个数字长度是 `0` 了。
+
+### 代码
+
+```java [-Java]
+public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+ int n = nums1.length;
+ int m = nums2.length;
+ int left = (n + m + 1) / 2;
+ int right = (n + m + 2) / 2;
+ //将偶数和奇数的情况合并，如果是奇数，会求两次同样的 k 。
+ return (getKth(nums1, 0, n - 1, nums2, 0, m - 1, left) + getKth(nums1, 0, n - 1, nums2, 0, m - 1, right)) * 0.5;
+}
+
+ private int getKth(int[] nums1, int start1, int end1, int[] nums2, int start2, int end2, int k) {
+ int len1 = end1 - start1 + 1;
+ int len2 = end2 - start2 + 1;
+ //让 len1 的长度小于 len2，这样就能保证如果有数组空了，一定是 len1
+ if (len1 > len2) return getKth(nums2, start2, end2, nums1, start1, end1, k);
+ if (len1 == 0) return nums2[start2 + k - 1];
+
+ if (k == 1) return Math.min(nums1[start1], nums2[start2]);
+
+ int i = start1 + Math.min(len1, k / 2) - 1;
+ int j = start2 + Math.min(len2, k / 2) - 1;
+
+ if (nums1[i] > nums2[j]) {
+ return getKth(nums1, start1, end1, nums2, j + 1, end2, k - (j - start2 + 1));
+ }
+ else {
+ return getKth(nums1, i + 1, end1, nums2, start2, end2, k - (i - start1 + 1));
+ }
+ }
+```
+
+时间复杂度：每进行一次循环，我们就减少 `k/2` 个元素，所以时间复杂度是 `O(log(k)`，而 `k=(m+n)/2`，所以最终的复杂也就是 *O(log(m+n）*。
+
+空间复杂度：虽然我们用到了递归，但是可以看到这个递归属于尾递归，所以编译器不需要不停地堆栈，所以空间复杂度为 *O(1)*。
+
+### 解法四
+
+我们首先理一下中位数的定义是什么
+
+> 中位数（又称中值，英语：Median），[统计学] (https://baike.baidu.com/item/%E7%BB%9F%E8%AE%A1%E5%AD%A6/2630438)中的专有名词，代表一个样本、种群或 [概率分布] (https://baike.baidu.com/item/%E6%A6%82%E7%8E%87%E5%88%86%E5%B8%83/828907)中的一个数值，其可将数值集合划分为相等的上下两部分。
+
+所以我们只需要将数组进行切。
+
+一个长度为 m 的数组，有 0 到 m 总共 m + 1 个位置可以切。
+
+
+
+
+我们把数组 A 和数组 B 分别在 i 和 j 进行切割。
+
+
+
+
+将 i 的左边和 j 的左边组合成「左半部分」，将 i 的右边和 j 的右边组合成「右半部分」。
+
+* 当 A 数组和 B 数组的总长度是偶数时，如果我们能够保证
+
+ *左半部分的长度等于右半部分
+
+ i + j = m - i + n - j , 也就是 j = ( m + n ) / 2 - i
+
+ *左半部分最大的值小于等于右半部分最小的值 max ( A [ i - 1 ] , B [ j - 1 ]）） <= min ( A [ i ] , B [ j ]））
+
+ 那么，中位数就可以表示如下
+
+ （左半部分最大值 + 右半部分最小值 ）/ 2。
+
+ （max ( A [ i - 1 ] , B [ j - 1 ]）+ min ( A [ i ] , B [ j ]）） / 2
+
+* 当 A 数组和 B 数组的总长度是奇数时，如果我们能够保证
+
+ *左半部分的长度比右半部分大 1
+
+ i + j = m - i + n - j + 1也就是 j = ( m + n + 1) / 2 - i
+
+ *左半部分最大的值小于等于右半部分最小的值 max ( A [ i - 1 ] , B [ j - 1 ]）） <= min ( A [ i ] , B [ j ]））
+
+ 那么，中位数就是
+
+ 左半部分最大值，也就是左半部比右半部分多出的那一个数。
+
+ max ( A [ i - 1 ] , B [ j - 1 ]）
+
+
+上边的第一个条件我们其实可以合并为 *j = ( m + n + 1) / 2 - i*，因为如果 *m + n* 是偶数，由于我们取的是 *int* 值，所以加 *1* 也不会影响结果。当然，由于 *0 <= i <= m* ，为了保证 *0 <= j <= n*，我们必须保证 *m <= n*。
+
+
+
+
+
+最后一步由于是 int 间的运算，所以 *1/2=0*。
+
+而对于第二个条件，奇数和偶数的情况是一样的，我们进一步分析。为了保证 max ( A [ i - 1 ] , B [ j - 1 ]）） <= min ( A [ i ] , B [ j ]）），因为 A 数组和 B 数组是有序的，所以 A [ i - 1 ] <= A [ i ]，B [ i - 1 ] <= B [ i ] 这是天然的，所以我们只需要保证 B [ j - 1 ] < = A [ i ] 和 A [ i - 1 ] <= B [ j ] 所以我们分两种情况讨论：
+
+* B [ j - 1 ] > A [ i ]，并且为了不越界，要保证 j != 0，i != m
+
+
+
+
+ 此时很明显，我们需要增加 i ，为了数量的平衡还要减少 j ，幸运的是 j = ( m + n + 1) / 2 - i，i 增大，j 自然会减少。
+
+
+* A [ i - 1 ] > B [ j ] ，并且为了不越界，要保证 i != 0，j != n
+
+
+
+
+ 此时和上边的情况相反，我们要减少 i ，增大 j 。
+
+上边两种情况，我们把边界都排除了，需要单独讨论。
+
+* 当 i = 0, 或者 j = 0，也就是切在了最前边。
+
+
+
+
+ 此时左半部分当 j = 0 时，最大的值就是 A [ i - 1 ] ；当 i = 0 时 最大的值就是 B [ j - 1] 。右半部分最小值和之前一样。
+
+
+* 当 i = m 或者 j = n，也就是切在了最后边。
+
+
+
+
+ 此时左半部分最大值和之前一样。右半部分当 j = n 时，最小值就是 A [ i ] ；当 i = m 时，最小值就是B [ j ] 。
+
+ 所有的思路都理清了，最后一个问题，增加 i 的方式。当然用二分了。初始化 i 为中间的值，然后减半找中间的，减半找中间的，减半找中间的直到答案。
+
+```java [- Java]
+class Solution {
+ public double findMedianSortedArrays(int[] A, int[] B) {
+ int m = A.length;
+ int n = B.length;
+ if (m > n) {
+ return findMedianSortedArrays(B,A); // 保证 m <= n
+ }
+ int iMin = 0, iMax = m;
+ while (iMin <= iMax) {
+ int i = (iMin + iMax) / 2;
+ int j = (m + n + 1) / 2 - i;
+ if (j != 0 && i != m && B[j-1] > A[i]){ // i 需要增大
+ iMin = i + 1;
+ }
+ else if (i != 0 && j != n && A[i-1] > B[j]) { // i 需要减小
+ iMax = i - 1;
+ }
+ else { // 达到要求，并且将边界条件列出来单独考虑
+ int maxLeft = 0;
+ if (i == 0) { maxLeft = B[j-1]; }
+ else if (j == 0) { maxLeft = A[i-1]; }
+ else { maxLeft = Math.max(A[i-1], B[j-1]); }
+ if ( (m + n) % 2 == 1 ) { return maxLeft; } // 奇数的话不需要考虑右半部分
+
+ int minRight = 0;
+ if (i == m) { minRight = B[j]; }
+ else if (j == n) { minRight = A[i]; }
+ else { minRight = Math.min(B[j], A[i]); }
+
+ return (maxLeft + minRight) / 2.0; //如果是偶数的话返回结果
+ }
+ }
+ return 0.0;
+ }
+}
+```
+
+时间复杂度：我们对较短的数组进行了二分查找，所以时间复杂度是 *O(log（min（m，n））*。
+
+空间复杂度：只有一些固定的变量，和数组长度无关，所以空间复杂度是 *O ( 1 )*。
+
+### 总结
+
+解法二中体会到了对情况的转换，有时候即使有了思路，代码也不一定写的优雅，需要多锻炼才可以。解法三和解法四充分发挥了二分查找的优势，将时间复杂度降为 log 级别。
+
+
+
diff --git a/src/leetcode/stack/leetcode/editor/en/P114FlattenBinaryTreeToLinkedList.java b/src/leetcode/stack/leetcode/editor/en/P114FlattenBinaryTreeToLinkedList.java
new file mode 100644
index 0000000..ec8b3fa
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P114FlattenBinaryTreeToLinkedList.java
@@ -0,0 +1,114 @@
+//Given the root of a binary tree, flatten the tree into a "linked list":
+//
+//
+// The "linked list" should use the same TreeNode class where the right child
+//pointer points to the next node in the list and the left child pointer is always
+//null.
+// The "linked list" should be in the same order as a pre-order traversal of
+//the binary tree.
+//
+//
+//
+// Example 1:
+//
+//
+//Input: root = [1,2,5,3,4,null,6]
+//Output: [1,null,2,null,3,null,4,null,5,null,6]
+//
+//
+// Example 2:
+//
+//
+//Input: root = []
+//Output: []
+//
+//
+// Example 3:
+//
+//
+//Input: root = [0]
+//Output: [0]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [0, 2000].
+// -100 <= Node.val <= 100
+//
+//
+//
+//Follow up: Can you flatten the tree in-place (with O(1) extra space)? Related
+//Topics Linked List Stack Tree Depth-First Search Binary Tree 👍 5893 👎 434
+
+
+package leetcode.stack.leetcode.editor.en;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-24 23:24:06
+ * @title: Flatten Binary Tree to Linked List
+ */
+public class P114FlattenBinaryTreeToLinkedList {
+
+ public static void main(String[] args) {
+ Solution_114 solution = new Solution_114();
+ // TO TEST
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+
+class TreeNode_114 {
+ int val;
+ TreeNode_114 left;
+ TreeNode_114 right;
+ TreeNode_114() {}
+
+ TreeNode_114(int val) {this.val = val;}
+
+ TreeNode_114(int val, TreeNode_114 left, TreeNode_114 right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
+
+class Solution_114 {
+ public void flatten(TreeNode_114 root) {
+ TreeNode_114 cur = root;
+ TreeNode_114 tmp;
+
+ while (cur != null) {
+ if (cur.left != null) {
+ tmp = cur.left;
+ while (tmp.right != null) {
+ tmp = tmp.right;
+ }
+ tmp.right = cur.right;
+ cur.right = cur.left;
+ cur.left = null;
+ }
+ cur = cur.right;
+ }
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P1249MinimumRemoveToMakeValidParentheses.java b/src/leetcode/stack/leetcode/editor/en/P1249MinimumRemoveToMakeValidParentheses.java
new file mode 100644
index 0000000..c2e0cbf
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P1249MinimumRemoveToMakeValidParentheses.java
@@ -0,0 +1,144 @@
+//Given a string s of '(' , ')' and lowercase English characters.
+//
+// Your task is to remove the minimum number of parentheses ( '(' or ')', in any
+// positions ) so that the resulting parentheses string is valid and return any va
+//lid string.
+//
+// Formally, a parentheses string is valid if and only if:
+//
+//
+// It is the empty string, contains only lowercase characters, or
+// It can be written as AB (A concatenated with B), where A and B are valid stri
+//ngs, or
+// It can be written as (A), where A is a valid string.
+//
+//
+//
+// Example 1:
+//
+//
+//Input: s = "lee(t(c)o)de)"
+//Output: "lee(t(c)o)de"
+//Explanation: "lee(t(co)de)" , "lee(t(c)ode)" would also be accepted.
+//
+//
+// Example 2:
+//
+//
+//Input: s = "a)b(c)d"
+//Output: "ab(c)d"
+//
+//
+// Example 3:
+//
+//
+//Input: s = "))(("
+//Output: ""
+//Explanation: An empty string is also valid.
+//
+//
+// Example 4:
+//
+//
+//Input: s = "(a(b(c)d)"
+//Output: "a(b(c)d)"
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= s.length <= 10^5
+// s[i] is one of '(' , ')' and lowercase English letters.
+// Related Topics String Stack
+// 👍 1165 👎 30
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2020-10-14 01:27:20
+ * @title: Minimum Remove to Make Valid Parentheses
+ */
+public class P1249MinimumRemoveToMakeValidParentheses {
+
+ public static void main(String[] args) {
+ Solution_1249 solution = new Solution_1249();
+ // TO TEST
+ String s1 = "lee(t(c)o)de)";
+ String s2 = "a)b(c)d";
+ String s3 = "))((";
+ String s4 = "(a(b(c)d)";
+
+ System.out.println(solution.minRemoveToMakeValid(s1));
+ System.out.println(solution.minRemoveToMakeValid(s2));
+ System.out.println(solution.minRemoveToMakeValid(s3));
+ System.out.println(solution.minRemoveToMakeValid(s4));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_1249 {
+ public String minRemoveToMakeValid(String s) {
+ StringBuilder stringBuilder = new StringBuilder();
+ char[] chars = s.toCharArray();
+ Stack stack = new Stack<>();
+
+ for (int i = 0; i < s.length(); i++) {
+ char ch = s.charAt(i);
+ if (ch == '(') {
+ stack.push(i);
+ } else if (ch == ')') {
+ if (!stack.empty() && s.charAt(stack.peek()) == '(') {
+ stack.pop();
+ } else {
+ stack.push(i);
+ }
+ }
+ }
+
+ while (!stack.empty()) {
+ chars[stack.pop()] = '-';
+ }
+ for (char ch : chars) {
+ if (ch != '-') {
+ stringBuilder.append(ch);
+ }
+ }
+
+ return stringBuilder.toString();
+ }
+
+ public String minRemoveToMakeValid_1(String s) {
+ StringBuilder stringBuilder = new StringBuilder(s);
+ Map pair = new HashMap<>();
+ Stack stack = new Stack<>();
+
+ for (int i = 0; i < s.length(); i++) {
+ char ch = s.charAt(i);
+ if (ch == '(') {
+ stack.push(i);
+ } else if (ch == ')') {
+ if (!stack.empty() && s.charAt(stack.peek()) == '(') {
+ pair.put(i, stack.peek());
+ pair.put(stack.pop(), i);
+ } else {
+ stack.push(i);
+ }
+ }
+ }
+
+ while (!stack.empty()) {
+ stringBuilder = stringBuilder.replace(stack.peek(), stack.pop() + 1, "-");
+ }
+
+ return stringBuilder.toString().replaceAll("-", "");
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P143ReorderList.java b/src/leetcode/stack/leetcode/editor/en/P143ReorderList.java
new file mode 100644
index 0000000..ef3659f
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P143ReorderList.java
@@ -0,0 +1,145 @@
+//You are given the head of a singly linked-list. The list can be represented
+//as:
+//
+//
+//L0 → L1 → … → Ln - 1 → Ln
+//
+//
+// Reorder the list to be on the following form:
+//
+//
+//L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …
+//
+//
+// You may not modify the values in the list's nodes. Only nodes themselves may
+//be changed.
+//
+//
+// Example 1:
+//
+//
+//Input: head = [1,2,3,4]
+//Output: [1,4,2,3]
+//
+//
+// Example 2:
+//
+//
+//Input: head = [1,2,3,4,5]
+//Output: [1,5,2,4,3]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the list is in the range [1, 5 * 10⁴].
+// 1 <= Node.val <= 1000
+//
+// Related Topics Linked List Two Pointers Stack Recursion 👍 4293 👎 177
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-25 23:15:33
+ * @title: Reorder List
+ */
+public class P143ReorderList {
+
+ public static void main(String[] args) {
+ Solution_143 solution = new Solution_143();
+ // TO TEST
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode() {}
+ * ListNode(int val) { this.val = val; }
+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+
+class ListNode_143 {
+ int val;
+ ListNode_143 next;
+ ListNode_143() {}
+ ListNode_143(int val) { this.val = val; }
+ ListNode_143(int val, ListNode_143 next) { this.val = val; this.next = next; }
+}
+class Solution_143 {
+ public void reorderList2(ListNode_143 head) {
+ ListNode_143 fast = head;
+ ListNode_143 slow = head;
+ ListNode_143 pre = null;
+ ListNode_143 next;
+ while (fast.next != null && fast.next.next != null) {
+ slow = slow.next;
+ fast = fast.next.next;
+ }
+ if (fast.next != null) {
+ slow = slow.next;
+ }
+
+ // 反转后半段
+ while (slow != null) {
+ next = slow.next;
+ slow.next = pre;
+ pre = slow;
+ slow = next;
+ }
+
+ // 前半段head开始，后半段pre开始倒
+ ListNode_143 cur = head;
+ ListNode_143 left;
+ ListNode_143 right;
+ while (pre != null) {
+ if (pre.next == null) break;
+ left = cur.next;
+ right = pre.next;
+ cur.next = pre;
+ pre.next = left;
+
+ cur = left;
+ pre = right;
+ }
+
+ }
+
+ public void reorderList1(ListNode_143 head) {
+ Deque queue = new ArrayDeque<>();
+
+ ListNode_143 tmp = head;
+
+ while(tmp != null) {
+ queue.offerLast(tmp);
+ tmp = tmp.next;
+ }
+
+ tmp = queue.pollFirst();
+ while(queue.size() > 1) {
+ tmp.next = queue.pollLast();
+ tmp = tmp.next;
+ tmp.next = queue.pollFirst();
+ tmp = tmp.next;
+ }
+
+ if (!queue.isEmpty()) {
+ tmp.next = queue.pollFirst();
+ tmp = tmp.next;
+ }
+ tmp.next = null;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P144BinaryTreePreorderTraversal.java b/src/leetcode/stack/leetcode/editor/en/P144BinaryTreePreorderTraversal.java
new file mode 100644
index 0000000..2f49d06
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P144BinaryTreePreorderTraversal.java
@@ -0,0 +1,161 @@
+//Given the root of a binary tree, return the preorder traversal of its nodes'
+//values.
+//
+//
+// Example 1:
+//
+//
+//Input: root = [1,null,2,3]
+//Output: [1,2,3]
+//
+//
+// Example 2:
+//
+//
+//Input: root = []
+//Output: []
+//
+//
+// Example 3:
+//
+//
+//Input: root = [1]
+//Output: [1]
+//
+//
+// Example 4:
+//
+//
+//Input: root = [1,2]
+//Output: [1,2]
+//
+//
+// Example 5:
+//
+//
+//Input: root = [1,null,2]
+//Output: [1,2]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [0, 100].
+// -100 <= Node.val <= 100
+//
+//
+//
+// Follow up: Recursive solution is trivial, could you do it iteratively?
+// Related Topics Stack Tree Depth-First Search Binary Tree 👍 3175 👎 109
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-19 22:28:14
+ * @title: Binary Tree Preorder Traversal
+ */
+public class P144BinaryTreePreorderTraversal {
+
+ public static void main(String[] args) {
+ Solution_144 solution = new Solution_144();
+ // TO TEST 1
+ TreeNode_144 node3 = new TreeNode_144(3);
+ TreeNode_144 node2 = new TreeNode_144(2, node3, null);
+ TreeNode_144 node1 = new TreeNode_144(1, null, node2);
+ System.out.println(solution.preorderTraversal(node1));
+
+ // Test 2
+ System.out.println(solution.preorderTraversal(null));
+
+ // Test 3
+ node1 = new TreeNode_144(1);
+ System.out.println(solution.preorderTraversal(node1));
+
+ // Test 4
+ node2 = new TreeNode_144(2);
+ node1 = new TreeNode_144(1, node2, null);
+ System.out.println(solution.preorderTraversal(node1));
+
+ // Test 5
+ node1 = new TreeNode_144(1, null, node2);
+ System.out.println(solution.preorderTraversal(node1));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+
+class TreeNode_144 {
+ int val;
+ TreeNode_144 left;
+ TreeNode_144 right;
+ TreeNode_144() {}
+ TreeNode_144(int val) { this.val = val; }
+ TreeNode_144(int val, TreeNode_144 left, TreeNode_144 right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
+
+class Solution_144 {
+ public List preorderTraversal(TreeNode_144 root) {
+ List list = new ArrayList<>();
+
+ Stack stack = new Stack<>();
+ stack.push(root);
+ while (!stack.isEmpty()) {
+ TreeNode_144 node = stack.pop();
+ if (node == null) {
+ continue;
+ }
+ list.add(node.val);
+ stack.push(node.right);
+ stack.push(node.left);
+ }
+
+ return list;
+ }
+
+ public List preorderTraversal1(TreeNode_144 root) {
+ List list = new ArrayList<>();
+ if (root != null) {
+ preOrder(root, list);
+ }
+ return list;
+ }
+
+ public void preOrder(TreeNode_144 node, List list) {
+ if (node == null) {
+ return;
+ }
+
+ list.add(node.val);
+ preOrder(node.left, list);
+ preOrder(node.right, list);
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P145BinaryTreePostorderTraversal.java b/src/leetcode/stack/leetcode/editor/en/P145BinaryTreePostorderTraversal.java
new file mode 100644
index 0000000..2c1f112
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P145BinaryTreePostorderTraversal.java
@@ -0,0 +1,164 @@
+//Given the root of a binary tree, return the postorder traversal of its nodes'
+//values.
+//
+//
+// Example 1:
+//
+//
+//Input: root = [1,null,2,3]
+//Output: [3,2,1]
+//
+//
+// Example 2:
+//
+//
+//Input: root = []
+//Output: []
+//
+//
+// Example 3:
+//
+//
+//Input: root = [1]
+//Output: [1]
+//
+//
+// Example 4:
+//
+//
+//Input: root = [1,2]
+//Output: [2,1]
+//
+//
+// Example 5:
+//
+//
+//Input: root = [1,null,2]
+//Output: [2,1]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of the nodes in the tree is in the range [0, 100].
+// -100 <= Node.val <= 100
+//
+//
+//
+//Follow up: Recursive solution is trivial, could you do it iteratively?
+//Related Topics Stack Tree Depth-First Search Binary Tree 👍 3356 👎 128
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-19 22:52:15
+ * @title: Binary Tree Postorder Traversal
+ */
+public class P145BinaryTreePostorderTraversal {
+
+ public static void main(String[] args) {
+ Solution_145 solution = new Solution_145();
+ // TO TEST 1
+ TreeNode_145 node3 = new TreeNode_145(3);
+ TreeNode_145 node2 = new TreeNode_145(2, node3, null);
+ TreeNode_145 root = new TreeNode_145(1, null, node2);
+ System.out.println(solution.postorderTraversal(root));
+
+ // Test 2
+ System.out.println(solution.postorderTraversal(null));
+
+ // Test 3
+ root = new TreeNode_145(1);
+ System.out.println(solution.postorderTraversal(root));
+
+ // Test 4
+ node2 = new TreeNode_145(2);
+ root = new TreeNode_145(1, node2, null);
+ System.out.println(solution.postorderTraversal(root));
+
+ // Test 5
+ root = new TreeNode_145(1, null, node2);
+ System.out.println(solution.postorderTraversal(root));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+
+class TreeNode_145 {
+ int val;
+ TreeNode_145 left;
+ TreeNode_145 right;
+ TreeNode_145() {}
+ TreeNode_145(int val) { this.val = val; }
+ TreeNode_145(int val, TreeNode_145 left, TreeNode_145 right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
+
+class Solution_145 {
+
+ public List postorderTraversal(TreeNode_145 root) {
+ List list = new ArrayList<>();
+ if (root == null) {
+ return list;
+ }
+
+ Stack stack = new Stack<>();
+ stack.push(root);
+ while (!stack.isEmpty()) {
+ TreeNode_145 node = stack.pop();
+ list.add(0, node.val);
+ if (node.left != null) {
+ stack.push(node.left);
+ }
+ if (node.right != null) {
+ stack.push(node.right);
+ }
+ }
+
+ return list;
+ }
+
+ public List postorderTraversal1(TreeNode_145 root) {
+ List list = new ArrayList<>();
+ postOrder(root, list);
+
+ return list;
+ }
+
+ public void postOrder(TreeNode_145 node, List list) {
+ if (node == null) {
+ return;
+ }
+ postOrder(node.left, list);
+ postOrder(node.right, list);
+ list.add(node.val);
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P1475FinalPricesWithASpecialDiscountInAShop.java b/src/leetcode/stack/leetcode/editor/en/P1475FinalPricesWithASpecialDiscountInAShop.java
new file mode 100644
index 0000000..af847d1
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P1475FinalPricesWithASpecialDiscountInAShop.java
@@ -0,0 +1,111 @@
+//Given the array prices where prices[i] is the price of the ith item in a shop.
+// There is a special discount for items in the shop, if you buy the ith item,
+//then you will receive a discount equivalent to prices[j] where j is the minimum
+//index such that j > i and prices[j] <= prices[i], otherwise, you will not receive
+//any discount at all.
+//
+// Return an array where the ith element is the final price you will pay for
+//the ith item of the shop considering the special discount.
+//
+//
+// Example 1:
+//
+//
+//Input: prices = [8,4,6,2,3]
+//Output: [4,2,4,2,3]
+//Explanation:
+//For item 0 with price[0]=8 you will receive a discount equivalent to prices[1]
+//=4, therefore, the final price you will pay is 8 - 4 = 4.
+//For item 1 with price[1]=4 you will receive a discount equivalent to prices[3]
+//=2, therefore, the final price you will pay is 4 - 2 = 2.
+//For item 2 with price[2]=6 you will receive a discount equivalent to prices[3]
+//=2, therefore, the final price you will pay is 6 - 2 = 4.
+//For items 3 and 4 you will not receive any discount at all.
+//
+//
+// Example 2:
+//
+//
+//Input: prices = [1,2,3,4,5]
+//Output: [1,2,3,4,5]
+//Explanation: In this case, for all items, you will not receive any discount
+//at all.
+//
+//
+// Example 3:
+//
+//
+//Input: prices = [10,1,1,6]
+//Output: [9,0,1,6]
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= prices.length <= 500
+// 1 <= prices[i] <= 10^3
+//
+// Related Topics Array Stack Monotonic Stack 👍 771 👎 58
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.Arrays;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-22 23:39:10
+ * @title: Final Prices With a Special Discount in a Shop
+ */
+public class P1475FinalPricesWithASpecialDiscountInAShop {
+
+ public static void main(String[] args) {
+ Solution_1475 solution = new Solution_1475();
+ // TO TEST 1
+ int[] arr1 = {8, 4, 6, 2, 3};
+ System.out.println(Arrays.toString(solution.finalPrices(arr1)));
+
+ // Test 2
+ System.out.println(Arrays.toString(solution.finalPrices(new int[] {1, 2, 3, 4, 5})));
+
+ // Test 3
+ System.out.println(Arrays.toString(solution.finalPrices(new int[] {10, 1, 1, 6})));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_1475 {
+ public int[] finalPrices(int[] prices) {
+ for (int i = 0; i < prices.length; i++) {
+ for (int j = i + 1; j < prices.length; j++) {
+ if (prices[j] <= prices[i]) {
+ prices[i] -= prices[j];
+ break;
+ }
+ }
+ }
+
+ return prices;
+ }
+
+ public int[] finalPrices1(int[] prices) {
+ int[] ans = new int[prices.length];
+
+ // 存索引
+ Stack stack = new Stack<>();
+
+ for (int i = 0; i < prices.length; i++) {
+ while (!stack.isEmpty() && prices[stack.peek()] >= prices[i]) {
+ prices[stack.peek()] = prices[stack.peek()] - prices[i];
+ stack.pop();
+ }
+ stack.push(i);
+ }
+
+ return prices;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P150EvaluateReversePolishNotation.java b/src/leetcode/stack/leetcode/editor/en/P150EvaluateReversePolishNotation.java
new file mode 100644
index 0000000..d100107
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P150EvaluateReversePolishNotation.java
@@ -0,0 +1,105 @@
+////Evaluate the value of an arithmetic expression in Reverse Polish Notation.
+////
+//// Valid operators are +, -, *, and /. Each operand may be an integer or
+////another expression.
+////
+//// Note that division between two integers should truncate toward zero.
+////
+//// It is guaranteed that the given RPN expression is always valid. That means
+////the expression would always evaluate to a result, and there will not be any
+////division by zero operation.
+////
+////
+//// Example 1:
+////
+////
+////Input: tokens = ["2","1","+","3","*"]
+////Output: 9
+////Explanation: ((2 + 1) * 3) = 9
+////
+////
+//// Example 2:
+////
+////
+////Input: tokens = ["4","13","5","/","+"]
+////Output: 6
+////Explanation: (4 + (13 / 5)) = 6
+////
+////
+//// Example 3:
+////
+////
+////Input: tokens = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"]
+////Output: 22
+////Explanation: ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
+////= ((10 * (6 / (12 * -11))) + 17) + 5
+////= ((10 * (6 / -132)) + 17) + 5
+////= ((10 * 0) + 17) + 5
+////= (0 + 17) + 5
+////= 17 + 5
+////= 22
+////
+////
+////
+//// Constraints:
+////
+////
+//// 1 <= tokens.length <= 10⁴
+//// tokens[i] is either an operator: "+", "-", "*", or "/", or an integer in the
+////range [-200, 200].
+////
+//// Related Topics Array Math Stack 👍 2329 👎 573
+//
+//
+//package leetcode.stack.leetcode.editor.en;
+//
+//import java.util.Stack;
+//
+///**
+// * @author: eumes
+// * @date: 2021-11-29 23:00:32
+// * @title: Evaluate Reverse Polish Notation
+// */
+//public class P150EvaluateReversePolishNotation {
+//
+// public static void main(String[] args) {
+// Solution_150 solution = new Solution_150();
+// // TO TEST
+// System.out.println(solution.evalRPN(new String[] {"2", "1", "+", "3", "*"}));
+// System.out.println(solution.evalRPN(new String[] {"4", "13", "5", "/", "+"}));
+// System.out.println(solution.evalRPN(new String[] {"10","6","9","3","+","-11","*","/","*","17","+","5","+"}));
+// }
+//
+//}
+//
+////leetcode submit region begin(Prohibit modification and deletion)
+//class Solution_150 {
+//
+// public int evalRPN(String[] tokens) {
+// Stack stack = new Stack<>();
+// for (String token : tokens) {
+// int num, tmp;
+// switch (token) {
+// case "+" -> num = stack.pop() + stack.pop();
+// case "-" -> {
+// tmp = stack.pop();
+// num = stack.pop() - tmp;
+// }
+// case "*" -> {
+// tmp = stack.pop();
+// num = stack.pop() * tmp;
+// }
+// case "/" -> {
+// tmp = stack.pop();
+// num = stack.pop() / tmp;
+// }
+// default -> num = Integer.parseInt(token);
+// }
+// stack.push(num);
+// }
+//
+// return stack.pop();
+// }
+//
+//}
+////leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P1614MaximumNestingDepthOfTheParentheses.java b/src/leetcode/stack/leetcode/editor/en/P1614MaximumNestingDepthOfTheParentheses.java
new file mode 100644
index 0000000..7322613
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P1614MaximumNestingDepthOfTheParentheses.java
@@ -0,0 +1,118 @@
+//A string is a valid parentheses string (denoted VPS) if it meets one of the
+//following:
+//
+//
+// It is an empty string "", or a single character not equal to "(" or ")",
+// It can be written as AB (A concatenated with B), where A and B are VPS's, or
+//
+// It can be written as (A), where A is a VPS.
+//
+//
+// We can similarly define the nesting depth depth(S) of any VPS S as follows:
+//
+//
+// depth("") = 0
+// depth(C) = 0, where C is a string with a single character not equal to "("
+//or ")".
+// depth(A + B) = max(depth(A), depth(B)), where A and B are VPS's.
+// depth("(" + A + ")") = 1 + depth(A), where A is a VPS.
+//
+//
+// For example, "", "()()", and "()(()())" are VPS's (with nesting depths 0, 1,
+//and 2), and ")(" and "(()" are not VPS's.
+//
+// Given a VPS represented as string s, return the nesting depth of s.
+//
+//
+// Example 1:
+//
+//
+//Input: s = "(1+(2*3)+((8)/4))+1"
+//Output: 3
+//Explanation: Digit 8 is inside of 3 nested parentheses in the string.
+//
+//
+// Example 2:
+//
+//
+//Input: s = "(1)+((2))+(((3)))"
+//Output: 3
+//
+//
+// Example 3:
+//
+//
+//Input: s = "1+(2*3)/(2-1)"
+//Output: 1
+//
+//
+// Example 4:
+//
+//
+//Input: s = "1"
+//Output: 0
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= s.length <= 100
+// s consists of digits 0-9 and characters '+', '-', '*', '/', '(', and ')'.
+// It is guaranteed that parentheses expression s is a VPS.
+//
+// Related Topics String Stack 👍 604 👎 140
+
+
+package leetcode.stack.leetcode.editor.en;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-23 00:07:26
+ * @title: Maximum Nesting Depth of the Parentheses
+ */
+public class P1614MaximumNestingDepthOfTheParentheses {
+
+ public static void main(String[] args) {
+ Solution_1614 solution = new Solution_1614();
+ // TO TEST 1
+ String s = "(1+(2*3)+((8)/4))+1";
+ System.out.println(solution.maxDepth(s));
+
+ // Test 2
+ s = "(1)+((2))+(((3)))";
+ System.out.println(solution.maxDepth(s));
+
+ // Test 3
+ s = "1+(2*3)/(2-1)";
+ System.out.println(solution.maxDepth(s));
+
+ // Test 4
+ s = "1";
+ System.out.println(solution.maxDepth(s));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_1614 {
+ public int maxDepth(String s) {
+ int temp = 0;
+ int max = 0;
+
+ char[] chars = s.toCharArray();
+
+ for (int i = 0; i < s.length(); i++) {
+ if (s.charAt(i) == '(') {
+ temp++;
+ } else if (s.charAt(i) == ')') {
+ max = Math.max(max, temp);
+ temp--;
+ }
+ }
+
+ return max;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P1700NumberOfStudentsUnableToEatLunch.java b/src/leetcode/stack/leetcode/editor/en/P1700NumberOfStudentsUnableToEatLunch.java
new file mode 100644
index 0000000..80b9f76
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P1700NumberOfStudentsUnableToEatLunch.java
@@ -0,0 +1,107 @@
+//The school cafeteria offers circular and square sandwiches at lunch break,
+//referred to by numbers 0 and 1 respectively. All students stand in a queue. Each
+//student either prefers square or circular sandwiches.
+//
+// The number of sandwiches in the cafeteria is equal to the number of students.
+// The sandwiches are placed in a stack. At each step:
+//
+//
+// If the student at the front of the queue prefers the sandwich on the top of
+//the stack, they will take it and leave the queue.
+// Otherwise, they will leave it and go to the queue's end.
+//
+//
+// This continues until none of the queue students want to take the top
+//sandwich and are thus unable to eat.
+//
+// You are given two integer arrays students and sandwiches where sandwiches[i]
+//is the type of the ith sandwich in the stack (i = 0 is the top of the stack)
+//and students[j] is the preference of the jth student in the initial queue (j = 0
+//is the front of the queue). Return the number of students that are unable to eat.
+//
+//
+//
+// Example 1:
+//
+//
+//Input: students = [1,1,0,0], sandwiches = [0,1,0,1]
+//Output: 0
+//Explanation:
+//- Front student leaves the top sandwich and returns to the end of the line
+//making students = [1,0,0,1].
+//- Front student leaves the top sandwich and returns to the end of the line
+//making students = [0,0,1,1].
+//- Front student takes the top sandwich and leaves the line making students = [
+//0,1,1] and sandwiches = [1,0,1].
+//- Front student leaves the top sandwich and returns to the end of the line
+//making students = [1,1,0].
+//- Front student takes the top sandwich and leaves the line making students = [
+//1,0] and sandwiches = [0,1].
+//- Front student leaves the top sandwich and returns to the end of the line
+//making students = [0,1].
+//- Front student takes the top sandwich and leaves the line making students = [
+//1] and sandwiches = [1].
+//- Front student takes the top sandwich and leaves the line making students = [
+//] and sandwiches = [].
+//Hence all students are able to eat.
+//
+//
+// Example 2:
+//
+//
+//Input: students = [1,1,1,0,0,1], sandwiches = [1,0,0,0,1,1]
+//Output: 3
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= students.length, sandwiches.length <= 100
+// students.length == sandwiches.length
+// sandwiches[i] is 0 or 1.
+// students[i] is 0 or 1.
+//
+// Related Topics Array Stack Queue Simulation 👍 560 👎 34
+
+
+package leetcode.stack.leetcode.editor.en;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-23 23:25:16
+ * @title: Number of Students Unable to Eat Lunch
+ */
+public class P1700NumberOfStudentsUnableToEatLunch {
+
+ public static void main(String[] args) {
+ Solution_1700 solution = new Solution_1700();
+ // TO TEST 1
+ System.out.println(solution.countStudents(new int[] {1, 1, 0, 0}, new int[] {0, 1, 0, 1}));
+
+ // Test 2
+ System.out.println(solution.countStudents(new int[] {1, 1, 1, 0, 0, 1}, new int[] {1, 0, 0, 0, 1, 1}));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_1700 {
+ public int countStudents(int[] students, int[] sandwiches) {
+ int[] num = {0, 0};
+ for (int s : students) {
+ num[s]++;
+ }
+
+ for (int sandwich : sandwiches) {
+ if (num[sandwich] == 0) {
+ break;
+ }
+ num[sandwich]--;
+ }
+
+ return num[0] + num[1];
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P173BinarySearchTreeIterator.java b/src/leetcode/stack/leetcode/editor/en/P173BinarySearchTreeIterator.java
new file mode 100644
index 0000000..8f96c8a
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P173BinarySearchTreeIterator.java
@@ -0,0 +1,145 @@
+//Implement the BSTIterator class that represents an iterator over the in-order
+//traversal of a binary search tree (BST):
+//
+//
+// BSTIterator(TreeNode root) Initializes an object of the BSTIterator class.
+//The root of the BST is given as part of the constructor. The pointer should be
+//initialized to a non-existent number smaller than any element in the BST.
+// boolean hasNext() Returns true if there exists a number in the traversal to
+//the right of the pointer, otherwise returns false.
+// int next() Moves the pointer to the right, then returns the number at the
+//pointer.
+//
+//
+// Notice that by initializing the pointer to a non-existent smallest number,
+//the first call to next() will return the smallest element in the BST.
+//
+// You may assume that next() calls will always be valid. That is, there will
+//be at least a next number in the in-order traversal when next() is called.
+//
+//
+// Example 1:
+//
+//
+//Input
+//["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next",
+//"hasNext", "next", "hasNext"]
+//[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]
+//Output
+//[null, 3, 7, true, 9, true, 15, true, 20, false]
+//
+//Explanation
+//BSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);
+//bSTIterator.next(); // return 3
+//bSTIterator.next(); // return 7
+//bSTIterator.hasNext(); // return True
+//bSTIterator.next(); // return 9
+//bSTIterator.hasNext(); // return True
+//bSTIterator.next(); // return 15
+//bSTIterator.hasNext(); // return True
+//bSTIterator.next(); // return 20
+//bSTIterator.hasNext(); // return False
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [1, 10⁵].
+// 0 <= Node.val <= 10⁶
+// At most 10⁵ calls will be made to hasNext, and next.
+//
+//
+//
+// Follow up:
+//
+//
+// Could you implement next() and hasNext() to run in average O(1) time and use
+//O(h) memory, where h is the height of the tree?
+//
+// Related Topics Stack Tree Design Binary Search Tree Binary Tree Iterator 👍 4
+//462 👎 340
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-29 23:15:08
+ * @title: Binary Search Tree Iterator
+ */
+public class P173BinarySearchTreeIterator {
+
+ public static void main(String[] args) {
+ // TO TEST
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+
+class TreeNode_173 {
+ int val;
+ TreeNode_173 left;
+ TreeNode_173 right;
+ TreeNode_173() {}
+ TreeNode_173(int val) { this.val = val; }
+ TreeNode_173(int val, TreeNode_173 left, TreeNode_173 right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
+
+class BSTIterator {
+
+ private Stack stack = new Stack<>();
+
+ public BSTIterator(TreeNode_173 root) {
+ while (root != null) {
+ stack.push(root);
+ root = root.left;
+ }
+ }
+
+ public int next() {
+ TreeNode_173 tmp = stack.pop();
+ int result = tmp.val;
+ tmp = tmp.right;
+ while (tmp != null) {
+ stack.push(tmp);
+ tmp = tmp.left;
+ }
+ return result;
+ }
+
+ public boolean hasNext() {
+ return !stack.isEmpty();
+ }
+}
+
+/**
+ * Your BSTIterator object will be instantiated and called as such:
+ * BSTIterator obj = new BSTIterator(root);
+ * int param_1 = obj.next();
+ * boolean param_2 = obj.hasNext();
+ */
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P234PalindromeLinkedList.java b/src/leetcode/stack/leetcode/editor/en/P234PalindromeLinkedList.java
new file mode 100644
index 0000000..4889460
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P234PalindromeLinkedList.java
@@ -0,0 +1,137 @@
+//Given the head of a singly linked list, return true if it is a palindrome.
+//
+//
+// Example 1:
+//
+//
+//Input: head = [1,2,2,1]
+//Output: true
+//
+//
+// Example 2:
+//
+//
+//Input: head = [1,2]
+//Output: false
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the list is in the range [1, 10⁵].
+// 0 <= Node.val <= 9
+//
+//
+//
+//Follow up: Could you do it in O(n) time and O(1) space? Related Topics Linked
+//List Two Pointers Stack Recursion 👍 6975 👎 486
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-19 23:18:57
+ * @title: Palindrome Linked List
+ */
+public class P234PalindromeLinkedList {
+
+ public static void main(String[] args) {
+ Solution_234 solution = new Solution_234();
+ // TO TEST 1
+ ListNode_234 node1 = new ListNode_234(1);
+ ListNode_234 node2 = new ListNode_234(2, node1);
+ ListNode_234 node3 = new ListNode_234(2, node2);
+ ListNode_234 head = new ListNode_234(1, node3);
+ System.out.println(solution.isPalindrome(head));
+
+ // Test 2
+ node1 = new ListNode_234(2);
+ head = new ListNode_234(1, node1);
+ System.out.println(solution.isPalindrome(head));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode() {}
+ * ListNode(int val) { this.val = val; }
+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+
+class ListNode_234 {
+ int val;
+ ListNode_234 next;
+ ListNode_234() {}
+
+ ListNode_234(int val) {
+ this.val = val;
+ }
+
+ ListNode_234(int val, ListNode_234 next) {
+ this.val = val;
+ this.next = next;
+ }
+}
+
+class Solution_234 {
+
+ public boolean isPalindrome(ListNode_234 head) {
+ ListNode_234 fast = head;
+ ListNode_234 slow = head;
+ ListNode_234 pre = null;
+ ListNode_234 temp;
+
+ // 快慢指针，找到中间位置，同时将前一半反转
+ while (fast != null && fast.next != null) {
+ fast = fast.next.next;
+ temp = slow.next;
+ slow.next = pre;
+ pre = slow;
+ slow = temp;
+ }
+
+ // 处理奇数情况
+ if (fast != null) {
+ slow = slow.next;
+ }
+
+ // pre起始前一半反转，slow起始后一半
+ while (pre != null && slow != null) {
+ if (pre.val != slow.val) {
+ return false;
+ }
+ pre = pre.next;
+ slow = slow.next;
+ }
+
+ return true;
+ }
+
+ public boolean isPalindrome1(ListNode_234 head) {
+ Deque deque = new ArrayDeque<>();
+ while (head != null) {
+ deque.push(head.val);
+ head = head.next;
+ }
+
+ while (deque.size() > 1) {
+ if (!deque.pollFirst().equals(deque.pollLast())) {
+ return false;
+ }
+ }
+
+ return true;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P2AddTwoNumbers.java b/src/leetcode/stack/leetcode/editor/en/P2AddTwoNumbers.java
new file mode 100644
index 0000000..9e0c423
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P2AddTwoNumbers.java
@@ -0,0 +1,103 @@
+//You are given two non-empty linked lists representing two non-negative integer
+//s. The digits are stored in reverse order, and each of their nodes contains a si
+//ngle digit. Add the two numbers and return the sum as a linked list.
+//
+// You may assume the two numbers do not contain any leading zero, except the nu
+//mber 0 itself.
+//
+//
+// Example 1:
+//
+//
+//Input: l1 = [2,4,3], l2 = [5,6,4]
+//Output: [7,0,8]
+//Explanation: 342 + 465 = 807.
+//
+//
+// Example 2:
+//
+//
+//Input: l1 = [0], l2 = [0]
+//Output: [0]
+//
+//
+// Example 3:
+//
+//
+//Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
+//Output: [8,9,9,9,0,0,0,1]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in each linked list is in the range [1, 100].
+// 0 <= Node.val <= 9
+// It is guaranteed that the list represents a number that does not have leading
+// zeros.
+//
+// Related Topics Linked List Math Recursion
+// 👍 12252 👎 2849
+
+
+package leetcode.stack.leetcode.editor.en;
+
+
+/**
+ * @author: eumes
+ * @date: 2021-06-17 20:26:07
+ * @title: Add Two Numbers
+ */
+public class P2AddTwoNumbers {
+
+ public static void main(String[] args) {
+ Solution_2 solution2 = new Solution_2();
+ // TO TEST
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ * int val;
+ * ListNode next;
+ * ListNode() {}
+ * ListNode(int val) { this.val = val; }
+ * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class ListNode_2 {
+ int val;
+ ListNode_2 next;
+ ListNode_2() {}
+ ListNode_2(int val) { this.val = val; }
+ ListNode_2(int val, ListNode_2 next) { this.val = val; this.next = next; }
+}
+
+class Solution_2 {
+ public ListNode_2 addTwoNumbers(ListNode_2 l1, ListNode_2 l2) {
+ ListNode_2 result = new ListNode_2();
+ ListNode_2 current = result;
+ int carry = 0;
+ int sum = 0;
+ while (l1 != null || l2 != null || carry != 0) {
+ int left = l1 != null ? l1.val : 0;
+ int right = l2 != null ? l2.val : 0;
+ sum = left + right + carry;
+ ListNode_2 sumNode = new ListNode_2(sum % 10);
+ current.next = sumNode;
+ current = sumNode;
+
+ carry = sum / 10;
+ l1 = l1 != null ? l1.next : null;
+ l2 = l2 != null ? l2.next : null;
+ }
+
+ return result.next;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P316RemoveDuplicateLetters.java b/src/leetcode/stack/leetcode/editor/en/P316RemoveDuplicateLetters.java
new file mode 100644
index 0000000..6295a83
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P316RemoveDuplicateLetters.java
@@ -0,0 +1,82 @@
+//Given a string s, remove duplicate letters so that every letter appears once
+//and only once. You must make sure your result is the smallest in lexicographical
+//order among all possible results.
+//
+//
+// Example 1:
+//
+//
+//Input: s = "bcabc"
+//Output: "abc"
+//
+//
+// Example 2:
+//
+//
+//Input: s = "cbacdcbc"
+//Output: "acdb"
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= s.length <= 10⁴
+// s consists of lowercase English letters.
+//
+//
+//
+// Note: This question is the same as 1081: https://leetcode.com/problems/
+//smallest-subsequence-of-distinct-characters/
+// Related Topics String Stack Greedy Monotonic Stack 👍 3506 👎 247
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.HashMap;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-12-02 23:21:58
+ * @title: Remove Duplicate Letters
+ */
+public class P316RemoveDuplicateLetters {
+
+ public static void main(String[] args) {
+ Solution solution = new Solution();
+ // TO TEST
+ System.out.println(solution.removeDuplicateLetters("bcabc"));
+ System.out.println(solution.removeDuplicateLetters("cbacdcbc"));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+ public String removeDuplicateLetters(String s) {
+ HashMap freq = new HashMap<>(26);
+ Stack stack = new Stack<>();
+
+ for (char ch : s.toCharArray()) {
+ freq.put(ch, freq.getOrDefault(ch, 0) + 1);
+ }
+
+ for (char ch : s.toCharArray()) {
+ freq.put(ch, freq.get(ch) - 1);
+ if (stack.contains(ch)) {
+ continue;
+ }
+
+ while (!stack.isEmpty() && freq.get(stack.peek()) > 0 && stack.peek() > ch) {
+ stack.pop();
+ }
+ stack.push(ch);
+ }
+
+ StringBuilder builder = new StringBuilder();
+ stack.forEach(builder::append);
+ return builder.toString();
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P3LongestSubstringWithoutRepeatingCharactersEn.java b/src/leetcode/stack/leetcode/editor/en/P3LongestSubstringWithoutRepeatingCharactersEn.java
new file mode 100644
index 0000000..c9197e1
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P3LongestSubstringWithoutRepeatingCharactersEn.java
@@ -0,0 +1,116 @@
+//Given a string s, find the length of the longest substring without repeating c
+//haracters.
+//
+//
+// Example 1:
+//
+//
+//Input: s = "abcabcbb"
+//Output: 3
+//Explanation: The answer is "abc", with the length of 3.
+//
+//
+// Example 2:
+//
+//
+//Input: s = "bbbbb"
+//Output: 1
+//Explanation: The answer is "b", with the length of 1.
+//
+//
+// Example 3:
+//
+//
+//Input: s = "pwwkew"
+//Output: 3
+//Explanation: The answer is "wke", with the length of 3.
+//Notice that the answer must be a substring, "pwke" is a subsequence and not a
+//substring.
+//
+//
+// Example 4:
+//
+//
+//Input: s = ""
+//Output: 0
+//
+//
+//
+// Constraints:
+//
+//
+// 0 <= s.length <= 5 * 104
+// s consists of English letters, digits, symbols and spaces.
+//
+// Related Topics Hash Table String Sliding Window
+// 👍 15372 👎 772
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * @author: eumes
+ * @date: 2021-06-30 20:51:47
+ * @title: Longest Substring Without Repeating Characters
+ */
+public class P3LongestSubstringWithoutRepeatingCharactersEn {
+
+ public static void main(String[] args) {
+ Solution_3 solution = new Solution_3();
+ // TO TEST
+ String s1 = "abcabcbb";
+ String s2 = "bbbbb";
+ String s3 = "pwwkew";
+ String s4 = "";
+
+ System.out.println(solution.lengthOfLongestSubstring2(s1) == 3);
+ //System.out.println(solution.lengthOfLongestSubstring(s2) == 1);
+ //System.out.println(solution.lengthOfLongestSubstring(s3) == 3);
+ //System.out.println(solution.lengthOfLongestSubstring(s4) == 0);
+
+ System.out.println(solution.lengthOfLongestSubstring("abba"));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_3 {
+ public int lengthOfLongestSubstring(String s) {
+ if (s == null || s.length() == 0) {
+ return 0;
+ }
+
+ int len = 0;
+ Map map = new HashMap<>();
+ for (int i = 0, j = 0; j < s.length(); j++) {
+ if (map.containsKey(s.charAt(j))) {
+ i = Math.max(map.get(s.charAt(j)) + 1, i);
+ }
+ map.put(s.charAt(j), j);
+ len = Math.max(len, j - i + 1);
+ }
+ return len;
+ }
+
+ public int lengthOfLongestSubstring2(String s) {
+ if (s == null || s.length() == 0) {
+ return 0;
+ }
+
+ int len = 0;
+ int[] arr = new int[128];
+ for (int i = 0, j = 0; j < s.length(); j++) {
+ if (arr[s.charAt(j)] > 0) {
+ i = Math.max(i, arr[s.charAt(j)] + 1);
+ }
+ arr[s.charAt(j)] = j + 1;
+ len = Math.max(len, j - i + 1);
+ }
+ return len;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P4MedianOfTwoSortedArrays.java b/src/leetcode/stack/leetcode/editor/en/P4MedianOfTwoSortedArrays.java
new file mode 100644
index 0000000..89ba227
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P4MedianOfTwoSortedArrays.java
@@ -0,0 +1,119 @@
+//Given two sorted arrays nums1 and nums2 of size m and n respectively, return t
+//he median of the two sorted arrays.
+//
+// The overall run time complexity should be O(log (m+n)).
+//
+//
+// Example 1:
+//
+//
+//Input: nums1 = [1,3], nums2 = [2]
+//Output: 2.00000
+//Explanation: merged array = [1,2,3] and median is 2.
+//
+//
+// Example 2:
+//
+//
+//Input: nums1 = [1,2], nums2 = [3,4]
+//Output: 2.50000
+//Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
+//
+//
+// Example 3:
+//
+//
+//Input: nums1 = [0,0], nums2 = [0,0]
+//Output: 0.00000
+//
+//
+// Example 4:
+//
+//
+//Input: nums1 = [], nums2 = [1]
+//Output: 1.00000
+//
+//
+// Example 5:
+//
+//
+//Input: nums1 = [2], nums2 = []
+//Output: 2.00000
+//
+//
+//
+// Constraints:
+//
+//
+// nums1.length == m
+// nums2.length == n
+// 0 <= m <= 1000
+// 0 <= n <= 1000
+// 1 <= m + n <= 2000
+// -106 <= nums1[i], nums2[i] <= 106
+//
+// Related Topics Array Binary Search Divide and Conquer
+// 👍 11038 👎 1596
+
+
+package leetcode.stack.leetcode.editor.en;
+
+/**
+ * @author: eumes
+ * @date: 2021-07-07 20:38:55
+ * @title: Median of Two Sorted Arrays
+ */
+public class P4MedianOfTwoSortedArrays {
+
+ public static void main(String[] args) {
+ Solution_4 solution = new Solution_4();
+ // TO TEST
+
+ int[] num1 = {1, 3};
+ int[] num2 = {2};
+ System.out.println(solution.findMedianSortedArrays(num1, num2) == 2.0);
+
+ num1 = new int[] {1, 2};
+ num2 = new int[] {3, 4};
+ System.out.println(solution.findMedianSortedArrays(num1, num2) == 2.5);
+
+ num1 = new int[] {0, 0};
+ num2 = new int[] {0, 0};
+ System.out.println(solution.findMedianSortedArrays(num1, num2) == 0.0);
+
+ num1 = new int[] {};
+ num2 = new int[] {1};
+ System.out.println(solution.findMedianSortedArrays(num1, num2) == 1.0);
+ System.out.println(solution.findMedianSortedArrays(num2, num1) == 1.0);
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_4 {
+ public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+ if (nums1.length == 0 && nums2.length == 0) {
+ return 0.0;
+ }
+
+ int len = nums1.length + nums2.length;
+ boolean isEven = len % 2 == 0;
+ int mid = len / 2;
+ int left = 0;
+ int right = 0;
+
+ while (left < nums1.length || right < nums2.length) {
+ if (nums1[left] < nums2[right]) {
+ left++;
+ } else {
+ right++;
+ }
+ if (left == mid) {
+ break;
+ }
+ }
+
+ return 0.0;
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P589NAryTreePreorderTraversal.java b/src/leetcode/stack/leetcode/editor/en/P589NAryTreePreorderTraversal.java
new file mode 100644
index 0000000..8098c1c
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P589NAryTreePreorderTraversal.java
@@ -0,0 +1,186 @@
+//Given the root of an n-ary tree, return the preorder traversal of its nodes'
+//values.
+//
+// Nary-Tree input serialization is represented in their level order traversal.
+//Each group of children is separated by the null value (See examples)
+//
+//
+// Example 1:
+//
+//
+//
+//
+//Input: root = [1,null,3,2,4,null,5,6]
+//Output: [1,3,5,6,2,4]
+//
+//
+// Example 2:
+//
+//
+//
+//
+//Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,
+//null,12,null,13,null,null,14]
+//Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [0, 10⁴].
+// 0 <= Node.val <= 10⁴
+// The height of the n-ary tree is less than or equal to 1000.
+//
+//
+//
+// Follow up: Recursive solution is trivial, could you do it iteratively?
+// Related Topics Stack Tree Depth-First Search 👍 1402 👎 72
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-21 21:36:45
+ * @title: N-ary Tree Preorder Traversal
+ */
+public class P589NAryTreePreorderTraversal {
+
+ public static void main(String[] args) {
+ Solution_589 solution = new Solution_589();
+ // TO TEST 1
+ Node_589 n5 = new Node_589(5);
+ Node_589 n6 = new Node_589(6);
+ List c3 = new ArrayList<>();
+ c3.add(n5);
+ c3.add(n6);
+ Node_589 n3 = new Node_589(3, c3);
+ Node_589 n2 = new Node_589(2);
+ Node_589 n4 = new Node_589(4);
+ List c1 = new ArrayList<>();
+ c1.add(n3);
+ c1.add(n2);
+ c1.add(n4);
+ Node_589 root = new Node_589(1, c1);
+
+ System.out.println(solution.preorder(root));
+
+ // Test 2
+ n2 = new Node_589(2);
+ n6 = new Node_589(6);
+ Node_589 n14 = new Node_589(14);
+ Node_589 n12 = new Node_589(12);
+ Node_589 n13 = new Node_589(13);
+ Node_589 n10 = new Node_589(10);
+
+ List c11 = new ArrayList<>();
+ c11.add(n14);
+ Node_589 n11 = new Node_589(11, c11);
+ List c7 = new ArrayList<>();
+ c7.add(n11);
+ Node_589 n7 = new Node_589(7, c7);
+ c3.clear();
+ c3.add(n6);
+ c3.add(n7);
+ n3 = new Node_589(3, c3);
+
+ List c8 = new ArrayList<>();
+ c8.add(n12);
+ Node_589 n8 = new Node_589(8, c8);
+ List c4 = new ArrayList<>();
+ c4.add(n8);
+ n4 = new Node_589(4, c8);
+
+ List c9 = new ArrayList<>();
+ c9.add(n13);
+ Node_589 n9 = new Node_589(9, c9);
+ List c5 = new ArrayList<>();
+ c5.add(n9);
+ c5.add(n10);
+ n5 = new Node_589(5, c5);
+
+ c1.clear();
+ c1.add(n2);
+ c1.add(n3);
+ c1.add(n4);
+ c1.add(n5);
+ root = new Node_589(1, c1);
+
+ System.out.println(solution.preorder(root));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/*
+// Definition for a Node.
+ */
+class Node_589 {
+ public int val;
+ public List children;
+
+ public Node_589() {}
+
+ public Node_589(int _val) {
+ val = _val;
+ }
+
+ public Node_589(int _val, List _children) {
+ val = _val;
+ children = _children;
+ }
+};
+
+
+class Solution_589 {
+
+ public List preorder(Node_589 root) {
+ List list = new ArrayList<>();
+ if (root == null) {
+ return list;
+ }
+
+ Stack stack = new Stack<>();
+ stack.push(root);
+ while (!stack.isEmpty()) {
+ Node_589 node = stack.pop();
+ list.add(node.val);
+
+ if (node.children != null && node.children.size() > 0) {
+ for (int i = node.children.size() - 1; i >= 0; i--) {
+ stack.push(node.children.get(i));
+ }
+ }
+ }
+
+ return list;
+ }
+
+ public List preorder1(Node_589 root) {
+ List list = new ArrayList<>();
+
+ if (root != null) {
+ preOrder(list, root);
+ }
+
+ return list;
+ }
+
+ public void preOrder(List list, Node_589 node) {
+ if (node == null) {
+ return;
+ }
+ list.add(node.val);
+
+ if (node.children != null && node.children.size() > 0) {
+ node.children.forEach(n -> preOrder(list, n));
+ }
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P590NAryTreePostorderTraversal.java b/src/leetcode/stack/leetcode/editor/en/P590NAryTreePostorderTraversal.java
new file mode 100644
index 0000000..e854469
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P590NAryTreePostorderTraversal.java
@@ -0,0 +1,181 @@
+//Given the root of an n-ary tree, return the postorder traversal of its nodes'
+//values.
+//
+// Nary-Tree input serialization is represented in their level order traversal.
+//Each group of children is separated by the null value (See examples)
+//
+//
+// Example 1:
+//
+//
+//Input: root = [1,null,3,2,4,null,5,6]
+//Output: [5,6,3,2,4,1]
+//
+//
+// Example 2:
+//
+//
+//Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,
+//null,12,null,13,null,null,14]
+//Output: [2,6,14,11,7,3,12,8,4,13,9,10,5,1]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the tree is in the range [0, 10⁴].
+// 0 <= Node.val <= 10⁴
+// The height of the n-ary tree is less than or equal to 1000.
+//
+//
+//
+// Follow up: Recursive solution is trivial, could you do it iteratively?
+// Related Topics Stack Tree Depth-First Search 👍 1330 👎 76
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-21 22:20:08
+ * @title: N-ary Tree Postorder Traversal
+ */
+public class P590NAryTreePostorderTraversal {
+
+ public static void main(String[] args) {
+ Solution_590 solution = new Solution_590();
+ // TO TEST 1
+ Node_590 n5 = new Node_590(5);
+ Node_590 n6 = new Node_590(6);
+ List c3 = new ArrayList<>();
+ c3.add(n5);
+ c3.add(n6);
+ Node_590 n3 = new Node_590(3, c3);
+ Node_590 n2 = new Node_590(2);
+ Node_590 n4 = new Node_590(4);
+ List c1 = new ArrayList<>();
+ c1.add(n3);
+ c1.add(n2);
+ c1.add(n4);
+ Node_590 root = new Node_590(1, c1);
+
+ System.out.println(solution.postorder(root));
+
+ // Test 2
+ n2 = new Node_590(2);
+ n6 = new Node_590(6);
+ Node_590 n14 = new Node_590(14);
+ Node_590 n12 = new Node_590(12);
+ Node_590 n13 = new Node_590(13);
+ Node_590 n10 = new Node_590(10);
+
+ List c11 = new ArrayList<>();
+ c11.add(n14);
+ Node_590 n11 = new Node_590(11, c11);
+ List c7 = new ArrayList<>();
+ c7.add(n11);
+ Node_590 n7 = new Node_590(7, c7);
+ c3.clear();
+ c3.add(n6);
+ c3.add(n7);
+ n3 = new Node_590(3, c3);
+
+ List c8 = new ArrayList<>();
+ c8.add(n12);
+ Node_590 n8 = new Node_590(8, c8);
+ List c4 = new ArrayList<>();
+ c4.add(n8);
+ n4 = new Node_590(4, c8);
+
+ List c9 = new ArrayList<>();
+ c9.add(n13);
+ Node_590 n9 = new Node_590(9, c9);
+ List c5 = new ArrayList<>();
+ c5.add(n9);
+ c5.add(n10);
+ n5 = new Node_590(5, c5);
+
+ c1.clear();
+ c1.add(n2);
+ c1.add(n3);
+ c1.add(n4);
+ c1.add(n5);
+ root = new Node_590(1, c1);
+
+ System.out.println(solution.postorder(root));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/*
+// Definition for a Node.
+
+ */
+class Node_590 {
+ public int val;
+ public List children;
+
+ public Node_590() {}
+
+ public Node_590(int _val) {
+ val = _val;
+ }
+
+ public Node_590(int _val, List _children) {
+ val = _val;
+ children = _children;
+ }
+};
+
+class Solution_590 {
+
+ public List postorder(Node_590 root) {
+ List list = new ArrayList<>();
+ if (root == null) {
+ return list;
+ }
+
+ Stack stack = new Stack<>();
+ stack.push(root);
+ while (!stack.isEmpty()) {
+ Node_590 node = stack.pop();
+ list.add(0, node.val);
+ if (node.children != null && node.children.size() > 0) {
+ node.children.forEach(stack::push);
+ }
+ }
+
+ return list;
+ }
+
+ public List postorder1(Node_590 root) {
+ List list = new ArrayList<>();
+
+ if (root != null) {
+ postOrder(list, root.children);
+ list.add(root.val);
+ }
+
+ return list;
+ }
+
+ public void postOrder(List list, List nodes) {
+ if (nodes == null || nodes.size() == 0) {
+ return;
+ }
+
+ nodes.forEach(node -> {
+ postOrder(list, node.children);
+ list.add(node.val);
+ });
+
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P71SimplifyPath.java b/src/leetcode/stack/leetcode/editor/en/P71SimplifyPath.java
new file mode 100644
index 0000000..6668c9c
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P71SimplifyPath.java
@@ -0,0 +1,118 @@
+//Given a string path, which is an absolute path (starting with a slash '/') to
+//a file or directory in a Unix-style file system, convert it to the simplified
+//canonical path.
+//
+// In a Unix-style file system, a period '.' refers to the current directory, a
+//double period '..' refers to the directory up a level, and any multiple
+//consecutive slashes (i.e. '//') are treated as a single slash '/'. For this problem,
+//any other format of periods such as '...' are treated as file/directory names.
+//
+// The canonical path should have the following format:
+//
+//
+// The path starts with a single slash '/'.
+// Any two directories are separated by a single slash '/'.
+// The path does not end with a trailing '/'.
+// The path only contains the directories on the path from the root directory
+//to the target file or directory (i.e., no period '.' or double period '..')
+//
+//
+// Return the simplified canonical path.
+//
+//
+// Example 1:
+//
+//
+//Input: path = "/home/"
+//Output: "/home"
+//Explanation: Note that there is no trailing slash after the last directory
+//name.
+//
+//
+// Example 2:
+//
+//
+//Input: path = "/../"
+//Output: "/"
+//Explanation: Going one level up from the root directory is a no-op, as the
+//root level is the highest level you can go.
+//
+//
+// Example 3:
+//
+//
+//Input: path = "/home//foo/"
+//Output: "/home/foo"
+//Explanation: In the canonical path, multiple consecutive slashes are replaced
+//by a single one.
+//
+//
+// Example 4:
+//
+//
+//Input: path = "/a/./b/../../c/"
+//Output: "/c"
+//
+//
+//
+// Constraints:
+//
+//
+// 1 <= path.length <= 3000
+// path consists of English letters, digits, period '.', slash '/' or '_'.
+// path is a valid absolute Unix path.
+//
+// Related Topics String Stack 👍 979 👎 252
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-23 23:47:52
+ * @title: Simplify Path
+ */
+public class P71SimplifyPath {
+
+ public static void main(String[] args) {
+ Solution_71 solution = new Solution_71();
+ // TO TEST
+ System.out.println(solution.simplifyPath("/home/"));
+ System.out.println(solution.simplifyPath("/../"));
+ System.out.println(solution.simplifyPath("/home//foo/"));
+ System.out.println(solution.simplifyPath("/a/./b/../../c/"));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_71 {
+ public String simplifyPath(String path) {
+ String[] strings = path.split("/");
+ Deque deque = new ArrayDeque<>();
+
+ for (String str : strings) {
+ if ("..".equals(str)) {
+ deque.pollFirst();
+ } else if ("".equals(str) || ".".equals(str)) {
+ continue;
+ } else {
+ deque.push(str);
+ }
+ }
+
+ if (deque.isEmpty()) {
+ return "/";
+ }
+
+ StringBuilder builder = new StringBuilder();
+ while (!deque.isEmpty()) {
+ builder.append("/").append(deque.pollLast());
+ }
+ return builder.toString();
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P856ScoreOfParentheses.java b/src/leetcode/stack/leetcode/editor/en/P856ScoreOfParentheses.java
new file mode 100644
index 0000000..689421d
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P856ScoreOfParentheses.java
@@ -0,0 +1,107 @@
+//Given a balanced parentheses string S, compute the score of the string based o
+//n the following rule:
+//
+//
+// () has score 1
+// AB has score A + B, where A and B are balanced parentheses strings.
+// (A) has score 2 * A, where A is a balanced parentheses string.
+//
+//
+//
+//
+//
+// Example 1:
+//
+//
+//Input: "()"
+//Output: 1
+//
+//
+//
+// Example 2:
+//
+//
+//Input: "(())"
+//Output: 2
+//
+//
+//
+// Example 3:
+//
+//
+//Input: "()()"
+//Output: 2
+//
+//
+//
+// Example 4:
+//
+//
+//Input: "(()(()))"
+//Output: 6
+//
+//
+//
+//
+// Note:
+//
+//
+// S is a balanced parentheses string, containing only ( and ).
+// 2 <= S.length <= 50
+//
+//
+//
+//
+//
+// Related Topics String Stack
+// 👍 1383 👎 47
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2020-10-26 17:27:42
+ * @title: Score of Parentheses
+ */
+public class P856ScoreOfParentheses {
+
+ public static void main(String[] args) {
+ Solution_856 solution = new Solution_856();
+ // TO TEST
+ String s1 = "()";
+ String s2 = "(())";
+ String s3 = "()()";
+ String s4 = "(()(()))";
+
+ System.out.println(solution.scoreOfParentheses(s1));
+ System.out.println(solution.scoreOfParentheses(s2));
+ System.out.println(solution.scoreOfParentheses(s3));
+ System.out.println(solution.scoreOfParentheses(s4));
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_856 {
+ public int scoreOfParentheses(String S) {
+ Stack stack = new Stack<>();
+
+ for (Character ch : S.toCharArray()) {
+ if (ch == '(') {
+ stack.push(1);
+ } else if (ch == ')') {
+ int sum = 1;
+ while (stack.peek() != 1) {
+ sum += stack.pop();
+ }
+ stack.pop();
+ stack.push(sum * 2);
+ }
+ }
+ return stack.pop();
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P897IncreasingOrderSearchTree.java b/src/leetcode/stack/leetcode/editor/en/P897IncreasingOrderSearchTree.java
new file mode 100644
index 0000000..53994f7
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P897IncreasingOrderSearchTree.java
@@ -0,0 +1,104 @@
+//Given the root of a binary search tree, rearrange the tree in in-order so
+//that the leftmost node in the tree is now the root of the tree, and every node has
+//no left child and only one right child.
+//
+//
+// Example 1:
+//
+//
+//Input: root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
+//Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
+//
+//
+// Example 2:
+//
+//
+//Input: root = [5,1,7]
+//Output: [1,null,5,null,7]
+//
+//
+//
+// Constraints:
+//
+//
+// The number of nodes in the given tree will be in the range [1, 100].
+// 0 <= Node.val <= 1000
+// Related Topics Stack Tree Depth-First Search Binary Search Tree Binary Tree ?
+//? 1913 👎 571
+
+
+package leetcode.stack.leetcode.editor.en;
+
+/**
+ * @author: eumes
+ * @date: 2021-11-21 22:50:25
+ * @title: Increasing Order Search Tree
+ */
+public class P897IncreasingOrderSearchTree {
+
+ public static void main(String[] args) {
+ Solution_897 solution = new Solution_897();
+ // TO TEST
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ * int val;
+ * TreeNode left;
+ * TreeNode right;
+ * TreeNode() {}
+ * TreeNode(int val) { this.val = val; }
+ * TreeNode(int val, TreeNode left, TreeNode right) {
+ * this.val = val;
+ * this.left = left;
+ * this.right = right;
+ * }
+ * }
+ */
+
+class TreeNode_897 {
+ int val;
+ TreeNode_897 left;
+ TreeNode_897 right;
+
+ TreeNode_897() {}
+ TreeNode_897(int val) {this.val = val;}
+ TreeNode_897(int val, TreeNode_897 left, TreeNode_897 right) {
+ this.val = val;
+ this.left = left;
+ this.right = right;
+ }
+}
+
+class Solution_897 {
+ TreeNode_897 cur;
+
+ public TreeNode_897 increasingBST(TreeNode_897 root) {
+ if (root == null || (root.left == null && root.right == null)) {
+ return root;
+ }
+
+ TreeNode_897 result = new TreeNode_897();
+ cur = result;
+
+ inOrder(root);
+ return result.right;
+ }
+
+ public void inOrder(TreeNode_897 node) {
+ if (node == null) {
+ return;
+ }
+ inOrder(node.left);
+ node.left = null;
+ cur.right = node;
+ cur = node;
+ inOrder(node.right);
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/P946ValidateStackSequences.java b/src/leetcode/stack/leetcode/editor/en/P946ValidateStackSequences.java
new file mode 100644
index 0000000..fe40170
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/P946ValidateStackSequences.java
@@ -0,0 +1,84 @@
+//Given two sequences pushed and popped with distinct values, return true if and
+// only if this could have been the result of a sequence of push and pop operation
+//s on an initially empty stack.
+//
+//
+//
+//
+// Example 1:
+//
+//
+//Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
+//Output: true
+//Explanation: We might do the following sequence:
+//push(1), push(2), push(3), push(4), pop() -> 4,
+//push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1
+//
+//
+//
+// Example 2:
+//
+//
+//Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
+//Output: false
+//Explanation: 1 cannot be popped before 2.
+//
+//
+//
+//
+//
+// Constraints:
+//
+//
+// 0 <= pushed.length == popped.length <= 1000
+// 0 <= pushed[i], popped[i] < 1000
+// pushed is a permutation of popped.
+// pushed and popped have distinct values.
+//
+// Related Topics Stack
+// 👍 1096 👎 32
+
+
+package leetcode.stack.leetcode.editor.en;
+
+import java.util.Stack;
+
+/**
+ * @author: eumes
+ * @date: 2020-10-23 20:52:22
+ * @title: Validate Stack Sequences
+ */
+public class P946ValidateStackSequences {
+
+ public static void main(String[] args) {
+ Solution_946 solution = new Solution_946();
+ // TO TEST
+ int[] pushed = {1, 2, 3, 4, 5};
+ int[] poped = {4, 5, 3, 2, 1};
+ System.out.println(solution.validateStackSequences(pushed, poped));
+
+ poped = new int[] {4, 3, 5, 1, 2};
+ System.out.println(solution.validateStackSequences(pushed, poped));
+
+ }
+
+}
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution_946 {
+ public boolean validateStackSequences(int[] pushed, int[] popped) {
+ Stack stack = new Stack<>();
+ int idx = 0;
+
+ for (int j : pushed) {
+ stack.push(j);
+ while (!stack.isEmpty() && stack.peek() == popped[idx]) {
+ stack.pop();
+ idx++;
+ }
+ }
+
+ return stack.isEmpty();
+ }
+}
+//leetcode submit region end(Prohibit modification and deletion)
diff --git a/src/leetcode/stack/leetcode/editor/en/all.json b/src/leetcode/stack/leetcode/editor/en/all.json
new file mode 100644
index 0000000..b21c0af
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/all.json
@@ -0,0 +1 @@
+[{"articleLive":1,"articleSlug":"two-sum","formTitle":"[1]Two Sum","frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"","title":"Two Sum","titleSlug":"two-sum"},{"articleLive":1,"articleSlug":"add-two-numbers","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":1,"articleSlug":"longest-substring-without-repeating-characters","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":0,"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":1,"articleSlug":"longest-palindromic-substring","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":1,"articleSlug":"zigzag-conversion","formTitle":"[6]ZigZag Conversion","frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"","title":"ZigZag Conversion","titleSlug":"zigzag-conversion"},{"articleLive":1,"articleSlug":"reverse-integer","formTitle":"[7]Reverse Integer","frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"","title":"Reverse Integer","titleSlug":"reverse-integer"},{"articleLive":0,"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":1,"articleSlug":"palindrome-number","formTitle":"[9]Palindrome Number","frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","title":"Palindrome Number","titleSlug":"palindrome-number"},{"articleLive":1,"articleSlug":"regular-expression-matching","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":1,"articleSlug":"container-with-most-water","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":1,"articleSlug":"integer-to-roman","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":1,"articleSlug":"roman-to-integer","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":1,"articleSlug":"longest-common-prefix","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":1,"articleSlug":"3sum","formTitle":"[15]3Sum","frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","title":"3Sum","titleSlug":"3sum"},{"articleLive":1,"articleSlug":"3sum-closest","formTitle":"[16]3Sum Closest","frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","title":"3Sum Closest","titleSlug":"3sum-closest"},{"articleLive":1,"articleSlug":"letter-combinations-of-a-phone-number","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":1,"articleSlug":"4sum","formTitle":"[18]4Sum","frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","title":"4Sum","titleSlug":"4sum"},{"articleLive":1,"articleSlug":"remove-nth-node-from-end-of-list","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":1,"articleSlug":"valid-parentheses","formTitle":"[20]Valid Parentheses","frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"","title":"Valid Parentheses","titleSlug":"valid-parentheses"},{"articleLive":1,"articleSlug":"merge-two-sorted-lists","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":1,"articleSlug":"generate-parentheses","formTitle":"[22]Generate Parentheses","frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","title":"Generate Parentheses","titleSlug":"generate-parentheses"},{"articleLive":1,"articleSlug":"merge-k-sorted-lists","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":1,"articleSlug":"swap-nodes-in-pairs","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":1,"articleSlug":"reverse-nodes-in-k-group","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":1,"articleSlug":"remove-duplicates-from-sorted-array","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":1,"articleSlug":"remove-element","formTitle":"[27]Remove Element","frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"","title":"Remove Element","titleSlug":"remove-element"},{"articleLive":0,"formTitle":"[28]Implement strStr()","frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"","title":"Implement strStr()","titleSlug":"implement-strstr"},{"articleLive":1,"articleSlug":"divide-two-integers","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":0,"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":1,"articleSlug":"next-permutation","formTitle":"[31]Next Permutation","frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","title":"Next Permutation","titleSlug":"next-permutation"},{"articleLive":1,"articleSlug":"longest-valid-parentheses","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":1,"articleSlug":"search-in-rotated-sorted-array","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":1,"articleSlug":"find-first-and-last-position-of-element-in-sorted-array","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":1,"articleSlug":"search-insert-position","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":1,"articleSlug":"valid-sudoku","formTitle":"[36]Valid Sudoku","frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"","title":"Valid Sudoku","titleSlug":"valid-sudoku"},{"articleLive":1,"articleSlug":"sudoku-solver","formTitle":"[37]Sudoku Solver","frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","title":"Sudoku Solver","titleSlug":"sudoku-solver"},{"articleLive":0,"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":1,"articleSlug":"combination-sum","formTitle":"[39]Combination Sum","frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","title":"Combination Sum","titleSlug":"combination-sum"},{"articleLive":1,"articleSlug":"combination-sum-ii","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":1,"articleSlug":"first-missing-positive","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":1,"articleSlug":"trapping-rain-water","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":0,"formTitle":"[43]Multiply Strings","frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"","title":"Multiply Strings","titleSlug":"multiply-strings"},{"articleLive":1,"articleSlug":"wildcard-matching","formTitle":"[44]Wildcard Matching","frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","title":"Wildcard Matching","titleSlug":"wildcard-matching"},{"articleLive":1,"articleSlug":"jump-game-ii","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":1,"articleSlug":"permutations","formTitle":"[46]Permutations","frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","title":"Permutations","titleSlug":"permutations"},{"articleLive":1,"articleSlug":"permutations-ii","formTitle":"[47]Permutations II","frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"","title":"Permutations II","titleSlug":"permutations-ii"},{"articleLive":1,"articleSlug":"rotate-image","formTitle":"[48]Rotate Image","frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","title":"Rotate Image","titleSlug":"rotate-image"},{"articleLive":1,"articleSlug":"group-anagrams","formTitle":"[49]Group Anagrams","frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","title":"Group Anagrams","titleSlug":"group-anagrams"},{"articleLive":1,"articleSlug":"powx-n","formTitle":"[50]Pow(x, n)","frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","title":"Pow(x, n)","titleSlug":"powx-n"},{"articleLive":1,"articleSlug":"n-queens","formTitle":"[51]N-Queens","frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","title":"N-Queens","titleSlug":"n-queens"},{"articleLive":1,"articleSlug":"n-queens-ii","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":1,"articleSlug":"maximum-subarray","formTitle":"[53]Maximum Subarray","frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","title":"Maximum Subarray","titleSlug":"maximum-subarray"},{"articleLive":1,"articleSlug":"spiral-matrix","formTitle":"[54]Spiral Matrix","frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","title":"Spiral Matrix","titleSlug":"spiral-matrix"},{"articleLive":1,"articleSlug":"jump-game","formTitle":"[55]Jump Game","frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","title":"Jump Game","titleSlug":"jump-game"},{"articleLive":1,"articleSlug":"merge-intervals","formTitle":"[56]Merge Intervals","frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","title":"Merge Intervals","titleSlug":"merge-intervals"},{"articleLive":1,"articleSlug":"insert-interval","formTitle":"[57]Insert Interval","frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","title":"Insert Interval","titleSlug":"insert-interval"},{"articleLive":1,"articleSlug":"length-of-last-word","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":1,"articleSlug":"spiral-matrix-ii","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":1,"articleSlug":"permutation-sequence","formTitle":"[60]Permutation Sequence","frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","title":"Permutation Sequence","titleSlug":"permutation-sequence"},{"articleLive":1,"articleSlug":"rotate-list","formTitle":"[61]Rotate List","frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"","title":"Rotate List","titleSlug":"rotate-list"},{"articleLive":1,"articleSlug":"unique-paths","formTitle":"[62]Unique Paths","frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","title":"Unique Paths","titleSlug":"unique-paths"},{"articleLive":1,"articleSlug":"unique-paths-ii","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":1,"articleSlug":"minimum-path-sum","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":1,"articleSlug":"valid-number","formTitle":"[65]Valid Number","frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","title":"Valid Number","titleSlug":"valid-number"},{"articleLive":1,"articleSlug":"plus-one","formTitle":"[66]Plus One","frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"","title":"Plus One","titleSlug":"plus-one"},{"articleLive":1,"articleSlug":"add-binary","formTitle":"[67]Add Binary","frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","title":"Add Binary","titleSlug":"add-binary"},{"articleLive":0,"formTitle":"[68]Text Justification","frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","title":"Text Justification","titleSlug":"text-justification"},{"articleLive":1,"articleSlug":"sqrtx","formTitle":"[69]Sqrt(x)","frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","title":"Sqrt(x)","titleSlug":"sqrtx"},{"articleLive":1,"articleSlug":"climbing-stairs","formTitle":"[70]Climbing Stairs","frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","title":"Climbing Stairs","titleSlug":"climbing-stairs"},{"articleLive":1,"articleSlug":"simplify-path","formTitle":"[71]Simplify Path","frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"","title":"Simplify Path","titleSlug":"simplify-path"},{"articleLive":1,"articleSlug":"edit-distance","formTitle":"[72]Edit Distance","frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","title":"Edit Distance","titleSlug":"edit-distance"},{"articleLive":1,"articleSlug":"set-matrix-zeroes","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":1,"articleSlug":"search-a-2d-matrix","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":1,"articleSlug":"sort-colors","formTitle":"[75]Sort Colors","frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","title":"Sort Colors","titleSlug":"sort-colors"},{"articleLive":1,"articleSlug":"minimum-window-substring","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":1,"articleSlug":"combinations","formTitle":"[77]Combinations","frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","title":"Combinations","titleSlug":"combinations"},{"articleLive":1,"articleSlug":"subsets","formTitle":"[78]Subsets","frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","title":"Subsets","titleSlug":"subsets"},{"articleLive":1,"articleSlug":"word-search","formTitle":"[79]Word Search","frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","title":"Word Search","titleSlug":"word-search"},{"articleLive":1,"articleSlug":"remove-duplicates-from-sorted-array-ii","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":1,"articleSlug":"search-in-rotated-sorted-array-ii","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":1,"articleSlug":"remove-duplicates-from-sorted-list-ii","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":1,"articleSlug":"remove-duplicates-from-sorted-list","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":1,"articleSlug":"largest-rectangle-in-histogram","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":1,"articleSlug":"maximal-rectangle","formTitle":"[85]Maximal Rectangle","frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","title":"Maximal Rectangle","titleSlug":"maximal-rectangle"},{"articleLive":1,"articleSlug":"partition-list","formTitle":"[86]Partition List","frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"","title":"Partition List","titleSlug":"partition-list"},{"articleLive":0,"formTitle":"[87]Scramble String","frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"","title":"Scramble String","titleSlug":"scramble-string"},{"articleLive":1,"articleSlug":"merge-sorted-array","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":1,"articleSlug":"gray-code","formTitle":"[89]Gray Code","frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","title":"Gray Code","titleSlug":"gray-code"},{"articleLive":1,"articleSlug":"subsets-ii","formTitle":"[90]Subsets II","frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","title":"Subsets II","titleSlug":"subsets-ii"},{"articleLive":1,"articleSlug":"decode-ways","formTitle":"[91]Decode Ways","frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"","title":"Decode Ways","titleSlug":"decode-ways"},{"articleLive":1,"articleSlug":"reverse-linked-list-ii","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":1,"articleSlug":"restore-ip-addresses","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":1,"articleSlug":"binary-tree-inorder-traversal","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":1,"articleSlug":"unique-binary-search-trees-ii","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":1,"articleSlug":"unique-binary-search-trees","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":1,"articleSlug":"interleaving-string","formTitle":"[97]Interleaving String","frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","title":"Interleaving String","titleSlug":"interleaving-string"},{"articleLive":1,"articleSlug":"validate-binary-search-tree","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":1,"articleSlug":"recover-binary-search-tree","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":1,"articleSlug":"same-tree","formTitle":"[100]Same Tree","frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","title":"Same Tree","titleSlug":"same-tree"},{"articleLive":1,"articleSlug":"symmetric-tree","formTitle":"[101]Symmetric Tree","frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","title":"Symmetric Tree","titleSlug":"symmetric-tree"},{"articleLive":1,"articleSlug":"binary-tree-level-order-traversal","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":1,"articleSlug":"binary-tree-zigzag-level-order-traversal","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":1,"articleSlug":"maximum-depth-of-binary-tree","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":1,"articleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal","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":1,"articleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal","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":1,"articleSlug":"binary-tree-level-order-traversal-ii","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":1,"articleSlug":"convert-sorted-array-to-binary-search-tree","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":1,"articleSlug":"convert-sorted-list-to-binary-search-tree","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":1,"articleSlug":"balanced-binary-tree","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":1,"articleSlug":"minimum-depth-of-binary-tree","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":1,"articleSlug":"path-sum","formTitle":"[112]Path Sum","frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","title":"Path Sum","titleSlug":"path-sum"},{"articleLive":1,"articleSlug":"path-sum-ii","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":1,"articleSlug":"flatten-binary-tree-to-linked-list","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":1,"articleSlug":"distinct-subsequences","formTitle":"[115]Distinct Subsequences","frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","title":"Distinct Subsequences","titleSlug":"distinct-subsequences"},{"articleLive":1,"articleSlug":"populating-next-right-pointers-in-each-node","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":1,"articleSlug":"populating-next-right-pointers-in-each-node-ii","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":1,"articleSlug":"pascals-triangle","formTitle":"[118]Pascal's Triangle","frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","title":"Pascal's Triangle","titleSlug":"pascals-triangle"},{"articleLive":1,"articleSlug":"pascals-triangle-ii","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":1,"articleSlug":"triangle","formTitle":"[120]Triangle","frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","title":"Triangle","titleSlug":"triangle"},{"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock","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":1,"articleSlug":"best-time-to-buy-and-sell-stock-ii","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":1,"articleSlug":"best-time-to-buy-and-sell-stock-iii","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":1,"articleSlug":"binary-tree-maximum-path-sum","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":1,"articleSlug":"valid-palindrome","formTitle":"[125]Valid Palindrome","frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","title":"Valid Palindrome","titleSlug":"valid-palindrome"},{"articleLive":1,"articleSlug":"word-ladder-ii","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":1,"articleSlug":"word-ladder","formTitle":"[127]Word Ladder","frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","title":"Word Ladder","titleSlug":"word-ladder"},{"articleLive":1,"articleSlug":"longest-consecutive-sequence","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":1,"articleSlug":"sum-root-to-leaf-numbers","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":1,"articleSlug":"surrounded-regions","formTitle":"[130]Surrounded Regions","frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","title":"Surrounded Regions","titleSlug":"surrounded-regions"},{"articleLive":1,"articleSlug":"palindrome-partitioning","formTitle":"[131]Palindrome Partitioning","frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"},{"articleLive":1,"articleSlug":"palindrome-partitioning-ii","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":1,"articleSlug":"clone-graph","formTitle":"[133]Clone Graph","frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","title":"Clone Graph","titleSlug":"clone-graph"},{"articleLive":1,"articleSlug":"gas-station","formTitle":"[134]Gas Station","frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","title":"Gas Station","titleSlug":"gas-station"},{"articleLive":1,"articleSlug":"candy","formTitle":"[135]Candy","frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","title":"Candy","titleSlug":"candy"},{"articleLive":1,"articleSlug":"single-number","formTitle":"[136]Single Number","frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","title":"Single Number","titleSlug":"single-number"},{"articleLive":1,"articleSlug":"single-number-ii","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":1,"articleSlug":"copy-list-with-random-pointer","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":1,"articleSlug":"word-break","formTitle":"[139]Word Break","frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","title":"Word Break","titleSlug":"word-break"},{"articleLive":1,"articleSlug":"word-break-ii","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":1,"articleSlug":"linked-list-cycle","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":1,"articleSlug":"linked-list-cycle-ii","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":1,"articleSlug":"reorder-list","formTitle":"[143]Reorder List","frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"","title":"Reorder List","titleSlug":"reorder-list"},{"articleLive":1,"articleSlug":"binary-tree-preorder-traversal","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":0,"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":1,"articleSlug":"lru-cache","formTitle":"[146]LRU Cache","frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","title":"LRU Cache","titleSlug":"lru-cache"},{"articleLive":1,"articleSlug":"insertion-sort-list","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":1,"articleSlug":"sort-list","formTitle":"[148]Sort List","frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"","title":"Sort List","titleSlug":"sort-list"},{"articleLive":1,"articleSlug":"max-points-on-a-line","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":1,"articleSlug":"evaluate-reverse-polish-notation","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":1,"articleSlug":"reverse-words-in-a-string","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":1,"articleSlug":"maximum-product-subarray","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":1,"articleSlug":"find-minimum-in-rotated-sorted-array","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":1,"articleSlug":"find-minimum-in-rotated-sorted-array-ii","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":1,"articleSlug":"min-stack","formTitle":"[155]Min Stack","frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"","title":"Min Stack","titleSlug":"min-stack"},{"articleLive":0,"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":1,"articleSlug":"read-n-characters-given-read4","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":0,"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":1,"articleSlug":"longest-substring-with-at-most-two-distinct-characters","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":1,"articleSlug":"intersection-of-two-linked-lists","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":1,"articleSlug":"one-edit-distance","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":1,"articleSlug":"find-peak-element","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":1,"articleSlug":"missing-ranges","formTitle":"[163]Missing Ranges","frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","title":"Missing Ranges","titleSlug":"missing-ranges"},{"articleLive":1,"articleSlug":"maximum-gap","formTitle":"[164]Maximum Gap","frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","title":"Maximum Gap","titleSlug":"maximum-gap"},{"articleLive":1,"articleSlug":"compare-version-numbers","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":1,"articleSlug":"fraction-to-recurring-decimal","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":1,"articleSlug":"two-sum-ii-input-array-is-sorted","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":0,"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":1,"articleSlug":"majority-element","formTitle":"[169]Majority Element","frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","title":"Majority Element","titleSlug":"majority-element"},{"articleLive":1,"articleSlug":"two-sum-iii-data-structure-design","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":1,"articleSlug":"excel-sheet-column-number","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":1,"articleSlug":"factorial-trailing-zeroes","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":1,"articleSlug":"binary-search-tree-iterator","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":1,"articleSlug":"dungeon-game","formTitle":"[174]Dungeon Game","frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","title":"Dungeon Game","titleSlug":"dungeon-game"},{"articleLive":1,"articleSlug":"combine-two-tables","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":1,"articleSlug":"second-highest-salary","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":0,"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":0,"formTitle":"[178]Rank Scores","frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","title":"Rank Scores","titleSlug":"rank-scores"},{"articleLive":1,"articleSlug":"largest-number","formTitle":"[179]Largest Number","frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"","title":"Largest Number","titleSlug":"largest-number"},{"articleLive":1,"articleSlug":"consecutive-numbers","formTitle":"[180]Consecutive Numbers","frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","title":"Consecutive Numbers","titleSlug":"consecutive-numbers"},{"articleLive":1,"articleSlug":"employees-earning-more-than-their-managers","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":1,"articleSlug":"duplicate-emails","formTitle":"[182]Duplicate Emails","frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","title":"Duplicate Emails","titleSlug":"duplicate-emails"},{"articleLive":1,"articleSlug":"customers-who-never-order","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":1,"articleSlug":"department-highest-salary","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":1,"articleSlug":"department-top-three-salaries","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":1,"articleSlug":"reverse-words-in-a-string-ii","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":1,"articleSlug":"repeated-dna-sequences","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":1,"articleSlug":"best-time-to-buy-and-sell-stock-iv","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":1,"articleSlug":"rotate-array","formTitle":"[189]Rotate Array","frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","title":"Rotate Array","titleSlug":"rotate-array"},{"articleLive":1,"articleSlug":"reverse-bits","formTitle":"[190]Reverse Bits","frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","title":"Reverse Bits","titleSlug":"reverse-bits"},{"articleLive":1,"articleSlug":"number-of-1-bits","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":0,"formTitle":"[192]Word Frequency","frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","title":"Word Frequency","titleSlug":"word-frequency"},{"articleLive":0,"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":0,"formTitle":"[194]Transpose File","frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","title":"Transpose File","titleSlug":"transpose-file"},{"articleLive":0,"formTitle":"[195]Tenth Line","frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","title":"Tenth Line","titleSlug":"tenth-line"},{"articleLive":1,"articleSlug":"delete-duplicate-emails","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":1,"articleSlug":"rising-temperature","formTitle":"[197]Rising Temperature","frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","title":"Rising Temperature","titleSlug":"rising-temperature"},{"articleLive":1,"articleSlug":"house-robber","formTitle":"[198]House Robber","frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","title":"House Robber","titleSlug":"house-robber"},{"articleLive":1,"articleSlug":"binary-tree-right-side-view","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":1,"articleSlug":"number-of-islands","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":1,"articleSlug":"bitwise-and-of-numbers-range","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":1,"articleSlug":"happy-number","formTitle":"[202]Happy Number","frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"","title":"Happy Number","titleSlug":"happy-number"},{"articleLive":1,"articleSlug":"remove-linked-list-elements","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":1,"articleSlug":"count-primes","formTitle":"[204]Count Primes","frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","title":"Count Primes","titleSlug":"count-primes"},{"articleLive":1,"articleSlug":"isomorphic-strings","formTitle":"[205]Isomorphic Strings","frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","title":"Isomorphic Strings","titleSlug":"isomorphic-strings"},{"articleLive":1,"articleSlug":"reverse-linked-list","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":1,"articleSlug":"course-schedule","formTitle":"[207]Course Schedule","frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","title":"Course Schedule","titleSlug":"course-schedule"},{"articleLive":1,"articleSlug":"implement-trie-prefix-tree","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":1,"articleSlug":"minimum-size-subarray-sum","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":1,"articleSlug":"course-schedule-ii","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":1,"articleSlug":"design-add-and-search-words-data-structure","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":1,"articleSlug":"word-search-ii","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":1,"articleSlug":"house-robber-ii","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":1,"articleSlug":"shortest-palindrome","formTitle":"[214]Shortest Palindrome","frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","title":"Shortest Palindrome","titleSlug":"shortest-palindrome"},{"articleLive":1,"articleSlug":"kth-largest-element-in-an-array","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":1,"articleSlug":"combination-sum-iii","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":1,"articleSlug":"contains-duplicate","formTitle":"[217]Contains Duplicate","frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","title":"Contains Duplicate","titleSlug":"contains-duplicate"},{"articleLive":1,"articleSlug":"the-skyline-problem","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":1,"articleSlug":"contains-duplicate-ii","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":1,"articleSlug":"contains-duplicate-iii","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":1,"articleSlug":"maximal-square","formTitle":"[221]Maximal Square","frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","title":"Maximal Square","titleSlug":"maximal-square"},{"articleLive":1,"articleSlug":"count-complete-tree-nodes","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":0,"formTitle":"[223]Rectangle Area","frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","title":"Rectangle Area","titleSlug":"rectangle-area"},{"articleLive":1,"articleSlug":"basic-calculator","formTitle":"[224]Basic Calculator","frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","title":"Basic Calculator","titleSlug":"basic-calculator"},{"articleLive":1,"articleSlug":"implement-stack-using-queues","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":1,"articleSlug":"invert-binary-tree","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":1,"articleSlug":"basic-calculator-ii","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":1,"articleSlug":"summary-ranges","formTitle":"[228]Summary Ranges","frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","title":"Summary Ranges","titleSlug":"summary-ranges"},{"articleLive":1,"articleSlug":"majority-element-ii","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":1,"articleSlug":"kth-smallest-element-in-a-bst","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":1,"articleSlug":"power-of-two","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":1,"articleSlug":"implement-queue-using-stacks","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":1,"articleSlug":"number-of-digit-one","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":1,"articleSlug":"palindrome-linked-list","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":1,"articleSlug":"lowest-common-ancestor-of-a-binary-search-tree","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":1,"articleSlug":"lowest-common-ancestor-of-a-binary-tree","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":0,"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":1,"articleSlug":"product-of-array-except-self","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":1,"articleSlug":"sliding-window-maximum","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":1,"articleSlug":"search-a-2d-matrix-ii","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":0,"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":1,"articleSlug":"valid-anagram","formTitle":"[242]Valid Anagram","frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","title":"Valid Anagram","titleSlug":"valid-anagram"},{"articleLive":1,"articleSlug":"shortest-word-distance","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":1,"articleSlug":"shortest-word-distance-ii","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":0,"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":1,"articleSlug":"strobogrammatic-number","formTitle":"[246]Strobogrammatic Number","frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"count-univalue-subtrees","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":1,"articleSlug":"flatten-2d-vector","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":1,"articleSlug":"meeting-rooms","formTitle":"[252]Meeting Rooms","frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","title":"Meeting Rooms","titleSlug":"meeting-rooms"},{"articleLive":1,"articleSlug":"meeting-rooms-ii","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":0,"formTitle":"[254]Factor Combinations","frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","title":"Factor Combinations","titleSlug":"factor-combinations"},{"articleLive":0,"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":1,"articleSlug":"paint-house","formTitle":"[256]Paint House","frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","title":"Paint House","titleSlug":"paint-house"},{"articleLive":1,"articleSlug":"binary-tree-paths","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":1,"articleSlug":"add-digits","formTitle":"[258]Add Digits","frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","title":"Add Digits","titleSlug":"add-digits"},{"articleLive":1,"articleSlug":"3sum-smaller","formTitle":"[259]3Sum Smaller","frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","title":"3Sum Smaller","titleSlug":"3sum-smaller"},{"articleLive":1,"articleSlug":"single-number-iii","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":1,"articleSlug":"graph-valid-tree","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":0,"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":0,"formTitle":"[263]Ugly Number","frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"","title":"Ugly Number","titleSlug":"ugly-number"},{"articleLive":0,"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":1,"articleSlug":"paint-house-ii","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":1,"articleSlug":"palindrome-permutation","formTitle":"[266]Palindrome Permutation","frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","title":"Palindrome Permutation","titleSlug":"palindrome-permutation"},{"articleLive":1,"articleSlug":"palindrome-permutation-ii","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":1,"articleSlug":"missing-number","formTitle":"[268]Missing Number","frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","title":"Missing Number","titleSlug":"missing-number"},{"articleLive":1,"articleSlug":"alien-dictionary","formTitle":"[269]Alien Dictionary","frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","title":"Alien Dictionary","titleSlug":"alien-dictionary"},{"articleLive":1,"articleSlug":"closest-binary-search-tree-value","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":1,"articleSlug":"encode-and-decode-strings","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":1,"articleSlug":"closest-binary-search-tree-value-ii","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":1,"articleSlug":"integer-to-english-words","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":1,"articleSlug":"h-index","formTitle":"[274]H-Index","frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","title":"H-Index","titleSlug":"h-index"},{"articleLive":1,"articleSlug":"h-index-ii","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":1,"articleSlug":"paint-fence","formTitle":"[276]Paint Fence","frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","title":"Paint Fence","titleSlug":"paint-fence"},{"articleLive":1,"articleSlug":"find-the-celebrity","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":1,"articleSlug":"first-bad-version","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":1,"articleSlug":"perfect-squares","formTitle":"[279]Perfect Squares","frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","title":"Perfect Squares","titleSlug":"perfect-squares"},{"articleLive":1,"articleSlug":"wiggle-sort","formTitle":"[280]Wiggle Sort","frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","title":"Wiggle Sort","titleSlug":"wiggle-sort"},{"articleLive":1,"articleSlug":"zigzag-iterator","formTitle":"[281]Zigzag Iterator","frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","title":"Zigzag Iterator","titleSlug":"zigzag-iterator"},{"articleLive":1,"articleSlug":"expression-add-operators","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":1,"articleSlug":"move-zeroes","formTitle":"[283]Move Zeroes","frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","title":"Move Zeroes","titleSlug":"move-zeroes"},{"articleLive":1,"articleSlug":"peeking-iterator","formTitle":"[284]Peeking Iterator","frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","title":"Peeking Iterator","titleSlug":"peeking-iterator"},{"articleLive":1,"articleSlug":"inorder-successor-in-bst","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":1,"articleSlug":"walls-and-gates","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":1,"articleSlug":"find-the-duplicate-number","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":0,"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":1,"articleSlug":"game-of-life","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":1,"articleSlug":"word-pattern","formTitle":"[290]Word Pattern","frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","title":"Word Pattern","titleSlug":"word-pattern"},{"articleLive":0,"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":1,"articleSlug":"nim-game","formTitle":"[292]Nim Game","frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","title":"Nim Game","titleSlug":"nim-game"},{"articleLive":0,"formTitle":"[293]Flip Game","frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","title":"Flip Game","titleSlug":"flip-game"},{"articleLive":0,"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":1,"articleSlug":"find-median-from-data-stream","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":1,"articleSlug":"best-meeting-point","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":1,"articleSlug":"serialize-and-deserialize-binary-tree","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":1,"articleSlug":"binary-tree-longest-consecutive-sequence","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":1,"articleSlug":"bulls-and-cows","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":1,"articleSlug":"longest-increasing-subsequence","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":1,"articleSlug":"remove-invalid-parentheses","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":1,"articleSlug":"smallest-rectangle-enclosing-black-pixels","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":1,"articleSlug":"range-sum-query-immutable","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":1,"articleSlug":"range-sum-query-2d-immutable","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":1,"articleSlug":"number-of-islands-ii","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":0,"formTitle":"[306]Additive Number","frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","title":"Additive Number","titleSlug":"additive-number"},{"articleLive":1,"articleSlug":"range-sum-query-mutable","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":1,"articleSlug":"range-sum-query-2d-mutable","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":1,"articleSlug":"best-time-to-buy-and-sell-stock-with-cooldown","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":1,"articleSlug":"minimum-height-trees","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":0,"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":0,"formTitle":"[312]Burst Balloons","frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","title":"Burst Balloons","titleSlug":"burst-balloons"},{"articleLive":0,"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":1,"articleSlug":"binary-tree-vertical-order-traversal","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":1,"articleSlug":"count-of-smaller-numbers-after-self","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":1,"articleSlug":"remove-duplicate-letters","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":0,"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":1,"articleSlug":"maximum-product-of-word-lengths","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":0,"formTitle":"[319]Bulb Switcher","frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","title":"Bulb Switcher","titleSlug":"bulb-switcher"},{"articleLive":1,"articleSlug":"generalized-abbreviation","formTitle":"[320]Generalized Abbreviation","frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"},{"articleLive":0,"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":1,"articleSlug":"coin-change","formTitle":"[322]Coin Change","frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","title":"Coin Change","titleSlug":"coin-change"},{"articleLive":1,"articleSlug":"number-of-connected-components-in-an-undirected-graph","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":0,"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":0,"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":1,"articleSlug":"power-of-three","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":0,"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":1,"articleSlug":"odd-even-linked-list","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":1,"articleSlug":"longest-increasing-path-in-a-matrix","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":1,"articleSlug":"patching-array","formTitle":"[330]Patching Array","frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","title":"Patching Array","titleSlug":"patching-array"},{"articleLive":1,"articleSlug":"verify-preorder-serialization-of-a-binary-tree","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":1,"articleSlug":"reconstruct-itinerary","formTitle":"[332]Reconstruct Itinerary","frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"},{"articleLive":0,"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":1,"articleSlug":"increasing-triplet-subsequence","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":0,"formTitle":"[335]Self Crossing","frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","title":"Self Crossing","titleSlug":"self-crossing"},{"articleLive":1,"articleSlug":"palindrome-pairs","formTitle":"[336]Palindrome Pairs","frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","title":"Palindrome Pairs","titleSlug":"palindrome-pairs"},{"articleLive":1,"articleSlug":"house-robber-iii","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":1,"articleSlug":"counting-bits","formTitle":"[338]Counting Bits","frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","title":"Counting Bits","titleSlug":"counting-bits"},{"articleLive":1,"articleSlug":"nested-list-weight-sum","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":1,"articleSlug":"longest-substring-with-at-most-k-distinct-characters","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":1,"articleSlug":"flatten-nested-list-iterator","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":1,"articleSlug":"power-of-four","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":0,"formTitle":"[343]Integer Break","frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","title":"Integer Break","titleSlug":"integer-break"},{"articleLive":1,"articleSlug":"reverse-string","formTitle":"[344]Reverse String","frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","title":"Reverse String","titleSlug":"reverse-string"},{"articleLive":0,"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":1,"articleSlug":"moving-average-from-data-stream","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":1,"articleSlug":"top-k-frequent-elements","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":1,"articleSlug":"design-tic-tac-toe","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":1,"articleSlug":"intersection-of-two-arrays","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":1,"articleSlug":"intersection-of-two-arrays-ii","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":0,"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":0,"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":1,"articleSlug":"design-snake-game","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":1,"articleSlug":"russian-doll-envelopes","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":0,"formTitle":"[355]Design Twitter","frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","title":"Design Twitter","titleSlug":"design-twitter"},{"articleLive":0,"formTitle":"[356]Line Reflection","frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","title":"Line Reflection","titleSlug":"line-reflection"},{"articleLive":0,"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":0,"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":1,"articleSlug":"logger-rate-limiter","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":0,"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":1,"articleSlug":"bomb-enemy","formTitle":"[361]Bomb Enemy","frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","title":"Bomb Enemy","titleSlug":"bomb-enemy"},{"articleLive":1,"articleSlug":"design-hit-counter","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":1,"articleSlug":"max-sum-of-rectangle-no-larger-than-k","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":0,"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":0,"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":1,"articleSlug":"find-leaves-of-binary-tree","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":1,"articleSlug":"valid-perfect-square","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":1,"articleSlug":"largest-divisible-subset","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":1,"articleSlug":"plus-one-linked-list","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":1,"articleSlug":"range-addition","formTitle":"[370]Range Addition","frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","title":"Range Addition","titleSlug":"range-addition"},{"articleLive":1,"articleSlug":"sum-of-two-integers","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":0,"formTitle":"[372]Super Pow","frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","title":"Super Pow","titleSlug":"super-pow"},{"articleLive":0,"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":1,"articleSlug":"guess-number-higher-or-lower","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":0,"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":1,"articleSlug":"wiggle-subsequence","formTitle":"[376]Wiggle Subsequence","frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"},{"articleLive":1,"articleSlug":"combination-sum-iv","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":1,"articleSlug":"kth-smallest-element-in-a-sorted-matrix","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":0,"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":1,"articleSlug":"insert-delete-getrandom-o1","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":1,"articleSlug":"insert-delete-getrandom-o1-duplicates-allowed","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":1,"articleSlug":"linked-list-random-node","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":1,"articleSlug":"ransom-note","formTitle":"[383]Ransom Note","frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","title":"Ransom Note","titleSlug":"ransom-note"},{"articleLive":1,"articleSlug":"shuffle-an-array","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":0,"formTitle":"[385]Mini Parser","frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"","title":"Mini Parser","titleSlug":"mini-parser"},{"articleLive":0,"formTitle":"[386]Lexicographical Numbers","frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"},{"articleLive":1,"articleSlug":"first-unique-character-in-a-string","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":0,"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":1,"articleSlug":"find-the-difference","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":0,"formTitle":"[390]Elimination Game","frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","title":"Elimination Game","titleSlug":"elimination-game"},{"articleLive":0,"formTitle":"[391]Perfect Rectangle","frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","title":"Perfect Rectangle","titleSlug":"perfect-rectangle"},{"articleLive":1,"articleSlug":"is-subsequence","formTitle":"[392]Is Subsequence","frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","title":"Is Subsequence","titleSlug":"is-subsequence"},{"articleLive":1,"articleSlug":"utf-8-validation","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":1,"articleSlug":"decode-string","formTitle":"[394]Decode String","frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"","title":"Decode String","titleSlug":"decode-string"},{"articleLive":1,"articleSlug":"longest-substring-with-at-least-k-repeating-characters","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":0,"formTitle":"[396]Rotate Function","frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","title":"Rotate Function","titleSlug":"rotate-function"},{"articleLive":0,"formTitle":"[397]Integer Replacement","frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","title":"Integer Replacement","titleSlug":"integer-replacement"},{"articleLive":1,"articleSlug":"random-pick-index","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":1,"articleSlug":"evaluate-division","formTitle":"[399]Evaluate Division","frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","title":"Evaluate Division","titleSlug":"evaluate-division"},{"articleLive":0,"formTitle":"[400]Nth Digit","frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","title":"Nth Digit","titleSlug":"nth-digit"},{"articleLive":0,"formTitle":"[401]Binary Watch","frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","title":"Binary Watch","titleSlug":"binary-watch"},{"articleLive":1,"articleSlug":"remove-k-digits","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":1,"articleSlug":"frog-jump","formTitle":"[403]Frog Jump","frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"","title":"Frog Jump","titleSlug":"frog-jump"},{"articleLive":1,"articleSlug":"sum-of-left-leaves","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":0,"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":1,"articleSlug":"queue-reconstruction-by-height","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":0,"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":0,"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":1,"articleSlug":"longest-palindrome","formTitle":"[409]Longest Palindrome","frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","title":"Longest Palindrome","titleSlug":"longest-palindrome"},{"articleLive":1,"articleSlug":"split-array-largest-sum","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":0,"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":1,"articleSlug":"fizz-buzz","formTitle":"[412]Fizz Buzz","frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"articleLive":1,"articleSlug":"arithmetic-slices","formTitle":"[413]Arithmetic Slices","frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","title":"Arithmetic Slices","titleSlug":"arithmetic-slices"},{"articleLive":1,"articleSlug":"third-maximum-number","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":1,"articleSlug":"add-strings","formTitle":"[415]Add Strings","frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","title":"Add Strings","titleSlug":"add-strings"},{"articleLive":1,"articleSlug":"partition-equal-subset-sum","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":1,"articleSlug":"pacific-atlantic-water-flow","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":0,"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":0,"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":0,"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":1,"articleSlug":"maximum-xor-of-two-numbers-in-an-array","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":0,"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":1,"articleSlug":"reconstruct-original-digits-from-english","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":0,"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":1,"articleSlug":"word-squares","formTitle":"[425]Word Squares","frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","title":"Word Squares","titleSlug":"word-squares"},{"articleLive":1,"articleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","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":0,"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":1,"articleSlug":"serialize-and-deserialize-n-ary-tree","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":1,"articleSlug":"n-ary-tree-level-order-traversal","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":1,"articleSlug":"flatten-a-multilevel-doubly-linked-list","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":1,"articleSlug":"encode-n-ary-tree-to-binary-tree","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":0,"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":0,"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":1,"articleSlug":"number-of-segments-in-a-string","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":1,"articleSlug":"non-overlapping-intervals","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":1,"articleSlug":"find-right-interval","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":1,"articleSlug":"path-sum-iii","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":1,"articleSlug":"find-all-anagrams-in-a-string","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":0,"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":0,"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":1,"articleSlug":"arranging-coins","formTitle":"[441]Arranging Coins","frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","title":"Arranging Coins","titleSlug":"arranging-coins"},{"articleLive":1,"articleSlug":"find-all-duplicates-in-an-array","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":0,"formTitle":"[443]String Compression","frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","title":"String Compression","titleSlug":"string-compression"},{"articleLive":0,"formTitle":"[444]Sequence Reconstruction","frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"},{"articleLive":1,"articleSlug":"add-two-numbers-ii","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":1,"articleSlug":"arithmetic-slices-ii-subsequence","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":0,"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":1,"articleSlug":"find-all-numbers-disappeared-in-an-array","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":1,"articleSlug":"serialize-and-deserialize-bst","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":1,"articleSlug":"delete-node-in-a-bst","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":1,"articleSlug":"sort-characters-by-frequency","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":1,"articleSlug":"minimum-number-of-arrows-to-burst-balloons","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":1,"articleSlug":"minimum-moves-to-equal-array-elements","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":1,"articleSlug":"4sum-ii","formTitle":"[454]4Sum II","frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","title":"4Sum II","titleSlug":"4sum-ii"},{"articleLive":0,"formTitle":"[455]Assign Cookies","frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","title":"Assign Cookies","titleSlug":"assign-cookies"},{"articleLive":1,"articleSlug":"132-pattern","formTitle":"[456]132 Pattern","frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"","title":"132 Pattern","titleSlug":"132-pattern"},{"articleLive":0,"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":1,"articleSlug":"poor-pigs","formTitle":"[458]Poor Pigs","frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","title":"Poor Pigs","titleSlug":"poor-pigs"},{"articleLive":0,"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":0,"formTitle":"[460]LFU Cache","frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","title":"LFU Cache","titleSlug":"lfu-cache"},{"articleLive":1,"articleSlug":"hamming-distance","formTitle":"[461]Hamming Distance","frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","title":"Hamming Distance","titleSlug":"hamming-distance"},{"articleLive":1,"articleSlug":"minimum-moves-to-equal-array-elements-ii","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":1,"articleSlug":"island-perimeter","formTitle":"[463]Island Perimeter","frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","title":"Island Perimeter","titleSlug":"island-perimeter"},{"articleLive":0,"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":0,"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":1,"articleSlug":"count-the-repetitions","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":0,"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":1,"articleSlug":"validate-ip-address","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":0,"formTitle":"[469]Convex Polygon","frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","title":"Convex Polygon","titleSlug":"convex-polygon"},{"articleLive":1,"articleSlug":"implement-rand10-using-rand7","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":0,"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":0,"formTitle":"[472]Concatenated Words","frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","title":"Concatenated Words","titleSlug":"concatenated-words"},{"articleLive":1,"articleSlug":"matchsticks-to-square","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":1,"articleSlug":"ones-and-zeroes","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":0,"formTitle":"[475]Heaters","frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","title":"Heaters","titleSlug":"heaters"},{"articleLive":1,"articleSlug":"number-complement","formTitle":"[476]Number Complement","frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","title":"Number Complement","titleSlug":"number-complement"},{"articleLive":1,"articleSlug":"total-hamming-distance","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":1,"articleSlug":"generate-random-point-in-a-circle","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":0,"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":1,"articleSlug":"sliding-window-median","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":0,"formTitle":"[481]Magical String","frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","title":"Magical String","titleSlug":"magical-string"},{"articleLive":0,"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":0,"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":1,"articleSlug":"find-permutation","formTitle":"[484]Find Permutation","frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","title":"Find Permutation","titleSlug":"find-permutation"},{"articleLive":1,"articleSlug":"max-consecutive-ones","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":1,"articleSlug":"predict-the-winner","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":1,"articleSlug":"max-consecutive-ones-ii","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":0,"formTitle":"[488]Zuma Game","frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","title":"Zuma Game","titleSlug":"zuma-game"},{"articleLive":1,"articleSlug":"robot-room-cleaner","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":1,"articleSlug":"the-maze","formTitle":"[490]The Maze","frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","title":"The Maze","titleSlug":"the-maze"},{"articleLive":0,"formTitle":"[491]Increasing Subsequences","frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","title":"Increasing Subsequences","titleSlug":"increasing-subsequences"},{"articleLive":0,"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":0,"formTitle":"[493]Reverse Pairs","frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","title":"Reverse Pairs","titleSlug":"reverse-pairs"},{"articleLive":1,"articleSlug":"target-sum","formTitle":"[494]Target Sum","frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","title":"Target Sum","titleSlug":"target-sum"},{"articleLive":1,"articleSlug":"teemo-attacking","formTitle":"[495]Teemo Attacking","frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","title":"Teemo Attacking","titleSlug":"teemo-attacking"},{"articleLive":1,"articleSlug":"next-greater-element-i","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":0,"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":1,"articleSlug":"diagonal-traverse","formTitle":"[498]Diagonal Traverse","frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","title":"Diagonal Traverse","titleSlug":"diagonal-traverse"},{"articleLive":0,"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":0,"formTitle":"[500]Keyboard Row","frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","title":"Keyboard Row","titleSlug":"keyboard-row"},{"articleLive":0,"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":1,"articleSlug":"ipo","formTitle":"[502]IPO","frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","title":"IPO","titleSlug":"ipo"},{"articleLive":1,"articleSlug":"next-greater-element-ii","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":0,"formTitle":"[504]Base 7","frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","title":"Base 7","titleSlug":"base-7"},{"articleLive":1,"articleSlug":"the-maze-ii","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":0,"formTitle":"[506]Relative Ranks","frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","title":"Relative Ranks","titleSlug":"relative-ranks"},{"articleLive":1,"articleSlug":"perfect-number","formTitle":"[507]Perfect Number","frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","title":"Perfect Number","titleSlug":"perfect-number"},{"articleLive":0,"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":1,"articleSlug":"fibonacci-number","formTitle":"[509]Fibonacci Number","frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","title":"Fibonacci Number","titleSlug":"fibonacci-number"},{"articleLive":1,"articleSlug":"inorder-successor-in-bst-ii","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":0,"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":0,"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":0,"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":0,"formTitle":"[514]Freedom Trail","frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","title":"Freedom Trail","titleSlug":"freedom-trail"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"coin-change-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":0,"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":1,"articleSlug":"detect-capital","formTitle":"[520]Detect Capital","frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","title":"Detect Capital","titleSlug":"detect-capital"},{"articleLive":1,"articleSlug":"longest-uncommon-subsequence-i","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":1,"articleSlug":"longest-uncommon-subsequence-ii","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":0,"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":1,"articleSlug":"longest-word-in-dictionary-through-deleting","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":1,"articleSlug":"contiguous-array","formTitle":"[525]Contiguous Array","frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","title":"Contiguous Array","titleSlug":"contiguous-array"},{"articleLive":1,"articleSlug":"beautiful-arrangement","formTitle":"[526]Beautiful Arrangement","frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"},{"articleLive":1,"articleSlug":"word-abbreviation","formTitle":"[527]Word Abbreviation","frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","title":"Word Abbreviation","titleSlug":"word-abbreviation"},{"articleLive":1,"articleSlug":"random-pick-with-weight","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":0,"formTitle":"[529]Minesweeper","frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","title":"Minesweeper","titleSlug":"minesweeper"},{"articleLive":0,"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":0,"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":1,"articleSlug":"k-diff-pairs-in-an-array","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":0,"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":0,"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":1,"articleSlug":"encode-and-decode-tinyurl","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":1,"articleSlug":"construct-binary-tree-from-string","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":1,"articleSlug":"complex-number-multiplication","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":1,"articleSlug":"convert-bst-to-greater-tree","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":0,"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":1,"articleSlug":"single-element-in-a-sorted-array","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":1,"articleSlug":"reverse-string-ii","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":1,"articleSlug":"01-matrix","formTitle":"[542]01 Matrix","frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","title":"01 Matrix","titleSlug":"01-matrix"},{"articleLive":1,"articleSlug":"diameter-of-binary-tree","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":0,"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":1,"articleSlug":"boundary-of-binary-tree","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":1,"articleSlug":"remove-boxes","formTitle":"[546]Remove Boxes","frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","title":"Remove Boxes","titleSlug":"remove-boxes"},{"articleLive":1,"articleSlug":"number-of-provinces","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":1,"articleSlug":"split-array-with-equal-sum","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":1,"articleSlug":"binary-tree-longest-consecutive-sequence-ii","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":0,"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":1,"articleSlug":"student-attendance-record-i","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":1,"articleSlug":"student-attendance-record-ii","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":1,"articleSlug":"optimal-division","formTitle":"[553]Optimal Division","frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","title":"Optimal Division","titleSlug":"optimal-division"},{"articleLive":1,"articleSlug":"brick-wall","formTitle":"[554]Brick Wall","frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","title":"Brick Wall","titleSlug":"brick-wall"},{"articleLive":0,"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":1,"articleSlug":"next-greater-element-iii","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":1,"articleSlug":"reverse-words-in-a-string-iii","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":0,"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":1,"articleSlug":"maximum-depth-of-n-ary-tree","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":1,"articleSlug":"subarray-sum-equals-k","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":0,"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":1,"articleSlug":"longest-line-of-consecutive-one-in-matrix","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":1,"articleSlug":"binary-tree-tilt","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":0,"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":1,"articleSlug":"array-nesting","formTitle":"[565]Array Nesting","frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","title":"Array Nesting","titleSlug":"array-nesting"},{"articleLive":1,"articleSlug":"reshape-the-matrix","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":1,"articleSlug":"permutation-in-string","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":1,"articleSlug":"maximum-vacation-days","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":0,"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":1,"articleSlug":"managers-with-at-least-5-direct-reports","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":0,"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":0,"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":1,"articleSlug":"squirrel-simulation","formTitle":"[573]Squirrel Simulation","frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","title":"Squirrel Simulation","titleSlug":"squirrel-simulation"},{"articleLive":1,"articleSlug":"winning-candidate","formTitle":"[574]Winning Candidate","frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","title":"Winning Candidate","titleSlug":"winning-candidate"},{"articleLive":1,"articleSlug":"distribute-candies","formTitle":"[575]Distribute Candies","frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","title":"Distribute Candies","titleSlug":"distribute-candies"},{"articleLive":1,"articleSlug":"out-of-boundary-paths","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":1,"articleSlug":"employee-bonus","formTitle":"[577]Employee Bonus","frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","title":"Employee Bonus","titleSlug":"employee-bonus"},{"articleLive":0,"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":1,"articleSlug":"find-cumulative-salary-of-an-employee","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":1,"articleSlug":"count-student-number-in-departments","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":1,"articleSlug":"shortest-unsorted-continuous-subarray","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":1,"articleSlug":"kill-process","formTitle":"[582]Kill Process","frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","title":"Kill Process","titleSlug":"kill-process"},{"articleLive":1,"articleSlug":"delete-operation-for-two-strings","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":1,"articleSlug":"find-customer-referee","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":1,"articleSlug":"investments-in-2016","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":1,"articleSlug":"customer-placing-the-largest-number-of-orders","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":1,"articleSlug":"erect-the-fence","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":1,"articleSlug":"design-in-memory-file-system","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":1,"articleSlug":"n-ary-tree-preorder-traversal","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":1,"articleSlug":"n-ary-tree-postorder-traversal","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":1,"articleSlug":"tag-validator","formTitle":"[591]Tag Validator","frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","title":"Tag Validator","titleSlug":"tag-validator"},{"articleLive":1,"articleSlug":"fraction-addition-and-subtraction","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":1,"articleSlug":"valid-square","formTitle":"[593]Valid Square","frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","title":"Valid Square","titleSlug":"valid-square"},{"articleLive":1,"articleSlug":"longest-harmonious-subsequence","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":1,"articleSlug":"big-countries","formTitle":"[595]Big Countries","frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","title":"Big Countries","titleSlug":"big-countries"},{"articleLive":1,"articleSlug":"classes-more-than-5-students","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":1,"articleSlug":"friend-requests-i-overall-acceptance-rate","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":1,"articleSlug":"range-addition-ii","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":1,"articleSlug":"minimum-index-sum-of-two-lists","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":1,"articleSlug":"non-negative-integers-without-consecutive-ones","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":1,"articleSlug":"human-traffic-of-stadium","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":0,"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":1,"articleSlug":"consecutive-available-seats","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":1,"articleSlug":"design-compressed-string-iterator","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":1,"articleSlug":"can-place-flowers","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":1,"articleSlug":"construct-string-from-binary-tree","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":1,"articleSlug":"sales-person","formTitle":"[607]Sales Person","frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","title":"Sales Person","titleSlug":"sales-person"},{"articleLive":1,"articleSlug":"tree-node","formTitle":"[608]Tree Node","frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","title":"Tree Node","titleSlug":"tree-node"},{"articleLive":1,"articleSlug":"find-duplicate-file-in-system","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":1,"articleSlug":"triangle-judgement","formTitle":"[610]Triangle Judgement","frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","title":"Triangle Judgement","titleSlug":"triangle-judgement"},{"articleLive":1,"articleSlug":"valid-triangle-number","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":1,"articleSlug":"shortest-distance-in-a-plane","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":1,"articleSlug":"shortest-distance-in-a-line","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":0,"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":1,"articleSlug":"average-salary-departments-vs-company","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":0,"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":1,"articleSlug":"merge-two-binary-trees","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":1,"articleSlug":"students-report-by-geography","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":1,"articleSlug":"biggest-single-number","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":1,"articleSlug":"not-boring-movies","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":1,"articleSlug":"task-scheduler","formTitle":"[621]Task Scheduler","frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","title":"Task Scheduler","titleSlug":"task-scheduler"},{"articleLive":1,"articleSlug":"design-circular-queue","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":1,"articleSlug":"add-one-row-to-tree","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":1,"articleSlug":"maximum-distance-in-arrays","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":1,"articleSlug":"minimum-factorization","formTitle":"[625]Minimum Factorization","frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","title":"Minimum Factorization","titleSlug":"minimum-factorization"},{"articleLive":1,"articleSlug":"exchange-seats","formTitle":"[626]Exchange Seats","frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","title":"Exchange Seats","titleSlug":"exchange-seats"},{"articleLive":1,"articleSlug":"swap-salary","formTitle":"[627]Swap Salary","frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","title":"Swap Salary","titleSlug":"swap-salary"},{"articleLive":1,"articleSlug":"maximum-product-of-three-numbers","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":1,"articleSlug":"k-inverse-pairs-array","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":1,"articleSlug":"course-schedule-iii","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":1,"articleSlug":"design-excel-sum-formula","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":1,"articleSlug":"smallest-range-covering-elements-from-k-lists","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":1,"articleSlug":"sum-of-square-numbers","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":1,"articleSlug":"find-the-derangement-of-an-array","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":1,"articleSlug":"design-log-storage-system","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":0,"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":1,"articleSlug":"average-of-levels-in-binary-tree","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":1,"articleSlug":"shopping-offers","formTitle":"[638]Shopping Offers","frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","title":"Shopping Offers","titleSlug":"shopping-offers"},{"articleLive":1,"articleSlug":"decode-ways-ii","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":1,"articleSlug":"solve-the-equation","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":0,"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":0,"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":1,"articleSlug":"maximum-average-subarray-i","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":1,"articleSlug":"maximum-average-subarray-ii","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":1,"articleSlug":"set-mismatch","formTitle":"[645]Set Mismatch","frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","title":"Set Mismatch","titleSlug":"set-mismatch"},{"articleLive":1,"articleSlug":"maximum-length-of-pair-chain","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":1,"articleSlug":"palindromic-substrings","formTitle":"[647]Palindromic Substrings","frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","title":"Palindromic Substrings","titleSlug":"palindromic-substrings"},{"articleLive":1,"articleSlug":"replace-words","formTitle":"[648]Replace Words","frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","title":"Replace Words","titleSlug":"replace-words"},{"articleLive":0,"formTitle":"[649]Dota2 Senate","frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","title":"Dota2 Senate","titleSlug":"dota2-senate"},{"articleLive":1,"articleSlug":"2-keys-keyboard","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":0,"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":0,"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":1,"articleSlug":"two-sum-iv-input-is-a-bst","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":1,"articleSlug":"maximum-binary-tree","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":0,"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":1,"articleSlug":"coin-path","formTitle":"[656]Coin Path","frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","title":"Coin Path","titleSlug":"coin-path"},{"articleLive":1,"articleSlug":"robot-return-to-origin","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":1,"articleSlug":"find-k-closest-elements","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":0,"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":1,"articleSlug":"remove-9","formTitle":"[660]Remove 9","frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","title":"Remove 9","titleSlug":"remove-9"},{"articleLive":0,"formTitle":"[661]Image Smoother","frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","title":"Image Smoother","titleSlug":"image-smoother"},{"articleLive":1,"articleSlug":"maximum-width-of-binary-tree","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":1,"articleSlug":"equal-tree-partition","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":0,"formTitle":"[664]Strange Printer","frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","title":"Strange Printer","titleSlug":"strange-printer"},{"articleLive":1,"articleSlug":"non-decreasing-array","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":1,"articleSlug":"path-sum-iv","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":1,"articleSlug":"beautiful-arrangement-ii","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":1,"articleSlug":"kth-smallest-number-in-multiplication-table","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":1,"articleSlug":"trim-a-binary-search-tree","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":0,"formTitle":"[670]Maximum Swap","frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","title":"Maximum Swap","titleSlug":"maximum-swap"},{"articleLive":1,"articleSlug":"second-minimum-node-in-a-binary-tree","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":0,"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":0,"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":1,"articleSlug":"longest-continuous-increasing-subsequence","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":0,"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":0,"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":1,"articleSlug":"map-sum-pairs","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":1,"articleSlug":"valid-parenthesis-string","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":0,"formTitle":"[679]24 Game","frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","title":"24 Game","titleSlug":"24-game"},{"articleLive":0,"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":0,"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":1,"articleSlug":"baseball-game","formTitle":"[682]Baseball Game","frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"","title":"Baseball Game","titleSlug":"baseball-game"},{"articleLive":0,"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":1,"articleSlug":"redundant-connection","formTitle":"[684]Redundant Connection","frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","title":"Redundant Connection","titleSlug":"redundant-connection"},{"articleLive":0,"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":0,"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":1,"articleSlug":"longest-univalue-path","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":1,"articleSlug":"knight-probability-in-chessboard","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":1,"articleSlug":"maximum-sum-of-3-non-overlapping-subarrays","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":1,"articleSlug":"employee-importance","formTitle":"[690]Employee Importance","frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"","title":"Employee Importance","titleSlug":"employee-importance"},{"articleLive":0,"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":0,"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":1,"articleSlug":"binary-number-with-alternating-bits","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":1,"articleSlug":"number-of-distinct-islands","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":1,"articleSlug":"max-area-of-island","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":1,"articleSlug":"count-binary-substrings","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":1,"articleSlug":"degree-of-an-array","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":0,"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":1,"articleSlug":"falling-squares","formTitle":"[699]Falling Squares","frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","title":"Falling Squares","titleSlug":"falling-squares"},{"articleLive":1,"articleSlug":"search-in-a-binary-search-tree","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":1,"articleSlug":"insert-into-a-binary-search-tree","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":1,"articleSlug":"search-in-a-sorted-array-of-unknown-size","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":0,"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":1,"articleSlug":"binary-search","formTitle":"[704]Binary Search","frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","title":"Binary Search","titleSlug":"binary-search"},{"articleLive":1,"articleSlug":"design-hashset","formTitle":"[705]Design HashSet","frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"","title":"Design HashSet","titleSlug":"design-hashset"},{"articleLive":1,"articleSlug":"design-hashmap","formTitle":"[706]Design HashMap","frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","title":"Design HashMap","titleSlug":"design-hashmap"},{"articleLive":1,"articleSlug":"design-linked-list","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":1,"articleSlug":"insert-into-a-sorted-circular-linked-list","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":1,"articleSlug":"to-lower-case","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":1,"articleSlug":"random-pick-with-blacklist","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":0,"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":1,"articleSlug":"minimum-ascii-delete-sum-for-two-strings","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":1,"articleSlug":"subarray-product-less-than-k","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":1,"articleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee","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":0,"formTitle":"[715]Range Module","frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","title":"Range Module","titleSlug":"range-module"},{"articleLive":1,"articleSlug":"max-stack","formTitle":"[716]Max Stack","frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","title":"Max Stack","titleSlug":"max-stack"},{"articleLive":0,"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":1,"articleSlug":"maximum-length-of-repeated-subarray","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":1,"articleSlug":"find-k-th-smallest-pair-distance","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":1,"articleSlug":"longest-word-in-dictionary","formTitle":"[720]Longest Word in Dictionary","frontendQuestionId":"720","leaf":true,"level":2,"nodeType":"def","questionId":"720","status":"","title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"},{"articleLive":1,"articleSlug":"accounts-merge","formTitle":"[721]Accounts Merge","frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","title":"Accounts Merge","titleSlug":"accounts-merge"},{"articleLive":0,"formTitle":"[722]Remove Comments","frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","title":"Remove Comments","titleSlug":"remove-comments"},{"articleLive":1,"articleSlug":"candy-crush","formTitle":"[723]Candy Crush","frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","title":"Candy Crush","titleSlug":"candy-crush"},{"articleLive":1,"articleSlug":"find-pivot-index","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":1,"articleSlug":"split-linked-list-in-parts","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":1,"articleSlug":"number-of-atoms","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":0,"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":1,"articleSlug":"self-dividing-numbers","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":1,"articleSlug":"my-calendar-i","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":0,"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":1,"articleSlug":"my-calendar-ii","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":1,"articleSlug":"my-calendar-iii","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":1,"articleSlug":"flood-fill","formTitle":"[733]Flood Fill","frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","title":"Flood Fill","titleSlug":"flood-fill"},{"articleLive":0,"formTitle":"[734]Sentence Similarity","frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","title":"Sentence Similarity","titleSlug":"sentence-similarity"},{"articleLive":1,"articleSlug":"asteroid-collision","formTitle":"[735]Asteroid Collision","frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"","title":"Asteroid Collision","titleSlug":"asteroid-collision"},{"articleLive":0,"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":1,"articleSlug":"sentence-similarity-ii","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":0,"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":0,"formTitle":"[739]Daily Temperatures","frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"","title":"Daily Temperatures","titleSlug":"daily-temperatures"},{"articleLive":1,"articleSlug":"delete-and-earn","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":1,"articleSlug":"cherry-pickup","formTitle":"[741]Cherry Pickup","frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","title":"Cherry Pickup","titleSlug":"cherry-pickup"},{"articleLive":1,"articleSlug":"closest-leaf-in-a-binary-tree","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":1,"articleSlug":"network-delay-time","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":1,"articleSlug":"find-smallest-letter-greater-than-target","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":1,"articleSlug":"prefix-and-suffix-search","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":1,"articleSlug":"min-cost-climbing-stairs","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":0,"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":0,"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":0,"formTitle":"[749]Contain Virus","frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","title":"Contain Virus","titleSlug":"contain-virus"},{"articleLive":1,"articleSlug":"number-of-corner-rectangles","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":0,"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":1,"articleSlug":"open-the-lock","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":0,"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":1,"articleSlug":"reach-a-number","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":0,"formTitle":"[755]Pour Water","frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","title":"Pour Water","titleSlug":"pour-water"},{"articleLive":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"find-anagram-mappings","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":1,"articleSlug":"special-binary-string","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":0,"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":1,"articleSlug":"partition-labels","formTitle":"[763]Partition Labels","frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","title":"Partition Labels","titleSlug":"partition-labels"},{"articleLive":1,"articleSlug":"largest-plus-sign","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":1,"articleSlug":"couples-holding-hands","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":1,"articleSlug":"toeplitz-matrix","formTitle":"[766]Toeplitz Matrix","frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"},{"articleLive":0,"formTitle":"[767]Reorganize String","frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","title":"Reorganize String","titleSlug":"reorganize-string"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"jewels-and-stones","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":0,"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":0,"formTitle":"[773]Sliding Puzzle","frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","title":"Sliding Puzzle","titleSlug":"sliding-puzzle"},{"articleLive":1,"articleSlug":"minimize-max-distance-to-gas-station","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":1,"articleSlug":"global-and-local-inversions","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":1,"articleSlug":"split-bst","formTitle":"[776]Split BST","frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","title":"Split BST","titleSlug":"split-bst"},{"articleLive":0,"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":1,"articleSlug":"swim-in-rising-water","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":0,"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":1,"articleSlug":"reaching-points","formTitle":"[780]Reaching Points","frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","title":"Reaching Points","titleSlug":"reaching-points"},{"articleLive":1,"articleSlug":"rabbits-in-forest","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":1,"articleSlug":"transform-to-chessboard","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":1,"articleSlug":"minimum-distance-between-bst-nodes","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":1,"articleSlug":"letter-case-permutation","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":1,"articleSlug":"is-graph-bipartite","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":1,"articleSlug":"k-th-smallest-prime-fraction","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":1,"articleSlug":"cheapest-flights-within-k-stops","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":0,"formTitle":"[788]Rotated Digits","frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","title":"Rotated Digits","titleSlug":"rotated-digits"},{"articleLive":1,"articleSlug":"escape-the-ghosts","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":1,"articleSlug":"domino-and-tromino-tiling","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":1,"articleSlug":"custom-sort-string","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":1,"articleSlug":"number-of-matching-subsequences","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":1,"articleSlug":"preimage-size-of-factorial-zeroes-function","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":0,"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":1,"articleSlug":"number-of-subarrays-with-bounded-maximum","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":1,"articleSlug":"rotate-string","formTitle":"[796]Rotate String","frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","title":"Rotate String","titleSlug":"rotate-string"},{"articleLive":1,"articleSlug":"all-paths-from-source-to-target","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":1,"articleSlug":"smallest-rotation-with-highest-score","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":1,"articleSlug":"champagne-tower","formTitle":"[799]Champagne Tower","frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","title":"Champagne Tower","titleSlug":"champagne-tower"},{"articleLive":0,"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":0,"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":1,"articleSlug":"find-eventual-safe-states","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":1,"articleSlug":"bricks-falling-when-hit","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":1,"articleSlug":"unique-morse-code-words","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":0,"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":1,"articleSlug":"number-of-lines-to-write-string","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":1,"articleSlug":"max-increase-to-keep-city-skyline","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":0,"formTitle":"[808]Soup Servings","frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","title":"Soup Servings","titleSlug":"soup-servings"},{"articleLive":0,"formTitle":"[809]Expressive Words","frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","title":"Expressive Words","titleSlug":"expressive-words"},{"articleLive":1,"articleSlug":"chalkboard-xor-game","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":1,"articleSlug":"subdomain-visit-count","formTitle":"[811]Subdomain Visit Count","frontendQuestionId":"811","leaf":true,"level":1,"nodeType":"def","questionId":"829","status":"","title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"},{"articleLive":0,"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":1,"articleSlug":"largest-sum-of-averages","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":1,"articleSlug":"binary-tree-pruning","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":1,"articleSlug":"bus-routes","formTitle":"[815]Bus Routes","frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","title":"Bus Routes","titleSlug":"bus-routes"},{"articleLive":1,"articleSlug":"ambiguous-coordinates","formTitle":"[816]Ambiguous Coordinates","frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"},{"articleLive":0,"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":0,"formTitle":"[818]Race Car","frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","title":"Race Car","titleSlug":"race-car"},{"articleLive":1,"articleSlug":"most-common-word","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":1,"articleSlug":"short-encoding-of-words","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":1,"articleSlug":"shortest-distance-to-a-character","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":0,"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":1,"articleSlug":"binary-trees-with-factors","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":0,"formTitle":"[824]Goat Latin","frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","title":"Goat Latin","titleSlug":"goat-latin"},{"articleLive":0,"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":1,"articleSlug":"most-profit-assigning-work","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":1,"articleSlug":"making-a-large-island","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":0,"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":1,"articleSlug":"consecutive-numbers-sum","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":1,"articleSlug":"positions-of-large-groups","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":0,"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":1,"articleSlug":"flipping-an-image","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":0,"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":1,"articleSlug":"sum-of-distances-in-tree","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":1,"articleSlug":"image-overlap","formTitle":"[835]Image Overlap","frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","title":"Image Overlap","titleSlug":"image-overlap"},{"articleLive":1,"articleSlug":"rectangle-overlap","formTitle":"[836]Rectangle Overlap","frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","title":"Rectangle Overlap","titleSlug":"rectangle-overlap"},{"articleLive":0,"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":1,"articleSlug":"push-dominoes","formTitle":"[838]Push Dominoes","frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","title":"Push Dominoes","titleSlug":"push-dominoes"},{"articleLive":0,"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":0,"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":1,"articleSlug":"keys-and-rooms","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":1,"articleSlug":"split-array-into-fibonacci-sequence","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":0,"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":1,"articleSlug":"backspace-string-compare","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":1,"articleSlug":"longest-mountain-in-array","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":0,"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":0,"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":1,"articleSlug":"shifting-letters","formTitle":"[848]Shifting Letters","frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","title":"Shifting Letters","titleSlug":"shifting-letters"},{"articleLive":1,"articleSlug":"maximize-distance-to-closest-person","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":1,"articleSlug":"rectangle-area-ii","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":1,"articleSlug":"loud-and-rich","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":1,"articleSlug":"peak-index-in-a-mountain-array","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":0,"formTitle":"[853]Car Fleet","frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","title":"Car Fleet","titleSlug":"car-fleet"},{"articleLive":0,"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":0,"formTitle":"[855]Exam Room","frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","title":"Exam Room","titleSlug":"exam-room"},{"articleLive":1,"articleSlug":"score-of-parentheses","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":1,"articleSlug":"minimum-cost-to-hire-k-workers","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":0,"formTitle":"[858]Mirror Reflection","frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","title":"Mirror Reflection","titleSlug":"mirror-reflection"},{"articleLive":1,"articleSlug":"buddy-strings","formTitle":"[859]Buddy Strings","frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","title":"Buddy Strings","titleSlug":"buddy-strings"},{"articleLive":1,"articleSlug":"lemonade-change","formTitle":"[860]Lemonade Change","frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","title":"Lemonade Change","titleSlug":"lemonade-change"},{"articleLive":0,"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":1,"articleSlug":"shortest-subarray-with-sum-at-least-k","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":1,"articleSlug":"all-nodes-distance-k-in-binary-tree","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":0,"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":1,"articleSlug":"smallest-subtree-with-all-the-deepest-nodes","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":1,"articleSlug":"prime-palindrome","formTitle":"[866]Prime Palindrome","frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","title":"Prime Palindrome","titleSlug":"prime-palindrome"},{"articleLive":1,"articleSlug":"transpose-matrix","formTitle":"[867]Transpose Matrix","frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","title":"Transpose Matrix","titleSlug":"transpose-matrix"},{"articleLive":1,"articleSlug":"binary-gap","formTitle":"[868]Binary Gap","frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","title":"Binary Gap","titleSlug":"binary-gap"},{"articleLive":1,"articleSlug":"reordered-power-of-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":1,"articleSlug":"advantage-shuffle","formTitle":"[870]Advantage Shuffle","frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","title":"Advantage Shuffle","titleSlug":"advantage-shuffle"},{"articleLive":1,"articleSlug":"minimum-number-of-refueling-stops","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":1,"articleSlug":"leaf-similar-trees","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":1,"articleSlug":"length-of-longest-fibonacci-subsequence","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":0,"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":1,"articleSlug":"koko-eating-bananas","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":1,"articleSlug":"middle-of-the-linked-list","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":1,"articleSlug":"stone-game","formTitle":"[877]Stone Game","frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","title":"Stone Game","titleSlug":"stone-game"},{"articleLive":1,"articleSlug":"nth-magical-number","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":1,"articleSlug":"profitable-schemes","formTitle":"[879]Profitable Schemes","frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","title":"Profitable Schemes","titleSlug":"profitable-schemes"},{"articleLive":1,"articleSlug":"decoded-string-at-index","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":1,"articleSlug":"boats-to-save-people","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":1,"articleSlug":"reachable-nodes-in-subdivided-graph","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":1,"articleSlug":"projection-area-of-3d-shapes","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":1,"articleSlug":"uncommon-words-from-two-sentences","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":1,"articleSlug":"spiral-matrix-iii","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":0,"formTitle":"[886]Possible Bipartition","frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","title":"Possible Bipartition","titleSlug":"possible-bipartition"},{"articleLive":1,"articleSlug":"super-egg-drop","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":1,"articleSlug":"fair-candy-swap","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":0,"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":1,"articleSlug":"find-and-replace-pattern","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":1,"articleSlug":"sum-of-subsequence-widths","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":0,"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":0,"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":1,"articleSlug":"all-possible-full-binary-trees","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":1,"articleSlug":"maximum-frequency-stack","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":1,"articleSlug":"monotonic-array","formTitle":"[896]Monotonic Array","frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","title":"Monotonic Array","titleSlug":"monotonic-array"},{"articleLive":1,"articleSlug":"increasing-order-search-tree","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":0,"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":1,"articleSlug":"orderly-queue","formTitle":"[899]Orderly Queue","frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","title":"Orderly Queue","titleSlug":"orderly-queue"},{"articleLive":0,"formTitle":"[900]RLE Iterator","frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","title":"RLE Iterator","titleSlug":"rle-iterator"},{"articleLive":0,"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":1,"articleSlug":"numbers-at-most-n-given-digit-set","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":0,"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":0,"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":1,"articleSlug":"sort-array-by-parity","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":1,"articleSlug":"super-palindromes","formTitle":"[906]Super Palindromes","frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","title":"Super Palindromes","titleSlug":"super-palindromes"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"smallest-range-ii","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":1,"articleSlug":"online-election","formTitle":"[911]Online Election","frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","title":"Online Election","titleSlug":"online-election"},{"articleLive":0,"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":1,"articleSlug":"cat-and-mouse","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":1,"articleSlug":"x-of-a-kind-in-a-deck-of-cards","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":1,"articleSlug":"partition-array-into-disjoint-intervals","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":1,"articleSlug":"word-subsets","formTitle":"[916]Word Subsets","frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","title":"Word Subsets","titleSlug":"word-subsets"},{"articleLive":1,"articleSlug":"reverse-only-letters","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":1,"articleSlug":"maximum-sum-circular-subarray","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":1,"articleSlug":"complete-binary-tree-inserter","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":1,"articleSlug":"number-of-music-playlists","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":1,"articleSlug":"minimum-add-to-make-parentheses-valid","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":1,"articleSlug":"sort-array-by-parity-ii","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":1,"articleSlug":"3sum-with-multiplicity","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":1,"articleSlug":"minimize-malware-spread","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":0,"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":1,"articleSlug":"flip-string-to-monotone-increasing","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":1,"articleSlug":"three-equal-parts","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":1,"articleSlug":"minimize-malware-spread-ii","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":0,"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":1,"articleSlug":"binary-subarrays-with-sum","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":0,"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":1,"articleSlug":"beautiful-array","formTitle":"[932]Beautiful Array","frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","title":"Beautiful Array","titleSlug":"beautiful-array"},{"articleLive":1,"articleSlug":"number-of-recent-calls","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":0,"formTitle":"[934]Shortest Bridge","frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","title":"Shortest Bridge","titleSlug":"shortest-bridge"},{"articleLive":0,"formTitle":"[935]Knight Dialer","frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","title":"Knight Dialer","titleSlug":"knight-dialer"},{"articleLive":1,"articleSlug":"stamping-the-sequence","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":1,"articleSlug":"reorder-data-in-log-files","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":1,"articleSlug":"range-sum-of-bst","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":0,"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":1,"articleSlug":"distinct-subsequences-ii","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":1,"articleSlug":"valid-mountain-array","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":1,"articleSlug":"di-string-match","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":1,"articleSlug":"find-the-shortest-superstring","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":0,"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":1,"articleSlug":"minimum-increment-to-make-array-unique","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":1,"articleSlug":"validate-stack-sequences","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":0,"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":1,"articleSlug":"bag-of-tokens","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":1,"articleSlug":"largest-time-for-given-digits","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":1,"articleSlug":"reveal-cards-in-increasing-order","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":1,"articleSlug":"flip-equivalent-binary-trees","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":1,"articleSlug":"largest-component-size-by-common-factor","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":1,"articleSlug":"verifying-an-alien-dictionary","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":1,"articleSlug":"array-of-doubled-pairs","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":0,"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":0,"formTitle":"[956]Tallest Billboard","frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","title":"Tallest Billboard","titleSlug":"tallest-billboard"},{"articleLive":1,"articleSlug":"prison-cells-after-n-days","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":0,"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":1,"articleSlug":"regions-cut-by-slashes","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":1,"articleSlug":"delete-columns-to-make-sorted-iii","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":1,"articleSlug":"n-repeated-element-in-size-2n-array","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":0,"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":0,"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":0,"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":1,"articleSlug":"univalued-binary-tree","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":1,"articleSlug":"vowel-spellchecker","formTitle":"[966]Vowel Spellchecker","frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"},{"articleLive":1,"articleSlug":"numbers-with-same-consecutive-differences","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":1,"articleSlug":"binary-tree-cameras","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":1,"articleSlug":"pancake-sorting","formTitle":"[969]Pancake Sorting","frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","title":"Pancake Sorting","titleSlug":"pancake-sorting"},{"articleLive":1,"articleSlug":"powerful-integers","formTitle":"[970]Powerful Integers","frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","title":"Powerful Integers","titleSlug":"powerful-integers"},{"articleLive":1,"articleSlug":"flip-binary-tree-to-match-preorder-traversal","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":1,"articleSlug":"equal-rational-numbers","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":0,"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":0,"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":0,"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":1,"articleSlug":"largest-perimeter-triangle","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":1,"articleSlug":"squares-of-a-sorted-array","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":1,"articleSlug":"longest-turbulent-subarray","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":1,"articleSlug":"distribute-coins-in-binary-tree","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":1,"articleSlug":"unique-paths-iii","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":0,"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":0,"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":1,"articleSlug":"minimum-cost-for-tickets","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":1,"articleSlug":"string-without-aaa-or-bbb","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":1,"articleSlug":"sum-of-even-numbers-after-queries","formTitle":"[985]Sum of Even Numbers After Queries","frontendQuestionId":"985","leaf":true,"level":1,"nodeType":"def","questionId":"1027","status":"","title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"},{"articleLive":1,"articleSlug":"interval-list-intersections","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":1,"articleSlug":"vertical-order-traversal-of-a-binary-tree","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":1,"articleSlug":"smallest-string-starting-from-leaf","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":1,"articleSlug":"add-to-array-form-of-integer","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":1,"articleSlug":"satisfiability-of-equality-equations","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":1,"articleSlug":"broken-calculator","formTitle":"[991]Broken Calculator","frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","title":"Broken Calculator","titleSlug":"broken-calculator"},{"articleLive":0,"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":1,"articleSlug":"cousins-in-binary-tree","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":1,"articleSlug":"rotting-oranges","formTitle":"[994]Rotting Oranges","frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","title":"Rotting Oranges","titleSlug":"rotting-oranges"},{"articleLive":0,"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":0,"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":1,"articleSlug":"find-the-town-judge","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":0,"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":0,"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":0,"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":0,"formTitle":"[1001]Grid Illumination","frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","title":"Grid Illumination","titleSlug":"grid-illumination"},{"articleLive":0,"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":0,"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":1,"articleSlug":"max-consecutive-ones-iii","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":0,"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":0,"formTitle":"[1006]Clumsy Factorial","frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"","title":"Clumsy Factorial","titleSlug":"clumsy-factorial"},{"articleLive":1,"articleSlug":"minimum-domino-rotations-for-equal-row","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":1,"articleSlug":"construct-binary-search-tree-from-preorder-traversal","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":1,"articleSlug":"complement-of-base-10-integer","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":1,"articleSlug":"pairs-of-songs-with-total-durations-divisible-by-60","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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"smallest-integer-divisible-by-k","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"sum-of-root-to-leaf-binary-numbers","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":0,"formTitle":"[1023]Camelcase Matching","frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","title":"Camelcase Matching","titleSlug":"camelcase-matching"},{"articleLive":0,"formTitle":"[1024]Video Stitching","frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","title":"Video Stitching","titleSlug":"video-stitching"},{"articleLive":0,"formTitle":"[1025]Divisor Game","frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","title":"Divisor Game","titleSlug":"divisor-game"},{"articleLive":1,"articleSlug":"maximum-difference-between-node-and-ancestor","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":0,"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":0,"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":1,"articleSlug":"two-city-scheduling","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":0,"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":0,"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":1,"articleSlug":"stream-of-characters","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":0,"formTitle":"[1033]Moving Stones Until Consecutive","frontendQuestionId":"1033","leaf":true,"level":1,"nodeType":"def","questionId":"1103","status":"","title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"},{"articleLive":0,"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":0,"formTitle":"[1035]Uncrossed Lines","frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","title":"Uncrossed Lines","titleSlug":"uncrossed-lines"},{"articleLive":0,"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":0,"formTitle":"[1037]Valid Boomerang","frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","title":"Valid Boomerang","titleSlug":"valid-boomerang"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"robot-bounded-in-circle","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":0,"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":0,"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":1,"articleSlug":"longest-duplicate-substring","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":0,"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":1,"articleSlug":"last-stone-weight","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":1,"articleSlug":"remove-all-adjacent-duplicates-in-string","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":1,"articleSlug":"longest-string-chain","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":0,"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":0,"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":0,"formTitle":"[1051]Height Checker","frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","title":"Height Checker","titleSlug":"height-checker"},{"articleLive":0,"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":0,"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":0,"formTitle":"[1054]Distant Barcodes","frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","title":"Distant Barcodes","titleSlug":"distant-barcodes"},{"articleLive":0,"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":0,"formTitle":"[1056]Confusing Number","frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","title":"Confusing Number","titleSlug":"confusing-number"},{"articleLive":0,"formTitle":"[1057]Campus Bikes","frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","title":"Campus Bikes","titleSlug":"campus-bikes"},{"articleLive":0,"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":1,"articleSlug":"all-paths-from-source-lead-to-destination","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":1,"articleSlug":"missing-element-in-sorted-array","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":0,"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":1,"articleSlug":"longest-repeating-substring","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":0,"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":0,"formTitle":"[1064]Fixed Point","frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","title":"Fixed Point","titleSlug":"fixed-point"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"number-of-submatrices-that-sum-to-target","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"high-five","formTitle":"[1086]High Five","frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","title":"High Five","titleSlug":"high-five"},{"articleLive":0,"formTitle":"[1087]Brace Expansion","frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","title":"Brace Expansion","titleSlug":"brace-expansion"},{"articleLive":0,"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":1,"articleSlug":"duplicate-zeros","formTitle":"[1089]Duplicate Zeros","frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","title":"Duplicate Zeros","titleSlug":"duplicate-zeros"},{"articleLive":0,"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":1,"articleSlug":"shortest-path-in-binary-matrix","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":0,"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":0,"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":1,"articleSlug":"car-pooling","formTitle":"[1094]Car Pooling","frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","title":"Car Pooling","titleSlug":"car-pooling"},{"articleLive":0,"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":0,"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":0,"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":0,"formTitle":"[1098]Unpopular Books","frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","title":"Unpopular Books","titleSlug":"unpopular-books"},{"articleLive":1,"articleSlug":"two-sum-less-than-k","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1113]Reported Posts","frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","title":"Reported Posts","titleSlug":"reported-posts"},{"articleLive":1,"articleSlug":"print-in-order","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":0,"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":0,"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":0,"formTitle":"[1117]Building H2O","frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","title":"Building H2O","titleSlug":"building-h2o"},{"articleLive":0,"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":0,"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":1,"articleSlug":"maximum-average-subtree","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1126]Active Businesses","frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","title":"Active Businesses","titleSlug":"active-businesses"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"largest-unique-number","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":1,"articleSlug":"armstrong-number","formTitle":"[1134]Armstrong Number","frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","title":"Armstrong Number","titleSlug":"armstrong-number"},{"articleLive":1,"articleSlug":"connecting-cities-with-minimum-cost","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":1,"articleSlug":"parallel-courses","formTitle":"[1136]Parallel Courses","frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","title":"Parallel Courses","titleSlug":"parallel-courses"},{"articleLive":1,"articleSlug":"n-th-tribonacci-number","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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"longest-common-subsequence","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":0,"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":0,"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":0,"formTitle":"[1146]Snapshot Array","frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","title":"Snapshot Array","titleSlug":"snapshot-array"},{"articleLive":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"minimum-swaps-to-group-all-1s-together","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"maximum-level-sum-of-a-binary-tree","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":0,"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":0,"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":0,"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":1,"articleSlug":"single-row-keyboard","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":1,"articleSlug":"design-file-system","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":1,"articleSlug":"minimum-cost-to-connect-sticks","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":1,"articleSlug":"optimize-water-distribution-in-a-village","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":0,"formTitle":"[1169]Invalid Transactions","frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","title":"Invalid Transactions","titleSlug":"invalid-transactions"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1175]Prime Arrangements","frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","title":"Prime Arrangements","titleSlug":"prime-arrangements"},{"articleLive":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"count-substrings-with-only-one-distinct-letter","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":0,"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":1,"articleSlug":"shortest-distance-to-target-color","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"critical-connections-in-a-network","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":0,"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":0,"formTitle":"[1194]Tournament Winners","frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","title":"Tournament Winners","titleSlug":"tournament-winners"},{"articleLive":0,"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":1,"articleSlug":"how-many-apples-can-you-put-into-the-basket","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":1,"articleSlug":"minimum-knight-moves","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":1,"articleSlug":"find-smallest-common-element-in-all-rows","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1206]Design Skiplist","frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","title":"Design Skiplist","titleSlug":"design-skiplist"},{"articleLive":0,"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":0,"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":1,"articleSlug":"remove-all-adjacent-duplicates-in-string-ii","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":0,"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":0,"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":0,"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":1,"articleSlug":"intersection-of-three-sorted-arrays","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":1,"articleSlug":"two-sum-bsts","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":0,"formTitle":"[1215]Stepping Numbers","frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","title":"Stepping Numbers","titleSlug":"stepping-numbers"},{"articleLive":1,"articleSlug":"valid-palindrome-iii","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":1,"articleSlug":"minimum-cost-to-move-chips-to-the-same-position","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":0,"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":0,"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":1,"articleSlug":"count-vowels-permutation","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"missing-number-in-arithmetic-progression","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":1,"articleSlug":"meeting-scheduler","formTitle":"[1229]Meeting Scheduler","frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","title":"Meeting Scheduler","titleSlug":"meeting-scheduler"},{"articleLive":0,"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":0,"formTitle":"[1231]Divide Chocolate","frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","title":"Divide Chocolate","titleSlug":"divide-chocolate"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"maximum-profit-in-job-scheduling","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":0,"formTitle":"[1236]Web Crawler","frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","title":"Web Crawler","titleSlug":"web-crawler"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1243]Array Transformation","frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","title":"Array Transformation","titleSlug":"array-transformation"},{"articleLive":1,"articleSlug":"design-a-leaderboard","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":1,"articleSlug":"tree-diameter","formTitle":"[1245]Tree Diameter","frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","title":"Tree Diameter","titleSlug":"tree-diameter"},{"articleLive":0,"formTitle":"[1246]Palindrome Removal","frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","title":"Palindrome Removal","titleSlug":"palindrome-removal"},{"articleLive":0,"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":0,"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":1,"articleSlug":"minimum-remove-to-make-valid-parentheses","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1256]Encode Number","frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","title":"Encode Number","titleSlug":"encode-number"},{"articleLive":0,"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":0,"formTitle":"[1258]Synonymous Sentences","frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","title":"Synonymous Sentences","titleSlug":"synonymous-sentences"},{"articleLive":0,"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":1,"articleSlug":"shift-2d-grid","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":0,"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":0,"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":0,"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":0,"formTitle":"[1264]Page Recommendations","frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","title":"Page Recommendations","titleSlug":"page-recommendations"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"search-suggestions-system","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":0,"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":0,"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":0,"formTitle":"[1271]Hexspeak","frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","title":"Hexspeak","titleSlug":"hexspeak"},{"articleLive":1,"articleSlug":"remove-interval","formTitle":"[1272]Remove Interval","frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","title":"Remove Interval","titleSlug":"remove-interval"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"iterator-for-combination","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":0,"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":1,"articleSlug":"remove-covered-intervals","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":0,"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":1,"articleSlug":"convert-binary-number-in-a-linked-list-to-integer","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":1,"articleSlug":"sequential-digits","formTitle":"[1291]Sequential Digits","frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","title":"Sequential Digits","titleSlug":"sequential-digits"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"deepest-leaves-sum","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":0,"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":0,"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":1,"articleSlug":"all-elements-in-two-binary-search-trees","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":1,"articleSlug":"jump-game-iii","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1321]Restaurant Growth","frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","title":"Restaurant Growth","titleSlug":"restaurant-growth"},{"articleLive":0,"formTitle":"[1322]Ads Performance","frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","title":"Ads Performance","titleSlug":"ads-performance"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"sort-the-matrix-diagonally","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":0,"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":0,"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":1,"articleSlug":"remove-palindromic-subsequences","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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"the-k-weakest-rows-in-a-matrix","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":1,"articleSlug":"reduce-array-size-to-the-half","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":1,"articleSlug":"maximum-product-of-splitted-binary-tree","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":0,"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":0,"formTitle":"[1341]Movie Rating","frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","title":"Movie Rating","titleSlug":"movie-rating"},{"articleLive":1,"articleSlug":"number-of-steps-to-reduce-a-number-to-zero","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":0,"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":1,"articleSlug":"angle-between-hands-of-a-clock","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":1,"articleSlug":"jump-game-iv","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"construct-target-array-with-multiple-sums","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":0,"formTitle":"[1355]Activity Participants","frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","title":"Activity Participants","titleSlug":"activity-participants"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1362]Closest Divisors","frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","title":"Closest Divisors","titleSlug":"closest-divisors"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree","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":0,"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":0,"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":0,"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":1,"articleSlug":"maximum-performance-of-a-team","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1390]Four Divisors","frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","title":"Four Divisors","titleSlug":"four-divisors"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"find-lucky-integer-in-an-array","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":0,"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":1,"articleSlug":"design-underground-system","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1402]Reducing Dishes","frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","title":"Reducing Dishes","titleSlug":"reducing-dishes"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1407]Top Travellers","frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","title":"Top Travellers","titleSlug":"top-travellers"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1421]NPV Queries","frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","title":"NPV Queries","titleSlug":"npv-queries"},{"articleLive":0,"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":1,"articleSlug":"maximum-points-you-can-obtain-from-cards","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":0,"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":0,"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":1,"articleSlug":"counting-elements","formTitle":"[1426]Counting Elements","frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","title":"Counting Elements","titleSlug":"counting-elements"},{"articleLive":1,"articleSlug":"perform-string-shifts","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":1,"articleSlug":"leftmost-column-with-at-least-a-one","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":1,"articleSlug":"first-unique-number","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1436]Destination City","frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","title":"Destination City","titleSlug":"destination-city"},{"articleLive":1,"articleSlug":"check-if-all-1s-are-at-least-length-k-places-away","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1445]Apples & Oranges","frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","title":"Apples & Oranges","titleSlug":"apples-oranges"},{"articleLive":1,"articleSlug":"consecutive-characters","formTitle":"[1446]Consecutive Characters","frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","title":"Consecutive Characters","titleSlug":"consecutive-characters"},{"articleLive":0,"formTitle":"[1447]Simplified Fractions","frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","title":"Simplified Fractions","titleSlug":"simplified-fractions"},{"articleLive":1,"articleSlug":"count-good-nodes-in-binary-tree","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1454]Active Users","frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","title":"Active Users","titleSlug":"active-users"},{"articleLive":0,"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":0,"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":1,"articleSlug":"pseudo-palindromic-paths-in-a-binary-tree","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":0,"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":0,"formTitle":"[1459]Rectangles Area","frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","title":"Rectangles Area","titleSlug":"rectangles-area"},{"articleLive":0,"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":1,"articleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","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":0,"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":1,"articleSlug":"cherry-pickup-ii","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":0,"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":1,"articleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","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":0,"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":0,"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":0,"formTitle":"[1468]Calculate Salaries","frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","title":"Calculate Salaries","titleSlug":"calculate-salaries"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list","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":0,"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":0,"formTitle":"[1476]Subrectangle Queries","frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","title":"Subrectangle Queries","titleSlug":"subrectangle-queries"},{"articleLive":0,"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":0,"formTitle":"[1478]Allocate Mailboxes","frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"},{"articleLive":0,"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":1,"articleSlug":"running-sum-of-1d-array","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":0,"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":0,"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":0,"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":0,"formTitle":"[1484]Group Sold Products By The Date","frontendQuestionId":"1484","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":1,"articleSlug":"clone-binary-tree-with-random-pointer","formTitle":"[1485]Clone Binary Tree With Random Pointer","frontendQuestionId":"1485","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"the-kth-factor-of-n","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":0,"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":0,"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":0,"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":0,"formTitle":"[1496]Path Crossing","frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","title":"Path Crossing","titleSlug":"path-crossing"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"find-root-of-n-ary-tree","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":0,"formTitle":"[1507]Reformat Date","frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","title":"Reformat Date","titleSlug":"reformat-date"},{"articleLive":0,"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":0,"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":1,"articleSlug":"stone-game-iv","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1518]Water Bottles","frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","title":"Water Bottles","titleSlug":"water-bottles"},{"articleLive":0,"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":0,"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":0,"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":1,"articleSlug":"diameter-of-n-ary-tree","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1528]Shuffle String","frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","title":"Shuffle String","titleSlug":"shuffle-string"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"kth-missing-positive-number","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"minimum-operations-to-make-array-equal","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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1556]Thousand Separator","frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","title":"Thousand Separator","titleSlug":"thousand-separator"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"put-boxes-into-the-warehouse-i","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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"dot-product-of-two-sparse-vectors","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":0,"formTitle":"[1571]Warehouse Manager","frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","title":"Warehouse Manager","titleSlug":"warehouse-manager"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"binary-search-tree-iterator-ii","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1600]Throne Inheritance","frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","title":"Throne Inheritance","titleSlug":"throne-inheritance"},{"articleLive":0,"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":1,"articleSlug":"find-nearest-right-node-in-binary-tree","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1622]Fancy Sequence","frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","title":"Fancy Sequence","titleSlug":"fancy-sequence"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1629]Slowest Key","frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","title":"Slowest Key","titleSlug":"slowest-key"},{"articleLive":0,"formTitle":"[1630]Arithmetic Subarrays","frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"},{"articleLive":1,"articleSlug":"path-with-minimum-effort","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":1,"articleSlug":"rank-transform-of-a-matrix","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"check-array-formation-through-concatenation","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":1,"articleSlug":"count-sorted-vowel-strings","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":1,"articleSlug":"furthest-building-you-can-reach","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":0,"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":0,"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":0,"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":1,"articleSlug":"get-maximum-in-generated-array","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":0,"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":0,"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":1,"articleSlug":"create-sorted-array-through-instructions","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"determine-if-two-strings-are-close","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":1,"articleSlug":"minimum-operations-to-reduce-x-to-zero","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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"smallest-string-with-a-given-numeric-value","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"find-the-most-competitive-subsequence","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":0,"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":1,"articleSlug":"minimize-deviation-in-array","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":0,"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":0,"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":0,"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":1,"articleSlug":"max-number-of-k-sum-pairs","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":1,"articleSlug":"concatenation-of-consecutive-binary-numbers","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":0,"formTitle":"[1681]Minimum Incompatibility","frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"},{"articleLive":0,"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":0,"formTitle":"[1683]Invalid Tweets","frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","title":"Invalid Tweets","titleSlug":"invalid-tweets"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers","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":1,"articleSlug":"stone-game-vii","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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"maximum-erasure-value","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":1,"articleSlug":"jump-game-vi","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"determine-if-string-halves-are-alike","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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"maximum-units-on-a-truck","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":1,"articleSlug":"swapping-nodes-in-a-linked-list","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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1739]Building Boxes","frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","title":"Building Boxes","titleSlug":"building-boxes"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1816]Truncate Sentence","frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"","title":"Truncate Sentence","titleSlug":"truncate-sentence"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1826]Faulty Sensor","frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1841]League Statistics","frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","title":"League Statistics","titleSlug":"league-statistics"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1847]Closest Room","frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","title":"Closest Room","titleSlug":"closest-room"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1891]Cutting Ribbons","frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","title":"Cutting Ribbons","titleSlug":"cutting-ribbons"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1927]Sum Game","frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"","title":"Sum Game","titleSlug":"sum-game"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1934]Confirmation Rate","frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"articleLive":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"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":0,"formTitle":"[1949]Strong Friendship","frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","title":"Strong Friendship","titleSlug":"strong-friendship"}]
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/all.json b/src/leetcode/stack/leetcode/editor/en/doc/all.json
new file mode 100644
index 0000000..b655752
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/all.json
@@ -0,0 +1 @@
+[{"acceptance":0.48216434794772767,"acs":5890611,"articleLive":1,"articleSlug":"two-sum","columnArticles":1,"formTitle":"[1]Two Sum","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"","submitted":12217019,"title":"Two Sum","titleSlug":"two-sum"},{"acceptance":0.3780281613177669,"acs":2490493,"articleLive":1,"articleSlug":"add-two-numbers","columnArticles":1,"formTitle":"[2]Add Two Numbers","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"","submitted":6588115,"title":"Add Two Numbers","titleSlug":"add-two-numbers"},{"acceptance":0.32783372215177725,"acs":2942466,"articleLive":1,"articleSlug":"longest-substring-without-repeating-characters","columnArticles":1,"formTitle":"[3]Longest Substring Without Repeating Characters","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"","submitted":8975483,"title":"Longest Substring Without Repeating Characters","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.3357653010025325,"acs":1244686,"articleLive":0,"columnArticles":0,"formTitle":"[4]Median of Two Sorted Arrays","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"","submitted":3707012,"title":"Median of Two Sorted Arrays","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.31657207671279297,"acs":1674061,"articleLive":1,"articleSlug":"longest-palindromic-substring","columnArticles":1,"formTitle":"[5]Longest Palindromic Substring","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"","submitted":5288088,"title":"Longest Palindromic Substring","titleSlug":"longest-palindromic-substring"},{"acceptance":0.4083205952376147,"acs":708150,"articleLive":1,"articleSlug":"zigzag-conversion","columnArticles":1,"formTitle":"[6]Zigzag Conversion","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"","submitted":1734299,"title":"Zigzag Conversion","titleSlug":"zigzag-conversion"},{"acceptance":0.2646960026413825,"acs":1937683,"articleLive":1,"articleSlug":"reverse-integer","columnArticles":1,"formTitle":"[7]Reverse Integer","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"","submitted":7320409,"title":"Reverse Integer","titleSlug":"reverse-integer"},{"acceptance":0.1644251785087701,"acs":933447,"articleLive":1,"articleSlug":"string-to-integer-atoi","columnArticles":1,"formTitle":"[8]String to Integer (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":5677032,"title":"String to Integer (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5208277564085129,"acs":1819155,"articleLive":1,"articleSlug":"palindrome-number","columnArticles":1,"formTitle":"[9]Palindrome Number","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":3492815,"title":"Palindrome Number","titleSlug":"palindrome-number"},{"acceptance":0.28167561510233236,"acs":640465,"articleLive":1,"articleSlug":"regular-expression-matching","columnArticles":1,"formTitle":"[10]Regular Expression Matching","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"","submitted":2273768,"title":"Regular Expression Matching","titleSlug":"regular-expression-matching"},{"acceptance":0.5335748719125118,"acs":1286266,"articleLive":1,"articleSlug":"container-with-most-water","columnArticles":1,"formTitle":"[11]Container With Most Water","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"","submitted":2410657,"title":"Container With Most Water","titleSlug":"container-with-most-water"},{"acceptance":0.5895099980954221,"acs":628331,"articleLive":1,"articleSlug":"integer-to-roman","columnArticles":1,"formTitle":"[12]Integer to Roman","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"","submitted":1065853,"title":"Integer to Roman","titleSlug":"integer-to-roman"},{"acceptance":0.5781523690895459,"acs":1366477,"articleLive":1,"articleSlug":"roman-to-integer","columnArticles":1,"formTitle":"[13]Roman to Integer","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"","submitted":2363524,"title":"Roman to Integer","titleSlug":"roman-to-integer"},{"acceptance":0.38817360950485336,"acs":1411381,"articleLive":1,"articleSlug":"longest-common-prefix","columnArticles":1,"formTitle":"[14]Longest Common Prefix","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":3635953,"title":"Longest Common Prefix","titleSlug":"longest-common-prefix"},{"acceptance":0.3051241685062937,"acs":1749982,"articleLive":1,"articleSlug":"3sum","columnArticles":1,"formTitle":"[15]3Sum","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"","submitted":5735311,"title":"3Sum","titleSlug":"3sum"},{"acceptance":0.4700825570905847,"acs":742046,"articleLive":1,"articleSlug":"3sum-closest","columnArticles":1,"formTitle":"[16]3Sum Closest","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":1578544,"title":"3Sum Closest","titleSlug":"3sum-closest"},{"acceptance":0.5288148092650458,"acs":1079907,"articleLive":1,"articleSlug":"letter-combinations-of-a-phone-number","columnArticles":1,"formTitle":"[17]Letter Combinations of a Phone Number","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"","submitted":2042127,"title":"Letter Combinations of a Phone Number","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3698341784596191,"acs":538331,"articleLive":1,"articleSlug":"4sum","columnArticles":1,"formTitle":"[18]4Sum","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":1455601,"title":"4Sum","titleSlug":"4sum"},{"acceptance":0.37786449804495,"acs":1228753,"articleLive":1,"articleSlug":"remove-nth-node-from-end-of-list","columnArticles":1,"formTitle":"[19]Remove Nth Node From End of List","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"","submitted":3251835,"title":"Remove Nth Node From End of List","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4061031282937158,"acs":1947697,"articleLive":1,"articleSlug":"valid-parentheses","columnArticles":1,"formTitle":"[20]Valid Parentheses","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"","submitted":4796065,"title":"Valid Parentheses","titleSlug":"valid-parentheses"},{"acceptance":0.5924932587915888,"acs":1924379,"articleLive":1,"articleSlug":"merge-two-sorted-lists","columnArticles":1,"formTitle":"[21]Merge Two Sorted Lists","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"","submitted":3247934,"title":"Merge Two Sorted Lists","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.6926161545899792,"acs":969833,"articleLive":1,"articleSlug":"generate-parentheses","columnArticles":1,"formTitle":"[22]Generate Parentheses","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"","submitted":1400246,"title":"Generate Parentheses","titleSlug":"generate-parentheses"},{"acceptance":0.46347296416389977,"acs":1156778,"articleLive":1,"articleSlug":"merge-k-sorted-lists","columnArticles":1,"formTitle":"[23]Merge k Sorted Lists","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"","submitted":2495891,"title":"Merge k Sorted Lists","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.5699402161912189,"acs":766577,"articleLive":1,"articleSlug":"swap-nodes-in-pairs","columnArticles":1,"formTitle":"[24]Swap Nodes in Pairs","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"","submitted":1345013,"title":"Swap Nodes in Pairs","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.49985517020974135,"acs":467655,"articleLive":1,"articleSlug":"reverse-nodes-in-k-group","columnArticles":1,"formTitle":"[25]Reverse Nodes in k-Group","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"","submitted":935581,"title":"Reverse Nodes in k-Group","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.4817209507207024,"acs":1930186,"articleLive":1,"articleSlug":"remove-duplicates-from-sorted-array","columnArticles":1,"formTitle":"[26]Remove Duplicates from Sorted Array","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"","submitted":4006855,"title":"Remove Duplicates from Sorted Array","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5082078096157268,"acs":1151079,"articleLive":1,"articleSlug":"remove-element","columnArticles":1,"formTitle":"[27]Remove Element","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"","submitted":2264977,"title":"Remove Element","titleSlug":"remove-element"},{"acceptance":0.35657993712995123,"acs":1136268,"articleLive":0,"columnArticles":0,"formTitle":"[28]Implement strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"","submitted":3186573,"title":"Implement strStr()","titleSlug":"implement-strstr"},{"acceptance":0.17055735954464085,"acs":443414,"articleLive":1,"articleSlug":"divide-two-integers","columnArticles":1,"formTitle":"[29]Divide Two Integers","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":2599794,"title":"Divide Two Integers","titleSlug":"divide-two-integers"},{"acceptance":0.2770947181937085,"acs":240245,"articleLive":1,"articleSlug":"substring-with-concatenation-of-all-words","columnArticles":1,"formTitle":"[30]Substring with Concatenation of All Words","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"","submitted":867014,"title":"Substring with Concatenation of All Words","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.35239773056896023,"acs":694910,"articleLive":1,"articleSlug":"next-permutation","columnArticles":1,"formTitle":"[31]Next Permutation","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"","submitted":1971948,"title":"Next Permutation","titleSlug":"next-permutation"},{"acceptance":0.3102773304387284,"acs":453349,"articleLive":1,"articleSlug":"longest-valid-parentheses","columnArticles":1,"formTitle":"[32]Longest Valid Parentheses","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":1461109,"title":"Longest Valid Parentheses","titleSlug":"longest-valid-parentheses"},{"acceptance":0.37390884351472853,"acs":1323014,"articleLive":1,"articleSlug":"search-in-rotated-sorted-array","columnArticles":1,"formTitle":"[33]Search in Rotated Sorted Array","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"","submitted":3538333,"title":"Search in Rotated Sorted Array","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.3955814744067083,"acs":977466,"articleLive":1,"articleSlug":"find-first-and-last-position-of-element-in-sorted-array","columnArticles":1,"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":2470960,"title":"Find First and Last Position of Element in Sorted Array","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.42525734776381363,"acs":1238107,"articleLive":1,"articleSlug":"search-insert-position","columnArticles":1,"formTitle":"[35]Search Insert Position","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"","submitted":2911430,"title":"Search Insert Position","titleSlug":"search-insert-position"},{"acceptance":0.5431169114971037,"acs":661102,"articleLive":1,"articleSlug":"valid-sudoku","columnArticles":1,"formTitle":"[36]Valid Sudoku","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"","submitted":1217237,"title":"Valid Sudoku","titleSlug":"valid-sudoku"},{"acceptance":0.527670261486187,"acs":321462,"articleLive":1,"articleSlug":"sudoku-solver","columnArticles":1,"formTitle":"[37]Sudoku Solver","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":609210,"title":"Sudoku Solver","titleSlug":"sudoku-solver"},{"acceptance":0.4812580546528217,"acs":593383,"articleLive":0,"columnArticles":0,"formTitle":"[38]Count and Say","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":1232983,"title":"Count and Say","titleSlug":"count-and-say"},{"acceptance":0.6383552071452667,"acs":953718,"articleLive":1,"articleSlug":"combination-sum","columnArticles":1,"formTitle":"[39]Combination Sum","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"","submitted":1494024,"title":"Combination Sum","titleSlug":"combination-sum"},{"acceptance":0.5197812929553922,"acs":509355,"articleLive":1,"articleSlug":"combination-sum-ii","columnArticles":1,"formTitle":"[40]Combination Sum II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"","submitted":979941,"title":"Combination Sum II","titleSlug":"combination-sum-ii"},{"acceptance":0.35613733355165755,"acs":622043,"articleLive":1,"articleSlug":"first-missing-positive","columnArticles":1,"formTitle":"[41]First Missing Positive","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"","submitted":1746638,"title":"First Missing Positive","titleSlug":"first-missing-positive"},{"acceptance":0.555524413170934,"acs":1016778,"articleLive":1,"articleSlug":"trapping-rain-water","columnArticles":1,"formTitle":"[42]Trapping Rain Water","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"","submitted":1830303,"title":"Trapping Rain Water","titleSlug":"trapping-rain-water"},{"acceptance":0.3727371651348855,"acs":476127,"articleLive":1,"articleSlug":"multiply-strings","columnArticles":1,"formTitle":"[43]Multiply Strings","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"","submitted":1277380,"title":"Multiply Strings","titleSlug":"multiply-strings"},{"acceptance":0.2636431022809516,"acs":361364,"articleLive":1,"articleSlug":"wildcard-matching","columnArticles":1,"formTitle":"[44]Wildcard Matching","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":1370656,"title":"Wildcard Matching","titleSlug":"wildcard-matching"},{"acceptance":0.36288844670116815,"acs":535439,"articleLive":1,"articleSlug":"jump-game-ii","columnArticles":1,"formTitle":"[45]Jump Game II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"","submitted":1475492,"title":"Jump Game II","titleSlug":"jump-game-ii"},{"acceptance":0.7117187557826018,"acs":1057713,"articleLive":1,"articleSlug":"permutations","columnArticles":1,"formTitle":"[46]Permutations","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"","submitted":1486139,"title":"Permutations","titleSlug":"permutations"},{"acceptance":0.5321681076486078,"acs":564674,"articleLive":1,"articleSlug":"permutations-ii","columnArticles":1,"formTitle":"[47]Permutations II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"","submitted":1061082,"title":"Permutations II","titleSlug":"permutations-ii"},{"acceptance":0.6544330890400202,"acs":795896,"articleLive":1,"articleSlug":"rotate-image","columnArticles":1,"formTitle":"[48]Rotate Image","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"","submitted":1216161,"title":"Rotate Image","titleSlug":"rotate-image"},{"acceptance":0.6329018244147964,"acs":1219967,"articleLive":1,"articleSlug":"group-anagrams","columnArticles":1,"formTitle":"[49]Group Anagrams","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":1927577,"title":"Group Anagrams","titleSlug":"group-anagrams"},{"acceptance":0.3202476661775266,"acs":820577,"articleLive":1,"articleSlug":"powx-n","columnArticles":1,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"","submitted":2562320,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.5609071047889396,"acs":337099,"articleLive":1,"articleSlug":"n-queens","columnArticles":1,"formTitle":"[51]N-Queens","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"","submitted":600989,"title":"N-Queens","titleSlug":"n-queens"},{"acceptance":0.6532196551832824,"acs":207247,"articleLive":1,"articleSlug":"n-queens-ii","columnArticles":1,"formTitle":"[52]N-Queens II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":317270,"title":"N-Queens II","titleSlug":"n-queens-ii"},{"acceptance":0.4937478200606986,"acs":2056868,"articleLive":1,"articleSlug":"maximum-subarray","columnArticles":1,"formTitle":"[53]Maximum Subarray","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"","submitted":4165827,"title":"Maximum Subarray","titleSlug":"maximum-subarray"},{"acceptance":0.4038929751469866,"acs":663393,"articleLive":1,"articleSlug":"spiral-matrix","columnArticles":1,"formTitle":"[54]Spiral Matrix","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":1642497,"title":"Spiral Matrix","titleSlug":"spiral-matrix"},{"acceptance":0.3738277534864071,"acs":898138,"articleLive":1,"articleSlug":"jump-game","columnArticles":1,"formTitle":"[55]Jump Game","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"","submitted":2402545,"title":"Jump Game","titleSlug":"jump-game"},{"acceptance":0.4429856957555668,"acs":1278641,"articleLive":1,"articleSlug":"merge-intervals","columnArticles":1,"formTitle":"[56]Merge Intervals","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":2886416,"title":"Merge Intervals","titleSlug":"merge-intervals"},{"acceptance":0.37058839262485016,"acs":457239,"articleLive":1,"articleSlug":"insert-interval","columnArticles":1,"formTitle":"[57]Insert Interval","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":1233819,"title":"Insert Interval","titleSlug":"insert-interval"},{"acceptance":0.36395494422750274,"acs":665100,"articleLive":1,"articleSlug":"length-of-last-word","columnArticles":1,"formTitle":"[58]Length of Last Word","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":1827424,"title":"Length of Last Word","titleSlug":"length-of-last-word"},{"acceptance":0.6155409409791219,"acs":300163,"articleLive":1,"articleSlug":"spiral-matrix-ii","columnArticles":1,"formTitle":"[59]Spiral Matrix II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":487641,"title":"Spiral Matrix II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.4151857208024769,"acs":256662,"articleLive":1,"articleSlug":"permutation-sequence","columnArticles":1,"formTitle":"[60]Permutation Sequence","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":618186,"title":"Permutation Sequence","titleSlug":"permutation-sequence"},{"acceptance":0.33561260334793136,"acs":477125,"articleLive":1,"articleSlug":"rotate-list","columnArticles":1,"formTitle":"[61]Rotate List","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"","submitted":1421654,"title":"Rotate List","titleSlug":"rotate-list"},{"acceptance":0.5931914005426842,"acs":852594,"articleLive":1,"articleSlug":"unique-paths","columnArticles":1,"formTitle":"[62]Unique Paths","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"","submitted":1437300,"title":"Unique Paths","titleSlug":"unique-paths"},{"acceptance":0.37136249608027594,"acs":473710,"articleLive":1,"articleSlug":"unique-paths-ii","columnArticles":1,"formTitle":"[63]Unique Paths II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":1275600,"title":"Unique Paths II","titleSlug":"unique-paths-ii"},{"acceptance":0.5878725609288404,"acs":659138,"articleLive":1,"articleSlug":"minimum-path-sum","columnArticles":1,"formTitle":"[64]Minimum Path Sum","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"","submitted":1121226,"title":"Minimum Path Sum","titleSlug":"minimum-path-sum"},{"acceptance":0.17740361457524148,"acs":254863,"articleLive":1,"articleSlug":"valid-number","columnArticles":1,"formTitle":"[65]Valid Number","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"","submitted":1436628,"title":"Valid Number","titleSlug":"valid-number"},{"acceptance":0.42464104272800496,"acs":1087104,"articleLive":1,"articleSlug":"plus-one","columnArticles":1,"formTitle":"[66]Plus One","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"","submitted":2560054,"title":"Plus One","titleSlug":"plus-one"},{"acceptance":0.5001874089430007,"acs":779337,"articleLive":1,"articleSlug":"add-binary","columnArticles":1,"formTitle":"[67]Add Binary","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":1558090,"title":"Add Binary","titleSlug":"add-binary"},{"acceptance":0.3411991317028105,"acs":226026,"articleLive":0,"columnArticles":0,"formTitle":"[68]Text Justification","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":662446,"title":"Text Justification","titleSlug":"text-justification"},{"acceptance":0.36231297318328215,"acs":941467,"articleLive":1,"articleSlug":"sqrtx","columnArticles":1,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":2598491,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5063592558465192,"acs":1379871,"articleLive":1,"articleSlug":"climbing-stairs","columnArticles":1,"formTitle":"[70]Climbing Stairs","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"","submitted":2725083,"title":"Climbing Stairs","titleSlug":"climbing-stairs"},{"acceptance":0.3730899737245891,"acs":357678,"articleLive":1,"articleSlug":"simplify-path","columnArticles":1,"formTitle":"[71]Simplify Path","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"","submitted":958691,"title":"Simplify Path","titleSlug":"simplify-path"},{"acceptance":0.5004800424771794,"acs":437360,"articleLive":1,"articleSlug":"edit-distance","columnArticles":1,"formTitle":"[72]Edit Distance","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"","submitted":873881,"title":"Edit Distance","titleSlug":"edit-distance"},{"acceptance":0.475992000448573,"acs":611208,"articleLive":1,"articleSlug":"set-matrix-zeroes","columnArticles":1,"formTitle":"[73]Set Matrix Zeroes","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"","submitted":1284072,"title":"Set Matrix Zeroes","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4224226209908113,"acs":643100,"articleLive":1,"articleSlug":"search-a-2d-matrix","columnArticles":1,"formTitle":"[74]Search a 2D Matrix","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"","submitted":1522409,"title":"Search a 2D Matrix","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5385747139992924,"acs":913315,"articleLive":1,"articleSlug":"sort-colors","columnArticles":1,"formTitle":"[75]Sort Colors","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":1695800,"title":"Sort Colors","titleSlug":"sort-colors"},{"acceptance":0.3847495277622434,"acs":692119,"articleLive":1,"articleSlug":"minimum-window-substring","columnArticles":1,"formTitle":"[76]Minimum Window Substring","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":1798882,"title":"Minimum Window Substring","titleSlug":"minimum-window-substring"},{"acceptance":0.6266147078436386,"acs":475479,"articleLive":1,"articleSlug":"combinations","columnArticles":1,"formTitle":"[77]Combinations","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"","submitted":758806,"title":"Combinations","titleSlug":"combinations"},{"acceptance":0.6976001708135355,"acs":967088,"articleLive":1,"articleSlug":"subsets","columnArticles":1,"formTitle":"[78]Subsets","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"","submitted":1386307,"title":"Subsets","titleSlug":"subsets"},{"acceptance":0.39321303311825656,"acs":881214,"articleLive":1,"articleSlug":"word-search","columnArticles":1,"formTitle":"[79]Word Search","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"","submitted":2241060,"title":"Word Search","titleSlug":"word-search"},{"acceptance":0.4993744967652895,"acs":409956,"articleLive":1,"articleSlug":"remove-duplicates-from-sorted-array-ii","columnArticles":1,"formTitle":"[80]Remove Duplicates from Sorted Array II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"","submitted":820939,"title":"Remove Duplicates from Sorted Array II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.34376034222816026,"acs":364585,"articleLive":1,"articleSlug":"search-in-rotated-sorted-array-ii","columnArticles":1,"formTitle":"[81]Search in Rotated Sorted Array II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"","submitted":1060579,"title":"Search in Rotated Sorted Array II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.42235435363266904,"acs":414760,"articleLive":1,"articleSlug":"remove-duplicates-from-sorted-list-ii","columnArticles":1,"formTitle":"[82]Remove Duplicates from Sorted List II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"","submitted":982019,"title":"Remove Duplicates from Sorted List II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.48510766045677606,"acs":778868,"articleLive":1,"articleSlug":"remove-duplicates-from-sorted-list","columnArticles":1,"formTitle":"[83]Remove Duplicates from Sorted List","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"","submitted":1605557,"title":"Remove Duplicates from Sorted List","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4024739637882699,"acs":470742,"articleLive":1,"articleSlug":"largest-rectangle-in-histogram","columnArticles":1,"formTitle":"[84]Largest Rectangle in Histogram","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"","submitted":1169621,"title":"Largest Rectangle in Histogram","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.4223612445462298,"acs":281799,"articleLive":1,"articleSlug":"maximal-rectangle","columnArticles":1,"formTitle":"[85]Maximal Rectangle","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"","submitted":667199,"title":"Maximal Rectangle","titleSlug":"maximal-rectangle"},{"acceptance":0.47239381929624696,"acs":323851,"articleLive":1,"articleSlug":"partition-list","columnArticles":1,"formTitle":"[86]Partition List","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"","submitted":685553,"title":"Partition List","titleSlug":"partition-list"},{"acceptance":0.3542446474023057,"acs":139594,"articleLive":0,"columnArticles":0,"formTitle":"[87]Scramble String","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"","submitted":394061,"title":"Scramble String","titleSlug":"scramble-string"},{"acceptance":0.431657441925596,"acs":1228406,"articleLive":1,"articleSlug":"merge-sorted-array","columnArticles":1,"formTitle":"[88]Merge Sorted Array","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"","submitted":2845789,"title":"Merge Sorted Array","titleSlug":"merge-sorted-array"},{"acceptance":0.5477933958216683,"acs":225996,"articleLive":1,"articleSlug":"gray-code","columnArticles":1,"formTitle":"[89]Gray Code","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"","submitted":412557,"title":"Gray Code","titleSlug":"gray-code"},{"acceptance":0.5240928554816291,"acs":459707,"articleLive":1,"articleSlug":"subsets-ii","columnArticles":1,"formTitle":"[90]Subsets II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"","submitted":877148,"title":"Subsets II","titleSlug":"subsets-ii"},{"acceptance":0.29622894126208965,"acs":723719,"articleLive":1,"articleSlug":"decode-ways","columnArticles":1,"formTitle":"[91]Decode Ways","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"","submitted":2443107,"title":"Decode Ways","titleSlug":"decode-ways"},{"acceptance":0.4298174292261069,"acs":447755,"articleLive":1,"articleSlug":"reverse-linked-list-ii","columnArticles":1,"formTitle":"[92]Reverse Linked List II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"","submitted":1041733,"title":"Reverse Linked List II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.4100420905047661,"acs":281931,"articleLive":1,"articleSlug":"restore-ip-addresses","columnArticles":1,"formTitle":"[93]Restore IP Addresses","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"","submitted":687566,"title":"Restore IP Addresses","titleSlug":"restore-ip-addresses"},{"acceptance":0.6989507152536475,"acs":1325581,"articleLive":1,"articleSlug":"binary-tree-inorder-traversal","columnArticles":1,"formTitle":"[94]Binary Tree Inorder Traversal","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"","submitted":1896530,"title":"Binary Tree Inorder Traversal","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.4851709112488373,"acs":291055,"articleLive":1,"articleSlug":"unique-binary-search-trees-ii","columnArticles":1,"formTitle":"[95]Unique Binary Search Trees II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":599902,"title":"Unique Binary Search Trees II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.5777807115310892,"acs":455156,"articleLive":1,"articleSlug":"unique-binary-search-trees","columnArticles":1,"formTitle":"[96]Unique Binary Search Trees","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":787766,"title":"Unique Binary Search Trees","titleSlug":"unique-binary-search-trees"},{"acceptance":0.34429237550241465,"acs":248241,"articleLive":1,"articleSlug":"interleaving-string","columnArticles":1,"formTitle":"[97]Interleaving String","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":721018,"title":"Interleaving String","titleSlug":"interleaving-string"},{"acceptance":0.3016638652921508,"acs":1277135,"articleLive":1,"articleSlug":"validate-binary-search-tree","columnArticles":1,"formTitle":"[98]Validate Binary Search Tree","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"","submitted":4233636,"title":"Validate Binary Search Tree","titleSlug":"validate-binary-search-tree"},{"acceptance":0.4567611037637075,"acs":265243,"articleLive":1,"articleSlug":"recover-binary-search-tree","columnArticles":1,"formTitle":"[99]Recover Binary Search Tree","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":580704,"title":"Recover Binary Search Tree","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5518369573027725,"acs":936943,"articleLive":1,"articleSlug":"same-tree","columnArticles":1,"formTitle":"[100]Same Tree","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":1697862,"title":"Same Tree","titleSlug":"same-tree"},{"acceptance":0.5098506521258038,"acs":1138108,"articleLive":1,"articleSlug":"symmetric-tree","columnArticles":1,"formTitle":"[101]Symmetric Tree","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":2232238,"title":"Symmetric Tree","titleSlug":"symmetric-tree"},{"acceptance":0.6012466095550125,"acs":1119431,"articleLive":1,"articleSlug":"binary-tree-level-order-traversal","columnArticles":1,"formTitle":"[102]Binary Tree Level Order Traversal","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"","submitted":1861850,"title":"Binary Tree Level Order Traversal","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5287388133934836,"acs":649544,"articleLive":1,"articleSlug":"binary-tree-zigzag-level-order-traversal","columnArticles":1,"formTitle":"[103]Binary Tree Zigzag Level Order Traversal","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"","submitted":1228478,"title":"Binary Tree Zigzag Level Order Traversal","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7091868460028659,"acs":1472396,"articleLive":1,"articleSlug":"maximum-depth-of-binary-tree","columnArticles":1,"formTitle":"[104]Maximum Depth of Binary Tree","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":2076175,"title":"Maximum Depth of Binary Tree","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.5660692479302315,"acs":648044,"articleLive":1,"articleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal","columnArticles":1,"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":1144814,"title":"Construct Binary Tree from Preorder and Inorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.5449241166360803,"acs":374134,"articleLive":1,"articleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal","columnArticles":1,"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":686580,"title":"Construct Binary Tree from Inorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.5795237880858198,"acs":476288,"articleLive":1,"articleSlug":"binary-tree-level-order-traversal-ii","columnArticles":1,"formTitle":"[107]Binary Tree Level Order Traversal II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":821861,"title":"Binary Tree Level Order Traversal II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.6517425593867695,"acs":686485,"articleLive":1,"articleSlug":"convert-sorted-array-to-binary-search-tree","columnArticles":1,"formTitle":"[108]Convert Sorted Array to Binary Search Tree","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"","submitted":1053307,"title":"Convert Sorted Array to Binary Search Tree","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.5472395265954906,"acs":355159,"articleLive":1,"articleSlug":"convert-sorted-list-to-binary-search-tree","columnArticles":1,"formTitle":"[109]Convert Sorted List to Binary Search Tree","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"","submitted":649001,"title":"Convert Sorted List to Binary Search Tree","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.46310871090285777,"acs":699748,"articleLive":1,"articleSlug":"balanced-binary-tree","columnArticles":1,"formTitle":"[110]Balanced Binary Tree","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"","submitted":1510980,"title":"Balanced Binary Tree","titleSlug":"balanced-binary-tree"},{"acceptance":0.41954510004351553,"acs":696100,"articleLive":1,"articleSlug":"minimum-depth-of-binary-tree","columnArticles":1,"formTitle":"[111]Minimum Depth of Binary Tree","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":1659178,"title":"Minimum Depth of Binary Tree","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.44885153000436007,"acs":800919,"articleLive":1,"articleSlug":"path-sum","columnArticles":1,"formTitle":"[112]Path Sum","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":1784374,"title":"Path Sum","titleSlug":"path-sum"},{"acceptance":0.5323374789995551,"acs":539614,"articleLive":1,"articleSlug":"path-sum-ii","columnArticles":1,"formTitle":"[113]Path Sum II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":1013669,"title":"Path Sum II","titleSlug":"path-sum-ii"},{"acceptance":0.568601787120242,"acs":562582,"articleLive":1,"articleSlug":"flatten-binary-tree-to-linked-list","columnArticles":1,"formTitle":"[114]Flatten Binary Tree to Linked List","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":989413,"title":"Flatten Binary Tree to Linked List","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.41939841937002,"acs":206750,"articleLive":1,"articleSlug":"distinct-subsequences","columnArticles":1,"formTitle":"[115]Distinct Subsequences","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":492968,"title":"Distinct Subsequences","titleSlug":"distinct-subsequences"},{"acceptance":0.5563840721816193,"acs":676094,"articleLive":1,"articleSlug":"populating-next-right-pointers-in-each-node","columnArticles":1,"formTitle":"[116]Populating Next Right Pointers in Each Node","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"","submitted":1215157,"title":"Populating Next Right Pointers in Each Node","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.4567406680512521,"acs":407726,"articleLive":1,"articleSlug":"populating-next-right-pointers-in-each-node-ii","columnArticles":1,"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":892686,"title":"Populating Next Right Pointers in Each Node II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.626846336017563,"acs":703546,"articleLive":1,"articleSlug":"pascals-triangle","columnArticles":1,"formTitle":"[118]Pascal's Triangle","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"","submitted":1122358,"title":"Pascal's Triangle","titleSlug":"pascals-triangle"},{"acceptance":0.5641613225967632,"acs":477606,"articleLive":1,"articleSlug":"pascals-triangle-ii","columnArticles":1,"formTitle":"[119]Pascal's Triangle II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"","submitted":846577,"title":"Pascal's Triangle II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.49844433590974047,"acs":385769,"articleLive":1,"articleSlug":"triangle","columnArticles":1,"formTitle":"[120]Triangle","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"","submitted":773946,"title":"Triangle","titleSlug":"triangle"},{"acceptance":0.5375659773700052,"acs":1906875,"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock","columnArticles":1,"formTitle":"[121]Best Time to Buy and Sell Stock","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"","submitted":3547239,"title":"Best Time to Buy and Sell Stock","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6140717764298492,"acs":1068254,"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock-ii","columnArticles":1,"formTitle":"[122]Best Time to Buy and Sell Stock II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"","submitted":1739624,"title":"Best Time to Buy and Sell Stock II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.42669529190743555,"acs":359539,"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock-iii","columnArticles":1,"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":842613,"title":"Best Time to Buy and Sell Stock III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.372800018740452,"acs":668398,"articleLive":1,"articleSlug":"binary-tree-maximum-path-sum","columnArticles":1,"formTitle":"[124]Binary Tree Maximum Path Sum","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"","submitted":1792913,"title":"Binary Tree Maximum Path Sum","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.40783330764181536,"acs":1127071,"articleLive":1,"articleSlug":"valid-palindrome","columnArticles":1,"formTitle":"[125]Valid Palindrome","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":2763558,"title":"Valid Palindrome","titleSlug":"valid-palindrome"},{"acceptance":0.2647250651737744,"acs":276814,"articleLive":1,"articleSlug":"word-ladder-ii","columnArticles":1,"formTitle":"[126]Word Ladder II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":1045666,"title":"Word Ladder II","titleSlug":"word-ladder-ii"},{"acceptance":0.3437077398597889,"acs":695892,"articleLive":1,"articleSlug":"word-ladder","columnArticles":1,"formTitle":"[127]Word Ladder","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":2024662,"title":"Word Ladder","titleSlug":"word-ladder"},{"acceptance":0.4838169185419324,"acs":590216,"articleLive":1,"articleSlug":"longest-consecutive-sequence","columnArticles":1,"formTitle":"[128]Longest Consecutive Sequence","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":1219916,"title":"Longest Consecutive Sequence","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.5597482632306916,"acs":428166,"articleLive":1,"articleSlug":"sum-root-to-leaf-numbers","columnArticles":1,"formTitle":"[129]Sum Root to Leaf Numbers","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":764926,"title":"Sum Root to Leaf Numbers","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.3330815287096032,"acs":386692,"articleLive":1,"articleSlug":"surrounded-regions","columnArticles":1,"formTitle":"[130]Surrounded Regions","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"","submitted":1160953,"title":"Surrounded Regions","titleSlug":"surrounded-regions"},{"acceptance":0.5840098418082238,"acs":420125,"articleLive":1,"articleSlug":"palindrome-partitioning","columnArticles":1,"formTitle":"[131]Palindrome Partitioning","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":719380,"title":"Palindrome Partitioning","titleSlug":"palindrome-partitioning"},{"acceptance":0.33015695920075055,"acs":195306,"articleLive":1,"articleSlug":"palindrome-partitioning-ii","columnArticles":1,"formTitle":"[132]Palindrome Partitioning II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":591555,"title":"Palindrome Partitioning II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.4522201363098396,"acs":620522,"articleLive":1,"articleSlug":"clone-graph","columnArticles":1,"formTitle":"[133]Clone Graph","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"","submitted":1372168,"title":"Clone Graph","titleSlug":"clone-graph"},{"acceptance":0.4424833388850971,"acs":379910,"articleLive":1,"articleSlug":"gas-station","columnArticles":1,"formTitle":"[134]Gas Station","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"","submitted":858586,"title":"Gas Station","titleSlug":"gas-station"},{"acceptance":0.3653015513193152,"acs":202723,"articleLive":1,"articleSlug":"candy","columnArticles":1,"formTitle":"[135]Candy","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":554947,"title":"Candy","titleSlug":"candy"},{"acceptance":0.6846653244012575,"acs":1469376,"articleLive":1,"articleSlug":"single-number","columnArticles":1,"formTitle":"[136]Single Number","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"","submitted":2146123,"title":"Single Number","titleSlug":"single-number"},{"acceptance":0.5606030451637486,"acs":329569,"articleLive":1,"articleSlug":"single-number-ii","columnArticles":1,"formTitle":"[137]Single Number II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"","submitted":587883,"title":"Single Number II","titleSlug":"single-number-ii"},{"acceptance":0.46038819841135487,"acs":701662,"articleLive":1,"articleSlug":"copy-list-with-random-pointer","columnArticles":1,"formTitle":"[138]Copy List with Random Pointer","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"","submitted":1524066,"title":"Copy List with Random Pointer","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.44040991288281717,"acs":988275,"articleLive":1,"articleSlug":"word-break","columnArticles":1,"formTitle":"[139]Word Break","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"","submitted":2243989,"title":"Word Break","titleSlug":"word-break"},{"acceptance":0.4093061004989259,"acs":414043,"articleLive":1,"articleSlug":"word-break-ii","columnArticles":1,"formTitle":"[140]Word Break II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":1011573,"title":"Word Break II","titleSlug":"word-break-ii"},{"acceptance":0.44949424993748954,"acs":1249385,"articleLive":1,"articleSlug":"linked-list-cycle","columnArticles":1,"formTitle":"[141]Linked List Cycle","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"","submitted":2779535,"title":"Linked List Cycle","titleSlug":"linked-list-cycle"},{"acceptance":0.43574111012346517,"acs":614727,"articleLive":1,"articleSlug":"linked-list-cycle-ii","columnArticles":1,"formTitle":"[142]Linked List Cycle II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"","submitted":1410762,"title":"Linked List Cycle II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.4652208385107068,"acs":436553,"articleLive":1,"articleSlug":"reorder-list","columnArticles":1,"formTitle":"[143]Reorder List","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"","submitted":938378,"title":"Reorder List","titleSlug":"reorder-list"},{"acceptance":0.6152621603818285,"acs":851828,"articleLive":1,"articleSlug":"binary-tree-preorder-traversal","columnArticles":1,"formTitle":"[144]Binary Tree Preorder Traversal","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"","submitted":1384496,"title":"Binary Tree Preorder Traversal","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.6282215691599108,"acs":650073,"articleLive":0,"columnArticles":0,"formTitle":"[145]Binary Tree Postorder Traversal","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"","submitted":1034783,"title":"Binary Tree Postorder Traversal","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.39176906211079265,"acs":979530,"articleLive":1,"articleSlug":"lru-cache","columnArticles":1,"formTitle":"[146]LRU Cache","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":2500274,"title":"LRU Cache","titleSlug":"lru-cache"},{"acceptance":0.4828932358633006,"acs":274731,"articleLive":1,"articleSlug":"insertion-sort-list","columnArticles":1,"formTitle":"[147]Insertion Sort List","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"","submitted":568927,"title":"Insertion Sort List","titleSlug":"insertion-sort-list"},{"acceptance":0.4992168098442231,"acs":428980,"articleLive":1,"articleSlug":"sort-list","columnArticles":1,"formTitle":"[148]Sort List","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"","submitted":859306,"title":"Sort List","titleSlug":"sort-list"},{"acceptance":0.19858658667457796,"acs":216878,"articleLive":1,"articleSlug":"max-points-on-a-line","columnArticles":1,"formTitle":"[149]Max Points on a Line","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"","submitted":1092108,"title":"Max Points on a Line","titleSlug":"max-points-on-a-line"},{"acceptance":0.41508316772384507,"acs":365934,"articleLive":1,"articleSlug":"evaluate-reverse-polish-notation","columnArticles":1,"formTitle":"[150]Evaluate Reverse Polish Notation","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"","submitted":881592,"title":"Evaluate Reverse Polish Notation","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.27682749327618317,"acs":658636,"articleLive":1,"articleSlug":"reverse-words-in-a-string","columnArticles":1,"formTitle":"[151]Reverse Words in a String","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":2379229,"title":"Reverse Words in a String","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.3433688292030251,"acs":666471,"articleLive":1,"articleSlug":"maximum-product-subarray","columnArticles":1,"formTitle":"[152]Maximum Product Subarray","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":1940977,"title":"Maximum Product Subarray","titleSlug":"maximum-product-subarray"},{"acceptance":0.476624423136148,"acs":823342,"articleLive":1,"articleSlug":"find-minimum-in-rotated-sorted-array","columnArticles":1,"formTitle":"[153]Find Minimum in Rotated Sorted Array","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"","submitted":1727444,"title":"Find Minimum in Rotated Sorted Array","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.4320944384478649,"acs":309444,"articleLive":1,"articleSlug":"find-minimum-in-rotated-sorted-array-ii","columnArticles":1,"formTitle":"[154]Find Minimum in Rotated Sorted Array II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"","submitted":716149,"title":"Find Minimum in Rotated Sorted Array II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.4951726387859507,"acs":904620,"articleLive":1,"articleSlug":"min-stack","columnArticles":1,"formTitle":"[155]Min Stack","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"","submitted":1826878,"title":"Min Stack","titleSlug":"min-stack"},{"acceptance":0.5938513454290473,"acs":81303,"articleLive":0,"columnArticles":0,"formTitle":"[156]Binary Tree Upside Down","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":136908,"title":"Binary Tree Upside Down","titleSlug":"binary-tree-upside-down"},{"acceptance":0.39939858114245036,"acs":162703,"articleLive":1,"articleSlug":"read-n-characters-given-read4","columnArticles":1,"formTitle":"[157]Read N Characters Given Read4","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":407370,"title":"Read N Characters Given Read4","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.4030490987498543,"acs":159073,"articleLive":0,"columnArticles":0,"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":394674,"title":"Read N Characters Given read4 II - Call Multiple Times","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5227410993156566,"acs":179583,"articleLive":1,"articleSlug":"longest-substring-with-at-most-two-distinct-characters","columnArticles":1,"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":343541,"title":"Longest Substring with At Most Two Distinct Characters","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.48821648504451387,"acs":859158,"articleLive":1,"articleSlug":"intersection-of-two-linked-lists","columnArticles":1,"formTitle":"[160]Intersection of Two Linked Lists","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"","submitted":1759789,"title":"Intersection of Two Linked Lists","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3384322204261814,"acs":164983,"articleLive":1,"articleSlug":"one-edit-distance","columnArticles":1,"formTitle":"[161]One Edit Distance","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":487492,"title":"One Edit Distance","titleSlug":"one-edit-distance"},{"acceptance":0.4557063255401332,"acs":703745,"articleLive":1,"articleSlug":"find-peak-element","columnArticles":1,"formTitle":"[162]Find Peak Element","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"","submitted":1544295,"title":"Find Peak Element","titleSlug":"find-peak-element"},{"acceptance":0.30779748952013347,"acs":157572,"articleLive":1,"articleSlug":"missing-ranges","columnArticles":1,"formTitle":"[163]Missing Ranges","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":511934,"title":"Missing Ranges","titleSlug":"missing-ranges"},{"acceptance":0.40954408525624114,"acs":133504,"articleLive":1,"articleSlug":"maximum-gap","columnArticles":1,"formTitle":"[164]Maximum Gap","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":325982,"title":"Maximum Gap","titleSlug":"maximum-gap"},{"acceptance":0.3244809993903548,"acs":273042,"articleLive":1,"articleSlug":"compare-version-numbers","columnArticles":1,"formTitle":"[165]Compare Version Numbers","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":841473,"title":"Compare Version Numbers","titleSlug":"compare-version-numbers"},{"acceptance":0.23341010815119306,"acs":175115,"articleLive":1,"articleSlug":"fraction-to-recurring-decimal","columnArticles":1,"formTitle":"[166]Fraction to Recurring Decimal","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":750246,"title":"Fraction to Recurring Decimal","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5811508915697959,"acs":840794,"articleLive":1,"articleSlug":"two-sum-ii-input-array-is-sorted","columnArticles":1,"formTitle":"[167]Two Sum II - Input Array Is Sorted","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":2,"nodeType":"def","questionId":"167","status":"","submitted":1446774,"title":"Two Sum II - Input Array Is Sorted","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.33412130833897646,"acs":296535,"articleLive":0,"columnArticles":0,"formTitle":"[168]Excel Sheet Column Title","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"","submitted":887507,"title":"Excel Sheet Column Title","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6201131450648515,"acs":1078600,"articleLive":1,"articleSlug":"majority-element","columnArticles":1,"formTitle":"[169]Majority Element","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":1739360,"title":"Majority Element","titleSlug":"majority-element"},{"acceptance":0.3643217469846205,"acs":118586,"articleLive":1,"articleSlug":"two-sum-iii-data-structure-design","columnArticles":1,"formTitle":"[170]Two Sum III - Data structure design","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":325498,"title":"Two Sum III - Data structure design","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.5895948271069791,"acs":434848,"articleLive":1,"articleSlug":"excel-sheet-column-number","columnArticles":1,"formTitle":"[171]Excel Sheet Column Number","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"","submitted":737537,"title":"Excel Sheet Column Number","titleSlug":"excel-sheet-column-number"},{"acceptance":0.40376397794042534,"acs":304348,"articleLive":1,"articleSlug":"factorial-trailing-zeroes","columnArticles":1,"formTitle":"[172]Factorial Trailing Zeroes","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":753777,"title":"Factorial Trailing Zeroes","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.6469784167983509,"acs":497452,"articleLive":1,"articleSlug":"binary-search-tree-iterator","columnArticles":1,"formTitle":"[173]Binary Search Tree Iterator","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"","submitted":768885,"title":"Binary Search Tree Iterator","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.3611443588101495,"acs":163537,"articleLive":1,"articleSlug":"dungeon-game","columnArticles":1,"formTitle":"[174]Dungeon Game","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":452830,"title":"Dungeon Game","titleSlug":"dungeon-game"},{"acceptance":0.6901234305020264,"acs":486154,"articleLive":1,"articleSlug":"combine-two-tables","columnArticles":1,"formTitle":"[175]Combine Two Tables","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":704445,"title":"Combine Two Tables","titleSlug":"combine-two-tables"},{"acceptance":0.34983175228641744,"acs":433423,"articleLive":1,"articleSlug":"second-highest-salary","columnArticles":1,"formTitle":"[176]Second Highest Salary","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":1238947,"title":"Second Highest Salary","titleSlug":"second-highest-salary"},{"acceptance":0.3563807712542603,"acs":218120,"articleLive":0,"columnArticles":0,"formTitle":"[177]Nth Highest Salary","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":612042,"title":"Nth Highest Salary","titleSlug":"nth-highest-salary"},{"acceptance":0.562105955365583,"acs":205149,"articleLive":0,"columnArticles":0,"formTitle":"[178]Rank Scores","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":364965,"title":"Rank Scores","titleSlug":"rank-scores"},{"acceptance":0.3240733552951673,"acs":296403,"articleLive":1,"articleSlug":"largest-number","columnArticles":1,"formTitle":"[179]Largest Number","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"","submitted":914617,"title":"Largest Number","titleSlug":"largest-number"},{"acceptance":0.4511784511784512,"acs":171654,"articleLive":1,"articleSlug":"consecutive-numbers","columnArticles":1,"formTitle":"[180]Consecutive Numbers","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":380457,"title":"Consecutive Numbers","titleSlug":"consecutive-numbers"},{"acceptance":0.6537060273629934,"acs":324046,"articleLive":1,"articleSlug":"employees-earning-more-than-their-managers","columnArticles":1,"formTitle":"[181]Employees Earning More Than Their Managers","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":495706,"title":"Employees Earning More Than Their Managers","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.6817797629565917,"acs":320234,"articleLive":1,"articleSlug":"duplicate-emails","columnArticles":1,"formTitle":"[182]Duplicate Emails","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":469703,"title":"Duplicate Emails","titleSlug":"duplicate-emails"},{"acceptance":0.6168189876389305,"acs":304790,"articleLive":1,"articleSlug":"customers-who-never-order","columnArticles":1,"formTitle":"[183]Customers Who Never Order","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":494132,"title":"Customers Who Never Order","titleSlug":"customers-who-never-order"},{"acceptance":0.45487847069118736,"acs":201165,"articleLive":1,"articleSlug":"department-highest-salary","columnArticles":1,"formTitle":"[184]Department Highest Salary","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":442239,"title":"Department Highest Salary","titleSlug":"department-highest-salary"},{"acceptance":0.45630500653602646,"acs":151496,"articleLive":1,"articleSlug":"department-top-three-salaries","columnArticles":1,"formTitle":"[185]Department Top Three Salaries","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":332006,"title":"Department Top Three Salaries","titleSlug":"department-top-three-salaries"},{"acceptance":0.5022816437317024,"acs":127131,"articleLive":1,"articleSlug":"reverse-words-in-a-string-ii","columnArticles":1,"formTitle":"[186]Reverse Words in a String II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":253107,"title":"Reverse Words in a String II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.43937518482905413,"acs":248120,"articleLive":1,"articleSlug":"repeated-dna-sequences","columnArticles":1,"formTitle":"[187]Repeated DNA Sequences","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":564711,"title":"Repeated DNA Sequences","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3285843682870066,"acs":227453,"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock-iv","columnArticles":1,"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":692221,"title":"Best Time to Buy and Sell Stock IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.3823981628048769,"acs":994088,"articleLive":1,"articleSlug":"rotate-array","columnArticles":1,"formTitle":"[189]Rotate Array","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"","submitted":2599615,"title":"Rotate Array","titleSlug":"rotate-array"},{"acceptance":0.4742210037215653,"acs":430697,"articleLive":1,"articleSlug":"reverse-bits","columnArticles":1,"formTitle":"[190]Reverse Bits","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"","submitted":908220,"title":"Reverse Bits","titleSlug":"reverse-bits"},{"acceptance":0.5870970258917773,"acs":632044,"articleLive":1,"articleSlug":"number-of-1-bits","columnArticles":1,"formTitle":"[191]Number of 1 Bits","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"","submitted":1076558,"title":"Number of 1 Bits","titleSlug":"number-of-1-bits"},{"acceptance":0.25553237410071944,"acs":35519,"articleLive":0,"columnArticles":0,"formTitle":"[192]Word Frequency","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":139000,"title":"Word Frequency","titleSlug":"word-frequency"},{"acceptance":0.2577865493814888,"acs":53161,"articleLive":0,"columnArticles":0,"formTitle":"[193]Valid Phone Numbers","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":206221,"title":"Valid Phone Numbers","titleSlug":"valid-phone-numbers"},{"acceptance":0.2493810140115919,"acs":17727,"articleLive":0,"columnArticles":0,"formTitle":"[194]Transpose File","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":71084,"title":"Transpose File","titleSlug":"transpose-file"},{"acceptance":0.3277308571695208,"acs":70236,"articleLive":0,"columnArticles":0,"formTitle":"[195]Tenth Line","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":214310,"title":"Tenth Line","titleSlug":"tenth-line"},{"acceptance":0.5058917222076175,"acs":196287,"articleLive":1,"articleSlug":"delete-duplicate-emails","columnArticles":1,"formTitle":"[196]Delete Duplicate Emails","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":388002,"title":"Delete Duplicate Emails","titleSlug":"delete-duplicate-emails"},{"acceptance":0.4198231495528793,"acs":201733,"articleLive":1,"articleSlug":"rising-temperature","columnArticles":1,"formTitle":"[197]Rising Temperature","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":480519,"title":"Rising Temperature","titleSlug":"rising-temperature"},{"acceptance":0.4635176412850548,"acs":1007749,"articleLive":1,"articleSlug":"house-robber","columnArticles":1,"formTitle":"[198]House Robber","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"","submitted":2174133,"title":"House Robber","titleSlug":"house-robber"},{"acceptance":0.5899383142595382,"acs":607863,"articleLive":1,"articleSlug":"binary-tree-right-side-view","columnArticles":1,"formTitle":"[199]Binary Tree Right Side View","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"","submitted":1030384,"title":"Binary Tree Right Side View","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5299590294855104,"acs":1406825,"articleLive":1,"articleSlug":"number-of-islands","columnArticles":1,"formTitle":"[200]Number of Islands","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"","submitted":2654592,"title":"Number of Islands","titleSlug":"number-of-islands"},{"acceptance":0.41515881866254184,"acs":207738,"articleLive":1,"articleSlug":"bitwise-and-of-numbers-range","columnArticles":1,"formTitle":"[201]Bitwise AND of Numbers Range","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"","submitted":500382,"title":"Bitwise AND of Numbers Range","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.5269887917521524,"acs":746692,"articleLive":1,"articleSlug":"happy-number","columnArticles":1,"formTitle":"[202]Happy Number","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"","submitted":1416903,"title":"Happy Number","titleSlug":"happy-number"},{"acceptance":0.4280963473493262,"acs":641198,"articleLive":1,"articleSlug":"remove-linked-list-elements","columnArticles":1,"formTitle":"[203]Remove Linked List Elements","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"","submitted":1497789,"title":"Remove Linked List Elements","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3291613349787567,"acs":578268,"articleLive":1,"articleSlug":"count-primes","columnArticles":1,"formTitle":"[204]Count Primes","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":1756792,"title":"Count Primes","titleSlug":"count-primes"},{"acceptance":0.41865192985353544,"acs":466431,"articleLive":1,"articleSlug":"isomorphic-strings","columnArticles":1,"formTitle":"[205]Isomorphic Strings","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"","submitted":1114126,"title":"Isomorphic Strings","titleSlug":"isomorphic-strings"},{"acceptance":0.693536939071468,"acs":1901473,"articleLive":1,"articleSlug":"reverse-linked-list","columnArticles":1,"formTitle":"[206]Reverse Linked List","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"","submitted":2741704,"title":"Reverse Linked List","titleSlug":"reverse-linked-list"},{"acceptance":0.44868356034644474,"acs":784525,"articleLive":1,"articleSlug":"course-schedule","columnArticles":1,"formTitle":"[207]Course Schedule","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":1748504,"title":"Course Schedule","titleSlug":"course-schedule"},{"acceptance":0.5706148517642236,"acs":534447,"articleLive":1,"articleSlug":"implement-trie-prefix-tree","columnArticles":1,"formTitle":"[208]Implement Trie (Prefix Tree)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"","submitted":936616,"title":"Implement Trie (Prefix Tree)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4250377846983065,"acs":469362,"articleLive":1,"articleSlug":"minimum-size-subarray-sum","columnArticles":1,"formTitle":"[209]Minimum Size Subarray Sum","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"","submitted":1104283,"title":"Minimum Size Subarray Sum","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.45916037310236213,"acs":563837,"articleLive":1,"articleSlug":"course-schedule-ii","columnArticles":1,"formTitle":"[210]Course Schedule II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":1227974,"title":"Course Schedule II","titleSlug":"course-schedule-ii"},{"acceptance":0.4400048338255153,"acs":375028,"articleLive":1,"articleSlug":"design-add-and-search-words-data-structure","columnArticles":1,"formTitle":"[211]Design Add and Search Words Data Structure","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":852327,"title":"Design Add and Search Words Data Structure","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.3838434444066254,"acs":401468,"articleLive":1,"articleSlug":"word-search-ii","columnArticles":1,"formTitle":"[212]Word Search II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":1045916,"title":"Word Search II","titleSlug":"word-search-ii"},{"acceptance":0.3941969509364754,"acs":347336,"articleLive":1,"articleSlug":"house-robber-ii","columnArticles":1,"formTitle":"[213]House Robber II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"","submitted":881123,"title":"House Robber II","titleSlug":"house-robber-ii"},{"acceptance":0.3162519466368383,"acs":131187,"articleLive":1,"articleSlug":"shortest-palindrome","columnArticles":1,"formTitle":"[214]Shortest Palindrome","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":414818,"title":"Shortest Palindrome","titleSlug":"shortest-palindrome"},{"acceptance":0.6251530024812066,"acs":1187465,"articleLive":1,"articleSlug":"kth-largest-element-in-an-array","columnArticles":1,"formTitle":"[215]Kth Largest Element in an Array","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"","submitted":1899479,"title":"Kth Largest Element in an Array","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.6331126569345109,"acs":271404,"articleLive":1,"articleSlug":"combination-sum-iii","columnArticles":1,"formTitle":"[216]Combination Sum III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":428682,"title":"Combination Sum III","titleSlug":"combination-sum-iii"},{"acceptance":0.6013779559485982,"acs":1297761,"articleLive":1,"articleSlug":"contains-duplicate","columnArticles":1,"formTitle":"[217]Contains Duplicate","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"","submitted":2157979,"title":"Contains Duplicate","titleSlug":"contains-duplicate"},{"acceptance":0.382897422923246,"acs":197505,"articleLive":1,"articleSlug":"the-skyline-problem","columnArticles":1,"formTitle":"[218]The Skyline Problem","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"","submitted":515817,"title":"The Skyline Problem","titleSlug":"the-skyline-problem"},{"acceptance":0.4041863741571903,"acs":421722,"articleLive":1,"articleSlug":"contains-duplicate-ii","columnArticles":1,"formTitle":"[219]Contains Duplicate II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":1043385,"title":"Contains Duplicate II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2165355475249119,"acs":193659,"articleLive":1,"articleSlug":"contains-duplicate-iii","columnArticles":1,"formTitle":"[220]Contains Duplicate III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"","submitted":894352,"title":"Contains Duplicate III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.42907473838776233,"acs":461693,"articleLive":1,"articleSlug":"maximal-square","columnArticles":1,"formTitle":"[221]Maximal Square","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":1076020,"title":"Maximal Square","titleSlug":"maximal-square"},{"acceptance":0.5433731531461673,"acs":378398,"articleLive":1,"articleSlug":"count-complete-tree-nodes","columnArticles":1,"formTitle":"[222]Count Complete Tree Nodes","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":696387,"title":"Count Complete Tree Nodes","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.39782096584216725,"acs":132398,"articleLive":0,"columnArticles":0,"formTitle":"[223]Rectangle Area","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":332808,"title":"Rectangle Area","titleSlug":"rectangle-area"},{"acceptance":0.40090276905642963,"acs":274531,"articleLive":1,"articleSlug":"basic-calculator","columnArticles":1,"formTitle":"[224]Basic Calculator","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"","submitted":684782,"title":"Basic Calculator","titleSlug":"basic-calculator"},{"acceptance":0.5160216113357572,"acs":273348,"articleLive":1,"articleSlug":"implement-stack-using-queues","columnArticles":1,"formTitle":"[225]Implement Stack using Queues","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"","submitted":529722,"title":"Implement Stack using Queues","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7073702809065415,"acs":928021,"articleLive":1,"articleSlug":"invert-binary-tree","columnArticles":1,"formTitle":"[226]Invert Binary Tree","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"","submitted":1311931,"title":"Invert Binary Tree","titleSlug":"invert-binary-tree"},{"acceptance":0.4108646113963572,"acs":383863,"articleLive":1,"articleSlug":"basic-calculator-ii","columnArticles":1,"formTitle":"[227]Basic Calculator II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"","submitted":934281,"title":"Basic Calculator II","titleSlug":"basic-calculator-ii"},{"acceptance":0.445370576532188,"acs":248034,"articleLive":1,"articleSlug":"summary-ranges","columnArticles":1,"formTitle":"[228]Summary Ranges","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":556916,"title":"Summary Ranges","titleSlug":"summary-ranges"},{"acceptance":0.4155998860975764,"acs":262709,"articleLive":1,"articleSlug":"majority-element-ii","columnArticles":1,"formTitle":"[229]Majority Element II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":632120,"title":"Majority Element II","titleSlug":"majority-element-ii"},{"acceptance":0.6598934034375519,"acs":687277,"articleLive":1,"articleSlug":"kth-smallest-element-in-a-bst","columnArticles":1,"formTitle":"[230]Kth Smallest Element in a BST","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"","submitted":1041497,"title":"Kth Smallest Element in a BST","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.447581255200585,"acs":568020,"articleLive":1,"articleSlug":"power-of-two","columnArticles":1,"formTitle":"[231]Power of Two","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"","submitted":1269088,"title":"Power of Two","titleSlug":"power-of-two"},{"acceptance":0.5679652654184576,"acs":364444,"articleLive":1,"articleSlug":"implement-queue-using-stacks","columnArticles":1,"formTitle":"[232]Implement Queue using Stacks","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"","submitted":641666,"title":"Implement Queue using Stacks","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.3315726017917291,"acs":61328,"articleLive":1,"articleSlug":"number-of-digit-one","columnArticles":1,"formTitle":"[233]Number of Digit One","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"","submitted":184961,"title":"Number of Digit One","titleSlug":"number-of-digit-one"},{"acceptance":0.45679428346387047,"acs":867604,"articleLive":1,"articleSlug":"palindrome-linked-list","columnArticles":1,"formTitle":"[234]Palindrome Linked List","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"","submitted":1899332,"title":"Palindrome Linked List","titleSlug":"palindrome-linked-list"},{"acceptance":0.5605923967905768,"acs":676954,"articleLive":1,"articleSlug":"lowest-common-ancestor-of-a-binary-search-tree","columnArticles":1,"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":1207569,"title":"Lowest Common Ancestor of a Binary Search Tree","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.5416415273880099,"acs":895939,"articleLive":1,"articleSlug":"lowest-common-ancestor-of-a-binary-tree","columnArticles":1,"formTitle":"[236]Lowest Common Ancestor of a Binary Tree","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":1654118,"title":"Lowest Common Ancestor of a Binary Tree","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.7102339795934868,"acs":746691,"articleLive":0,"columnArticles":0,"formTitle":"[237]Delete Node in a Linked List","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"","submitted":1051331,"title":"Delete Node in a Linked List","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.6349350465383798,"acs":1039889,"articleLive":1,"articleSlug":"product-of-array-except-self","columnArticles":1,"formTitle":"[238]Product of Array Except Self","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":1637788,"title":"Product of Array Except Self","titleSlug":"product-of-array-except-self"},{"acceptance":0.4605334361393965,"acs":520832,"articleLive":1,"articleSlug":"sliding-window-maximum","columnArticles":1,"formTitle":"[239]Sliding Window Maximum","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"","submitted":1130932,"title":"Sliding Window Maximum","titleSlug":"sliding-window-maximum"},{"acceptance":0.47705342575207776,"acs":554660,"articleLive":1,"articleSlug":"search-a-2d-matrix-ii","columnArticles":1,"formTitle":"[240]Search a 2D Matrix II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":1162679,"title":"Search a 2D Matrix II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.6084715696615207,"acs":152298,"articleLive":0,"columnArticles":0,"formTitle":"[241]Different Ways to Add Parentheses","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":250296,"title":"Different Ways to Add Parentheses","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6090922818642909,"acs":1097136,"articleLive":1,"articleSlug":"valid-anagram","columnArticles":1,"formTitle":"[242]Valid Anagram","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"","submitted":1801264,"title":"Valid Anagram","titleSlug":"valid-anagram"},{"acceptance":0.6391913332631637,"acs":163966,"articleLive":1,"articleSlug":"shortest-word-distance","columnArticles":1,"formTitle":"[243]Shortest Word Distance","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":256521,"title":"Shortest Word Distance","titleSlug":"shortest-word-distance"},{"acceptance":0.5852640093016201,"acs":115774,"articleLive":1,"articleSlug":"shortest-word-distance-ii","columnArticles":1,"formTitle":"[244]Shortest Word Distance II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":197815,"title":"Shortest Word Distance II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5694585366284045,"acs":64543,"articleLive":0,"columnArticles":0,"formTitle":"[245]Shortest Word Distance III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":113341,"title":"Shortest Word Distance III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47351529638482776,"acs":127771,"articleLive":1,"articleSlug":"strobogrammatic-number","columnArticles":1,"formTitle":"[246]Strobogrammatic Number","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":269835,"title":"Strobogrammatic Number","titleSlug":"strobogrammatic-number"},{"acceptance":0.5000205478513797,"acs":109505,"articleLive":1,"articleSlug":"strobogrammatic-number-ii","columnArticles":1,"formTitle":"[247]Strobogrammatic Number II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":219001,"title":"Strobogrammatic Number II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.41199009740865605,"acs":33117,"articleLive":0,"columnArticles":0,"formTitle":"[248]Strobogrammatic Number III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":80383,"title":"Strobogrammatic Number III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6258273622511704,"acs":151188,"articleLive":1,"articleSlug":"group-shifted-strings","columnArticles":1,"formTitle":"[249]Group Shifted Strings","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":241581,"title":"Group Shifted Strings","titleSlug":"group-shifted-strings"},{"acceptance":0.546177898420895,"acs":111269,"articleLive":1,"articleSlug":"count-univalue-subtrees","columnArticles":1,"formTitle":"[250]Count Univalue Subtrees","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":203723,"title":"Count Univalue Subtrees","titleSlug":"count-univalue-subtrees"},{"acceptance":0.4760868004880733,"acs":99495,"articleLive":1,"articleSlug":"flatten-2d-vector","columnArticles":1,"formTitle":"[251]Flatten 2D Vector","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":208985,"title":"Flatten 2D Vector","titleSlug":"flatten-2d-vector"},{"acceptance":0.565320988337762,"acs":245087,"articleLive":1,"articleSlug":"meeting-rooms","columnArticles":1,"formTitle":"[252]Meeting Rooms","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":433536,"title":"Meeting Rooms","titleSlug":"meeting-rooms"},{"acceptance":0.49185455693448404,"acs":576456,"articleLive":1,"articleSlug":"meeting-rooms-ii","columnArticles":1,"formTitle":"[253]Meeting Rooms II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":1172005,"title":"Meeting Rooms II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.4849255253443645,"acs":101283,"articleLive":0,"columnArticles":0,"formTitle":"[254]Factor Combinations","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":208863,"title":"Factor Combinations","titleSlug":"factor-combinations"},{"acceptance":0.4730516175107505,"acs":62264,"articleLive":0,"columnArticles":0,"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":131622,"title":"Verify Preorder Sequence in Binary Search Tree","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.5791611251166207,"acs":145882,"articleLive":1,"articleSlug":"paint-house","columnArticles":1,"formTitle":"[256]Paint House","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":251885,"title":"Paint House","titleSlug":"paint-house"},{"acceptance":0.5763791902602364,"acs":477495,"articleLive":1,"articleSlug":"binary-tree-paths","columnArticles":1,"formTitle":"[257]Binary Tree Paths","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"","submitted":828439,"title":"Binary Tree Paths","titleSlug":"binary-tree-paths"},{"acceptance":0.6026459417917084,"acs":397172,"articleLive":1,"articleSlug":"add-digits","columnArticles":1,"formTitle":"[258]Add Digits","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":659047,"title":"Add Digits","titleSlug":"add-digits"},{"acceptance":0.5018688634335019,"acs":107954,"articleLive":1,"articleSlug":"3sum-smaller","columnArticles":1,"formTitle":"[259]3Sum Smaller","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":215104,"title":"3Sum Smaller","titleSlug":"3sum-smaller"},{"acceptance":0.669601861053894,"acs":241208,"articleLive":1,"articleSlug":"single-number-iii","columnArticles":1,"formTitle":"[260]Single Number III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"","submitted":360226,"title":"Single Number III","titleSlug":"single-number-iii"},{"acceptance":0.45309095045966574,"acs":230998,"articleLive":1,"articleSlug":"graph-valid-tree","columnArticles":1,"formTitle":"[261]Graph Valid Tree","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":509827,"title":"Graph Valid Tree","titleSlug":"graph-valid-tree"},{"acceptance":0.3751123603521338,"acs":105162,"articleLive":0,"columnArticles":0,"formTitle":"[262]Trips and Users","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":280348,"title":"Trips and Users","titleSlug":"trips-and-users"},{"acceptance":0.41850287988083457,"acs":280394,"articleLive":0,"columnArticles":0,"formTitle":"[263]Ugly Number","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"","submitted":669993,"title":"Ugly Number","titleSlug":"ugly-number"},{"acceptance":0.44833756733342245,"acs":244782,"articleLive":0,"columnArticles":0,"formTitle":"[264]Ugly Number II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":545977,"title":"Ugly Number II","titleSlug":"ugly-number-ii"},{"acceptance":0.49891226332686067,"acs":89670,"articleLive":1,"articleSlug":"paint-house-ii","columnArticles":1,"formTitle":"[265]Paint House II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":179731,"title":"Paint House II","titleSlug":"paint-house-ii"},{"acceptance":0.6487473882024527,"acs":154313,"articleLive":1,"articleSlug":"palindrome-permutation","columnArticles":1,"formTitle":"[266]Palindrome Permutation","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":237863,"title":"Palindrome Permutation","titleSlug":"palindrome-permutation"},{"acceptance":0.3919628356686936,"acs":51890,"articleLive":1,"articleSlug":"palindrome-permutation-ii","columnArticles":1,"formTitle":"[267]Palindrome Permutation II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":132385,"title":"Palindrome Permutation II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.5863752105664661,"acs":900867,"articleLive":1,"articleSlug":"missing-number","columnArticles":1,"formTitle":"[268]Missing Number","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"","submitted":1536332,"title":"Missing Number","titleSlug":"missing-number"},{"acceptance":0.3461093125712313,"acs":266635,"articleLive":1,"articleSlug":"alien-dictionary","columnArticles":1,"formTitle":"[269]Alien Dictionary","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":770378,"title":"Alien Dictionary","titleSlug":"alien-dictionary"},{"acceptance":0.5314925071333888,"acs":236562,"articleLive":1,"articleSlug":"closest-binary-search-tree-value","columnArticles":1,"formTitle":"[270]Closest Binary Search Tree Value","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":445090,"title":"Closest Binary Search Tree Value","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.36584645503181273,"acs":86710,"articleLive":1,"articleSlug":"encode-and-decode-strings","columnArticles":1,"formTitle":"[271]Encode and Decode Strings","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":237012,"title":"Encode and Decode Strings","titleSlug":"encode-and-decode-strings"},{"acceptance":0.5587842668336908,"acs":88322,"articleLive":1,"articleSlug":"closest-binary-search-tree-value-ii","columnArticles":1,"formTitle":"[272]Closest Binary Search Tree Value II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":158061,"title":"Closest Binary Search Tree Value II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.2938570648535758,"acs":285771,"articleLive":1,"articleSlug":"integer-to-english-words","columnArticles":1,"formTitle":"[273]Integer to English Words","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":972483,"title":"Integer to English Words","titleSlug":"integer-to-english-words"},{"acceptance":0.3729139890879813,"acs":223707,"articleLive":1,"articleSlug":"h-index","columnArticles":1,"formTitle":"[274]H-Index","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"","submitted":599889,"title":"H-Index","titleSlug":"h-index"},{"acceptance":0.36821264121229846,"acs":153615,"articleLive":1,"articleSlug":"h-index-ii","columnArticles":1,"formTitle":"[275]H-Index II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"","submitted":417191,"title":"H-Index II","titleSlug":"h-index-ii"},{"acceptance":0.4214448549642324,"acs":80418,"articleLive":1,"articleSlug":"paint-fence","columnArticles":1,"formTitle":"[276]Paint Fence","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":190815,"title":"Paint Fence","titleSlug":"paint-fence"},{"acceptance":0.46046688589952967,"acs":206955,"articleLive":1,"articleSlug":"find-the-celebrity","columnArticles":1,"formTitle":"[277]Find the Celebrity","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":449446,"title":"Find the Celebrity","titleSlug":"find-the-celebrity"},{"acceptance":0.40933354264553123,"acs":857862,"articleLive":1,"articleSlug":"first-bad-version","columnArticles":1,"formTitle":"[278]First Bad Version","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"","submitted":2095753,"title":"First Bad Version","titleSlug":"first-bad-version"},{"acceptance":0.5152374261357581,"acs":497961,"articleLive":1,"articleSlug":"perfect-squares","columnArticles":1,"formTitle":"[279]Perfect Squares","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"","submitted":966469,"title":"Perfect Squares","titleSlug":"perfect-squares"},{"acceptance":0.6577599762646492,"acs":110849,"articleLive":1,"articleSlug":"wiggle-sort","columnArticles":1,"formTitle":"[280]Wiggle Sort","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":168525,"title":"Wiggle Sort","titleSlug":"wiggle-sort"},{"acceptance":0.610487568919546,"acs":77618,"articleLive":1,"articleSlug":"zigzag-iterator","columnArticles":1,"formTitle":"[281]Zigzag Iterator","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":127141,"title":"Zigzag Iterator","titleSlug":"zigzag-iterator"},{"acceptance":0.3905184956521542,"acs":172048,"articleLive":1,"articleSlug":"expression-add-operators","columnArticles":1,"formTitle":"[282]Expression Add Operators","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":440563,"title":"Expression Add Operators","titleSlug":"expression-add-operators"},{"acceptance":0.6017623983960835,"acs":1499832,"articleLive":1,"articleSlug":"move-zeroes","columnArticles":1,"formTitle":"[283]Move Zeroes","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"","submitted":2492399,"title":"Move Zeroes","titleSlug":"move-zeroes"},{"acceptance":0.5320801279928614,"acs":152649,"articleLive":1,"articleSlug":"peeking-iterator","columnArticles":1,"formTitle":"[284]Peeking Iterator","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":286891,"title":"Peeking Iterator","titleSlug":"peeking-iterator"},{"acceptance":0.4629684784370794,"acs":245602,"articleLive":1,"articleSlug":"inorder-successor-in-bst","columnArticles":1,"formTitle":"[285]Inorder Successor in BST","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":530494,"title":"Inorder Successor in BST","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5868026626206994,"acs":200727,"articleLive":1,"articleSlug":"walls-and-gates","columnArticles":1,"formTitle":"[286]Walls and Gates","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":342069,"title":"Walls and Gates","titleSlug":"walls-and-gates"},{"acceptance":0.5837096593824416,"acs":709875,"articleLive":1,"articleSlug":"find-the-duplicate-number","columnArticles":1,"formTitle":"[287]Find the Duplicate Number","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":1216144,"title":"Find the Duplicate Number","titleSlug":"find-the-duplicate-number"},{"acceptance":0.244839818976425,"acs":63082,"articleLive":0,"columnArticles":0,"formTitle":"[288]Unique Word Abbreviation","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":257646,"title":"Unique Word Abbreviation","titleSlug":"unique-word-abbreviation"},{"acceptance":0.620524462320737,"acs":282634,"articleLive":1,"articleSlug":"game-of-life","columnArticles":1,"formTitle":"[289]Game of Life","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":455476,"title":"Game of Life","titleSlug":"game-of-life"},{"acceptance":0.4007395961121072,"acs":339731,"articleLive":1,"articleSlug":"word-pattern","columnArticles":1,"formTitle":"[290]Word Pattern","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":847760,"title":"Word Pattern","titleSlug":"word-pattern"},{"acceptance":0.45882783416589773,"acs":57682,"articleLive":0,"columnArticles":0,"formTitle":"[291]Word Pattern II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":125716,"title":"Word Pattern II","titleSlug":"word-pattern-ii"},{"acceptance":0.5538964021013656,"acs":268966,"articleLive":1,"articleSlug":"nim-game","columnArticles":1,"formTitle":"[292]Nim Game","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":485589,"title":"Nim Game","titleSlug":"nim-game"},{"acceptance":0.623458246637637,"acs":58130,"articleLive":0,"columnArticles":0,"formTitle":"[293]Flip Game","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":93238,"title":"Flip Game","titleSlug":"flip-game"},{"acceptance":0.5136038422498947,"acs":62238,"articleLive":0,"columnArticles":0,"formTitle":"[294]Flip Game II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":121179,"title":"Flip Game II","titleSlug":"flip-game-ii"},{"acceptance":0.4990471510415418,"acs":416375,"articleLive":1,"articleSlug":"find-median-from-data-stream","columnArticles":1,"formTitle":"[295]Find Median from Data Stream","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"","submitted":834340,"title":"Find Median from Data Stream","titleSlug":"find-median-from-data-stream"},{"acceptance":0.5936719400499584,"acs":55614,"articleLive":1,"articleSlug":"best-meeting-point","columnArticles":1,"formTitle":"[296]Best Meeting Point","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":93678,"title":"Best Meeting Point","titleSlug":"best-meeting-point"},{"acceptance":0.5298051662919137,"acs":559843,"articleLive":1,"articleSlug":"serialize-and-deserialize-binary-tree","columnArticles":1,"formTitle":"[297]Serialize and Deserialize Binary Tree","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"","submitted":1056696,"title":"Serialize and Deserialize Binary Tree","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5062564714553974,"acs":115388,"articleLive":1,"articleSlug":"binary-tree-longest-consecutive-sequence","columnArticles":1,"formTitle":"[298]Binary Tree Longest Consecutive Sequence","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":227924,"title":"Binary Tree Longest Consecutive Sequence","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.4675188715631715,"acs":254550,"articleLive":1,"articleSlug":"bulls-and-cows","columnArticles":1,"formTitle":"[299]Bulls and Cows","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":544470,"title":"Bulls and Cows","titleSlug":"bulls-and-cows"},{"acceptance":0.4846130859684712,"acs":767080,"articleLive":1,"articleSlug":"longest-increasing-subsequence","columnArticles":1,"formTitle":"[300]Longest Increasing Subsequence","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"","submitted":1582871,"title":"Longest Increasing Subsequence","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.46516610802325087,"acs":328905,"articleLive":1,"articleSlug":"remove-invalid-parentheses","columnArticles":1,"formTitle":"[301]Remove Invalid Parentheses","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":707070,"title":"Remove Invalid Parentheses","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.5577539155196962,"acs":37606,"articleLive":1,"articleSlug":"smallest-rectangle-enclosing-black-pixels","columnArticles":1,"formTitle":"[302]Smallest Rectangle Enclosing Black Pixels","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":67424,"title":"Smallest Rectangle Enclosing Black Pixels","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.540761451242685,"acs":328412,"articleLive":1,"articleSlug":"range-sum-query-immutable","columnArticles":1,"formTitle":"[303]Range Sum Query - Immutable","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":607314,"title":"Range Sum Query - Immutable","titleSlug":"range-sum-query-immutable"},{"acceptance":0.46674682698730796,"acs":209616,"articleLive":1,"articleSlug":"range-sum-query-2d-immutable","columnArticles":1,"formTitle":"[304]Range Sum Query 2D - Immutable","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":449100,"title":"Range Sum Query 2D - Immutable","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.39335388481430617,"acs":107694,"articleLive":1,"articleSlug":"number-of-islands-ii","columnArticles":1,"formTitle":"[305]Number of Islands II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":273784,"title":"Number of Islands II","titleSlug":"number-of-islands-ii"},{"acceptance":0.30303745850683644,"acs":66734,"articleLive":0,"columnArticles":0,"formTitle":"[306]Additive Number","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":220217,"title":"Additive Number","titleSlug":"additive-number"},{"acceptance":0.3846189580798584,"acs":173867,"articleLive":1,"articleSlug":"range-sum-query-mutable","columnArticles":1,"formTitle":"[307]Range Sum Query - Mutable","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"","submitted":452050,"title":"Range Sum Query - Mutable","titleSlug":"range-sum-query-mutable"},{"acceptance":0.4051435842674357,"acs":63360,"articleLive":1,"articleSlug":"range-sum-query-2d-mutable","columnArticles":1,"formTitle":"[308]Range Sum Query 2D - Mutable","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":156389,"title":"Range Sum Query 2D - Mutable","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.5169476493400736,"acs":256466,"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock-with-cooldown","columnArticles":1,"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":496116,"title":"Best Time to Buy and Sell Stock with Cooldown","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37924958947401033,"acs":183608,"articleLive":1,"articleSlug":"minimum-height-trees","columnArticles":1,"formTitle":"[310]Minimum Height Trees","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":484135,"title":"Minimum Height Trees","titleSlug":"minimum-height-trees"},{"acceptance":0.6553376527770792,"acs":143323,"articleLive":0,"columnArticles":0,"formTitle":"[311]Sparse Matrix Multiplication","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":218701,"title":"Sparse Matrix Multiplication","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.5605025480278614,"acs":176310,"articleLive":1,"articleSlug":"burst-balloons","columnArticles":1,"formTitle":"[312]Burst Balloons","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":314557,"title":"Burst Balloons","titleSlug":"burst-balloons"},{"acceptance":0.46185250640472375,"acs":101136,"articleLive":0,"columnArticles":0,"formTitle":"[313]Super Ugly Number","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"","submitted":218979,"title":"Super Ugly Number","titleSlug":"super-ugly-number"},{"acceptance":0.5042492917847026,"acs":233536,"articleLive":1,"articleSlug":"binary-tree-vertical-order-traversal","columnArticles":1,"formTitle":"[314]Binary Tree Vertical Order Traversal","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":463136,"title":"Binary Tree Vertical Order Traversal","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4206860061819533,"acs":216265,"articleLive":1,"articleSlug":"count-of-smaller-numbers-after-self","columnArticles":1,"formTitle":"[315]Count of Smaller Numbers After Self","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"","submitted":514077,"title":"Count of Smaller Numbers After Self","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4123295076059537,"acs":151033,"articleLive":1,"articleSlug":"remove-duplicate-letters","columnArticles":1,"formTitle":"[316]Remove Duplicate Letters","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"","submitted":366292,"title":"Remove Duplicate Letters","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4355461538196086,"acs":126213,"articleLive":1,"articleSlug":"shortest-distance-from-all-buildings","columnArticles":1,"formTitle":"[317]Shortest Distance from All Buildings","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":289781,"title":"Shortest Distance from All Buildings","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.563667520794096,"acs":139466,"articleLive":1,"articleSlug":"maximum-product-of-word-lengths","columnArticles":1,"formTitle":"[318]Maximum Product of Word Lengths","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":247426,"title":"Maximum Product of Word Lengths","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.46927896995708157,"acs":109342,"articleLive":0,"columnArticles":0,"formTitle":"[319]Bulb Switcher","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"","submitted":233000,"title":"Bulb Switcher","titleSlug":"bulb-switcher"},{"acceptance":0.5578510434179655,"acs":58730,"articleLive":1,"articleSlug":"generalized-abbreviation","columnArticles":1,"formTitle":"[320]Generalized Abbreviation","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":105279,"title":"Generalized Abbreviation","titleSlug":"generalized-abbreviation"},{"acceptance":0.28205113204235654,"acs":48211,"articleLive":0,"columnArticles":0,"formTitle":"[321]Create Maximum Number","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":170930,"title":"Create Maximum Number","titleSlug":"create-maximum-number"},{"acceptance":0.3962394006364244,"acs":877994,"articleLive":1,"articleSlug":"coin-change","columnArticles":1,"formTitle":"[322]Coin Change","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"","submitted":2215817,"title":"Coin Change","titleSlug":"coin-change"},{"acceptance":0.6055695452525551,"acs":224851,"articleLive":1,"articleSlug":"number-of-connected-components-in-an-undirected-graph","columnArticles":1,"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":371305,"title":"Number of Connected Components in an Undirected Graph","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.31939569451705074,"acs":115474,"articleLive":0,"columnArticles":0,"formTitle":"[324]Wiggle Sort II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":361539,"title":"Wiggle Sort II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.4885303233442441,"acs":146116,"articleLive":1,"articleSlug":"maximum-size-subarray-sum-equals-k","columnArticles":1,"formTitle":"[325]Maximum Size Subarray Sum Equals k","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":299093,"title":"Maximum Size Subarray Sum Equals k","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4322965224454519,"acs":432153,"articleLive":1,"articleSlug":"power-of-three","columnArticles":1,"formTitle":"[326]Power of Three","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":999668,"title":"Power of Three","titleSlug":"power-of-three"},{"acceptance":0.359951309349614,"acs":57071,"articleLive":0,"columnArticles":0,"formTitle":"[327]Count of Range Sum","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":158552,"title":"Count of Range Sum","titleSlug":"count-of-range-sum"},{"acceptance":0.5924071526822559,"acs":495282,"articleLive":1,"articleSlug":"odd-even-linked-list","columnArticles":1,"formTitle":"[328]Odd Even Linked List","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"","submitted":836050,"title":"Odd Even Linked List","titleSlug":"odd-even-linked-list"},{"acceptance":0.4904251074228089,"acs":297434,"articleLive":1,"articleSlug":"longest-increasing-path-in-a-matrix","columnArticles":1,"formTitle":"[329]Longest Increasing Path in a Matrix","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":606482,"title":"Longest Increasing Path in a Matrix","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.3932198786353987,"acs":55015,"articleLive":1,"articleSlug":"patching-array","columnArticles":1,"formTitle":"[330]Patching Array","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":139909,"title":"Patching Array","titleSlug":"patching-array"},{"acceptance":0.435297878386058,"acs":110301,"articleLive":1,"articleSlug":"verify-preorder-serialization-of-a-binary-tree","columnArticles":1,"formTitle":"[331]Verify Preorder Serialization of a Binary Tree","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"","submitted":253392,"title":"Verify Preorder Serialization of a Binary Tree","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.3983595801510099,"acs":265327,"articleLive":1,"articleSlug":"reconstruct-itinerary","columnArticles":1,"formTitle":"[332]Reconstruct Itinerary","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":666049,"title":"Reconstruct Itinerary","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4071017032753681,"acs":77583,"articleLive":1,"articleSlug":"largest-bst-subtree","columnArticles":1,"formTitle":"[333]Largest BST Subtree","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":190574,"title":"Largest BST Subtree","titleSlug":"largest-bst-subtree"},{"acceptance":0.4133000861079219,"acs":253429,"articleLive":1,"articleSlug":"increasing-triplet-subsequence","columnArticles":1,"formTitle":"[334]Increasing Triplet Subsequence","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":613184,"title":"Increasing Triplet Subsequence","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.2907967047682304,"acs":27145,"articleLive":0,"columnArticles":0,"formTitle":"[335]Self Crossing","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":93347,"title":"Self Crossing","titleSlug":"self-crossing"},{"acceptance":0.3611129299533089,"acs":143390,"articleLive":1,"articleSlug":"palindrome-pairs","columnArticles":1,"formTitle":"[336]Palindrome Pairs","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":397078,"title":"Palindrome Pairs","titleSlug":"palindrome-pairs"},{"acceptance":0.5331117000423403,"acs":271968,"articleLive":1,"articleSlug":"house-robber-iii","columnArticles":1,"formTitle":"[337]House Robber III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":510152,"title":"House Robber III","titleSlug":"house-robber-iii"},{"acceptance":0.7250617973048401,"acs":472836,"articleLive":1,"articleSlug":"counting-bits","columnArticles":1,"formTitle":"[338]Counting Bits","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":652132,"title":"Counting Bits","titleSlug":"counting-bits"},{"acceptance":0.8002005575307434,"acs":166777,"articleLive":1,"articleSlug":"nested-list-weight-sum","columnArticles":1,"formTitle":"[339]Nested List Weight Sum","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":208419,"title":"Nested List Weight Sum","titleSlug":"nested-list-weight-sum"},{"acceptance":0.47088302252006203,"acs":256894,"articleLive":1,"articleSlug":"longest-substring-with-at-most-k-distinct-characters","columnArticles":1,"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":545558,"title":"Longest Substring with At Most K Distinct Characters","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.5812494796147761,"acs":272259,"articleLive":1,"articleSlug":"flatten-nested-list-iterator","columnArticles":1,"formTitle":"[341]Flatten Nested List Iterator","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"","submitted":468403,"title":"Flatten Nested List Iterator","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.434677395293035,"acs":276803,"articleLive":1,"articleSlug":"power-of-four","columnArticles":1,"formTitle":"[342]Power of Four","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"","submitted":636801,"title":"Power of Four","titleSlug":"power-of-four"},{"acceptance":0.5344277443741918,"acs":172346,"articleLive":0,"columnArticles":0,"formTitle":"[343]Integer Break","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"","submitted":322487,"title":"Integer Break","titleSlug":"integer-break"},{"acceptance":0.7354189352091033,"acs":1387901,"articleLive":1,"articleSlug":"reverse-string","columnArticles":1,"formTitle":"[344]Reverse String","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"","submitted":1887225,"title":"Reverse String","titleSlug":"reverse-string"},{"acceptance":0.4660250197163943,"acs":330319,"articleLive":0,"columnArticles":0,"formTitle":"[345]Reverse Vowels of a String","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"","submitted":708801,"title":"Reverse Vowels of a String","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7558617519873637,"acs":233525,"articleLive":1,"articleSlug":"moving-average-from-data-stream","columnArticles":1,"formTitle":"[346]Moving Average from Data Stream","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":308952,"title":"Moving Average from Data Stream","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.643410896352281,"acs":800057,"articleLive":1,"articleSlug":"top-k-frequent-elements","columnArticles":1,"formTitle":"[347]Top K Frequent Elements","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":1243462,"title":"Top K Frequent Elements","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5699903652744206,"acs":168606,"articleLive":1,"articleSlug":"design-tic-tac-toe","columnArticles":1,"formTitle":"[348]Design Tic-Tac-Toe","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":295805,"title":"Design Tic-Tac-Toe","titleSlug":"design-tic-tac-toe"},{"acceptance":0.683072514384221,"acs":610216,"articleLive":1,"articleSlug":"intersection-of-two-arrays","columnArticles":1,"formTitle":"[349]Intersection of Two Arrays","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"","submitted":893340,"title":"Intersection of Two Arrays","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5443421177452711,"acs":717266,"articleLive":1,"articleSlug":"intersection-of-two-arrays-ii","columnArticles":1,"formTitle":"[350]Intersection of Two Arrays II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"","submitted":1317675,"title":"Intersection of Two Arrays II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5076541781981908,"acs":61449,"articleLive":0,"columnArticles":0,"formTitle":"[351]Android Unlock Patterns","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":121045,"title":"Android Unlock Patterns","titleSlug":"android-unlock-patterns"},{"acceptance":0.502042163455588,"acs":48676,"articleLive":0,"columnArticles":0,"formTitle":"[352]Data Stream as Disjoint Intervals","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":96956,"title":"Data Stream as Disjoint Intervals","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.37756556153633153,"acs":55905,"articleLive":1,"articleSlug":"design-snake-game","columnArticles":1,"formTitle":"[353]Design Snake Game","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":148067,"title":"Design Snake Game","titleSlug":"design-snake-game"},{"acceptance":0.39468107234694216,"acs":130924,"articleLive":1,"articleSlug":"russian-doll-envelopes","columnArticles":1,"formTitle":"[354]Russian Doll Envelopes","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":331721,"title":"Russian Doll Envelopes","titleSlug":"russian-doll-envelopes"},{"acceptance":0.3397817837613989,"acs":80408,"articleLive":0,"columnArticles":0,"formTitle":"[355]Design Twitter","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":236646,"title":"Design Twitter","titleSlug":"design-twitter"},{"acceptance":0.3419696551724138,"acs":30991,"articleLive":0,"columnArticles":0,"formTitle":"[356]Line Reflection","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":90625,"title":"Line Reflection","titleSlug":"line-reflection"},{"acceptance":0.5027384151803893,"acs":98770,"articleLive":0,"columnArticles":0,"formTitle":"[357]Count Numbers with Unique Digits","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":196464,"title":"Count Numbers with Unique Digits","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.36661048285898856,"acs":49374,"articleLive":0,"columnArticles":0,"formTitle":"[358]Rearrange String k Distance Apart","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":134677,"title":"Rearrange String k Distance Apart","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7457157019251095,"acs":204605,"articleLive":1,"articleSlug":"logger-rate-limiter","columnArticles":1,"formTitle":"[359]Logger Rate Limiter","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":274374,"title":"Logger Rate Limiter","titleSlug":"logger-rate-limiter"},{"acceptance":0.5261597231015998,"acs":49861,"articleLive":0,"columnArticles":0,"formTitle":"[360]Sort Transformed Array","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":94764,"title":"Sort Transformed Array","titleSlug":"sort-transformed-array"},{"acceptance":0.4965697122984508,"acs":62826,"articleLive":1,"articleSlug":"bomb-enemy","columnArticles":1,"formTitle":"[361]Bomb Enemy","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":126520,"title":"Bomb Enemy","titleSlug":"bomb-enemy"},{"acceptance":0.6696414599140649,"acs":149770,"articleLive":1,"articleSlug":"design-hit-counter","columnArticles":1,"formTitle":"[362]Design Hit Counter","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":223657,"title":"Design Hit Counter","titleSlug":"design-hit-counter"},{"acceptance":0.4013131497355462,"acs":77014,"articleLive":1,"articleSlug":"max-sum-of-rectangle-no-larger-than-k","columnArticles":1,"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":191905,"title":"Max Sum of Rectangle No Larger Than K","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.6760118206347167,"acs":105228,"articleLive":1,"articleSlug":"nested-list-weight-sum-ii","columnArticles":1,"formTitle":"[364]Nested List Weight Sum II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":155660,"title":"Nested List Weight Sum II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3354538040312245,"acs":57584,"articleLive":0,"columnArticles":0,"formTitle":"[365]Water and Jug Problem","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":171660,"title":"Water and Jug Problem","titleSlug":"water-and-jug-problem"},{"acceptance":0.7717947194755118,"acs":142914,"articleLive":1,"articleSlug":"find-leaves-of-binary-tree","columnArticles":1,"formTitle":"[366]Find Leaves of Binary Tree","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":185171,"title":"Find Leaves of Binary Tree","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.428117290916024,"acs":330081,"articleLive":1,"articleSlug":"valid-perfect-square","columnArticles":1,"formTitle":"[367]Valid Perfect Square","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":771006,"title":"Valid Perfect Square","titleSlug":"valid-perfect-square"},{"acceptance":0.4035006627089761,"acs":144910,"articleLive":1,"articleSlug":"largest-divisible-subset","columnArticles":1,"formTitle":"[368]Largest Divisible Subset","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"","submitted":359132,"title":"Largest Divisible Subset","titleSlug":"largest-divisible-subset"},{"acceptance":0.6020539628692453,"acs":64955,"articleLive":1,"articleSlug":"plus-one-linked-list","columnArticles":1,"formTitle":"[369]Plus One Linked List","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":107889,"title":"Plus One Linked List","titleSlug":"plus-one-linked-list"},{"acceptance":0.6837949336264879,"acs":57847,"articleLive":1,"articleSlug":"range-addition","columnArticles":1,"formTitle":"[370]Range Addition","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":84597,"title":"Range Addition","titleSlug":"range-addition"},{"acceptance":0.5066769814518061,"acs":275080,"articleLive":1,"articleSlug":"sum-of-two-integers","columnArticles":1,"formTitle":"[371]Sum of Two Integers","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"","submitted":542910,"title":"Sum of Two Integers","titleSlug":"sum-of-two-integers"},{"acceptance":0.3764275373974586,"acs":46805,"articleLive":0,"columnArticles":0,"formTitle":"[372]Super Pow","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":124340,"title":"Super Pow","titleSlug":"super-pow"},{"acceptance":0.3890116126885808,"acs":159019,"articleLive":0,"columnArticles":0,"formTitle":"[373]Find K Pairs with Smallest Sums","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"","submitted":408777,"title":"Find K Pairs with Smallest Sums","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.48232089103471704,"acs":278317,"articleLive":1,"articleSlug":"guess-number-higher-or-lower","columnArticles":1,"formTitle":"[374]Guess Number Higher or Lower","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"","submitted":577037,"title":"Guess Number Higher or Lower","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.45046807742090844,"acs":89790,"articleLive":0,"columnArticles":0,"formTitle":"[375]Guess Number Higher or Lower II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":199326,"title":"Guess Number Higher or Lower II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.44394122695453464,"acs":128802,"articleLive":1,"articleSlug":"wiggle-subsequence","columnArticles":1,"formTitle":"[376]Wiggle Subsequence","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":290133,"title":"Wiggle Subsequence","titleSlug":"wiggle-subsequence"},{"acceptance":0.48765672044958924,"acs":222054,"articleLive":1,"articleSlug":"combination-sum-iv","columnArticles":1,"formTitle":"[377]Combination Sum IV","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"","submitted":455349,"title":"Combination Sum IV","titleSlug":"combination-sum-iv"},{"acceptance":0.5912471481623341,"acs":355038,"articleLive":1,"articleSlug":"kth-smallest-element-in-a-sorted-matrix","columnArticles":1,"formTitle":"[378]Kth Smallest Element in a Sorted Matrix","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"","submitted":600490,"title":"Kth Smallest Element in a Sorted Matrix","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.5001711254349438,"acs":52611,"articleLive":0,"columnArticles":0,"formTitle":"[379]Design Phone Directory","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":105186,"title":"Design Phone Directory","titleSlug":"design-phone-directory"},{"acceptance":0.5102073273328647,"acs":442712,"articleLive":1,"articleSlug":"insert-delete-getrandom-o1","columnArticles":1,"formTitle":"[380]Insert Delete GetRandom O(1)","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"","submitted":867710,"title":"Insert Delete GetRandom O(1)","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.35354787627491224,"acs":101808,"articleLive":1,"articleSlug":"insert-delete-getrandom-o1-duplicates-allowed","columnArticles":1,"formTitle":"[381]Insert Delete GetRandom O(1) - Duplicates allowed","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":287961,"title":"Insert Delete GetRandom O(1) - Duplicates allowed","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.5868638566297935,"acs":146902,"articleLive":1,"articleSlug":"linked-list-random-node","columnArticles":1,"formTitle":"[382]Linked List Random Node","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":250317,"title":"Linked List Random Node","titleSlug":"linked-list-random-node"},{"acceptance":0.5540497347056191,"acs":338013,"articleLive":1,"articleSlug":"ransom-note","columnArticles":1,"formTitle":"[383]Ransom Note","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"","submitted":610077,"title":"Ransom Note","titleSlug":"ransom-note"},{"acceptance":0.5665241719667744,"acs":244509,"articleLive":1,"articleSlug":"shuffle-an-array","columnArticles":1,"formTitle":"[384]Shuffle an Array","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"","submitted":431595,"title":"Shuffle an Array","titleSlug":"shuffle-an-array"},{"acceptance":0.3562333793061408,"acs":46751,"articleLive":0,"columnArticles":0,"formTitle":"[385]Mini Parser","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"","submitted":131237,"title":"Mini Parser","titleSlug":"mini-parser"},{"acceptance":0.5804571874792807,"acs":78793,"articleLive":0,"columnArticles":0,"formTitle":"[386]Lexicographical Numbers","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":135743,"title":"Lexicographical Numbers","titleSlug":"lexicographical-numbers"},{"acceptance":0.564492570400381,"acs":959993,"articleLive":1,"articleSlug":"first-unique-character-in-a-string","columnArticles":1,"formTitle":"[387]First Unique Character in a String","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"","submitted":1700630,"title":"First Unique Character in a String","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.45523508144117236,"acs":123142,"articleLive":0,"columnArticles":0,"formTitle":"[388]Longest Absolute File Path","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":270502,"title":"Longest Absolute File Path","titleSlug":"longest-absolute-file-path"},{"acceptance":0.5902338512351618,"acs":311660,"articleLive":1,"articleSlug":"find-the-difference","columnArticles":1,"formTitle":"[389]Find the Difference","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":528028,"title":"Find the Difference","titleSlug":"find-the-difference"},{"acceptance":0.4623643377988808,"acs":43625,"articleLive":0,"columnArticles":0,"formTitle":"[390]Elimination Game","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":94352,"title":"Elimination Game","titleSlug":"elimination-game"},{"acceptance":0.31896999672831544,"acs":33148,"articleLive":0,"columnArticles":0,"formTitle":"[391]Perfect Rectangle","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":103922,"title":"Perfect Rectangle","titleSlug":"perfect-rectangle"},{"acceptance":0.5011922006156855,"acs":381296,"articleLive":1,"articleSlug":"is-subsequence","columnArticles":1,"formTitle":"[392]Is Subsequence","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":760778,"title":"Is Subsequence","titleSlug":"is-subsequence"},{"acceptance":0.39100776115852387,"acs":65746,"articleLive":1,"articleSlug":"utf-8-validation","columnArticles":1,"formTitle":"[393]UTF-8 Validation","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":168145,"title":"UTF-8 Validation","titleSlug":"utf-8-validation"},{"acceptance":0.5583136332732456,"acs":447547,"articleLive":1,"articleSlug":"decode-string","columnArticles":1,"formTitle":"[394]Decode String","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"","submitted":801605,"title":"Decode String","titleSlug":"decode-string"},{"acceptance":0.4441019522057605,"acs":147389,"articleLive":1,"articleSlug":"longest-substring-with-at-least-k-repeating-characters","columnArticles":1,"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":331881,"title":"Longest Substring with At Least K Repeating Characters","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.38719900286411374,"acs":58402,"articleLive":0,"columnArticles":0,"formTitle":"[396]Rotate Function","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":150832,"title":"Rotate Function","titleSlug":"rotate-function"},{"acceptance":0.3450384128625158,"acs":77428,"articleLive":0,"columnArticles":0,"formTitle":"[397]Integer Replacement","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":224404,"title":"Integer Replacement","titleSlug":"integer-replacement"},{"acceptance":0.6284006145222566,"acs":158296,"articleLive":1,"articleSlug":"random-pick-index","columnArticles":1,"formTitle":"[398]Random Pick Index","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":251903,"title":"Random Pick Index","titleSlug":"random-pick-index"},{"acceptance":0.5657375094088781,"acs":231493,"articleLive":1,"articleSlug":"evaluate-division","columnArticles":1,"formTitle":"[399]Evaluate Division","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":409188,"title":"Evaluate Division","titleSlug":"evaluate-division"},{"acceptance":0.3333303056863751,"acs":73397,"articleLive":0,"columnArticles":0,"formTitle":"[400]Nth Digit","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"","submitted":220193,"title":"Nth Digit","titleSlug":"nth-digit"},{"acceptance":0.501075673767212,"acs":106441,"articleLive":0,"columnArticles":0,"formTitle":"[401]Binary Watch","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":212425,"title":"Binary Watch","titleSlug":"binary-watch"},{"acceptance":0.29104448939154015,"acs":212101,"articleLive":1,"articleSlug":"remove-k-digits","columnArticles":1,"formTitle":"[402]Remove K Digits","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"","submitted":728758,"title":"Remove K Digits","titleSlug":"remove-k-digits"},{"acceptance":0.4276239721565198,"acs":145718,"articleLive":1,"articleSlug":"frog-jump","columnArticles":1,"formTitle":"[403]Frog Jump","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"","submitted":340762,"title":"Frog Jump","titleSlug":"frog-jump"},{"acceptance":0.5456033471336291,"acs":323665,"articleLive":1,"articleSlug":"sum-of-left-leaves","columnArticles":1,"formTitle":"[404]Sum of Left Leaves","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"","submitted":593224,"title":"Sum of Left Leaves","titleSlug":"sum-of-left-leaves"},{"acceptance":0.45557191711149647,"acs":94051,"articleLive":0,"columnArticles":0,"formTitle":"[405]Convert a Number to Hexadecimal","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":206446,"title":"Convert a Number to Hexadecimal","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.6981777354998608,"acs":215783,"articleLive":1,"articleSlug":"queue-reconstruction-by-height","columnArticles":1,"formTitle":"[406]Queue Reconstruction by Height","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":309066,"title":"Queue Reconstruction by Height","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.46543030632460536,"acs":65076,"articleLive":0,"columnArticles":0,"formTitle":"[407]Trapping Rain Water II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":139819,"title":"Trapping Rain Water II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3397052642995621,"acs":75171,"articleLive":0,"columnArticles":0,"formTitle":"[408]Valid Word Abbreviation","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":221283,"title":"Valid Word Abbreviation","titleSlug":"valid-word-abbreviation"},{"acceptance":0.532205227410423,"acs":250352,"articleLive":1,"articleSlug":"longest-palindrome","columnArticles":1,"formTitle":"[409]Longest Palindrome","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":470405,"title":"Longest Palindrome","titleSlug":"longest-palindrome"},{"acceptance":0.4965739705469091,"acs":166103,"articleLive":1,"articleSlug":"split-array-largest-sum","columnArticles":1,"formTitle":"[410]Split Array Largest Sum","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":334498,"title":"Split Array Largest Sum","titleSlug":"split-array-largest-sum"},{"acceptance":0.38194954330523656,"acs":13005,"articleLive":0,"columnArticles":0,"formTitle":"[411]Minimum Unique Word Abbreviation","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":34049,"title":"Minimum Unique Word Abbreviation","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6601203838298342,"acs":574009,"articleLive":1,"articleSlug":"fizz-buzz","columnArticles":1,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":869552,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6219608416130917,"acs":170268,"articleLive":1,"articleSlug":"arithmetic-slices","columnArticles":1,"formTitle":"[413]Arithmetic Slices","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"","submitted":273760,"title":"Arithmetic Slices","titleSlug":"arithmetic-slices"},{"acceptance":0.31486082743775984,"acs":300455,"articleLive":1,"articleSlug":"third-maximum-number","columnArticles":1,"formTitle":"[414]Third Maximum Number","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"","submitted":954247,"title":"Third Maximum Number","titleSlug":"third-maximum-number"},{"acceptance":0.516155354424318,"acs":433299,"articleLive":1,"articleSlug":"add-strings","columnArticles":1,"formTitle":"[415]Add Strings","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":839474,"title":"Add Strings","titleSlug":"add-strings"},{"acceptance":0.4620312211343063,"acs":400156,"articleLive":1,"articleSlug":"partition-equal-subset-sum","columnArticles":1,"formTitle":"[416]Partition Equal Subset Sum","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"","submitted":866080,"title":"Partition Equal Subset Sum","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4772998821972315,"acs":170576,"articleLive":1,"articleSlug":"pacific-atlantic-water-flow","columnArticles":1,"formTitle":"[417]Pacific Atlantic Water Flow","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"","submitted":357377,"title":"Pacific Atlantic Water Flow","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35176289568986546,"acs":74986,"articleLive":0,"columnArticles":0,"formTitle":"[418]Sentence Screen Fitting","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":213172,"title":"Sentence Screen Fitting","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7295840656121851,"acs":136994,"articleLive":0,"columnArticles":0,"formTitle":"[419]Battleships in a Board","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":187770,"title":"Battleships in a Board","titleSlug":"battleships-in-a-board"},{"acceptance":0.13993396900485378,"acs":22718,"articleLive":0,"columnArticles":0,"formTitle":"[420]Strong Password Checker","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":162348,"title":"Strong Password Checker","titleSlug":"strong-password-checker"},{"acceptance":0.5415567160598623,"acs":117390,"articleLive":1,"articleSlug":"maximum-xor-of-two-numbers-in-an-array","columnArticles":1,"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":216764,"title":"Maximum XOR of Two Numbers in an Array","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.38618642034548945,"acs":38631,"articleLive":0,"columnArticles":0,"formTitle":"[422]Valid Word Square","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":100032,"title":"Valid Word Square","titleSlug":"valid-word-square"},{"acceptance":0.5134796806966618,"acs":56606,"articleLive":1,"articleSlug":"reconstruct-original-digits-from-english","columnArticles":1,"formTitle":"[423]Reconstruct Original Digits from English","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":110240,"title":"Reconstruct Original Digits from English","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5035439102228288,"acs":177822,"articleLive":0,"columnArticles":0,"formTitle":"[424]Longest Repeating Character Replacement","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":353141,"title":"Longest Repeating Character Replacement","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.5194362135213794,"acs":59076,"articleLive":1,"articleSlug":"word-squares","columnArticles":1,"formTitle":"[425]Word Squares","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":113731,"title":"Word Squares","titleSlug":"word-squares"},{"acceptance":0.6401309324485805,"acs":186956,"articleLive":1,"articleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list","columnArticles":1,"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":292059,"title":"Convert Binary Search Tree to Sorted Doubly Linked List","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.646598517148679,"acs":37762,"articleLive":0,"columnArticles":0,"formTitle":"[427]Construct Quad Tree","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":58401,"title":"Construct Quad Tree","titleSlug":"construct-quad-tree"},{"acceptance":0.6397143248396238,"acs":60730,"articleLive":1,"articleSlug":"serialize-and-deserialize-n-ary-tree","columnArticles":1,"formTitle":"[428]Serialize and Deserialize N-ary Tree","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":94933,"title":"Serialize and Deserialize N-ary Tree","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6852445564823118,"acs":162011,"articleLive":1,"articleSlug":"n-ary-tree-level-order-traversal","columnArticles":1,"formTitle":"[429]N-ary Tree Level Order Traversal","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"","submitted":236428,"title":"N-ary Tree Level Order Traversal","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5873494546665331,"acs":216971,"articleLive":1,"articleSlug":"flatten-a-multilevel-doubly-linked-list","columnArticles":1,"formTitle":"[430]Flatten a Multilevel Doubly Linked List","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"","submitted":369407,"title":"Flatten a Multilevel Doubly Linked List","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7609251758686847,"acs":14278,"articleLive":1,"articleSlug":"encode-n-ary-tree-to-binary-tree","columnArticles":1,"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":18764,"title":"Encode N-ary Tree to Binary Tree","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3521104788002523,"acs":51912,"articleLive":0,"columnArticles":0,"formTitle":"[432]All O`one Data Structure","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":147431,"title":"All O`one Data Structure","titleSlug":"all-oone-data-structure"},{"acceptance":0.45504630504630506,"acs":48153,"articleLive":0,"columnArticles":0,"formTitle":"[433]Minimum Genetic Mutation","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":105820,"title":"Minimum Genetic Mutation","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37931332400255735,"acs":109760,"articleLive":1,"articleSlug":"number-of-segments-in-a-string","columnArticles":1,"formTitle":"[434]Number of Segments in a String","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":289365,"title":"Number of Segments in a String","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.47477996238066505,"acs":214046,"articleLive":1,"articleSlug":"non-overlapping-intervals","columnArticles":1,"formTitle":"[435]Non-overlapping Intervals","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":450832,"title":"Non-overlapping Intervals","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4922164865300855,"acs":73230,"articleLive":1,"articleSlug":"find-right-interval","columnArticles":1,"formTitle":"[436]Find Right Interval","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"","submitted":148776,"title":"Find Right Interval","titleSlug":"find-right-interval"},{"acceptance":0.4998816737467643,"acs":342193,"articleLive":1,"articleSlug":"path-sum-iii","columnArticles":1,"formTitle":"[437]Path Sum III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":684548,"title":"Path Sum III","titleSlug":"path-sum-iii"},{"acceptance":0.47778001167072853,"acs":487166,"articleLive":1,"articleSlug":"find-all-anagrams-in-a-string","columnArticles":1,"formTitle":"[438]Find All Anagrams in a String","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"","submitted":1019645,"title":"Find All Anagrams in a String","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5761301124132983,"acs":24088,"articleLive":0,"columnArticles":0,"formTitle":"[439]Ternary Expression Parser","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":41810,"title":"Ternary Expression Parser","titleSlug":"ternary-expression-parser"},{"acceptance":0.3041907774143694,"acs":16927,"articleLive":0,"columnArticles":0,"formTitle":"[440]K-th Smallest in Lexicographical Order","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":55646,"title":"K-th Smallest in Lexicographical Order","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.44938780268402895,"acs":258278,"articleLive":1,"articleSlug":"arranging-coins","columnArticles":1,"formTitle":"[441]Arranging Coins","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"","submitted":574733,"title":"Arranging Coins","titleSlug":"arranging-coins"},{"acceptance":0.7196069234107899,"acs":369729,"articleLive":1,"articleSlug":"find-all-duplicates-in-an-array","columnArticles":1,"formTitle":"[442]Find All Duplicates in an Array","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":513793,"title":"Find All Duplicates in an Array","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4701699970665403,"acs":229198,"articleLive":0,"columnArticles":0,"formTitle":"[443]String Compression","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":487479,"title":"String Compression","titleSlug":"string-compression"},{"acceptance":0.24428752132387926,"acs":42101,"articleLive":0,"columnArticles":0,"formTitle":"[444]Sequence Reconstruction","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":172342,"title":"Sequence Reconstruction","titleSlug":"sequence-reconstruction"},{"acceptance":0.5817993873510702,"acs":292111,"articleLive":1,"articleSlug":"add-two-numbers-ii","columnArticles":1,"formTitle":"[445]Add Two Numbers II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"","submitted":502082,"title":"Add Two Numbers II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.3921808242691095,"acs":42041,"articleLive":1,"articleSlug":"arithmetic-slices-ii-subsequence","columnArticles":1,"formTitle":"[446]Arithmetic Slices II - Subsequence","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"","submitted":107198,"title":"Arithmetic Slices II - Subsequence","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.5367033953694107,"acs":81295,"articleLive":0,"columnArticles":0,"formTitle":"[447]Number of Boomerangs","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":151471,"title":"Number of Boomerangs","titleSlug":"number-of-boomerangs"},{"acceptance":0.5869250308019214,"acs":525913,"articleLive":1,"articleSlug":"find-all-numbers-disappeared-in-an-array","columnArticles":1,"formTitle":"[448]Find All Numbers Disappeared in an Array","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":896048,"title":"Find All Numbers Disappeared in an Array","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5580934708365253,"acs":182861,"articleLive":1,"articleSlug":"serialize-and-deserialize-bst","columnArticles":1,"formTitle":"[449]Serialize and Deserialize BST","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":327653,"title":"Serialize and Deserialize BST","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.484240826815165,"acs":249308,"articleLive":1,"articleSlug":"delete-node-in-a-bst","columnArticles":1,"formTitle":"[450]Delete Node in a BST","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":514843,"title":"Delete Node in a BST","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.672712686663966,"acs":337097,"articleLive":1,"articleSlug":"sort-characters-by-frequency","columnArticles":1,"formTitle":"[451]Sort Characters By Frequency","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"","submitted":501101,"title":"Sort Characters By Frequency","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5270371308142565,"acs":176929,"articleLive":1,"articleSlug":"minimum-number-of-arrows-to-burst-balloons","columnArticles":1,"formTitle":"[452]Minimum Number of Arrows to Burst Balloons","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"","submitted":335705,"title":"Minimum Number of Arrows to Burst Balloons","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5342427629839559,"acs":115179,"articleLive":1,"articleSlug":"minimum-moves-to-equal-array-elements","columnArticles":1,"formTitle":"[453]Minimum Moves to Equal Array Elements","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":2,"nodeType":"def","questionId":"453","status":"","submitted":215593,"title":"Minimum Moves to Equal Array Elements","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5684405556463784,"acs":239920,"articleLive":1,"articleSlug":"4sum-ii","columnArticles":1,"formTitle":"[454]4Sum II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":422067,"title":"4Sum II","titleSlug":"4sum-ii"},{"acceptance":0.5071073463486132,"acs":153616,"articleLive":0,"columnArticles":0,"formTitle":"[455]Assign Cookies","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":302926,"title":"Assign Cookies","titleSlug":"assign-cookies"},{"acceptance":0.3087704319226526,"acs":102706,"articleLive":1,"articleSlug":"132-pattern","columnArticles":1,"formTitle":"[456]132 Pattern","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"","submitted":332629,"title":"132 Pattern","titleSlug":"132-pattern"},{"acceptance":0.3140449817641497,"acs":55797,"articleLive":0,"columnArticles":0,"formTitle":"[457]Circular Array Loop","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"","submitted":177672,"title":"Circular Array Loop","titleSlug":"circular-array-loop"},{"acceptance":0.5535546297540653,"acs":32952,"articleLive":1,"articleSlug":"poor-pigs","columnArticles":1,"formTitle":"[458]Poor Pigs","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":59528,"title":"Poor Pigs","titleSlug":"poor-pigs"},{"acceptance":0.4352657792961815,"acs":226780,"articleLive":0,"columnArticles":0,"formTitle":"[459]Repeated Substring Pattern","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":521015,"title":"Repeated Substring Pattern","titleSlug":"repeated-substring-pattern"},{"acceptance":0.3894246391258612,"acs":141418,"articleLive":0,"columnArticles":0,"formTitle":"[460]LFU Cache","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":363146,"title":"LFU Cache","titleSlug":"lfu-cache"},{"acceptance":0.7438479199667337,"acs":459730,"articleLive":1,"articleSlug":"hamming-distance","columnArticles":1,"formTitle":"[461]Hamming Distance","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"","submitted":618043,"title":"Hamming Distance","titleSlug":"hamming-distance"},{"acceptance":0.5659734732863348,"acs":83253,"articleLive":1,"articleSlug":"minimum-moves-to-equal-array-elements-ii","columnArticles":1,"formTitle":"[462]Minimum Moves to Equal Array Elements II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":147097,"title":"Minimum Moves to Equal Array Elements II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.6868603696017079,"acs":346179,"articleLive":1,"articleSlug":"island-perimeter","columnArticles":1,"formTitle":"[463]Island Perimeter","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":504002,"title":"Island Perimeter","titleSlug":"island-perimeter"},{"acceptance":0.29768286428086893,"acs":71969,"articleLive":0,"columnArticles":0,"formTitle":"[464]Can I Win","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":241764,"title":"Can I Win","titleSlug":"can-i-win"},{"acceptance":0.4868016640247669,"acs":65413,"articleLive":0,"columnArticles":0,"formTitle":"[465]Optimal Account Balancing","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":134373,"title":"Optimal Account Balancing","titleSlug":"optimal-account-balancing"},{"acceptance":0.2893686730793464,"acs":13778,"articleLive":1,"articleSlug":"count-the-repetitions","columnArticles":1,"formTitle":"[466]Count The Repetitions","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":47614,"title":"Count The Repetitions","titleSlug":"count-the-repetitions"},{"acceptance":0.3725425336023728,"acs":33787,"articleLive":0,"columnArticles":0,"formTitle":"[467]Unique Substrings in Wraparound String","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":90693,"title":"Unique Substrings in Wraparound String","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.26047166109088704,"acs":120135,"articleLive":1,"articleSlug":"validate-ip-address","columnArticles":1,"formTitle":"[468]Validate IP Address","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":461221,"title":"Validate IP Address","titleSlug":"validate-ip-address"},{"acceptance":0.38173311635476,"acs":9383,"articleLive":0,"columnArticles":0,"formTitle":"[469]Convex Polygon","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":24580,"title":"Convex Polygon","titleSlug":"convex-polygon"},{"acceptance":0.46613009818731116,"acs":59247,"articleLive":1,"articleSlug":"implement-rand10-using-rand7","columnArticles":1,"formTitle":"[470]Implement Rand10() Using Rand7()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":127104,"title":"Implement Rand10() Using Rand7()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.5079758285478362,"acs":27068,"articleLive":0,"columnArticles":0,"formTitle":"[471]Encode String with Shortest Length","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":53286,"title":"Encode String with Shortest Length","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.42224151389875836,"acs":120623,"articleLive":0,"columnArticles":0,"formTitle":"[472]Concatenated Words","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":285673,"title":"Concatenated Words","titleSlug":"concatenated-words"},{"acceptance":0.40414393320227077,"acs":73184,"articleLive":1,"articleSlug":"matchsticks-to-square","columnArticles":1,"formTitle":"[473]Matchsticks to Square","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":181084,"title":"Matchsticks to Square","titleSlug":"matchsticks-to-square"},{"acceptance":0.44304906798005383,"acs":101110,"articleLive":1,"articleSlug":"ones-and-zeroes","columnArticles":1,"formTitle":"[474]Ones and Zeroes","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"","submitted":228214,"title":"Ones and Zeroes","titleSlug":"ones-and-zeroes"},{"acceptance":0.3492931697263495,"acs":84231,"articleLive":0,"columnArticles":0,"formTitle":"[475]Heaters","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":241147,"title":"Heaters","titleSlug":"heaters"},{"acceptance":0.6653555556707927,"acs":256613,"articleLive":1,"articleSlug":"number-complement","columnArticles":1,"formTitle":"[476]Number Complement","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":385678,"title":"Number Complement","titleSlug":"number-complement"},{"acceptance":0.5181636873080546,"acs":84698,"articleLive":1,"articleSlug":"total-hamming-distance","columnArticles":1,"formTitle":"[477]Total Hamming Distance","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"","submitted":163458,"title":"Total Hamming Distance","titleSlug":"total-hamming-distance"},{"acceptance":0.3927056007543429,"acs":32485,"articleLive":1,"articleSlug":"generate-random-point-in-a-circle","columnArticles":1,"formTitle":"[478]Generate Random Point in a Circle","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":82721,"title":"Generate Random Point in a Circle","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.30690824956618257,"acs":19632,"articleLive":0,"columnArticles":0,"formTitle":"[479]Largest Palindrome Product","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":63967,"title":"Largest Palindrome Product","titleSlug":"largest-palindrome-product"},{"acceptance":0.4059639626866605,"acs":97353,"articleLive":1,"articleSlug":"sliding-window-median","columnArticles":1,"formTitle":"[480]Sliding Window Median","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"","submitted":239807,"title":"Sliding Window Median","titleSlug":"sliding-window-median"},{"acceptance":0.4935869246555262,"acs":26938,"articleLive":0,"columnArticles":0,"formTitle":"[481]Magical String","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":54576,"title":"Magical String","titleSlug":"magical-string"},{"acceptance":0.43128042409770895,"acs":201028,"articleLive":0,"columnArticles":0,"formTitle":"[482]License Key Formatting","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":466119,"title":"License Key Formatting","titleSlug":"license-key-formatting"},{"acceptance":0.3764659890539484,"acs":16371,"articleLive":0,"columnArticles":0,"formTitle":"[483]Smallest Good Base","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"","submitted":43486,"title":"Smallest Good Base","titleSlug":"smallest-good-base"},{"acceptance":0.6430356627895799,"acs":26758,"articleLive":1,"articleSlug":"find-permutation","columnArticles":1,"formTitle":"[484]Find Permutation","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":41612,"title":"Find Permutation","titleSlug":"find-permutation"},{"acceptance":0.5476926859746392,"acs":596956,"articleLive":1,"articleSlug":"max-consecutive-ones","columnArticles":1,"formTitle":"[485]Max Consecutive Ones","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":1089947,"title":"Max Consecutive Ones","titleSlug":"max-consecutive-ones"},{"acceptance":0.499425696520955,"acs":105224,"articleLive":1,"articleSlug":"predict-the-winner","columnArticles":1,"formTitle":"[486]Predict the Winner","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"","submitted":210690,"title":"Predict the Winner","titleSlug":"predict-the-winner"},{"acceptance":0.4867550638956108,"acs":83074,"articleLive":1,"articleSlug":"max-consecutive-ones-ii","columnArticles":1,"formTitle":"[487]Max Consecutive Ones II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":170669,"title":"Max Consecutive Ones II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.369889142792393,"acs":19586,"articleLive":0,"columnArticles":0,"formTitle":"[488]Zuma Game","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":52951,"title":"Zuma Game","titleSlug":"zuma-game"},{"acceptance":0.7525072882230684,"acs":107896,"articleLive":1,"articleSlug":"robot-room-cleaner","columnArticles":1,"formTitle":"[489]Robot Room Cleaner","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":143382,"title":"Robot Room Cleaner","titleSlug":"robot-room-cleaner"},{"acceptance":0.5436945795979718,"acs":111409,"articleLive":1,"articleSlug":"the-maze","columnArticles":1,"formTitle":"[490]The Maze","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":204911,"title":"The Maze","titleSlug":"the-maze"},{"acceptance":0.5026777351151533,"acs":70303,"articleLive":0,"columnArticles":0,"formTitle":"[491]Increasing Subsequences","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"","submitted":139857,"title":"Increasing Subsequences","titleSlug":"increasing-subsequences"},{"acceptance":0.5224886305161119,"acs":75137,"articleLive":0,"columnArticles":0,"formTitle":"[492]Construct the Rectangle","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":143806,"title":"Construct the Rectangle","titleSlug":"construct-the-rectangle"},{"acceptance":0.2949253217406276,"acs":75372,"articleLive":0,"columnArticles":0,"formTitle":"[493]Reverse Pairs","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":255563,"title":"Reverse Pairs","titleSlug":"reverse-pairs"},{"acceptance":0.45319555190045413,"acs":316863,"articleLive":1,"articleSlug":"target-sum","columnArticles":1,"formTitle":"[494]Target Sum","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"","submitted":699175,"title":"Target Sum","titleSlug":"target-sum"},{"acceptance":0.5677895764677163,"acs":93038,"articleLive":1,"articleSlug":"teemo-attacking","columnArticles":1,"formTitle":"[495]Teemo Attacking","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":163860,"title":"Teemo Attacking","titleSlug":"teemo-attacking"},{"acceptance":0.6937186078898562,"acs":315318,"articleLive":1,"articleSlug":"next-greater-element-i","columnArticles":1,"formTitle":"[496]Next Greater Element I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"","submitted":454533,"title":"Next Greater Element I","titleSlug":"next-greater-element-i"},{"acceptance":0.39113097123019364,"acs":33349,"articleLive":0,"columnArticles":0,"formTitle":"[497]Random Point in Non-overlapping Rectangles","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":85263,"title":"Random Point in Non-overlapping Rectangles","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.5535924028489316,"acs":177216,"articleLive":1,"articleSlug":"diagonal-traverse","columnArticles":1,"formTitle":"[498]Diagonal Traverse","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":320120,"title":"Diagonal Traverse","titleSlug":"diagonal-traverse"},{"acceptance":0.44642039065428346,"acs":21438,"articleLive":0,"columnArticles":0,"formTitle":"[499]The Maze III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":48022,"title":"The Maze III","titleSlug":"the-maze-iii"},{"acceptance":0.6758888116358613,"acs":144845,"articleLive":0,"columnArticles":0,"formTitle":"[500]Keyboard Row","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":214303,"title":"Keyboard Row","titleSlug":"keyboard-row"},{"acceptance":0.4658522877545623,"acs":140911,"articleLive":0,"columnArticles":0,"formTitle":"[501]Find Mode in Binary Search Tree","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":302480,"title":"Find Mode in Binary Search Tree","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.43622063123928606,"acs":30282,"articleLive":1,"articleSlug":"ipo","columnArticles":1,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":69419,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6141318044354839,"acs":194950,"articleLive":1,"articleSlug":"next-greater-element-ii","columnArticles":1,"formTitle":"[503]Next Greater Element II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"","submitted":317440,"title":"Next Greater Element II","titleSlug":"next-greater-element-ii"},{"acceptance":0.47265188872348346,"acs":81281,"articleLive":0,"columnArticles":0,"formTitle":"[504]Base 7","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":171968,"title":"Base 7","titleSlug":"base-7"},{"acceptance":0.5095314852065488,"acs":76498,"articleLive":1,"articleSlug":"the-maze-ii","columnArticles":1,"formTitle":"[505]The Maze II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":150134,"title":"The Maze II","titleSlug":"the-maze-ii"},{"acceptance":0.5564905316675957,"acs":81872,"articleLive":0,"columnArticles":0,"formTitle":"[506]Relative Ranks","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":147122,"title":"Relative Ranks","titleSlug":"relative-ranks"},{"acceptance":0.3748448201847848,"acs":96924,"articleLive":1,"articleSlug":"perfect-number","columnArticles":1,"formTitle":"[507]Perfect Number","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":258571,"title":"Perfect Number","titleSlug":"perfect-number"},{"acceptance":0.6209947437182876,"acs":102194,"articleLive":0,"columnArticles":0,"formTitle":"[508]Most Frequent Subtree Sum","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":164565,"title":"Most Frequent Subtree Sum","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6804922381710737,"acs":646929,"articleLive":1,"articleSlug":"fibonacci-number","columnArticles":1,"formTitle":"[509]Fibonacci Number","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":950678,"title":"Fibonacci Number","titleSlug":"fibonacci-number"},{"acceptance":0.6159104775639248,"acs":44417,"articleLive":1,"articleSlug":"inorder-successor-in-bst-ii","columnArticles":1,"formTitle":"[510]Inorder Successor in BST II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":72116,"title":"Inorder Successor in BST II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.8090131818974953,"acs":51001,"articleLive":0,"columnArticles":0,"formTitle":"[511]Game Play Analysis I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":63041,"title":"Game Play Analysis I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5457529796628006,"acs":47713,"articleLive":0,"columnArticles":0,"formTitle":"[512]Game Play Analysis II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":87426,"title":"Game Play Analysis II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.6470434925561048,"acs":161372,"articleLive":0,"columnArticles":0,"formTitle":"[513]Find Bottom Left Tree Value","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":249399,"title":"Find Bottom Left Tree Value","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.4587280108254398,"acs":26103,"articleLive":0,"columnArticles":0,"formTitle":"[514]Freedom Trail","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":56903,"title":"Freedom Trail","titleSlug":"freedom-trail"},{"acceptance":0.6416202001243958,"acs":176400,"articleLive":0,"columnArticles":0,"formTitle":"[515]Find Largest Value in Each Tree Row","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":274929,"title":"Find Largest Value in Each Tree Row","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.5870384402190773,"acs":230874,"articleLive":0,"columnArticles":0,"formTitle":"[516]Longest Palindromic Subsequence","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"","submitted":393286,"title":"Longest Palindromic Subsequence","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.39195009653943264,"acs":21112,"articleLive":0,"columnArticles":0,"formTitle":"[517]Super Washing Machines","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":53864,"title":"Super Washing Machines","titleSlug":"super-washing-machines"},{"acceptance":0.5646357519642292,"acs":264175,"articleLive":1,"articleSlug":"coin-change-2","columnArticles":1,"formTitle":"[518]Coin Change 2","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"","submitted":467868,"title":"Coin Change 2","titleSlug":"coin-change-2"},{"acceptance":0.3888888888888889,"acs":12747,"articleLive":0,"columnArticles":0,"formTitle":"[519]Random Flip Matrix","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":32778,"title":"Random Flip Matrix","titleSlug":"random-flip-matrix"},{"acceptance":0.557170167088343,"acs":255896,"articleLive":1,"articleSlug":"detect-capital","columnArticles":1,"formTitle":"[520]Detect Capital","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":459278,"title":"Detect Capital","titleSlug":"detect-capital"},{"acceptance":0.5994660727586487,"acs":81287,"articleLive":1,"articleSlug":"longest-uncommon-subsequence-i","columnArticles":1,"formTitle":"[521]Longest Uncommon Subsequence I","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":135599,"title":"Longest Uncommon Subsequence I","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.4006734327902629,"acs":42005,"articleLive":1,"articleSlug":"longest-uncommon-subsequence-ii","columnArticles":1,"formTitle":"[522]Longest Uncommon Subsequence II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":104836,"title":"Longest Uncommon Subsequence II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.26790097346806385,"acs":263479,"articleLive":0,"columnArticles":0,"formTitle":"[523]Continuous Subarray Sum","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"","submitted":983494,"title":"Continuous Subarray Sum","titleSlug":"continuous-subarray-sum"},{"acceptance":0.508041231944311,"acs":121589,"articleLive":1,"articleSlug":"longest-word-in-dictionary-through-deleting","columnArticles":1,"formTitle":"[524]Longest Word in Dictionary through Deleting","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":239329,"title":"Longest Word in Dictionary through Deleting","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.4607441075447116,"acs":248964,"articleLive":1,"articleSlug":"contiguous-array","columnArticles":1,"formTitle":"[525]Contiguous Array","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"","submitted":540352,"title":"Contiguous Array","titleSlug":"contiguous-array"},{"acceptance":0.6399847994637589,"acs":121256,"articleLive":1,"articleSlug":"beautiful-arrangement","columnArticles":1,"formTitle":"[526]Beautiful Arrangement","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"","submitted":189467,"title":"Beautiful Arrangement","titleSlug":"beautiful-arrangement"},{"acceptance":0.579290133507001,"acs":21348,"articleLive":1,"articleSlug":"word-abbreviation","columnArticles":1,"formTitle":"[527]Word Abbreviation","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":36852,"title":"Word Abbreviation","titleSlug":"word-abbreviation"},{"acceptance":0.45961357083187365,"acs":255837,"articleLive":1,"articleSlug":"random-pick-with-weight","columnArticles":1,"formTitle":"[528]Random Pick with Weight","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":556635,"title":"Random Pick with Weight","titleSlug":"random-pick-with-weight"},{"acceptance":0.6414879686194576,"acs":108262,"articleLive":0,"columnArticles":0,"formTitle":"[529]Minesweeper","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":168767,"title":"Minesweeper","titleSlug":"minesweeper"},{"acceptance":0.5600173045130789,"acs":144984,"articleLive":0,"columnArticles":0,"formTitle":"[530]Minimum Absolute Difference in BST","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"","submitted":258892,"title":"Minimum Absolute Difference in BST","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6058428243701403,"acs":29842,"articleLive":0,"columnArticles":0,"formTitle":"[531]Lonely Pixel I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":49257,"title":"Lonely Pixel I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37469413304501226,"acs":197535,"articleLive":1,"articleSlug":"k-diff-pairs-in-an-array","columnArticles":1,"formTitle":"[532]K-diff Pairs in an Array","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":527190,"title":"K-diff Pairs in an Array","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.4838525059275611,"acs":11836,"articleLive":0,"columnArticles":0,"formTitle":"[533]Lonely Pixel II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":24462,"title":"Lonely Pixel II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.8139121257133922,"acs":41643,"articleLive":0,"columnArticles":0,"formTitle":"[534]Game Play Analysis III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":51164,"title":"Game Play Analysis III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8328837633903935,"acs":161487,"articleLive":1,"articleSlug":"encode-and-decode-tinyurl","columnArticles":1,"formTitle":"[535]Encode and Decode TinyURL","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":193889,"title":"Encode and Decode TinyURL","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5522958475725307,"acs":69655,"articleLive":1,"articleSlug":"construct-binary-tree-from-string","columnArticles":1,"formTitle":"[536]Construct Binary Tree from String","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":126119,"title":"Construct Binary Tree from String","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7099962298701998,"acs":79095,"articleLive":1,"articleSlug":"complex-number-multiplication","columnArticles":1,"formTitle":"[537]Complex Number Multiplication","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":111402,"title":"Complex Number Multiplication","titleSlug":"complex-number-multiplication"},{"acceptance":0.6234440853942306,"acs":190229,"articleLive":1,"articleSlug":"convert-bst-to-greater-tree","columnArticles":1,"formTitle":"[538]Convert BST to Greater Tree","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":305126,"title":"Convert BST to Greater Tree","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5351782808863336,"acs":73351,"articleLive":0,"columnArticles":0,"formTitle":"[539]Minimum Time Difference","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":137059,"title":"Minimum Time Difference","titleSlug":"minimum-time-difference"},{"acceptance":0.5873378099534852,"acs":268700,"articleLive":1,"articleSlug":"single-element-in-a-sorted-array","columnArticles":1,"formTitle":"[540]Single Element in a Sorted Array","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"","submitted":457488,"title":"Single Element in a Sorted Array","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.4996897064090698,"acs":140908,"articleLive":1,"articleSlug":"reverse-string-ii","columnArticles":1,"formTitle":"[541]Reverse String II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"","submitted":281991,"title":"Reverse String II","titleSlug":"reverse-string-ii"},{"acceptance":0.43373479090779926,"acs":210642,"articleLive":1,"articleSlug":"01-matrix","columnArticles":1,"formTitle":"[542]01 Matrix","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"","submitted":485647,"title":"01 Matrix","titleSlug":"01-matrix"},{"acceptance":0.5335196075721534,"acs":656275,"articleLive":1,"articleSlug":"diameter-of-binary-tree","columnArticles":1,"formTitle":"[543]Diameter of Binary Tree","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":1230086,"title":"Diameter of Binary Tree","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7636523046092184,"acs":24388,"articleLive":0,"columnArticles":0,"formTitle":"[544]Output Contest Matches","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":31936,"title":"Output Contest Matches","titleSlug":"output-contest-matches"},{"acceptance":0.42621179447633206,"acs":92300,"articleLive":1,"articleSlug":"boundary-of-binary-tree","columnArticles":1,"formTitle":"[545]Boundary of Binary Tree","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":216559,"title":"Boundary of Binary Tree","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.4730477939067072,"acs":32979,"articleLive":1,"articleSlug":"remove-boxes","columnArticles":1,"formTitle":"[546]Remove Boxes","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":69716,"title":"Remove Boxes","titleSlug":"remove-boxes"},{"acceptance":0.624709034146103,"acs":409007,"articleLive":1,"articleSlug":"number-of-provinces","columnArticles":1,"formTitle":"[547]Number of Provinces","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"","submitted":654716,"title":"Number of Provinces","titleSlug":"number-of-provinces"},{"acceptance":0.49721185308078714,"acs":21578,"articleLive":1,"articleSlug":"split-array-with-equal-sum","columnArticles":1,"formTitle":"[548]Split Array with Equal Sum","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":43398,"title":"Split Array with Equal Sum","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48469917321848266,"acs":40627,"articleLive":1,"articleSlug":"binary-tree-longest-consecutive-sequence-ii","columnArticles":1,"formTitle":"[549]Binary Tree Longest Consecutive Sequence II","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":83819,"title":"Binary Tree Longest Consecutive Sequence II","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4424711113376056,"acs":34730,"articleLive":0,"columnArticles":0,"formTitle":"[550]Game Play Analysis IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":78491,"title":"Game Play Analysis IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.47274413637066287,"acs":134560,"articleLive":1,"articleSlug":"student-attendance-record-i","columnArticles":1,"formTitle":"[551]Student Attendance Record I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"","submitted":284636,"title":"Student Attendance Record I","titleSlug":"student-attendance-record-i"},{"acceptance":0.4011011184134671,"acs":41745,"articleLive":1,"articleSlug":"student-attendance-record-ii","columnArticles":1,"formTitle":"[552]Student Attendance Record II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"","submitted":104076,"title":"Student Attendance Record II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.5869128863910076,"acs":30702,"articleLive":1,"articleSlug":"optimal-division","columnArticles":1,"formTitle":"[553]Optimal Division","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":52311,"title":"Optimal Division","titleSlug":"optimal-division"},{"acceptance":0.5240762261389803,"acs":97409,"articleLive":1,"articleSlug":"brick-wall","columnArticles":1,"formTitle":"[554]Brick Wall","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"","submitted":185868,"title":"Brick Wall","titleSlug":"brick-wall"},{"acceptance":0.43156175771971494,"acs":5814,"articleLive":0,"columnArticles":0,"formTitle":"[555]Split Concatenated Strings","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":13472,"title":"Split Concatenated Strings","titleSlug":"split-concatenated-strings"},{"acceptance":0.3362033759869317,"acs":88911,"articleLive":1,"articleSlug":"next-greater-element-iii","columnArticles":1,"formTitle":"[556]Next Greater Element III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":264456,"title":"Next Greater Element III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7744303401098371,"acs":385815,"articleLive":1,"articleSlug":"reverse-words-in-a-string-iii","columnArticles":1,"formTitle":"[557]Reverse Words in a String III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"","submitted":498192,"title":"Reverse Words in a String III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.47036860157165805,"acs":10834,"articleLive":0,"columnArticles":0,"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":23033,"title":"Logical OR of Two Binary Grids Represented as Quad-Trees","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7068365377742835,"acs":197787,"articleLive":1,"articleSlug":"maximum-depth-of-n-ary-tree","columnArticles":1,"formTitle":"[559]Maximum Depth of N-ary Tree","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":279820,"title":"Maximum Depth of N-ary Tree","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4384307460658477,"acs":668542,"articleLive":1,"articleSlug":"subarray-sum-equals-k","columnArticles":1,"formTitle":"[560]Subarray Sum Equals K","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":1524852,"title":"Subarray Sum Equals K","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7520509488668872,"acs":310215,"articleLive":0,"columnArticles":0,"formTitle":"[561]Array Partition I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":412492,"title":"Array Partition I","titleSlug":"array-partition-i"},{"acceptance":0.4881330658761294,"acs":54996,"articleLive":1,"articleSlug":"longest-line-of-consecutive-one-in-matrix","columnArticles":1,"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":112666,"title":"Longest Line of Consecutive One in Matrix","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.5812266511914693,"acs":160250,"articleLive":1,"articleSlug":"binary-tree-tilt","columnArticles":1,"formTitle":"[563]Binary Tree Tilt","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":275710,"title":"Binary Tree Tilt","titleSlug":"binary-tree-tilt"},{"acceptance":0.21016898861163705,"acs":29749,"articleLive":0,"columnArticles":0,"formTitle":"[564]Find the Closest Palindrome","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"","submitted":141548,"title":"Find the Closest Palindrome","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.5622173670037092,"acs":110650,"articleLive":1,"articleSlug":"array-nesting","columnArticles":1,"formTitle":"[565]Array Nesting","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":196810,"title":"Array Nesting","titleSlug":"array-nesting"},{"acceptance":0.6208181412593652,"acs":201769,"articleLive":1,"articleSlug":"reshape-the-matrix","columnArticles":1,"formTitle":"[566]Reshape the Matrix","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"","submitted":325005,"title":"Reshape the Matrix","titleSlug":"reshape-the-matrix"},{"acceptance":0.44104280514826216,"acs":292403,"articleLive":1,"articleSlug":"permutation-in-string","columnArticles":1,"formTitle":"[567]Permutation in String","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"","submitted":662981,"title":"Permutation in String","titleSlug":"permutation-in-string"},{"acceptance":0.4399440401404377,"acs":32705,"articleLive":1,"articleSlug":"maximum-vacation-days","columnArticles":1,"formTitle":"[568]Maximum Vacation Days","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":74339,"title":"Maximum Vacation Days","titleSlug":"maximum-vacation-days"},{"acceptance":0.6629595883803194,"acs":24739,"articleLive":0,"columnArticles":0,"formTitle":"[569]Median Employee Salary","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":37316,"title":"Median Employee Salary","titleSlug":"median-employee-salary"},{"acceptance":0.6701334052360592,"acs":52192,"articleLive":1,"articleSlug":"managers-with-at-least-5-direct-reports","columnArticles":1,"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":77883,"title":"Managers with at Least 5 Direct Reports","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4489567615380613,"acs":17257,"articleLive":0,"columnArticles":0,"formTitle":"[571]Find Median Given Frequency of Numbers","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":38438,"title":"Find Median Given Frequency of Numbers","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.45135937679100135,"acs":417400,"articleLive":0,"columnArticles":0,"formTitle":"[572]Subtree of Another Tree","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"","submitted":924762,"title":"Subtree of Another Tree","titleSlug":"subtree-of-another-tree"},{"acceptance":0.546327757449033,"acs":16722,"articleLive":1,"articleSlug":"squirrel-simulation","columnArticles":1,"formTitle":"[573]Squirrel Simulation","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":30608,"title":"Squirrel Simulation","titleSlug":"squirrel-simulation"},{"acceptance":0.572437827136387,"acs":42215,"articleLive":1,"articleSlug":"winning-candidate","columnArticles":1,"formTitle":"[574]Winning Candidate","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":73746,"title":"Winning Candidate","titleSlug":"winning-candidate"},{"acceptance":0.6539844137727523,"acs":195026,"articleLive":1,"articleSlug":"distribute-candies","columnArticles":1,"formTitle":"[575]Distribute Candies","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":298212,"title":"Distribute Candies","titleSlug":"distribute-candies"},{"acceptance":0.3994687811261059,"acs":61362,"articleLive":1,"articleSlug":"out-of-boundary-paths","columnArticles":1,"formTitle":"[576]Out of Boundary Paths","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"","submitted":153609,"title":"Out of Boundary Paths","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7457242023389693,"acs":53499,"articleLive":1,"articleSlug":"employee-bonus","columnArticles":1,"formTitle":"[577]Employee Bonus","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":71741,"title":"Employee Bonus","titleSlug":"employee-bonus"},{"acceptance":0.42935829379433454,"acs":36559,"articleLive":0,"columnArticles":0,"formTitle":"[578]Get Highest Answer Rate Question","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":85148,"title":"Get Highest Answer Rate Question","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41629522131232505,"acs":24096,"articleLive":1,"articleSlug":"find-cumulative-salary-of-an-employee","columnArticles":1,"formTitle":"[579]Find Cumulative Salary of an Employee","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":57882,"title":"Find Cumulative Salary of an Employee","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.557907187086899,"acs":40094,"articleLive":1,"articleSlug":"count-student-number-in-departments","columnArticles":1,"formTitle":"[580]Count Student Number in Departments","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":71865,"title":"Count Student Number in Departments","titleSlug":"count-student-number-in-departments"},{"acceptance":0.33947123389086475,"acs":208177,"articleLive":1,"articleSlug":"shortest-unsorted-continuous-subarray","columnArticles":1,"formTitle":"[581]Shortest Unsorted Continuous Subarray","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"","submitted":613239,"title":"Shortest Unsorted Continuous Subarray","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.6616075035759912,"acs":60592,"articleLive":1,"articleSlug":"kill-process","columnArticles":1,"formTitle":"[582]Kill Process","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":91583,"title":"Kill Process","titleSlug":"kill-process"},{"acceptance":0.5490074796376092,"acs":105623,"articleLive":1,"articleSlug":"delete-operation-for-two-strings","columnArticles":1,"formTitle":"[583]Delete Operation for Two Strings","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"","submitted":192389,"title":"Delete Operation for Two Strings","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7611926096265166,"acs":47997,"articleLive":1,"articleSlug":"find-customer-referee","columnArticles":1,"formTitle":"[584]Find Customer Referee","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":63055,"title":"Find Customer Referee","titleSlug":"find-customer-referee"},{"acceptance":0.5618156293869911,"acs":30015,"articleLive":1,"articleSlug":"investments-in-2016","columnArticles":1,"formTitle":"[585]Investments in 2016","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":53425,"title":"Investments in 2016","titleSlug":"investments-in-2016"},{"acceptance":0.7503088832295317,"acs":59513,"articleLive":1,"articleSlug":"customer-placing-the-largest-number-of-orders","columnArticles":1,"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":79318,"title":"Customer Placing the Largest Number of Orders","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.43230758038702166,"acs":23770,"articleLive":1,"articleSlug":"erect-the-fence","columnArticles":1,"formTitle":"[587]Erect the Fence","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":54984,"title":"Erect the Fence","titleSlug":"erect-the-fence"},{"acceptance":0.4824725269906421,"acs":55012,"articleLive":1,"articleSlug":"design-in-memory-file-system","columnArticles":1,"formTitle":"[588]Design In-Memory File System","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":114021,"title":"Design In-Memory File System","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7562095764083707,"acs":206480,"articleLive":1,"articleSlug":"n-ary-tree-preorder-traversal","columnArticles":1,"formTitle":"[589]N-ary Tree Preorder Traversal","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":273046,"title":"N-ary Tree Preorder Traversal","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7575173355983085,"acs":168562,"articleLive":1,"articleSlug":"n-ary-tree-postorder-traversal","columnArticles":1,"formTitle":"[590]N-ary Tree Postorder Traversal","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":222519,"title":"N-ary Tree Postorder Traversal","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3606551794592386,"acs":10591,"articleLive":1,"articleSlug":"tag-validator","columnArticles":1,"formTitle":"[591]Tag Validator","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"","submitted":29366,"title":"Tag Validator","titleSlug":"tag-validator"},{"acceptance":0.5156203566121842,"acs":27761,"articleLive":1,"articleSlug":"fraction-addition-and-subtraction","columnArticles":1,"formTitle":"[592]Fraction Addition and Subtraction","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":53840,"title":"Fraction Addition and Subtraction","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4373458765899413,"acs":78567,"articleLive":1,"articleSlug":"valid-square","columnArticles":1,"formTitle":"[593]Valid Square","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":179645,"title":"Valid Square","titleSlug":"valid-square"},{"acceptance":0.5241569933351886,"acs":111126,"articleLive":1,"articleSlug":"longest-harmonious-subsequence","columnArticles":1,"formTitle":"[594]Longest Harmonious Subsequence","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":212009,"title":"Longest Harmonious Subsequence","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7864546257885564,"acs":256315,"articleLive":1,"articleSlug":"big-countries","columnArticles":1,"formTitle":"[595]Big Countries","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":325912,"title":"Big Countries","titleSlug":"big-countries"},{"acceptance":0.4109611945712642,"acs":145013,"articleLive":1,"articleSlug":"classes-more-than-5-students","columnArticles":1,"formTitle":"[596]Classes More Than 5 Students","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":352863,"title":"Classes More Than 5 Students","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4260343699637791,"acs":53400,"articleLive":1,"articleSlug":"friend-requests-i-overall-acceptance-rate","columnArticles":1,"formTitle":"[597]Friend Requests I: Overall Acceptance Rate","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":125342,"title":"Friend Requests I: Overall Acceptance Rate","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5447831107431534,"acs":75015,"articleLive":1,"articleSlug":"range-addition-ii","columnArticles":1,"formTitle":"[598]Range Addition II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":137697,"title":"Range Addition II","titleSlug":"range-addition-ii"},{"acceptance":0.528773342987299,"acs":140218,"articleLive":1,"articleSlug":"minimum-index-sum-of-two-lists","columnArticles":1,"formTitle":"[599]Minimum Index Sum of Two Lists","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"","submitted":265176,"title":"Minimum Index Sum of Two Lists","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3854586595230045,"acs":29641,"articleLive":1,"articleSlug":"non-negative-integers-without-consecutive-ones","columnArticles":1,"formTitle":"[600]Non-negative Integers without Consecutive Ones","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":76898,"title":"Non-negative Integers without Consecutive Ones","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49042298830587316,"acs":56406,"articleLive":1,"articleSlug":"human-traffic-of-stadium","columnArticles":1,"formTitle":"[601]Human Traffic of Stadium","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":115015,"title":"Human Traffic of Stadium","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6045031490086947,"acs":45400,"articleLive":0,"columnArticles":0,"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":75103,"title":"Friend Requests II: Who Has the Most Friends","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6762711399077531,"acs":49265,"articleLive":1,"articleSlug":"consecutive-available-seats","columnArticles":1,"formTitle":"[603]Consecutive Available Seats","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":72848,"title":"Consecutive Available Seats","titleSlug":"consecutive-available-seats"},{"acceptance":0.38984932837777403,"acs":25279,"articleLive":1,"articleSlug":"design-compressed-string-iterator","columnArticles":1,"formTitle":"[604]Design Compressed String Iterator","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":64843,"title":"Design Compressed String Iterator","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3296388413531727,"acs":272759,"articleLive":1,"articleSlug":"can-place-flowers","columnArticles":1,"formTitle":"[605]Can Place Flowers","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":827448,"title":"Can Place Flowers","titleSlug":"can-place-flowers"},{"acceptance":0.5725250319606581,"acs":122707,"articleLive":1,"articleSlug":"construct-string-from-binary-tree","columnArticles":1,"formTitle":"[606]Construct String from Binary Tree","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":214326,"title":"Construct String from Binary Tree","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6768702875976342,"acs":44976,"articleLive":1,"articleSlug":"sales-person","columnArticles":1,"formTitle":"[607]Sales Person","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":66447,"title":"Sales Person","titleSlug":"sales-person"},{"acceptance":0.7102075966066291,"acs":38761,"articleLive":1,"articleSlug":"tree-node","columnArticles":1,"formTitle":"[608]Tree Node","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":54577,"title":"Tree Node","titleSlug":"tree-node"},{"acceptance":0.6362345023513674,"acs":92268,"articleLive":1,"articleSlug":"find-duplicate-file-in-system","columnArticles":1,"formTitle":"[609]Find Duplicate File in System","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":145022,"title":"Find Duplicate File in System","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.7055415037939756,"acs":46026,"articleLive":1,"articleSlug":"triangle-judgement","columnArticles":1,"formTitle":"[610]Triangle Judgement","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":65235,"title":"Triangle Judgement","titleSlug":"triangle-judgement"},{"acceptance":0.4947704833977787,"acs":128340,"articleLive":1,"articleSlug":"valid-triangle-number","columnArticles":1,"formTitle":"[611]Valid Triangle Number","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"","submitted":259393,"title":"Valid Triangle Number","titleSlug":"valid-triangle-number"},{"acceptance":0.629803528285545,"acs":27632,"articleLive":1,"articleSlug":"shortest-distance-in-a-plane","columnArticles":1,"formTitle":"[612]Shortest Distance in a Plane","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":43874,"title":"Shortest Distance in a Plane","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.808921068166823,"acs":46589,"articleLive":1,"articleSlug":"shortest-distance-in-a-line","columnArticles":1,"formTitle":"[613]Shortest Distance in a Line","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":57594,"title":"Shortest Distance in a Line","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3487598790493505,"acs":37024,"articleLive":0,"columnArticles":0,"formTitle":"[614]Second Degree Follower","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":106159,"title":"Second Degree Follower","titleSlug":"second-degree-follower"},{"acceptance":0.5584376096362998,"acs":23876,"articleLive":1,"articleSlug":"average-salary-departments-vs-company","columnArticles":1,"formTitle":"[615]Average Salary: Departments VS Company","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":42755,"title":"Average Salary: Departments VS Company","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.47537243135749924,"acs":68128,"articleLive":0,"columnArticles":0,"formTitle":"[616]Add Bold Tag in String","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":143315,"title":"Add Bold Tag in String","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7745569400785485,"acs":513752,"articleLive":1,"articleSlug":"merge-two-binary-trees","columnArticles":1,"formTitle":"[617]Merge Two Binary Trees","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"","submitted":663285,"title":"Merge Two Binary Trees","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6323014018691588,"acs":15155,"articleLive":1,"articleSlug":"students-report-by-geography","columnArticles":1,"formTitle":"[618]Students Report By Geography","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":23968,"title":"Students Report By Geography","titleSlug":"students-report-by-geography"},{"acceptance":0.4700604182108124,"acs":41857,"articleLive":1,"articleSlug":"biggest-single-number","columnArticles":1,"formTitle":"[619]Biggest Single Number","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":89046,"title":"Biggest Single Number","titleSlug":"biggest-single-number"},{"acceptance":0.7221167685279823,"acs":173095,"articleLive":1,"articleSlug":"not-boring-movies","columnArticles":1,"formTitle":"[620]Not Boring Movies","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":239705,"title":"Not Boring Movies","titleSlug":"not-boring-movies"},{"acceptance":0.5412218017829475,"acs":320675,"articleLive":1,"articleSlug":"task-scheduler","columnArticles":1,"formTitle":"[621]Task Scheduler","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":592502,"title":"Task Scheduler","titleSlug":"task-scheduler"},{"acceptance":0.48456021394170457,"acs":158363,"articleLive":1,"articleSlug":"design-circular-queue","columnArticles":1,"formTitle":"[622]Design Circular Queue","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"","submitted":326818,"title":"Design Circular Queue","titleSlug":"design-circular-queue"},{"acceptance":0.5367956350539571,"acs":79887,"articleLive":1,"articleSlug":"add-one-row-to-tree","columnArticles":1,"formTitle":"[623]Add One Row to Tree","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":148822,"title":"Add One Row to Tree","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4146166171827136,"acs":35191,"articleLive":1,"articleSlug":"maximum-distance-in-arrays","columnArticles":1,"formTitle":"[624]Maximum Distance in Arrays","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":84876,"title":"Maximum Distance in Arrays","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3321884691053386,"acs":9962,"articleLive":1,"articleSlug":"minimum-factorization","columnArticles":1,"formTitle":"[625]Minimum Factorization","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":29989,"title":"Minimum Factorization","titleSlug":"minimum-factorization"},{"acceptance":0.6872767808033324,"acs":93715,"articleLive":1,"articleSlug":"exchange-seats","columnArticles":1,"formTitle":"[626]Exchange Seats","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":136357,"title":"Exchange Seats","titleSlug":"exchange-seats"},{"acceptance":0.8025231719876416,"acs":174552,"articleLive":1,"articleSlug":"swap-salary","columnArticles":1,"formTitle":"[627]Swap Salary","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":217504,"title":"Swap Salary","titleSlug":"swap-salary"},{"acceptance":0.467723726557366,"acs":194306,"articleLive":1,"articleSlug":"maximum-product-of-three-numbers","columnArticles":1,"formTitle":"[628]Maximum Product of Three Numbers","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"","submitted":415429,"title":"Maximum Product of Three Numbers","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.37199255007327797,"acs":24367,"articleLive":1,"articleSlug":"k-inverse-pairs-array","columnArticles":1,"formTitle":"[629]K Inverse Pairs Array","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":65504,"title":"K Inverse Pairs Array","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.35557168784029036,"acs":53878,"articleLive":1,"articleSlug":"course-schedule-iii","columnArticles":1,"formTitle":"[630]Course Schedule III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":151525,"title":"Course Schedule III","titleSlug":"course-schedule-iii"},{"acceptance":0.40058005629958204,"acs":9392,"articleLive":1,"articleSlug":"design-excel-sum-formula","columnArticles":1,"formTitle":"[631]Design Excel Sum Formula","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":23446,"title":"Design Excel Sum Formula","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5771605236462006,"acs":59739,"articleLive":1,"articleSlug":"smallest-range-covering-elements-from-k-lists","columnArticles":1,"formTitle":"[632]Smallest Range Covering Elements from K Lists","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":103505,"title":"Smallest Range Covering Elements from K Lists","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3457376297812895,"acs":125974,"articleLive":1,"articleSlug":"sum-of-square-numbers","columnArticles":1,"formTitle":"[633]Sum of Square Numbers","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"","submitted":364363,"title":"Sum of Square Numbers","titleSlug":"sum-of-square-numbers"},{"acceptance":0.41037067044764025,"acs":8104,"articleLive":1,"articleSlug":"find-the-derangement-of-an-array","columnArticles":1,"formTitle":"[634]Find the Derangement of An Array","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":19748,"title":"Find the Derangement of An Array","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.6208079930495222,"acs":28582,"articleLive":1,"articleSlug":"design-log-storage-system","columnArticles":1,"formTitle":"[635]Design Log Storage System","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":46040,"title":"Design Log Storage System","titleSlug":"design-log-storage-system"},{"acceptance":0.5929329900279802,"acs":154060,"articleLive":0,"columnArticles":0,"formTitle":"[636]Exclusive Time of Functions","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"","submitted":259827,"title":"Exclusive Time of Functions","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6810407534180773,"acs":248112,"articleLive":1,"articleSlug":"average-of-levels-in-binary-tree","columnArticles":1,"formTitle":"[637]Average of Levels in Binary Tree","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":364313,"title":"Average of Levels in Binary Tree","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5437059701676681,"acs":44069,"articleLive":1,"articleSlug":"shopping-offers","columnArticles":1,"formTitle":"[638]Shopping Offers","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":81053,"title":"Shopping Offers","titleSlug":"shopping-offers"},{"acceptance":0.3032700449071764,"acs":58956,"articleLive":1,"articleSlug":"decode-ways-ii","columnArticles":1,"formTitle":"[639]Decode Ways II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":194401,"title":"Decode Ways II","titleSlug":"decode-ways-ii"},{"acceptance":0.4329224476258913,"acs":31328,"articleLive":1,"articleSlug":"solve-the-equation","columnArticles":1,"formTitle":"[640]Solve the Equation","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":72364,"title":"Solve the Equation","titleSlug":"solve-the-equation"},{"acceptance":0.5710779359533366,"acs":39554,"articleLive":0,"columnArticles":0,"formTitle":"[641]Design Circular Deque","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":69262,"title":"Design Circular Deque","titleSlug":"design-circular-deque"},{"acceptance":0.47992343143302973,"acs":105802,"articleLive":0,"columnArticles":0,"formTitle":"[642]Design Search Autocomplete System","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":220456,"title":"Design Search Autocomplete System","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.43285581023454156,"acs":129926,"articleLive":1,"articleSlug":"maximum-average-subarray-i","columnArticles":1,"formTitle":"[643]Maximum Average Subarray I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":300160,"title":"Maximum Average Subarray I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3508564064188908,"acs":16879,"articleLive":1,"articleSlug":"maximum-average-subarray-ii","columnArticles":1,"formTitle":"[644]Maximum Average Subarray II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":48108,"title":"Maximum Average Subarray II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.41210820680175025,"acs":157094,"articleLive":1,"articleSlug":"set-mismatch","columnArticles":1,"formTitle":"[645]Set Mismatch","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"","submitted":381196,"title":"Set Mismatch","titleSlug":"set-mismatch"},{"acceptance":0.5531951960453392,"acs":101612,"articleLive":1,"articleSlug":"maximum-length-of-pair-chain","columnArticles":1,"formTitle":"[646]Maximum Length of Pair Chain","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":183682,"title":"Maximum Length of Pair Chain","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6415444814404605,"acs":369554,"articleLive":1,"articleSlug":"palindromic-substrings","columnArticles":1,"formTitle":"[647]Palindromic Substrings","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":576038,"title":"Palindromic Substrings","titleSlug":"palindromic-substrings"},{"acceptance":0.6153957558913387,"acs":89233,"articleLive":1,"articleSlug":"replace-words","columnArticles":1,"formTitle":"[648]Replace Words","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":145001,"title":"Replace Words","titleSlug":"replace-words"},{"acceptance":0.3975094939503665,"acs":18004,"articleLive":0,"columnArticles":0,"formTitle":"[649]Dota2 Senate","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":45292,"title":"Dota2 Senate","titleSlug":"dota2-senate"},{"acceptance":0.5194616828224561,"acs":93834,"articleLive":1,"articleSlug":"2-keys-keyboard","columnArticles":1,"formTitle":"[650]2 Keys Keyboard","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":180637,"title":"2 Keys Keyboard","titleSlug":"2-keys-keyboard"},{"acceptance":0.5387232495325162,"acs":20743,"articleLive":0,"columnArticles":0,"formTitle":"[651]4 Keys Keyboard","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":38504,"title":"4 Keys Keyboard","titleSlug":"4-keys-keyboard"},{"acceptance":0.5531018247964903,"acs":134396,"articleLive":0,"columnArticles":0,"formTitle":"[652]Find Duplicate Subtrees","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":242986,"title":"Find Duplicate Subtrees","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5849692261875217,"acs":282849,"articleLive":1,"articleSlug":"two-sum-iv-input-is-a-bst","columnArticles":1,"formTitle":"[653]Two Sum IV - Input is a BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":483528,"title":"Two Sum IV - Input is a BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8312844973027015,"acs":199554,"articleLive":1,"articleSlug":"maximum-binary-tree","columnArticles":1,"formTitle":"[654]Maximum Binary Tree","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":240055,"title":"Maximum Binary Tree","titleSlug":"maximum-binary-tree"},{"acceptance":0.5888193688792165,"acs":47619,"articleLive":0,"columnArticles":0,"formTitle":"[655]Print Binary Tree","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":80872,"title":"Print Binary Tree","titleSlug":"print-binary-tree"},{"acceptance":0.3104092071611253,"acs":12137,"articleLive":1,"articleSlug":"coin-path","columnArticles":1,"formTitle":"[656]Coin Path","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":39100,"title":"Coin Path","titleSlug":"coin-path"},{"acceptance":0.7494083494478713,"acs":318560,"articleLive":1,"articleSlug":"robot-return-to-origin","columnArticles":1,"formTitle":"[657]Robot Return to Origin","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":425082,"title":"Robot Return to Origin","titleSlug":"robot-return-to-origin"},{"acceptance":0.441913357151725,"acs":256285,"articleLive":1,"articleSlug":"find-k-closest-elements","columnArticles":1,"formTitle":"[658]Find K Closest Elements","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":579944,"title":"Find K Closest Elements","titleSlug":"find-k-closest-elements"},{"acceptance":0.4541710909635438,"acs":66725,"articleLive":1,"articleSlug":"split-array-into-consecutive-subsequences","columnArticles":1,"formTitle":"[659]Split Array into Consecutive Subsequences","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":146916,"title":"Split Array into Consecutive Subsequences","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.5509656301145662,"acs":8416,"articleLive":1,"articleSlug":"remove-9","columnArticles":1,"formTitle":"[660]Remove 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":15275,"title":"Remove 9","titleSlug":"remove-9"},{"acceptance":0.5381557890342332,"acs":61875,"articleLive":0,"columnArticles":0,"formTitle":"[661]Image Smoother","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":114976,"title":"Image Smoother","titleSlug":"image-smoother"},{"acceptance":0.39675898661114256,"acs":142152,"articleLive":1,"articleSlug":"maximum-width-of-binary-tree","columnArticles":1,"formTitle":"[662]Maximum Width of Binary Tree","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":358283,"title":"Maximum Width of Binary Tree","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.41033467616981717,"acs":26483,"articleLive":1,"articleSlug":"equal-tree-partition","columnArticles":1,"formTitle":"[663]Equal Tree Partition","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":64540,"title":"Equal Tree Partition","titleSlug":"equal-tree-partition"},{"acceptance":0.44945319252884364,"acs":23919,"articleLive":0,"columnArticles":0,"formTitle":"[664]Strange Printer","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"","submitted":53218,"title":"Strange Printer","titleSlug":"strange-printer"},{"acceptance":0.21364256898746797,"acs":167136,"articleLive":1,"articleSlug":"non-decreasing-array","columnArticles":1,"formTitle":"[665]Non-decreasing Array","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":782316,"title":"Non-decreasing Array","titleSlug":"non-decreasing-array"},{"acceptance":0.5828190417118934,"acs":18793,"articleLive":1,"articleSlug":"path-sum-iv","columnArticles":1,"formTitle":"[666]Path Sum IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":32245,"title":"Path Sum IV","titleSlug":"path-sum-iv"},{"acceptance":0.5927571679194785,"acs":46289,"articleLive":1,"articleSlug":"beautiful-arrangement-ii","columnArticles":1,"formTitle":"[667]Beautiful Arrangement II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":78091,"title":"Beautiful Arrangement II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5076891014391014,"acs":46285,"articleLive":1,"articleSlug":"kth-smallest-number-in-multiplication-table","columnArticles":1,"formTitle":"[668]Kth Smallest Number in Multiplication Table","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":91168,"title":"Kth Smallest Number in Multiplication Table","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6453702169367946,"acs":183047,"articleLive":1,"articleSlug":"trim-a-binary-search-tree","columnArticles":1,"formTitle":"[669]Trim a Binary Search Tree","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":283631,"title":"Trim a Binary Search Tree","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.47117816009694746,"acs":148137,"articleLive":0,"columnArticles":0,"formTitle":"[670]Maximum Swap","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":314397,"title":"Maximum Swap","titleSlug":"maximum-swap"},{"acceptance":0.43399629209664775,"acs":128985,"articleLive":1,"articleSlug":"second-minimum-node-in-a-binary-tree","columnArticles":1,"formTitle":"[671]Second Minimum Node In a Binary Tree","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"","submitted":297203,"title":"Second Minimum Node In a Binary Tree","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.50911763785931,"acs":16277,"articleLive":0,"columnArticles":0,"formTitle":"[672]Bulb Switcher II","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":31971,"title":"Bulb Switcher II","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4037894021578101,"acs":102210,"articleLive":0,"columnArticles":0,"formTitle":"[673]Number of Longest Increasing Subsequence","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"","submitted":253127,"title":"Number of Longest Increasing Subsequence","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.48011542994233763,"acs":182513,"articleLive":1,"articleSlug":"longest-continuous-increasing-subsequence","columnArticles":1,"formTitle":"[674]Longest Continuous Increasing Subsequence","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":380144,"title":"Longest Continuous Increasing Subsequence","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.35473722038771094,"acs":52317,"articleLive":0,"columnArticles":0,"formTitle":"[675]Cut Off Trees for Golf Event","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":147481,"title":"Cut Off Trees for Golf Event","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5640355805243445,"acs":60239,"articleLive":0,"columnArticles":0,"formTitle":"[676]Implement Magic Dictionary","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":106800,"title":"Implement Magic Dictionary","titleSlug":"implement-magic-dictionary"},{"acceptance":0.5697134482097362,"acs":83185,"articleLive":1,"articleSlug":"map-sum-pairs","columnArticles":1,"formTitle":"[677]Map Sum Pairs","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":146012,"title":"Map Sum Pairs","titleSlug":"map-sum-pairs"},{"acceptance":0.3286621432641011,"acs":158637,"articleLive":1,"articleSlug":"valid-parenthesis-string","columnArticles":1,"formTitle":"[678]Valid Parenthesis String","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":482675,"title":"Valid Parenthesis String","titleSlug":"valid-parenthesis-string"},{"acceptance":0.48523233968440826,"acs":60179,"articleLive":0,"columnArticles":0,"formTitle":"[679]24 Game","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":124021,"title":"24 Game","titleSlug":"24-game"},{"acceptance":0.383966215859625,"acs":392875,"articleLive":0,"columnArticles":0,"formTitle":"[680]Valid Palindrome II","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":1023202,"title":"Valid Palindrome II","titleSlug":"valid-palindrome-ii"},{"acceptance":0.4648580679319052,"acs":91313,"articleLive":0,"columnArticles":0,"formTitle":"[681]Next Closest Time","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":196432,"title":"Next Closest Time","titleSlug":"next-closest-time"},{"acceptance":0.6913652451875082,"acs":137124,"articleLive":1,"articleSlug":"baseball-game","columnArticles":1,"formTitle":"[682]Baseball Game","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"","submitted":198338,"title":"Baseball Game","titleSlug":"baseball-game"},{"acceptance":0.36680444981990723,"acs":55196,"articleLive":0,"columnArticles":0,"formTitle":"[683]K Empty Slots","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":150478,"title":"K Empty Slots","titleSlug":"k-empty-slots"},{"acceptance":0.6087952797762715,"acs":184384,"articleLive":1,"articleSlug":"redundant-connection","columnArticles":1,"formTitle":"[684]Redundant Connection","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":302867,"title":"Redundant Connection","titleSlug":"redundant-connection"},{"acceptance":0.3359757046135532,"acs":49673,"articleLive":0,"columnArticles":0,"formTitle":"[685]Redundant Connection II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":147847,"title":"Redundant Connection II","titleSlug":"redundant-connection-ii"},{"acceptance":0.334122844064972,"acs":117086,"articleLive":0,"columnArticles":0,"formTitle":"[686]Repeated String Match","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":350428,"title":"Repeated String Match","titleSlug":"repeated-string-match"},{"acceptance":0.39046452082743316,"acs":135114,"articleLive":1,"articleSlug":"longest-univalue-path","columnArticles":1,"formTitle":"[687]Longest Univalue Path","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":346034,"title":"Longest Univalue Path","titleSlug":"longest-univalue-path"},{"acceptance":0.5136780803744548,"acs":75504,"articleLive":1,"articleSlug":"knight-probability-in-chessboard","columnArticles":1,"formTitle":"[688]Knight Probability in Chessboard","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":146987,"title":"Knight Probability in Chessboard","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4822765652381711,"acs":60545,"articleLive":1,"articleSlug":"maximum-sum-of-3-non-overlapping-subarrays","columnArticles":1,"formTitle":"[689]Maximum Sum of 3 Non-Overlapping Subarrays","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":125540,"title":"Maximum Sum of 3 Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6316298012888126,"acs":164081,"articleLive":1,"articleSlug":"employee-importance","columnArticles":1,"formTitle":"[690]Employee Importance","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"","submitted":259774,"title":"Employee Importance","titleSlug":"employee-importance"},{"acceptance":0.4676231921994634,"acs":28583,"articleLive":0,"columnArticles":0,"formTitle":"[691]Stickers to Spell Word","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":61124,"title":"Stickers to Spell Word","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5410900234747218,"acs":350589,"articleLive":0,"columnArticles":0,"formTitle":"[692]Top K Frequent Words","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"","submitted":647931,"title":"Top K Frequent Words","titleSlug":"top-k-frequent-words"},{"acceptance":0.6063521158789115,"acs":87992,"articleLive":1,"articleSlug":"binary-number-with-alternating-bits","columnArticles":1,"formTitle":"[693]Binary Number with Alternating Bits","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":145117,"title":"Binary Number with Alternating Bits","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5936710440126017,"acs":114195,"articleLive":1,"articleSlug":"number-of-distinct-islands","columnArticles":1,"formTitle":"[694]Number of Distinct Islands","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":192354,"title":"Number of Distinct Islands","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6882370283018868,"acs":406203,"articleLive":1,"articleSlug":"max-area-of-island","columnArticles":1,"formTitle":"[695]Max Area of Island","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"","submitted":590208,"title":"Max Area of Island","titleSlug":"max-area-of-island"},{"acceptance":0.6427388954265313,"acs":128900,"articleLive":1,"articleSlug":"count-binary-substrings","columnArticles":1,"formTitle":"[696]Count Binary Substrings","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":200548,"title":"Count Binary Substrings","titleSlug":"count-binary-substrings"},{"acceptance":0.5547790265739594,"acs":139791,"articleLive":1,"articleSlug":"degree-of-an-array","columnArticles":1,"formTitle":"[697]Degree of an Array","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":251976,"title":"Degree of an Array","titleSlug":"degree-of-an-array"},{"acceptance":0.45569352352828396,"acs":183017,"articleLive":1,"articleSlug":"partition-to-k-equal-sum-subsets","columnArticles":1,"formTitle":"[698]Partition to K Equal Sum Subsets","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":401623,"title":"Partition to K Equal Sum Subsets","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4362667535368578,"acs":18749,"articleLive":1,"articleSlug":"falling-squares","columnArticles":1,"formTitle":"[699]Falling Squares","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":42976,"title":"Falling Squares","titleSlug":"falling-squares"},{"acceptance":0.7499618136855883,"acs":387881,"articleLive":1,"articleSlug":"search-in-a-binary-search-tree","columnArticles":1,"formTitle":"[700]Search in a Binary Search Tree","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":517201,"title":"Search in a Binary Search Tree","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7501144871652436,"acs":276820,"articleLive":1,"articleSlug":"insert-into-a-binary-search-tree","columnArticles":1,"formTitle":"[701]Insert into a Binary Search Tree","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":369037,"title":"Insert into a Binary Search Tree","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7041748388904455,"acs":62830,"articleLive":1,"articleSlug":"search-in-a-sorted-array-of-unknown-size","columnArticles":1,"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":89225,"title":"Search in a Sorted Array of Unknown Size","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5248233724359698,"acs":181327,"articleLive":1,"articleSlug":"kth-largest-element-in-a-stream","columnArticles":1,"formTitle":"[703]Kth Largest Element in a Stream","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":345501,"title":"Kth Largest Element in a Stream","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5463846273484587,"acs":625323,"articleLive":1,"articleSlug":"binary-search","columnArticles":1,"formTitle":"[704]Binary Search","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"","submitted":1144474,"title":"Binary Search","titleSlug":"binary-search"},{"acceptance":0.6379330051513277,"acs":161857,"articleLive":1,"articleSlug":"design-hashset","columnArticles":1,"formTitle":"[705]Design HashSet","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"","submitted":253721,"title":"Design HashSet","titleSlug":"design-hashset"},{"acceptance":0.63787015201583,"acs":258856,"articleLive":1,"articleSlug":"design-hashmap","columnArticles":1,"formTitle":"[706]Design HashMap","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"","submitted":405813,"title":"Design HashMap","titleSlug":"design-hashmap"},{"acceptance":0.2676837747601684,"acs":167085,"articleLive":1,"articleSlug":"design-linked-list","columnArticles":1,"formTitle":"[707]Design Linked List","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"","submitted":624188,"title":"Design Linked List","titleSlug":"design-linked-list"},{"acceptance":0.3404520236502406,"acs":98982,"articleLive":1,"articleSlug":"insert-into-a-sorted-circular-linked-list","columnArticles":1,"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":290737,"title":"Insert into a Sorted Circular Linked List","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.8103962473019901,"acs":320643,"articleLive":1,"articleSlug":"to-lower-case","columnArticles":1,"formTitle":"[709]To Lower Case","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":395662,"title":"To Lower Case","titleSlug":"to-lower-case"},{"acceptance":0.3312059340025686,"acs":25273,"articleLive":1,"articleSlug":"random-pick-with-blacklist","columnArticles":1,"formTitle":"[710]Random Pick with Blacklist","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":76306,"title":"Random Pick with Blacklist","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.507026957966015,"acs":7937,"articleLive":0,"columnArticles":0,"formTitle":"[711]Number of Distinct Islands II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":15654,"title":"Number of Distinct Islands II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6122087477858019,"acs":58409,"articleLive":1,"articleSlug":"minimum-ascii-delete-sum-for-two-strings","columnArticles":1,"formTitle":"[712]Minimum ASCII Delete Sum for Two Strings","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":95407,"title":"Minimum ASCII Delete Sum for Two Strings","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.42959873393382736,"acs":145228,"articleLive":1,"articleSlug":"subarray-product-less-than-k","columnArticles":1,"formTitle":"[713]Subarray Product Less Than K","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"","submitted":338055,"title":"Subarray Product Less Than K","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.6130542516478305,"acs":149931,"articleLive":1,"articleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee","columnArticles":1,"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":244564,"title":"Best Time to Buy and Sell Stock with Transaction Fee","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4319391309923273,"acs":40420,"articleLive":0,"columnArticles":0,"formTitle":"[715]Range Module","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":93578,"title":"Range Module","titleSlug":"range-module"},{"acceptance":0.44736603611916687,"acs":108599,"articleLive":1,"articleSlug":"max-stack","columnArticles":1,"formTitle":"[716]Max Stack","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":242752,"title":"Max Stack","titleSlug":"max-stack"},{"acceptance":0.46233717023941,"acs":100053,"articleLive":0,"columnArticles":0,"formTitle":"[717]1-bit and 2-bit Characters","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":216407,"title":"1-bit and 2-bit Characters","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5137214252419463,"acs":157601,"articleLive":1,"articleSlug":"maximum-length-of-repeated-subarray","columnArticles":1,"formTitle":"[718]Maximum Length of Repeated Subarray","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":306783,"title":"Maximum Length of Repeated Subarray","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3449417481227853,"acs":54804,"articleLive":1,"articleSlug":"find-k-th-smallest-pair-distance","columnArticles":1,"formTitle":"[719]Find K-th Smallest Pair Distance","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":158879,"title":"Find K-th Smallest Pair Distance","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.5068497713570589,"acs":106516,"articleLive":1,"articleSlug":"longest-word-in-dictionary","columnArticles":1,"formTitle":"[720]Longest Word in Dictionary","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":2,"nodeType":"def","questionId":"720","status":"","submitted":210153,"title":"Longest Word in Dictionary","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.553282956988056,"acs":224712,"articleLive":1,"articleSlug":"accounts-merge","columnArticles":1,"formTitle":"[721]Accounts Merge","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":406143,"title":"Accounts Merge","titleSlug":"accounts-merge"},{"acceptance":0.37226398607711025,"acs":51550,"articleLive":0,"columnArticles":0,"formTitle":"[722]Remove Comments","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":138477,"title":"Remove Comments","titleSlug":"remove-comments"},{"acceptance":0.7477970907099247,"acs":46421,"articleLive":1,"articleSlug":"candy-crush","columnArticles":1,"formTitle":"[723]Candy Crush","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":62077,"title":"Candy Crush","titleSlug":"candy-crush"},{"acceptance":0.5064202106620178,"acs":276550,"articleLive":1,"articleSlug":"find-pivot-index","columnArticles":1,"formTitle":"[724]Find Pivot Index","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":546088,"title":"Find Pivot Index","titleSlug":"find-pivot-index"},{"acceptance":0.564766486914362,"acs":91325,"articleLive":1,"articleSlug":"split-linked-list-in-parts","columnArticles":1,"formTitle":"[725]Split Linked List in Parts","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"","submitted":161704,"title":"Split Linked List in Parts","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5161984400596592,"acs":42224,"articleLive":1,"articleSlug":"number-of-atoms","columnArticles":1,"formTitle":"[726]Number of Atoms","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"","submitted":81798,"title":"Number of Atoms","titleSlug":"number-of-atoms"},{"acceptance":0.42885763301372437,"acs":72995,"articleLive":0,"columnArticles":0,"formTitle":"[727]Minimum Window Subsequence","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":170208,"title":"Minimum Window Subsequence","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7670683636560439,"acs":170079,"articleLive":1,"articleSlug":"self-dividing-numbers","columnArticles":1,"formTitle":"[728]Self Dividing Numbers","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":221726,"title":"Self Dividing Numbers","titleSlug":"self-dividing-numbers"},{"acceptance":0.549348452252188,"acs":138655,"articleLive":1,"articleSlug":"my-calendar-i","columnArticles":1,"formTitle":"[729]My Calendar I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":252399,"title":"My Calendar I","titleSlug":"my-calendar-i"},{"acceptance":0.4398670286828182,"acs":25273,"articleLive":0,"columnArticles":0,"formTitle":"[730]Count Different Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":57456,"title":"Count Different Palindromic Subsequences","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5293087226246663,"acs":69196,"articleLive":1,"articleSlug":"my-calendar-ii","columnArticles":1,"formTitle":"[731]My Calendar II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":130729,"title":"My Calendar II","titleSlug":"my-calendar-ii"},{"acceptance":0.6607056465547032,"acs":38239,"articleLive":1,"articleSlug":"my-calendar-iii","columnArticles":1,"formTitle":"[732]My Calendar III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":57876,"title":"My Calendar III","titleSlug":"my-calendar-iii"},{"acceptance":0.5755230143078924,"acs":342911,"articleLive":1,"articleSlug":"flood-fill","columnArticles":1,"formTitle":"[733]Flood Fill","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"","submitted":595825,"title":"Flood Fill","titleSlug":"flood-fill"},{"acceptance":0.42886567085354155,"acs":48723,"articleLive":0,"columnArticles":0,"formTitle":"[734]Sentence Similarity","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":113609,"title":"Sentence Similarity","titleSlug":"sentence-similarity"},{"acceptance":0.44326828562447296,"acs":177677,"articleLive":1,"articleSlug":"asteroid-collision","columnArticles":1,"formTitle":"[735]Asteroid Collision","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"","submitted":400834,"title":"Asteroid Collision","titleSlug":"asteroid-collision"},{"acceptance":0.5109524351388257,"acs":17961,"articleLive":0,"columnArticles":0,"formTitle":"[736]Parse Lisp Expression","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":35152,"title":"Parse Lisp Expression","titleSlug":"parse-lisp-expression"},{"acceptance":0.4777105583344599,"acs":56538,"articleLive":1,"articleSlug":"sentence-similarity-ii","columnArticles":1,"formTitle":"[737]Sentence Similarity II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":118352,"title":"Sentence Similarity II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.46604738434704474,"acs":35270,"articleLive":0,"columnArticles":0,"formTitle":"[738]Monotone Increasing Digits","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":75679,"title":"Monotone Increasing Digits","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6677415285338553,"acs":349341,"articleLive":1,"articleSlug":"daily-temperatures","columnArticles":1,"formTitle":"[739]Daily Temperatures","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"","submitted":523168,"title":"Daily Temperatures","titleSlug":"daily-temperatures"},{"acceptance":0.548691980036928,"acs":120056,"articleLive":1,"articleSlug":"delete-and-earn","columnArticles":1,"formTitle":"[740]Delete and Earn","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":218804,"title":"Delete and Earn","titleSlug":"delete-and-earn"},{"acceptance":0.36136692564137646,"acs":50187,"articleLive":1,"articleSlug":"cherry-pickup","columnArticles":1,"formTitle":"[741]Cherry Pickup","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":138881,"title":"Cherry Pickup","titleSlug":"cherry-pickup"},{"acceptance":0.4534413470342863,"acs":35655,"articleLive":1,"articleSlug":"closest-leaf-in-a-binary-tree","columnArticles":1,"formTitle":"[742]Closest Leaf in a Binary Tree","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":78632,"title":"Closest Leaf in a Binary Tree","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.47894265434627037,"acs":212822,"articleLive":1,"articleSlug":"network-delay-time","columnArticles":1,"formTitle":"[743]Network Delay Time","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"","submitted":444358,"title":"Network Delay Time","titleSlug":"network-delay-time"},{"acceptance":0.4563121925788245,"acs":161049,"articleLive":1,"articleSlug":"find-smallest-letter-greater-than-target","columnArticles":1,"formTitle":"[744]Find Smallest Letter Greater Than Target","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":352936,"title":"Find Smallest Letter Greater Than Target","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3621298084967221,"acs":47615,"articleLive":1,"articleSlug":"prefix-and-suffix-search","columnArticles":1,"formTitle":"[745]Prefix and Suffix Search","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":131486,"title":"Prefix and Suffix Search","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5766365649831035,"acs":404070,"articleLive":1,"articleSlug":"min-cost-climbing-stairs","columnArticles":1,"formTitle":"[746]Min Cost Climbing Stairs","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":700736,"title":"Min Cost Climbing Stairs","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.44815751612038607,"acs":145467,"articleLive":0,"columnArticles":0,"formTitle":"[747]Largest Number At Least Twice of Others","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":324589,"title":"Largest Number At Least Twice of Others","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5863164688942952,"acs":47236,"articleLive":0,"columnArticles":0,"formTitle":"[748]Shortest Completing Word","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":80564,"title":"Shortest Completing Word","titleSlug":"shortest-completing-word"},{"acceptance":0.4972077674831831,"acs":7835,"articleLive":0,"columnArticles":0,"formTitle":"[749]Contain Virus","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":15758,"title":"Contain Virus","titleSlug":"contain-virus"},{"acceptance":0.6755810374018778,"acs":35114,"articleLive":1,"articleSlug":"number-of-corner-rectangles","columnArticles":1,"formTitle":"[750]Number Of Corner Rectangles","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":51976,"title":"Number Of Corner Rectangles","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5536621948170986,"acs":13289,"articleLive":0,"columnArticles":0,"formTitle":"[751]IP to CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":24002,"title":"IP to CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5519971185664868,"acs":147126,"articleLive":1,"articleSlug":"open-the-lock","columnArticles":1,"formTitle":"[752]Open the Lock","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"","submitted":266534,"title":"Open the Lock","titleSlug":"open-the-lock"},{"acceptance":0.5425272864365088,"acs":43891,"articleLive":0,"columnArticles":0,"formTitle":"[753]Cracking the Safe","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":80901,"title":"Cracking the Safe","titleSlug":"cracking-the-safe"},{"acceptance":0.4166375196037504,"acs":36927,"articleLive":1,"articleSlug":"reach-a-number","columnArticles":1,"formTitle":"[754]Reach a Number","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":88631,"title":"Reach a Number","titleSlug":"reach-a-number"},{"acceptance":0.4522010202153788,"acs":28722,"articleLive":0,"columnArticles":0,"formTitle":"[755]Pour Water","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":63516,"title":"Pour Water","titleSlug":"pour-water"},{"acceptance":0.5495568424767004,"acs":26476,"articleLive":0,"columnArticles":0,"formTitle":"[756]Pyramid Transition Matrix","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":48177,"title":"Pyramid Transition Matrix","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4298475636112152,"acs":14917,"articleLive":0,"columnArticles":0,"formTitle":"[757]Set Intersection Size At Least Two","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":34703,"title":"Set Intersection Size At Least Two","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4983711314371633,"acs":15910,"articleLive":0,"columnArticles":0,"formTitle":"[758]Bold Words in String","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":31924,"title":"Bold Words in String","titleSlug":"bold-words-in-string"},{"acceptance":0.707091320929492,"acs":97708,"articleLive":0,"columnArticles":0,"formTitle":"[759]Employee Free Time","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":138183,"title":"Employee Free Time","titleSlug":"employee-free-time"},{"acceptance":0.8257563807300375,"acs":78522,"articleLive":1,"articleSlug":"find-anagram-mappings","columnArticles":1,"formTitle":"[760]Find Anagram Mappings","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":95091,"title":"Find Anagram Mappings","titleSlug":"find-anagram-mappings"},{"acceptance":0.5968412302576891,"acs":12924,"articleLive":1,"articleSlug":"special-binary-string","columnArticles":1,"formTitle":"[761]Special Binary String","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":21654,"title":"Special Binary String","titleSlug":"special-binary-string"},{"acceptance":0.6623876113738304,"acs":65273,"articleLive":0,"columnArticles":0,"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":98542,"title":"Prime Number of Set Bits in Binary Representation","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7861417651382645,"acs":324061,"articleLive":1,"articleSlug":"partition-labels","columnArticles":1,"formTitle":"[763]Partition Labels","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":412217,"title":"Partition Labels","titleSlug":"partition-labels"},{"acceptance":0.48531656011548774,"acs":47066,"articleLive":1,"articleSlug":"largest-plus-sign","columnArticles":1,"formTitle":"[764]Largest Plus Sign","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":96980,"title":"Largest Plus Sign","titleSlug":"largest-plus-sign"},{"acceptance":0.563848786007389,"acs":41360,"articleLive":1,"articleSlug":"couples-holding-hands","columnArticles":1,"formTitle":"[765]Couples Holding Hands","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":73353,"title":"Couples Holding Hands","titleSlug":"couples-holding-hands"},{"acceptance":0.6745603648642723,"acs":169202,"articleLive":1,"articleSlug":"toeplitz-matrix","columnArticles":1,"formTitle":"[766]Toeplitz Matrix","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":250833,"title":"Toeplitz Matrix","titleSlug":"toeplitz-matrix"},{"acceptance":0.516482773358147,"acs":190938,"articleLive":0,"columnArticles":0,"formTitle":"[767]Reorganize String","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":369689,"title":"Reorganize String","titleSlug":"reorganize-string"},{"acceptance":0.5173635236577159,"acs":37975,"articleLive":0,"columnArticles":0,"formTitle":"[768]Max Chunks To Make Sorted II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":73401,"title":"Max Chunks To Make Sorted II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5742205073190989,"acs":66373,"articleLive":0,"columnArticles":0,"formTitle":"[769]Max Chunks To Make Sorted","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":115588,"title":"Max Chunks To Make Sorted","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5544357700496806,"acs":7812,"articleLive":0,"columnArticles":0,"formTitle":"[770]Basic Calculator IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":14090,"title":"Basic Calculator IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8756116487579205,"acs":708622,"articleLive":1,"articleSlug":"jewels-and-stones","columnArticles":1,"formTitle":"[771]Jewels and Stones","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":809288,"title":"Jewels and Stones","titleSlug":"jewels-and-stones"},{"acceptance":0.4692167622234799,"acs":76274,"articleLive":0,"columnArticles":0,"formTitle":"[772]Basic Calculator III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":162556,"title":"Basic Calculator III","titleSlug":"basic-calculator-iii"},{"acceptance":0.628562063960294,"acs":67121,"articleLive":0,"columnArticles":0,"formTitle":"[773]Sliding Puzzle","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":106785,"title":"Sliding Puzzle","titleSlug":"sliding-puzzle"},{"acceptance":0.5011435626530654,"acs":24760,"articleLive":1,"articleSlug":"minimize-max-distance-to-gas-station","columnArticles":1,"formTitle":"[774]Minimize Max Distance to Gas Station","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":49407,"title":"Minimize Max Distance to Gas Station","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4547618652643453,"acs":54827,"articleLive":1,"articleSlug":"global-and-local-inversions","columnArticles":1,"formTitle":"[775]Global and Local Inversions","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":120562,"title":"Global and Local Inversions","titleSlug":"global-and-local-inversions"},{"acceptance":0.5805425839448521,"acs":26107,"articleLive":1,"articleSlug":"split-bst","columnArticles":1,"formTitle":"[776]Split BST","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":44970,"title":"Split BST","titleSlug":"split-bst"},{"acceptance":0.36023469247979545,"acs":47337,"articleLive":0,"columnArticles":0,"formTitle":"[777]Swap Adjacent in LR String","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":131406,"title":"Swap Adjacent in LR String","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5823455013301932,"acs":66763,"articleLive":1,"articleSlug":"swim-in-rising-water","columnArticles":1,"formTitle":"[778]Swim in Rising Water","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":114645,"title":"Swim in Rising Water","titleSlug":"swim-in-rising-water"},{"acceptance":0.39727931071753936,"acs":77187,"articleLive":0,"columnArticles":0,"formTitle":"[779]K-th Symbol in Grammar","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":194289,"title":"K-th Symbol in Grammar","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.31306515984359695,"acs":38672,"articleLive":1,"articleSlug":"reaching-points","columnArticles":1,"formTitle":"[780]Reaching Points","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":123527,"title":"Reaching Points","titleSlug":"reaching-points"},{"acceptance":0.5574991795208402,"acs":33974,"articleLive":1,"articleSlug":"rabbits-in-forest","columnArticles":1,"formTitle":"[781]Rabbits in Forest","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":60940,"title":"Rabbits in Forest","titleSlug":"rabbits-in-forest"},{"acceptance":0.5214827890556046,"acs":14771,"articleLive":1,"articleSlug":"transform-to-chessboard","columnArticles":1,"formTitle":"[782]Transform to Chessboard","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":28325,"title":"Transform to Chessboard","titleSlug":"transform-to-chessboard"},{"acceptance":0.5572870550734903,"acs":113292,"articleLive":1,"articleSlug":"minimum-distance-between-bst-nodes","columnArticles":1,"formTitle":"[783]Minimum Distance Between BST Nodes","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"","submitted":203292,"title":"Minimum Distance Between BST Nodes","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.7157439569008294,"acs":191843,"articleLive":1,"articleSlug":"letter-case-permutation","columnArticles":1,"formTitle":"[784]Letter Case Permutation","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":268033,"title":"Letter Case Permutation","titleSlug":"letter-case-permutation"},{"acceptance":0.49974841890960886,"acs":258236,"articleLive":1,"articleSlug":"is-graph-bipartite","columnArticles":1,"formTitle":"[785]Is Graph Bipartite?","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"","submitted":516732,"title":"Is Graph Bipartite?","titleSlug":"is-graph-bipartite"},{"acceptance":0.477748082732977,"acs":24669,"articleLive":1,"articleSlug":"k-th-smallest-prime-fraction","columnArticles":1,"formTitle":"[786]K-th Smallest Prime Fraction","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":51636,"title":"K-th Smallest Prime Fraction","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3642580181822576,"acs":210995,"articleLive":1,"articleSlug":"cheapest-flights-within-k-stops","columnArticles":1,"formTitle":"[787]Cheapest Flights Within K Stops","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":579246,"title":"Cheapest Flights Within K Stops","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.5729018241327257,"acs":81218,"articleLive":0,"columnArticles":0,"formTitle":"[788]Rotated Digits","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":141766,"title":"Rotated Digits","titleSlug":"rotated-digits"},{"acceptance":0.5996260128817785,"acs":20202,"articleLive":1,"articleSlug":"escape-the-ghosts","columnArticles":1,"formTitle":"[789]Escape The Ghosts","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"","submitted":33691,"title":"Escape The Ghosts","titleSlug":"escape-the-ghosts"},{"acceptance":0.47525656151911133,"acs":42698,"articleLive":1,"articleSlug":"domino-and-tromino-tiling","columnArticles":1,"formTitle":"[790]Domino and Tromino Tiling","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":89842,"title":"Domino and Tromino Tiling","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.684816845036109,"acs":157412,"articleLive":1,"articleSlug":"custom-sort-string","columnArticles":1,"formTitle":"[791]Custom Sort String","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":229860,"title":"Custom Sort String","titleSlug":"custom-sort-string"},{"acceptance":0.5034937522985212,"acs":117740,"articleLive":1,"articleSlug":"number-of-matching-subsequences","columnArticles":1,"formTitle":"[792]Number of Matching Subsequences","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":233846,"title":"Number of Matching Subsequences","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.413913663931502,"acs":11602,"articleLive":1,"articleSlug":"preimage-size-of-factorial-zeroes-function","columnArticles":1,"formTitle":"[793]Preimage Size of Factorial Zeroes Function","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":28030,"title":"Preimage Size of Factorial Zeroes Function","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3510073011883937,"acs":42739,"articleLive":0,"columnArticles":0,"formTitle":"[794]Valid Tic-Tac-Toe State","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":121761,"title":"Valid Tic-Tac-Toe State","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5231795673703414,"acs":50186,"articleLive":1,"articleSlug":"number-of-subarrays-with-bounded-maximum","columnArticles":1,"formTitle":"[795]Number of Subarrays with Bounded Maximum","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":95925,"title":"Number of Subarrays with Bounded Maximum","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5131602042140126,"acs":134488,"articleLive":1,"articleSlug":"rotate-string","columnArticles":1,"formTitle":"[796]Rotate String","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":262078,"title":"Rotate String","titleSlug":"rotate-string"},{"acceptance":0.8060524657579677,"acs":243049,"articleLive":1,"articleSlug":"all-paths-from-source-to-target","columnArticles":1,"formTitle":"[797]All Paths From Source to Target","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"","submitted":301530,"title":"All Paths From Source to Target","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46801156003853345,"acs":8259,"articleLive":1,"articleSlug":"smallest-rotation-with-highest-score","columnArticles":1,"formTitle":"[798]Smallest Rotation with Highest Score","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":17647,"title":"Smallest Rotation with Highest Score","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4470779220779221,"acs":38556,"articleLive":1,"articleSlug":"champagne-tower","columnArticles":1,"formTitle":"[799]Champagne Tower","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":86240,"title":"Champagne Tower","titleSlug":"champagne-tower"},{"acceptance":0.6359466006906861,"acs":12338,"articleLive":0,"columnArticles":0,"formTitle":"[800]Similar RGB Color","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":19401,"title":"Similar RGB Color","titleSlug":"similar-rgb-color"},{"acceptance":0.3922780814535376,"acs":50953,"articleLive":0,"columnArticles":0,"formTitle":"[801]Minimum Swaps To Make Sequences Increasing","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":129890,"title":"Minimum Swaps To Make Sequences Increasing","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5182250277945665,"acs":69452,"articleLive":1,"articleSlug":"find-eventual-safe-states","columnArticles":1,"formTitle":"[802]Find Eventual Safe States","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"","submitted":134019,"title":"Find Eventual Safe States","titleSlug":"find-eventual-safe-states"},{"acceptance":0.3350688253334284,"acs":23490,"articleLive":1,"articleSlug":"bricks-falling-when-hit","columnArticles":1,"formTitle":"[803]Bricks Falling When Hit","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":70105,"title":"Bricks Falling When Hit","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7977964605167185,"acs":207818,"articleLive":1,"articleSlug":"unique-morse-code-words","columnArticles":1,"formTitle":"[804]Unique Morse Code Words","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":260490,"title":"Unique Morse Code Words","titleSlug":"unique-morse-code-words"},{"acceptance":0.266431079990402,"acs":24428,"articleLive":0,"columnArticles":0,"formTitle":"[805]Split Array With Same Average","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":91686,"title":"Split Array With Same Average","titleSlug":"split-array-with-same-average"},{"acceptance":0.6600963700610344,"acs":51372,"articleLive":1,"articleSlug":"number-of-lines-to-write-string","columnArticles":1,"formTitle":"[806]Number of Lines To Write String","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":77825,"title":"Number of Lines To Write String","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8532421486531283,"acs":118401,"articleLive":1,"articleSlug":"max-increase-to-keep-city-skyline","columnArticles":1,"formTitle":"[807]Max Increase to Keep City Skyline","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":138766,"title":"Max Increase to Keep City Skyline","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.42073461126324563,"acs":14135,"articleLive":0,"columnArticles":0,"formTitle":"[808]Soup Servings","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":33596,"title":"Soup Servings","titleSlug":"soup-servings"},{"acceptance":0.463418015991619,"acs":90240,"articleLive":0,"columnArticles":0,"formTitle":"[809]Expressive Words","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":194727,"title":"Expressive Words","titleSlug":"expressive-words"},{"acceptance":0.5266292326016675,"acs":6190,"articleLive":1,"articleSlug":"chalkboard-xor-game","columnArticles":1,"formTitle":"[810]Chalkboard XOR Game","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"","submitted":11754,"title":"Chalkboard XOR Game","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7374904591187695,"acs":159427,"articleLive":1,"articleSlug":"subdomain-visit-count","columnArticles":1,"formTitle":"[811]Subdomain Visit Count","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":216175,"title":"Subdomain Visit Count","titleSlug":"subdomain-visit-count"},{"acceptance":0.5944371828386898,"acs":30925,"articleLive":0,"columnArticles":0,"formTitle":"[812]Largest Triangle Area","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":52024,"title":"Largest Triangle Area","titleSlug":"largest-triangle-area"},{"acceptance":0.5217116906993017,"acs":38026,"articleLive":1,"articleSlug":"largest-sum-of-averages","columnArticles":1,"formTitle":"[813]Largest Sum of Averages","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":72887,"title":"Largest Sum of Averages","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7105844228050389,"acs":134196,"articleLive":1,"articleSlug":"binary-tree-pruning","columnArticles":1,"formTitle":"[814]Binary Tree Pruning","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":188853,"title":"Binary Tree Pruning","titleSlug":"binary-tree-pruning"},{"acceptance":0.44997576638798015,"acs":74273,"articleLive":1,"articleSlug":"bus-routes","columnArticles":1,"formTitle":"[815]Bus Routes","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"","submitted":165060,"title":"Bus Routes","titleSlug":"bus-routes"},{"acceptance":0.5589027675728631,"acs":25102,"articleLive":1,"articleSlug":"ambiguous-coordinates","columnArticles":1,"formTitle":"[816]Ambiguous Coordinates","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":44913,"title":"Ambiguous Coordinates","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5799237723807835,"acs":65427,"articleLive":0,"columnArticles":0,"formTitle":"[817]Linked List Components","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"","submitted":112820,"title":"Linked List Components","titleSlug":"linked-list-components"},{"acceptance":0.4168186618028223,"acs":30394,"articleLive":0,"columnArticles":0,"formTitle":"[818]Race Car","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":72919,"title":"Race Car","titleSlug":"race-car"},{"acceptance":0.4529162144147708,"acs":272483,"articleLive":1,"articleSlug":"most-common-word","columnArticles":1,"formTitle":"[819]Most Common Word","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":601619,"title":"Most Common Word","titleSlug":"most-common-word"},{"acceptance":0.5513863792136582,"acs":44246,"articleLive":1,"articleSlug":"short-encoding-of-words","columnArticles":1,"formTitle":"[820]Short Encoding of Words","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":80245,"title":"Short Encoding of Words","titleSlug":"short-encoding-of-words"},{"acceptance":0.7081372835948581,"acs":125819,"articleLive":1,"articleSlug":"shortest-distance-to-a-character","columnArticles":1,"formTitle":"[821]Shortest Distance to a Character","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":177676,"title":"Shortest Distance to a Character","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.4444681759931653,"acs":12486,"articleLive":0,"columnArticles":0,"formTitle":"[822]Card Flipping Game","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":28092,"title":"Card Flipping Game","titleSlug":"card-flipping-game"},{"acceptance":0.43667920302820074,"acs":35878,"articleLive":1,"articleSlug":"binary-trees-with-factors","columnArticles":1,"formTitle":"[823]Binary Trees With Factors","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":82161,"title":"Binary Trees With Factors","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6743631201198833,"acs":136804,"articleLive":0,"columnArticles":0,"formTitle":"[824]Goat Latin","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":202864,"title":"Goat Latin","titleSlug":"goat-latin"},{"acceptance":0.4546375532445604,"acs":59237,"articleLive":0,"columnArticles":0,"formTitle":"[825]Friends Of Appropriate Ages","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":130295,"title":"Friends Of Appropriate Ages","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.40898268533177096,"acs":32809,"articleLive":1,"articleSlug":"most-profit-assigning-work","columnArticles":1,"formTitle":"[826]Most Profit Assigning Work","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":80221,"title":"Most Profit Assigning Work","titleSlug":"most-profit-assigning-work"},{"acceptance":0.4459138658946281,"acs":94107,"articleLive":1,"articleSlug":"making-a-large-island","columnArticles":1,"formTitle":"[827]Making A Large Island","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":211043,"title":"Making A Large Island","titleSlug":"making-a-large-island"},{"acceptance":0.49165487977369166,"acs":29546,"articleLive":0,"columnArticles":0,"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":60095,"title":"Count Unique Characters of All Substrings of a Given String","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.4075886461885625,"acs":64302,"articleLive":1,"articleSlug":"consecutive-numbers-sum","columnArticles":1,"formTitle":"[829]Consecutive Numbers Sum","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":157762,"title":"Consecutive Numbers Sum","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5124124041065408,"acs":67930,"articleLive":1,"articleSlug":"positions-of-large-groups","columnArticles":1,"formTitle":"[830]Positions of Large Groups","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":132569,"title":"Positions of Large Groups","titleSlug":"positions-of-large-groups"},{"acceptance":0.45663728500214584,"acs":13832,"articleLive":0,"columnArticles":0,"formTitle":"[831]Masking Personal Information","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":30291,"title":"Masking Personal Information","titleSlug":"masking-personal-information"},{"acceptance":0.7939123388163039,"acs":279215,"articleLive":1,"articleSlug":"flipping-an-image","columnArticles":1,"formTitle":"[832]Flipping an Image","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":351695,"title":"Flipping an Image","titleSlug":"flipping-an-image"},{"acceptance":0.5398645572501707,"acs":94865,"articleLive":0,"columnArticles":0,"formTitle":"[833]Find And Replace in String","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":175720,"title":"Find And Replace in String","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5266647874468113,"acs":39236,"articleLive":1,"articleSlug":"sum-of-distances-in-tree","columnArticles":1,"formTitle":"[834]Sum of Distances in Tree","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":74499,"title":"Sum of Distances in Tree","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.6125655827164065,"acs":46585,"articleLive":1,"articleSlug":"image-overlap","columnArticles":1,"formTitle":"[835]Image Overlap","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":76049,"title":"Image Overlap","titleSlug":"image-overlap"},{"acceptance":0.43123358279228824,"acs":95711,"articleLive":1,"articleSlug":"rectangle-overlap","columnArticles":1,"formTitle":"[836]Rectangle Overlap","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":221947,"title":"Rectangle Overlap","titleSlug":"rectangle-overlap"},{"acceptance":0.3596753215472807,"acs":29866,"articleLive":0,"columnArticles":0,"formTitle":"[837]New 21 Game","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":83036,"title":"New 21 Game","titleSlug":"new-21-game"},{"acceptance":0.5210278832653292,"acs":55292,"articleLive":1,"articleSlug":"push-dominoes","columnArticles":1,"formTitle":"[838]Push Dominoes","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":106121,"title":"Push Dominoes","titleSlug":"push-dominoes"},{"acceptance":0.44817000956919667,"acs":47303,"articleLive":0,"columnArticles":0,"formTitle":"[839]Similar String Groups","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":105547,"title":"Similar String Groups","titleSlug":"similar-string-groups"},{"acceptance":0.3828418688668652,"acs":31367,"articleLive":0,"columnArticles":0,"formTitle":"[840]Magic Squares In Grid","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":81932,"title":"Magic Squares In Grid","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6826181429542516,"acs":173727,"articleLive":1,"articleSlug":"keys-and-rooms","columnArticles":1,"formTitle":"[841]Keys and Rooms","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"","submitted":254501,"title":"Keys and Rooms","titleSlug":"keys-and-rooms"},{"acceptance":0.3761024725975019,"acs":29509,"articleLive":1,"articleSlug":"split-array-into-fibonacci-sequence","columnArticles":1,"formTitle":"[842]Split Array into Fibonacci Sequence","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":78460,"title":"Split Array into Fibonacci Sequence","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.43431304045785185,"acs":107532,"articleLive":0,"columnArticles":0,"formTitle":"[843]Guess the Word","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":247591,"title":"Guess the Word","titleSlug":"guess-the-word"},{"acceptance":0.47401820448409143,"acs":378340,"articleLive":1,"articleSlug":"backspace-string-compare","columnArticles":1,"formTitle":"[844]Backspace String Compare","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"","submitted":798155,"title":"Backspace String Compare","titleSlug":"backspace-string-compare"},{"acceptance":0.39618941795483514,"acs":84861,"articleLive":1,"articleSlug":"longest-mountain-in-array","columnArticles":1,"formTitle":"[845]Longest Mountain in Array","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":214193,"title":"Longest Mountain in Array","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5613797401471325,"acs":82872,"articleLive":0,"columnArticles":0,"formTitle":"[846]Hand of Straights","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":147622,"title":"Hand of Straights","titleSlug":"hand-of-straights"},{"acceptance":0.5605813279974725,"acs":31938,"articleLive":1,"articleSlug":"shortest-path-visiting-all-nodes","columnArticles":1,"formTitle":"[847]Shortest Path Visiting All Nodes","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"","submitted":56973,"title":"Shortest Path Visiting All Nodes","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4550361243752743,"acs":69469,"articleLive":1,"articleSlug":"shifting-letters","columnArticles":1,"formTitle":"[848]Shifting Letters","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":152667,"title":"Shifting Letters","titleSlug":"shifting-letters"},{"acceptance":0.47420119026983304,"acs":164140,"articleLive":1,"articleSlug":"maximize-distance-to-closest-person","columnArticles":1,"formTitle":"[849]Maximize Distance to Closest Person","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":346140,"title":"Maximize Distance to Closest Person","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.5318938119274631,"acs":28451,"articleLive":1,"articleSlug":"rectangle-area-ii","columnArticles":1,"formTitle":"[850]Rectangle Area II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":53490,"title":"Rectangle Area II","titleSlug":"rectangle-area-ii"},{"acceptance":0.5591214909906427,"acs":21690,"articleLive":1,"articleSlug":"loud-and-rich","columnArticles":1,"formTitle":"[851]Loud and Rich","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":38793,"title":"Loud and Rich","titleSlug":"loud-and-rich"},{"acceptance":0.7113509811645062,"acs":317843,"articleLive":1,"articleSlug":"peak-index-in-a-mountain-array","columnArticles":1,"formTitle":"[852]Peak Index in a Mountain Array","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"","submitted":446816,"title":"Peak Index in a Mountain Array","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.47596645933391074,"acs":72543,"articleLive":0,"columnArticles":0,"formTitle":"[853]Car Fleet","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":152412,"title":"Car Fleet","titleSlug":"car-fleet"},{"acceptance":0.3918174155482072,"acs":30215,"articleLive":0,"columnArticles":0,"formTitle":"[854]K-Similar Strings","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":77115,"title":"K-Similar Strings","titleSlug":"k-similar-strings"},{"acceptance":0.4348573426301785,"acs":44779,"articleLive":0,"columnArticles":0,"formTitle":"[855]Exam Room","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":102974,"title":"Exam Room","titleSlug":"exam-room"},{"acceptance":0.6550499272629691,"acs":92759,"articleLive":1,"articleSlug":"score-of-parentheses","columnArticles":1,"formTitle":"[856]Score of Parentheses","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"","submitted":141606,"title":"Score of Parentheses","titleSlug":"score-of-parentheses"},{"acceptance":0.5159210213648442,"acs":47765,"articleLive":1,"articleSlug":"minimum-cost-to-hire-k-workers","columnArticles":1,"formTitle":"[857]Minimum Cost to Hire K Workers","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":92582,"title":"Minimum Cost to Hire K Workers","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5958439647840379,"acs":25921,"articleLive":0,"columnArticles":0,"formTitle":"[858]Mirror Reflection","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":43503,"title":"Mirror Reflection","titleSlug":"mirror-reflection"},{"acceptance":0.28759661466823083,"acs":112037,"articleLive":1,"articleSlug":"buddy-strings","columnArticles":1,"formTitle":"[859]Buddy Strings","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":389563,"title":"Buddy Strings","titleSlug":"buddy-strings"},{"acceptance":0.522549174062469,"acs":89555,"articleLive":1,"articleSlug":"lemonade-change","columnArticles":1,"formTitle":"[860]Lemonade Change","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":171381,"title":"Lemonade Change","titleSlug":"lemonade-change"},{"acceptance":0.7463769764531908,"acs":32807,"articleLive":0,"columnArticles":0,"formTitle":"[861]Score After Flipping Matrix","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":43955,"title":"Score After Flipping Matrix","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.2610268264886317,"acs":64589,"articleLive":1,"articleSlug":"shortest-subarray-with-sum-at-least-k","columnArticles":1,"formTitle":"[862]Shortest Subarray with Sum at Least K","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":247442,"title":"Shortest Subarray with Sum at Least K","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6052667740643392,"acs":207020,"articleLive":1,"articleSlug":"all-nodes-distance-k-in-binary-tree","columnArticles":1,"formTitle":"[863]All Nodes Distance K in Binary Tree","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"","submitted":342031,"title":"All Nodes Distance K in Binary Tree","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4414864564157547,"acs":21824,"articleLive":0,"columnArticles":0,"formTitle":"[864]Shortest Path to Get All Keys","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":49433,"title":"Shortest Path to Get All Keys","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6736090657915036,"acs":96058,"articleLive":1,"articleSlug":"smallest-subtree-with-all-the-deepest-nodes","columnArticles":1,"formTitle":"[865]Smallest Subtree with all the Deepest Nodes","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":142602,"title":"Smallest Subtree with all the Deepest Nodes","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2548530777013988,"acs":24432,"articleLive":1,"articleSlug":"prime-palindrome","columnArticles":1,"formTitle":"[866]Prime Palindrome","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":95867,"title":"Prime Palindrome","titleSlug":"prime-palindrome"},{"acceptance":0.6126754290464974,"acs":123807,"articleLive":1,"articleSlug":"transpose-matrix","columnArticles":1,"formTitle":"[867]Transpose Matrix","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":202076,"title":"Transpose Matrix","titleSlug":"transpose-matrix"},{"acceptance":0.6170372912123795,"acs":55745,"articleLive":1,"articleSlug":"binary-gap","columnArticles":1,"formTitle":"[868]Binary Gap","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":90343,"title":"Binary Gap","titleSlug":"binary-gap"},{"acceptance":0.6133011366258055,"acs":39875,"articleLive":1,"articleSlug":"reordered-power-of-2","columnArticles":1,"formTitle":"[869]Reordered Power of 2","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":65017,"title":"Reordered Power of 2","titleSlug":"reordered-power-of-2"},{"acceptance":0.5112233893837121,"acs":51198,"articleLive":1,"articleSlug":"advantage-shuffle","columnArticles":1,"formTitle":"[870]Advantage Shuffle","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"","submitted":100148,"title":"Advantage Shuffle","titleSlug":"advantage-shuffle"},{"acceptance":0.35486831433815685,"acs":66508,"articleLive":1,"articleSlug":"minimum-number-of-refueling-stops","columnArticles":1,"formTitle":"[871]Minimum Number of Refueling Stops","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":187416,"title":"Minimum Number of Refueling Stops","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6485111470626351,"acs":155131,"articleLive":1,"articleSlug":"leaf-similar-trees","columnArticles":1,"formTitle":"[872]Leaf-Similar Trees","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"","submitted":239211,"title":"Leaf-Similar Trees","titleSlug":"leaf-similar-trees"},{"acceptance":0.485427605705661,"acs":45670,"articleLive":1,"articleSlug":"length-of-longest-fibonacci-subsequence","columnArticles":1,"formTitle":"[873]Length of Longest Fibonacci Subsequence","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":94082,"title":"Length of Longest Fibonacci Subsequence","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.3751167362988449,"acs":30527,"articleLive":0,"columnArticles":0,"formTitle":"[874]Walking Robot Simulation","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":81380,"title":"Walking Robot Simulation","titleSlug":"walking-robot-simulation"},{"acceptance":0.546064269129194,"acs":154042,"articleLive":1,"articleSlug":"koko-eating-bananas","columnArticles":1,"formTitle":"[875]Koko Eating Bananas","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":282095,"title":"Koko Eating Bananas","titleSlug":"koko-eating-bananas"},{"acceptance":0.720578756607957,"acs":548916,"articleLive":1,"articleSlug":"middle-of-the-linked-list","columnArticles":1,"formTitle":"[876]Middle of the Linked List","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"","submitted":761771,"title":"Middle of the Linked List","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.6895572920320048,"acs":147457,"articleLive":1,"articleSlug":"stone-game","columnArticles":1,"formTitle":"[877]Stone Game","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"","submitted":213843,"title":"Stone Game","titleSlug":"stone-game"},{"acceptance":0.35765838011226947,"acs":28098,"articleLive":1,"articleSlug":"nth-magical-number","columnArticles":1,"formTitle":"[878]Nth Magical Number","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":78561,"title":"Nth Magical Number","titleSlug":"nth-magical-number"},{"acceptance":0.40583539141921776,"acs":14132,"articleLive":1,"articleSlug":"profitable-schemes","columnArticles":1,"formTitle":"[879]Profitable Schemes","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"","submitted":34822,"title":"Profitable Schemes","titleSlug":"profitable-schemes"},{"acceptance":0.282655097009139,"acs":32444,"articleLive":1,"articleSlug":"decoded-string-at-index","columnArticles":1,"formTitle":"[880]Decoded String at Index","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"","submitted":114783,"title":"Decoded String at Index","titleSlug":"decoded-string-at-index"},{"acceptance":0.4980076423677167,"acs":91360,"articleLive":1,"articleSlug":"boats-to-save-people","columnArticles":1,"formTitle":"[881]Boats to Save People","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":183451,"title":"Boats to Save People","titleSlug":"boats-to-save-people"},{"acceptance":0.49637970573835966,"acs":19264,"articleLive":1,"articleSlug":"reachable-nodes-in-subdivided-graph","columnArticles":1,"formTitle":"[882]Reachable Nodes In Subdivided Graph","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":38809,"title":"Reachable Nodes In Subdivided Graph","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6974038082260552,"acs":38897,"articleLive":1,"articleSlug":"projection-area-of-3d-shapes","columnArticles":1,"formTitle":"[883]Projection Area of 3D Shapes","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":55774,"title":"Projection Area of 3D Shapes","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6529632780377145,"acs":92107,"articleLive":1,"articleSlug":"uncommon-words-from-two-sentences","columnArticles":1,"formTitle":"[884]Uncommon Words from Two Sentences","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":141060,"title":"Uncommon Words from Two Sentences","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.7209833934694426,"acs":32171,"articleLive":1,"articleSlug":"spiral-matrix-iii","columnArticles":1,"formTitle":"[885]Spiral Matrix III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":44621,"title":"Spiral Matrix III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4673726908322092,"acs":97708,"articleLive":0,"columnArticles":0,"formTitle":"[886]Possible Bipartition","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":209058,"title":"Possible Bipartition","titleSlug":"possible-bipartition"},{"acceptance":0.27105404166585967,"acs":41986,"articleLive":1,"articleSlug":"super-egg-drop","columnArticles":1,"formTitle":"[887]Super Egg Drop","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":154899,"title":"Super Egg Drop","titleSlug":"super-egg-drop"},{"acceptance":0.6027349808299415,"acs":76560,"articleLive":1,"articleSlug":"fair-candy-swap","columnArticles":1,"formTitle":"[888]Fair Candy Swap","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":127021,"title":"Fair Candy Swap","titleSlug":"fair-candy-swap"},{"acceptance":0.6952722667792317,"acs":65884,"articleLive":0,"columnArticles":0,"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":94760,"title":"Construct Binary Tree from Preorder and Postorder Traversal","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7556000480518961,"acs":94348,"articleLive":1,"articleSlug":"find-and-replace-pattern","columnArticles":1,"formTitle":"[890]Find and Replace Pattern","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":124865,"title":"Find and Replace Pattern","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3464990113065964,"acs":13668,"articleLive":1,"articleSlug":"sum-of-subsequence-widths","columnArticles":1,"formTitle":"[891]Sum of Subsequence Widths","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":39446,"title":"Sum of Subsequence Widths","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6132539360310372,"acs":27188,"articleLive":0,"columnArticles":0,"formTitle":"[892]Surface Area of 3D Shapes","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":44334,"title":"Surface Area of 3D Shapes","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7038918275125232,"acs":40188,"articleLive":0,"columnArticles":0,"formTitle":"[893]Groups of Special-Equivalent Strings","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":57094,"title":"Groups of Special-Equivalent Strings","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7920248254460822,"acs":76569,"articleLive":1,"articleSlug":"all-possible-full-binary-trees","columnArticles":1,"formTitle":"[894]All Possible Full Binary Trees","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":96675,"title":"All Possible Full Binary Trees","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.6467752707843308,"acs":89092,"articleLive":1,"articleSlug":"maximum-frequency-stack","columnArticles":1,"formTitle":"[895]Maximum Frequency Stack","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":137748,"title":"Maximum Frequency Stack","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5842518406574535,"acs":187116,"articleLive":1,"articleSlug":"monotonic-array","columnArticles":1,"formTitle":"[896]Monotonic Array","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":320266,"title":"Monotonic Array","titleSlug":"monotonic-array"},{"acceptance":0.7594170810150501,"acs":159148,"articleLive":1,"articleSlug":"increasing-order-search-tree","columnArticles":1,"formTitle":"[897]Increasing Order Search Tree","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"","submitted":209566,"title":"Increasing Order Search Tree","titleSlug":"increasing-order-search-tree"},{"acceptance":0.36201317462151855,"acs":25060,"articleLive":0,"columnArticles":0,"formTitle":"[898]Bitwise ORs of Subarrays","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":69224,"title":"Bitwise ORs of Subarrays","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5840580384132447,"acs":25118,"articleLive":1,"articleSlug":"orderly-queue","columnArticles":1,"formTitle":"[899]Orderly Queue","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":43006,"title":"Orderly Queue","titleSlug":"orderly-queue"},{"acceptance":0.5836307975267113,"acs":48233,"articleLive":0,"columnArticles":0,"formTitle":"[900]RLE Iterator","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":82643,"title":"RLE Iterator","titleSlug":"rle-iterator"},{"acceptance":0.6279176878916981,"acs":114519,"articleLive":0,"columnArticles":0,"formTitle":"[901]Online Stock Span","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"","submitted":182379,"title":"Online Stock Span","titleSlug":"online-stock-span"},{"acceptance":0.407685386873757,"acs":34438,"articleLive":1,"articleSlug":"numbers-at-most-n-given-digit-set","columnArticles":1,"formTitle":"[902]Numbers At Most N Given Digit Set","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":84472,"title":"Numbers At Most N Given Digit Set","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5682119205298013,"acs":10296,"articleLive":0,"columnArticles":0,"formTitle":"[903]Valid Permutations for DI Sequence","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":18120,"title":"Valid Permutations for DI Sequence","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.43013158987624145,"acs":181251,"articleLive":0,"columnArticles":0,"formTitle":"[904]Fruit Into Baskets","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":421385,"title":"Fruit Into Baskets","titleSlug":"fruit-into-baskets"},{"acceptance":0.7480273158994262,"acs":412846,"articleLive":1,"articleSlug":"sort-array-by-parity","columnArticles":1,"formTitle":"[905]Sort Array By Parity","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":551913,"title":"Sort Array By Parity","titleSlug":"sort-array-by-parity"},{"acceptance":0.39172808559991024,"acs":20941,"articleLive":1,"articleSlug":"super-palindromes","columnArticles":1,"formTitle":"[906]Super Palindromes","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":53458,"title":"Super Palindromes","titleSlug":"super-palindromes"},{"acceptance":0.3350352540724532,"acs":63388,"articleLive":0,"columnArticles":0,"formTitle":"[907]Sum of Subarray Minimums","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"","submitted":189198,"title":"Sum of Subarray Minimums","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6705442168941522,"acs":57528,"articleLive":0,"columnArticles":0,"formTitle":"[908]Smallest Range I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":85793,"title":"Smallest Range I","titleSlug":"smallest-range-i"},{"acceptance":0.401335412750464,"acs":67680,"articleLive":0,"columnArticles":0,"formTitle":"[909]Snakes and Ladders","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"","submitted":168637,"title":"Snakes and Ladders","titleSlug":"snakes-and-ladders"},{"acceptance":0.32190743046907433,"acs":31019,"articleLive":1,"articleSlug":"smallest-range-ii","columnArticles":1,"formTitle":"[910]Smallest Range II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":96360,"title":"Smallest Range II","titleSlug":"smallest-range-ii"},{"acceptance":0.5162965219317678,"acs":37289,"articleLive":1,"articleSlug":"online-election","columnArticles":1,"formTitle":"[911]Online Election","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":72224,"title":"Online Election","titleSlug":"online-election"},{"acceptance":0.6189480877599015,"acs":231866,"articleLive":0,"columnArticles":0,"formTitle":"[912]Sort an Array","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"","submitted":374613,"title":"Sort an Array","titleSlug":"sort-an-array"},{"acceptance":0.35193766868666293,"acs":13822,"articleLive":1,"articleSlug":"cat-and-mouse","columnArticles":1,"formTitle":"[913]Cat and Mouse","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":39274,"title":"Cat and Mouse","titleSlug":"cat-and-mouse"},{"acceptance":0.33356615322304006,"acs":80710,"articleLive":1,"articleSlug":"x-of-a-kind-in-a-deck-of-cards","columnArticles":1,"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":241961,"title":"X of a Kind in a Deck of Cards","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4834997499962121,"acs":63821,"articleLive":1,"articleSlug":"partition-array-into-disjoint-intervals","columnArticles":1,"formTitle":"[915]Partition Array into Disjoint Intervals","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":131998,"title":"Partition Array into Disjoint Intervals","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.5284474970338845,"acs":48549,"articleLive":1,"articleSlug":"word-subsets","columnArticles":1,"formTitle":"[916]Word Subsets","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":91871,"title":"Word Subsets","titleSlug":"word-subsets"},{"acceptance":0.6079943528598251,"acs":126613,"articleLive":1,"articleSlug":"reverse-only-letters","columnArticles":1,"formTitle":"[917]Reverse Only Letters","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":208247,"title":"Reverse Only Letters","titleSlug":"reverse-only-letters"},{"acceptance":0.3650017699115044,"acs":103113,"articleLive":1,"articleSlug":"maximum-sum-circular-subarray","columnArticles":1,"formTitle":"[918]Maximum Sum Circular Subarray","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":282500,"title":"Maximum Sum Circular Subarray","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6347083129070663,"acs":36252,"articleLive":1,"articleSlug":"complete-binary-tree-inserter","columnArticles":1,"formTitle":"[919]Complete Binary Tree Inserter","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":57116,"title":"Complete Binary Tree Inserter","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4922397835682757,"acs":17285,"articleLive":1,"articleSlug":"number-of-music-playlists","columnArticles":1,"formTitle":"[920]Number of Music Playlists","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":35115,"title":"Number of Music Playlists","titleSlug":"number-of-music-playlists"},{"acceptance":0.7740137882425497,"acs":175705,"articleLive":1,"articleSlug":"minimum-add-to-make-parentheses-valid","columnArticles":1,"formTitle":"[921]Minimum Add to Make Parentheses Valid","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"","submitted":227005,"title":"Minimum Add to Make Parentheses Valid","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7059413639312031,"acs":175221,"articleLive":1,"articleSlug":"sort-array-by-parity-ii","columnArticles":1,"formTitle":"[922]Sort Array By Parity II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"","submitted":248209,"title":"Sort Array By Parity II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.4135073716882829,"acs":44763,"articleLive":1,"articleSlug":"3sum-with-multiplicity","columnArticles":1,"formTitle":"[923]3Sum With Multiplicity","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":108252,"title":"3Sum With Multiplicity","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.41908738092437964,"acs":35635,"articleLive":1,"articleSlug":"minimize-malware-spread","columnArticles":1,"formTitle":"[924]Minimize Malware Spread","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":85030,"title":"Minimize Malware Spread","titleSlug":"minimize-malware-spread"},{"acceptance":0.3503115138765272,"acs":86590,"articleLive":0,"columnArticles":0,"formTitle":"[925]Long Pressed Name","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":247180,"title":"Long Pressed Name","titleSlug":"long-pressed-name"},{"acceptance":0.5798289269051322,"acs":74566,"articleLive":1,"articleSlug":"flip-string-to-monotone-increasing","columnArticles":1,"formTitle":"[926]Flip String to Monotone Increasing","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":128600,"title":"Flip String to Monotone Increasing","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.39281951159043016,"acs":25351,"articleLive":1,"articleSlug":"three-equal-parts","columnArticles":1,"formTitle":"[927]Three Equal Parts","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":64536,"title":"Three Equal Parts","titleSlug":"three-equal-parts"},{"acceptance":0.4186367558239862,"acs":14556,"articleLive":1,"articleSlug":"minimize-malware-spread-ii","columnArticles":1,"formTitle":"[928]Minimize Malware Spread II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":34770,"title":"Minimize Malware Spread II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6739378121111237,"acs":333610,"articleLive":1,"articleSlug":"unique-email-addresses","columnArticles":1,"formTitle":"[929]Unique Email Addresses","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":495016,"title":"Unique Email Addresses","titleSlug":"unique-email-addresses"},{"acceptance":0.4813458638945256,"acs":42460,"articleLive":1,"articleSlug":"binary-subarrays-with-sum","columnArticles":1,"formTitle":"[930]Binary Subarrays With Sum","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"","submitted":88211,"title":"Binary Subarrays With Sum","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6678399941129215,"acs":108904,"articleLive":0,"columnArticles":0,"formTitle":"[931]Minimum Falling Path Sum","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":163069,"title":"Minimum Falling Path Sum","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6444778390011318,"acs":34738,"articleLive":1,"articleSlug":"beautiful-array","columnArticles":1,"formTitle":"[932]Beautiful Array","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":53901,"title":"Beautiful Array","titleSlug":"beautiful-array"},{"acceptance":0.7301325127174527,"acs":116259,"articleLive":1,"articleSlug":"number-of-recent-calls","columnArticles":1,"formTitle":"[933]Number of Recent Calls","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":159230,"title":"Number of Recent Calls","titleSlug":"number-of-recent-calls"},{"acceptance":0.5211117294660687,"acs":79592,"articleLive":0,"columnArticles":0,"formTitle":"[934]Shortest Bridge","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":152735,"title":"Shortest Bridge","titleSlug":"shortest-bridge"},{"acceptance":0.48660039490706064,"acs":71467,"articleLive":0,"columnArticles":0,"formTitle":"[935]Knight Dialer","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":146870,"title":"Knight Dialer","titleSlug":"knight-dialer"},{"acceptance":0.5353230671535164,"acs":23604,"articleLive":1,"articleSlug":"stamping-the-sequence","columnArticles":1,"formTitle":"[936]Stamping The Sequence","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":44093,"title":"Stamping The Sequence","titleSlug":"stamping-the-sequence"},{"acceptance":0.5583978150172788,"acs":274371,"articleLive":1,"articleSlug":"reorder-data-in-log-files","columnArticles":1,"formTitle":"[937]Reorder Data in Log Files","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":491354,"title":"Reorder Data in Log Files","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8477838793119263,"acs":554549,"articleLive":1,"articleSlug":"range-sum-of-bst","columnArticles":1,"formTitle":"[938]Range Sum of BST","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"","submitted":654116,"title":"Range Sum of BST","titleSlug":"range-sum-of-bst"},{"acceptance":0.5342084879593983,"acs":92417,"articleLive":0,"columnArticles":0,"formTitle":"[939]Minimum Area Rectangle","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":172998,"title":"Minimum Area Rectangle","titleSlug":"minimum-area-rectangle"},{"acceptance":0.44095380965671227,"acs":25279,"articleLive":1,"articleSlug":"distinct-subsequences-ii","columnArticles":1,"formTitle":"[940]Distinct Subsequences II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":57328,"title":"Distinct Subsequences II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3391657198506736,"acs":271648,"articleLive":1,"articleSlug":"valid-mountain-array","columnArticles":1,"formTitle":"[941]Valid Mountain Array","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":800930,"title":"Valid Mountain Array","titleSlug":"valid-mountain-array"},{"acceptance":0.7545800466823275,"acs":100541,"articleLive":1,"articleSlug":"di-string-match","columnArticles":1,"formTitle":"[942]DI String Match","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":133241,"title":"DI String Match","titleSlug":"di-string-match"},{"acceptance":0.454644939214867,"acs":22850,"articleLive":1,"articleSlug":"find-the-shortest-superstring","columnArticles":1,"formTitle":"[943]Find the Shortest Superstring","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":50259,"title":"Find the Shortest Superstring","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.7017170223566022,"acs":63591,"articleLive":0,"columnArticles":0,"formTitle":"[944]Delete Columns to Make Sorted","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":90622,"title":"Delete Columns to Make Sorted","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48615602362862564,"acs":49462,"articleLive":1,"articleSlug":"minimum-increment-to-make-array-unique","columnArticles":1,"formTitle":"[945]Minimum Increment to Make Array Unique","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":101741,"title":"Minimum Increment to Make Array Unique","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6523372436873152,"acs":127286,"articleLive":1,"articleSlug":"validate-stack-sequences","columnArticles":1,"formTitle":"[946]Validate Stack Sequences","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"","submitted":195123,"title":"Validate Stack Sequences","titleSlug":"validate-stack-sequences"},{"acceptance":0.5623348161522335,"acs":94682,"articleLive":0,"columnArticles":0,"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":168373,"title":"Most Stones Removed with Same Row or Column","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.46167642752562227,"acs":37839,"articleLive":1,"articleSlug":"bag-of-tokens","columnArticles":1,"formTitle":"[948]Bag of Tokens","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":81960,"title":"Bag of Tokens","titleSlug":"bag-of-tokens"},{"acceptance":0.3562095057565917,"acs":68778,"articleLive":1,"articleSlug":"largest-time-for-given-digits","columnArticles":1,"formTitle":"[949]Largest Time for Given Digits","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":193083,"title":"Largest Time for Given Digits","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7674784637220872,"acs":54613,"articleLive":1,"articleSlug":"reveal-cards-in-increasing-order","columnArticles":1,"formTitle":"[950]Reveal Cards In Increasing Order","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":71159,"title":"Reveal Cards In Increasing Order","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6658808554302155,"acs":102533,"articleLive":1,"articleSlug":"flip-equivalent-binary-trees","columnArticles":1,"formTitle":"[951]Flip Equivalent Binary Trees","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":153981,"title":"Flip Equivalent Binary Trees","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.4041231688638734,"acs":43008,"articleLive":1,"articleSlug":"largest-component-size-by-common-factor","columnArticles":1,"formTitle":"[952]Largest Component Size by Common Factor","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":106423,"title":"Largest Component Size by Common Factor","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5231451004319134,"acs":325820,"articleLive":1,"articleSlug":"verifying-an-alien-dictionary","columnArticles":1,"formTitle":"[953]Verifying an Alien Dictionary","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":622810,"title":"Verifying an Alien Dictionary","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.382451851375299,"acs":65392,"articleLive":1,"articleSlug":"array-of-doubled-pairs","columnArticles":1,"formTitle":"[954]Array of Doubled Pairs","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":170981,"title":"Array of Doubled Pairs","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.34117020290929306,"acs":14729,"articleLive":0,"columnArticles":0,"formTitle":"[955]Delete Columns to Make Sorted II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":43172,"title":"Delete Columns to Make Sorted II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.39931575380047124,"acs":12372,"articleLive":0,"columnArticles":0,"formTitle":"[956]Tallest Billboard","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":30983,"title":"Tallest Billboard","titleSlug":"tallest-billboard"},{"acceptance":0.3955340046958797,"acs":136958,"articleLive":1,"articleSlug":"prison-cells-after-n-days","columnArticles":1,"formTitle":"[957]Prison Cells After N Days","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":346261,"title":"Prison Cells After N Days","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.533587550652635,"acs":107186,"articleLive":0,"columnArticles":0,"formTitle":"[958]Check Completeness of a Binary Tree","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":200878,"title":"Check Completeness of a Binary Tree","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.6844560922826454,"acs":34474,"articleLive":1,"articleSlug":"regions-cut-by-slashes","columnArticles":1,"formTitle":"[959]Regions Cut By Slashes","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":50367,"title":"Regions Cut By Slashes","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5642656581284741,"acs":9847,"articleLive":1,"articleSlug":"delete-columns-to-make-sorted-iii","columnArticles":1,"formTitle":"[960]Delete Columns to Make Sorted III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":17451,"title":"Delete Columns to Make Sorted III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.7527326636279152,"acs":170095,"articleLive":1,"articleSlug":"n-repeated-element-in-size-2n-array","columnArticles":1,"formTitle":"[961]N-Repeated Element in Size 2N Array","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":225970,"title":"N-Repeated Element in Size 2N Array","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4783660470955691,"acs":31244,"articleLive":0,"columnArticles":0,"formTitle":"[962]Maximum Width Ramp","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":65314,"title":"Maximum Width Ramp","titleSlug":"maximum-width-ramp"},{"acceptance":0.5428256678600937,"acs":21681,"articleLive":0,"columnArticles":0,"formTitle":"[963]Minimum Area Rectangle II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":39941,"title":"Minimum Area Rectangle II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.46848778097629695,"acs":7649,"articleLive":0,"columnArticles":0,"formTitle":"[964]Least Operators to Express Number","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":16327,"title":"Least Operators to Express Number","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6873981145158402,"acs":149694,"articleLive":1,"articleSlug":"univalued-binary-tree","columnArticles":1,"formTitle":"[965]Univalued Binary Tree","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":217769,"title":"Univalued Binary Tree","titleSlug":"univalued-binary-tree"},{"acceptance":0.5159135969946781,"acs":34608,"articleLive":1,"articleSlug":"vowel-spellchecker","columnArticles":1,"formTitle":"[966]Vowel Spellchecker","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":67081,"title":"Vowel Spellchecker","titleSlug":"vowel-spellchecker"},{"acceptance":0.46812801402893467,"acs":48051,"articleLive":1,"articleSlug":"numbers-with-same-consecutive-differences","columnArticles":1,"formTitle":"[967]Numbers With Same Consecutive Differences","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":102645,"title":"Numbers With Same Consecutive Differences","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4152341166231506,"acs":59638,"articleLive":1,"articleSlug":"binary-tree-cameras","columnArticles":1,"formTitle":"[968]Binary Tree Cameras","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":143625,"title":"Binary Tree Cameras","titleSlug":"binary-tree-cameras"},{"acceptance":0.6957881691027482,"acs":70738,"articleLive":1,"articleSlug":"pancake-sorting","columnArticles":1,"formTitle":"[969]Pancake Sorting","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":101666,"title":"Pancake Sorting","titleSlug":"pancake-sorting"},{"acceptance":0.4347303893308736,"acs":45245,"articleLive":1,"articleSlug":"powerful-integers","columnArticles":1,"formTitle":"[970]Powerful Integers","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":104076,"title":"Powerful Integers","titleSlug":"powerful-integers"},{"acceptance":0.49891403246162425,"acs":33997,"articleLive":1,"articleSlug":"flip-binary-tree-to-match-preorder-traversal","columnArticles":1,"formTitle":"[971]Flip Binary Tree To Match Preorder Traversal","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":68142,"title":"Flip Binary Tree To Match Preorder Traversal","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.42353037497953167,"acs":5173,"articleLive":1,"articleSlug":"equal-rational-numbers","columnArticles":1,"formTitle":"[972]Equal Rational Numbers","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":12214,"title":"Equal Rational Numbers","titleSlug":"equal-rational-numbers"},{"acceptance":0.6606091094943354,"acs":678906,"articleLive":1,"articleSlug":"k-closest-points-to-origin","columnArticles":1,"formTitle":"[973]K Closest Points to Origin","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"","submitted":1027697,"title":"K Closest Points to Origin","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.5290863525262214,"acs":85503,"articleLive":0,"columnArticles":0,"formTitle":"[974]Subarray Sums Divisible by K","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":161605,"title":"Subarray Sums Divisible by K","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.39229697902159094,"acs":53800,"articleLive":0,"columnArticles":0,"formTitle":"[975]Odd Even Jump","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":137141,"title":"Odd Even Jump","titleSlug":"odd-even-jump"},{"acceptance":0.5962694944473399,"acs":59491,"articleLive":1,"articleSlug":"largest-perimeter-triangle","columnArticles":1,"formTitle":"[976]Largest Perimeter Triangle","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":99772,"title":"Largest Perimeter Triangle","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7151851943438492,"acs":838727,"articleLive":1,"articleSlug":"squares-of-a-sorted-array","columnArticles":1,"formTitle":"[977]Squares of a Sorted Array","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"","submitted":1172741,"title":"Squares of a Sorted Array","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47509097150703744,"acs":69197,"articleLive":1,"articleSlug":"longest-turbulent-subarray","columnArticles":1,"formTitle":"[978]Longest Turbulent Subarray","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":145650,"title":"Longest Turbulent Subarray","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7116068122917438,"acs":76882,"articleLive":1,"articleSlug":"distribute-coins-in-binary-tree","columnArticles":1,"formTitle":"[979]Distribute Coins in Binary Tree","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":108040,"title":"Distribute Coins in Binary Tree","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7935517076578067,"acs":107927,"articleLive":1,"articleSlug":"unique-paths-iii","columnArticles":1,"formTitle":"[980]Unique Paths III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":136005,"title":"Unique Paths III","titleSlug":"unique-paths-iii"},{"acceptance":0.5283995990644837,"acs":164476,"articleLive":0,"columnArticles":0,"formTitle":"[981]Time Based Key-Value Store","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"","submitted":311272,"title":"Time Based Key-Value Store","titleSlug":"time-based-key-value-store"},{"acceptance":0.5747025121198766,"acs":11736,"articleLive":0,"columnArticles":0,"formTitle":"[982]Triples with Bitwise AND Equal To Zero","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":20421,"title":"Triples with Bitwise AND Equal To Zero","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6372479069389377,"acs":141116,"articleLive":1,"articleSlug":"minimum-cost-for-tickets","columnArticles":1,"formTitle":"[983]Minimum Cost For Tickets","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":221446,"title":"Minimum Cost For Tickets","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4127959490899138,"acs":30163,"articleLive":1,"articleSlug":"string-without-aaa-or-bbb","columnArticles":1,"formTitle":"[984]String Without AAA or BBB","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":73070,"title":"String Without AAA or BBB","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6082875617047904,"acs":61243,"articleLive":1,"articleSlug":"sum-of-even-numbers-after-queries","columnArticles":1,"formTitle":"[985]Sum of Even Numbers After Queries","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":100681,"title":"Sum of Even Numbers After Queries","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.7079584181871078,"acs":272547,"articleLive":1,"articleSlug":"interval-list-intersections","columnArticles":1,"formTitle":"[986]Interval List Intersections","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"","submitted":384976,"title":"Interval List Intersections","titleSlug":"interval-list-intersections"},{"acceptance":0.40870266589849685,"acs":195084,"articleLive":1,"articleSlug":"vertical-order-traversal-of-a-binary-tree","columnArticles":1,"formTitle":"[987]Vertical Order Traversal of a Binary Tree","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"","submitted":477325,"title":"Vertical Order Traversal of a Binary Tree","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4839340076598252,"acs":49279,"articleLive":1,"articleSlug":"smallest-string-starting-from-leaf","columnArticles":1,"formTitle":"[988]Smallest String Starting From Leaf","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":101830,"title":"Smallest String Starting From Leaf","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4524851444101525,"acs":98230,"articleLive":1,"articleSlug":"add-to-array-form-of-integer","columnArticles":1,"formTitle":"[989]Add to Array-Form of Integer","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":217090,"title":"Add to Array-Form of Integer","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.4949509831699439,"acs":43672,"articleLive":1,"articleSlug":"satisfiability-of-equality-equations","columnArticles":1,"formTitle":"[990]Satisfiability of Equality Equations","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":88235,"title":"Satisfiability of Equality Equations","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5004045996592845,"acs":46998,"articleLive":1,"articleSlug":"broken-calculator","columnArticles":1,"formTitle":"[991]Broken Calculator","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":93920,"title":"Broken Calculator","titleSlug":"broken-calculator"},{"acceptance":0.5309117716047315,"acs":63376,"articleLive":0,"columnArticles":0,"formTitle":"[992]Subarrays with K Different Integers","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":119372,"title":"Subarrays with K Different Integers","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5368117788978659,"acs":197135,"articleLive":1,"articleSlug":"cousins-in-binary-tree","columnArticles":1,"formTitle":"[993]Cousins in Binary Tree","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"","submitted":367233,"title":"Cousins in Binary Tree","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5149607069388703,"acs":336946,"articleLive":1,"articleSlug":"rotting-oranges","columnArticles":1,"formTitle":"[994]Rotting Oranges","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"","submitted":654314,"title":"Rotting Oranges","titleSlug":"rotting-oranges"},{"acceptance":0.5063112719316699,"acs":24067,"articleLive":0,"columnArticles":0,"formTitle":"[995]Minimum Number of K Consecutive Bit Flips","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":47534,"title":"Minimum Number of K Consecutive Bit Flips","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4917432306633748,"acs":24299,"articleLive":0,"columnArticles":0,"formTitle":"[996]Number of Squareful Arrays","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":49414,"title":"Number of Squareful Arrays","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5002552881822112,"acs":255724,"articleLive":1,"articleSlug":"find-the-town-judge","columnArticles":1,"formTitle":"[997]Find the Town Judge","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":511187,"title":"Find the Town Judge","titleSlug":"find-the-town-judge"},{"acceptance":0.652348268682039,"acs":25377,"articleLive":0,"columnArticles":0,"formTitle":"[998]Maximum Binary Tree II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":38901,"title":"Maximum Binary Tree II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6777773059884223,"acs":47887,"articleLive":0,"columnArticles":0,"formTitle":"[999]Available Captures for Rook","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":70653,"title":"Available Captures for Rook","titleSlug":"available-captures-for-rook"},{"acceptance":0.4191249320847582,"acs":26228,"articleLive":0,"columnArticles":0,"formTitle":"[1000]Minimum Cost to Merge Stones","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":62578,"title":"Minimum Cost to Merge Stones","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.3606122755239858,"acs":14418,"articleLive":0,"columnArticles":0,"formTitle":"[1001]Grid Illumination","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":39982,"title":"Grid Illumination","titleSlug":"grid-illumination"},{"acceptance":0.6841507755089518,"acs":133785,"articleLive":0,"columnArticles":0,"formTitle":"[1002]Find Common Characters","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":195549,"title":"Find Common Characters","titleSlug":"find-common-characters"},{"acceptance":0.5759353817671474,"acs":38575,"articleLive":0,"columnArticles":0,"formTitle":"[1003]Check If Word Is Valid After Substitutions","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"","submitted":66978,"title":"Check If Word Is Valid After Substitutions","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.6240487374617957,"acs":182538,"articleLive":1,"articleSlug":"max-consecutive-ones-iii","columnArticles":1,"formTitle":"[1004]Max Consecutive Ones III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":292506,"title":"Max Consecutive Ones III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5163629640281858,"acs":50270,"articleLive":0,"columnArticles":0,"formTitle":"[1005]Maximize Sum Of Array After K Negations","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":97354,"title":"Maximize Sum Of Array After K Negations","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.5443815729309557,"acs":19049,"articleLive":0,"columnArticles":0,"formTitle":"[1006]Clumsy Factorial","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"","submitted":34992,"title":"Clumsy Factorial","titleSlug":"clumsy-factorial"},{"acceptance":0.5078377842848022,"acs":138399,"articleLive":1,"articleSlug":"minimum-domino-rotations-for-equal-row","columnArticles":1,"formTitle":"[1007]Minimum Domino Rotations For Equal Row","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":272526,"title":"Minimum Domino Rotations For Equal Row","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7996076838341586,"acs":218492,"articleLive":1,"articleSlug":"construct-binary-search-tree-from-preorder-traversal","columnArticles":1,"formTitle":"[1008]Construct Binary Search Tree from Preorder Traversal","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":273249,"title":"Construct Binary Search Tree from Preorder Traversal","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.6242714109268651,"acs":118777,"articleLive":1,"articleSlug":"complement-of-base-10-integer","columnArticles":1,"formTitle":"[1009]Complement of Base 10 Integer","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":190265,"title":"Complement of Base 10 Integer","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.5381803965779018,"acs":177585,"articleLive":1,"articleSlug":"pairs-of-songs-with-total-durations-divisible-by-60","columnArticles":1,"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":329973,"title":"Pairs of Songs With Total Durations Divisible by 60","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6291829523621228,"acs":124112,"articleLive":0,"columnArticles":0,"formTitle":"[1011]Capacity To Ship Packages Within D Days","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"","submitted":197259,"title":"Capacity To Ship Packages Within D Days","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.385250999555753,"acs":8672,"articleLive":0,"columnArticles":0,"formTitle":"[1012]Numbers With Repeated Digits","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":22510,"title":"Numbers With Repeated Digits","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.44998605594205304,"acs":59701,"articleLive":0,"columnArticles":0,"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":132673,"title":"Partition Array Into Three Parts With Equal Sum","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5765086206896551,"acs":46545,"articleLive":0,"columnArticles":0,"formTitle":"[1014]Best Sightseeing Pair","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":80736,"title":"Best Sightseeing Pair","titleSlug":"best-sightseeing-pair"},{"acceptance":0.4691816192560175,"acs":53604,"articleLive":1,"articleSlug":"smallest-integer-divisible-by-k","columnArticles":1,"formTitle":"[1015]Smallest Integer Divisible by K","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":114250,"title":"Smallest Integer Divisible by K","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5807098798369368,"acs":27208,"articleLive":0,"columnArticles":0,"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":46853,"title":"Binary String With Substrings Representing 1 To N","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.598898815707459,"acs":17295,"articleLive":0,"columnArticles":0,"formTitle":"[1017]Convert to Base -2","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":28878,"title":"Convert to Base -2","titleSlug":"convert-to-base-2"},{"acceptance":0.4759924772590612,"acs":37205,"articleLive":0,"columnArticles":0,"formTitle":"[1018]Binary Prefix Divisible By 5","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":78163,"title":"Binary Prefix Divisible By 5","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.594463511504025,"acs":94745,"articleLive":0,"columnArticles":0,"formTitle":"[1019]Next Greater Node In Linked List","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"","submitted":159379,"title":"Next Greater Node In Linked List","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.612808300215393,"acs":40400,"articleLive":0,"columnArticles":0,"formTitle":"[1020]Number of Enclaves","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":65926,"title":"Number of Enclaves","titleSlug":"number-of-enclaves"},{"acceptance":0.796694101306949,"acs":162332,"articleLive":0,"columnArticles":0,"formTitle":"[1021]Remove Outermost Parentheses","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"","submitted":203757,"title":"Remove Outermost Parentheses","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7391910266770543,"acs":152759,"articleLive":1,"articleSlug":"sum-of-root-to-leaf-binary-numbers","columnArticles":1,"formTitle":"[1022]Sum of Root To Leaf Binary Numbers","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":206657,"title":"Sum of Root To Leaf Binary Numbers","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5868066688041039,"acs":29284,"articleLive":0,"columnArticles":0,"formTitle":"[1023]Camelcase Matching","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":49904,"title":"Camelcase Matching","titleSlug":"camelcase-matching"},{"acceptance":0.49922373446052376,"acs":44053,"articleLive":0,"columnArticles":0,"formTitle":"[1024]Video Stitching","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":88243,"title":"Video Stitching","titleSlug":"video-stitching"},{"acceptance":0.6646839210702153,"acs":142251,"articleLive":0,"columnArticles":0,"formTitle":"[1025]Divisor Game","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":214013,"title":"Divisor Game","titleSlug":"divisor-game"},{"acceptance":0.7299783167173396,"acs":123889,"articleLive":1,"articleSlug":"maximum-difference-between-node-and-ancestor","columnArticles":1,"formTitle":"[1026]Maximum Difference Between Node and Ancestor","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":169716,"title":"Maximum Difference Between Node and Ancestor","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4848953143552689,"acs":81267,"articleLive":0,"columnArticles":0,"formTitle":"[1027]Longest Arithmetic Subsequence","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"","submitted":167597,"title":"Longest Arithmetic Subsequence","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7213071492973853,"acs":32800,"articleLive":0,"columnArticles":0,"formTitle":"[1028]Recover a Tree From Preorder Traversal","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":45473,"title":"Recover a Tree From Preorder Traversal","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.5979026849444361,"acs":131764,"articleLive":1,"articleSlug":"two-city-scheduling","columnArticles":1,"formTitle":"[1029]Two City Scheduling","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":220377,"title":"Two City Scheduling","titleSlug":"two-city-scheduling"},{"acceptance":0.6886490599975786,"acs":39817,"articleLive":0,"columnArticles":0,"formTitle":"[1030]Matrix Cells in Distance Order","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57819,"title":"Matrix Cells in Distance Order","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.593020008125127,"acs":46711,"articleLive":0,"columnArticles":0,"formTitle":"[1031]Maximum Sum of Two Non-Overlapping Subarrays","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":78768,"title":"Maximum Sum of Two Non-Overlapping Subarrays","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.5131790628860352,"acs":71453,"articleLive":1,"articleSlug":"stream-of-characters","columnArticles":1,"formTitle":"[1032]Stream of Characters","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":139236,"title":"Stream of Characters","titleSlug":"stream-of-characters"},{"acceptance":0.44668074126202206,"acs":19042,"articleLive":0,"columnArticles":0,"formTitle":"[1033]Moving Stones Until Consecutive","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":42630,"title":"Moving Stones Until Consecutive","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.48044508357104126,"acs":20380,"articleLive":0,"columnArticles":0,"formTitle":"[1034]Coloring A Border","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":42419,"title":"Coloring A Border","titleSlug":"coloring-a-border"},{"acceptance":0.5755977905696356,"acs":64296,"articleLive":0,"columnArticles":0,"formTitle":"[1035]Uncrossed Lines","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"","submitted":111703,"title":"Uncrossed Lines","titleSlug":"uncrossed-lines"},{"acceptance":0.34264093658716105,"acs":14897,"articleLive":0,"columnArticles":0,"formTitle":"[1036]Escape a Large Maze","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":43477,"title":"Escape a Large Maze","titleSlug":"escape-a-large-maze"},{"acceptance":0.3747847883329957,"acs":29605,"articleLive":0,"columnArticles":0,"formTitle":"[1037]Valid Boomerang","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":78992,"title":"Valid Boomerang","titleSlug":"valid-boomerang"},{"acceptance":0.8429249514987462,"acs":109925,"articleLive":0,"columnArticles":0,"formTitle":"[1038]Binary Search Tree to Greater Sum Tree","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":130409,"title":"Binary Search Tree to Greater Sum Tree","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5228383958655284,"acs":20638,"articleLive":0,"columnArticles":0,"formTitle":"[1039]Minimum Score Triangulation of Polygon","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":39473,"title":"Minimum Score Triangulation of Polygon","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.553429145878323,"acs":7432,"articleLive":0,"columnArticles":0,"formTitle":"[1040]Moving Stones Until Consecutive II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":13429,"title":"Moving Stones Until Consecutive II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.5558506643143196,"acs":173914,"articleLive":1,"articleSlug":"robot-bounded-in-circle","columnArticles":1,"formTitle":"[1041]Robot Bounded In Circle","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":312879,"title":"Robot Bounded In Circle","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.4968682152669702,"acs":51721,"articleLive":0,"columnArticles":0,"formTitle":"[1042]Flower Planting With No Adjacent","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":104094,"title":"Flower Planting With No Adjacent","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.7007369382420559,"acs":44501,"articleLive":0,"columnArticles":0,"formTitle":"[1043]Partition Array for Maximum Sum","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":63506,"title":"Partition Array for Maximum Sum","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.313614888869498,"acs":50317,"articleLive":1,"articleSlug":"longest-duplicate-substring","columnArticles":1,"formTitle":"[1044]Longest Duplicate Substring","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":160442,"title":"Longest Duplicate Substring","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6737313618547935,"acs":32488,"articleLive":0,"columnArticles":0,"formTitle":"[1045]Customers Who Bought All Products","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":48221,"title":"Customers Who Bought All Products","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6298275736983386,"acs":208352,"articleLive":1,"articleSlug":"last-stone-weight","columnArticles":1,"formTitle":"[1046]Last Stone Weight","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":330808,"title":"Last Stone Weight","titleSlug":"last-stone-weight"},{"acceptance":0.7105409376930258,"acs":251923,"articleLive":1,"articleSlug":"remove-all-adjacent-duplicates-in-string","columnArticles":1,"formTitle":"[1047]Remove All Adjacent Duplicates In String","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"","submitted":354551,"title":"Remove All Adjacent Duplicates In String","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.5756244424620874,"acs":180677,"articleLive":1,"articleSlug":"longest-string-chain","columnArticles":1,"formTitle":"[1048]Longest String Chain","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":313880,"title":"Longest String Chain","titleSlug":"longest-string-chain"},{"acceptance":0.5043847445924918,"acs":48946,"articleLive":0,"columnArticles":0,"formTitle":"[1049]Last Stone Weight II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"","submitted":97041,"title":"Last Stone Weight II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7234968953505982,"acs":38218,"articleLive":0,"columnArticles":0,"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":52824,"title":"Actors and Directors Who Cooperated At Least Three Times","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7405459870927737,"acs":181533,"articleLive":0,"columnArticles":0,"formTitle":"[1051]Height Checker","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":245134,"title":"Height Checker","titleSlug":"height-checker"},{"acceptance":0.5656274531793204,"acs":50437,"articleLive":0,"columnArticles":0,"formTitle":"[1052]Grumpy Bookstore Owner","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":89170,"title":"Grumpy Bookstore Owner","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.5207159731055788,"acs":28655,"articleLive":0,"columnArticles":0,"formTitle":"[1053]Previous Permutation With One Swap","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":55030,"title":"Previous Permutation With One Swap","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.4509885204081633,"acs":28286,"articleLive":0,"columnArticles":0,"formTitle":"[1054]Distant Barcodes","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":62720,"title":"Distant Barcodes","titleSlug":"distant-barcodes"},{"acceptance":0.5814749463211378,"acs":54704,"articleLive":0,"columnArticles":0,"formTitle":"[1055]Shortest Way to Form String","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":94078,"title":"Shortest Way to Form String","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.46198523698523697,"acs":23783,"articleLive":0,"columnArticles":0,"formTitle":"[1056]Confusing Number","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":51480,"title":"Confusing Number","titleSlug":"confusing-number"},{"acceptance":0.5785043804755945,"acs":55467,"articleLive":0,"columnArticles":0,"formTitle":"[1057]Campus Bikes","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":95880,"title":"Campus Bikes","titleSlug":"campus-bikes"},{"acceptance":0.4433909300729836,"acs":7108,"articleLive":0,"columnArticles":0,"formTitle":"[1058]Minimize Rounding Error to Meet Target","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":16031,"title":"Minimize Rounding Error to Meet Target","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.42572499768159716,"acs":32135,"articleLive":1,"articleSlug":"all-paths-from-source-lead-to-destination","columnArticles":1,"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":75483,"title":"All Paths from Source Lead to Destination","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.552471335103971,"acs":85285,"articleLive":1,"articleSlug":"missing-element-in-sorted-array","columnArticles":1,"formTitle":"[1060]Missing Element in Sorted Array","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":154370,"title":"Missing Element in Sorted Array","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6799637352674524,"acs":6750,"articleLive":0,"columnArticles":0,"formTitle":"[1061]Lexicographically Smallest Equivalent String","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":9927,"title":"Lexicographically Smallest Equivalent String","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5937214414503421,"acs":24038,"articleLive":1,"articleSlug":"longest-repeating-substring","columnArticles":1,"formTitle":"[1062]Longest Repeating Substring","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":40487,"title":"Longest Repeating Substring","titleSlug":"longest-repeating-substring"},{"acceptance":0.7329751343246282,"acs":5866,"articleLive":0,"columnArticles":0,"formTitle":"[1063]Number of Valid Subarrays","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":8003,"title":"Number of Valid Subarrays","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6343431165445638,"acs":28227,"articleLive":1,"articleSlug":"fixed-point","columnArticles":1,"formTitle":"[1064]Fixed Point","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":44498,"title":"Fixed Point","titleSlug":"fixed-point"},{"acceptance":0.6198806836504354,"acs":15378,"articleLive":0,"columnArticles":0,"formTitle":"[1065]Index Pairs of a String","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":24808,"title":"Index Pairs of a String","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.5463298869339138,"acs":36143,"articleLive":1,"articleSlug":"campus-bikes-ii","columnArticles":1,"formTitle":"[1066]Campus Bikes II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":66156,"title":"Campus Bikes II","titleSlug":"campus-bikes-ii"},{"acceptance":0.418975650713686,"acs":2495,"articleLive":0,"columnArticles":0,"formTitle":"[1067]Digit Count in Range","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":5955,"title":"Digit Count in Range","titleSlug":"digit-count-in-range"},{"acceptance":0.8111813960291052,"acs":44370,"articleLive":0,"columnArticles":0,"formTitle":"[1068]Product Sales Analysis I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":54698,"title":"Product Sales Analysis I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8268227683757374,"acs":36300,"articleLive":0,"columnArticles":0,"formTitle":"[1069]Product Sales Analysis II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":43903,"title":"Product Sales Analysis II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.49751190155393876,"acs":27694,"articleLive":0,"columnArticles":0,"formTitle":"[1070]Product Sales Analysis III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":55665,"title":"Product Sales Analysis III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5171507843015686,"acs":66729,"articleLive":0,"columnArticles":0,"formTitle":"[1071]Greatest Common Divisor of Strings","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"","submitted":129032,"title":"Greatest Common Divisor of Strings","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.628794721753132,"acs":16011,"articleLive":0,"columnArticles":0,"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":25463,"title":"Flip Columns For Maximum Number of Equal Rows","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.35518682956865544,"acs":10960,"articleLive":0,"columnArticles":0,"formTitle":"[1073]Adding Two Negabinary Numbers","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":30857,"title":"Adding Two Negabinary Numbers","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.662332838038633,"acs":46358,"articleLive":1,"articleSlug":"number-of-submatrices-that-sum-to-target","columnArticles":1,"formTitle":"[1074]Number of Submatrices That Sum to Target","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"","submitted":69992,"title":"Number of Submatrices That Sum to Target","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6689495437573628,"acs":33503,"articleLive":0,"columnArticles":0,"formTitle":"[1075]Project Employees I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":50083,"title":"Project Employees I","titleSlug":"project-employees-i"},{"acceptance":0.5156086501569584,"acs":35478,"articleLive":0,"columnArticles":0,"formTitle":"[1076]Project Employees II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":68808,"title":"Project Employees II","titleSlug":"project-employees-ii"},{"acceptance":0.785984657313011,"acs":31147,"articleLive":0,"columnArticles":0,"formTitle":"[1077]Project Employees III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":39628,"title":"Project Employees III","titleSlug":"project-employees-iii"},{"acceptance":0.6435034573592361,"acs":48858,"articleLive":0,"columnArticles":0,"formTitle":"[1078]Occurrences After Bigram","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":75925,"title":"Occurrences After Bigram","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7616983465616407,"acs":63435,"articleLive":0,"columnArticles":0,"formTitle":"[1079]Letter Tile Possibilities","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":83281,"title":"Letter Tile Possibilities","titleSlug":"letter-tile-possibilities"},{"acceptance":0.5153267910140595,"acs":23788,"articleLive":0,"columnArticles":0,"formTitle":"[1080]Insufficient Nodes in Root to Leaf Paths","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":46161,"title":"Insufficient Nodes in Root to Leaf Paths","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5481334621185162,"acs":32347,"articleLive":0,"columnArticles":0,"formTitle":"[1081]Smallest Subsequence of Distinct Characters","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"","submitted":59013,"title":"Smallest Subsequence of Distinct Characters","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7497654688583432,"acs":36764,"articleLive":0,"columnArticles":0,"formTitle":"[1082]Sales Analysis I","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":49034,"title":"Sales Analysis I","titleSlug":"sales-analysis-i"},{"acceptance":0.5051990696401697,"acs":36925,"articleLive":0,"columnArticles":0,"formTitle":"[1083]Sales Analysis II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":73090,"title":"Sales Analysis II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5366945018107809,"acs":35863,"articleLive":0,"columnArticles":0,"formTitle":"[1084]Sales Analysis III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":66822,"title":"Sales Analysis III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7555089607152747,"acs":19097,"articleLive":0,"columnArticles":0,"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":25277,"title":"Sum of Digits in the Minimum Number","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.7568662243480945,"acs":78484,"articleLive":1,"articleSlug":"high-five","columnArticles":1,"formTitle":"[1086]High Five","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":103696,"title":"High Five","titleSlug":"high-five"},{"acceptance":0.6427039593432933,"acs":35663,"articleLive":0,"columnArticles":0,"formTitle":"[1087]Brace Expansion","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":55489,"title":"Brace Expansion","titleSlug":"brace-expansion"},{"acceptance":0.46531385100036865,"acs":27769,"articleLive":0,"columnArticles":0,"formTitle":"[1088]Confusing Number II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":59678,"title":"Confusing Number II","titleSlug":"confusing-number-ii"},{"acceptance":0.5111498265251639,"acs":240290,"articleLive":1,"articleSlug":"duplicate-zeros","columnArticles":1,"formTitle":"[1089]Duplicate Zeros","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":470097,"title":"Duplicate Zeros","titleSlug":"duplicate-zeros"},{"acceptance":0.604786950578095,"acs":26102,"articleLive":0,"columnArticles":0,"formTitle":"[1090]Largest Values From Labels","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":43159,"title":"Largest Values From Labels","titleSlug":"largest-values-from-labels"},{"acceptance":0.4203993584965327,"acs":148892,"articleLive":1,"articleSlug":"shortest-path-in-binary-matrix","columnArticles":1,"formTitle":"[1091]Shortest Path in Binary Matrix","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"","submitted":354168,"title":"Shortest Path in Binary Matrix","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.5552611818709887,"acs":39192,"articleLive":0,"columnArticles":0,"formTitle":"[1092]Shortest Common Supersequence ","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":70583,"title":"Shortest Common Supersequence ","titleSlug":"shortest-common-supersequence"},{"acceptance":0.4625929283771532,"acs":12756,"articleLive":0,"columnArticles":0,"formTitle":"[1093]Statistics from a Large Sample","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":27575,"title":"Statistics from a Large Sample","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5875311169828633,"acs":138306,"articleLive":1,"articleSlug":"car-pooling","columnArticles":1,"formTitle":"[1094]Car Pooling","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":235402,"title":"Car Pooling","titleSlug":"car-pooling"},{"acceptance":0.35895762478168947,"acs":39051,"articleLive":0,"columnArticles":0,"formTitle":"[1095]Find in Mountain Array","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":108790,"title":"Find in Mountain Array","titleSlug":"find-in-mountain-array"},{"acceptance":0.6229159400069759,"acs":17859,"articleLive":0,"columnArticles":0,"formTitle":"[1096]Brace Expansion II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":28670,"title":"Brace Expansion II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5610108601395714,"acs":13586,"articleLive":0,"columnArticles":0,"formTitle":"[1097]Game Play Analysis V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":24217,"title":"Game Play Analysis V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4531818352270597,"acs":24170,"articleLive":0,"columnArticles":0,"formTitle":"[1098]Unpopular Books","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":53334,"title":"Unpopular Books","titleSlug":"unpopular-books"},{"acceptance":0.6045639675934775,"acs":82234,"articleLive":1,"articleSlug":"two-sum-less-than-k","columnArticles":1,"formTitle":"[1099]Two Sum Less Than K","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":136022,"title":"Two Sum Less Than K","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7309064730186553,"acs":23351,"articleLive":1,"articleSlug":"find-k-length-substrings-with-no-repeated-characters","columnArticles":1,"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":31948,"title":"Find K-Length Substrings With No Repeated Characters","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6438017729981107,"acs":26580,"articleLive":1,"articleSlug":"the-earliest-moment-when-everyone-become-friends","columnArticles":1,"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":41286,"title":"The Earliest Moment When Everyone Become Friends","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.5232892975321428,"acs":41433,"articleLive":0,"columnArticles":0,"formTitle":"[1102]Path With Maximum Minimum Value","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":79178,"title":"Path With Maximum Minimum Value","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6367633952618331,"acs":65018,"articleLive":0,"columnArticles":0,"formTitle":"[1103]Distribute Candies to People","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":102107,"title":"Distribute Candies to People","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7422184833553659,"acs":30880,"articleLive":0,"columnArticles":0,"formTitle":"[1104]Path In Zigzag Labelled Binary Tree","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"","submitted":41605,"title":"Path In Zigzag Labelled Binary Tree","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5792489820539889,"acs":30728,"articleLive":0,"columnArticles":0,"formTitle":"[1105]Filling Bookcase Shelves","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":53048,"title":"Filling Bookcase Shelves","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5937778082004244,"acs":17349,"articleLive":0,"columnArticles":0,"formTitle":"[1106]Parsing A Boolean Expression","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":29218,"title":"Parsing A Boolean Expression","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.45754975351469784,"acs":22554,"articleLive":0,"columnArticles":0,"formTitle":"[1107]New Users Daily Count","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":49293,"title":"New Users Daily Count","titleSlug":"new-users-daily-count"},{"acceptance":0.8881806219075734,"acs":385402,"articleLive":0,"columnArticles":0,"formTitle":"[1108]Defanging an IP Address","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":433923,"title":"Defanging an IP Address","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5752341107061727,"acs":35198,"articleLive":0,"columnArticles":0,"formTitle":"[1109]Corporate Flight Bookings","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":61189,"title":"Corporate Flight Bookings","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6914262521768267,"acs":146507,"articleLive":0,"columnArticles":0,"formTitle":"[1110]Delete Nodes And Return Forest","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":211891,"title":"Delete Nodes And Return Forest","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7279417711281844,"acs":18002,"articleLive":0,"columnArticles":0,"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":24730,"title":"Maximum Nesting Depth of Two Valid Parentheses Strings","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.732454663523979,"acs":30454,"articleLive":0,"columnArticles":0,"formTitle":"[1112]Highest Grade For Each Student","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":41578,"title":"Highest Grade For Each Student","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.6627933010926026,"acs":29603,"articleLive":0,"columnArticles":0,"formTitle":"[1113]Reported Posts","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":44664,"title":"Reported Posts","titleSlug":"reported-posts"},{"acceptance":0.6818639208226505,"acs":98933,"articleLive":1,"articleSlug":"print-in-order","columnArticles":1,"formTitle":"[1114]Print in Order","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":145092,"title":"Print in Order","titleSlug":"print-in-order"},{"acceptance":0.6010628505504486,"acs":48974,"articleLive":0,"columnArticles":0,"formTitle":"[1115]Print FooBar Alternately","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81479,"title":"Print FooBar Alternately","titleSlug":"print-foobar-alternately"},{"acceptance":0.5902229048360043,"acs":29206,"articleLive":0,"columnArticles":0,"formTitle":"[1116]Print Zero Even Odd","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":49483,"title":"Print Zero Even Odd","titleSlug":"print-zero-even-odd"},{"acceptance":0.5394655437364041,"acs":27031,"articleLive":0,"columnArticles":0,"formTitle":"[1117]Building H2O","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":50107,"title":"Building H2O","titleSlug":"building-h2o"},{"acceptance":0.5699971907481974,"acs":6087,"articleLive":0,"columnArticles":0,"formTitle":"[1118]Number of Days in a Month","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":10679,"title":"Number of Days in a Month","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.9066334553886064,"acs":78985,"articleLive":0,"columnArticles":0,"formTitle":"[1119]Remove Vowels from a String","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":87119,"title":"Remove Vowels from a String","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6499962510309665,"acs":52014,"articleLive":1,"articleSlug":"maximum-average-subtree","columnArticles":1,"formTitle":"[1120]Maximum Average Subtree","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":80022,"title":"Maximum Average Subtree","titleSlug":"maximum-average-subtree"},{"acceptance":0.5957951312045526,"acs":3769,"articleLive":0,"columnArticles":0,"formTitle":"[1121]Divide Array Into Increasing Sequences","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":6326,"title":"Divide Array Into Increasing Sequences","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.6805116820940248,"acs":117408,"articleLive":0,"columnArticles":0,"formTitle":"[1122]Relative Sort Array","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":172529,"title":"Relative Sort Array","titleSlug":"relative-sort-array"},{"acceptance":0.6965639978158432,"acs":68886,"articleLive":0,"columnArticles":0,"formTitle":"[1123]Lowest Common Ancestor of Deepest Leaves","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":98894,"title":"Lowest Common Ancestor of Deepest Leaves","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3403800911017303,"acs":20400,"articleLive":0,"columnArticles":0,"formTitle":"[1124]Longest Well-Performing Interval","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"","submitted":59933,"title":"Longest Well-Performing Interval","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4795238992525595,"acs":15269,"articleLive":0,"columnArticles":0,"formTitle":"[1125]Smallest Sufficient Team","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":31842,"title":"Smallest Sufficient Team","titleSlug":"smallest-sufficient-team"},{"acceptance":0.679876817447496,"acs":26934,"articleLive":0,"columnArticles":0,"formTitle":"[1126]Active Businesses","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":39616,"title":"Active Businesses","titleSlug":"active-businesses"},{"acceptance":0.5121939080230937,"acs":10291,"articleLive":0,"columnArticles":0,"formTitle":"[1127]User Purchase Platform","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":20092,"title":"User Purchase Platform","titleSlug":"user-purchase-platform"},{"acceptance":0.46118132039724347,"acs":44302,"articleLive":0,"columnArticles":0,"formTitle":"[1128]Number of Equivalent Domino Pairs","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":96062,"title":"Number of Equivalent Domino Pairs","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.41460032846027517,"acs":30799,"articleLive":0,"columnArticles":0,"formTitle":"[1129]Shortest Path with Alternating Colors","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":74286,"title":"Shortest Path with Alternating Colors","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6840282685512368,"acs":67753,"articleLive":0,"columnArticles":0,"formTitle":"[1130]Minimum Cost Tree From Leaf Values","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"","submitted":99050,"title":"Minimum Cost Tree From Leaf Values","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.5025521124905324,"acs":15261,"articleLive":0,"columnArticles":0,"formTitle":"[1131]Maximum of Absolute Value Expression","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":30367,"title":"Maximum of Absolute Value Expression","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.33970949407059153,"acs":24206,"articleLive":0,"columnArticles":0,"formTitle":"[1132]Reported Posts II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":71255,"title":"Reported Posts II","titleSlug":"reported-posts-ii"},{"acceptance":0.6735542097138107,"acs":28360,"articleLive":1,"articleSlug":"largest-unique-number","columnArticles":1,"formTitle":"[1133]Largest Unique Number","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":42105,"title":"Largest Unique Number","titleSlug":"largest-unique-number"},{"acceptance":0.7838718197024386,"acs":26712,"articleLive":1,"articleSlug":"armstrong-number","columnArticles":1,"formTitle":"[1134]Armstrong Number","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":34077,"title":"Armstrong Number","titleSlug":"armstrong-number"},{"acceptance":0.6056790784891508,"acs":52003,"articleLive":1,"articleSlug":"connecting-cities-with-minimum-cost","columnArticles":1,"formTitle":"[1135]Connecting Cities With Minimum Cost","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":85859,"title":"Connecting Cities With Minimum Cost","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.6068726412539049,"acs":33608,"articleLive":1,"articleSlug":"parallel-courses","columnArticles":1,"formTitle":"[1136]Parallel Courses","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":55379,"title":"Parallel Courses","titleSlug":"parallel-courses"},{"acceptance":0.6231327443781551,"acs":217249,"articleLive":1,"articleSlug":"n-th-tribonacci-number","columnArticles":1,"formTitle":"[1137]N-th Tribonacci Number","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"","submitted":348640,"title":"N-th Tribonacci Number","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.5230660338079773,"acs":37689,"articleLive":0,"columnArticles":0,"formTitle":"[1138]Alphabet Board Path","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":72054,"title":"Alphabet Board Path","titleSlug":"alphabet-board-path"},{"acceptance":0.4925220358259881,"acs":17322,"articleLive":0,"columnArticles":0,"formTitle":"[1139]Largest 1-Bordered Square","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":35170,"title":"Largest 1-Bordered Square","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6483150401514886,"acs":36976,"articleLive":0,"columnArticles":0,"formTitle":"[1140]Stone Game II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":57034,"title":"Stone Game II","titleSlug":"stone-game-ii"},{"acceptance":0.5417941904151012,"acs":29563,"articleLive":0,"columnArticles":0,"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":54565,"title":"User Activity for the Past 30 Days I","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3589873225728984,"acs":28402,"articleLive":0,"columnArticles":0,"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":79117,"title":"User Activity for the Past 30 Days II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.5881388533007913,"acs":347970,"articleLive":1,"articleSlug":"longest-common-subsequence","columnArticles":1,"formTitle":"[1143]Longest Common Subsequence","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"","submitted":591646,"title":"Longest Common Subsequence","titleSlug":"longest-common-subsequence"},{"acceptance":0.4691648462443287,"acs":13960,"articleLive":0,"columnArticles":0,"formTitle":"[1144]Decrease Elements To Make Array Zigzag","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"","submitted":29755,"title":"Decrease Elements To Make Array Zigzag","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.5115525938842872,"acs":32856,"articleLive":0,"columnArticles":0,"formTitle":"[1145]Binary Tree Coloring Game","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":64228,"title":"Binary Tree Coloring Game","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.3708235681098639,"acs":90188,"articleLive":0,"columnArticles":0,"formTitle":"[1146]Snapshot Array","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":243210,"title":"Snapshot Array","titleSlug":"snapshot-array"},{"acceptance":0.6039806763285024,"acs":15628,"articleLive":0,"columnArticles":0,"formTitle":"[1147]Longest Chunked Palindrome Decomposition","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":25875,"title":"Longest Chunked Palindrome Decomposition","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7682685317490161,"acs":30647,"articleLive":0,"columnArticles":0,"formTitle":"[1148]Article Views I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":39891,"title":"Article Views I","titleSlug":"article-views-i"},{"acceptance":0.4812643552444493,"acs":22001,"articleLive":0,"columnArticles":0,"formTitle":"[1149]Article Views II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":45715,"title":"Article Views II","titleSlug":"article-views-ii"},{"acceptance":0.5687791601866252,"acs":29258,"articleLive":0,"columnArticles":0,"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":51440,"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.595363390698336,"acs":29302,"articleLive":1,"articleSlug":"minimum-swaps-to-group-all-1s-together","columnArticles":1,"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":49217,"title":"Minimum Swaps to Group All 1's Together","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.4341489353131219,"acs":53887,"articleLive":0,"columnArticles":0,"formTitle":"[1152]Analyze User Website Visit Pattern","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":124121,"title":"Analyze User Website Visit Pattern","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3555367090971336,"acs":45695,"articleLive":1,"articleSlug":"string-transforms-into-another-string","columnArticles":1,"formTitle":"[1153]String Transforms Into Another String","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":128524,"title":"String Transforms Into Another String","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5105728118189229,"acs":30689,"articleLive":0,"columnArticles":0,"formTitle":"[1154]Day of the Year","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":60107,"title":"Day of the Year","titleSlug":"day-of-the-year"},{"acceptance":0.4752609509322178,"acs":94979,"articleLive":0,"columnArticles":0,"formTitle":"[1155]Number of Dice Rolls With Target Sum","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":199846,"title":"Number of Dice Rolls With Target Sum","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.46699393965723224,"acs":21499,"articleLive":0,"columnArticles":0,"formTitle":"[1156]Swap For Longest Repeated Character Substring","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":46037,"title":"Swap For Longest Repeated Character Substring","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.4199579904273269,"acs":12196,"articleLive":0,"columnArticles":0,"formTitle":"[1157]Online Majority Element In Subarray","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":29041,"title":"Online Majority Element In Subarray","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.6540117294734216,"acs":20965,"articleLive":0,"columnArticles":0,"formTitle":"[1158]Market Analysis I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":32056,"title":"Market Analysis I","titleSlug":"market-analysis-i"},{"acceptance":0.5757505880182632,"acs":12484,"articleLive":0,"columnArticles":0,"formTitle":"[1159]Market Analysis II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":21683,"title":"Market Analysis II","titleSlug":"market-analysis-ii"},{"acceptance":0.6771385485635141,"acs":104624,"articleLive":0,"columnArticles":0,"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":154509,"title":"Find Words That Can Be Formed by Characters","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6672114501905583,"acs":95937,"articleLive":1,"articleSlug":"maximum-level-sum-of-a-binary-tree","columnArticles":1,"formTitle":"[1161]Maximum Level Sum of a Binary Tree","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":143788,"title":"Maximum Level Sum of a Binary Tree","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.47630752294274514,"acs":50189,"articleLive":0,"columnArticles":0,"formTitle":"[1162]As Far from Land as Possible","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":105371,"title":"As Far from Land as Possible","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.3582492168465019,"acs":28819,"articleLive":0,"columnArticles":0,"formTitle":"[1163]Last Substring in Lexicographical Order","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":80444,"title":"Last Substring in Lexicographical Order","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6839884407845945,"acs":26746,"articleLive":0,"columnArticles":0,"formTitle":"[1164]Product Price at a Given Date","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":39103,"title":"Product Price at a Given Date","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8560560043734434,"acs":56373,"articleLive":1,"articleSlug":"single-row-keyboard","columnArticles":1,"formTitle":"[1165]Single-Row Keyboard","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":65852,"title":"Single-Row Keyboard","titleSlug":"single-row-keyboard"},{"acceptance":0.6006371455877668,"acs":18854,"articleLive":1,"articleSlug":"design-file-system","columnArticles":1,"formTitle":"[1166]Design File System","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":31390,"title":"Design File System","titleSlug":"design-file-system"},{"acceptance":0.6660086345260882,"acs":77596,"articleLive":1,"articleSlug":"minimum-cost-to-connect-sticks","columnArticles":1,"formTitle":"[1167]Minimum Cost to Connect Sticks","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":116509,"title":"Minimum Cost to Connect Sticks","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.6344382615369855,"acs":26451,"articleLive":1,"articleSlug":"optimize-water-distribution-in-a-village","columnArticles":1,"formTitle":"[1168]Optimize Water Distribution in a Village","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":41692,"title":"Optimize Water Distribution in a Village","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3016302819447681,"acs":37540,"articleLive":0,"columnArticles":0,"formTitle":"[1169]Invalid Transactions","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":124457,"title":"Invalid Transactions","titleSlug":"invalid-transactions"},{"acceptance":0.6091975029577831,"acs":63334,"articleLive":0,"columnArticles":0,"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":103963,"title":"Compare Strings by Frequency of the Smallest Character","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4232046860736383,"acs":33379,"articleLive":0,"columnArticles":0,"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":78872,"title":"Remove Zero Sum Consecutive Nodes from Linked List","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.3490863432357341,"acs":13067,"articleLive":0,"columnArticles":0,"formTitle":"[1172]Dinner Plate Stacks","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":37432,"title":"Dinner Plate Stacks","titleSlug":"dinner-plate-stacks"},{"acceptance":0.8319871934803172,"acs":34302,"articleLive":0,"columnArticles":0,"formTitle":"[1173]Immediate Food Delivery I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":41229,"title":"Immediate Food Delivery I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6356431368920961,"acs":20612,"articleLive":0,"columnArticles":0,"formTitle":"[1174]Immediate Food Delivery II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":32427,"title":"Immediate Food Delivery II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.5248539623057423,"acs":19048,"articleLive":0,"columnArticles":0,"formTitle":"[1175]Prime Arrangements","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":36292,"title":"Prime Arrangements","titleSlug":"prime-arrangements"},{"acceptance":0.5274908132843376,"acs":22824,"articleLive":0,"columnArticles":0,"formTitle":"[1176]Diet Plan Performance","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":43269,"title":"Diet Plan Performance","titleSlug":"diet-plan-performance"},{"acceptance":0.3715562748044542,"acs":19286,"articleLive":0,"columnArticles":0,"formTitle":"[1177]Can Make Palindrome from Substring","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":51906,"title":"Can Make Palindrome from Substring","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4690903844766645,"acs":26012,"articleLive":1,"articleSlug":"number-of-valid-words-for-each-puzzle","columnArticles":1,"formTitle":"[1178]Number of Valid Words for Each Puzzle","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":55452,"title":"Number of Valid Words for Each Puzzle","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.8227436916920039,"acs":63320,"articleLive":0,"columnArticles":0,"formTitle":"[1179]Reformat Department Table","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":76962,"title":"Reformat Department Table","titleSlug":"reformat-department-table"},{"acceptance":0.7859129191164786,"acs":19783,"articleLive":1,"articleSlug":"count-substrings-with-only-one-distinct-letter","columnArticles":1,"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":25172,"title":"Count Substrings with Only One Distinct Letter","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.449344822311732,"acs":8813,"articleLive":0,"columnArticles":0,"formTitle":"[1181]Before and After Puzzle","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":19613,"title":"Before and After Puzzle","titleSlug":"before-and-after-puzzle"},{"acceptance":0.5433684210526316,"acs":20648,"articleLive":1,"articleSlug":"shortest-distance-to-target-color","columnArticles":1,"formTitle":"[1182]Shortest Distance to Target Color","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":38000,"title":"Shortest Distance to Target Color","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5961372153358316,"acs":2068,"articleLive":0,"columnArticles":0,"formTitle":"[1183]Maximum Number of Ones","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":3469,"title":"Maximum Number of Ones","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5407010230108883,"acs":39429,"articleLive":0,"columnArticles":0,"formTitle":"[1184]Distance Between Bus Stops","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":72922,"title":"Distance Between Bus Stops","titleSlug":"distance-between-bus-stops"},{"acceptance":0.5882505848713283,"acs":40734,"articleLive":0,"columnArticles":0,"formTitle":"[1185]Day of the Week","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":69246,"title":"Day of the Week","titleSlug":"day-of-the-week"},{"acceptance":0.4039914064505668,"acs":29899,"articleLive":0,"columnArticles":0,"formTitle":"[1186]Maximum Subarray Sum with One Deletion","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":74009,"title":"Maximum Subarray Sum with One Deletion","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44554738562091506,"acs":10907,"articleLive":0,"columnArticles":0,"formTitle":"[1187]Make Array Strictly Increasing","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":24480,"title":"Make Array Strictly Increasing","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.7309112619684673,"acs":33054,"articleLive":0,"columnArticles":0,"formTitle":"[1188]Design Bounded Blocking Queue","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":45223,"title":"Design Bounded Blocking Queue","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6250445040469014,"acs":105335,"articleLive":1,"articleSlug":"maximum-number-of-balloons","columnArticles":1,"formTitle":"[1189]Maximum Number of Balloons","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":168524,"title":"Maximum Number of Balloons","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6556997834126504,"acs":44503,"articleLive":0,"columnArticles":0,"formTitle":"[1190]Reverse Substrings Between Each Pair of Parentheses","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"","submitted":67871,"title":"Reverse Substrings Between Each Pair of Parentheses","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.24178068421108326,"acs":22849,"articleLive":0,"columnArticles":0,"formTitle":"[1191]K-Concatenation Maximum Sum","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":94503,"title":"K-Concatenation Maximum Sum","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5199018913012019,"acs":140112,"articleLive":1,"articleSlug":"critical-connections-in-a-network","columnArticles":1,"formTitle":"[1192]Critical Connections in a Network","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":269497,"title":"Critical Connections in a Network","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6782417733246405,"acs":19766,"articleLive":0,"columnArticles":0,"formTitle":"[1193]Monthly Transactions I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":29143,"title":"Monthly Transactions I","titleSlug":"monthly-transactions-i"},{"acceptance":0.52108131676477,"acs":11951,"articleLive":0,"columnArticles":0,"formTitle":"[1194]Tournament Winners","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":22935,"title":"Tournament Winners","titleSlug":"tournament-winners"},{"acceptance":0.7200943658062725,"acs":25945,"articleLive":0,"columnArticles":0,"formTitle":"[1195]Fizz Buzz Multithreaded","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":36030,"title":"Fizz Buzz Multithreaded","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6774512413032734,"acs":17819,"articleLive":1,"articleSlug":"how-many-apples-can-you-put-into-the-basket","columnArticles":1,"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":26303,"title":"How Many Apples Can You Put into the Basket","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.39444755986080493,"acs":102696,"articleLive":1,"articleSlug":"minimum-knight-moves","columnArticles":1,"formTitle":"[1197]Minimum Knight Moves","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":260354,"title":"Minimum Knight Moves","titleSlug":"minimum-knight-moves"},{"acceptance":0.7602580875356802,"acs":25569,"articleLive":1,"articleSlug":"find-smallest-common-element-in-all-rows","columnArticles":1,"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":33632,"title":"Find Smallest Common Element in All Rows","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.40041367562963864,"acs":3291,"articleLive":0,"columnArticles":0,"formTitle":"[1199]Minimum Time to Build Blocks","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":8219,"title":"Minimum Time to Build Blocks","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6976284832043604,"acs":111608,"articleLive":1,"articleSlug":"minimum-absolute-difference","columnArticles":1,"formTitle":"[1200]Minimum Absolute Difference","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":159982,"title":"Minimum Absolute Difference","titleSlug":"minimum-absolute-difference"},{"acceptance":0.27622809559395445,"acs":18112,"articleLive":0,"columnArticles":0,"formTitle":"[1201]Ugly Number III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":65569,"title":"Ugly Number III","titleSlug":"ugly-number-iii"},{"acceptance":0.5217009220760483,"acs":39775,"articleLive":0,"columnArticles":0,"formTitle":"[1202]Smallest String With Swaps","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":76241,"title":"Smallest String With Swaps","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.4914395527603075,"acs":11252,"articleLive":0,"columnArticles":0,"formTitle":"[1203]Sort Items by Groups Respecting Dependencies","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":22896,"title":"Sort Items by Groups Respecting Dependencies","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7344525097390768,"acs":26206,"articleLive":0,"columnArticles":0,"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":35681,"title":"Last Person to Fit in the Bus","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4491158367798873,"acs":13791,"articleLive":0,"columnArticles":0,"formTitle":"[1205]Monthly Transactions II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":30707,"title":"Monthly Transactions II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.5967673779843651,"acs":11298,"articleLive":0,"columnArticles":0,"formTitle":"[1206]Design Skiplist","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":18932,"title":"Design Skiplist","titleSlug":"design-skiplist"},{"acceptance":0.7207448533513212,"acs":111123,"articleLive":0,"columnArticles":0,"formTitle":"[1207]Unique Number of Occurrences","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":154178,"title":"Unique Number of Occurrences","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4620749485430452,"acs":27164,"articleLive":0,"columnArticles":0,"formTitle":"[1208]Get Equal Substrings Within Budget","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":58787,"title":"Get Equal Substrings Within Budget","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5609215312662393,"acs":145719,"articleLive":1,"articleSlug":"remove-all-adjacent-duplicates-in-string-ii","columnArticles":1,"formTitle":"[1209]Remove All Adjacent Duplicates in String II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"","submitted":259785,"title":"Remove All Adjacent Duplicates in String II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.47882691517061804,"acs":6988,"articleLive":0,"columnArticles":0,"formTitle":"[1210]Minimum Moves to Reach Target with Rotations","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":14594,"title":"Minimum Moves to Reach Target with Rotations","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.7058975434972078,"acs":21868,"articleLive":0,"columnArticles":0,"formTitle":"[1211]Queries Quality and Percentage","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":30979,"title":"Queries Quality and Percentage","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5716682946377138,"acs":22825,"articleLive":0,"columnArticles":0,"formTitle":"[1212]Team Scores in Football Tournament","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":39927,"title":"Team Scores in Football Tournament","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.79905724433302,"acs":61195,"articleLive":1,"articleSlug":"intersection-of-three-sorted-arrays","columnArticles":1,"formTitle":"[1213]Intersection of Three Sorted Arrays","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":76584,"title":"Intersection of Three Sorted Arrays","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6710789766407119,"acs":30165,"articleLive":1,"articleSlug":"two-sum-bsts","columnArticles":1,"formTitle":"[1214]Two Sum BSTs","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":44950,"title":"Two Sum BSTs","titleSlug":"two-sum-bsts"},{"acceptance":0.4503726708074534,"acs":7251,"articleLive":0,"columnArticles":0,"formTitle":"[1215]Stepping Numbers","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":16100,"title":"Stepping Numbers","titleSlug":"stepping-numbers"},{"acceptance":0.5140741826711626,"acs":28052,"articleLive":1,"articleSlug":"valid-palindrome-iii","columnArticles":1,"formTitle":"[1216]Valid Palindrome III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":54568,"title":"Valid Palindrome III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.7276422438969747,"acs":90940,"articleLive":1,"articleSlug":"minimum-cost-to-move-chips-to-the-same-position","columnArticles":1,"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":124979,"title":"Minimum Cost to Move Chips to The Same Position","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.50357636148382,"acs":40834,"articleLive":0,"columnArticles":0,"formTitle":"[1218]Longest Arithmetic Subsequence of Given Difference","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":81088,"title":"Longest Arithmetic Subsequence of Given Difference","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6605599603136614,"acs":75899,"articleLive":0,"columnArticles":0,"formTitle":"[1219]Path with Maximum Gold","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":114901,"title":"Path with Maximum Gold","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5634966914281369,"acs":44452,"articleLive":1,"articleSlug":"count-vowels-permutation","columnArticles":1,"formTitle":"[1220]Count Vowels Permutation","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":78886,"title":"Count Vowels Permutation","titleSlug":"count-vowels-permutation"},{"acceptance":0.8475018659670233,"acs":187353,"articleLive":0,"columnArticles":0,"formTitle":"[1221]Split a String in Balanced Strings","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":221065,"title":"Split a String in Balanced Strings","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.707321594068582,"acs":30528,"articleLive":0,"columnArticles":0,"formTitle":"[1222]Queens That Can Attack the King","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":43160,"title":"Queens That Can Attack the King","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47680054613721695,"acs":20953,"articleLive":0,"columnArticles":0,"formTitle":"[1223]Dice Roll Simulation","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":43945,"title":"Dice Roll Simulation","titleSlug":"dice-roll-simulation"},{"acceptance":0.36553524804177545,"acs":10220,"articleLive":0,"columnArticles":0,"formTitle":"[1224]Maximum Equal Frequency","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":27959,"title":"Maximum Equal Frequency","titleSlug":"maximum-equal-frequency"},{"acceptance":0.636035761454841,"acs":12521,"articleLive":0,"columnArticles":0,"formTitle":"[1225]Report Contiguous Dates","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":19686,"title":"Report Contiguous Dates","titleSlug":"report-contiguous-dates"},{"acceptance":0.5901144040465763,"acs":17383,"articleLive":0,"columnArticles":0,"formTitle":"[1226]The Dining Philosophers","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":29457,"title":"The Dining Philosophers","titleSlug":"the-dining-philosophers"},{"acceptance":0.6373253763732538,"acs":23495,"articleLive":0,"columnArticles":0,"formTitle":"[1227]Airplane Seat Assignment Probability","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":36865,"title":"Airplane Seat Assignment Probability","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5117334167709637,"acs":19626,"articleLive":1,"articleSlug":"missing-number-in-arithmetic-progression","columnArticles":1,"formTitle":"[1228]Missing Number In Arithmetic Progression","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":38352,"title":"Missing Number In Arithmetic Progression","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.546117692579063,"acs":47989,"articleLive":1,"articleSlug":"meeting-scheduler","columnArticles":1,"formTitle":"[1229]Meeting Scheduler","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":87873,"title":"Meeting Scheduler","titleSlug":"meeting-scheduler"},{"acceptance":0.524784358826912,"acs":9126,"articleLive":0,"columnArticles":0,"formTitle":"[1230]Toss Strange Coins","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":17390,"title":"Toss Strange Coins","titleSlug":"toss-strange-coins"},{"acceptance":0.5598779557589626,"acs":33764,"articleLive":1,"articleSlug":"divide-chocolate","columnArticles":1,"formTitle":"[1231]Divide Chocolate","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":60306,"title":"Divide Chocolate","titleSlug":"divide-chocolate"},{"acceptance":0.4217328493261687,"acs":103050,"articleLive":0,"columnArticles":0,"formTitle":"[1232]Check If It Is a Straight Line","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":244349,"title":"Check If It Is a Straight Line","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.6483127545413407,"acs":40115,"articleLive":0,"columnArticles":0,"formTitle":"[1233]Remove Sub-Folders from the Filesystem","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":61876,"title":"Remove Sub-Folders from the Filesystem","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3590140489610499,"acs":21338,"articleLive":0,"columnArticles":0,"formTitle":"[1234]Replace the Substring for Balanced String","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":59435,"title":"Replace the Substring for Balanced String","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.5075790231706637,"acs":100089,"articleLive":1,"articleSlug":"maximum-profit-in-job-scheduling","columnArticles":1,"formTitle":"[1235]Maximum Profit in Job Scheduling","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":197189,"title":"Maximum Profit in Job Scheduling","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.654554005329989,"acs":20877,"articleLive":0,"columnArticles":0,"formTitle":"[1236]Web Crawler","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":31895,"title":"Web Crawler","titleSlug":"web-crawler"},{"acceptance":0.694934650364392,"acs":46152,"articleLive":0,"columnArticles":0,"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":66412,"title":"Find Positive Integer Solution for a Given Equation","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.681662331520454,"acs":11531,"articleLive":0,"columnArticles":0,"formTitle":"[1238]Circular Permutation in Binary Representation","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":16916,"title":"Circular Permutation in Binary Representation","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.5065240490902589,"acs":100582,"articleLive":1,"articleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","columnArticles":1,"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":198573,"title":"Maximum Length of a Concatenated String with Unique Characters","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.5265111539721241,"acs":14468,"articleLive":0,"columnArticles":0,"formTitle":"[1240]Tiling a Rectangle with the Fewest Squares","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":27479,"title":"Tiling a Rectangle with the Fewest Squares","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.6777970388473671,"acs":23851,"articleLive":0,"columnArticles":0,"formTitle":"[1241]Number of Comments per Post","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":35189,"title":"Number of Comments per Post","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4844232939214051,"acs":29622,"articleLive":0,"columnArticles":0,"formTitle":"[1242]Web Crawler Multithreaded","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":61149,"title":"Web Crawler Multithreaded","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5019394879751745,"acs":9705,"articleLive":0,"columnArticles":0,"formTitle":"[1243]Array Transformation","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":19335,"title":"Array Transformation","titleSlug":"array-transformation"},{"acceptance":0.6789472679004565,"acs":35549,"articleLive":1,"articleSlug":"design-a-leaderboard","columnArticles":1,"formTitle":"[1244]Design A Leaderboard","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":52359,"title":"Design A Leaderboard","titleSlug":"design-a-leaderboard"},{"acceptance":0.6240639173083008,"acs":23667,"articleLive":1,"articleSlug":"tree-diameter","columnArticles":1,"formTitle":"[1245]Tree Diameter","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":37924,"title":"Tree Diameter","titleSlug":"tree-diameter"},{"acceptance":0.4603765323992995,"acs":8412,"articleLive":0,"columnArticles":0,"formTitle":"[1246]Palindrome Removal","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":18272,"title":"Palindrome Removal","titleSlug":"palindrome-removal"},{"acceptance":0.6365669827376611,"acs":26182,"articleLive":0,"columnArticles":0,"formTitle":"[1247]Minimum Swaps to Make Strings Equal","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":41130,"title":"Minimum Swaps to Make Strings Equal","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5812583275269843,"acs":47551,"articleLive":0,"columnArticles":0,"formTitle":"[1248]Count Number of Nice Subarrays","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":81807,"title":"Count Number of Nice Subarrays","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.6520505190665058,"acs":331762,"articleLive":1,"articleSlug":"minimum-remove-to-make-valid-parentheses","columnArticles":1,"formTitle":"[1249]Minimum Remove to Make Valid Parentheses","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"","submitted":508798,"title":"Minimum Remove to Make Valid Parentheses","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5754527162977867,"acs":12298,"articleLive":0,"columnArticles":0,"formTitle":"[1250]Check If It Is a Good Array","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":21371,"title":"Check If It Is a Good Array","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.8320089872862779,"acs":30365,"articleLive":0,"columnArticles":0,"formTitle":"[1251]Average Selling Price","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":36496,"title":"Average Selling Price","titleSlug":"average-selling-price"},{"acceptance":0.7852426577796292,"acs":75399,"articleLive":0,"columnArticles":0,"formTitle":"[1252]Cells with Odd Values in a Matrix","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":96020,"title":"Cells with Odd Values in a Matrix","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.43014464168310323,"acs":18319,"articleLive":0,"columnArticles":0,"formTitle":"[1253]Reconstruct a 2-Row Binary Matrix","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":42588,"title":"Reconstruct a 2-Row Binary Matrix","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6299940973843484,"acs":71510,"articleLive":0,"columnArticles":0,"formTitle":"[1254]Number of Closed Islands","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"","submitted":113509,"title":"Number of Closed Islands","titleSlug":"number-of-closed-islands"},{"acceptance":0.7182609979332742,"acs":19462,"articleLive":0,"columnArticles":0,"formTitle":"[1255]Maximum Score Words Formed by Letters","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":27096,"title":"Maximum Score Words Formed by Letters","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6916800735463112,"acs":6019,"articleLive":0,"columnArticles":0,"formTitle":"[1256]Encode Number","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":8702,"title":"Encode Number","titleSlug":"encode-number"},{"acceptance":0.625055995221741,"acs":12558,"articleLive":0,"columnArticles":0,"formTitle":"[1257]Smallest Common Region","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":20091,"title":"Smallest Common Region","titleSlug":"smallest-common-region"},{"acceptance":0.5660359235424071,"acs":11786,"articleLive":0,"columnArticles":0,"formTitle":"[1258]Synonymous Sentences","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":20822,"title":"Synonymous Sentences","titleSlug":"synonymous-sentences"},{"acceptance":0.5523399014778325,"acs":4485,"articleLive":0,"columnArticles":0,"formTitle":"[1259]Handshakes That Don't Cross","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":8120,"title":"Handshakes That Don't Cross","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6252746405581467,"acs":32443,"articleLive":1,"articleSlug":"shift-2d-grid","columnArticles":1,"formTitle":"[1260]Shift 2D Grid","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":51886,"title":"Shift 2D Grid","titleSlug":"shift-2d-grid"},{"acceptance":0.7557215217953932,"acs":40880,"articleLive":0,"columnArticles":0,"formTitle":"[1261]Find Elements in a Contaminated Binary Tree","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":54094,"title":"Find Elements in a Contaminated Binary Tree","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5075031588511719,"acs":35747,"articleLive":0,"columnArticles":0,"formTitle":"[1262]Greatest Sum Divisible by Three","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":70437,"title":"Greatest Sum Divisible by Three","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4812579727210284,"acs":19618,"articleLive":0,"columnArticles":0,"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":40764,"title":"Minimum Moves to Move a Box to Their Target Location","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.6787203522700738,"acs":20346,"articleLive":0,"columnArticles":0,"formTitle":"[1264]Page Recommendations","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":29977,"title":"Page Recommendations","titleSlug":"page-recommendations"},{"acceptance":0.942356794676708,"acs":36538,"articleLive":0,"columnArticles":0,"formTitle":"[1265]Print Immutable Linked List in Reverse","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":38773,"title":"Print Immutable Linked List in Reverse","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.7910151025513118,"acs":109414,"articleLive":0,"columnArticles":0,"formTitle":"[1266]Minimum Time Visiting All Points","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":138321,"title":"Minimum Time Visiting All Points","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.5803800251732557,"acs":38272,"articleLive":0,"columnArticles":0,"formTitle":"[1267]Count Servers that Communicate","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":65943,"title":"Count Servers that Communicate","titleSlug":"count-servers-that-communicate"},{"acceptance":0.6561830232293384,"acs":132568,"articleLive":1,"articleSlug":"search-suggestions-system","columnArticles":1,"formTitle":"[1268]Search Suggestions System","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":202029,"title":"Search Suggestions System","titleSlug":"search-suggestions-system"},{"acceptance":0.43427050407586093,"acs":26104,"articleLive":0,"columnArticles":0,"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":60110,"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.8815723207091055,"acs":35009,"articleLive":0,"columnArticles":0,"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":39712,"title":"All People Report to the Given Manager","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5633551457465794,"acs":7576,"articleLive":0,"columnArticles":0,"formTitle":"[1271]Hexspeak","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":13448,"title":"Hexspeak","titleSlug":"hexspeak"},{"acceptance":0.6049188357122866,"acs":17291,"articleLive":1,"articleSlug":"remove-interval","columnArticles":1,"formTitle":"[1272]Remove Interval","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":28584,"title":"Remove Interval","titleSlug":"remove-interval"},{"acceptance":0.6119402985074627,"acs":8036,"articleLive":0,"columnArticles":0,"formTitle":"[1273]Delete Tree Nodes","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":13132,"title":"Delete Tree Nodes","titleSlug":"delete-tree-nodes"},{"acceptance":0.663392594047736,"acs":13508,"articleLive":1,"articleSlug":"number-of-ships-in-a-rectangle","columnArticles":1,"formTitle":"[1274]Number of Ships in a Rectangle","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":20362,"title":"Number of Ships in a Rectangle","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5529348817626834,"acs":63039,"articleLive":1,"articleSlug":"find-winner-on-a-tic-tac-toe-game","columnArticles":1,"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":114008,"title":"Find Winner on a Tic Tac Toe Game","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5069187235177338,"acs":17108,"articleLive":0,"columnArticles":0,"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":33749,"title":"Number of Burgers with No Waste of Ingredients","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7409785255700686,"acs":150615,"articleLive":0,"columnArticles":0,"formTitle":"[1277]Count Square Submatrices with All Ones","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":203265,"title":"Count Square Submatrices with All Ones","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6089438967302646,"acs":17171,"articleLive":0,"columnArticles":0,"formTitle":"[1278]Palindrome Partitioning III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":28198,"title":"Palindrome Partitioning III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.7596492900028591,"acs":7971,"articleLive":0,"columnArticles":0,"formTitle":"[1279]Traffic Light Controlled Intersection","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":10493,"title":"Traffic Light Controlled Intersection","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.7462368595676317,"acs":21367,"articleLive":0,"columnArticles":0,"formTitle":"[1280]Students and Examinations","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":28633,"title":"Students and Examinations","titleSlug":"students-and-examinations"},{"acceptance":0.8589854097938958,"acs":190340,"articleLive":0,"columnArticles":0,"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":221587,"title":"Subtract the Product and Sum of Digits of an Integer","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8514296158371506,"acs":74535,"articleLive":0,"columnArticles":0,"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":87541,"title":"Group the People Given the Group Size They Belong To","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.5309953700446108,"acs":75464,"articleLive":0,"columnArticles":0,"formTitle":"[1283]Find the Smallest Divisor Given a Threshold","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":142118,"title":"Find the Smallest Divisor Given a Threshold","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.7118772018117765,"acs":16974,"articleLive":0,"columnArticles":0,"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":23844,"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.8835736735071178,"acs":19117,"articleLive":0,"columnArticles":0,"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":21636,"title":"Find the Start and End Number of Continuous Ranges","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.7313436442725955,"acs":60526,"articleLive":1,"articleSlug":"iterator-for-combination","columnArticles":1,"formTitle":"[1286]Iterator for Combination","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":82760,"title":"Iterator for Combination","titleSlug":"iterator-for-combination"},{"acceptance":0.5954631765930947,"acs":58328,"articleLive":0,"columnArticles":0,"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":97954,"title":"Element Appearing More Than 25% In Sorted Array","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5785010116664514,"acs":53752,"articleLive":1,"articleSlug":"remove-covered-intervals","columnArticles":1,"formTitle":"[1288]Remove Covered Intervals","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":92916,"title":"Remove Covered Intervals","titleSlug":"remove-covered-intervals"},{"acceptance":0.6179539691827579,"acs":25346,"articleLive":0,"columnArticles":0,"formTitle":"[1289]Minimum Falling Path Sum II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":41016,"title":"Minimum Falling Path Sum II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8269637057358181,"acs":262255,"articleLive":1,"articleSlug":"convert-binary-number-in-a-linked-list-to-integer","columnArticles":1,"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":317130,"title":"Convert Binary Number in a Linked List to Integer","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.6079471184870195,"acs":73485,"articleLive":1,"articleSlug":"sequential-digits","columnArticles":1,"formTitle":"[1291]Sequential Digits","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":120874,"title":"Sequential Digits","titleSlug":"sequential-digits"},{"acceptance":0.5223963261255856,"acs":22637,"articleLive":0,"columnArticles":0,"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":43333,"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.4377961810072477,"acs":75385,"articleLive":1,"articleSlug":"shortest-path-in-a-grid-with-obstacles-elimination","columnArticles":1,"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":172192,"title":"Shortest Path in a Grid with Obstacles Elimination","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6748397435897436,"acs":21055,"articleLive":0,"columnArticles":0,"formTitle":"[1294]Weather Type in Each Country","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":31200,"title":"Weather Type in Each Country","titleSlug":"weather-type-in-each-country"},{"acceptance":0.7726290832973962,"acs":392365,"articleLive":0,"columnArticles":0,"formTitle":"[1295]Find Numbers with Even Number of Digits","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":507831,"title":"Find Numbers with Even Number of Digits","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.5633767282268645,"acs":55825,"articleLive":0,"columnArticles":0,"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":99090,"title":"Divide Array in Sets of K Consecutive Numbers","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.5241583273152447,"acs":30484,"articleLive":0,"columnArticles":0,"formTitle":"[1297]Maximum Number of Occurrences of a Substring","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":58158,"title":"Maximum Number of Occurrences of a Substring","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.6078763896740155,"acs":9678,"articleLive":0,"columnArticles":0,"formTitle":"[1298]Maximum Candies You Can Get from Boxes","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":15921,"title":"Maximum Candies You Can Get from Boxes","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7436259667697094,"acs":187393,"articleLive":0,"columnArticles":0,"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":251999,"title":"Replace Elements with Greatest Element on Right Side","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.42485955056179775,"acs":22990,"articleLive":0,"columnArticles":0,"formTitle":"[1300]Sum of Mutated Array Closest to Target","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":54112,"title":"Sum of Mutated Array Closest to Target","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3874722345624167,"acs":8722,"articleLive":0,"columnArticles":0,"formTitle":"[1301]Number of Paths with Max Score","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":22510,"title":"Number of Paths with Max Score","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8563496770792145,"acs":155931,"articleLive":1,"articleSlug":"deepest-leaves-sum","columnArticles":1,"formTitle":"[1302]Deepest Leaves Sum","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":182088,"title":"Deepest Leaves Sum","titleSlug":"deepest-leaves-sum"},{"acceptance":0.9056314710024957,"acs":36650,"articleLive":0,"columnArticles":0,"formTitle":"[1303]Find the Team Size","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":40469,"title":"Find the Team Size","titleSlug":"find-the-team-size"},{"acceptance":0.7685890302808014,"acs":123636,"articleLive":0,"columnArticles":0,"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":160861,"title":"Find N Unique Integers Sum up to Zero","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7961338691983342,"acs":153126,"articleLive":1,"articleSlug":"all-elements-in-two-binary-search-trees","columnArticles":1,"formTitle":"[1305]All Elements in Two Binary Search Trees","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":192337,"title":"All Elements in Two Binary Search Trees","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.6256187853973779,"acs":131562,"articleLive":1,"articleSlug":"jump-game-iii","columnArticles":1,"formTitle":"[1306]Jump Game III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":210291,"title":"Jump Game III","titleSlug":"jump-game-iii"},{"acceptance":0.3526338238430369,"acs":6614,"articleLive":0,"columnArticles":0,"formTitle":"[1307]Verbal Arithmetic Puzzle","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":18756,"title":"Verbal Arithmetic Puzzle","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.884625041848008,"acs":21139,"articleLive":0,"columnArticles":0,"formTitle":"[1308]Running Total for Different Genders","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":23896,"title":"Running Total for Different Genders","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7807380553370499,"acs":68484,"articleLive":0,"columnArticles":0,"formTitle":"[1309]Decrypt String from Alphabet to Integer Mapping","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":87717,"title":"Decrypt String from Alphabet to Integer Mapping","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7103393347446082,"acs":33891,"articleLive":0,"columnArticles":0,"formTitle":"[1310]XOR Queries of a Subarray","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"","submitted":47711,"title":"XOR Queries of a Subarray","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.44979307340448704,"acs":14455,"articleLive":0,"columnArticles":0,"formTitle":"[1311]Get Watched Videos by Your Friends","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":32137,"title":"Get Watched Videos by Your Friends","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6275236470770662,"acs":40469,"articleLive":0,"columnArticles":0,"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":64490,"title":"Minimum Insertion Steps to Make a String Palindrome","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8579674627969033,"acs":169446,"articleLive":0,"columnArticles":0,"formTitle":"[1313]Decompress Run-Length Encoded List","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":197497,"title":"Decompress Run-Length Encoded List","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7493794815223387,"acs":54345,"articleLive":0,"columnArticles":0,"formTitle":"[1314]Matrix Block Sum","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":72520,"title":"Matrix Block Sum","titleSlug":"matrix-block-sum"},{"acceptance":0.8503221892321693,"acs":92504,"articleLive":0,"columnArticles":0,"formTitle":"[1315]Sum of Nodes with Even-Valued Grandparent","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":108787,"title":"Sum of Nodes with Even-Valued Grandparent","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.5024037360926698,"acs":10973,"articleLive":0,"columnArticles":0,"formTitle":"[1316]Distinct Echo Substrings","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":21841,"title":"Distinct Echo Substrings","titleSlug":"distinct-echo-substrings"},{"acceptance":0.5727393993289948,"acs":28338,"articleLive":0,"columnArticles":0,"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":49478,"title":"Convert Integer to the Sum of Two No-Zero Integers","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6489656766439386,"acs":22462,"articleLive":0,"columnArticles":0,"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":34612,"title":"Minimum Flips to Make a OR b Equal to c","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.5710729535749978,"acs":62858,"articleLive":0,"columnArticles":0,"formTitle":"[1319]Number of Operations to Make Network Connected","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":110070,"title":"Number of Operations to Make Network Connected","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.605702234442991,"acs":22689,"articleLive":0,"columnArticles":0,"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":37459,"title":"Minimum Distance to Type a Word Using Two Fingers","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.7246706398996235,"acs":18482,"articleLive":0,"columnArticles":0,"formTitle":"[1321]Restaurant Growth","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":25504,"title":"Restaurant Growth","titleSlug":"restaurant-growth"},{"acceptance":0.5966788892262419,"acs":25548,"articleLive":0,"columnArticles":0,"formTitle":"[1322]Ads Performance","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":42817,"title":"Ads Performance","titleSlug":"ads-performance"},{"acceptance":0.7870212749715647,"acs":103099,"articleLive":0,"columnArticles":0,"formTitle":"[1323]Maximum 69 Number","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":130999,"title":"Maximum 69 Number","titleSlug":"maximum-69-number"},{"acceptance":0.593805564899803,"acs":24713,"articleLive":0,"columnArticles":0,"formTitle":"[1324]Print Words Vertically","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":41618,"title":"Print Words Vertically","titleSlug":"print-words-vertically"},{"acceptance":0.7481470519318757,"acs":60665,"articleLive":0,"columnArticles":0,"formTitle":"[1325]Delete Leaves With a Given Value","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":81087,"title":"Delete Leaves With a Given Value","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.48274331158553063,"acs":50018,"articleLive":0,"columnArticles":0,"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":103612,"title":"Minimum Number of Taps to Open to Water a Garden","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.7751034566699123,"acs":25473,"articleLive":0,"columnArticles":0,"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":32864,"title":"List the Products Ordered in a Period","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.5242923018323568,"acs":64694,"articleLive":1,"articleSlug":"break-a-palindrome","columnArticles":1,"formTitle":"[1328]Break a Palindrome","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":123393,"title":"Break a Palindrome","titleSlug":"break-a-palindrome"},{"acceptance":0.8138218462304055,"acs":78498,"articleLive":1,"articleSlug":"sort-the-matrix-diagonally","columnArticles":1,"formTitle":"[1329]Sort the Matrix Diagonally","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":96456,"title":"Sort the Matrix Diagonally","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3874307225765973,"acs":3705,"articleLive":0,"columnArticles":0,"formTitle":"[1330]Reverse Subarray To Maximize Array Value","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":9563,"title":"Reverse Subarray To Maximize Array Value","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5833500815077823,"acs":52246,"articleLive":0,"columnArticles":0,"formTitle":"[1331]Rank Transform of an Array","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":89562,"title":"Rank Transform of an Array","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6936798912898671,"acs":52069,"articleLive":1,"articleSlug":"remove-palindromic-subsequences","columnArticles":1,"formTitle":"[1332]Remove Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"","submitted":75062,"title":"Remove Palindromic Subsequences","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5857407823741008,"acs":20843,"articleLive":0,"columnArticles":0,"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":35584,"title":"Filter Restaurants by Vegan-Friendly, Price and Distance","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.506660337188561,"acs":35221,"articleLive":0,"columnArticles":0,"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":69516,"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.5685273115429917,"acs":61783,"articleLive":0,"columnArticles":0,"formTitle":"[1335]Minimum Difficulty of a Job Schedule","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":108672,"title":"Minimum Difficulty of a Job Schedule","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.5112292774476072,"acs":8172,"articleLive":0,"columnArticles":0,"formTitle":"[1336]Number of Transactions per Visit","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":15985,"title":"Number of Transactions per Visit","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.721473482190172,"acs":100748,"articleLive":1,"articleSlug":"the-k-weakest-rows-in-a-matrix","columnArticles":1,"formTitle":"[1337]The K Weakest Rows in a Matrix","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"","submitted":139642,"title":"The K Weakest Rows in a Matrix","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6847065089469028,"acs":79706,"articleLive":1,"articleSlug":"reduce-array-size-to-the-half","columnArticles":1,"formTitle":"[1338]Reduce Array Size to The Half","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"","submitted":116409,"title":"Reduce Array Size to The Half","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.42698934862106963,"acs":53477,"articleLive":1,"articleSlug":"maximum-product-of-splitted-binary-tree","columnArticles":1,"formTitle":"[1339]Maximum Product of Splitted Binary Tree","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":125242,"title":"Maximum Product of Splitted Binary Tree","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.6181592039800995,"acs":17395,"articleLive":0,"columnArticles":0,"formTitle":"[1340]Jump Game V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":28140,"title":"Jump Game V","titleSlug":"jump-game-v"},{"acceptance":0.5810797089185987,"acs":17168,"articleLive":0,"columnArticles":0,"formTitle":"[1341]Movie Rating","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":29545,"title":"Movie Rating","titleSlug":"movie-rating"},{"acceptance":0.8566547206221616,"acs":236166,"articleLive":1,"articleSlug":"number-of-steps-to-reduce-a-number-to-zero","columnArticles":1,"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":275684,"title":"Number of Steps to Reduce a Number to Zero","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.6793668019250731,"acs":28797,"articleLive":0,"columnArticles":0,"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":42388,"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.6278071894920434,"acs":81350,"articleLive":1,"articleSlug":"angle-between-hands-of-a-clock","columnArticles":1,"formTitle":"[1344]Angle Between Hands of a Clock","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":129578,"title":"Angle Between Hands of a Clock","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.4436195295114973,"acs":66983,"articleLive":1,"articleSlug":"jump-game-iv","columnArticles":1,"formTitle":"[1345]Jump Game IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":150992,"title":"Jump Game IV","titleSlug":"jump-game-iv"},{"acceptance":0.3548933231134658,"acs":168536,"articleLive":0,"columnArticles":0,"formTitle":"[1346]Check If N and Its Double Exist","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":474892,"title":"Check If N and Its Double Exist","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7584185321728555,"acs":79819,"articleLive":0,"columnArticles":0,"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":105244,"title":"Minimum Number of Steps to Make Two Strings Anagram","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.42415434302226757,"acs":24953,"articleLive":0,"columnArticles":0,"formTitle":"[1348]Tweet Counts Per Frequency","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":58830,"title":"Tweet Counts Per Frequency","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.4643138025953598,"acs":9446,"articleLive":0,"columnArticles":0,"formTitle":"[1349]Maximum Students Taking Exam","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":20344,"title":"Maximum Students Taking Exam","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.9046627500557746,"acs":36495,"articleLive":0,"columnArticles":0,"formTitle":"[1350]Students With Invalid Departments","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":40341,"title":"Students With Invalid Departments","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7522320775152952,"acs":154182,"articleLive":0,"columnArticles":0,"formTitle":"[1351]Count Negative Numbers in a Sorted Matrix","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":204966,"title":"Count Negative Numbers in a Sorted Matrix","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.47451846558612404,"acs":43827,"articleLive":0,"columnArticles":0,"formTitle":"[1352]Product of the Last K Numbers","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":92361,"title":"Product of the Last K Numbers","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.3323209794523798,"acs":49021,"articleLive":0,"columnArticles":0,"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":147511,"title":"Maximum Number of Events That Can Be Attended","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.31180892854901665,"acs":24844,"articleLive":1,"articleSlug":"construct-target-array-with-multiple-sums","columnArticles":1,"formTitle":"[1354]Construct Target Array With Multiple Sums","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":79677,"title":"Construct Target Array With Multiple Sums","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.7449835397397712,"acs":19009,"articleLive":0,"columnArticles":0,"formTitle":"[1355]Activity Participants","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":25516,"title":"Activity Participants","titleSlug":"activity-participants"},{"acceptance":0.7085301300407849,"acs":57155,"articleLive":0,"columnArticles":0,"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":80667,"title":"Sort Integers by The Number of 1 Bits","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.6847435641588505,"acs":13725,"articleLive":0,"columnArticles":0,"formTitle":"[1357]Apply Discount Every n Orders","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":20044,"title":"Apply Discount Every n Orders","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.6199932302831999,"acs":32970,"articleLive":0,"columnArticles":0,"formTitle":"[1358]Number of Substrings Containing All Three Characters","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":53178,"title":"Number of Substrings Containing All Three Characters","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5455296355626752,"acs":21795,"articleLive":1,"articleSlug":"count-all-valid-pickup-and-delivery-options","columnArticles":1,"formTitle":"[1359]Count All Valid Pickup and Delivery Options","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":39952,"title":"Count All Valid Pickup and Delivery Options","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.46644388749651905,"acs":26800,"articleLive":0,"columnArticles":0,"formTitle":"[1360]Number of Days Between Two Dates","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":57456,"title":"Number of Days Between Two Dates","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.41759075822677333,"acs":32461,"articleLive":0,"columnArticles":0,"formTitle":"[1361]Validate Binary Tree Nodes","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":77734,"title":"Validate Binary Tree Nodes","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5903901046622264,"acs":14892,"articleLive":0,"columnArticles":0,"formTitle":"[1362]Closest Divisors","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":25224,"title":"Closest Divisors","titleSlug":"closest-divisors"},{"acceptance":0.3450129773822766,"acs":13027,"articleLive":0,"columnArticles":0,"formTitle":"[1363]Largest Multiple of Three","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":37758,"title":"Largest Multiple of Three","titleSlug":"largest-multiple-of-three"},{"acceptance":0.7887277082778813,"acs":11853,"articleLive":0,"columnArticles":0,"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":15028,"title":"Number of Trusted Contacts of a Customer","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8618205090517136,"acs":281443,"articleLive":0,"columnArticles":0,"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":326568,"title":"How Many Numbers Are Smaller Than the Current Number","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5860767494356659,"acs":32454,"articleLive":0,"columnArticles":0,"formTitle":"[1366]Rank Teams by Votes","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":55375,"title":"Rank Teams by Votes","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4235142737446885,"acs":42459,"articleLive":0,"columnArticles":0,"formTitle":"[1367]Linked List in Binary Tree","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"","submitted":100254,"title":"Linked List in Binary Tree","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.6034631288766368,"acs":28020,"articleLive":0,"columnArticles":0,"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":46432,"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.6903123044541782,"acs":12135,"articleLive":0,"columnArticles":0,"formTitle":"[1369]Get the Second Most Recent Activity","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":17579,"title":"Get the Second Most Recent Activity","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7772888122674894,"acs":51399,"articleLive":0,"columnArticles":0,"formTitle":"[1370]Increasing Decreasing String","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":66126,"title":"Increasing Decreasing String","titleSlug":"increasing-decreasing-string"},{"acceptance":0.6229308491580079,"acs":17386,"articleLive":0,"columnArticles":0,"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":27910,"title":"Find the Longest Substring Containing Vowels in Even Counts","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5726152964766542,"acs":29985,"articleLive":0,"columnArticles":0,"formTitle":"[1372]Longest ZigZag Path in a Binary Tree","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":52365,"title":"Longest ZigZag Path in a Binary Tree","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.38576964300436967,"acs":28074,"articleLive":0,"columnArticles":0,"formTitle":"[1373]Maximum Sum BST in Binary Tree","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":72774,"title":"Maximum Sum BST in Binary Tree","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7729056538371071,"acs":62433,"articleLive":0,"columnArticles":0,"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":80777,"title":"Generate a String With Characters That Have Odd Counts","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.654099457631894,"acs":37145,"articleLive":0,"columnArticles":0,"formTitle":"[1375]Number of Times Binary String Is Prefix-Aligned","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":56788,"title":"Number of Times Binary String Is Prefix-Aligned","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5791902092930027,"acs":76573,"articleLive":0,"columnArticles":0,"formTitle":"[1376]Time Needed to Inform All Employees","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":132207,"title":"Time Needed to Inform All Employees","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3618981297254278,"acs":18189,"articleLive":0,"columnArticles":0,"formTitle":"[1377]Frog Position After T Seconds","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":50260,"title":"Frog Position After T Seconds","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.9098048797514747,"acs":26065,"articleLive":0,"columnArticles":0,"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":28649,"title":"Replace Employee ID With The Unique Identifier","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8533654266958425,"acs":97497,"articleLive":1,"articleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree","columnArticles":1,"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":114250,"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.7092903380484297,"acs":59169,"articleLive":0,"columnArticles":0,"formTitle":"[1380]Lucky Numbers in a Matrix","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":83420,"title":"Lucky Numbers in a Matrix","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7712549088271342,"acs":61668,"articleLive":0,"columnArticles":0,"formTitle":"[1381]Design a Stack With Increment Operation","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"","submitted":79958,"title":"Design a Stack With Increment Operation","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7987582213112308,"acs":80276,"articleLive":0,"columnArticles":0,"formTitle":"[1382]Balance a Binary Search Tree","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":100501,"title":"Balance a Binary Search Tree","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.414163992475379,"acs":37428,"articleLive":1,"articleSlug":"maximum-performance-of-a-team","columnArticles":1,"formTitle":"[1383]Maximum Performance of a Team","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":90370,"title":"Maximum Performance of a Team","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.6622092103180883,"acs":8369,"articleLive":0,"columnArticles":0,"formTitle":"[1384]Total Sales Amount by Year","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":12638,"title":"Total Sales Amount by Year","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6603776968740472,"acs":36822,"articleLive":0,"columnArticles":0,"formTitle":"[1385]Find the Distance Value Between Two Arrays","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":55759,"title":"Find the Distance Value Between Two Arrays","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.38714812501259394,"acs":19213,"articleLive":0,"columnArticles":0,"formTitle":"[1386]Cinema Seat Allocation","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":49627,"title":"Cinema Seat Allocation","titleSlug":"cinema-seat-allocation"},{"acceptance":0.7017074616507872,"acs":48535,"articleLive":0,"columnArticles":0,"formTitle":"[1387]Sort Integers by The Power Value","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":69167,"title":"Sort Integers by The Power Value","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.4822872545244513,"acs":7515,"articleLive":0,"columnArticles":0,"formTitle":"[1388]Pizza With 3n Slices","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":15582,"title":"Pizza With 3n Slices","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8549297512877306,"acs":131619,"articleLive":0,"columnArticles":0,"formTitle":"[1389]Create Target Array in the Given Order","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":153953,"title":"Create Target Array in the Given Order","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.4051586880373633,"acs":19085,"articleLive":0,"columnArticles":0,"formTitle":"[1390]Four Divisors","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":47105,"title":"Four Divisors","titleSlug":"four-divisors"},{"acceptance":0.464244589100651,"acs":19755,"articleLive":0,"columnArticles":0,"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":42553,"title":"Check if There is a Valid Path in a Grid","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.44175234260790375,"acs":18433,"articleLive":0,"columnArticles":0,"formTitle":"[1392]Longest Happy Prefix","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":41727,"title":"Longest Happy Prefix","titleSlug":"longest-happy-prefix"},{"acceptance":0.9141450313339302,"acs":20422,"articleLive":0,"columnArticles":0,"formTitle":"[1393]Capital Gain/Loss","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":22340,"title":"Capital Gain/Loss","titleSlug":"capital-gainloss"},{"acceptance":0.6347829515435871,"acs":64400,"articleLive":1,"articleSlug":"find-lucky-integer-in-an-array","columnArticles":1,"formTitle":"[1394]Find Lucky Integer in an Array","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":101452,"title":"Find Lucky Integer in an Array","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.6999388368667246,"acs":81251,"articleLive":0,"columnArticles":0,"formTitle":"[1395]Count Number of Teams","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":116083,"title":"Count Number of Teams","titleSlug":"count-number-of-teams"},{"acceptance":0.7178364591879005,"acs":88375,"articleLive":1,"articleSlug":"design-underground-system","columnArticles":1,"formTitle":"[1396]Design Underground System","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":123113,"title":"Design Underground System","titleSlug":"design-underground-system"},{"acceptance":0.40164835164835166,"acs":3655,"articleLive":0,"columnArticles":0,"formTitle":"[1397]Find All Good Strings","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":9100,"title":"Find All Good Strings","titleSlug":"find-all-good-strings"},{"acceptance":0.7952231301068511,"acs":25304,"articleLive":0,"columnArticles":0,"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":31820,"title":"Customers Who Bought Products A and B but Not C","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.665027121448929,"acs":28934,"articleLive":0,"columnArticles":0,"formTitle":"[1399]Count Largest Group","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":43508,"title":"Count Largest Group","titleSlug":"count-largest-group"},{"acceptance":0.6394122153900555,"acs":32548,"articleLive":0,"columnArticles":0,"formTitle":"[1400]Construct K Palindrome Strings","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":50903,"title":"Construct K Palindrome Strings","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4354557861546426,"acs":9253,"articleLive":0,"columnArticles":0,"formTitle":"[1401]Circle and Rectangle Overlapping","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":21249,"title":"Circle and Rectangle Overlapping","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7254433982920955,"acs":33131,"articleLive":0,"columnArticles":0,"formTitle":"[1402]Reducing Dishes","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":45670,"title":"Reducing Dishes","titleSlug":"reducing-dishes"},{"acceptance":0.7207139917381827,"acs":47281,"articleLive":0,"columnArticles":0,"formTitle":"[1403]Minimum Subsequence in Non-Increasing Order","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":65603,"title":"Minimum Subsequence in Non-Increasing Order","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.506327369605659,"acs":22046,"articleLive":0,"columnArticles":0,"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":43541,"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.5565139263252471,"acs":34067,"articleLive":0,"columnArticles":0,"formTitle":"[1405]Longest Happy String","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":61215,"title":"Longest Happy String","titleSlug":"longest-happy-string"},{"acceptance":0.6025166411561599,"acs":33853,"articleLive":0,"columnArticles":0,"formTitle":"[1406]Stone Game III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":56186,"title":"Stone Game III","titleSlug":"stone-game-iii"},{"acceptance":0.8360778443113772,"acs":22340,"articleLive":0,"columnArticles":0,"formTitle":"[1407]Top Travellers","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":26720,"title":"Top Travellers","titleSlug":"top-travellers"},{"acceptance":0.6385527198628265,"acs":51392,"articleLive":0,"columnArticles":0,"formTitle":"[1408]String Matching in an Array","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":80482,"title":"String Matching in an Array","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8265110808754007,"acs":35840,"articleLive":0,"columnArticles":0,"formTitle":"[1409]Queries on a Permutation With Key","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":43363,"title":"Queries on a Permutation With Key","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.528067847458605,"acs":18306,"articleLive":0,"columnArticles":0,"formTitle":"[1410]HTML Entity Parser","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"","submitted":34666,"title":"HTML Entity Parser","titleSlug":"html-entity-parser"},{"acceptance":0.6185830801215416,"acs":23208,"articleLive":0,"columnArticles":0,"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":37518,"title":"Number of Ways to Paint N × 3 Grid","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.6265255646109557,"acs":15452,"articleLive":0,"columnArticles":0,"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":24663,"title":"Find the Quiet Students in All Exams","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.686856878047753,"acs":65215,"articleLive":1,"articleSlug":"minimum-value-to-get-positive-step-by-step-sum","columnArticles":1,"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":94947,"title":"Minimum Value to Get Positive Step by Step Sum","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.651531765390382,"acs":29115,"articleLive":0,"columnArticles":0,"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":44687,"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.7109759715218036,"acs":23967,"articleLive":0,"columnArticles":0,"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":33710,"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.3783427308998582,"acs":11474,"articleLive":0,"columnArticles":0,"formTitle":"[1416]Restore The Array","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":30327,"title":"Restore The Array","titleSlug":"restore-the-array"},{"acceptance":0.5647473527901522,"acs":40694,"articleLive":0,"columnArticles":0,"formTitle":"[1417]Reformat The String","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":72057,"title":"Reformat The String","titleSlug":"reformat-the-string"},{"acceptance":0.7185038574948499,"acs":17788,"articleLive":0,"columnArticles":0,"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":24757,"title":"Display Table of Food Orders in a Restaurant","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.49570421654085167,"acs":23771,"articleLive":0,"columnArticles":0,"formTitle":"[1419]Minimum Number of Frogs Croaking","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":47954,"title":"Minimum Number of Frogs Croaking","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.6463241555492478,"acs":9108,"articleLive":0,"columnArticles":0,"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":14092,"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.8299710177871228,"acs":14605,"articleLive":0,"columnArticles":0,"formTitle":"[1421]NPV Queries","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"lock","submitted":17597,"title":"NPV Queries","titleSlug":"npv-queries"},{"acceptance":0.5772477640043935,"acs":36788,"articleLive":0,"columnArticles":0,"formTitle":"[1422]Maximum Score After Splitting a String","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":63730,"title":"Maximum Score After Splitting a String","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.49784108518903775,"acs":117259,"articleLive":1,"articleSlug":"maximum-points-you-can-obtain-from-cards","columnArticles":1,"formTitle":"[1423]Maximum Points You Can Obtain from Cards","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"","submitted":235535,"title":"Maximum Points You Can Obtain from Cards","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.4942074776197999,"acs":37540,"articleLive":0,"columnArticles":0,"formTitle":"[1424]Diagonal Traverse II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":75960,"title":"Diagonal Traverse II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4626210529203588,"acs":16863,"articleLive":0,"columnArticles":0,"formTitle":"[1425]Constrained Subsequence Sum","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":36451,"title":"Constrained Subsequence Sum","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.5945532721761541,"acs":89051,"articleLive":1,"articleSlug":"counting-elements","columnArticles":1,"formTitle":"[1426]Counting Elements","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":149778,"title":"Counting Elements","titleSlug":"counting-elements"},{"acceptance":0.5392789820923657,"acs":68661,"articleLive":1,"articleSlug":"perform-string-shifts","columnArticles":1,"formTitle":"[1427]Perform String Shifts","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":127320,"title":"Perform String Shifts","titleSlug":"perform-string-shifts"},{"acceptance":0.5221452894438139,"acs":138003,"articleLive":1,"articleSlug":"leftmost-column-with-at-least-a-one","columnArticles":1,"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":264300,"title":"Leftmost Column with at Least a One","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.520148269431937,"acs":68619,"articleLive":1,"articleSlug":"first-unique-number","columnArticles":1,"formTitle":"[1429]First Unique Number","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":131922,"title":"First Unique Number","titleSlug":"first-unique-number"},{"acceptance":0.4556025494515852,"acs":38672,"articleLive":0,"columnArticles":0,"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":84881,"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.8778859501716958,"acs":288375,"articleLive":0,"columnArticles":0,"formTitle":"[1431]Kids With the Greatest Number of Candies","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":328488,"title":"Kids With the Greatest Number of Candies","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.43499981633177826,"acs":11842,"articleLive":0,"columnArticles":0,"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":27223,"title":"Max Difference You Can Get From Changing an Integer","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6832453051643192,"acs":27942,"articleLive":0,"columnArticles":0,"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":40896,"title":"Check If a String Can Break Another String","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4145757469945628,"acs":8311,"articleLive":0,"columnArticles":0,"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":20047,"title":"Number of Ways to Wear Different Hats to Each Other","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.7819998901762671,"acs":14241,"articleLive":0,"columnArticles":0,"formTitle":"[1435]Create a Session Bar Chart","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":18211,"title":"Create a Session Bar Chart","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7764391009237429,"acs":92543,"articleLive":0,"columnArticles":0,"formTitle":"[1436]Destination City","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":119189,"title":"Destination City","titleSlug":"destination-city"},{"acceptance":0.6033174996483407,"acs":55758,"articleLive":1,"articleSlug":"check-if-all-1s-are-at-least-length-k-places-away","columnArticles":1,"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":92419,"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.45751922071870693,"acs":72660,"articleLive":0,"columnArticles":0,"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":158813,"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.6161237091451081,"acs":23149,"articleLive":0,"columnArticles":0,"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":37572,"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.7554785020804439,"acs":10894,"articleLive":0,"columnArticles":0,"formTitle":"[1440]Evaluate Boolean Expression","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":14420,"title":"Evaluate Boolean Expression","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.7081302799243934,"acs":55072,"articleLive":0,"columnArticles":0,"formTitle":"[1441]Build an Array With Stack Operations","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"","submitted":77771,"title":"Build an Array With Stack Operations","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7433288243974422,"acs":24179,"articleLive":0,"columnArticles":0,"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":32528,"title":"Count Triplets That Can Form Two Arrays of Equal XOR","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.5539620009027864,"acs":26999,"articleLive":0,"columnArticles":0,"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":48738,"title":"Minimum Time to Collect All Apples in a Tree","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5533773388257481,"acs":11150,"articleLive":0,"columnArticles":0,"formTitle":"[1444]Number of Ways of Cutting a Pizza","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":20149,"title":"Number of Ways of Cutting a Pizza","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.9151861082080553,"acs":22768,"articleLive":0,"columnArticles":0,"formTitle":"[1445]Apples & Oranges","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":24878,"title":"Apples & Oranges","titleSlug":"apples-oranges"},{"acceptance":0.6201080619467573,"acs":113277,"articleLive":1,"articleSlug":"consecutive-characters","columnArticles":1,"formTitle":"[1446]Consecutive Characters","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":182673,"title":"Consecutive Characters","titleSlug":"consecutive-characters"},{"acceptance":0.6342769701606733,"acs":19067,"articleLive":0,"columnArticles":0,"formTitle":"[1447]Simplified Fractions","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":30061,"title":"Simplified Fractions","titleSlug":"simplified-fractions"},{"acceptance":0.7301808483540851,"acs":146199,"articleLive":1,"articleSlug":"count-good-nodes-in-binary-tree","columnArticles":1,"formTitle":"[1448]Count Good Nodes in Binary Tree","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":200223,"title":"Count Good Nodes in Binary Tree","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.4618401568815784,"acs":11540,"articleLive":0,"columnArticles":0,"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":24987,"title":"Form Largest Integer With Digits That Add up to Target","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.7651918770751294,"acs":79280,"articleLive":0,"columnArticles":0,"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":103608,"title":"Number of Students Doing Homework at a Given Time","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.6156586091226615,"acs":35606,"articleLive":0,"columnArticles":0,"formTitle":"[1451]Rearrange Words in a Sentence","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":57834,"title":"Rearrange Words in a Sentence","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5628651257302515,"acs":17728,"articleLive":0,"columnArticles":0,"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":31496,"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.36335403726708076,"acs":4446,"articleLive":0,"columnArticles":0,"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":12236,"title":"Maximum Number of Darts Inside of a Circular Dartboard","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3854656406516858,"acs":20087,"articleLive":0,"columnArticles":0,"formTitle":"[1454]Active Users","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":52111,"title":"Active Users","titleSlug":"active-users"},{"acceptance":0.643687555486662,"acs":45678,"articleLive":0,"columnArticles":0,"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":70963,"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.5704241421603583,"acs":39997,"articleLive":0,"columnArticles":0,"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":70118,"title":"Maximum Number of Vowels in a Substring of Given Length","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6759638935520269,"acs":49125,"articleLive":1,"articleSlug":"pseudo-palindromic-paths-in-a-binary-tree","columnArticles":1,"formTitle":"[1457]Pseudo-Palindromic Paths in a Binary Tree","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":72674,"title":"Pseudo-Palindromic Paths in a Binary Tree","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44891021795640873,"acs":15715,"articleLive":0,"columnArticles":0,"formTitle":"[1458]Max Dot Product of Two Subsequences","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":35007,"title":"Max Dot Product of Two Subsequences","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.6810924369747899,"acs":8105,"articleLive":0,"columnArticles":0,"formTitle":"[1459]Rectangles Area","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":11900,"title":"Rectangles Area","titleSlug":"rectangles-area"},{"acceptance":0.7252970099913884,"acs":78327,"articleLive":0,"columnArticles":0,"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":107993,"title":"Make Two Arrays Equal by Reversing Sub-arrays","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5448693854538621,"acs":46388,"articleLive":1,"articleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","columnArticles":1,"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":85136,"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.4747673526566826,"acs":28468,"articleLive":0,"columnArticles":0,"formTitle":"[1462]Course Schedule IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":59962,"title":"Course Schedule IV","titleSlug":"course-schedule-iv"},{"acceptance":0.7083452600900362,"acs":54442,"articleLive":1,"articleSlug":"cherry-pickup-ii","columnArticles":1,"formTitle":"[1463]Cherry Pickup II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":76858,"title":"Cherry Pickup II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7809621425028931,"acs":118101,"articleLive":0,"columnArticles":0,"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":151225,"title":"Maximum Product of Two Elements in an Array","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3707325347185413,"acs":87428,"articleLive":1,"articleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","columnArticles":1,"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":235825,"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.6082776363250584,"acs":45869,"articleLive":0,"columnArticles":0,"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":75408,"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.6084885690093141,"acs":5749,"articleLive":0,"columnArticles":0,"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":9448,"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.8236293061620572,"acs":13580,"articleLive":0,"columnArticles":0,"formTitle":"[1468]Calculate Salaries","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":16488,"title":"Calculate Salaries","titleSlug":"calculate-salaries"},{"acceptance":0.8162748938948743,"acs":30003,"articleLive":0,"columnArticles":0,"formTitle":"[1469]Find All The Lonely Nodes","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":36756,"title":"Find All The Lonely Nodes","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8827552830113548,"acs":288194,"articleLive":0,"columnArticles":0,"formTitle":"[1470]Shuffle the Array","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":326471,"title":"Shuffle the Array","titleSlug":"shuffle-the-array"},{"acceptance":0.5950886766712142,"acs":26172,"articleLive":0,"columnArticles":0,"formTitle":"[1471]The k Strongest Values in an Array","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":43980,"title":"The k Strongest Values in an Array","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.7433016223172021,"acs":64694,"articleLive":0,"columnArticles":0,"formTitle":"[1472]Design Browser History","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":87036,"title":"Design Browser History","titleSlug":"design-browser-history"},{"acceptance":0.5037387288321971,"acs":13743,"articleLive":0,"columnArticles":0,"formTitle":"[1473]Paint House III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":27282,"title":"Paint House III","titleSlug":"paint-house-iii"},{"acceptance":0.7355395683453237,"acs":17892,"articleLive":1,"articleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list","columnArticles":1,"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":24325,"title":"Delete N Nodes After M Nodes of a Linked List","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7512825363617142,"acs":67511,"articleLive":0,"columnArticles":0,"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":89861,"title":"Final Prices With a Special Discount in a Shop","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8822578673584419,"acs":64958,"articleLive":0,"columnArticles":0,"formTitle":"[1476]Subrectangle Queries","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":73627,"title":"Subrectangle Queries","titleSlug":"subrectangle-queries"},{"acceptance":0.36462428243707523,"acs":33855,"articleLive":0,"columnArticles":0,"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":92849,"title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5543333594300478,"acs":14161,"articleLive":0,"columnArticles":0,"formTitle":"[1478]Allocate Mailboxes","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":25546,"title":"Allocate Mailboxes","titleSlug":"allocate-mailboxes"},{"acceptance":0.8238721136767317,"acs":11596,"articleLive":0,"columnArticles":0,"formTitle":"[1479]Sales by Day of the Week","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":14075,"title":"Sales by Day of the Week","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8944826563166008,"acs":476363,"articleLive":1,"articleSlug":"running-sum-of-1d-array","columnArticles":1,"formTitle":"[1480]Running Sum of 1d Array","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":532557,"title":"Running Sum of 1d Array","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5967012805235582,"acs":63094,"articleLive":0,"columnArticles":0,"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":105738,"title":"Least Number of Unique Integers after K Removals","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5492521918514698,"acs":33015,"articleLive":0,"columnArticles":0,"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":60109,"title":"Minimum Number of Days to Make m Bouquets","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.33201567014695194,"acs":18730,"articleLive":0,"columnArticles":0,"formTitle":"[1483]Kth Ancestor of a Tree Node","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":56413,"title":"Kth Ancestor of a Tree Node","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8499394165346258,"acs":18238,"articleLive":0,"columnArticles":0,"formTitle":"[1484]Group Sold Products By The Date","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":21458,"title":"Group Sold Products By The Date","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.7953462603878116,"acs":14356,"articleLive":1,"articleSlug":"clone-binary-tree-with-random-pointer","columnArticles":1,"formTitle":"[1485]Clone Binary Tree With Random Pointer","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":18050,"title":"Clone Binary Tree With Random Pointer","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.8414343278717668,"acs":113597,"articleLive":0,"columnArticles":0,"formTitle":"[1486]XOR Operation in an Array","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"","submitted":135004,"title":"XOR Operation in an Array","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.34278388398033677,"acs":20989,"articleLive":0,"columnArticles":0,"formTitle":"[1487]Making File Names Unique","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":61231,"title":"Making File Names Unique","titleSlug":"making-file-names-unique"},{"acceptance":0.2530595625872499,"acs":21753,"articleLive":0,"columnArticles":0,"formTitle":"[1488]Avoid Flood in The City","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":85960,"title":"Avoid Flood in The City","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.5272032374100719,"acs":7035,"articleLive":0,"columnArticles":0,"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":13344,"title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8296778615490061,"acs":14526,"articleLive":1,"articleSlug":"clone-n-ary-tree","columnArticles":1,"formTitle":"[1490]Clone N-ary Tree","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":17508,"title":"Clone N-ary Tree","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6752193687692378,"acs":58790,"articleLive":0,"columnArticles":0,"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":87068,"title":"Average Salary Excluding the Minimum and Maximum Salary","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6216165305771452,"acs":75900,"articleLive":1,"articleSlug":"the-kth-factor-of-n","columnArticles":1,"formTitle":"[1492]The kth Factor of n","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":122101,"title":"The kth Factor of n","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.6008917672589177,"acs":35443,"articleLive":0,"columnArticles":0,"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":58984,"title":"Longest Subarray of 1's After Deleting One Element","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.31370897190811003,"acs":9682,"articleLive":0,"columnArticles":0,"formTitle":"[1494]Parallel Courses II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":30863,"title":"Parallel Courses II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5042092231507274,"acs":16291,"articleLive":0,"columnArticles":0,"formTitle":"[1495]Friendly Movies Streamed Last Month","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":32310,"title":"Friendly Movies Streamed Last Month","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5559400422565672,"acs":33417,"articleLive":0,"columnArticles":0,"formTitle":"[1496]Path Crossing","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":60109,"title":"Path Crossing","titleSlug":"path-crossing"},{"acceptance":0.40501043841336115,"acs":27742,"articleLive":0,"columnArticles":0,"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":68497,"title":"Check If Array Pairs Are Divisible by k","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3931514634839443,"acs":24903,"articleLive":0,"columnArticles":0,"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":63342,"title":"Number of Subsequences That Satisfy the Given Sum Condition","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.469124500665779,"acs":28185,"articleLive":0,"columnArticles":0,"formTitle":"[1499]Max Value of Equation","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":60080,"title":"Max Value of Equation","titleSlug":"max-value-of-equation"},{"acceptance":0.4538499916846832,"acs":2729,"articleLive":0,"columnArticles":0,"formTitle":"[1500]Design a File Sharing System","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":6013,"title":"Design a File Sharing System","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5871895424836602,"acs":13476,"articleLive":0,"columnArticles":0,"formTitle":"[1501]Countries You Can Safely Invest In","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":22950,"title":"Countries You Can Safely Invest In","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7031477540047049,"acs":62770,"articleLive":0,"columnArticles":0,"formTitle":"[1502]Can Make Arithmetic Progression From Sequence","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":89270,"title":"Can Make Arithmetic Progression From Sequence","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.546434030496216,"acs":14657,"articleLive":0,"columnArticles":0,"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":26823,"title":"Last Moment Before All Ants Fall Out of a Plank","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5905276964263255,"acs":32867,"articleLive":0,"columnArticles":0,"formTitle":"[1504]Count Submatrices With All Ones","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":55657,"title":"Count Submatrices With All Ones","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3743811229326872,"acs":7108,"articleLive":0,"columnArticles":0,"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":18986,"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.7826916199785433,"acs":19698,"articleLive":1,"articleSlug":"find-root-of-n-ary-tree","columnArticles":1,"formTitle":"[1506]Find Root of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":25167,"title":"Find Root of N-Ary Tree","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.6142581888246628,"acs":33474,"articleLive":0,"columnArticles":0,"formTitle":"[1507]Reformat Date","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":54495,"title":"Reformat Date","titleSlug":"reformat-date"},{"acceptance":0.5918794582859506,"acs":22901,"articleLive":0,"columnArticles":0,"formTitle":"[1508]Range Sum of Sorted Subarray Sums","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":38692,"title":"Range Sum of Sorted Subarray Sums","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5601659751037344,"acs":56025,"articleLive":0,"columnArticles":0,"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":100015,"title":"Minimum Difference Between Largest and Smallest Value in Three Moves","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.6081280814750084,"acs":56368,"articleLive":1,"articleSlug":"stone-game-iv","columnArticles":1,"formTitle":"[1510]Stone Game IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":92691,"title":"Stone Game IV","titleSlug":"stone-game-iv"},{"acceptance":0.7348366791945489,"acs":24049,"articleLive":0,"columnArticles":0,"formTitle":"[1511]Customer Order Frequency","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":32727,"title":"Customer Order Frequency","titleSlug":"customer-order-frequency"},{"acceptance":0.8783845785456652,"acs":262283,"articleLive":0,"columnArticles":0,"formTitle":"[1512]Number of Good Pairs","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":298597,"title":"Number of Good Pairs","titleSlug":"number-of-good-pairs"},{"acceptance":0.43858615142006085,"acs":27534,"articleLive":0,"columnArticles":0,"formTitle":"[1513]Number of Substrings With Only 1s","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":62779,"title":"Number of Substrings With Only 1s","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.4541714031532645,"acs":36757,"articleLive":0,"columnArticles":0,"formTitle":"[1514]Path with Maximum Probability","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":80932,"title":"Path with Maximum Probability","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3914328568907711,"acs":8873,"articleLive":0,"columnArticles":0,"formTitle":"[1515]Best Position for a Service Centre","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":22668,"title":"Best Position for a Service Centre","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.646485168630638,"acs":1591,"articleLive":0,"columnArticles":0,"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":2461,"title":"Move Sub-Tree of N-Ary Tree","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6444538985148515,"acs":16663,"articleLive":0,"columnArticles":0,"formTitle":"[1517]Find Users With Valid E-Mails","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":25856,"title":"Find Users With Valid E-Mails","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6048896310598549,"acs":46366,"articleLive":0,"columnArticles":0,"formTitle":"[1518]Water Bottles","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":76652,"title":"Water Bottles","titleSlug":"water-bottles"},{"acceptance":0.39159981605436617,"acs":15328,"articleLive":0,"columnArticles":0,"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":39142,"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.37376048817696417,"acs":10290,"articleLive":0,"columnArticles":0,"formTitle":"[1520]Maximum Number of Non-Overlapping Substrings","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":27531,"title":"Maximum Number of Non-Overlapping Substrings","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.4358663351325126,"acs":7187,"articleLive":0,"columnArticles":0,"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":16489,"title":"Find a Value of a Mysterious Function Closest to Target","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7279452976123753,"acs":25976,"articleLive":1,"articleSlug":"diameter-of-n-ary-tree","columnArticles":1,"formTitle":"[1522]Diameter of N-Ary Tree","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":35684,"title":"Diameter of N-Ary Tree","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5392124334235572,"acs":30878,"articleLive":0,"columnArticles":0,"formTitle":"[1523]Count Odd Numbers in an Interval Range","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":57265,"title":"Count Odd Numbers in an Interval Range","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4358588707150467,"acs":20865,"articleLive":0,"columnArticles":0,"formTitle":"[1524]Number of Sub-arrays With Odd Sum","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":47871,"title":"Number of Sub-arrays With Odd Sum","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.7055375819890091,"acs":63679,"articleLive":0,"columnArticles":0,"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":90256,"title":"Number of Good Ways to Split a String","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6788559448936807,"acs":22667,"articleLive":0,"columnArticles":0,"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":33390,"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.5220672389127324,"acs":14597,"articleLive":0,"columnArticles":0,"formTitle":"[1527]Patients With a Condition","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":27960,"title":"Patients With a Condition","titleSlug":"patients-with-a-condition"},{"acceptance":0.8584183127718747,"acs":180564,"articleLive":0,"columnArticles":0,"formTitle":"[1528]Shuffle String","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":210345,"title":"Shuffle String","titleSlug":"shuffle-string"},{"acceptance":0.7249641421147922,"acs":30832,"articleLive":0,"columnArticles":0,"formTitle":"[1529]Minimum Suffix Flips","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":42529,"title":"Minimum Suffix Flips","titleSlug":"minimum-suffix-flips"},{"acceptance":0.5908595735851014,"acs":22780,"articleLive":0,"columnArticles":0,"formTitle":"[1530]Number of Good Leaf Nodes Pairs","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":38554,"title":"Number of Good Leaf Nodes Pairs","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.37437957034062064,"acs":9881,"articleLive":0,"columnArticles":0,"formTitle":"[1531]String Compression II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":26393,"title":"String Compression II","titleSlug":"string-compression-ii"},{"acceptance":0.713679070014332,"acs":13445,"articleLive":0,"columnArticles":0,"formTitle":"[1532]The Most Recent Three Orders","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":18839,"title":"The Most Recent Three Orders","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.5081283868278449,"acs":3657,"articleLive":0,"columnArticles":0,"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":7197,"title":"Find the Index of the Large Integer","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.8045468239438252,"acs":69434,"articleLive":0,"columnArticles":0,"formTitle":"[1534]Count Good Triplets","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":86302,"title":"Count Good Triplets","titleSlug":"count-good-triplets"},{"acceptance":0.48780335900683014,"acs":23497,"articleLive":0,"columnArticles":0,"formTitle":"[1535]Find the Winner of an Array Game","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":48169,"title":"Find the Winner of an Array Game","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.45500168690958165,"acs":10789,"articleLive":0,"columnArticles":0,"formTitle":"[1536]Minimum Swaps to Arrange a Binary Grid","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":23712,"title":"Minimum Swaps to Arrange a Binary Grid","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3891863225415425,"acs":15411,"articleLive":0,"columnArticles":0,"formTitle":"[1537]Get the Maximum Score","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":39598,"title":"Get the Maximum Score","titleSlug":"get-the-maximum-score"},{"acceptance":0.6236613972463029,"acs":1223,"articleLive":0,"columnArticles":0,"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":1961,"title":"Guess the Majority in a Hidden Array","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5519220348770523,"acs":139543,"articleLive":1,"articleSlug":"kth-missing-positive-number","columnArticles":1,"formTitle":"[1539]Kth Missing Positive Number","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":252831,"title":"Kth Missing Positive Number","titleSlug":"kth-missing-positive-number"},{"acceptance":0.32311089918939945,"acs":12875,"articleLive":0,"columnArticles":0,"formTitle":"[1540]Can Convert String in K Moves","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":39847,"title":"Can Convert String in K Moves","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4865353932365646,"acs":25005,"articleLive":0,"columnArticles":0,"formTitle":"[1541]Minimum Insertions to Balance a Parentheses String","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"","submitted":51394,"title":"Minimum Insertions to Balance a Parentheses String","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.4010922623362815,"acs":8299,"articleLive":0,"columnArticles":0,"formTitle":"[1542]Find Longest Awesome Substring","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":20691,"title":"Find Longest Awesome Substring","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.6353245040391273,"acs":11561,"articleLive":0,"columnArticles":0,"formTitle":"[1543]Fix Product Name Format","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":18197,"title":"Fix Product Name Format","titleSlug":"fix-product-name-format"},{"acceptance":0.5622473320778405,"acs":44783,"articleLive":0,"columnArticles":0,"formTitle":"[1544]Make The String Great","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"","submitted":79650,"title":"Make The String Great","titleSlug":"make-the-string-great"},{"acceptance":0.5812960077373597,"acs":21637,"articleLive":0,"columnArticles":0,"formTitle":"[1545]Find Kth Bit in Nth Binary String","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":37222,"title":"Find Kth Bit in Nth Binary String","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.45896640959286683,"acs":17913,"articleLive":0,"columnArticles":0,"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":39029,"title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.548893470790378,"acs":19966,"articleLive":0,"columnArticles":0,"formTitle":"[1547]Minimum Cost to Cut a Stick","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":36375,"title":"Minimum Cost to Cut a Stick","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.5705845771144279,"acs":12845,"articleLive":0,"columnArticles":0,"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":22512,"title":"The Most Similar Path in a Graph","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6773747217710401,"acs":11260,"articleLive":0,"columnArticles":0,"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":16623,"title":"The Most Recent Orders for Each Product","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6419527099562333,"acs":46643,"articleLive":0,"columnArticles":0,"formTitle":"[1550]Three Consecutive Odds","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":72658,"title":"Three Consecutive Odds","titleSlug":"three-consecutive-odds"},{"acceptance":0.8071393351153556,"acs":62203,"articleLive":1,"articleSlug":"minimum-operations-to-make-array-equal","columnArticles":1,"formTitle":"[1551]Minimum Operations to Make Array Equal","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":77066,"title":"Minimum Operations to Make Array Equal","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5351561600957444,"acs":23252,"articleLive":0,"columnArticles":0,"formTitle":"[1552]Magnetic Force Between Two Balls","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":43449,"title":"Magnetic Force Between Two Balls","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.32532405448190466,"acs":20756,"articleLive":0,"columnArticles":0,"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":63801,"title":"Minimum Number of Days to Eat N Oranges","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.6534961499572217,"acs":8402,"articleLive":0,"columnArticles":0,"formTitle":"[1554]Strings Differ by One Character","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":12857,"title":"Strings Differ by One Character","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.5337444136448493,"acs":9435,"articleLive":0,"columnArticles":0,"formTitle":"[1555]Bank Account Summary","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":17677,"title":"Bank Account Summary","titleSlug":"bank-account-summary"},{"acceptance":0.5649988995671631,"acs":30806,"articleLive":0,"columnArticles":0,"formTitle":"[1556]Thousand Separator","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":54524,"title":"Thousand Separator","titleSlug":"thousand-separator"},{"acceptance":0.7777969153683552,"acs":49674,"articleLive":0,"columnArticles":0,"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":63865,"title":"Minimum Number of Vertices to Reach All Nodes","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6382789975604347,"acs":14390,"articleLive":0,"columnArticles":0,"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":22545,"title":"Minimum Numbers of Function Calls to Make Target Array","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.47693614676371315,"acs":20772,"articleLive":0,"columnArticles":0,"formTitle":"[1559]Detect Cycles in 2D Grid","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":43553,"title":"Detect Cycles in 2D Grid","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5794830042743742,"acs":19929,"articleLive":0,"columnArticles":0,"formTitle":"[1560]Most Visited Sector in a Circular Track","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":34391,"title":"Most Visited Sector in a Circular Track","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7808211420481359,"acs":41364,"articleLive":0,"columnArticles":0,"formTitle":"[1561]Maximum Number of Coins You Can Get","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":52975,"title":"Maximum Number of Coins You Can Get","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.4070137061216119,"acs":11908,"articleLive":0,"columnArticles":0,"formTitle":"[1562]Find Latest Group of Size M","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":29257,"title":"Find Latest Group of Size M","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.40925446413558864,"acs":12170,"articleLive":0,"columnArticles":0,"formTitle":"[1563]Stone Game V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":29737,"title":"Stone Game V","titleSlug":"stone-game-v"},{"acceptance":0.6442896210444068,"acs":9895,"articleLive":1,"articleSlug":"put-boxes-into-the-warehouse-i","columnArticles":1,"formTitle":"[1564]Put Boxes Into the Warehouse I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":15358,"title":"Put Boxes Into the Warehouse I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.8303356924875008,"acs":12788,"articleLive":0,"columnArticles":0,"formTitle":"[1565]Unique Orders and Customers Per Month","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":15401,"title":"Unique Orders and Customers Per Month","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4362172191510932,"acs":22805,"articleLive":0,"columnArticles":0,"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":52279,"title":"Detect Pattern of Length M Repeated K or More Times","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.422916157418724,"acs":34603,"articleLive":0,"columnArticles":0,"formTitle":"[1567]Maximum Length of Subarray With Positive Product","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":81820,"title":"Maximum Length of Subarray With Positive Product","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4917835162743481,"acs":7751,"articleLive":0,"columnArticles":0,"formTitle":"[1568]Minimum Number of Days to Disconnect Island","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":15761,"title":"Minimum Number of Days to Disconnect Island","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4933923171687759,"acs":8811,"articleLive":0,"columnArticles":0,"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":17858,"title":"Number of Ways to Reorder Array to Get Same BST","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.9055626513293475,"acs":115567,"articleLive":1,"articleSlug":"dot-product-of-two-sparse-vectors","columnArticles":1,"formTitle":"[1570]Dot Product of Two Sparse Vectors","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":127619,"title":"Dot Product of Two Sparse Vectors","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.8970178725127842,"acs":17717,"articleLive":0,"columnArticles":0,"formTitle":"[1571]Warehouse Manager","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":19751,"title":"Warehouse Manager","titleSlug":"warehouse-manager"},{"acceptance":0.7853303325645413,"acs":84445,"articleLive":0,"columnArticles":0,"formTitle":"[1572]Matrix Diagonal Sum","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":107528,"title":"Matrix Diagonal Sum","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.31847829982439163,"acs":17773,"articleLive":0,"columnArticles":0,"formTitle":"[1573]Number of Ways to Split a String","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":55806,"title":"Number of Ways to Split a String","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3514545801769686,"acs":16563,"articleLive":0,"columnArticles":0,"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":47127,"title":"Shortest Subarray to be Removed to Make Array Sorted","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5758572693913704,"acs":9102,"articleLive":0,"columnArticles":0,"formTitle":"[1575]Count All Possible Routes","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":15806,"title":"Count All Possible Routes","titleSlug":"count-all-possible-routes"},{"acceptance":0.501603854055288,"acs":41752,"articleLive":0,"columnArticles":0,"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":83237,"title":"Replace All ?'s to Avoid Consecutive Repeating Characters","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3891662439597405,"acs":14577,"articleLive":0,"columnArticles":0,"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":37457,"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.6142861868583841,"acs":55709,"articleLive":0,"columnArticles":0,"formTitle":"[1578]Minimum Time to Make Rope Colorful","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":90689,"title":"Minimum Time to Make Rope Colorful","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.4990629685157421,"acs":10652,"articleLive":0,"columnArticles":0,"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":21344,"title":"Remove Max Number of Edges to Keep Graph Fully Traversable","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.634892872759073,"acs":2904,"articleLive":0,"columnArticles":0,"formTitle":"[1580]Put Boxes Into the Warehouse II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":4574,"title":"Put Boxes Into the Warehouse II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8973913986658713,"acs":16547,"articleLive":0,"columnArticles":0,"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":18439,"title":"Customer Who Visited but Did Not Make Any Transactions","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6483322535242734,"acs":29020,"articleLive":0,"columnArticles":0,"formTitle":"[1582]Special Positions in a Binary Matrix","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":44761,"title":"Special Positions in a Binary Matrix","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.5732299109701579,"acs":15002,"articleLive":0,"columnArticles":0,"formTitle":"[1583]Count Unhappy Friends","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":26171,"title":"Count Unhappy Friends","titleSlug":"count-unhappy-friends"},{"acceptance":0.6090864982883636,"acs":45193,"articleLive":0,"columnArticles":0,"formTitle":"[1584]Min Cost to Connect All Points","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":74198,"title":"Min Cost to Connect All Points","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4836238107266145,"acs":5744,"articleLive":0,"columnArticles":0,"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":11877,"title":"Check If String Is Transformable With Substring Sort Operations","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6761465827338129,"acs":6015,"articleLive":1,"articleSlug":"binary-search-tree-iterator-ii","columnArticles":1,"formTitle":"[1586]Binary Search Tree Iterator II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":8896,"title":"Binary Search Tree Iterator II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.9006540660246176,"acs":17488,"articleLive":0,"columnArticles":0,"formTitle":"[1587]Bank Account Summary II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":19417,"title":"Bank Account Summary II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8288031027905935,"acs":77784,"articleLive":0,"columnArticles":0,"formTitle":"[1588]Sum of All Odd Length Subarrays","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":93851,"title":"Sum of All Odd Length Subarrays","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.36112856604247834,"acs":11494,"articleLive":0,"columnArticles":0,"formTitle":"[1589]Maximum Sum Obtained of Any Permutation","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":31828,"title":"Maximum Sum Obtained of Any Permutation","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.28166599240979406,"acs":14621,"articleLive":0,"columnArticles":0,"formTitle":"[1590]Make Sum Divisible by P","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":51909,"title":"Make Sum Divisible by P","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5621076463929197,"acs":5462,"articleLive":0,"columnArticles":0,"formTitle":"[1591]Strange Printer II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":9717,"title":"Strange Printer II","titleSlug":"strange-printer-ii"},{"acceptance":0.44039382650345926,"acs":31445,"articleLive":0,"columnArticles":0,"formTitle":"[1592]Rearrange Spaces Between Words","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":71402,"title":"Rearrange Spaces Between Words","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5354035489410418,"acs":18707,"articleLive":0,"columnArticles":0,"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":34940,"title":"Split a String Into the Max Number of Unique Substrings","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3299010829709218,"acs":15475,"articleLive":0,"columnArticles":0,"formTitle":"[1594]Maximum Non Negative Product in a Matrix","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":46908,"title":"Maximum Non Negative Product in a Matrix","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.44875935407640805,"acs":5697,"articleLive":0,"columnArticles":0,"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":12695,"title":"Minimum Cost to Connect Two Groups of Points","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.847099010910574,"acs":16615,"articleLive":0,"columnArticles":0,"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":19614,"title":"The Most Frequently Ordered Products for Each Customer","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.5936005102583183,"acs":5584,"articleLive":0,"columnArticles":0,"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":9407,"title":"Build Binary Expression Tree From Infix Expression","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6420099202070304,"acs":35724,"articleLive":0,"columnArticles":0,"formTitle":"[1598]Crawler Log Folder","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"","submitted":55644,"title":"Crawler Log Folder","titleSlug":"crawler-log-folder"},{"acceptance":0.4387078704135935,"acs":9398,"articleLive":0,"columnArticles":0,"formTitle":"[1599]Maximum Profit of Operating a Centennial Wheel","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":21422,"title":"Maximum Profit of Operating a Centennial Wheel","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6273816314888762,"acs":10998,"articleLive":0,"columnArticles":0,"formTitle":"[1600]Throne Inheritance","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":17530,"title":"Throne Inheritance","titleSlug":"throne-inheritance"},{"acceptance":0.49701844404382195,"acs":7168,"articleLive":0,"columnArticles":0,"formTitle":"[1601]Maximum Number of Achievable Transfer Requests","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":14422,"title":"Maximum Number of Achievable Transfer Requests","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7522170285264951,"acs":17219,"articleLive":1,"articleSlug":"find-nearest-right-node-in-binary-tree","columnArticles":1,"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":22891,"title":"Find Nearest Right Node in Binary Tree","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8723140566505411,"acs":102059,"articleLive":0,"columnArticles":0,"formTitle":"[1603]Design Parking System","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"","submitted":116998,"title":"Design Parking System","titleSlug":"design-parking-system"},{"acceptance":0.4702730729346699,"acs":16326,"articleLive":0,"columnArticles":0,"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":34716,"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.7856111149322512,"acs":22844,"articleLive":0,"columnArticles":0,"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":29078,"title":"Find Valid Matrix Given Row and Column Sums","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.40358947777633797,"acs":6229,"articleLive":0,"columnArticles":0,"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":15434,"title":"Find Servers That Handled Most Number of Requests","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5462212745794836,"acs":11528,"articleLive":0,"columnArticles":0,"formTitle":"[1607]Sellers With No Sales","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":21105,"title":"Sellers With No Sales","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6055434613590421,"acs":31154,"articleLive":0,"columnArticles":0,"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":51448,"title":"Special Array With X Elements Greater Than or Equal X","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5286689109271222,"acs":29053,"articleLive":0,"columnArticles":0,"formTitle":"[1609]Even Odd Tree","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":54955,"title":"Even Odd Tree","titleSlug":"even-odd-tree"},{"acceptance":0.35729932337049114,"acs":22020,"articleLive":0,"columnArticles":0,"formTitle":"[1610]Maximum Number of Visible Points","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":61629,"title":"Maximum Number of Visible Points","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6208489555436529,"acs":9273,"articleLive":0,"columnArticles":0,"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":14936,"title":"Minimum One Bit Operations to Make Integers Zero","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.692582802052558,"acs":4454,"articleLive":0,"columnArticles":0,"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":6431,"title":"Check If Two Expression Trees are Equivalent","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7600101154851218,"acs":9016,"articleLive":0,"columnArticles":0,"formTitle":"[1613]Find the Missing IDs","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":11863,"title":"Find the Missing IDs","titleSlug":"find-the-missing-ids"},{"acceptance":0.8294617563739377,"acs":74664,"articleLive":0,"columnArticles":0,"formTitle":"[1614]Maximum Nesting Depth of the Parentheses","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":90015,"title":"Maximum Nesting Depth of the Parentheses","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5590102474381404,"acs":33549,"articleLive":0,"columnArticles":0,"formTitle":"[1615]Maximal Network Rank","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":60015,"title":"Maximal Network Rank","titleSlug":"maximal-network-rank"},{"acceptance":0.31478960643792286,"acs":15725,"articleLive":0,"columnArticles":0,"formTitle":"[1616]Split Two Strings to Make Palindrome","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":49954,"title":"Split Two Strings to Make Palindrome","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6492272467086434,"acs":5671,"articleLive":0,"columnArticles":0,"formTitle":"[1617]Count Subtrees With Max Distance Between Cities","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":8735,"title":"Count Subtrees With Max Distance Between Cities","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5757306226175349,"acs":4531,"articleLive":0,"columnArticles":0,"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":7870,"title":"Maximum Font to Fit a Sentence in a Screen","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6454794398557339,"acs":28993,"articleLive":0,"columnArticles":0,"formTitle":"[1619]Mean of Array After Removing Some Elements","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":44917,"title":"Mean of Array After Removing Some Elements","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37029477096716096,"acs":6168,"articleLive":0,"columnArticles":0,"formTitle":"[1620]Coordinate With Maximum Network Quality","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":16657,"title":"Coordinate With Maximum Network Quality","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4253259846753596,"acs":6328,"articleLive":0,"columnArticles":0,"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":14878,"title":"Number of Sets of K Non-Overlapping Line Segments","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.152964125987249,"acs":6430,"articleLive":0,"columnArticles":0,"formTitle":"[1622]Fancy Sequence","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":42036,"title":"Fancy Sequence","titleSlug":"fancy-sequence"},{"acceptance":0.8844924669000153,"acs":11624,"articleLive":0,"columnArticles":0,"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":13142,"title":"All Valid Triplets That Can Represent a Country","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.5921144024514811,"acs":28984,"articleLive":0,"columnArticles":0,"formTitle":"[1624]Largest Substring Between Two Equal Characters","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":48950,"title":"Largest Substring Between Two Equal Characters","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.6610792039535194,"acs":9899,"articleLive":0,"columnArticles":0,"formTitle":"[1625]Lexicographically Smallest String After Applying Operations","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":14974,"title":"Lexicographically Smallest String After Applying Operations","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.403544437003731,"acs":16873,"articleLive":0,"columnArticles":0,"formTitle":"[1626]Best Team With No Conflicts","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":41812,"title":"Best Team With No Conflicts","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.4394272612418698,"acs":9391,"articleLive":0,"columnArticles":0,"formTitle":"[1627]Graph Connectivity With Threshold","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":21371,"title":"Graph Connectivity With Threshold","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8134488825177559,"acs":12484,"articleLive":0,"columnArticles":0,"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":15347,"title":"Design an Expression Tree With Evaluate Function","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5970201113528628,"acs":72166,"articleLive":1,"articleSlug":"slowest-key","columnArticles":1,"formTitle":"[1629]Slowest Key","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":120877,"title":"Slowest Key","titleSlug":"slowest-key"},{"acceptance":0.7801200574923203,"acs":27681,"articleLive":0,"columnArticles":0,"formTitle":"[1630]Arithmetic Subarrays","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":35483,"title":"Arithmetic Subarrays","titleSlug":"arithmetic-subarrays"},{"acceptance":0.516250303177298,"acs":68112,"articleLive":1,"articleSlug":"path-with-minimum-effort","columnArticles":1,"formTitle":"[1631]Path With Minimum Effort","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":131936,"title":"Path With Minimum Effort","titleSlug":"path-with-minimum-effort"},{"acceptance":0.40643207897615957,"acs":15974,"articleLive":1,"articleSlug":"rank-transform-of-a-matrix","columnArticles":1,"formTitle":"[1632]Rank Transform of a Matrix","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":39303,"title":"Rank Transform of a Matrix","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6928082423913781,"acs":10221,"articleLive":0,"columnArticles":0,"formTitle":"[1633]Percentage of Users Attended a Contest","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":14753,"title":"Percentage of Users Attended a Contest","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5346978321424246,"acs":4415,"articleLive":0,"columnArticles":0,"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":8257,"title":"Add Two Polynomials Represented as Linked Lists","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5460137213153536,"acs":4616,"articleLive":0,"columnArticles":0,"formTitle":"[1635]Hopper Company Queries I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":8454,"title":"Hopper Company Queries I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.6822117596125227,"acs":50425,"articleLive":0,"columnArticles":0,"formTitle":"[1636]Sort Array by Increasing Frequency","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":73914,"title":"Sort Array by Increasing Frequency","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8398314353728367,"acs":26107,"articleLive":0,"columnArticles":0,"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":31086,"title":"Widest Vertical Area Between Two Points Containing No Points","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7177094681002226,"acs":15153,"articleLive":0,"columnArticles":0,"formTitle":"[1638]Count Substrings That Differ by One Character","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":21113,"title":"Count Substrings That Differ by One Character","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4221872090524959,"acs":5895,"articleLive":0,"columnArticles":0,"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":13963,"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.556450642227075,"acs":64723,"articleLive":1,"articleSlug":"check-array-formation-through-concatenation","columnArticles":1,"formTitle":"[1640]Check Array Formation Through Concatenation","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":116314,"title":"Check Array Formation Through Concatenation","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7479858139624532,"acs":77614,"articleLive":1,"articleSlug":"count-sorted-vowel-strings","columnArticles":1,"formTitle":"[1641]Count Sorted Vowel Strings","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":103764,"title":"Count Sorted Vowel Strings","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.44667416588844555,"acs":42091,"articleLive":1,"articleSlug":"furthest-building-you-can-reach","columnArticles":1,"formTitle":"[1642]Furthest Building You Can Reach","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":94232,"title":"Furthest Building You Can Reach","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4555391242847039,"acs":7085,"articleLive":0,"columnArticles":0,"formTitle":"[1643]Kth Smallest Instructions","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":15553,"title":"Kth Smallest Instructions","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5860575844877258,"acs":33972,"articleLive":0,"columnArticles":0,"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":57967,"title":"Lowest Common Ancestor of a Binary Tree II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.3943788645306352,"acs":3508,"articleLive":0,"columnArticles":0,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":8895,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5108158220024722,"acs":52896,"articleLive":1,"articleSlug":"get-maximum-in-generated-array","columnArticles":1,"formTitle":"[1646]Get Maximum in Generated Array","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"","submitted":103552,"title":"Get Maximum in Generated Array","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.562670992421858,"acs":69720,"articleLive":0,"columnArticles":0,"formTitle":"[1647]Minimum Deletions to Make Character Frequencies Unique","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":123909,"title":"Minimum Deletions to Make Character Frequencies Unique","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.3110190026782298,"acs":24387,"articleLive":0,"columnArticles":0,"formTitle":"[1648]Sell Diminishing-Valued Colored Balls","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":78410,"title":"Sell Diminishing-Valued Colored Balls","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.3717014763436277,"acs":19185,"articleLive":1,"articleSlug":"create-sorted-array-through-instructions","columnArticles":1,"formTitle":"[1649]Create Sorted Array through Instructions","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":51614,"title":"Create Sorted Array through Instructions","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7754421943091515,"acs":90750,"articleLive":0,"columnArticles":0,"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":117030,"title":"Lowest Common Ancestor of a Binary Tree III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6678225953641176,"acs":3659,"articleLive":0,"columnArticles":0,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":5479,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6075015020169943,"acs":21234,"articleLive":0,"columnArticles":0,"formTitle":"[1652]Defuse the Bomb","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":34953,"title":"Defuse the Bomb","titleSlug":"defuse-the-bomb"},{"acceptance":0.5479524345623417,"acs":15575,"articleLive":0,"columnArticles":0,"formTitle":"[1653]Minimum Deletions to Make String Balanced","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":28424,"title":"Minimum Deletions to Make String Balanced","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2596139230886153,"acs":17080,"articleLive":0,"columnArticles":0,"formTitle":"[1654]Minimum Jumps to Reach Home","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":65790,"title":"Minimum Jumps to Reach Home","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.4003560762692396,"acs":6971,"articleLive":0,"columnArticles":0,"formTitle":"[1655]Distribute Repeating Integers","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":17412,"title":"Distribute Repeating Integers","titleSlug":"distribute-repeating-integers"},{"acceptance":0.8315553799552219,"acs":31570,"articleLive":0,"columnArticles":0,"formTitle":"[1656]Design an Ordered Stream","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":37965,"title":"Design an Ordered Stream","titleSlug":"design-an-ordered-stream"},{"acceptance":0.5467782668302187,"acs":37889,"articleLive":1,"articleSlug":"determine-if-two-strings-are-close","columnArticles":1,"formTitle":"[1657]Determine if Two Strings Are Close","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":69295,"title":"Determine if Two Strings Are Close","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.33433476062532425,"acs":43179,"articleLive":1,"articleSlug":"minimum-operations-to-reduce-x-to-zero","columnArticles":1,"formTitle":"[1658]Minimum Operations to Reduce X to Zero","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":129149,"title":"Minimum Operations to Reduce X to Zero","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.37339518826194845,"acs":3461,"articleLive":0,"columnArticles":0,"formTitle":"[1659]Maximize Grid Happiness","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":9269,"title":"Maximize Grid Happiness","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7259033793803169,"acs":9301,"articleLive":0,"columnArticles":0,"formTitle":"[1660]Correct a Binary Tree","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":12813,"title":"Correct a Binary Tree","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7978698364128516,"acs":13559,"articleLive":0,"columnArticles":0,"formTitle":"[1661]Average Time of Process per Machine","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":16994,"title":"Average Time of Process per Machine","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8192512823130119,"acs":128416,"articleLive":0,"columnArticles":0,"formTitle":"[1662]Check If Two String Arrays are Equivalent","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":156748,"title":"Check If Two String Arrays are Equivalent","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.6406425957207207,"acs":36409,"articleLive":1,"articleSlug":"smallest-string-with-a-given-numeric-value","columnArticles":1,"formTitle":"[1663]Smallest String With A Given Numeric Value","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":56832,"title":"Smallest String With A Given Numeric Value","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.626551553733903,"acs":21554,"articleLive":0,"columnArticles":0,"formTitle":"[1664]Ways to Make a Fair Array","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":34401,"title":"Ways to Make a Fair Array","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.5560774193548387,"acs":10774,"articleLive":0,"columnArticles":0,"formTitle":"[1665]Minimum Initial Energy to Finish Tasks","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":19375,"title":"Minimum Initial Energy to Finish Tasks","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6726584673604541,"acs":2133,"articleLive":0,"columnArticles":0,"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":3171,"title":"Change the Root of a Binary Tree","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6250084717045069,"acs":9222,"articleLive":0,"columnArticles":0,"formTitle":"[1667]Fix Names in a Table","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":14755,"title":"Fix Names in a Table","titleSlug":"fix-names-in-a-table"},{"acceptance":0.3943157740922043,"acs":21588,"articleLive":0,"columnArticles":0,"formTitle":"[1668]Maximum Repeating Substring","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":54748,"title":"Maximum Repeating Substring","titleSlug":"maximum-repeating-substring"},{"acceptance":0.747069271758437,"acs":44163,"articleLive":0,"columnArticles":0,"formTitle":"[1669]Merge In Between Linked Lists","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"","submitted":59115,"title":"Merge In Between Linked Lists","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5540625392440035,"acs":13236,"articleLive":0,"columnArticles":0,"formTitle":"[1670]Design Front Middle Back Queue","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"","submitted":23889,"title":"Design Front Middle Back Queue","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.43027597090181285,"acs":11179,"articleLive":0,"columnArticles":0,"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":25981,"title":"Minimum Number of Removals to Make Mountain Array","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8938458525915991,"acs":241931,"articleLive":1,"articleSlug":"richest-customer-wealth","columnArticles":1,"formTitle":"[1672]Richest Customer Wealth","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":270663,"title":"Richest Customer Wealth","titleSlug":"richest-customer-wealth"},{"acceptance":0.4785218283920053,"acs":39624,"articleLive":1,"articleSlug":"find-the-most-competitive-subsequence","columnArticles":1,"formTitle":"[1673]Find the Most Competitive Subsequence","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"","submitted":82805,"title":"Find the Most Competitive Subsequence","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.37241286321040923,"acs":5524,"articleLive":0,"columnArticles":0,"formTitle":"[1674]Minimum Moves to Make Array Complementary","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":14833,"title":"Minimum Moves to Make Array Complementary","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4839665060176086,"acs":17975,"articleLive":1,"articleSlug":"minimize-deviation-in-array","columnArticles":1,"formTitle":"[1675]Minimize Deviation in Array","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":37141,"title":"Minimize Deviation in Array","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7973801169590643,"acs":17044,"articleLive":0,"columnArticles":0,"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":21375,"title":"Lowest Common Ancestor of a Binary Tree IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.42097242725844086,"acs":8840,"articleLive":0,"columnArticles":0,"formTitle":"[1677]Product's Worth Over Invoices","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":20999,"title":"Product's Worth Over Invoices","titleSlug":"products-worth-over-invoices"},{"acceptance":0.853680898702903,"acs":88455,"articleLive":0,"columnArticles":0,"formTitle":"[1678]Goal Parser Interpretation","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":103616,"title":"Goal Parser Interpretation","titleSlug":"goal-parser-interpretation"},{"acceptance":0.5359310619821895,"acs":48386,"articleLive":1,"articleSlug":"max-number-of-k-sum-pairs","columnArticles":1,"formTitle":"[1679]Max Number of K-Sum Pairs","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":90284,"title":"Max Number of K-Sum Pairs","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.5256775466683642,"acs":33032,"articleLive":1,"articleSlug":"concatenation-of-consecutive-binary-numbers","columnArticles":1,"formTitle":"[1680]Concatenation of Consecutive Binary Numbers","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":62837,"title":"Concatenation of Consecutive Binary Numbers","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.36932572338731084,"acs":5565,"articleLive":0,"columnArticles":0,"formTitle":"[1681]Minimum Incompatibility","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":15068,"title":"Minimum Incompatibility","titleSlug":"minimum-incompatibility"},{"acceptance":0.5083422080227192,"acs":2864,"articleLive":0,"columnArticles":0,"formTitle":"[1682]Longest Palindromic Subsequence II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":5634,"title":"Longest Palindromic Subsequence II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.9083261307980409,"acs":15764,"articleLive":0,"columnArticles":0,"formTitle":"[1683]Invalid Tweets","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":17355,"title":"Invalid Tweets","titleSlug":"invalid-tweets"},{"acceptance":0.8178720018921273,"acs":76076,"articleLive":0,"columnArticles":0,"formTitle":"[1684]Count the Number of Consistent Strings","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":93017,"title":"Count the Number of Consistent Strings","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6538657356898684,"acs":17980,"articleLive":0,"columnArticles":0,"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":27498,"title":"Sum of Absolute Differences in a Sorted Array","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.5339499572284003,"acs":9987,"articleLive":0,"columnArticles":0,"formTitle":"[1686]Stone Game VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":18704,"title":"Stone Game VI","titleSlug":"stone-game-vi"},{"acceptance":0.36861600628577845,"acs":3284,"articleLive":0,"columnArticles":0,"formTitle":"[1687]Delivering Boxes from Storage to Ports","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":8909,"title":"Delivering Boxes from Storage to Ports","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8264031726826645,"acs":61472,"articleLive":0,"columnArticles":0,"formTitle":"[1688]Count of Matches in Tournament","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":74385,"title":"Count of Matches in Tournament","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8780088893328006,"acs":70325,"articleLive":1,"articleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers","columnArticles":1,"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":80096,"title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5877148046383831,"acs":25240,"articleLive":1,"articleSlug":"stone-game-vii","columnArticles":1,"formTitle":"[1690]Stone Game VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":42946,"title":"Stone Game VII","titleSlug":"stone-game-vii"},{"acceptance":0.53251209359883,"acs":9467,"articleLive":0,"columnArticles":0,"formTitle":"[1691]Maximum Height by Stacking Cuboids ","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":17778,"title":"Maximum Height by Stacking Cuboids ","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6025763358778626,"acs":1263,"articleLive":0,"columnArticles":0,"formTitle":"[1692]Count Ways to Distribute Candies","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":2096,"title":"Count Ways to Distribute Candies","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.9130466419267991,"acs":12548,"articleLive":0,"columnArticles":0,"formTitle":"[1693]Daily Leads and Partners","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":13743,"title":"Daily Leads and Partners","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6520108773436382,"acs":22778,"articleLive":0,"columnArticles":0,"formTitle":"[1694]Reformat Phone Number","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":34935,"title":"Reformat Phone Number","titleSlug":"reformat-phone-number"},{"acceptance":0.5233058880884026,"acs":38643,"articleLive":1,"articleSlug":"maximum-erasure-value","columnArticles":1,"formTitle":"[1695]Maximum Erasure Value","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":73844,"title":"Maximum Erasure Value","titleSlug":"maximum-erasure-value"},{"acceptance":0.42510975108669796,"acs":39315,"articleLive":1,"articleSlug":"jump-game-vi","columnArticles":1,"formTitle":"[1696]Jump Game VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":92482,"title":"Jump Game VI","titleSlug":"jump-game-vi"},{"acceptance":0.48419596997234293,"acs":7353,"articleLive":0,"columnArticles":0,"formTitle":"[1697]Checking Existence of Edge Length Limited Paths","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":15186,"title":"Checking Existence of Edge Length Limited Paths","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.6248359580052494,"acs":3809,"articleLive":0,"columnArticles":0,"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":6096,"title":"Number of Distinct Substrings in a String","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8605469473424285,"acs":13940,"articleLive":0,"columnArticles":0,"formTitle":"[1699]Number of Calls Between Two Persons","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":16199,"title":"Number of Calls Between Two Persons","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.6782980128350633,"acs":32871,"articleLive":0,"columnArticles":0,"formTitle":"[1700]Number of Students Unable to Eat Lunch","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":48461,"title":"Number of Students Unable to Eat Lunch","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6151503616292349,"acs":17776,"articleLive":0,"columnArticles":0,"formTitle":"[1701]Average Waiting Time","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":28897,"title":"Average Waiting Time","titleSlug":"average-waiting-time"},{"acceptance":0.4491492109844443,"acs":7998,"articleLive":0,"columnArticles":0,"formTitle":"[1702]Maximum Binary String After Change","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":17807,"title":"Maximum Binary String After Change","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.39841487578113094,"acs":5228,"articleLive":0,"columnArticles":0,"formTitle":"[1703]Minimum Adjacent Swaps for K Consecutive Ones","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":13122,"title":"Minimum Adjacent Swaps for K Consecutive Ones","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7821087468569554,"acs":78695,"articleLive":1,"articleSlug":"determine-if-string-halves-are-alike","columnArticles":1,"formTitle":"[1704]Determine if String Halves Are Alike","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":100619,"title":"Determine if String Halves Are Alike","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3594457623463446,"acs":13334,"articleLive":0,"columnArticles":0,"formTitle":"[1705]Maximum Number of Eaten Apples","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":37096,"title":"Maximum Number of Eaten Apples","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.6617269954382271,"acs":24515,"articleLive":0,"columnArticles":0,"formTitle":"[1706]Where Will the Ball Fall","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":37047,"title":"Where Will the Ball Fall","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.43064721867894185,"acs":7765,"articleLive":0,"columnArticles":0,"formTitle":"[1707]Maximum XOR With an Element From Array","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":18031,"title":"Maximum XOR With an Element From Array","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6380498145204028,"acs":4816,"articleLive":0,"columnArticles":0,"formTitle":"[1708]Largest Subarray Length K","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":7548,"title":"Largest Subarray Length K","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7856937661591497,"acs":8205,"articleLive":0,"columnArticles":0,"formTitle":"[1709]Biggest Window Between Visits","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":10443,"title":"Biggest Window Between Visits","titleSlug":"biggest-window-between-visits"},{"acceptance":0.7205920446262372,"acs":119619,"articleLive":1,"articleSlug":"maximum-units-on-a-truck","columnArticles":1,"formTitle":"[1710]Maximum Units on a Truck","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":166001,"title":"Maximum Units on a Truck","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.2811034980165885,"acs":21826,"articleLive":0,"columnArticles":0,"formTitle":"[1711]Count Good Meals","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"","submitted":77644,"title":"Count Good Meals","titleSlug":"count-good-meals"},{"acceptance":0.30723905723905726,"acs":16790,"articleLive":0,"columnArticles":0,"formTitle":"[1712]Ways to Split Array Into Three Subarrays","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":54648,"title":"Ways to Split Array Into Three Subarrays","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4824056779977587,"acs":6457,"articleLive":0,"columnArticles":0,"formTitle":"[1713]Minimum Operations to Make a Subsequence","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"","submitted":13385,"title":"Minimum Operations to Make a Subsequence","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.5183927560837578,"acs":916,"articleLive":0,"columnArticles":0,"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":1767,"title":"Sum Of Special Evenly-Spaced Elements In Array","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7786823781467596,"acs":7269,"articleLive":0,"columnArticles":0,"formTitle":"[1715]Count Apples and Oranges","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":9335,"title":"Count Apples and Oranges","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6464214899442923,"acs":27385,"articleLive":0,"columnArticles":0,"formTitle":"[1716]Calculate Money in Leetcode Bank","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":42364,"title":"Calculate Money in Leetcode Bank","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43935047638561625,"acs":8577,"articleLive":0,"columnArticles":0,"formTitle":"[1717]Maximum Score From Removing Substrings","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":19522,"title":"Maximum Score From Removing Substrings","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.5079785595465467,"acs":8245,"articleLive":0,"columnArticles":0,"formTitle":"[1718]Construct the Lexicographically Largest Valid Sequence","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":16231,"title":"Construct the Lexicographically Largest Valid Sequence","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.4095556794943298,"acs":2203,"articleLive":0,"columnArticles":0,"formTitle":"[1719]Number Of Ways To Reconstruct A Tree","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":5379,"title":"Number Of Ways To Reconstruct A Tree","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8593389155721795,"acs":60653,"articleLive":0,"columnArticles":0,"formTitle":"[1720]Decode XORed Array","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"","submitted":70581,"title":"Decode XORed Array","titleSlug":"decode-xored-array"},{"acceptance":0.6562268696573443,"acs":90432,"articleLive":1,"articleSlug":"swapping-nodes-in-a-linked-list","columnArticles":1,"formTitle":"[1721]Swapping Nodes in a Linked List","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"","submitted":137806,"title":"Swapping Nodes in a Linked List","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.4717834884316571,"acs":11052,"articleLive":0,"columnArticles":0,"formTitle":"[1722]Minimize Hamming Distance After Swap Operations","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":23426,"title":"Minimize Hamming Distance After Swap Operations","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.425938731761289,"acs":12319,"articleLive":0,"columnArticles":0,"formTitle":"[1723]Find Minimum Time to Finish All Jobs","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"","submitted":28922,"title":"Find Minimum Time to Finish All Jobs","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5385427666314678,"acs":1530,"articleLive":0,"columnArticles":0,"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":2841,"title":"Checking Existence of Edge Length Limited Paths II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7874526544876221,"acs":37630,"articleLive":0,"columnArticles":0,"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":47787,"title":"Number Of Rectangles That Can Form The Largest Square","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.602324774462179,"acs":17359,"articleLive":0,"columnArticles":0,"formTitle":"[1726]Tuple with Same Product","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":28820,"title":"Tuple with Same Product","titleSlug":"tuple-with-same-product"},{"acceptance":0.6016282373511092,"acs":11011,"articleLive":0,"columnArticles":0,"formTitle":"[1727]Largest Submatrix With Rearrangements","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":18302,"title":"Largest Submatrix With Rearrangements","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.4043153861665658,"acs":4010,"articleLive":0,"columnArticles":0,"formTitle":"[1728]Cat and Mouse II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":9918,"title":"Cat and Mouse II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.7141071707545696,"acs":9142,"articleLive":0,"columnArticles":0,"formTitle":"[1729]Find Followers Count","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":12802,"title":"Find Followers Count","titleSlug":"find-followers-count"},{"acceptance":0.5436745165428274,"acs":22463,"articleLive":0,"columnArticles":0,"formTitle":"[1730]Shortest Path to Get Food","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":41317,"title":"Shortest Path to Get Food","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.48825503355704697,"acs":8148,"articleLive":0,"columnArticles":0,"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":16688,"title":"The Number of Employees Which Report to Each Employee","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7896338396539584,"acs":62798,"articleLive":0,"columnArticles":0,"formTitle":"[1732]Find the Highest Altitude","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":79528,"title":"Find the Highest Altitude","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4047249647390691,"acs":5739,"articleLive":0,"columnArticles":0,"formTitle":"[1733]Minimum Number of People to Teach","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":14180,"title":"Minimum Number of People to Teach","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.5983739837398374,"acs":8464,"articleLive":0,"columnArticles":0,"formTitle":"[1734]Decode XORed Permutation","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"","submitted":14145,"title":"Decode XORed Permutation","titleSlug":"decode-xored-permutation"},{"acceptance":0.4950462887770018,"acs":3048,"articleLive":0,"columnArticles":0,"formTitle":"[1735]Count Ways to Make Array With Product","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":6157,"title":"Count Ways to Make Array With Product","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4191569484936832,"acs":20703,"articleLive":0,"columnArticles":0,"formTitle":"[1736]Latest Time by Replacing Hidden Digits","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"","submitted":49392,"title":"Latest Time by Replacing Hidden Digits","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.33222630767406003,"acs":8403,"articleLive":0,"columnArticles":0,"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":25293,"title":"Change Minimum Characters to Satisfy One of Three Conditions","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6252065920574208,"acs":13240,"articleLive":0,"columnArticles":0,"formTitle":"[1738]Find Kth Largest XOR Coordinate Value","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"","submitted":21177,"title":"Find Kth Largest XOR Coordinate Value","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.5058939096267191,"acs":4635,"articleLive":0,"columnArticles":0,"formTitle":"[1739]Building Boxes","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":9162,"title":"Building Boxes","titleSlug":"building-boxes"},{"acceptance":0.6841660910277074,"acs":8914,"articleLive":0,"columnArticles":0,"formTitle":"[1740]Find Distance in a Binary Tree","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":13029,"title":"Find Distance in a Binary Tree","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.9131374793335877,"acs":14360,"articleLive":0,"columnArticles":0,"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":15726,"title":"Find Total Time Spent by Each Employee","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.735611734039472,"acs":35558,"articleLive":0,"columnArticles":0,"formTitle":"[1742]Maximum Number of Balls in a Box","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":48338,"title":"Maximum Number of Balls in a Box","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6784522003034902,"acs":22355,"articleLive":0,"columnArticles":0,"formTitle":"[1743]Restore the Array From Adjacent Pairs","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"","submitted":32950,"title":"Restore the Array From Adjacent Pairs","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3202996064491558,"acs":7569,"articleLive":0,"columnArticles":0,"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":23631,"title":"Can You Eat Your Favorite Candy on Your Favorite Day?","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4941534228722441,"acs":13650,"articleLive":0,"columnArticles":0,"formTitle":"[1745]Palindrome Partitioning IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":27623,"title":"Palindrome Partitioning IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6190476190476191,"acs":4615,"articleLive":0,"columnArticles":0,"formTitle":"[1746]Maximum Subarray Sum After One Operation","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":7455,"title":"Maximum Subarray Sum After One Operation","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6737713398861873,"acs":6512,"articleLive":0,"columnArticles":0,"formTitle":"[1747]Leetflex Banned Accounts","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":9665,"title":"Leetflex Banned Accounts","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7534475166291978,"acs":65018,"articleLive":0,"columnArticles":0,"formTitle":"[1748]Sum of Unique Elements","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":86294,"title":"Sum of Unique Elements","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5652173913043478,"acs":18967,"articleLive":0,"columnArticles":0,"formTitle":"[1749]Maximum Absolute Sum of Any Subarray","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":33557,"title":"Maximum Absolute Sum of Any Subarray","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4287460942806684,"acs":12624,"articleLive":0,"columnArticles":0,"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":29444,"title":"Minimum Length of String After Deleting Similar Ends","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.5454268822813424,"acs":12547,"articleLive":0,"columnArticles":0,"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":23004,"title":"Maximum Number of Events That Can Be Attended II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.46953123722633705,"acs":28717,"articleLive":0,"columnArticles":0,"formTitle":"[1752]Check if Array Is Sorted and Rotated","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":61161,"title":"Check if Array Is Sorted and Rotated","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6461045531197301,"acs":19157,"articleLive":0,"columnArticles":0,"formTitle":"[1753]Maximum Score From Removing Stones","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":29650,"title":"Maximum Score From Removing Stones","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4340690063480578,"acs":13197,"articleLive":0,"columnArticles":0,"formTitle":"[1754]Largest Merge Of Two Strings","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":30403,"title":"Largest Merge Of Two Strings","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.3644619759655078,"acs":7946,"articleLive":0,"columnArticles":0,"formTitle":"[1755]Closest Subsequence Sum","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":21802,"title":"Closest Subsequence Sum","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7846338948092128,"acs":4565,"articleLive":0,"columnArticles":0,"formTitle":"[1756]Design Most Recently Used Queue","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":5818,"title":"Design Most Recently Used Queue","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9583139180615793,"acs":26736,"articleLive":0,"columnArticles":0,"formTitle":"[1757]Recyclable and Low Fat Products","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":27899,"title":"Recyclable and Low Fat Products","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.5912335070667231,"acs":25183,"articleLive":0,"columnArticles":0,"formTitle":"[1758]Minimum Changes To Make Alternating Binary String","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":42594,"title":"Minimum Changes To Make Alternating Binary String","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4558337919647771,"acs":16565,"articleLive":0,"columnArticles":0,"formTitle":"[1759]Count Number of Homogenous Substrings","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":36340,"title":"Count Number of Homogenous Substrings","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.562719073687527,"acs":14288,"articleLive":0,"columnArticles":0,"formTitle":"[1760]Minimum Limit of Balls in a Bag","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":25391,"title":"Minimum Limit of Balls in a Bag","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.41332125339748194,"acs":13230,"articleLive":0,"columnArticles":0,"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":32009,"title":"Minimum Degree of a Connected Trio in a Graph","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.8070506005326372,"acs":76669,"articleLive":1,"articleSlug":"buildings-with-an-ocean-view","columnArticles":1,"formTitle":"[1762]Buildings With an Ocean View","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":94999,"title":"Buildings With an Ocean View","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6189665692539902,"acs":19274,"articleLive":0,"columnArticles":0,"formTitle":"[1763]Longest Nice Substring","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":31139,"title":"Longest Nice Substring","titleSlug":"longest-nice-substring"},{"acceptance":0.5295719420542424,"acs":9724,"articleLive":0,"columnArticles":0,"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":18362,"title":"Form Array by Concatenating Subarrays of Another Array","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5930468718888137,"acs":14892,"articleLive":0,"columnArticles":0,"formTitle":"[1765]Map of Highest Peak","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":25111,"title":"Map of Highest Peak","titleSlug":"map-of-highest-peak"},{"acceptance":0.3800466130366138,"acs":5055,"articleLive":0,"columnArticles":0,"formTitle":"[1766]Tree of Coprimes","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":13301,"title":"Tree of Coprimes","titleSlug":"tree-of-coprimes"},{"acceptance":0.86529284164859,"acs":3989,"articleLive":0,"columnArticles":0,"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":4610,"title":"Find the Subtasks That Did Not Execute","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7463230867149467,"acs":43386,"articleLive":0,"columnArticles":0,"formTitle":"[1768]Merge Strings Alternately","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":58133,"title":"Merge Strings Alternately","titleSlug":"merge-strings-alternately"},{"acceptance":0.8564522324207626,"acs":64663,"articleLive":0,"columnArticles":0,"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":75501,"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.35130320508140467,"acs":24059,"articleLive":0,"columnArticles":0,"formTitle":"[1770]Maximum Score from Performing Multiplication Operations","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":68485,"title":"Maximum Score from Performing Multiplication Operations","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3471894900466329,"acs":6924,"articleLive":0,"columnArticles":0,"formTitle":"[1771]Maximize Palindrome Length From Subsequences","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":19943,"title":"Maximize Palindrome Length From Subsequences","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.6548315513415373,"acs":3246,"articleLive":0,"columnArticles":0,"formTitle":"[1772]Sort Features by Popularity","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":4957,"title":"Sort Features by Popularity","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8454559463728474,"acs":87782,"articleLive":0,"columnArticles":0,"formTitle":"[1773]Count Items Matching a Rule","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":103828,"title":"Count Items Matching a Rule","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.45747507159369283,"acs":13259,"articleLive":0,"columnArticles":0,"formTitle":"[1774]Closest Dessert Cost","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":28983,"title":"Closest Dessert Cost","titleSlug":"closest-dessert-cost"},{"acceptance":0.5119889861945007,"acs":13388,"articleLive":0,"columnArticles":0,"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":26149,"title":"Equal Sum Arrays With Minimum Number of Operations","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.5243059801883331,"acs":17149,"articleLive":0,"columnArticles":0,"formTitle":"[1776]Car Fleet II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":32708,"title":"Car Fleet II","titleSlug":"car-fleet-ii"},{"acceptance":0.8585317991258585,"acs":9625,"articleLive":0,"columnArticles":0,"formTitle":"[1777]Product's Price for Each Store","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":11211,"title":"Product's Price for Each Store","titleSlug":"products-price-for-each-store"},{"acceptance":0.42113840065184494,"acs":3618,"articleLive":0,"columnArticles":0,"formTitle":"[1778]Shortest Path in a Hidden Grid","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":8591,"title":"Shortest Path in a Hidden Grid","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6819123813195817,"acs":28298,"articleLive":0,"columnArticles":0,"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":41498,"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.6446819776292276,"acs":19481,"articleLive":0,"columnArticles":0,"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":30218,"title":"Check if Number is a Sum of Powers of Three","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5988015055467512,"acs":12091,"articleLive":0,"columnArticles":0,"formTitle":"[1781]Sum of Beauty of All Substrings","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":20192,"title":"Sum of Beauty of All Substrings","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.37051005747126436,"acs":4126,"articleLive":0,"columnArticles":0,"formTitle":"[1782]Count Pairs Of Nodes","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":11136,"title":"Count Pairs Of Nodes","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.8959354575163399,"acs":8773,"articleLive":0,"columnArticles":0,"formTitle":"[1783]Grand Slam Titles","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":9792,"title":"Grand Slam Titles","titleSlug":"grand-slam-titles"},{"acceptance":0.40957913810173163,"acs":21926,"articleLive":0,"columnArticles":0,"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":53533,"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.41234369196483844,"acs":13322,"articleLive":0,"columnArticles":0,"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":32308,"title":"Minimum Elements to Add to Form a Given Sum","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3785342948180446,"acs":11286,"articleLive":0,"columnArticles":0,"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":29815,"title":"Number of Restricted Paths From First to Last Node","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.3911392405063291,"acs":3399,"articleLive":0,"columnArticles":0,"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":8690,"title":"Make the XOR of All Segments Equal to Zero","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6672043010752688,"acs":1241,"articleLive":0,"columnArticles":0,"formTitle":"[1788]Maximize the Beauty of the Garden","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":1860,"title":"Maximize the Beauty of the Garden","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7892531685346182,"acs":7535,"articleLive":0,"columnArticles":0,"formTitle":"[1789]Primary Department for Each Employee","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":9547,"title":"Primary Department for Each Employee","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.4559536006390331,"acs":26257,"articleLive":0,"columnArticles":0,"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":57587,"title":"Check if One String Swap Can Make Strings Equal","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8369017163011351,"acs":67389,"articleLive":0,"columnArticles":0,"formTitle":"[1791]Find Center of Star Graph","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":80522,"title":"Find Center of Star Graph","titleSlug":"find-center-of-star-graph"},{"acceptance":0.500623030125339,"acs":13660,"articleLive":0,"columnArticles":0,"formTitle":"[1792]Maximum Average Pass Ratio","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":27286,"title":"Maximum Average Pass Ratio","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.5105837883242336,"acs":12157,"articleLive":0,"columnArticles":0,"formTitle":"[1793]Maximum Score of a Good Subarray","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":23810,"title":"Maximum Score of a Good Subarray","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6500286861732645,"acs":1133,"articleLive":0,"columnArticles":0,"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":1743,"title":"Count Pairs of Equal Substrings With Minimum Difference","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.9017810644724508,"acs":8658,"articleLive":0,"columnArticles":0,"formTitle":"[1795]Rearrange Products Table","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":9601,"title":"Rearrange Products Table","titleSlug":"rearrange-products-table"},{"acceptance":0.4886106271777004,"acs":22437,"articleLive":0,"columnArticles":0,"formTitle":"[1796]Second Largest Digit in a String","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"","submitted":45920,"title":"Second Largest Digit in a String","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5237875288683603,"acs":9072,"articleLive":0,"columnArticles":0,"formTitle":"[1797]Design Authentication Manager","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"","submitted":17320,"title":"Design Authentication Manager","titleSlug":"design-authentication-manager"},{"acceptance":0.5063710645105994,"acs":8862,"articleLive":0,"columnArticles":0,"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":17501,"title":"Maximum Number of Consecutive Values You Can Make","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.462589124645649,"acs":10770,"articleLive":0,"columnArticles":0,"formTitle":"[1799]Maximize Score After N Operations","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":23282,"title":"Maximize Score After N Operations","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6482994673030106,"acs":26896,"articleLive":0,"columnArticles":0,"formTitle":"[1800]Maximum Ascending Subarray Sum","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"","submitted":41487,"title":"Maximum Ascending Subarray Sum","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.4552162415763883,"acs":10673,"articleLive":0,"columnArticles":0,"formTitle":"[1801]Number of Orders in the Backlog","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"","submitted":23446,"title":"Number of Orders in the Backlog","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.29608687271091694,"acs":9216,"articleLive":0,"columnArticles":0,"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":31126,"title":"Maximum Value at a Given Index in a Bounded Array","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.461816634758562,"acs":4342,"articleLive":0,"columnArticles":0,"formTitle":"[1803]Count Pairs With XOR in a Range","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"","submitted":9402,"title":"Count Pairs With XOR in a Range","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5883383626983354,"acs":6044,"articleLive":0,"columnArticles":0,"formTitle":"[1804]Implement Trie II (Prefix Tree)","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":10273,"title":"Implement Trie II (Prefix Tree)","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.3539559694129255,"acs":22959,"articleLive":0,"columnArticles":0,"formTitle":"[1805]Number of Different Integers in a String","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":64864,"title":"Number of Different Integers in a String","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.7086600652509873,"acs":12381,"articleLive":0,"columnArticles":0,"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":17471,"title":"Minimum Number of Operations to Reinitialize a Permutation","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.666872730082683,"acs":17260,"articleLive":0,"columnArticles":0,"formTitle":"[1807]Evaluate the Bracket Pairs of a String","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":25882,"title":"Evaluate the Bracket Pairs of a String","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2978377279197451,"acs":4394,"articleLive":0,"columnArticles":0,"formTitle":"[1808]Maximize Number of Nice Divisors","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":14753,"title":"Maximize Number of Nice Divisors","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6013217678645187,"acs":7279,"articleLive":0,"columnArticles":0,"formTitle":"[1809]Ad-Free Sessions","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":12105,"title":"Ad-Free Sessions","titleSlug":"ad-free-sessions"},{"acceptance":0.5359583468922877,"acs":1647,"articleLive":0,"columnArticles":0,"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":3073,"title":"Minimum Path Cost in a Hidden Grid","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6530192367040428,"acs":6348,"articleLive":0,"columnArticles":0,"formTitle":"[1811]Find Interview Candidates","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":9721,"title":"Find Interview Candidates","titleSlug":"find-interview-candidates"},{"acceptance":0.7756117494351233,"acs":32267,"articleLive":0,"columnArticles":0,"formTitle":"[1812]Determine Color of a Chessboard Square","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"","submitted":41602,"title":"Determine Color of a Chessboard Square","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.32130678693213066,"acs":8763,"articleLive":0,"columnArticles":0,"formTitle":"[1813]Sentence Similarity III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"","submitted":27273,"title":"Sentence Similarity III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.39890828347622276,"acs":12935,"articleLive":0,"columnArticles":0,"formTitle":"[1814]Count Nice Pairs in an Array","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"","submitted":32426,"title":"Count Nice Pairs in an Array","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.4000408413314274,"acs":3918,"articleLive":0,"columnArticles":0,"formTitle":"[1815]Maximum Number of Groups Getting Fresh Donuts","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":9794,"title":"Maximum Number of Groups Getting Fresh Donuts","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.8092151835013922,"acs":51441,"articleLive":0,"columnArticles":0,"formTitle":"[1816]Truncate Sentence","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"","submitted":63569,"title":"Truncate Sentence","titleSlug":"truncate-sentence"},{"acceptance":0.803728638011393,"acs":27936,"articleLive":0,"columnArticles":0,"formTitle":"[1817]Finding the Users Active Minutes","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"","submitted":34758,"title":"Finding the Users Active Minutes","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.28758123929518314,"acs":12257,"articleLive":0,"columnArticles":0,"formTitle":"[1818]Minimum Absolute Sum Difference","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"","submitted":42621,"title":"Minimum Absolute Sum Difference","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3671966412003579,"acs":5335,"articleLive":0,"columnArticles":0,"formTitle":"[1819]Number of Different Subsequences GCDs","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":14529,"title":"Number of Different Subsequences GCDs","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.4582723279648609,"acs":939,"articleLive":0,"columnArticles":0,"formTitle":"[1820]Maximum Number of Accepted Invitations","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":2049,"title":"Maximum Number of Accepted Invitations","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.8978328173374613,"acs":8120,"articleLive":0,"columnArticles":0,"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":9044,"title":"Find Customers With Positive Revenue this Year","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.6736006666395675,"acs":66285,"articleLive":0,"columnArticles":0,"formTitle":"[1822]Sign of the Product of an Array","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":98404,"title":"Sign of the Product of an Array","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7576808181243322,"acs":34748,"articleLive":0,"columnArticles":0,"formTitle":"[1823]Find the Winner of the Circular Game","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":45861,"title":"Find the Winner of the Circular Game","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.4921467674661105,"acs":15103,"articleLive":0,"columnArticles":0,"formTitle":"[1824]Minimum Sideway Jumps","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":30688,"title":"Minimum Sideway Jumps","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.3285966186080282,"acs":6336,"articleLive":0,"columnArticles":0,"formTitle":"[1825]Finding MK Average","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":19282,"title":"Finding MK Average","titleSlug":"finding-mk-average"},{"acceptance":0.5028815368196371,"acs":2356,"articleLive":0,"columnArticles":0,"formTitle":"[1826]Faulty Sensor","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":4685,"title":"Faulty Sensor","titleSlug":"faulty-sensor"},{"acceptance":0.7824329526498139,"acs":36585,"articleLive":0,"columnArticles":0,"formTitle":"[1827]Minimum Operations to Make the Array Increasing","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"","submitted":46758,"title":"Minimum Operations to Make the Array Increasing","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8656275125139404,"acs":33376,"articleLive":0,"columnArticles":0,"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":38557,"title":"Queries on Number of Points Inside a Circle","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.7580618759207727,"acs":13893,"articleLive":0,"columnArticles":0,"formTitle":"[1829]Maximum XOR for Each Query","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"","submitted":18327,"title":"Maximum XOR for Each Query","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.47701667417755744,"acs":2117,"articleLive":0,"columnArticles":0,"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":4438,"title":"Minimum Number of Operations to Make String Sorted","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.8348264277715566,"acs":5964,"articleLive":0,"columnArticles":0,"formTitle":"[1831]Maximum Transaction Each Day","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":7144,"title":"Maximum Transaction Each Day","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8147625598156444,"acs":69298,"articleLive":0,"columnArticles":0,"formTitle":"[1832]Check if the Sentence Is Pangram","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"","submitted":85053,"title":"Check if the Sentence Is Pangram","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6457957495489945,"acs":29354,"articleLive":0,"columnArticles":0,"formTitle":"[1833]Maximum Ice Cream Bars","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"","submitted":45454,"title":"Maximum Ice Cream Bars","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.4002053892995068,"acs":27669,"articleLive":0,"columnArticles":0,"formTitle":"[1834]Single-Threaded CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":69137,"title":"Single-Threaded CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5844773603082851,"acs":9707,"articleLive":0,"columnArticles":0,"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":16608,"title":"Find XOR Sum of All Pairs Bitwise AND","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.6941083261307981,"acs":9637,"articleLive":0,"columnArticles":0,"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":13884,"title":"Remove Duplicates From an Unsorted Linked List","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7610857540126349,"acs":25179,"articleLive":0,"columnArticles":0,"formTitle":"[1837]Sum of Digits in Base K","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"","submitted":33083,"title":"Sum of Digits in Base K","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.35996122935261093,"acs":17826,"articleLive":0,"columnArticles":0,"formTitle":"[1838]Frequency of the Most Frequent Element","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"","submitted":49522,"title":"Frequency of the Most Frequent Element","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.4771400085457912,"acs":16750,"articleLive":0,"columnArticles":0,"formTitle":"[1839]Longest Substring Of All Vowels in Order","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"","submitted":35105,"title":"Longest Substring Of All Vowels in Order","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.34858915197821316,"acs":4608,"articleLive":0,"columnArticles":0,"formTitle":"[1840]Maximum Building Height","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"","submitted":13219,"title":"Maximum Building Height","titleSlug":"maximum-building-height"},{"acceptance":0.5955882352941176,"acs":4131,"articleLive":0,"columnArticles":0,"formTitle":"[1841]League Statistics","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":6936,"title":"League Statistics","titleSlug":"league-statistics"},{"acceptance":0.5966883500887049,"acs":1009,"articleLive":0,"columnArticles":0,"formTitle":"[1842]Next Palindrome Using Same Digits","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":1691,"title":"Next Palindrome Using Same Digits","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.48766624985790613,"acs":4290,"articleLive":0,"columnArticles":0,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":8797,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8021722985518009,"acs":34564,"articleLive":0,"columnArticles":0,"formTitle":"[1844]Replace All Digits with Characters","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":43088,"title":"Replace All Digits with Characters","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5953674245363545,"acs":15345,"articleLive":0,"columnArticles":0,"formTitle":"[1845]Seat Reservation Manager","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":25774,"title":"Seat Reservation Manager","titleSlug":"seat-reservation-manager"},{"acceptance":0.5699196111422696,"acs":12194,"articleLive":0,"columnArticles":0,"formTitle":"[1846]Maximum Element After Decreasing and Rearranging","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"","submitted":21396,"title":"Maximum Element After Decreasing and Rearranging","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3278059565613214,"acs":5041,"articleLive":0,"columnArticles":0,"formTitle":"[1847]Closest Room","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":15378,"title":"Closest Room","titleSlug":"closest-room"},{"acceptance":0.5979840293232098,"acs":22840,"articleLive":0,"columnArticles":0,"formTitle":"[1848]Minimum Distance to the Target Element","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":38195,"title":"Minimum Distance to the Target Element","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.30338052585957814,"acs":12600,"articleLive":0,"columnArticles":0,"formTitle":"[1849]Splitting a String Into Descending Consecutive Values","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":41532,"title":"Splitting a String Into Descending Consecutive Values","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.72610188895249,"acs":12685,"articleLive":0,"columnArticles":0,"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":17470,"title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4539756852676886,"acs":6012,"articleLive":0,"columnArticles":0,"formTitle":"[1851]Minimum Interval to Include Each Query","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":13243,"title":"Minimum Interval to Include Each Query","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.732838172406032,"acs":3256,"articleLive":0,"columnArticles":0,"formTitle":"[1852]Distinct Numbers in Each Subarray","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":4443,"title":"Distinct Numbers in Each Subarray","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.876483798524222,"acs":5464,"articleLive":0,"columnArticles":0,"formTitle":"[1853]Convert Date Format","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":6234,"title":"Convert Date Format","titleSlug":"convert-date-format"},{"acceptance":0.5838739360478491,"acs":25381,"articleLive":0,"columnArticles":0,"formTitle":"[1854]Maximum Population Year","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"","submitted":43470,"title":"Maximum Population Year","titleSlug":"maximum-population-year"},{"acceptance":0.4868073166783575,"acs":18044,"articleLive":0,"columnArticles":0,"formTitle":"[1855]Maximum Distance Between a Pair of Values","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"","submitted":37066,"title":"Maximum Distance Between a Pair of Values","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3504742390693678,"acs":10605,"articleLive":0,"columnArticles":0,"formTitle":"[1856]Maximum Subarray Min-Product","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"","submitted":30259,"title":"Maximum Subarray Min-Product","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.393687639991855,"acs":9667,"articleLive":0,"columnArticles":0,"formTitle":"[1857]Largest Color Value in a Directed Graph","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":24555,"title":"Largest Color Value in a Directed Graph","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6596244131455399,"acs":3091,"articleLive":0,"columnArticles":0,"formTitle":"[1858]Longest Word With All Prefixes","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":4686,"title":"Longest Word With All Prefixes","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.8444759391392174,"acs":51839,"articleLive":0,"columnArticles":0,"formTitle":"[1859]Sorting the Sentence","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"","submitted":61386,"title":"Sorting the Sentence","titleSlug":"sorting-the-sentence"},{"acceptance":0.7073426789353424,"acs":11454,"articleLive":0,"columnArticles":0,"formTitle":"[1860]Incremental Memory Leak","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"","submitted":16193,"title":"Incremental Memory Leak","titleSlug":"incremental-memory-leak"},{"acceptance":0.6418831928838952,"acs":21937,"articleLive":0,"columnArticles":0,"formTitle":"[1861]Rotating the Box","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"","submitted":34176,"title":"Rotating the Box","titleSlug":"rotating-the-box"},{"acceptance":0.2774792869696209,"acs":5526,"articleLive":0,"columnArticles":0,"formTitle":"[1862]Sum of Floored Pairs","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"","submitted":19915,"title":"Sum of Floored Pairs","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.7842812594861606,"acs":28420,"articleLive":0,"columnArticles":0,"formTitle":"[1863]Sum of All Subset XOR Totals","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":36237,"title":"Sum of All Subset XOR Totals","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3798692067102644,"acs":12024,"articleLive":0,"columnArticles":0,"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":31653,"title":"Minimum Number of Swaps to Make the Binary String Alternating","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.48342065731139855,"acs":13194,"articleLive":0,"columnArticles":0,"formTitle":"[1865]Finding Pairs With a Certain Sum","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"","submitted":27293,"title":"Finding Pairs With a Certain Sum","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5522566206639313,"acs":7403,"articleLive":0,"columnArticles":0,"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":13405,"title":"Number of Ways to Rearrange Sticks With K Sticks Visible","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7650899593731864,"acs":5273,"articleLive":0,"columnArticles":0,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":6892,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5843794796055776,"acs":13453,"articleLive":0,"columnArticles":0,"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":23021,"title":"Product of Two Run-Length Encoded Arrays","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.5999124585329894,"acs":26041,"articleLive":0,"columnArticles":0,"formTitle":"[1869]Longer Contiguous Segments of Ones than Zeros","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"","submitted":43408,"title":"Longer Contiguous Segments of Ones than Zeros","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.3484473695834622,"acs":15777,"articleLive":0,"columnArticles":0,"formTitle":"[1870]Minimum Speed to Arrive on Time","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"","submitted":45278,"title":"Minimum Speed to Arrive on Time","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.24656460044809558,"acs":19809,"articleLive":0,"columnArticles":0,"formTitle":"[1871]Jump Game VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"","submitted":80340,"title":"Jump Game VII","titleSlug":"jump-game-vii"},{"acceptance":0.5239114917915775,"acs":5138,"articleLive":0,"columnArticles":0,"formTitle":"[1872]Stone Game VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":9807,"title":"Stone Game VIII","titleSlug":"stone-game-viii"},{"acceptance":0.9106313543366387,"acs":7255,"articleLive":0,"columnArticles":0,"formTitle":"[1873]Calculate Special Bonus","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":7967,"title":"Calculate Special Bonus","titleSlug":"calculate-special-bonus"},{"acceptance":0.8954038526529233,"acs":5299,"articleLive":0,"columnArticles":0,"formTitle":"[1874]Minimize Product Sum of Two Arrays","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":5918,"title":"Minimize Product Sum of Two Arrays","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7537431742117315,"acs":4279,"articleLive":0,"columnArticles":0,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":5677,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.6946412201016752,"acs":33340,"articleLive":0,"columnArticles":0,"formTitle":"[1876]Substrings of Size Three with Distinct Characters","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"","submitted":47996,"title":"Substrings of Size Three with Distinct Characters","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8056194224698959,"acs":41346,"articleLive":0,"columnArticles":0,"formTitle":"[1877]Minimize Maximum Pair Sum in Array","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"","submitted":51322,"title":"Minimize Maximum Pair Sum in Array","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.443733303650935,"acs":7973,"articleLive":0,"columnArticles":0,"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":17968,"title":"Get Biggest Three Rhombus Sums in a Grid","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40223396588998317,"acs":6698,"articleLive":0,"columnArticles":0,"formTitle":"[1879]Minimum XOR Sum of Two Arrays","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":16652,"title":"Minimum XOR Sum of Two Arrays","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7304342627100066,"acs":36651,"articleLive":0,"columnArticles":0,"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":50177,"title":"Check if Word Equals Summation of Two Words","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35272393522868817,"acs":16141,"articleLive":0,"columnArticles":0,"formTitle":"[1881]Maximum Value after Insertion","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"","submitted":45761,"title":"Maximum Value after Insertion","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.3666741143467143,"acs":14770,"articleLive":0,"columnArticles":0,"formTitle":"[1882]Process Tasks Using Servers","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"","submitted":40281,"title":"Process Tasks Using Servers","titleSlug":"process-tasks-using-servers"},{"acceptance":0.38624194573010256,"acs":4256,"articleLive":0,"columnArticles":0,"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":11019,"title":"Minimum Skips to Arrive at Meeting On Time","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6997761129768363,"acs":16253,"articleLive":0,"columnArticles":0,"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":23226,"title":"Egg Drop With 2 Eggs and N Floors","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5779816513761468,"acs":1701,"articleLive":0,"columnArticles":0,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":2943,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5474062846413139,"acs":24197,"articleLive":0,"columnArticles":0,"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":44203,"title":"Determine Whether Matrix Can Be Obtained By Rotation","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6114624661193385,"acs":15566,"articleLive":0,"columnArticles":0,"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":25457,"title":"Reduction Operations to Make the Array Elements Equal","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3594631058221192,"acs":10391,"articleLive":0,"columnArticles":0,"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":28907,"title":"Minimum Number of Flips to Make the Binary String Alternating","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2990599540421976,"acs":7158,"articleLive":0,"columnArticles":0,"formTitle":"[1889]Minimum Space Wasted From Packaging","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":23935,"title":"Minimum Space Wasted From Packaging","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.8423236514522822,"acs":5481,"articleLive":0,"columnArticles":0,"formTitle":"[1890]The Latest Login in 2020","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":6507,"title":"The Latest Login in 2020","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.4908120441673797,"acs":24092,"articleLive":0,"columnArticles":0,"formTitle":"[1891]Cutting Ribbons","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":49086,"title":"Cutting Ribbons","titleSlug":"cutting-ribbons"},{"acceptance":0.4416289592760181,"acs":2928,"articleLive":0,"columnArticles":0,"formTitle":"[1892]Page Recommendations II","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":6630,"title":"Page Recommendations II","titleSlug":"page-recommendations-ii"},{"acceptance":0.5087425343891036,"acs":18825,"articleLive":0,"columnArticles":0,"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":37003,"title":"Check if All the Integers in a Range Are Covered","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.40783939886726855,"acs":14546,"articleLive":0,"columnArticles":0,"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":35666,"title":"Find the Student that Will Replace the Chalk","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5092135809634358,"acs":7019,"articleLive":0,"columnArticles":0,"formTitle":"[1895]Largest Magic Square","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"","submitted":13784,"title":"Largest Magic Square","titleSlug":"largest-magic-square"},{"acceptance":0.5251681744374855,"acs":2264,"articleLive":0,"columnArticles":0,"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":4311,"title":"Minimum Cost to Change the Final Value of Expression","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5996418445008208,"acs":20091,"articleLive":0,"columnArticles":0,"formTitle":"[1897]Redistribute Characters to Make All Strings Equal","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"","submitted":33505,"title":"Redistribute Characters to Make All Strings Equal","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.34970421493714565,"acs":11350,"articleLive":0,"columnArticles":0,"formTitle":"[1898]Maximum Number of Removable Characters","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"","submitted":32456,"title":"Maximum Number of Removable Characters","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6073262581307771,"acs":12418,"articleLive":0,"columnArticles":0,"formTitle":"[1899]Merge Triplets to Form Target Triplet","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":20447,"title":"Merge Triplets to Form Target Triplet","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.5124232272473479,"acs":3671,"articleLive":0,"columnArticles":0,"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":7164,"title":"The Earliest and Latest Rounds Where Players Compete","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.5398369003407482,"acs":14100,"articleLive":0,"columnArticles":0,"formTitle":"[1901]Find a Peak Element II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":26119,"title":"Find a Peak Element II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4731396736967768,"acs":1189,"articleLive":0,"columnArticles":0,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":2513,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.5703557152662817,"acs":28252,"articleLive":0,"columnArticles":0,"formTitle":"[1903]Largest Odd Number in String","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":49534,"title":"Largest Odd Number in String","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.47633360754287163,"acs":15055,"articleLive":0,"columnArticles":0,"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":31606,"title":"The Number of Full Rounds You Have Played","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.6258086588703657,"acs":20121,"articleLive":0,"columnArticles":0,"formTitle":"[1905]Count Sub Islands","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":32152,"title":"Count Sub Islands","titleSlug":"count-sub-islands"},{"acceptance":0.4286060753046747,"acs":7069,"articleLive":0,"columnArticles":0,"formTitle":"[1906]Minimum Absolute Difference Queries","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":16493,"title":"Minimum Absolute Difference Queries","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6626196990424077,"acs":3875,"articleLive":0,"columnArticles":0,"formTitle":"[1907]Count Salary Categories","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":5848,"title":"Count Salary Categories","titleSlug":"count-salary-categories"},{"acceptance":0.5847578347578347,"acs":821,"articleLive":0,"columnArticles":0,"formTitle":"[1908]Game of Nim","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":1404,"title":"Game of Nim","titleSlug":"game-of-nim"},{"acceptance":0.27942688602662624,"acs":20653,"articleLive":0,"columnArticles":0,"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":73912,"title":"Remove One Element to Make the Array Strictly Increasing","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.7162153192619143,"acs":21581,"articleLive":0,"columnArticles":0,"formTitle":"[1910]Remove All Occurrences of a Substring","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"","submitted":30132,"title":"Remove All Occurrences of a Substring","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.585806165446884,"acs":13207,"articleLive":0,"columnArticles":0,"formTitle":"[1911]Maximum Alternating Subsequence Sum","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"","submitted":22545,"title":"Maximum Alternating Subsequence Sum","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.42884408922819994,"acs":3595,"articleLive":0,"columnArticles":0,"formTitle":"[1912]Design Movie Rental System","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8383,"title":"Design Movie Rental System","titleSlug":"design-movie-rental-system"},{"acceptance":0.813107454017425,"acs":41997,"articleLive":0,"columnArticles":0,"formTitle":"[1913]Maximum Product Difference Between Two Pairs","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"","submitted":51650,"title":"Maximum Product Difference Between Two Pairs","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4606540484841911,"acs":8494,"articleLive":0,"columnArticles":0,"formTitle":"[1914]Cyclically Rotating a Grid","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":18439,"title":"Cyclically Rotating a Grid","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.42942477876106194,"acs":7764,"articleLive":0,"columnArticles":0,"formTitle":"[1915]Number of Wonderful Substrings","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"","submitted":18080,"title":"Number of Wonderful Substrings","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.4833285426846795,"acs":3363,"articleLive":0,"columnArticles":0,"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":6958,"title":"Count Ways to Build Rooms in an Ant Colony","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.30344827586206896,"acs":2596,"articleLive":0,"columnArticles":0,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":8555,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5593275137407048,"acs":1730,"articleLive":0,"columnArticles":0,"formTitle":"[1918]Kth Smallest Subarray Sum","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":3093,"title":"Kth Smallest Subarray Sum","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.42245140817136057,"acs":2130,"articleLive":0,"columnArticles":0,"formTitle":"[1919]Leetcodify Similar Friends","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":5042,"title":"Leetcodify Similar Friends","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.917587044534413,"acs":113322,"articleLive":0,"columnArticles":0,"formTitle":"[1920]Build Array from Permutation","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"","submitted":123500,"title":"Build Array from Permutation","titleSlug":"build-array-from-permutation"},{"acceptance":0.37494947453516575,"acs":14842,"articleLive":0,"columnArticles":0,"formTitle":"[1921]Eliminate Maximum Number of Monsters","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"","submitted":39584,"title":"Eliminate Maximum Number of Monsters","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.38213023725391215,"acs":13626,"articleLive":0,"columnArticles":0,"formTitle":"[1922]Count Good Numbers","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":35658,"title":"Count Good Numbers","titleSlug":"count-good-numbers"},{"acceptance":0.28069133847879146,"acs":4255,"articleLive":0,"columnArticles":0,"formTitle":"[1923]Longest Common Subpath","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":15159,"title":"Longest Common Subpath","titleSlug":"longest-common-subpath"},{"acceptance":0.5925394548063128,"acs":413,"articleLive":0,"columnArticles":0,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"lock","submitted":697,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6701008409479777,"acs":18407,"articleLive":0,"columnArticles":0,"formTitle":"[1925]Count Square Sum Triples","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"","submitted":27469,"title":"Count Square Sum Triples","titleSlug":"count-square-sum-triples"},{"acceptance":0.37071763433104943,"acs":12336,"articleLive":0,"columnArticles":0,"formTitle":"[1926]Nearest Exit from Entrance in Maze","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"","submitted":33276,"title":"Nearest Exit from Entrance in Maze","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4675998741742686,"acs":5946,"articleLive":0,"columnArticles":0,"formTitle":"[1927]Sum Game","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"","submitted":12716,"title":"Sum Game","titleSlug":"sum-game"},{"acceptance":0.369992869426618,"acs":8821,"articleLive":0,"columnArticles":0,"formTitle":"[1928]Minimum Cost to Reach Destination in Time","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"","submitted":23841,"title":"Minimum Cost to Reach Destination in Time","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9174873495027046,"acs":131453,"articleLive":0,"columnArticles":0,"formTitle":"[1929]Concatenation of Array","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":143275,"title":"Concatenation of Array","titleSlug":"concatenation-of-array"},{"acceptance":0.5068643226402821,"acs":14805,"articleLive":0,"columnArticles":0,"formTitle":"[1930]Unique Length-3 Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":29209,"title":"Unique Length-3 Palindromic Subsequences","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5647932131495228,"acs":5326,"articleLive":0,"columnArticles":0,"formTitle":"[1931]Painting a Grid With Three Different Colors","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":9430,"title":"Painting a Grid With Three Different Colors","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3472938144329897,"acs":3773,"articleLive":0,"columnArticles":0,"formTitle":"[1932]Merge BSTs to Create Single BST","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":10864,"title":"Merge BSTs to Create Single BST","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5167199767374236,"acs":1777,"articleLive":0,"columnArticles":0,"formTitle":"[1933]Check if String Is Decomposable Into Value-Equal Substrings","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":3439,"title":"Check if String Is Decomposable Into Value-Equal Substrings","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7766839378238342,"acs":4497,"articleLive":0,"columnArticles":0,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":5790,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7166699613114569,"acs":25378,"articleLive":0,"columnArticles":0,"formTitle":"[1935]Maximum Number of Words You Can Type","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":35411,"title":"Maximum Number of Words You Can Type","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.42111295357003514,"acs":17269,"articleLive":0,"columnArticles":0,"formTitle":"[1936]Add Minimum Number of Rungs","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":41008,"title":"Add Minimum Number of Rungs","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.3453494326604318,"acs":25627,"articleLive":0,"columnArticles":0,"formTitle":"[1937]Maximum Number of Points with Cost","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":74206,"title":"Maximum Number of Points with Cost","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.39445300462249616,"acs":3072,"articleLive":0,"columnArticles":0,"formTitle":"[1938]Maximum Genetic Difference Query","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":7788,"title":"Maximum Genetic Difference Query","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6172442941673711,"acs":3651,"articleLive":0,"columnArticles":0,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":5915,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7965331059960216,"acs":2803,"articleLive":0,"columnArticles":0,"formTitle":"[1940]Longest Common Subsequence Between Sorted Arrays","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":3519,"title":"Longest Common Subsequence Between Sorted Arrays","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7699151495180823,"acs":28038,"articleLive":0,"columnArticles":0,"formTitle":"[1941]Check if All Characters Have Equal Number of Occurrences","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"","submitted":36417,"title":"Check if All Characters Have Equal Number of Occurrences","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38390961480133456,"acs":10126,"articleLive":0,"columnArticles":0,"formTitle":"[1942]The Number of the Smallest Unoccupied Chair","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"","submitted":26376,"title":"The Number of the Smallest Unoccupied Chair","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4585476239456902,"acs":6687,"articleLive":0,"columnArticles":0,"formTitle":"[1943]Describe the Painting","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"","submitted":14583,"title":"Describe the Painting","titleSlug":"describe-the-painting"},{"acceptance":0.6898001557228134,"acs":13289,"articleLive":0,"columnArticles":0,"formTitle":"[1944]Number of Visible People in a Queue","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":19265,"title":"Number of Visible People in a Queue","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6179315904641253,"acs":21462,"articleLive":0,"columnArticles":0,"formTitle":"[1945]Sum of Digits of String After Convert","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"","submitted":34732,"title":"Sum of Digits of String After Convert","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.33650027647916353,"acs":13388,"articleLive":0,"columnArticles":0,"formTitle":"[1946]Largest Number After Mutating Substring","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"","submitted":39786,"title":"Largest Number After Mutating Substring","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.591252522408372,"acs":12599,"articleLive":0,"columnArticles":0,"formTitle":"[1947]Maximum Compatibility Score Sum","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"","submitted":21309,"title":"Maximum Compatibility Score Sum","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.595323460639127,"acs":3819,"articleLive":0,"columnArticles":0,"formTitle":"[1948]Delete Duplicate Folders in System","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":6415,"title":"Delete Duplicate Folders in System","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5980066445182725,"acs":3420,"articleLive":0,"columnArticles":0,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":5719,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5116744496330887,"acs":767,"articleLive":0,"columnArticles":0,"formTitle":"[1950]Maximum of Minimum Values in All Subarrays","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":1499,"title":"Maximum of Minimum Values in All Subarrays","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7220403709765412,"acs":2647,"articleLive":0,"columnArticles":0,"formTitle":"[1951]All the Pairs With the Maximum Number of Common Followers","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":3666,"title":"All the Pairs With the Maximum Number of Common Followers","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.563248218963449,"acs":23007,"articleLive":0,"columnArticles":0,"formTitle":"[1952]Three Divisors","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"","submitted":40847,"title":"Three Divisors","titleSlug":"three-divisors"},{"acceptance":0.36693594922100403,"acs":12718,"articleLive":0,"columnArticles":0,"formTitle":"[1953]Maximum Number of Weeks for Which You Can Work","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"","submitted":34660,"title":"Maximum Number of Weeks for Which You Can Work","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.5243952439524395,"acs":10232,"articleLive":0,"columnArticles":0,"formTitle":"[1954]Minimum Garden Perimeter to Collect Enough Apples","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"","submitted":19512,"title":"Minimum Garden Perimeter to Collect Enough Apples","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.5081714913887871,"acs":6934,"articleLive":0,"columnArticles":0,"formTitle":"[1955]Count Number of Special Subsequences","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":13645,"title":"Count Number of Special Subsequences","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4373522458628842,"acs":370,"articleLive":0,"columnArticles":0,"formTitle":"[1956]Minimum Time For K Virus Variants to Spread","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":846,"title":"Minimum Time For K Virus Variants to Spread","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.5621203941152653,"acs":16659,"articleLive":0,"columnArticles":0,"formTitle":"[1957]Delete Characters to Make Fancy String","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":29636,"title":"Delete Characters to Make Fancy String","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4283070007271766,"acs":6479,"articleLive":0,"columnArticles":0,"formTitle":"[1958]Check if Move is Legal","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":15127,"title":"Check if Move is Legal","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41839684625492773,"acs":4776,"articleLive":0,"columnArticles":0,"formTitle":"[1959]Minimum Total Space Wasted With K Resizing Operations","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":11415,"title":"Minimum Total Space Wasted With K Resizing Operations","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28564771668219946,"acs":1839,"articleLive":0,"columnArticles":0,"formTitle":"[1960]Maximum Product of the Length of Two Palindromic Substrings","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":6438,"title":"Maximum Product of the Length of Two Palindromic Substrings","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5469211822660098,"acs":22205,"articleLive":0,"columnArticles":0,"formTitle":"[1961]Check If String Is a Prefix of Array","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":40600,"title":"Check If String Is a Prefix of Array","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.5559487873425627,"acs":16023,"articleLive":0,"columnArticles":0,"formTitle":"[1962]Remove Stones to Minimize the Total","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":28821,"title":"Remove Stones to Minimize the Total","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6609569004745498,"acs":20335,"articleLive":0,"columnArticles":0,"formTitle":"[1963]Minimum Number of Swaps to Make the String Balanced","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":30766,"title":"Minimum Number of Swaps to Make the String Balanced","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.4487327855572272,"acs":7755,"articleLive":0,"columnArticles":0,"formTitle":"[1964]Find the Longest Valid Obstacle Course at Each Position","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":17282,"title":"Find the Longest Valid Obstacle Course at Each Position","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.8080606544293695,"acs":4050,"articleLive":0,"columnArticles":0,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":5012,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.6612111292962357,"acs":1212,"articleLive":0,"columnArticles":0,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":1833,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7932158945740604,"acs":23595,"articleLive":0,"columnArticles":0,"formTitle":"[1967]Number of Strings That Appear as Substrings in Word","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":29746,"title":"Number of Strings That Appear as Substrings in Word","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.4795600483183928,"acs":15086,"articleLive":0,"columnArticles":0,"formTitle":"[1968]Array With Elements Not Equal to Average of Neighbors","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":31458,"title":"Array With Elements Not Equal to Average of Neighbors","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.31989247311827956,"acs":6426,"articleLive":0,"columnArticles":0,"formTitle":"[1969]Minimum Non-Zero Product of the Array Elements","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":20088,"title":"Minimum Non-Zero Product of the Array Elements","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4837492927641919,"acs":7695,"articleLive":0,"columnArticles":0,"formTitle":"[1970]Last Day Where You Can Still Cross","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":15907,"title":"Last Day Where You Can Still Cross","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5027701420389267,"acs":59077,"articleLive":0,"columnArticles":0,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":117503,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.5064490655435641,"acs":1924,"articleLive":0,"columnArticles":0,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":3799,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.7433516251582947,"acs":3522,"articleLive":0,"columnArticles":0,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":4738,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7196751142869824,"acs":16215,"articleLive":0,"columnArticles":0,"formTitle":"[1974]Minimum Time to Type Word Using Special Typewriter","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"","submitted":22531,"title":"Minimum Time to Type Word Using Special Typewriter","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.43937986012617986,"acs":8984,"articleLive":0,"columnArticles":0,"formTitle":"[1975]Maximum Matrix Sum","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"","submitted":20447,"title":"Maximum Matrix Sum","titleSlug":"maximum-matrix-sum"},{"acceptance":0.32196515281348187,"acs":11272,"articleLive":0,"columnArticles":0,"formTitle":"[1976]Number of Ways to Arrive at Destination","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"","submitted":35010,"title":"Number of Ways to Arrive at Destination","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.23094297007340486,"acs":2454,"articleLive":0,"columnArticles":0,"formTitle":"[1977]Number of Ways to Separate Numbers","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":10626,"title":"Number of Ways to Separate Numbers","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.49697754749568224,"acs":3453,"articleLive":0,"columnArticles":0,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":6948,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7844158349004291,"acs":32536,"articleLive":0,"columnArticles":0,"formTitle":"[1979]Find Greatest Common Divisor of Array","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"","submitted":41478,"title":"Find Greatest Common Divisor of Array","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.6259145544813169,"acs":19163,"articleLive":0,"columnArticles":0,"formTitle":"[1980]Find Unique Binary String","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"","submitted":30616,"title":"Find Unique Binary String","titleSlug":"find-unique-binary-string"},{"acceptance":0.32881157440163955,"acs":13477,"articleLive":0,"columnArticles":0,"formTitle":"[1981]Minimize the Difference Between Target and Chosen Elements","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":40987,"title":"Minimize the Difference Between Target and Chosen Elements","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4854368932038835,"acs":2700,"articleLive":0,"columnArticles":0,"formTitle":"[1982]Find Array Given Subset Sums","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":5562,"title":"Find Array Given Subset Sums","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.543254688445251,"acs":898,"articleLive":0,"columnArticles":0,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":1653,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5416028745508514,"acs":17334,"articleLive":0,"columnArticles":0,"formTitle":"[1984]Minimum Difference Between Highest and Lowest of K Scores","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"","submitted":32005,"title":"Minimum Difference Between Highest and Lowest of K Scores","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.44649936529635775,"acs":22863,"articleLive":0,"columnArticles":0,"formTitle":"[1985]Find the Kth Largest Integer in the Array","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"","submitted":51205,"title":"Find the Kth Largest Integer in the Array","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.31109449947050394,"acs":9988,"articleLive":0,"columnArticles":0,"formTitle":"[1986]Minimum Number of Work Sessions to Finish the Tasks","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"","submitted":32106,"title":"Minimum Number of Work Sessions to Finish the Tasks","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.5179098187947746,"acs":6145,"articleLive":0,"columnArticles":0,"formTitle":"[1987]Number of Unique Good Subsequences","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":11865,"title":"Number of Unique Good Subsequences","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6965538273863983,"acs":2284,"articleLive":0,"columnArticles":0,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":3279,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.5636132315521628,"acs":886,"articleLive":0,"columnArticles":0,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":1572,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5075418994413408,"acs":1817,"articleLive":0,"columnArticles":0,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":2,"nodeType":"def","questionId":"2143","status":"lock","submitted":3580,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6618424802862843,"acs":20899,"articleLive":0,"columnArticles":0,"formTitle":"[1991]Find the Middle Index in Array","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"","submitted":31577,"title":"Find the Middle Index in Array","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.666473418748913,"acs":11496,"articleLive":0,"columnArticles":0,"formTitle":"[1992]Find All Groups of Farmland","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"","submitted":17249,"title":"Find All Groups of Farmland","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.4120198698663681,"acs":5889,"articleLive":0,"columnArticles":0,"formTitle":"[1993]Operations on Tree","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":14293,"title":"Operations on Tree","titleSlug":"operations-on-tree"},{"acceptance":0.331781633516716,"acs":3136,"articleLive":0,"columnArticles":0,"formTitle":"[1994]The Number of Good Subsets","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"","submitted":9452,"title":"The Number of Good Subsets","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5758104823525384,"acs":16820,"articleLive":0,"columnArticles":0,"formTitle":"[1995]Count Special Quadruplets","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"","submitted":29211,"title":"Count Special Quadruplets","titleSlug":"count-special-quadruplets"},{"acceptance":0.31494242134030975,"acs":13483,"articleLive":0,"columnArticles":0,"formTitle":"[1996]The Number of Weak Characters in the Game","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"","submitted":42811,"title":"The Number of Weak Characters in the Game","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3498891054506351,"acs":5206,"articleLive":0,"columnArticles":0,"formTitle":"[1997]First Day Where You Have Been in All the Rooms","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"","submitted":14879,"title":"First Day Where You Have Been in All the Rooms","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.45917707884532527,"acs":4263,"articleLive":0,"columnArticles":0,"formTitle":"[1998]GCD Sort of an Array","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":9284,"title":"GCD Sort of an Array","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.53125,"acs":748,"articleLive":0,"columnArticles":0,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"lock","submitted":1408,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7823727213733703,"acs":26524,"articleLive":0,"columnArticles":0,"formTitle":"[2000]Reverse Prefix of Word","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"","submitted":33902,"title":"Reverse Prefix of Word","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.4216738197424893,"acs":14148,"articleLive":0,"columnArticles":0,"formTitle":"[2001]Number of Pairs of Interchangeable Rectangles","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"","submitted":33552,"title":"Number of Pairs of Interchangeable Rectangles","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5214994487320838,"acs":9933,"articleLive":0,"columnArticles":0,"formTitle":"[2002]Maximum Product of the Length of Two Palindromic Subsequences","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":19047,"title":"Maximum Product of the Length of Two Palindromic Subsequences","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.4187487894634902,"acs":4324,"articleLive":0,"columnArticles":0,"formTitle":"[2003]Smallest Missing Genetic Value in Each Subtree","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":10326,"title":"Smallest Missing Genetic Value in Each Subtree","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.3896731773351383,"acs":2015,"articleLive":0,"columnArticles":0,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"lock","submitted":5171,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6325,"acs":253,"articleLive":0,"columnArticles":0,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":400,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8341314542341761,"acs":33618,"articleLive":0,"columnArticles":0,"formTitle":"[2006]Count Number of Pairs With Absolute Difference K","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":40303,"title":"Count Number of Pairs With Absolute Difference K","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.3691436153924671,"acs":28932,"articleLive":0,"columnArticles":0,"formTitle":"[2007]Find Original Array From Doubled Array","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":78376,"title":"Find Original Array From Doubled Array","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4231099656357388,"acs":9850,"articleLive":0,"columnArticles":0,"formTitle":"[2008]Maximum Earnings From Taxi","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":23280,"title":"Maximum Earnings From Taxi","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4542741793926628,"acs":5176,"articleLive":0,"columnArticles":0,"formTitle":"[2009]Minimum Number of Operations to Make Array Continuous","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":11394,"title":"Minimum Number of Operations to Make Array Continuous","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.5762635379061372,"acs":1277,"articleLive":0,"columnArticles":0,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":2216,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.8931997579160175,"acs":69365,"articleLive":0,"columnArticles":0,"formTitle":"[2011]Final Value of Variable After Performing Operations","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"","submitted":77659,"title":"Final Value of Variable After Performing Operations","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.4533654196747612,"acs":12434,"articleLive":0,"columnArticles":0,"formTitle":"[2012]Sum of Beauty in the Array","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"","submitted":27426,"title":"Sum of Beauty in the Array","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.42673830817632297,"acs":12072,"articleLive":0,"columnArticles":0,"formTitle":"[2013]Detect Squares","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"","submitted":28289,"title":"Detect Squares","titleSlug":"detect-squares"},{"acceptance":0.5445338099493595,"acs":3656,"articleLive":0,"columnArticles":0,"formTitle":"[2014]Longest Subsequence Repeated k Times","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":6714,"title":"Longest Subsequence Repeated k Times","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.6038732394366197,"acs":686,"articleLive":0,"columnArticles":0,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":1136,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5516829682692749,"acs":24028,"articleLive":0,"columnArticles":0,"formTitle":"[2016]Maximum Difference Between Increasing Elements","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"","submitted":43554,"title":"Maximum Difference Between Increasing Elements","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.4123255915671609,"acs":9427,"articleLive":0,"columnArticles":0,"formTitle":"[2017]Grid Game","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"","submitted":22863,"title":"Grid Game","titleSlug":"grid-game"},{"acceptance":0.46741154562383613,"acs":6526,"articleLive":0,"columnArticles":0,"formTitle":"[2018]Check if Word Can Be Placed In Crossword","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":13962,"title":"Check if Word Can Be Placed In Crossword","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3313086692435119,"acs":3600,"articleLive":0,"columnArticles":0,"formTitle":"[2019]The Score of Students Solving Math Expression","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":10866,"title":"The Score of Students Solving Math Expression","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7200126262626263,"acs":2281,"articleLive":0,"columnArticles":0,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":3168,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.6304832713754647,"acs":1696,"articleLive":0,"columnArticles":0,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"lock","submitted":2690,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6060399443165999,"acs":21332,"articleLive":0,"columnArticles":0,"formTitle":"[2022]Convert 1D Array Into 2D Array","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"","submitted":35199,"title":"Convert 1D Array Into 2D Array","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7327282924590832,"acs":14371,"articleLive":0,"columnArticles":0,"formTitle":"[2023]Number of Pairs of Strings With Concatenation Equal to Target","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"","submitted":19613,"title":"Number of Pairs of Strings With Concatenation Equal to Target","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.55592020922004,"acs":10841,"articleLive":0,"columnArticles":0,"formTitle":"[2024]Maximize the Confusion of an Exam","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":19501,"title":"Maximize the Confusion of an Exam","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.30121100917431193,"acs":4104,"articleLive":0,"columnArticles":0,"formTitle":"[2025]Maximum Number of Ways to Partition an Array","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":13625,"title":"Maximum Number of Ways to Partition an Array","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8535655960805661,"acs":3136,"articleLive":0,"columnArticles":0,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"lock","submitted":3674,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.528508479102684,"acs":15832,"articleLive":0,"columnArticles":0,"formTitle":"[2027]Minimum Moves to Convert String","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"","submitted":29956,"title":"Minimum Moves to Convert String","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4127680656805153,"acs":11664,"articleLive":0,"columnArticles":0,"formTitle":"[2028]Find Missing Observations","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"","submitted":28258,"title":"Find Missing Observations","titleSlug":"find-missing-observations"},{"acceptance":0.24170245997657167,"acs":4333,"articleLive":0,"columnArticles":0,"formTitle":"[2029]Stone Game IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"","submitted":17927,"title":"Stone Game IX","titleSlug":"stone-game-ix"},{"acceptance":0.3887459447365477,"acs":3475,"articleLive":0,"columnArticles":0,"formTitle":"[2030]Smallest K-Length Subsequence With Occurrences of a Letter","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":8939,"title":"Smallest K-Length Subsequence With Occurrences of a Letter","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.5428571428571428,"acs":1007,"articleLive":0,"columnArticles":0,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"lock","submitted":1855,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.7270466321243523,"acs":21048,"articleLive":0,"columnArticles":0,"formTitle":"[2032]Two Out of Three","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"","submitted":28950,"title":"Two Out of Three","titleSlug":"two-out-of-three"},{"acceptance":0.4887230940742646,"acs":11398,"articleLive":0,"columnArticles":0,"formTitle":"[2033]Minimum Operations to Make a Uni-Value Grid","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"","submitted":23322,"title":"Minimum Operations to Make a Uni-Value Grid","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.44547848464899154,"acs":14887,"articleLive":0,"columnArticles":0,"formTitle":"[2034]Stock Price Fluctuation ","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"","submitted":33418,"title":"Stock Price Fluctuation ","titleSlug":"stock-price-fluctuation"},{"acceptance":0.2391980450960791,"acs":4307,"articleLive":0,"columnArticles":0,"formTitle":"[2035]Partition Array Into Two Arrays to Minimize Sum Difference","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":18006,"title":"Partition Array Into Two Arrays to Minimize Sum Difference","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.4172913543228386,"acs":835,"articleLive":0,"columnArticles":0,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":2001,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8306425041186162,"acs":17647,"articleLive":0,"columnArticles":0,"formTitle":"[2037]Minimum Number of Moves to Seat Everyone","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"","submitted":21245,"title":"Minimum Number of Moves to Seat Everyone","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5498443282617635,"acs":9360,"articleLive":0,"columnArticles":0,"formTitle":"[2038]Remove Colored Pieces if Both Neighbors are the Same Color","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"","submitted":17023,"title":"Remove Colored Pieces if Both Neighbors are the Same Color","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.4855689095534696,"acs":5535,"articleLive":0,"columnArticles":0,"formTitle":"[2039]The Time When the Network Becomes Idle","frequency":0.0,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"","submitted":11399,"title":"The Time When the Network Becomes Idle","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.25278303672851193,"acs":3338,"articleLive":0,"columnArticles":0,"formTitle":"[2040]Kth Smallest Product of Two Sorted Arrays","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":13205,"title":"Kth Smallest Product of Two Sorted Arrays","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.7651573292402148,"acs":1994,"articleLive":0,"columnArticles":0,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"lock","submitted":2606,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6906992981295704,"acs":18796,"articleLive":0,"columnArticles":0,"formTitle":"[2042]Check if Numbers Are Ascending in a Sentence","frequency":0.0,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"","submitted":27213,"title":"Check if Numbers Are Ascending in a Sentence","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.6457206027811718,"acs":11098,"articleLive":0,"columnArticles":0,"formTitle":"[2043]Simple Bank System","frequency":0.0,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"","submitted":17187,"title":"Simple Bank System","titleSlug":"simple-bank-system"},{"acceptance":0.7512057877813505,"acs":11214,"articleLive":0,"columnArticles":0,"formTitle":"[2044]Count Number of Maximum Bitwise-OR Subsets","frequency":0.0,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"","submitted":14928,"title":"Count Number of Maximum Bitwise-OR Subsets","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.35981722703403124,"acs":5276,"articleLive":0,"columnArticles":0,"formTitle":"[2045]Second Minimum Time to Reach Destination","frequency":0.0,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"","submitted":14663,"title":"Second Minimum Time to Reach Destination","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.7047184170471842,"acs":1852,"articleLive":0,"columnArticles":0,"formTitle":"[2046]Sort Linked List Already Sorted Using Absolute Values","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"lock","submitted":2628,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.29264339453758137,"acs":12097,"articleLive":0,"columnArticles":0,"formTitle":"[2047]Number of Valid Words in a Sentence","frequency":0.0,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"","submitted":41337,"title":"Number of Valid Words in a Sentence","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4603681998460901,"acs":7777,"articleLive":0,"columnArticles":0,"formTitle":"[2048]Next Greater Numerically Balanced Number","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"","submitted":16893,"title":"Next Greater Numerically Balanced Number","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.45874907349335764,"acs":8046,"articleLive":0,"columnArticles":0,"formTitle":"[2049]Count Nodes With the Highest Score","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":17539,"title":"Count Nodes With the Highest Score","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.6062569260932572,"acs":7112,"articleLive":0,"columnArticles":0,"formTitle":"[2050]Parallel Courses III","frequency":0.0,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":11731,"title":"Parallel Courses III","titleSlug":"parallel-courses-iii"},{"acceptance":0.7259010896898574,"acs":1732,"articleLive":0,"columnArticles":0,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"lock","submitted":2386,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5475482912332839,"acs":737,"articleLive":0,"columnArticles":0,"formTitle":"[2052]Minimum Cost to Separate Sentence Into Rows","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"lock","submitted":1346,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7353004990236494,"acs":16945,"articleLive":0,"columnArticles":0,"formTitle":"[2053]Kth Distinct String in an Array","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":23045,"title":"Kth Distinct String in an Array","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.4201785714285714,"acs":7059,"articleLive":0,"columnArticles":0,"formTitle":"[2054]Two Best Non-Overlapping Events","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":16800,"title":"Two Best Non-Overlapping Events","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.47694628847314424,"acs":7903,"articleLive":0,"columnArticles":0,"formTitle":"[2055]Plates Between Candles","frequency":0.0,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":16570,"title":"Plates Between Candles","titleSlug":"plates-between-candles"},{"acceptance":0.5765374331550802,"acs":1725,"articleLive":0,"columnArticles":0,"formTitle":"[2056]Number of Valid Move Combinations On Chessboard","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":2992,"title":"Number of Valid Move Combinations On Chessboard","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7373228227090124,"acs":19455,"articleLive":0,"columnArticles":0,"formTitle":"[2057]Smallest Index With Equal Value","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":26386,"title":"Smallest Index With Equal Value","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5828597001566346,"acs":13024,"articleLive":0,"columnArticles":0,"formTitle":"[2058]Find the Minimum and Maximum Number of Nodes Between Critical Points","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":22345,"title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.45545803332107004,"acs":8666,"articleLive":0,"columnArticles":0,"formTitle":"[2059]Minimum Operations to Convert Number","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":19027,"title":"Minimum Operations to Convert Number","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.3810848400556328,"acs":3288,"articleLive":0,"columnArticles":0,"formTitle":"[2060]Check if an Original String Exists Given Two Encoded Strings","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":8628,"title":"Check if an Original String Exists Given Two Encoded Strings","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5612903225806452,"acs":1566,"articleLive":0,"columnArticles":0,"formTitle":"[2061]Number of Spaces Cleaning Robot Cleaned","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"lock","submitted":2790,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6581825037707391,"acs":13964,"articleLive":0,"columnArticles":0,"formTitle":"[2062]Count Vowel Substrings of a String","frequency":0.0,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"","submitted":21216,"title":"Count Vowel Substrings of a String","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.5403217894633572,"acs":11015,"articleLive":0,"columnArticles":0,"formTitle":"[2063]Vowels of All Substrings","frequency":0.0,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"","submitted":20386,"title":"Vowels of All Substrings","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.47642889010062955,"acs":9611,"articleLive":0,"columnArticles":0,"formTitle":"[2064]Minimized Maximum of Products Distributed to Any Store","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"","submitted":20173,"title":"Minimized Maximum of Products Distributed to Any Store","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5754811639149868,"acs":6309,"articleLive":0,"columnArticles":0,"formTitle":"[2065]Maximum Path Quality of a Graph","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"","submitted":10963,"title":"Maximum Path Quality of a Graph","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8640864086408641,"acs":1920,"articleLive":0,"columnArticles":0,"formTitle":"[2066]Account Balance","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"lock","submitted":2222,"title":"Account Balance","titleSlug":"account-balance"},{"acceptance":0.5069582504970179,"acs":765,"articleLive":0,"columnArticles":0,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"lock","submitted":1509,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.6695969972342948,"acs":13558,"articleLive":0,"columnArticles":0,"formTitle":"[2068]Check Whether Two Strings are Almost Equivalent","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"","submitted":20248,"title":"Check Whether Two Strings are Almost Equivalent","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.21101813702586755,"acs":4968,"articleLive":0,"columnArticles":0,"formTitle":"[2069]Walking Robot Simulation II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"","submitted":23543,"title":"Walking Robot Simulation II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.48279879385964913,"acs":7045,"articleLive":0,"columnArticles":0,"formTitle":"[2070]Most Beautiful Item for Each Query","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":14592,"title":"Most Beautiful Item for Each Query","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.37396893411890736,"acs":3491,"articleLive":0,"columnArticles":0,"formTitle":"[2071]Maximum Number of Tasks You Can Assign","frequency":0.0,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":9335,"title":"Maximum Number of Tasks You Can Assign","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.7342105263157894,"acs":2232,"articleLive":0,"columnArticles":0,"formTitle":"[2072]The Winner University","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"lock","submitted":3040,"title":"The Winner University","titleSlug":"the-winner-university"},{"acceptance":0.6175528745904081,"acs":16585,"articleLive":0,"columnArticles":0,"formTitle":"[2073]Time Needed to Buy Tickets","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":26856,"title":"Time Needed to Buy Tickets","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.4884735968525235,"acs":7946,"articleLive":0,"columnArticles":0,"formTitle":"[2074]Reverse Nodes in Even Length Groups","frequency":0.0,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":16267,"title":"Reverse Nodes in Even Length Groups","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.5009849444209934,"acs":7121,"articleLive":0,"columnArticles":0,"formTitle":"[2075]Decode the Slanted Ciphertext","frequency":0.0,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":14214,"title":"Decode the Slanted Ciphertext","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.5239536428729608,"acs":7098,"articleLive":0,"columnArticles":0,"formTitle":"[2076]Process Restricted Friend Requests","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":13547,"title":"Process Restricted Friend Requests","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.5966429298067142,"acs":1173,"articleLive":0,"columnArticles":0,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"lock","submitted":1966,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.6945071203994821,"acs":18776,"articleLive":0,"columnArticles":0,"formTitle":"[2078]Two Furthest Houses With Different Colors","frequency":0.0,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":27035,"title":"Two Furthest Houses With Different Colors","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.8051292615099392,"acs":15634,"articleLive":0,"columnArticles":0,"formTitle":"[2079]Watering Plants","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":19418,"title":"Watering Plants","titleSlug":"watering-plants"},{"acceptance":0.35741187104549565,"acs":9490,"articleLive":0,"columnArticles":0,"formTitle":"[2080]Range Frequency Queries","frequency":0.0,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":26552,"title":"Range Frequency Queries","titleSlug":"range-frequency-queries"},{"acceptance":0.38876190476190475,"acs":4082,"articleLive":0,"columnArticles":0,"formTitle":"[2081]Sum of k-Mirror Numbers","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":10500,"title":"Sum of k-Mirror Numbers","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.8060188542422045,"acs":2223,"articleLive":0,"columnArticles":0,"formTitle":"[2082]The Number of Rich Customers","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"lock","submitted":2758,"title":"The Number of Rich Customers","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6946251283806916,"acs":2029,"articleLive":0,"columnArticles":0,"formTitle":"[2083]Substrings That Begin and End With the Same Letter","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"lock","submitted":2921,"title":"Substrings That Begin and End With the Same Letter","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.9108860759493671,"acs":1799,"articleLive":0,"columnArticles":0,"formTitle":"[2084]Drop Type 1 Orders for Customers With Type 0 Orders","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"lock","submitted":1975,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7109572336904451,"acs":16325,"articleLive":0,"columnArticles":0,"formTitle":"[2085]Count Common Words With One Occurrence","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"","submitted":22962,"title":"Count Common Words With One Occurrence","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.45616172805317085,"acs":8236,"articleLive":0,"columnArticles":0,"formTitle":"[2086]Minimum Number of Buckets Required to Collect Rainwater from Houses","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"","submitted":18055,"title":"Minimum Number of Buckets Required to Collect Rainwater from Houses","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.4912190082644628,"acs":6657,"articleLive":0,"columnArticles":0,"formTitle":"[2087]Minimum Cost Homecoming of a Robot in a Grid","frequency":0.0,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"","submitted":13552,"title":"Minimum Cost Homecoming of a Robot in a Grid","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.6204933586337761,"acs":3270,"articleLive":0,"columnArticles":0,"formTitle":"[2088]Count Fertile Pyramids in a Land","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":5270,"title":"Count Fertile Pyramids in a Land","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.8136560228213858,"acs":35368,"articleLive":0,"columnArticles":0,"formTitle":"[2089]Find Target Indices After Sorting Array","frequency":0.0,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":43468,"title":"Find Target Indices After Sorting Array","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.40077418493676376,"acs":12010,"articleLive":0,"columnArticles":0,"formTitle":"[2090]K Radius Subarray Averages","frequency":0.0,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":29967,"title":"K Radius Subarray Averages","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5830212234706617,"acs":13543,"articleLive":0,"columnArticles":0,"formTitle":"[2091]Removing Minimum and Maximum From Array","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":23229,"title":"Removing Minimum and Maximum From Array","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.31767854156213415,"acs":9497,"articleLive":0,"columnArticles":0,"formTitle":"[2092]Find All People With Secret","frequency":0.0,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":29895,"title":"Find All People With Secret","titleSlug":"find-all-people-with-secret"},{"acceptance":0.5790393013100437,"acs":1326,"articleLive":0,"columnArticles":0,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"lock","submitted":2290,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5537488324700688,"acs":13043,"articleLive":0,"columnArticles":0,"formTitle":"[2094]Finding 3-Digit Even Numbers","frequency":0.0,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":23554,"title":"Finding 3-Digit Even Numbers","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.582331339838422,"acs":27751,"articleLive":0,"columnArticles":0,"formTitle":"[2095]Delete the Middle Node of a Linked List","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":47655,"title":"Delete the Middle Node of a Linked List","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.46437141714438074,"acs":13933,"articleLive":0,"columnArticles":0,"formTitle":"[2096]Step-By-Step Directions From a Binary Tree Node to Another","frequency":0.0,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":30004,"title":"Step-By-Step Directions From a Binary Tree Node to Another","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.3951343132285859,"acs":3898,"articleLive":0,"columnArticles":0,"formTitle":"[2097]Valid Arrangement of Pairs","frequency":0.0,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":9865,"title":"Valid Arrangement of Pairs","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.4087237479806139,"acs":759,"articleLive":0,"columnArticles":0,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":0.0,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"lock","submitted":1857,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.4448356807511737,"acs":11370,"articleLive":0,"columnArticles":0,"formTitle":"[2099]Find Subsequence of Length K With the Largest Sum","frequency":0.0,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"","submitted":25560,"title":"Find Subsequence of Length K With the Largest Sum","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.4508727564300253,"acs":7310,"articleLive":0,"columnArticles":0,"formTitle":"[2100]Find Good Days to Rob the Bank","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"","submitted":16213,"title":"Find Good Days to Rob the Bank","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.39321249932770397,"acs":7311,"articleLive":0,"columnArticles":0,"formTitle":"[2101]Detonate the Maximum Bombs","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"","submitted":18593,"title":"Detonate the Maximum Bombs","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.6043151969981239,"acs":3221,"articleLive":0,"columnArticles":0,"formTitle":"[2102]Sequentially Ordinal Rank Tracker","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":5330,"title":"Sequentially Ordinal Rank Tracker","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.817018779342723,"acs":20883,"articleLive":0,"columnArticles":0,"formTitle":"[2103]Rings and Rods","frequency":0.0,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":25560,"title":"Rings and Rods","titleSlug":"rings-and-rods"},{"acceptance":0.5840328709021826,"acs":13219,"articleLive":0,"columnArticles":0,"formTitle":"[2104]Sum of Subarray Ranges","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":22634,"title":"Sum of Subarray Ranges","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.5132599381745214,"acs":9464,"articleLive":0,"columnArticles":0,"formTitle":"[2105]Watering Plants II","frequency":0.0,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":18439,"title":"Watering Plants II","titleSlug":"watering-plants-ii"},{"acceptance":0.3487389659520807,"acs":5531,"articleLive":0,"columnArticles":0,"formTitle":"[2106]Maximum Fruits Harvested After at Most K Steps","frequency":0.0,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":15860,"title":"Maximum Fruits Harvested After at Most K Steps","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.5975526852481305,"acs":879,"articleLive":0,"columnArticles":0,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"lock","submitted":1471,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.8093144892054307,"acs":29090,"articleLive":0,"columnArticles":0,"formTitle":"[2108]Find First Palindromic String in the Array","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"","submitted":35944,"title":"Find First Palindromic String in the Array","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.5565614997713764,"acs":18258,"articleLive":0,"columnArticles":0,"formTitle":"[2109]Adding Spaces to a String","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"","submitted":32805,"title":"Adding Spaces to a String","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.5439664883131512,"acs":15453,"articleLive":0,"columnArticles":0,"formTitle":"[2110]Number of Smooth Descent Periods of a Stock","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"","submitted":28408,"title":"Number of Smooth Descent Periods of a Stock","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.3564212889346179,"acs":7621,"articleLive":0,"columnArticles":0,"formTitle":"[2111]Minimum Operations to Make the Array K-Increasing","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"","submitted":21382,"title":"Minimum Operations to Make the Array K-Increasing","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.6988222097588335,"acs":1246,"articleLive":0,"columnArticles":0,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"lock","submitted":1783,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.739656912209889,"acs":733,"articleLive":0,"columnArticles":0,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"lock","submitted":991,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.892686106862573,"acs":35603,"articleLive":0,"columnArticles":0,"formTitle":"[2114]Maximum Number of Words Found in Sentences","frequency":0.0,"frontendQuestionId":"2114","leaf":true,"level":1,"nodeType":"def","questionId":"2219","status":"","submitted":39883,"title":"Maximum Number of Words Found in Sentences","titleSlug":"maximum-number-of-words-found-in-sentences"},{"acceptance":0.34313893948245644,"acs":9985,"articleLive":0,"columnArticles":0,"formTitle":"[2115]Find All Possible Recipes from Given Supplies","frequency":0.0,"frontendQuestionId":"2115","leaf":true,"level":2,"nodeType":"def","questionId":"2220","status":"","submitted":29099,"title":"Find All Possible Recipes from Given Supplies","titleSlug":"find-all-possible-recipes-from-given-supplies"},{"acceptance":0.31150384907296974,"acs":5746,"articleLive":0,"columnArticles":0,"formTitle":"[2116]Check if a Parentheses String Can Be Valid","frequency":0.0,"frontendQuestionId":"2116","leaf":true,"level":2,"nodeType":"def","questionId":"2221","status":"","submitted":18446,"title":"Check if a Parentheses String Can Be Valid","titleSlug":"check-if-a-parentheses-string-can-be-valid"},{"acceptance":0.28220338983050847,"acs":1665,"articleLive":0,"columnArticles":0,"formTitle":"[2117]Abbreviating the Product of a Range","frequency":0.0,"frontendQuestionId":"2117","leaf":true,"level":3,"nodeType":"def","questionId":"2222","status":"","submitted":5900,"title":"Abbreviating the Product of a Range","titleSlug":"abbreviating-the-product-of-a-range"},{"acceptance":0.5707620528771384,"acs":367,"articleLive":0,"columnArticles":0,"formTitle":"[2118]Build the Equation","frequency":0.0,"frontendQuestionId":"2118","leaf":true,"level":3,"nodeType":"def","questionId":"2253","status":"lock","submitted":643,"title":"Build the Equation","titleSlug":"build-the-equation"},{"acceptance":0.7734097633136094,"acs":20913,"articleLive":0,"columnArticles":0,"formTitle":"[2119]A Number After a Double Reversal","frequency":0.0,"frontendQuestionId":"2119","leaf":true,"level":1,"nodeType":"def","questionId":"2238","status":"","submitted":27040,"title":"A Number After a Double Reversal","titleSlug":"a-number-after-a-double-reversal"},{"acceptance":0.8268008474576272,"acs":12488,"articleLive":0,"columnArticles":0,"formTitle":"[2120]Execution of All Suffix Instructions Staying in a Grid","frequency":0.0,"frontendQuestionId":"2120","leaf":true,"level":2,"nodeType":"def","questionId":"2239","status":"","submitted":15104,"title":"Execution of All Suffix Instructions Staying in a Grid","titleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid"},{"acceptance":0.41456077015643805,"acs":9646,"articleLive":0,"columnArticles":0,"formTitle":"[2121]Intervals Between Identical Elements","frequency":0.0,"frontendQuestionId":"2121","leaf":true,"level":2,"nodeType":"def","questionId":"2240","status":"","submitted":23268,"title":"Intervals Between Identical Elements","titleSlug":"intervals-between-identical-elements"},{"acceptance":0.3754583551597695,"acs":5734,"articleLive":0,"columnArticles":0,"formTitle":"[2122]Recover the Original Array","frequency":0.0,"frontendQuestionId":"2122","leaf":true,"level":3,"nodeType":"def","questionId":"2241","status":"","submitted":15272,"title":"Recover the Original Array","titleSlug":"recover-the-original-array"},{"acceptance":0.4102209944751381,"acs":297,"articleLive":0,"columnArticles":0,"formTitle":"[2123]Minimum Operations to Remove Adjacent Ones in Matrix","frequency":0.0,"frontendQuestionId":"2123","leaf":true,"level":3,"nodeType":"def","questionId":"2259","status":"lock","submitted":724,"title":"Minimum Operations to Remove Adjacent Ones in Matrix","titleSlug":"minimum-operations-to-remove-adjacent-ones-in-matrix"},{"acceptance":0.7333444314965873,"acs":22026,"articleLive":0,"columnArticles":0,"formTitle":"[2124]Check if All A's Appears Before All B's","frequency":0.0,"frontendQuestionId":"2124","leaf":true,"level":1,"nodeType":"def","questionId":"2243","status":"","submitted":30035,"title":"Check if All A's Appears Before All B's","titleSlug":"check-if-all-as-appears-before-all-bs"},{"acceptance":0.8313428091367331,"acs":18307,"articleLive":0,"columnArticles":0,"formTitle":"[2125]Number of Laser Beams in a Bank","frequency":0.0,"frontendQuestionId":"2125","leaf":true,"level":2,"nodeType":"def","questionId":"2244","status":"","submitted":22021,"title":"Number of Laser Beams in a Bank","titleSlug":"number-of-laser-beams-in-a-bank"},{"acceptance":0.47880180207059103,"acs":16048,"articleLive":0,"columnArticles":0,"formTitle":"[2126]Destroying Asteroids","frequency":0.0,"frontendQuestionId":"2126","leaf":true,"level":2,"nodeType":"def","questionId":"2245","status":"","submitted":33517,"title":"Destroying Asteroids","titleSlug":"destroying-asteroids"},{"acceptance":0.2908290535583272,"acs":3964,"articleLive":0,"columnArticles":0,"formTitle":"[2127]Maximum Employees to Be Invited to a Meeting","frequency":0.0,"frontendQuestionId":"2127","leaf":true,"level":3,"nodeType":"def","questionId":"2246","status":"","submitted":13630,"title":"Maximum Employees to Be Invited to a Meeting","titleSlug":"maximum-employees-to-be-invited-to-a-meeting"},{"acceptance":0.7708852162100973,"acs":3405,"articleLive":0,"columnArticles":0,"formTitle":"[2128]Remove All Ones With Row and Column Flips","frequency":0.0,"frontendQuestionId":"2128","leaf":true,"level":2,"nodeType":"def","questionId":"2268","status":"lock","submitted":4417,"title":"Remove All Ones With Row and Column Flips","titleSlug":"remove-all-ones-with-row-and-column-flips"},{"acceptance":0.5898260339809112,"acs":17427,"articleLive":0,"columnArticles":0,"formTitle":"[2129]Capitalize the Title","frequency":0.0,"frontendQuestionId":"2129","leaf":true,"level":1,"nodeType":"def","questionId":"2235","status":"","submitted":29546,"title":"Capitalize the Title","titleSlug":"capitalize-the-title"},{"acceptance":0.8300622307324078,"acs":17340,"articleLive":0,"columnArticles":0,"formTitle":"[2130]Maximum Twin Sum of a Linked List","frequency":0.0,"frontendQuestionId":"2130","leaf":true,"level":2,"nodeType":"def","questionId":"2236","status":"","submitted":20890,"title":"Maximum Twin Sum of a Linked List","titleSlug":"maximum-twin-sum-of-a-linked-list"},{"acceptance":0.372723790954354,"acs":10705,"articleLive":0,"columnArticles":0,"formTitle":"[2131]Longest Palindrome by Concatenating Two Letter Words","frequency":0.0,"frontendQuestionId":"2131","leaf":true,"level":2,"nodeType":"def","questionId":"2237","status":"","submitted":28721,"title":"Longest Palindrome by Concatenating Two Letter Words","titleSlug":"longest-palindrome-by-concatenating-two-letter-words"},{"acceptance":0.2699077157263819,"acs":2837,"articleLive":0,"columnArticles":0,"formTitle":"[2132]Stamping the Grid","frequency":0.0,"frontendQuestionId":"2132","leaf":true,"level":3,"nodeType":"def","questionId":"2200","status":"","submitted":10511,"title":"Stamping the Grid","titleSlug":"stamping-the-grid"},{"acceptance":0.5196477313694186,"acs":20180,"articleLive":0,"columnArticles":0,"formTitle":"[2133]Check if Every Row and Column Contains All Numbers","frequency":0.0,"frontendQuestionId":"2133","leaf":true,"level":1,"nodeType":"def","questionId":"2254","status":"","submitted":38834,"title":"Check if Every Row and Column Contains All Numbers","titleSlug":"check-if-every-row-and-column-contains-all-numbers"},{"acceptance":0.46432281926609315,"acs":11173,"articleLive":0,"columnArticles":0,"formTitle":"[2134]Minimum Swaps to Group All 1's Together II","frequency":0.0,"frontendQuestionId":"2134","leaf":true,"level":2,"nodeType":"def","questionId":"2255","status":"","submitted":24063,"title":"Minimum Swaps to Group All 1's Together II","titleSlug":"minimum-swaps-to-group-all-1s-together-ii"},{"acceptance":0.3444680927816457,"acs":9549,"articleLive":0,"columnArticles":0,"formTitle":"[2135]Count Words Obtained After Adding a Letter","frequency":0.0,"frontendQuestionId":"2135","leaf":true,"level":2,"nodeType":"def","questionId":"2256","status":"","submitted":27721,"title":"Count Words Obtained After Adding a Letter","titleSlug":"count-words-obtained-after-adding-a-letter"},{"acceptance":0.6733708769107,"acs":5859,"articleLive":0,"columnArticles":0,"formTitle":"[2136]Earliest Possible Day of Full Bloom","frequency":0.0,"frontendQuestionId":"2136","leaf":true,"level":3,"nodeType":"def","questionId":"2257","status":"","submitted":8701,"title":"Earliest Possible Day of Full Bloom","titleSlug":"earliest-possible-day-of-full-bloom"},{"acceptance":0.6749408983451537,"acs":571,"articleLive":0,"columnArticles":0,"formTitle":"[2137]Pour Water Between Buckets to Make Water Levels Equal","frequency":0.0,"frontendQuestionId":"2137","leaf":true,"level":2,"nodeType":"def","questionId":"2273","status":"lock","submitted":846,"title":"Pour Water Between Buckets to Make Water Levels Equal","titleSlug":"pour-water-between-buckets-to-make-water-levels-equal"},{"acceptance":0.6574085993820803,"acs":20427,"articleLive":0,"columnArticles":0,"formTitle":"[2138]Divide a String Into Groups of Size k","frequency":0.0,"frontendQuestionId":"2138","leaf":true,"level":1,"nodeType":"def","questionId":"2260","status":"","submitted":31072,"title":"Divide a String Into Groups of Size k","titleSlug":"divide-a-string-into-groups-of-size-k"},{"acceptance":0.48365907500134603,"acs":17966,"articleLive":0,"columnArticles":0,"formTitle":"[2139]Minimum Moves to Reach Target Score","frequency":0.0,"frontendQuestionId":"2139","leaf":true,"level":2,"nodeType":"def","questionId":"1303","status":"","submitted":37146,"title":"Minimum Moves to Reach Target Score","titleSlug":"minimum-moves-to-reach-target-score"},{"acceptance":0.4316608257115993,"acs":15150,"articleLive":0,"columnArticles":0,"formTitle":"[2140]Solving Questions With Brainpower","frequency":0.0,"frontendQuestionId":"2140","leaf":true,"level":2,"nodeType":"def","questionId":"2262","status":"","submitted":35097,"title":"Solving Questions With Brainpower","titleSlug":"solving-questions-with-brainpower"},{"acceptance":0.36618732159207196,"acs":6799,"articleLive":0,"columnArticles":0,"formTitle":"[2141]Maximum Running Time of N Computers","frequency":0.0,"frontendQuestionId":"2141","leaf":true,"level":3,"nodeType":"def","questionId":"2263","status":"","submitted":18567,"title":"Maximum Running Time of N Computers","titleSlug":"maximum-running-time-of-n-computers"},{"acceptance":0.49211119459053343,"acs":655,"articleLive":0,"columnArticles":0,"formTitle":"[2142]The Number of Passengers in Each Bus I","frequency":0.0,"frontendQuestionId":"2142","leaf":true,"level":2,"nodeType":"def","questionId":"2281","status":"lock","submitted":1331,"title":"The Number of Passengers in Each Bus I","titleSlug":"the-number-of-passengers-in-each-bus-i"},{"acceptance":0.55,"acs":319,"articleLive":0,"columnArticles":0,"formTitle":"[2143]Choose Numbers From Two Arrays in Range","frequency":0.0,"frontendQuestionId":"2143","leaf":true,"level":3,"nodeType":"def","questionId":"2282","status":"lock","submitted":580,"title":"Choose Numbers From Two Arrays in Range","titleSlug":"choose-numbers-from-two-arrays-in-range"},{"acceptance":0.6015158727252755,"acs":16428,"articleLive":0,"columnArticles":0,"formTitle":"[2144]Minimum Cost of Buying Candies With Discount","frequency":0.0,"frontendQuestionId":"2144","leaf":true,"level":1,"nodeType":"def","questionId":"2248","status":"","submitted":27311,"title":"Minimum Cost of Buying Candies With Discount","titleSlug":"minimum-cost-of-buying-candies-with-discount"},{"acceptance":0.3439464051384764,"acs":9960,"articleLive":0,"columnArticles":0,"formTitle":"[2145]Count the Hidden Sequences","frequency":0.0,"frontendQuestionId":"2145","leaf":true,"level":2,"nodeType":"def","questionId":"2249","status":"","submitted":28958,"title":"Count the Hidden Sequences","titleSlug":"count-the-hidden-sequences"},{"acceptance":0.3960521759205818,"acs":6862,"articleLive":0,"columnArticles":0,"formTitle":"[2146]K Highest Ranked Items Within a Price Range","frequency":0.0,"frontendQuestionId":"2146","leaf":true,"level":2,"nodeType":"def","questionId":"2250","status":"","submitted":17326,"title":"K Highest Ranked Items Within a Price Range","titleSlug":"k-highest-ranked-items-within-a-price-range"},{"acceptance":0.39146332363256475,"acs":5246,"articleLive":0,"columnArticles":0,"formTitle":"[2147]Number of Ways to Divide a Long Corridor","frequency":0.0,"frontendQuestionId":"2147","leaf":true,"level":3,"nodeType":"def","questionId":"2251","status":"","submitted":13401,"title":"Number of Ways to Divide a Long Corridor","titleSlug":"number-of-ways-to-divide-a-long-corridor"},{"acceptance":0.6062121917170777,"acs":20844,"articleLive":0,"columnArticles":0,"formTitle":"[2148]Count Elements With Strictly Smaller and Greater Elements ","frequency":0.0,"frontendQuestionId":"2148","leaf":true,"level":1,"nodeType":"def","questionId":"2269","status":"","submitted":34384,"title":"Count Elements With Strictly Smaller and Greater Elements ","titleSlug":"count-elements-with-strictly-smaller-and-greater-elements"},{"acceptance":0.8209424939714718,"acs":20086,"articleLive":0,"columnArticles":0,"formTitle":"[2149]Rearrange Array Elements by Sign","frequency":0.0,"frontendQuestionId":"2149","leaf":true,"level":2,"nodeType":"def","questionId":"2271","status":"","submitted":24467,"title":"Rearrange Array Elements by Sign","titleSlug":"rearrange-array-elements-by-sign"},{"acceptance":0.5999809680898306,"acs":18915,"articleLive":0,"columnArticles":0,"formTitle":"[2150]Find All Lonely Numbers in the Array","frequency":0.0,"frontendQuestionId":"2150","leaf":true,"level":2,"nodeType":"def","questionId":"2270","status":"","submitted":31526,"title":"Find All Lonely Numbers in the Array","titleSlug":"find-all-lonely-numbers-in-the-array"},{"acceptance":0.4460531285408536,"acs":7086,"articleLive":0,"columnArticles":0,"formTitle":"[2151]Maximum Good People Based on Statements","frequency":0.0,"frontendQuestionId":"2151","leaf":true,"level":3,"nodeType":"def","questionId":"2272","status":"","submitted":15886,"title":"Maximum Good People Based on Statements","titleSlug":"maximum-good-people-based-on-statements"},{"acceptance":0.4582089552238806,"acs":307,"articleLive":0,"columnArticles":0,"formTitle":"[2152]Minimum Number of Lines to Cover Points","frequency":0.0,"frontendQuestionId":"2152","leaf":true,"level":2,"nodeType":"def","questionId":"2287","status":"lock","submitted":670,"title":"Minimum Number of Lines to Cover Points","titleSlug":"minimum-number-of-lines-to-cover-points"},{"acceptance":0.6036866359447005,"acs":131,"articleLive":0,"columnArticles":0,"formTitle":"[2153]The Number of Passengers in Each Bus II","frequency":0.0,"frontendQuestionId":"2153","leaf":true,"level":3,"nodeType":"def","questionId":"2296","status":"lock","submitted":217,"title":"The Number of Passengers in Each Bus II","titleSlug":"the-number-of-passengers-in-each-bus-ii"},{"acceptance":0.7346215266687959,"acs":23001,"articleLive":0,"columnArticles":0,"formTitle":"[2154]Keep Multiplying Found Values by Two","frequency":0.0,"frontendQuestionId":"2154","leaf":true,"level":1,"nodeType":"def","questionId":"2274","status":"","submitted":31310,"title":"Keep Multiplying Found Values by Two","titleSlug":"keep-multiplying-found-values-by-two"},{"acceptance":0.6089174800354925,"acs":16470,"articleLive":0,"columnArticles":0,"formTitle":"[2155]All Divisions With the Highest Score of a Binary Array","frequency":0.0,"frontendQuestionId":"2155","leaf":true,"level":2,"nodeType":"def","questionId":"2261","status":"","submitted":27048,"title":"All Divisions With the Highest Score of a Binary Array","titleSlug":"all-divisions-with-the-highest-score-of-a-binary-array"},{"acceptance":0.19134600200031585,"acs":7270,"articleLive":0,"columnArticles":0,"formTitle":"[2156]Find Substring With Given Hash Value","frequency":0.0,"frontendQuestionId":"2156","leaf":true,"level":3,"nodeType":"def","questionId":"2275","status":"","submitted":37994,"title":"Find Substring With Given Hash Value","titleSlug":"find-substring-with-given-hash-value"},{"acceptance":0.23209682842093465,"acs":4142,"articleLive":0,"columnArticles":0,"formTitle":"[2157]Groups of Strings","frequency":0.0,"frontendQuestionId":"2157","leaf":true,"level":3,"nodeType":"def","questionId":"2276","status":"","submitted":17846,"title":"Groups of Strings","titleSlug":"groups-of-strings"},{"acceptance":0.6711956521739131,"acs":247,"articleLive":0,"columnArticles":0,"formTitle":"[2158]Amount of New Area Painted Each Day","frequency":0.0,"frontendQuestionId":"2158","leaf":true,"level":3,"nodeType":"def","questionId":"2297","status":"lock","submitted":368,"title":"Amount of New Area Painted Each Day","titleSlug":"amount-of-new-area-painted-each-day"},{"acceptance":0.668141592920354,"acs":151,"articleLive":0,"columnArticles":0,"formTitle":"[2159]Order Two Columns Independently","frequency":0.0,"frontendQuestionId":"2159","leaf":true,"level":2,"nodeType":"def","questionId":"2302","status":"lock","submitted":226,"title":"Order Two Columns Independently","titleSlug":"order-two-columns-independently"},{"acceptance":0.8561581578548705,"acs":11303,"articleLive":0,"columnArticles":0,"formTitle":"[2160]Minimum Sum of Four Digit Number After Splitting Digits","frequency":0.0,"frontendQuestionId":"2160","leaf":true,"level":1,"nodeType":"def","questionId":"2264","status":"","submitted":13202,"title":"Minimum Sum of Four Digit Number After Splitting Digits","titleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits"},{"acceptance":0.7956459076082834,"acs":10489,"articleLive":0,"columnArticles":0,"formTitle":"[2161]Partition Array According to Given Pivot","frequency":0.0,"frontendQuestionId":"2161","leaf":true,"level":2,"nodeType":"def","questionId":"2265","status":"","submitted":13183,"title":"Partition Array According to Given Pivot","titleSlug":"partition-array-according-to-given-pivot"},{"acceptance":0.3027114267269206,"acs":4689,"articleLive":0,"columnArticles":0,"formTitle":"[2162]Minimum Cost to Set Cooking Time","frequency":0.0,"frontendQuestionId":"2162","leaf":true,"level":2,"nodeType":"def","questionId":"2266","status":"","submitted":15490,"title":"Minimum Cost to Set Cooking Time","titleSlug":"minimum-cost-to-set-cooking-time"},{"acceptance":0.41602020566480247,"acs":2306,"articleLive":0,"columnArticles":0,"formTitle":"[2163]Minimum Difference in Sums After Removal of Elements","frequency":0.0,"frontendQuestionId":"2163","leaf":true,"level":3,"nodeType":"def","questionId":"2267","status":"","submitted":5543,"title":"Minimum Difference in Sums After Removal of Elements","titleSlug":"minimum-difference-in-sums-after-removal-of-elements"},{"acceptance":0.6673271350911955,"acs":13135,"articleLive":0,"columnArticles":0,"formTitle":"[2164]Sort Even and Odd Indices Independently","frequency":0.0,"frontendQuestionId":"2164","leaf":true,"level":1,"nodeType":"def","questionId":"2283","status":"","submitted":19683,"title":"Sort Even and Odd Indices Independently","titleSlug":"sort-even-and-odd-indices-independently"},{"acceptance":0.49380611905553706,"acs":11879,"articleLive":0,"columnArticles":0,"formTitle":"[2165]Smallest Value of the Rearranged Number","frequency":0.0,"frontendQuestionId":"2165","leaf":true,"level":2,"nodeType":"def","questionId":"2284","status":"","submitted":24056,"title":"Smallest Value of the Rearranged Number","titleSlug":"smallest-value-of-the-rearranged-number"},{"acceptance":0.24282719769422245,"acs":7414,"articleLive":0,"columnArticles":0,"formTitle":"[2166]Design Bitset","frequency":0.0,"frontendQuestionId":"2166","leaf":true,"level":2,"nodeType":"def","questionId":"2285","status":"","submitted":30532,"title":"Design Bitset","titleSlug":"design-bitset"},{"acceptance":0.31295843520782396,"acs":3456,"articleLive":0,"columnArticles":0,"formTitle":"[2167]Minimum Time to Remove All Cars Containing Illegal Goods","frequency":0.0,"frontendQuestionId":"2167","leaf":true,"level":3,"nodeType":"def","questionId":"2286","status":"","submitted":11043,"title":"Minimum Time to Remove All Cars Containing Illegal Goods","titleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods"}]
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1025DivisorGame.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1025DivisorGame.md
new file mode 100644
index 0000000..042b19a
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1025DivisorGame.md
@@ -0,0 +1,37 @@
+Alice and Bob take turns playing a game, with Alice starting first.
+
+Initially, there is a number n on the chalkboard. On each player's turn, that player makes a move consisting of:
+
+
+ - Choosing any
x with 0 < x < n and n % x == 0.
+ - Replacing the number
n on the chalkboard with n - x.
+
+
+Also, if a player cannot make a move, they lose the game.
+
+Return true if and only if Alice wins the game, assuming both players play optimally.
+
+
+Example 1:
+
+
+Input: n = 2
+Output: true
+Explanation: Alice chooses 1, and Bob has no more moves.
+
+
+Example 2:
+
+
+Input: n = 3
+Output: false
+Explanation: Alice chooses 1, Bob chooses 1, and Alice has no more moves.
+
+
+
+Constraints:
+
+
+Related Topics
MathDynamic ProgrammingBrainteaserGame Theory
👍 1209👎 2925
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1046LastStoneWeight.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1046LastStoneWeight.md
new file mode 100644
index 0000000..bc75231
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1046LastStoneWeight.md
@@ -0,0 +1,41 @@
+You are given an array of integers stones where stones[i] is the weight of the ith stone.
+
+We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them together. Suppose the heaviest two stones have weights x and y with x <= y. The result of this smash is:
+
+
+ - If
x == y, both stones are destroyed, and
+ - If
x != y, the stone of weight x is destroyed, and the stone of weight y has new weight y - x.
+
+
+At the end of the game, there is at most one stone left.
+
+Return the smallest possible weight of the left stone. If there are no stones left, return 0.
+
+
+Example 1:
+
+
+Input: stones = [2,7,4,1,8,1]
+Output: 1
+Explanation:
+We combine 7 and 8 to get 1 so the array converts to [2,4,1,1,1] then,
+we combine 2 and 4 to get 2 so the array converts to [2,1,1,1] then,
+we combine 2 and 1 to get 1 so the array converts to [1,1,1] then,
+we combine 1 and 1 to get 0 so the array converts to [1] then that's the value of the last stone.
+
+
+Example 2:
+
+
+Input: stones = [1]
+Output: 1
+
+
+
+Constraints:
+
+
+ 1 <= stones.length <= 301 <= stones[i] <= 1000
+Related Topics
ArrayHeap (Priority Queue)
👍 2802👎 59
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1137NThTribonacciNumber.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1137NThTribonacciNumber.md
new file mode 100644
index 0000000..3a6f32c
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1137NThTribonacciNumber.md
@@ -0,0 +1,31 @@
+The Tribonacci sequence Tn is defined as follows:
+
+T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
+
+Given n, return the value of Tn.
+
+
+Example 1:
+
+
+Input: n = 4
+Output: 4
+Explanation:
+T_3 = 0 + 1 + 1 = 2
+T_4 = 1 + 1 + 2 = 4
+
+
+Example 2:
+
+
+Input: n = 25
+Output: 1389537
+
+
+
+Constraints:
+
+
+ 0 <= n <= 37- The answer is guaranteed to fit within a 32-bit integer, ie.
answer <= 2^31 - 1.
+
Related Topics
MathDynamic ProgrammingMemoization
👍 1568👎 97
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P114FlattenBinaryTreeToLinkedList.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P114FlattenBinaryTreeToLinkedList.md
new file mode 100644
index 0000000..d5e4403
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P114FlattenBinaryTreeToLinkedList.md
@@ -0,0 +1,39 @@
+Given the root of a binary tree, flatten the tree into a "linked list":
+
+
+ - The "linked list" should use the same
TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null.
+ - The "linked list" should be in the same order as a pre-order traversal of the binary tree.
+
+
+
+Example 1:
+
+
+Input: root = [1,2,5,3,4,null,6]
+Output: [1,null,2,null,3,null,4,null,5,null,6]
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+Example 3:
+
+
+Input: root = [0]
+Output: [0]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 2000].
+ -100 <= Node.val <= 100
+
+
+Follow up: Can you flatten the tree in-place (with O(1) extra space)?Related Topics
Linked ListStackTreeDepth-First SearchBinary Tree
👍 5893👎 434
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P118PascalsTriangle.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P118PascalsTriangle.md
new file mode 100644
index 0000000..333140a
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P118PascalsTriangle.md
@@ -0,0 +1,19 @@
+Given an integer numRows, return the first numRows of Pascal's triangle.
+
+In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:
+
+
+Example 1:
+Input: numRows = 5
+Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]
+
Example 2:
+Input: numRows = 1
+Output: [[1]]
+
+
+Constraints:
+
+
+Related Topics
ArrayDynamic Programming
👍 4798👎 188
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P119PascalsTriangleIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P119PascalsTriangleIi.md
new file mode 100644
index 0000000..fbd52e8
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P119PascalsTriangleIi.md
@@ -0,0 +1,25 @@
+Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.
+
+In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:
+
+
+Example 1:
+Input: rowIndex = 3
+Output: [1,3,3,1]
+
Example 2:
+Input: rowIndex = 0
+Output: [1]
+
Example 3:
+Input: rowIndex = 1
+Output: [1,1]
+
+
+Constraints:
+
+
+
+
+Follow up: Could you optimize your algorithm to use only O(rowIndex) extra space?
+Related Topics
ArrayDynamic Programming
👍 2292👎 256
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P11ContainerWithMostWater.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P11ContainerWithMostWater.md
new file mode 100644
index 0000000..48b8c32
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P11ContainerWithMostWater.md
@@ -0,0 +1,33 @@
+You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
+
+Find two lines that together with the x-axis form a container, such that the container contains the most water.
+
+Return the maximum amount of water a container can store.
+
+Notice that you may not slant the container.
+
+
+Example 1:
+
+
+Input: height = [1,8,6,2,5,4,8,3,7]
+Output: 49
+Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
+
+
+Example 2:
+
+
+Input: height = [1,1]
+Output: 1
+
+
+
+Constraints:
+
+
+ n == height.length2 <= n <= 1050 <= height[i] <= 104
+Related Topics
ArrayTwo PointersGreedy
👍 15852👎 915
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P121BestTimeToBuyAndSellStock.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P121BestTimeToBuyAndSellStock.md
new file mode 100644
index 0000000..09828c3
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P121BestTimeToBuyAndSellStock.md
@@ -0,0 +1,32 @@
+You are given an array prices where prices[i] is the price of a given stock on the ith day.
+
+You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
+
+Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
+
+
+Example 1:
+
+
+Input: prices = [7,1,5,3,6,4]
+Output: 5
+Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
+Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.
+
+
+Example 2:
+
+
+Input: prices = [7,6,4,3,1]
+Output: 0
+Explanation: In this case, no transactions are done and the max profit = 0.
+
+
+
+Constraints:
+
+
+ 1 <= prices.length <= 1050 <= prices[i] <= 104
+Related Topics
ArrayDynamic Programming
👍 14606👎 491
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P122BestTimeToBuyAndSellStockIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P122BestTimeToBuyAndSellStockIi.md
new file mode 100644
index 0000000..0fa7bc0
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P122BestTimeToBuyAndSellStockIi.md
@@ -0,0 +1,42 @@
+You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
+
+On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.
+
+Find and return the maximum profit you can achieve.
+
+
+Example 1:
+
+
+Input: prices = [7,1,5,3,6,4]
+Output: 7
+Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
+Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
+Total profit is 4 + 3 = 7.
+
+
+Example 2:
+
+
+Input: prices = [1,2,3,4,5]
+Output: 4
+Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
+Total profit is 4.
+
+
+Example 3:
+
+
+Input: prices = [7,6,4,3,1]
+Output: 0
+Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.
+
+
+
+Constraints:
+
+
+ 1 <= prices.length <= 3 * 1040 <= prices[i] <= 104
+Related Topics
ArrayDynamic ProgrammingGreedy
👍 6938👎 2326
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P123BestTimeToBuyAndSellStockIii.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P123BestTimeToBuyAndSellStockIii.md
new file mode 100644
index 0000000..b7c4c4d
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P123BestTimeToBuyAndSellStockIii.md
@@ -0,0 +1,40 @@
+You are given an array prices where prices[i] is the price of a given stock on the ith day.
+
+Find the maximum profit you can achieve. You may complete at most two transactions.
+
+Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
+
+
+Example 1:
+
+
+Input: prices = [3,3,5,0,0,3,1,4]
+Output: 6
+Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
+Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.
+
+Example 2:
+
+
+Input: prices = [1,2,3,4,5]
+Output: 4
+Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
+Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are engaging multiple transactions at the same time. You must sell before buying again.
+
+
+Example 3:
+
+
+Input: prices = [7,6,4,3,1]
+Output: 0
+Explanation: In this case, no transaction is done, i.e. max profit = 0.
+
+
+
+Constraints:
+
+
+ 1 <= prices.length <= 1050 <= prices[i] <= 105
+Related Topics
ArrayDynamic Programming
👍 5407👎 114
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P125ValidPalindrome.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P125ValidPalindrome.md
new file mode 100644
index 0000000..5db5e88
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P125ValidPalindrome.md
@@ -0,0 +1,38 @@
+A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.
+
+Given a string s, return true if it is a palindrome, or false otherwise.
+
+
+Example 1:
+
+
+Input: s = "A man, a plan, a canal: Panama"
+Output: true
+Explanation: "amanaplanacanalpanama" is a palindrome.
+
+
+Example 2:
+
+
+Input: s = "race a car"
+Output: false
+Explanation: "raceacar" is not a palindrome.
+
+
+Example 3:
+
+
+Input: s = " "
+Output: true
+Explanation: s is an empty string "" after removing non-alphanumeric characters.
+Since an empty string reads the same forward and backward, it is a palindrome.
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 2 * 105s consists only of printable ASCII characters.
+Related Topics
Two PointersString
👍 3371👎 5023
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1260Shift2dGrid.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1260Shift2dGrid.md
new file mode 100644
index 0000000..0f9d0c6
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1260Shift2dGrid.md
@@ -0,0 +1,46 @@
+Given a 2D grid of size m x n and an integer k. You need to shift the grid k times.
+
+In one shift operation:
+
+
+ - Element at
grid[i][j] moves to grid[i][j + 1].
+ - Element at
grid[i][n - 1] moves to grid[i + 1][0].
+ - Element at
grid[m - 1][n - 1] moves to grid[0][0].
+
+
+Return the 2D grid after applying shift operation k times.
+
+
+Example 1:
+
+
+Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1
+Output: [[9,1,2],[3,4,5],[6,7,8]]
+
+
+Example 2:
+
+
+Input: grid = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4
+Output: [[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]
+
+
+Example 3:
+
+
+Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 9
+Output: [[1,2,3],[4,5,6],[7,8,9]]
+
+
+
+Constraints:
+
+
+ m == grid.lengthn == grid[i].length1 <= m <= 501 <= n <= 50-1000 <= grid[i][j] <= 10000 <= k <= 100
+Related Topics
ArrayMatrixSimulation
👍 1078👎 251
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1306JumpGameIii.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1306JumpGameIii.md
new file mode 100644
index 0000000..05017f3
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1306JumpGameIii.md
@@ -0,0 +1,43 @@
+Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach to any index with value 0.
+
+Notice that you can not jump outside of the array at any time.
+
+
+Example 1:
+
+
+Input: arr = [4,2,3,0,3,1,2], start = 5
+Output: true
+Explanation:
+All possible ways to reach at index 3 with value 0 are:
+index 5 -> index 4 -> index 1 -> index 3
+index 5 -> index 6 -> index 4 -> index 1 -> index 3
+
+
+Example 2:
+
+
+Input: arr = [4,2,3,0,3,1,2], start = 0
+Output: true
+Explanation:
+One possible way to reach at index 3 with value 0 is:
+index 0 -> index 4 -> index 1 -> index 3
+
+
+Example 3:
+
+
+Input: arr = [3,0,2,1,2], start = 2
+Output: false
+Explanation: There is no way to reach at index 1 with value 0.
+
+
+
+Constraints:
+
+
+ 1 <= arr.length <= 5 * 1040 <= arr[i] < arr.length0 <= start < arr.length
+Related Topics
ArrayDepth-First SearchBreadth-First Search
👍 2537👎 60
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1337TheKWeakestRowsInAMatrix.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1337TheKWeakestRowsInAMatrix.md
new file mode 100644
index 0000000..4de4f4f
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1337TheKWeakestRowsInAMatrix.md
@@ -0,0 +1,63 @@
+You are given an m x n binary matrix mat of 1's (representing soldiers) and 0's (representing civilians). The soldiers are positioned in front of the civilians. That is, all the 1's will appear to the left of all the 0's in each row.
+
+A row i is weaker than a row j if one of the following is true:
+
+
+ - The number of soldiers in row
i is less than the number of soldiers in row j.
+ - Both rows have the same number of soldiers and
i < j.
+
+
+Return the indices of the k weakest rows in the matrix ordered from weakest to strongest.
+
+
+Example 1:
+
+
+Input: mat =
+[[1,1,0,0,0],
+ [1,1,1,1,0],
+ [1,0,0,0,0],
+ [1,1,0,0,0],
+ [1,1,1,1,1]],
+k = 3
+Output: [2,0,3]
+Explanation:
+The number of soldiers in each row is:
+- Row 0: 2
+- Row 1: 4
+- Row 2: 1
+- Row 3: 2
+- Row 4: 5
+The rows ordered from weakest to strongest are [2,0,3,1,4].
+
+
+Example 2:
+
+
+Input: mat =
+[[1,0,0,0],
+ [1,1,1,1],
+ [1,0,0,0],
+ [1,0,0,0]],
+k = 2
+Output: [0,2]
+Explanation:
+The number of soldiers in each row is:
+- Row 0: 1
+- Row 1: 4
+- Row 2: 1
+- Row 3: 1
+The rows ordered from weakest to strongest are [0,2,3,1].
+
+
+
+Constraints:
+
+
+ m == mat.lengthn == mat[i].length2 <= n, m <= 1001 <= k <= mmatrix[i][j] is either 0 or 1.
+Related Topics
ArrayBinary SearchSortingHeap (Priority Queue)Matrix
👍 1947👎 102
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1340JumpGameV.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1340JumpGameV.md
new file mode 100644
index 0000000..06f4294
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1340JumpGameV.md
@@ -0,0 +1,49 @@
+Given an array of integers arr and an integer d. In one step you can jump from index i to index:
+
+
+ i + x where: i + x < arr.length and 0 < x <= d.i - x where: i - x >= 0 and 0 < x <= d.
+
+In addition, you can only jump from index i to index j if arr[i] > arr[j] and arr[i] > arr[k] for all indices k between i and j (More formally min(i, j) < k < max(i, j)).
+
+You can choose any index of the array and start jumping. Return the maximum number of indices you can visit.
+
+Notice that you can not jump outside of the array at any time.
+
+
+Example 1:
+
+
+Input: arr = [6,4,14,6,8,13,9,7,10,6,12], d = 2
+Output: 4
+Explanation: You can start at index 10. You can jump 10 --> 8 --> 6 --> 7 as shown.
+Note that if you start at index 6 you can only jump to index 7. You cannot jump to index 5 because 13 > 9. You cannot jump to index 4 because index 5 is between index 4 and 6 and 13 > 9.
+Similarly You cannot jump from index 3 to index 2 or index 1.
+
+
+Example 2:
+
+
+Input: arr = [3,3,3,3,3], d = 3
+Output: 1
+Explanation: You can start at any index. You always cannot jump to any index.
+
+
+Example 3:
+
+
+Input: arr = [7,6,5,4,3,2,1], d = 1
+Output: 7
+Explanation: Start at index 0. You can visit all the indicies.
+
+
+
+Constraints:
+
+
+ 1 <= arr.length <= 10001 <= arr[i] <= 1051 <= d <= arr.length
+Related Topics
ArrayDynamic ProgrammingSorting
👍 625👎 22
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1345JumpGameIv.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1345JumpGameIv.md
new file mode 100644
index 0000000..d03f672
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1345JumpGameIv.md
@@ -0,0 +1,47 @@
+Given an array of integers arr, you are initially positioned at the first index of the array.
+
+In one step you can jump from index i to index:
+
+
+ i + 1 where: i + 1 < arr.length.i - 1 where: i - 1 >= 0.j where: arr[i] == arr[j] and i != j.
+
+Return the minimum number of steps to reach the last index of the array.
+
+Notice that you can not jump outside of the array at any time.
+
+
+Example 1:
+
+
+Input: arr = [100,-23,-23,404,100,23,23,23,3,404]
+Output: 3
+Explanation: You need three jumps from index 0 --> 4 --> 3 --> 9. Note that index 9 is the last index of the array.
+
+
+Example 2:
+
+
+Input: arr = [7]
+Output: 0
+Explanation: Start index is the last index. You do not need to jump.
+
+
+Example 3:
+
+
+Input: arr = [7,6,9,6,9,6,9,7]
+Output: 1
+Explanation: You can jump directly from index 0 to index 7 which is last index of the array.
+
+
+
+Constraints:
+
+
+ 1 <= arr.length <= 5 * 104-108 <= arr[i] <= 108
+Related Topics
ArrayHash TableBreadth-First Search
👍 1756👎 71
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P143ReorderList.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P143ReorderList.md
new file mode 100644
index 0000000..6be92f0
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P143ReorderList.md
@@ -0,0 +1,37 @@
+You are given the head of a singly linked-list. The list can be represented as:
+
+
+L0 → L1 → … → Ln - 1 → Ln
+
+
+Reorder the list to be on the following form:
+
+
+L0 → Ln → L1 → Ln - 1 → L2 → Ln - 2 → …
+
+
+You may not modify the values in the list's nodes. Only nodes themselves may be changed.
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4]
+Output: [1,4,2,3]
+
+
+Example 2:
+
+
+Input: head = [1,2,3,4,5]
+Output: [1,5,2,4,3]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is in the range
[1, 5 * 104].
+ 1 <= Node.val <= 1000
+Related Topics
Linked ListTwo PointersStackRecursion
👍 4293👎 177
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P144BinaryTreePreorderTraversal.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P144BinaryTreePreorderTraversal.md
new file mode 100644
index 0000000..482dbbf
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P144BinaryTreePreorderTraversal.md
@@ -0,0 +1,49 @@
+Given the root of a binary tree, return the preorder traversal of its nodes' values.
+
+
+Example 1:
+
+
+Input: root = [1,null,2,3]
+Output: [1,2,3]
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+Example 3:
+
+
+Input: root = [1]
+Output: [1]
+
+
+Example 4:
+
+
+Input: root = [1,2]
+Output: [1,2]
+
+
+Example 5:
+
+
+Input: root = [1,null,2]
+Output: [1,2]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 100].
+ -100 <= Node.val <= 100
+
+
+Follow up: Recursive solution is trivial, could you do it iteratively?
+Related Topics
StackTreeDepth-First SearchBinary Tree
👍 3175👎 109
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P145BinaryTreePostorderTraversal.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P145BinaryTreePostorderTraversal.md
new file mode 100644
index 0000000..3253286
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P145BinaryTreePostorderTraversal.md
@@ -0,0 +1,48 @@
+Given the root of a binary tree, return the postorder traversal of its nodes' values.
+
+
+Example 1:
+
+
+Input: root = [1,null,2,3]
+Output: [3,2,1]
+
+
+Example 2:
+
+
+Input: root = []
+Output: []
+
+
+Example 3:
+
+
+Input: root = [1]
+Output: [1]
+
+
+Example 4:
+
+
+Input: root = [1,2]
+Output: [2,1]
+
+
+Example 5:
+
+
+Input: root = [1,null,2]
+Output: [2,1]
+
+
+
+Constraints:
+
+
+ - The number of the nodes in the tree is in the range
[0, 100].
+ -100 <= Node.val <= 100
+
+
+Follow up: Recursive solution is trivial, could you do it iteratively?Related Topics
StackTreeDepth-First SearchBinary Tree
👍 3356👎 128
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1475FinalPricesWithASpecialDiscountInAShop.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1475FinalPricesWithASpecialDiscountInAShop.md
new file mode 100644
index 0000000..5106f1c
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1475FinalPricesWithASpecialDiscountInAShop.md
@@ -0,0 +1,40 @@
+Given the array prices where prices[i] is the price of the ith item in a shop. There is a special discount for items in the shop, if you buy the ith item, then you will receive a discount equivalent to prices[j] where j is the minimum index such that j > i and prices[j] <= prices[i], otherwise, you will not receive any discount at all.
+
+Return an array where the ith element is the final price you will pay for the ith item of the shop considering the special discount.
+
+
+Example 1:
+
+
+Input: prices = [8,4,6,2,3]
+Output: [4,2,4,2,3]
+Explanation:
+For item 0 with price[0]=8 you will receive a discount equivalent to prices[1]=4, therefore, the final price you will pay is 8 - 4 = 4.
+For item 1 with price[1]=4 you will receive a discount equivalent to prices[3]=2, therefore, the final price you will pay is 4 - 2 = 2.
+For item 2 with price[2]=6 you will receive a discount equivalent to prices[3]=2, therefore, the final price you will pay is 6 - 2 = 4.
+For items 3 and 4 you will not receive any discount at all.
+
+
+Example 2:
+
+
+Input: prices = [1,2,3,4,5]
+Output: [1,2,3,4,5]
+Explanation: In this case, for all items, you will not receive any discount at all.
+
+
+Example 3:
+
+
+Input: prices = [10,1,1,6]
+Output: [9,0,1,6]
+
+
+
+Constraints:
+
+
+ 1 <= prices.length <= 5001 <= prices[i] <= 10^3
+Related Topics
ArrayStackMonotonic Stack
👍 771👎 58
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P150EvaluateReversePolishNotation.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P150EvaluateReversePolishNotation.md
new file mode 100644
index 0000000..25e171b
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P150EvaluateReversePolishNotation.md
@@ -0,0 +1,47 @@
+Evaluate the value of an arithmetic expression in Reverse Polish Notation.
+
+Valid operators are +, -, *, and /. Each operand may be an integer or another expression.
+
+Note that division between two integers should truncate toward zero.
+
+It is guaranteed that the given RPN expression is always valid. That means the expression would always evaluate to a result, and there will not be any division by zero operation.
+
+
+Example 1:
+
+
+Input: tokens = ["2","1","+","3","*"]
+Output: 9
+Explanation: ((2 + 1) * 3) = 9
+
+
+Example 2:
+
+
+Input: tokens = ["4","13","5","/","+"]
+Output: 6
+Explanation: (4 + (13 / 5)) = 6
+
+
+Example 3:
+
+
+Input: tokens = ["10","6","9","3","+","-11","*","/","*","17","+","5","+"]
+Output: 22
+Explanation: ((10 * (6 / ((9 + 3) * -11))) + 17) + 5
+= ((10 * (6 / (12 * -11))) + 17) + 5
+= ((10 * (6 / -132)) + 17) + 5
+= ((10 * 0) + 17) + 5
+= (0 + 17) + 5
+= 17 + 5
+= 22
+
+
+
+Constraints:
+
+
+ 1 <= tokens.length <= 104tokens[i] is either an operator: "+", "-", "*", or "/", or an integer in the range [-200, 200].
+Related Topics
ArrayMathStack
👍 2329👎 573
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P151ReverseWordsInAString.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P151ReverseWordsInAString.md
new file mode 100644
index 0000000..ab3983b
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P151ReverseWordsInAString.md
@@ -0,0 +1,44 @@
+Given an input string s, reverse the order of the words.
+
+A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.
+
+Return a string of the words in reverse order concatenated by a single space.
+
+Note that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separating the words. Do not include any extra spaces.
+
+
+Example 1:
+
+
+Input: s = "the sky is blue"
+Output: "blue is sky the"
+
+
+Example 2:
+
+
+Input: s = " hello world "
+Output: "world hello"
+Explanation: Your reversed string should not contain leading or trailing spaces.
+
+
+Example 3:
+
+
+Input: s = "a good example"
+Output: "example good a"
+Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 104s contains English letters (upper-case and lower-case), digits, and spaces ' '.- There is at least one word in
s.
+
+
+
+Follow-up: If the string data type is mutable in your language, can you solve it in-place with O(1) extra space?
+Related Topics
Two PointersString
👍 2950👎 3816
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P15ThreeSum.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P15ThreeSum.md
new file mode 100644
index 0000000..ffe5734
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P15ThreeSum.md
@@ -0,0 +1,23 @@
+Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
+
+Notice that the solution set must not contain duplicate triplets.
+
+
+Example 1:
+Input: nums = [-1,0,1,2,-1,-4]
+Output: [[-1,-1,2],[-1,0,1]]
+
Example 2:
+Input: nums = []
+Output: []
+
Example 3:
+Input: nums = [0]
+Output: []
+
+
+Constraints:
+
+
+ 0 <= nums.length <= 3000-105 <= nums[i] <= 105
+Related Topics
ArrayTwo PointersSorting
👍 17009👎 1640
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1614MaximumNestingDepthOfTheParentheses.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1614MaximumNestingDepthOfTheParentheses.md
new file mode 100644
index 0000000..6637e0d
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1614MaximumNestingDepthOfTheParentheses.md
@@ -0,0 +1,60 @@
+A string is a valid parentheses string (denoted VPS) if it meets one of the following:
+
+
+ - It is an empty string
"", or a single character not equal to "(" or ")",
+ - It can be written as
AB (A concatenated with B), where A and B are VPS's, or
+ - It can be written as
(A), where A is a VPS.
+
+
+We can similarly define the nesting depth depth(S) of any VPS S as follows:
+
+
+ depth("") = 0depth(C) = 0, where C is a string with a single character not equal to "(" or ")".depth(A + B) = max(depth(A), depth(B)), where A and B are VPS's.depth("(" + A + ")") = 1 + depth(A), where A is a VPS.
+
+For example, "", "()()", and "()(()())" are VPS's (with nesting depths 0, 1, and 2), and ")(" and "(()" are not VPS's.
+
+Given a VPS represented as string s, return the nesting depth of s.
+
+
+Example 1:
+
+
+Input: s = "(1+(2*3)+((8)/4))+1"
+Output: 3
+Explanation: Digit 8 is inside of 3 nested parentheses in the string.
+
+
+Example 2:
+
+
+Input: s = "(1)+((2))+(((3)))"
+Output: 3
+
+
+Example 3:
+
+
+Input: s = "1+(2*3)/(2-1)"
+Output: 1
+
+
+Example 4:
+
+
+Input: s = "1"
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 100s consists of digits 0-9 and characters '+', '-', '*', '/', '(', and ')'.- It is guaranteed that parentheses expression
s is a VPS.
+
+Related Topics
StringStack
👍 604👎 140
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1646GetMaximumInGeneratedArray.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1646GetMaximumInGeneratedArray.md
new file mode 100644
index 0000000..5de7c61
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1646GetMaximumInGeneratedArray.md
@@ -0,0 +1,52 @@
+You are given an integer n. A 0-indexed integer array nums of length n + 1 is generated in the following way:
+
+
+ nums[0] = 0nums[1] = 1nums[2 * i] = nums[i] when 2 <= 2 * i <= nnums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n
+
+Return the maximum integer in the array nums.
+
+
+Example 1:
+
+
+Input: n = 7
+Output: 3
+Explanation: According to the given rules:
+ nums[0] = 0
+ nums[1] = 1
+ nums[(1 * 2) = 2] = nums[1] = 1
+ nums[(1 * 2) + 1 = 3] = nums[1] + nums[2] = 1 + 1 = 2
+ nums[(2 * 2) = 4] = nums[2] = 1
+ nums[(2 * 2) + 1 = 5] = nums[2] + nums[3] = 1 + 2 = 3
+ nums[(3 * 2) = 6] = nums[3] = 2
+ nums[(3 * 2) + 1 = 7] = nums[3] + nums[4] = 2 + 1 = 3
+Hence, nums = [0,1,1,2,1,3,2,3], and the maximum is max(0,1,1,2,1,3,2,3) = 3.
+
+
+Example 2:
+
+
+Input: n = 2
+Output: 1
+Explanation: According to the given rules, nums = [0,1,1]. The maximum is max(0,1,1) = 1.
+
+
+Example 3:
+
+
+Input: n = 3
+Output: 2
+Explanation: According to the given rules, nums = [0,1,1,2]. The maximum is max(0,1,1,2) = 2.
+
+
+
+Constraints:
+
+
+Related Topics
ArrayDynamic ProgrammingSimulation
👍 343👎 496
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1696JumpGameVi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1696JumpGameVi.md
new file mode 100644
index 0000000..0a210c4
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1696JumpGameVi.md
@@ -0,0 +1,40 @@
+You are given a 0-indexed integer array nums and an integer k.
+
+You are initially standing at index 0. In one move, you can jump at most k steps forward without going outside the boundaries of the array. That is, you can jump from index i to any index in the range [i + 1, min(n - 1, i + k)] inclusive.
+
+You want to reach the last index of the array (index n - 1). Your score is the sum of all nums[j] for each index j you visited in the array.
+
+Return the maximum score you can get.
+
+
+Example 1:
+
+
+Input: nums = [1,-1,-2,4,-7,3], k = 2
+Output: 7
+Explanation: You can choose your jumps forming the subsequence [1,-1,4,3] (underlined above). The sum is 7.
+
+
+Example 2:
+
+
+Input: nums = [10,-5,-2,4,0,3], k = 3
+Output: 17
+Explanation: You can choose your jumps forming the subsequence [10,4,3] (underlined above). The sum is 17.
+
+
+Example 3:
+
+
+Input: nums = [1,-5,-20,4,-1,3,-6,-3], k = 2
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= nums.length, k <= 105-104 <= nums[i] <= 104
+Related Topics
ArrayDynamic ProgrammingQueueSliding WindowHeap (Priority Queue)Monotonic Queue
👍 1258👎 52
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1700NumberOfStudentsUnableToEatLunch.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1700NumberOfStudentsUnableToEatLunch.md
new file mode 100644
index 0000000..d8dd3b6
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1700NumberOfStudentsUnableToEatLunch.md
@@ -0,0 +1,48 @@
+The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches.
+
+The number of sandwiches in the cafeteria is equal to the number of students. The sandwiches are placed in a stack. At each step:
+
+
+ - If the student at the front of the queue prefers the sandwich on the top of the stack, they will take it and leave the queue.
+ - Otherwise, they will leave it and go to the queue's end.
+
+
+This continues until none of the queue students want to take the top sandwich and are thus unable to eat.
+
+You are given two integer arrays students and sandwiches where sandwiches[i] is the type of the ith sandwich in the stack (i = 0 is the top of the stack) and students[j] is the preference of the jth student in the initial queue (j = 0 is the front of the queue). Return the number of students that are unable to eat.
+
+
+Example 1:
+
+
+Input: students = [1,1,0,0], sandwiches = [0,1,0,1]
+Output: 0
+Explanation:
+- Front student leaves the top sandwich and returns to the end of the line making students = [1,0,0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [0,0,1,1].
+- Front student takes the top sandwich and leaves the line making students = [0,1,1] and sandwiches = [1,0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [1,1,0].
+- Front student takes the top sandwich and leaves the line making students = [1,0] and sandwiches = [0,1].
+- Front student leaves the top sandwich and returns to the end of the line making students = [0,1].
+- Front student takes the top sandwich and leaves the line making students = [1] and sandwiches = [1].
+- Front student takes the top sandwich and leaves the line making students = [] and sandwiches = [].
+Hence all students are able to eat.
+
+
+Example 2:
+
+
+Input: students = [1,1,1,0,0,1], sandwiches = [1,0,0,0,1,1]
+Output: 3
+
+
+
+Constraints:
+
+
+ 1 <= students.length, sandwiches.length <= 100students.length == sandwiches.lengthsandwiches[i] is 0 or 1.students[i] is 0 or 1.
+Related Topics
ArrayStackQueueSimulation
👍 560👎 34
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P1721SwappingNodesInALinkedList.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P1721SwappingNodesInALinkedList.md
new file mode 100644
index 0000000..69a8363
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P1721SwappingNodesInALinkedList.md
@@ -0,0 +1,28 @@
+You are given the head of a linked list, and an integer k.
+
+Return the head of the linked list after swapping the values of the kth node from the beginning and the kth node from the end (the list is 1-indexed).
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4,5], k = 2
+Output: [1,4,3,2,5]
+
+
+Example 2:
+
+
+Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5
+Output: [7,9,6,6,8,7,3,0,9,5]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is
n.
+ 1 <= k <= n <= 1050 <= Node.val <= 100
+Related Topics
Linked ListTwo Pointers
👍 2276👎 88
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P173BinarySearchTreeIterator.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P173BinarySearchTreeIterator.md
new file mode 100644
index 0000000..fc29ecc
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P173BinarySearchTreeIterator.md
@@ -0,0 +1,51 @@
+Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):
+
+
+ BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the constructor. The pointer should be initialized to a non-existent number smaller than any element in the BST.boolean hasNext() Returns true if there exists a number in the traversal to the right of the pointer, otherwise returns false.int next() Moves the pointer to the right, then returns the number at the pointer.
+
+Notice that by initializing the pointer to a non-existent smallest number, the first call to next() will return the smallest element in the BST.
+
+You may assume that next() calls will always be valid. That is, there will be at least a next number in the in-order traversal when next() is called.
+
+
+Example 1:
+
+
+Input
+["BSTIterator", "next", "next", "hasNext", "next", "hasNext", "next", "hasNext", "next", "hasNext"]
+[[[7, 3, 15, null, null, 9, 20]], [], [], [], [], [], [], [], [], []]
+Output
+[null, 3, 7, true, 9, true, 15, true, 20, false]
+
+Explanation
+BSTIterator bSTIterator = new BSTIterator([7, 3, 15, null, null, 9, 20]);
+bSTIterator.next(); // return 3
+bSTIterator.next(); // return 7
+bSTIterator.hasNext(); // return True
+bSTIterator.next(); // return 9
+bSTIterator.hasNext(); // return True
+bSTIterator.next(); // return 15
+bSTIterator.hasNext(); // return True
+bSTIterator.next(); // return 20
+bSTIterator.hasNext(); // return False
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[1, 105].
+ 0 <= Node.val <= 106- At most
105 calls will be made to hasNext, and next.
+
+
+
+Follow up:
+
+
+ - Could you implement
next() and hasNext() to run in average O(1) time and use O(h) memory, where h is the height of the tree?
+
+Related Topics
StackTreeDesignBinary Search TreeBinary TreeIterator
👍 4462👎 340
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P188BestTimeToBuyAndSellStockIv.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P188BestTimeToBuyAndSellStockIv.md
new file mode 100644
index 0000000..a1c17cd
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P188BestTimeToBuyAndSellStockIv.md
@@ -0,0 +1,32 @@
+You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k.
+
+Find the maximum profit you can achieve. You may complete at most k transactions.
+
+Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
+
+
+Example 1:
+
+
+Input: k = 2, prices = [2,4,1]
+Output: 2
+Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.
+
+
+Example 2:
+
+
+Input: k = 2, prices = [3,2,6,5,0,3]
+Output: 7
+Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
+
+
+
+Constraints:
+
+
+ 0 <= k <= 1000 <= prices.length <= 10000 <= prices[i] <= 1000
+Related Topics
ArrayDynamic Programming
👍 3616👎 150
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P203RemoveLinkedListElements.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P203RemoveLinkedListElements.md
new file mode 100644
index 0000000..3ba06e1
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P203RemoveLinkedListElements.md
@@ -0,0 +1,33 @@
+Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.
+
+
+Example 1:
+
+
+Input: head = [1,2,6,3,4,5,6], val = 6
+Output: [1,2,3,4,5]
+
+
+Example 2:
+
+
+Input: head = [], val = 1
+Output: []
+
+
+Example 3:
+
+
+Input: head = [7,7,7,7], val = 7
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is in the range
[0, 104].
+ 1 <= Node.val <= 500 <= val <= 50
+Related Topics
Linked ListRecursion
👍 4772👎 162
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P206ReverseLinkedList.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P206ReverseLinkedList.md
new file mode 100644
index 0000000..c8ee01a
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P206ReverseLinkedList.md
@@ -0,0 +1,35 @@
+Given the head of a singly linked list, reverse the list, and return the reversed list.
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4,5]
+Output: [5,4,3,2,1]
+
+
+Example 2:
+
+
+Input: head = [1,2]
+Output: [2,1]
+
+
+Example 3:
+
+
+Input: head = []
+Output: []
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is the range
[0, 5000].
+ -5000 <= Node.val <= 5000
+
+
+Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?
+Related Topics
Linked ListRecursion
👍 11390👎 196
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P209MinimumSizeSubarraySum.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P209MinimumSizeSubarraySum.md
new file mode 100644
index 0000000..ff04468
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P209MinimumSizeSubarraySum.md
@@ -0,0 +1,36 @@
+Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, ..., numsr-1, numsr] of which the sum is greater than or equal to target. If there is no such subarray, return 0 instead.
+
+
+Example 1:
+
+
+Input: target = 7, nums = [2,3,1,2,4,3]
+Output: 2
+Explanation: The subarray [4,3] has the minimal length under the problem constraint.
+
+
+Example 2:
+
+
+Input: target = 4, nums = [1,4,4]
+Output: 1
+
+
+Example 3:
+
+
+Input: target = 11, nums = [1,1,1,1,1,1,1,1]
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= target <= 1091 <= nums.length <= 1051 <= nums[i] <= 105
+
+
+Follow up: If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log(n)).Related Topics
ArrayBinary SearchSliding WindowPrefix Sum
👍 6263👎 182
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P20ValidParentheses.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P20ValidParentheses.md
new file mode 100644
index 0000000..b952c11
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P20ValidParentheses.md
@@ -0,0 +1,39 @@
+Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
+
+An input string is valid if:
+
+
+ - Open brackets must be closed by the same type of brackets.
+ - Open brackets must be closed in the correct order.
+
+
+
+Example 1:
+
+
+Input: s = "()"
+Output: true
+
+
+Example 2:
+
+
+Input: s = "()[]{}"
+Output: true
+
+
+Example 3:
+
+
+Input: s = "(]"
+Output: false
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 104s consists of parentheses only '()[]{}'.
+Related Topics
StringStack
👍 11889👎 517
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P227BasicCalculatorIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P227BasicCalculatorIi.md
new file mode 100644
index 0000000..bd3c4cd
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P227BasicCalculatorIi.md
@@ -0,0 +1,30 @@
+Given a string s which represents an expression, evaluate this expression and return its value.
+
+The integer division should truncate toward zero.
+
+You may assume that the given expression is always valid. All intermediate results will be in the range of [-231, 231 - 1].
+
+Note: You are not allowed to use any built-in function which evaluates strings as mathematical expressions, such as eval().
+
+
+Example 1:
+Input: s = "3+2*2"
+Output: 7
+
Example 2:
+Input: s = " 3/2 "
+Output: 1
+
Example 3:
+Input: s = " 3+5 / 2 "
+Output: 5
+
+
+Constraints:
+
+
+ 1 <= s.length <= 3 * 105s consists of integers and operators ('+', '-', '*', '/') separated by some number of spaces.s represents a valid expression.- All the integers in the expression are non-negative integers in the range
[0, 231 - 1].
+ - The answer is guaranteed to fit in a 32-bit integer.
+
+Related Topics
MathStringStack
👍 3184👎 460
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P234PalindromeLinkedList.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P234PalindromeLinkedList.md
new file mode 100644
index 0000000..d9ce593
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P234PalindromeLinkedList.md
@@ -0,0 +1,27 @@
+Given the head of a singly linked list, return true if it is a palindrome.
+
+
+Example 1:
+
+
+Input: head = [1,2,2,1]
+Output: true
+
+
+Example 2:
+
+
+Input: head = [1,2]
+Output: false
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is in the range
[1, 105].
+ 0 <= Node.val <= 9
+
+
+Follow up: Could you do it in O(n) time and O(1) space?Related Topics
Linked ListTwo PointersStackRecursion
👍 6975👎 486
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P239SlidingWindowMaximum.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P239SlidingWindowMaximum.md
new file mode 100644
index 0000000..a427c5f
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P239SlidingWindowMaximum.md
@@ -0,0 +1,37 @@
+You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.
+
+Return the max sliding window.
+
+
+Example 1:
+
+
+Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
+Output: [3,3,5,5,6,7]
+Explanation:
+Window position Max
+--------------- -----
+[1 3 -1] -3 5 3 6 7 3
+ 1 [3 -1 -3] 5 3 6 7 3
+ 1 3 [-1 -3 5] 3 6 7 5
+ 1 3 -1 [-3 5 3] 6 7 5
+ 1 3 -1 -3 [5 3 6] 7 6
+ 1 3 -1 -3 5 [3 6 7] 7
+
+
+Example 2:
+
+
+Input: nums = [1], k = 1
+Output: [1]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 105-104 <= nums[i] <= 1041 <= k <= nums.length
+Related Topics
ArrayQueueSliding WindowHeap (Priority Queue)Monotonic Queue
👍 9253👎 326
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P240SearchA2dMatrixIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P240SearchA2dMatrixIi.md
new file mode 100644
index 0000000..16ac6ec
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P240SearchA2dMatrixIi.md
@@ -0,0 +1,35 @@
+Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:
+
+
+ - Integers in each row are sorted in ascending from left to right.
+ - Integers in each column are sorted in ascending from top to bottom.
+
+
+
+Example 1:
+
+
+Input: matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 5
+Output: true
+
+
+Example 2:
+
+
+Input: matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 20
+Output: false
+
+
+
+Constraints:
+
+
+ m == matrix.lengthn == matrix[i].length1 <= n, m <= 300-109 <= matrix[i][j] <= 109- All the integers in each row are sorted in ascending order.
+ - All the integers in each column are sorted in ascending order.
+ -109 <= target <= 109
+Related Topics
ArrayBinary SearchDivide and ConquerMatrix
👍 7022👎 121
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P283MoveZeroes.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P283MoveZeroes.md
new file mode 100644
index 0000000..07fa847
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P283MoveZeroes.md
@@ -0,0 +1,22 @@
+Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
+
+Note that you must do this in-place without making a copy of the array.
+
+
+Example 1:
+Input: nums = [0,1,0,3,12]
+Output: [1,3,12,0,0]
+
Example 2:
+Input: nums = [0]
+Output: [0]
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 104-231 <= nums[i] <= 231 - 1
+
+
+Follow up: Could you minimize the total number of operations done?Related Topics
ArrayTwo Pointers
👍 8752👎 236
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P287FindTheDuplicateNumber.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P287FindTheDuplicateNumber.md
new file mode 100644
index 0000000..c5687ca
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P287FindTheDuplicateNumber.md
@@ -0,0 +1,39 @@
+Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive.
+
+There is only one repeated number in nums, return this repeated number.
+
+You must solve the problem without modifying the array nums and uses only constant extra space.
+
+
+Example 1:
+
+
+Input: nums = [1,3,4,2,2]
+Output: 2
+
+
+Example 2:
+
+
+Input: nums = [3,1,3,4,2]
+Output: 3
+
+
+
+Constraints:
+
+
+ 1 <= n <= 105nums.length == n + 11 <= nums[i] <= n- All the integers in
nums appear only once except for precisely one integer which appears two or more times.
+
+
+
+Follow up:
+
+
+ - How can we prove that at least one duplicate number must exist in
nums?
+ - Can you solve the problem in linear runtime complexity?
+
+Related Topics
ArrayTwo PointersBinary SearchBit Manipulation
👍 12840👎 1451
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P289GameOfLife.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P289GameOfLife.md
new file mode 100644
index 0000000..b801bb7
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P289GameOfLife.md
@@ -0,0 +1,46 @@
+According to Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."
+
+The board is made up of an m x n grid of cells, where each cell has an initial state: live (represented by a 1) or dead (represented by a 0). Each cell interacts with its eight neighbors (horizontal, vertical, diagonal) using the following four rules (taken from the above Wikipedia article):
+
+
+ - Any live cell with fewer than two live neighbors dies as if caused by under-population.
+ - Any live cell with two or three live neighbors lives on to the next generation.
+ - Any live cell with more than three live neighbors dies, as if by over-population.
+ - Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
+
+
+The next state is created by applying the above rules simultaneously to every cell in the current state, where births and deaths occur simultaneously. Given the current state of the m x n grid board, return the next state.
+
+
+Example 1:
+
+
+Input: board = [[0,1,0],[0,0,1],[1,1,1],[0,0,0]]
+Output: [[0,0,0],[1,0,1],[0,1,1],[0,1,0]]
+
+
+Example 2:
+
+
+Input: board = [[1,1],[1,0]]
+Output: [[1,1],[1,1]]
+
+
+
+Constraints:
+
+
+ m == board.lengthn == board[i].length1 <= m, n <= 25board[i][j] is 0 or 1.
+
+
+Follow up:
+
+
+ - Could you solve it in-place? Remember that the board needs to be updated simultaneously: You cannot update some cells first and then use their updated values to update other cells.
+ - In this question, we represent the board using a 2D array. In principle, the board is infinite, which would cause problems when the active area encroaches upon the border of the array (i.e., live cells reach the border). How would you address these problems?
+
+Related Topics
ArrayMatrixSimulation
👍 4347👎 421
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P309BestTimeToBuyAndSellStockWithCooldown.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P309BestTimeToBuyAndSellStockWithCooldown.md
new file mode 100644
index 0000000..626a3f9
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P309BestTimeToBuyAndSellStockWithCooldown.md
@@ -0,0 +1,34 @@
+You are given an array prices where prices[i] is the price of a given stock on the ith day.
+
+Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:
+
+
+ - After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).
+
+
+Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
+
+
+Example 1:
+
+
+Input: prices = [1,2,3,0,2]
+Output: 3
+Explanation: transactions = [buy, sell, cooldown, buy, sell]
+
+
+Example 2:
+
+
+Input: prices = [1]
+Output: 0
+
+
+
+Constraints:
+
+
+ 1 <= prices.length <= 50000 <= prices[i] <= 1000
+Related Topics
ArrayDynamic Programming
👍 5376👎 184
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P316RemoveDuplicateLetters.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P316RemoveDuplicateLetters.md
new file mode 100644
index 0000000..1819500
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P316RemoveDuplicateLetters.md
@@ -0,0 +1,28 @@
+Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.
+
+
+Example 1:
+
+
+Input: s = "bcabc"
+Output: "abc"
+
+
+Example 2:
+
+
+Input: s = "cbacdcbc"
+Output: "acdb"
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 104s consists of lowercase English letters.
+
+
+Note: This question is the same as 1081: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/
+Related Topics
StringStackGreedyMonotonic Stack
👍 3506👎 247
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P31NextPermutation.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P31NextPermutation.md
new file mode 100644
index 0000000..a046092
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P31NextPermutation.md
@@ -0,0 +1,48 @@
+A permutation of an array of integers is an arrangement of its members into a sequence or linear order.
+
+
+ - For example, for
arr = [1,2,3], the following are considered permutations of arr: [1,2,3], [1,3,2], [3,1,2], [2,3,1].
+
+
+The next permutation of an array of integers is the next lexicographically greater permutation of its integer. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it in the sorted container. If such arrangement is not possible, the array must be rearranged as the lowest possible order (i.e., sorted in ascending order).
+
+
+ - For example, the next permutation of
arr = [1,2,3] is [1,3,2].
+ - Similarly, the next permutation of
arr = [2,3,1] is [3,1,2].
+ - While the next permutation of
arr = [3,2,1] is [1,2,3] because [3,2,1] does not have a lexicographical larger rearrangement.
+
+
+Given an array of integers nums, find the next permutation of nums.
+
+The replacement must be in place and use only constant extra memory.
+
+
+Example 1:
+
+
+Input: nums = [1,2,3]
+Output: [1,3,2]
+
+
+Example 2:
+
+
+Input: nums = [3,2,1]
+Output: [1,2,3]
+
+
+Example 3:
+
+
+Input: nums = [1,1,5]
+Output: [1,5,1]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1000 <= nums[i] <= 100
+Related Topics
ArrayTwo Pointers
👍 9895👎 3263
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P338CountingBits.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P338CountingBits.md
new file mode 100644
index 0000000..2c2d0bc
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P338CountingBits.md
@@ -0,0 +1,43 @@
+Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
+
+
+Example 1:
+
+
+Input: n = 2
+Output: [0,1,1]
+Explanation:
+0 --> 0
+1 --> 1
+2 --> 10
+
+
+Example 2:
+
+
+Input: n = 5
+Output: [0,1,1,2,1,2]
+Explanation:
+0 --> 0
+1 --> 1
+2 --> 10
+3 --> 11
+4 --> 100
+5 --> 101
+
+
+
+Constraints:
+
+
+
+
+Follow up:
+
+
+ - It is very easy to come up with a solution with a runtime of
O(n log n). Can you do it in linear time O(n) and possibly in a single pass?
+ - Can you do it without using any built-in function (i.e., like
__builtin_popcount in C++)?
+
+Related Topics
Dynamic ProgrammingBit Manipulation
👍 6221👎 295
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P33SearchInRotatedSortedArray.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P33SearchInRotatedSortedArray.md
new file mode 100644
index 0000000..21a9156
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P33SearchInRotatedSortedArray.md
@@ -0,0 +1,30 @@
+There is an integer array nums sorted in ascending order (with distinct values).
+
+Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].
+
+Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.
+
+You must write an algorithm with O(log n) runtime complexity.
+
+
+Example 1:
+Input: nums = [4,5,6,7,0,1,2], target = 0
+Output: 4
+
Example 2:
+Input: nums = [4,5,6,7,0,1,2], target = 3
+Output: -1
+
Example 3:
+Input: nums = [1], target = 0
+Output: -1
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 5000-104 <= nums[i] <= 104- All values of
nums are unique.
+ nums is an ascending array that is possibly rotated.-104 <= target <= 104
+Related Topics
ArrayBinary Search
👍 13402👎 868
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P344ReverseString.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P344ReverseString.md
new file mode 100644
index 0000000..5cb6ee9
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P344ReverseString.md
@@ -0,0 +1,20 @@
+Write a function that reverses a string. The input string is given as an array of characters s.
+
+You must do this by modifying the input array in-place with O(1) extra memory.
+
+
+Example 1:
+Input: s = ["h","e","l","l","o"]
+Output: ["o","l","l","e","h"]
+
Example 2:
+Input: s = ["H","a","n","n","a","h"]
+Output: ["h","a","n","n","a","H"]
+
+
+Constraints:
+
+
+Related Topics
Two PointersStringRecursion
👍 4603👎 926
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P347TopKFrequentElements.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P347TopKFrequentElements.md
new file mode 100644
index 0000000..c0136f8
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P347TopKFrequentElements.md
@@ -0,0 +1,22 @@
+Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
+
+
+Example 1:
+Input: nums = [1,1,1,2,2,3], k = 2
+Output: [1,2]
+
Example 2:
+Input: nums = [1], k = 1
+Output: [1]
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 105k is in the range [1, the number of unique elements in the array].- It is guaranteed that the answer is unique.
+
+
+
+Follow up: Your algorithm's time complexity must be better than O(n log n), where n is the array's size.
+Related Topics
ArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect
👍 8361👎 353
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P34FindFirstAndLastPositionOfElementInSortedArray.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P34FindFirstAndLastPositionOfElementInSortedArray.md
new file mode 100644
index 0000000..65862cb
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P34FindFirstAndLastPositionOfElementInSortedArray.md
@@ -0,0 +1,27 @@
+Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
+
+If target is not found in the array, return [-1, -1].
+
+You must write an algorithm with O(log n) runtime complexity.
+
+
+Example 1:
+Input: nums = [5,7,7,8,8,10], target = 8
+Output: [3,4]
+
Example 2:
+Input: nums = [5,7,7,8,8,10], target = 6
+Output: [-1,-1]
+
Example 3:
+Input: nums = [], target = 0
+Output: [-1,-1]
+
+
+Constraints:
+
+
+ 0 <= nums.length <= 105-109 <= nums[i] <= 109nums is a non-decreasing array.-109 <= target <= 109
+Related Topics
ArrayBinary Search
👍 10041👎 284
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P367ValidPerfectSquare.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P367ValidPerfectSquare.md
new file mode 100644
index 0000000..394e1c8
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P367ValidPerfectSquare.md
@@ -0,0 +1,19 @@
+Given a positive integer num, write a function which returns True if num is a perfect square else False.
+
+Follow up: Do not use any built-in library function such as sqrt.
+
+
+Example 1:
+Input: num = 16
+Output: true
+
Example 2:
+Input: num = 14
+Output: false
+
+
+Constraints:
+
+
+Related Topics
MathBinary Search
👍 2138👎 227
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P389FindTheDifference.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P389FindTheDifference.md
new file mode 100644
index 0000000..9317529
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P389FindTheDifference.md
@@ -0,0 +1,31 @@
+You are given two strings s and t.
+
+String t is generated by random shuffling string s and then add one more letter at a random position.
+
+Return the letter that was added to t.
+
+
+Example 1:
+
+
+Input: s = "abcd", t = "abcde"
+Output: "e"
+Explanation: 'e' is the letter that was added.
+
+
+Example 2:
+
+
+Input: s = "", t = "y"
+Output: "y"
+
+
+
+Constraints:
+
+
+ 0 <= s.length <= 1000t.length == s.length + 1s and t consist of lowercase English letters.
+Related Topics
Hash TableStringBit ManipulationSorting
👍 1918👎 349
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P392IsSubsequence.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P392IsSubsequence.md
new file mode 100644
index 0000000..b4c4c8f
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P392IsSubsequence.md
@@ -0,0 +1,23 @@
+Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
+
+A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not).
+
+
+Example 1:
+Input: s = "abc", t = "ahbgdc"
+Output: true
+
Example 2:
+Input: s = "axc", t = "ahbgdc"
+Output: false
+
+
+Constraints:
+
+
+ 0 <= s.length <= 1000 <= t.length <= 104s and t consist only of lowercase English letters.
+
+
+Follow up: Suppose there are lots of incoming s, say s1, s2, ..., sk where k >= 109, and you want to check one by one to see if t has its subsequence. In this scenario, how would you change your code?Related Topics
Two PointersStringDynamic Programming
👍 3743👎 269
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P410SplitArrayLargestSum.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P410SplitArrayLargestSum.md
new file mode 100644
index 0000000..9f91740
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P410SplitArrayLargestSum.md
@@ -0,0 +1,39 @@
+Given an array nums which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays.
+
+Write an algorithm to minimize the largest sum among these m subarrays.
+
+
+Example 1:
+
+
+Input: nums = [7,2,5,10,8], m = 2
+Output: 18
+Explanation:
+There are four ways to split nums into two subarrays.
+The best way is to split it into [7,2,5] and [10,8],
+where the largest sum among the two subarrays is only 18.
+
+
+Example 2:
+
+
+Input: nums = [1,2,3,4,5], m = 2
+Output: 9
+
+
+Example 3:
+
+
+Input: nums = [1,4,4], m = 3
+Output: 4
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 10000 <= nums[i] <= 1061 <= m <= min(50, nums.length)
+Related Topics
ArrayBinary SearchDynamic ProgrammingGreedy
👍 5287👎 136
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P45JumpGameIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P45JumpGameIi.md
new file mode 100644
index 0000000..d94df6c
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P45JumpGameIi.md
@@ -0,0 +1,32 @@
+Given an array of non-negative integers nums, you are initially positioned at the first index of the array.
+
+Each element in the array represents your maximum jump length at that position.
+
+Your goal is to reach the last index in the minimum number of jumps.
+
+You can assume that you can always reach the last index.
+
+
+Example 1:
+
+
+Input: nums = [2,3,1,1,4]
+Output: 2
+Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
+
+
+Example 2:
+
+
+Input: nums = [2,3,0,1,4]
+Output: 2
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1040 <= nums[i] <= 1000
+Related Topics
ArrayDynamic ProgrammingGreedy
👍 7470👎 279
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P509FibonacciNumber.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P509FibonacciNumber.md
new file mode 100644
index 0000000..3381256
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P509FibonacciNumber.md
@@ -0,0 +1,41 @@
+The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
+
+
+F(0) = 0, F(1) = 1
+F(n) = F(n - 1) + F(n - 2), for n > 1.
+
+
+Given n, calculate F(n).
+
+
+Example 1:
+
+
+Input: n = 2
+Output: 1
+Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
+
+
+Example 2:
+
+
+Input: n = 3
+Output: 2
+Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
+
+
+Example 3:
+
+
+Input: n = 4
+Output: 3
+Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
+
+
+
+Constraints:
+
+
+Related Topics
MathDynamic ProgrammingRecursionMemoization
👍 3020👎 255
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P53MaximumSubarray.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P53MaximumSubarray.md
new file mode 100644
index 0000000..54eaa91
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P53MaximumSubarray.md
@@ -0,0 +1,38 @@
+Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
+
+A subarray is a contiguous part of an array.
+
+
+Example 1:
+
+
+Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
+Output: 6
+Explanation: [4,-1,2,1] has the largest sum = 6.
+
+
+Example 2:
+
+
+Input: nums = [1]
+Output: 1
+
+
+Example 3:
+
+
+Input: nums = [5,4,-1,7,8]
+Output: 23
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 105-104 <= nums[i] <= 104
+
+
+Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
+Related Topics
ArrayDivide and ConquerDynamic Programming
👍 18193👎 864
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P541ReverseStringIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P541ReverseStringIi.md
new file mode 100644
index 0000000..a959eac
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P541ReverseStringIi.md
@@ -0,0 +1,21 @@
+Given a string s and an integer k, reverse the first k characters for every 2k characters counting from the start of the string.
+
+If there are fewer than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and leave the other as original.
+
+
+Example 1:
+Input: s = "abcdefg", k = 2
+Output: "bacdfeg"
+
Example 2:
+Input: s = "abcd", k = 2
+Output: "bacd"
+
+
+Constraints:
+
+
+ 1 <= s.length <= 104s consists of only lowercase English letters.1 <= k <= 104
+Related Topics
Two PointersString
👍 932👎 2327
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P54SpiralMatrix.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P54SpiralMatrix.md
new file mode 100644
index 0000000..c46528e
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P54SpiralMatrix.md
@@ -0,0 +1,27 @@
+Given an m x n matrix, return all elements of the matrix in spiral order.
+
+
+Example 1:
+
+
+Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
+Output: [1,2,3,6,9,8,7,4,5]
+
+
+Example 2:
+
+
+Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
+Output: [1,2,3,4,8,12,11,10,9,5,6,7]
+
+
+
+Constraints:
+
+
+ m == matrix.lengthn == matrix[i].length1 <= m, n <= 10-100 <= matrix[i][j] <= 100
+Related Topics
ArrayMatrixSimulation
👍 6757👎 820
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P557ReverseWordsInAStringIii.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P557ReverseWordsInAStringIii.md
new file mode 100644
index 0000000..2050011
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P557ReverseWordsInAStringIii.md
@@ -0,0 +1,21 @@
+Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.
+
+
+Example 1:
+Input: s = "Let's take LeetCode contest"
+Output: "s'teL ekat edoCteeL tsetnoc"
+
Example 2:
+Input: s = "God Ding"
+Output: "doG gniD"
+
+
+Constraints:
+
+
+ 1 <= s.length <= 5 * 104s contains printable ASCII characters.s does not contain any leading or trailing spaces.- There is at least one word in
s.
+ - All the words in
s are separated by a single space.
+
+Related Topics
Two PointersString
👍 2638👎 156
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P55JumpGame.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P55JumpGame.md
new file mode 100644
index 0000000..37c6b9d
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P55JumpGame.md
@@ -0,0 +1,29 @@
+You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
+
+Return true if you can reach the last index, or false otherwise.
+
+
+Example 1:
+
+
+Input: nums = [2,3,1,1,4]
+Output: true
+Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
+
+
+Example 2:
+
+
+Input: nums = [3,2,1,0,4]
+Output: false
+Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 1040 <= nums[i] <= 105
+Related Topics
ArrayDynamic ProgrammingGreedy
👍 10182👎 589
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P589NAryTreePreorderTraversal.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P589NAryTreePreorderTraversal.md
new file mode 100644
index 0000000..7ccff30
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P589NAryTreePreorderTraversal.md
@@ -0,0 +1,35 @@
+Given the root of an n-ary tree, return the preorder traversal of its nodes' values.
+
+Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)
+
+
+Example 1:
+
+
+
+
+Input: root = [1,null,3,2,4,null,5,6]
+Output: [1,3,5,6,2,4]
+
+
+Example 2:
+
+
+
+
+Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+Output: [1,2,3,6,7,11,14,4,8,12,5,9,13,10]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 104].
+ 0 <= Node.val <= 104- The height of the n-ary tree is less than or equal to
1000.
+
+
+
+Follow up: Recursive solution is trivial, could you do it iteratively?
+Related Topics
StackTreeDepth-First Search
👍 1402👎 72
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P590NAryTreePostorderTraversal.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P590NAryTreePostorderTraversal.md
new file mode 100644
index 0000000..f827e67
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P590NAryTreePostorderTraversal.md
@@ -0,0 +1,31 @@
+Given the root of an n-ary tree, return the postorder traversal of its nodes' values.
+
+Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)
+
+
+Example 1:
+
+
+Input: root = [1,null,3,2,4,null,5,6]
+Output: [5,6,3,2,4,1]
+
+
+Example 2:
+
+
+Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
+Output: [2,6,14,11,7,3,12,8,4,13,9,10,5,1]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the tree is in the range
[0, 104].
+ 0 <= Node.val <= 104- The height of the n-ary tree is less than or equal to
1000.
+
+
+
+Follow up: Recursive solution is trivial, could you do it iteratively?
+Related Topics
StackTreeDepth-First Search
👍 1330👎 76
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P59SpiralMatrixIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P59SpiralMatrixIi.md
new file mode 100644
index 0000000..15bebfc
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P59SpiralMatrixIi.md
@@ -0,0 +1,24 @@
+Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order.
+
+
+Example 1:
+
+
+Input: n = 3
+Output: [[1,2,3],[8,9,4],[7,6,5]]
+
+
+Example 2:
+
+
+Input: n = 1
+Output: [[1]]
+
+
+
+Constraints:
+
+
+Related Topics
ArrayMatrixSimulation
👍 2691👎 166
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P5LongestPalindromicSubstring.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P5LongestPalindromicSubstring.md
new file mode 100644
index 0000000..c824ad5
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P5LongestPalindromicSubstring.md
@@ -0,0 +1,26 @@
+Given a string s, return the longest palindromic substring in s.
+
+
+Example 1:
+
+
+Input: s = "babad"
+Output: "bab"
+Explanation: "aba" is also a valid answer.
+
+
+Example 2:
+
+
+Input: s = "cbbd"
+Output: "bb"
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 1000s consist of only digits and English letters.
+Related Topics
StringDynamic Programming
👍 16475👎 970
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P680ValidPalindromeIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P680ValidPalindromeIi.md
new file mode 100644
index 0000000..7c116f5
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P680ValidPalindromeIi.md
@@ -0,0 +1,33 @@
+Given a string s, return true if the s can be palindrome after deleting at most one character from it.
+
+
+Example 1:
+
+
+Input: s = "aba"
+Output: true
+
+
+Example 2:
+
+
+Input: s = "abca"
+Output: true
+Explanation: You could delete the character 'c'.
+
+
+Example 3:
+
+
+Input: s = "abc"
+Output: false
+
+
+
+Constraints:
+
+
+ 1 <= s.length <= 105s consists of lowercase English letters.
+Related Topics
Two PointersStringGreedy
👍 5035👎 280
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P682BaseballGame.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P682BaseballGame.md
new file mode 100644
index 0000000..9d99b6b
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P682BaseballGame.md
@@ -0,0 +1,62 @@
+You are keeping score for a baseball game with strange rules. The game consists of several rounds, where the scores of past rounds may affect future rounds' scores.
+
+At the beginning of the game, you start with an empty record. You are given a list of strings ops, where ops[i] is the ith operation you must apply to the record and is one of the following:
+
+
+ - An integer
x - Record a new score of x.
+ "+" - Record a new score that is the sum of the previous two scores. It is guaranteed there will always be two previous scores."D" - Record a new score that is double the previous score. It is guaranteed there will always be a previous score."C" - Invalidate the previous score, removing it from the record. It is guaranteed there will always be a previous score.
+
+Return the sum of all the scores on the record.
+
+
+Example 1:
+
+
+Input: ops = ["5","2","C","D","+"]
+Output: 30
+Explanation:
+"5" - Add 5 to the record, record is now [5].
+"2" - Add 2 to the record, record is now [5, 2].
+"C" - Invalidate and remove the previous score, record is now [5].
+"D" - Add 2 * 5 = 10 to the record, record is now [5, 10].
+"+" - Add 5 + 10 = 15 to the record, record is now [5, 10, 15].
+The total sum is 5 + 10 + 15 = 30.
+
+
+Example 2:
+
+
+Input: ops = ["5","-2","4","C","D","9","+","+"]
+Output: 27
+Explanation:
+"5" - Add 5 to the record, record is now [5].
+"-2" - Add -2 to the record, record is now [5, -2].
+"4" - Add 4 to the record, record is now [5, -2, 4].
+"C" - Invalidate and remove the previous score, record is now [5, -2].
+"D" - Add 2 * -2 = -4 to the record, record is now [5, -2, -4].
+"9" - Add 9 to the record, record is now [5, -2, -4, 9].
+"+" - Add -4 + 9 = 5 to the record, record is now [5, -2, -4, 9, 5].
+"+" - Add 9 + 5 = 14 to the record, record is now [5, -2, -4, 9, 5, 14].
+The total sum is 5 + -2 + -4 + 9 + 5 + 14 = 27.
+
+
+Example 3:
+
+
+Input: ops = ["1"]
+Output: 1
+
+
+
+Constraints:
+
+
+ 1 <= ops.length <= 1000ops[i] is "C", "D", "+", or a string representing an integer in the range [-3 * 104, 3 * 104].- For operation
"+", there will always be at least two previous scores on the record.
+ - For operations
"C" and "D", there will always be at least one previous score on the record.
+
+Related Topics
ArrayStackSimulation
👍 1476👎 1567
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P69Sqrtx.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P69Sqrtx.md
new file mode 100644
index 0000000..4ea51fb
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P69Sqrtx.md
@@ -0,0 +1,28 @@
+Given a non-negative integer x, compute and return the square root of x.
+
+Since the return type is an integer, the decimal digits are truncated, and only the integer part of the result is returned.
+
+Note: You are not allowed to use any built-in exponent function or operator, such as pow(x, 0.5) or x ** 0.5.
+
+
+Example 1:
+
+
+Input: x = 4
+Output: 2
+
+
+Example 2:
+
+
+Input: x = 8
+Output: 2
+Explanation: The square root of 8 is 2.82842..., and since the decimal part is truncated, 2 is returned.
+
+
+Constraints:
+
+
+Related Topics
MathBinary Search
👍 3613👎 3109
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P703KthLargestElementInAStream.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P703KthLargestElementInAStream.md
new file mode 100644
index 0000000..2e682b9
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P703KthLargestElementInAStream.md
@@ -0,0 +1,40 @@
+Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.
+
+Implement KthLargest class:
+
+
+ KthLargest(int k, int[] nums) Initializes the object with the integer k and the stream of integers nums.int add(int val) Appends the integer val to the stream and returns the element representing the kth largest element in the stream.
+
+
+Example 1:
+
+
+Input
+["KthLargest", "add", "add", "add", "add", "add"]
+[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
+Output
+[null, 4, 5, 5, 8, 8]
+
+Explanation
+KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
+kthLargest.add(3); // return 4
+kthLargest.add(5); // return 5
+kthLargest.add(10); // return 5
+kthLargest.add(9); // return 8
+kthLargest.add(4); // return 8
+
+
+
+Constraints:
+
+
+ 1 <= k <= 1040 <= nums.length <= 104-104 <= nums[i] <= 104-104 <= val <= 104- At most
104 calls will be made to add.
+ - It is guaranteed that there will be at least
k elements in the array when you search for the kth element.
+
+Related Topics
TreeDesignBinary Search TreeHeap (Priority Queue)Binary TreeData Stream
👍 2654👎 1550
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P707DesignLinkedList.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P707DesignLinkedList.md
new file mode 100644
index 0000000..5ae42e7
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P707DesignLinkedList.md
@@ -0,0 +1,44 @@
+Design your implementation of the linked list. You can choose to use a singly or doubly linked list.
+A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node.
+If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.
+
+Implement the MyLinkedList class:
+
+
+ MyLinkedList() Initializes the MyLinkedList object.int get(int index) Get the value of the indexth node in the linked list. If the index is invalid, return -1.void addAtHead(int val) Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list.void addAtTail(int val) Append a node of value val as the last element of the linked list.void addAtIndex(int index, int val) Add a node of value val before the indexth node in the linked list. If index equals the length of the linked list, the node will be appended to the end of the linked list. If index is greater than the length, the node will not be inserted.void deleteAtIndex(int index) Delete the indexth node in the linked list, if the index is valid.
+
+
+Example 1:
+
+
+Input
+["MyLinkedList", "addAtHead", "addAtTail", "addAtIndex", "get", "deleteAtIndex", "get"]
+[[], [1], [3], [1, 2], [1], [1], [1]]
+Output
+[null, null, null, null, 2, null, 3]
+
+Explanation
+MyLinkedList myLinkedList = new MyLinkedList();
+myLinkedList.addAtHead(1);
+myLinkedList.addAtTail(3);
+myLinkedList.addAtIndex(1, 2); // linked list becomes 1->2->3
+myLinkedList.get(1); // return 2
+myLinkedList.deleteAtIndex(1); // now the linked list is 1->3
+myLinkedList.get(1); // return 3
+
+
+
+Constraints:
+
+
+ 0 <= index, val <= 1000- Please do not use the built-in LinkedList library.
+ - At most
2000 calls will be made to get, addAtHead, addAtTail, addAtIndex and deleteAtIndex.
+
+Related Topics
Linked ListDesign
👍 1414👎 1165
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P70ClimbingStairs.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P70ClimbingStairs.md
new file mode 100644
index 0000000..ed2f2a2
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P70ClimbingStairs.md
@@ -0,0 +1,33 @@
+You are climbing a staircase. It takes n steps to reach the top.
+
+Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
+
+
+Example 1:
+
+
+Input: n = 2
+Output: 2
+Explanation: There are two ways to climb to the top.
+1. 1 step + 1 step
+2. 2 steps
+
+
+Example 2:
+
+
+Input: n = 3
+Output: 3
+Explanation: There are three ways to climb to the top.
+1. 1 step + 1 step + 1 step
+2. 1 step + 2 steps
+3. 2 steps + 1 step
+
+
+
+Constraints:
+
+
+Related Topics
MathDynamic ProgrammingMemoization
👍 10245👎 316
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P714BestTimeToBuyAndSellStockWithTransactionFee.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P714BestTimeToBuyAndSellStockWithTransactionFee.md
new file mode 100644
index 0000000..3f24d86
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P714BestTimeToBuyAndSellStockWithTransactionFee.md
@@ -0,0 +1,36 @@
+You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee.
+
+Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction.
+
+Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
+
+
+Example 1:
+
+
+Input: prices = [1,3,2,8,4,9], fee = 2
+Output: 8
+Explanation: The maximum profit can be achieved by:
+- Buying at prices[0] = 1
+- Selling at prices[3] = 8
+- Buying at prices[4] = 4
+- Selling at prices[5] = 9
+The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.
+
+
+Example 2:
+
+
+Input: prices = [1,3,7,5,10,3], fee = 3
+Output: 6
+
+
+
+Constraints:
+
+
+ 1 <= prices.length <= 5 * 1041 <= prices[i] < 5 * 1040 <= fee < 5 * 104
+Related Topics
ArrayDynamic ProgrammingGreedy
👍 3695👎 98
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P71SimplifyPath.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P71SimplifyPath.md
new file mode 100644
index 0000000..7499661
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P71SimplifyPath.md
@@ -0,0 +1,56 @@
+Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path.
+
+In a Unix-style file system, a period '.' refers to the current directory, a double period '..' refers to the directory up a level, and any multiple consecutive slashes (i.e. '//') are treated as a single slash '/'. For this problem, any other format of periods such as '...' are treated as file/directory names.
+
+The canonical path should have the following format:
+
+
+ - The path starts with a single slash
'/'.
+ - Any two directories are separated by a single slash
'/'.
+ - The path does not end with a trailing
'/'.
+ - The path only contains the directories on the path from the root directory to the target file or directory (i.e., no period
'.' or double period '..')
+
+
+Return the simplified canonical path.
+
+
+Example 1:
+
+
+Input: path = "/home/"
+Output: "/home"
+Explanation: Note that there is no trailing slash after the last directory name.
+
+
+Example 2:
+
+
+Input: path = "/../"
+Output: "/"
+Explanation: Going one level up from the root directory is a no-op, as the root level is the highest level you can go.
+
+
+Example 3:
+
+
+Input: path = "/home//foo/"
+Output: "/home/foo"
+Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
+
+
+Example 4:
+
+
+Input: path = "/a/./b/../../c/"
+Output: "/c"
+
+
+
+Constraints:
+
+
+ 1 <= path.length <= 3000path consists of English letters, digits, period '.', slash '/' or '_'.path is a valid absolute Unix path.
+Related Topics
StringStack
👍 979👎 252
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P746MinCostClimbingStairs.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P746MinCostClimbingStairs.md
new file mode 100644
index 0000000..782c0a8
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P746MinCostClimbingStairs.md
@@ -0,0 +1,40 @@
+You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps.
+
+You can either start from the step with index 0, or the step with index 1.
+
+Return the minimum cost to reach the top of the floor.
+
+
+Example 1:
+
+
+Input: cost = [10,15,20]
+Output: 15
+Explanation: You will start at index 1.
+- Pay 15 and climb two steps to reach the top.
+The total cost is 15.
+
+
+Example 2:
+
+
+Input: cost = [1,100,1,1,1,100,1,1,100,1]
+Output: 6
+Explanation: You will start at index 0.
+- Pay 1 and climb two steps to reach index 2.
+- Pay 1 and climb two steps to reach index 4.
+- Pay 1 and climb two steps to reach index 6.
+- Pay 1 and climb one step to reach index 7.
+- Pay 1 and climb two steps to reach index 9.
+- Pay 1 and climb one step to reach the top.
+The total cost is 6.
+
+
+
+Constraints:
+
+
+ 2 <= cost.length <= 10000 <= cost[i] <= 999
+Related Topics
ArrayDynamic Programming
👍 5427👎 957
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P74SearchA2dMatrix.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P74SearchA2dMatrix.md
new file mode 100644
index 0000000..5b238ef
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P74SearchA2dMatrix.md
@@ -0,0 +1,32 @@
+Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:
+
+
+ - Integers in each row are sorted from left to right.
+ - The first integer of each row is greater than the last integer of the previous row.
+
+
+
+Example 1:
+
+
+Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
+Output: true
+
+
+Example 2:
+
+
+Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
+Output: false
+
+
+
+Constraints:
+
+
+ m == matrix.lengthn == matrix[i].length1 <= m, n <= 100-104 <= matrix[i][j], target <= 104
+Related Topics
ArrayBinary SearchMatrix
👍 6910👎 260
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P76MinimumWindowSubstring.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P76MinimumWindowSubstring.md
new file mode 100644
index 0000000..93deb8e
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P76MinimumWindowSubstring.md
@@ -0,0 +1,44 @@
+Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".
+
+The testcases will be generated such that the answer is unique.
+
+A substring is a contiguous sequence of characters within the string.
+
+
+Example 1:
+
+
+Input: s = "ADOBECODEBANC", t = "ABC"
+Output: "BANC"
+Explanation: The minimum window substring "BANC" includes 'A', 'B', and 'C' from string t.
+
+
+Example 2:
+
+
+Input: s = "a", t = "a"
+Output: "a"
+Explanation: The entire string s is the minimum window.
+
+
+Example 3:
+
+
+Input: s = "a", t = "aa"
+Output: ""
+Explanation: Both 'a's from t must be included in the window.
+Since the largest window of s only has one 'a', return empty string.
+
+
+
+Constraints:
+
+
+ m == s.lengthn == t.length1 <= m, n <= 105s and t consist of uppercase and lowercase English letters.
+
+
+Follow up: Could you find an algorithm that runs in O(m + n) time?Related Topics
Hash TableStringSliding Window
👍 9910👎 529
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P81SearchInRotatedSortedArrayIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P81SearchInRotatedSortedArrayIi.md
new file mode 100644
index 0000000..97651b2
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P81SearchInRotatedSortedArrayIi.md
@@ -0,0 +1,29 @@
+There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).
+
+Before being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,4,4,5,6,6,7] might be rotated at pivot index 5 and become [4,5,6,6,7,0,1,2,4,4].
+
+Given the array nums after the rotation and an integer target, return true if target is in nums, or false if it is not in nums.
+
+You must decrease the overall operation steps as much as possible.
+
+
+Example 1:
+Input: nums = [2,5,6,0,0,1,2], target = 0
+Output: true
+
Example 2:
+Input: nums = [2,5,6,0,0,1,2], target = 3
+Output: false
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 5000-104 <= nums[i] <= 104nums is guaranteed to be rotated at some pivot.-104 <= target <= 104
+
+
+Follow up: This problem is similar to Search in Rotated Sorted Array, but nums may contain duplicates. Would this affect the runtime complexity? How and why?
+Related Topics
ArrayBinary Search
👍 4050👎 695
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P881BoatsToSavePeople.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P881BoatsToSavePeople.md
new file mode 100644
index 0000000..4dfeb6e
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P881BoatsToSavePeople.md
@@ -0,0 +1,37 @@
+You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most two people at the same time, provided the sum of the weight of those people is at most limit.
+
+Return the minimum number of boats to carry every given person.
+
+
+Example 1:
+
+
+Input: people = [1,2], limit = 3
+Output: 1
+Explanation: 1 boat (1, 2)
+
+
+Example 2:
+
+
+Input: people = [3,2,2,1], limit = 3
+Output: 3
+Explanation: 3 boats (1, 2), (2) and (3)
+
+
+Example 3:
+
+
+Input: people = [3,5,3,4], limit = 5
+Output: 4
+Explanation: 4 boats (3), (3), (4), (5)
+
+
+
+Constraints:
+
+
+ 1 <= people.length <= 5 * 1041 <= people[i] <= limit <= 3 * 104
+Related Topics
ArrayTwo PointersGreedySorting
👍 2534👎 64
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P897IncreasingOrderSearchTree.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P897IncreasingOrderSearchTree.md
new file mode 100644
index 0000000..dba875a
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P897IncreasingOrderSearchTree.md
@@ -0,0 +1,24 @@
+Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.
+
+
+Example 1:
+
+
+Input: root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
+Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
+
+
+Example 2:
+
+
+Input: root = [5,1,7]
+Output: [1,null,5,null,7]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the given tree will be in the range
[1, 100].
+ 0 <= Node.val <= 1000
Related Topics
StackTreeDepth-First SearchBinary Search TreeBinary Tree
👍 1913👎 571
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P904FruitIntoBaskets.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P904FruitIntoBaskets.md
new file mode 100644
index 0000000..e143cd7
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P904FruitIntoBaskets.md
@@ -0,0 +1,47 @@
+You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where fruits[i] is the type of fruit the ith tree produces.
+
+You want to collect as much fruit as possible. However, the owner has some strict rules that you must follow:
+
+
+ - You only have two baskets, and each basket can only hold a single type of fruit. There is no limit on the amount of fruit each basket can hold.
+ - Starting from any tree of your choice, you must pick exactly one fruit from every tree (including the start tree) while moving to the right. The picked fruits must fit in one of your baskets.
+ - Once you reach a tree with fruit that cannot fit in your baskets, you must stop.
+
+
+Given the integer array fruits, return the maximum number of fruits you can pick.
+
+
+Example 1:
+
+
+Input: fruits = [1,2,1]
+Output: 3
+Explanation: We can pick from all 3 trees.
+
+
+Example 2:
+
+
+Input: fruits = [0,1,2,2]
+Output: 3
+Explanation: We can pick from trees [1,2,2].
+If we had started at the first tree, we would only pick from trees [0,1].
+
+
+Example 3:
+
+
+Input: fruits = [1,2,3,2,2]
+Output: 4
+Explanation: We can pick from trees [2,3,2,2].
+If we had started at the first tree, we would only pick from trees [1,2].
+
+
+
+Constraints:
+
+
+ 1 <= fruits.length <= 1050 <= fruits[i] < fruits.length
+Related Topics
ArrayHash TableSliding Window
👍 919👎 69
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P923ThreeSumWithMultiplicity.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P923ThreeSumWithMultiplicity.md
new file mode 100644
index 0000000..9bc9d69
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P923ThreeSumWithMultiplicity.md
@@ -0,0 +1,38 @@
+Given an integer array arr, and an integer target, return the number of tuples i, j, k such that i < j < k and arr[i] + arr[j] + arr[k] == target.
+
+As the answer can be very large, return it modulo 109 + 7.
+
+
+Example 1:
+
+
+Input: arr = [1,1,2,2,3,3,4,4,5,5], target = 8
+Output: 20
+Explanation:
+Enumerating by the values (arr[i], arr[j], arr[k]):
+(1, 2, 5) occurs 8 times;
+(1, 3, 4) occurs 8 times;
+(2, 2, 4) occurs 2 times;
+(2, 3, 3) occurs 2 times.
+
+
+Example 2:
+
+
+Input: arr = [1,1,2,2,2,2], target = 5
+Output: 12
+Explanation:
+arr[i] = 1, arr[j] = arr[k] = 2 occurs 12 times:
+We choose one 1 from [1,1] in 2 ways,
+and two 2s from [2,2,2,2] in 6 ways.
+
+
+
+Constraints:
+
+
+ 3 <= arr.length <= 30000 <= arr[i] <= 1000 <= target <= 300
+Related Topics
ArrayHash TableTwo PointersSortingCounting
👍 1750👎 216
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P92ReverseLinkedListIi.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P92ReverseLinkedListIi.md
new file mode 100644
index 0000000..5eee49e
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P92ReverseLinkedListIi.md
@@ -0,0 +1,29 @@
+Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right, and return the reversed list.
+
+
+Example 1:
+
+
+Input: head = [1,2,3,4,5], left = 2, right = 4
+Output: [1,4,3,2,5]
+
+
+Example 2:
+
+
+Input: head = [5], left = 1, right = 1
+Output: [5]
+
+
+
+Constraints:
+
+
+ - The number of nodes in the list is
n.
+ 1 <= n <= 500-500 <= Node.val <= 5001 <= left <= right <= n
+
+
+Follow up: Could you do it in one pass?Related Topics
Linked List
👍 5925👎 278
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P946ValidateStackSequences.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P946ValidateStackSequences.md
new file mode 100644
index 0000000..9114c5d
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P946ValidateStackSequences.md
@@ -0,0 +1,34 @@
+Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result of a sequence of push and pop operations on an initially empty stack, or false otherwise.
+
+
+Example 1:
+
+
+Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
+Output: true
+Explanation: We might do the following sequence:
+push(1), push(2), push(3), push(4),
+pop() -> 4,
+push(5),
+pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1
+
+
+Example 2:
+
+
+Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
+Output: false
+Explanation: 1 cannot be popped before 2.
+
+
+
+Constraints:
+
+
+ 1 <= pushed.length <= 10000 <= pushed[i] <= 1000- All the elements of
pushed are unique.
+ popped.length == pushed.lengthpopped is a permutation of pushed.
+Related Topics
ArrayStackSimulation
👍 3123👎 54
\ No newline at end of file
diff --git a/src/leetcode/stack/leetcode/editor/en/doc/content/P977SquaresOfASortedArray.md b/src/leetcode/stack/leetcode/editor/en/doc/content/P977SquaresOfASortedArray.md
new file mode 100644
index 0000000..c57b233
--- /dev/null
+++ b/src/leetcode/stack/leetcode/editor/en/doc/content/P977SquaresOfASortedArray.md
@@ -0,0 +1,30 @@
+Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
+
+
+Example 1:
+
+
+Input: nums = [-4,-1,0,3,10]
+Output: [0,1,9,16,100]
+Explanation: After squaring, the array becomes [16,1,0,9,100].
+After sorting, it becomes [0,1,9,16,100].
+
+
+Example 2:
+
+
+Input: nums = [-7,-3,2,3,11]
+Output: [4,9,9,49,121]
+
+
+
+Constraints:
+
+
+ 1 <= nums.length <= 104-104 <= nums[i] <= 104nums is sorted in non-decreasing order.
+
+
+Follow up: Squaring each element and sorting the new array is very trivial, could you find an O(n) solution using a different approach?Related Topics
ArrayTwo PointersSorting
👍 5054👎 148
\ No newline at end of file